Головна сторінка Огляд Довідка
Реєстрація Увійти
oleg
/
monaco-editor
дзеркало https://github.com/microsoft/monaco-editor.git
1
0
Відгалуження 0
Файли Проблеми 0 Wiki
Переглянути джерело

Do not duplicate samples

Alex Dima 3 роки тому
батько
d33ec7c209
коміт
979d6a1b26
78 змінених файлів з 20 додано та 7637 видалено
Розділений вигляд Показати статистику Diff
  1. 19 1
      build/simpleserver.js
  2. 0 35
      test/manual/2040/iframe.html
  3. 0 22
      test/manual/2040/iframe.js
  4. 0 42
      test/manual/2040/index.html
  5. 0 67
      test/manual/2096/index.html
  6. 1 1
      test/manual/samples-all.generated.js
  7. 0 29
      test/manual/samples/sample.abap.txt
  8. 0 38
      test/manual/samples/sample.aes.txt
  9. 0 7
      test/manual/samples/sample.apex.txt
  10. 0 5
      test/manual/samples/sample.azcli.txt
  11. 0 13
      test/manual/samples/sample.bat.txt
  12. 0 29
      test/manual/samples/sample.bicep.txt
  13. 0 3463
      test/manual/samples/sample.c.txt
  14. 0 17
      test/manual/samples/sample.cameligo.txt
  15. 0 54
      test/manual/samples/sample.clojure.txt
  16. 0 28
      test/manual/samples/sample.coffeescript.txt
  17. 0 246
      test/manual/samples/sample.cpp.txt
  18. 0 38
      test/manual/samples/sample.csharp.txt
  19. 0 1
      test/manual/samples/sample.csp.txt
  20. 0 828
      test/manual/samples/sample.css.txt
  21. 0 37
      test/manual/samples/sample.dart.txt
  22. 0 32
      test/manual/samples/sample.dockerfile.txt
  23. 0 80
      test/manual/samples/sample.elixir.txt
  24. 0 8
      test/manual/samples/sample.fsharp.txt
  25. 0 111
      test/manual/samples/sample.go.txt
  26. 0 263
      test/manual/samples/sample.graphql.txt
  27. 0 31
      test/manual/samples/sample.handlebars.txt
  28. 0 48
      test/manual/samples/sample.hcl.txt
  29. 0 100
      test/manual/samples/sample.html.txt
  30. 0 15
      test/manual/samples/sample.ini.txt
  31. 0 54
      test/manual/samples/sample.java.txt
  32. 0 214
      test/manual/samples/sample.javascript.txt
  33. 0 68
      test/manual/samples/sample.json.txt
  34. 0 23
      test/manual/samples/sample.julia.txt
  35. 0 28
      test/manual/samples/sample.kotlin.txt
  36. 0 46
      test/manual/samples/sample.less.txt
  37. 0 21
      test/manual/samples/sample.lex.txt
  38. 0 12
      test/manual/samples/sample.lua.txt
  39. 0 104
      test/manual/samples/sample.markdown.txt
  40. 0 13
      test/manual/samples/sample.mips.txt
  41. 0 1
      test/manual/samples/sample.msdax.txt
  42. 0 8
      test/manual/samples/sample.mysql.txt
  43. 0 52
      test/manual/samples/sample.objective-c.txt
  44. 0 28
      test/manual/samples/sample.pascal.txt
  45. 0 20
      test/manual/samples/sample.pascaligo.txt
  46. 0 18
      test/manual/samples/sample.perl.txt
  47. 0 8
      test/manual/samples/sample.pgsql.txt
  48. 0 82
      test/manual/samples/sample.php.txt
  49. 0 9
      test/manual/samples/sample.plaintext.txt
  50. 0 64
      test/manual/samples/sample.postiats.txt
  51. 0 12
      test/manual/samples/sample.powerquery.txt
  52. 0 30
      test/manual/samples/sample.powershell.txt
  53. 0 18
      test/manual/samples/sample.pug.txt
  54. 0 13
      test/manual/samples/sample.python.txt
  55. 0 41
      test/manual/samples/sample.r.txt
  56. 0 46
      test/manual/samples/sample.razor.txt
  57. 0 4
      test/manual/samples/sample.redis.txt
  58. 0 9
      test/manual/samples/sample.redshift.txt
  59. 0 26
      test/manual/samples/sample.restructuredtext.txt
  60. 0 21
      test/manual/samples/sample.ruby.txt
  61. 0 29
      test/manual/samples/sample.rust.txt
  62. 0 10
      test/manual/samples/sample.sb.txt
  63. 0 53
      test/manual/samples/sample.scala.txt
  64. 0 105
      test/manual/samples/sample.scheme.txt
  65. 0 37
      test/manual/samples/sample.scss.txt
  66. 0 42
      test/manual/samples/sample.shell.txt
  67. 0 139
      test/manual/samples/sample.sol.txt
  68. 0 52
      test/manual/samples/sample.sql.txt
  69. 0 34
      test/manual/samples/sample.st.txt
  70. 0 50
      test/manual/samples/sample.swift.txt
  71. 0 28
      test/manual/samples/sample.systemverilog.txt
  72. 0 18
      test/manual/samples/sample.tcl.txt
  73. 0 12
      test/manual/samples/sample.twig.txt
  74. 0 124
      test/manual/samples/sample.typescript.txt
  75. 0 59
      test/manual/samples/sample.vb.txt
  76. 0 35
      test/manual/samples/sample.verilog.txt
  77. 0 14
      test/manual/samples/sample.xml.txt
  78. 0 14
      test/manual/samples/sample.yaml.txt

+ 19 - 1
build/simpleserver.js
Переглянути файл 

@@ -21,7 +21,7 @@ createSimpleServer(SERVER_ROOT, 8088);
 
 
 function generateTestSamplesTask() {
 
 	const sampleNames = fs.readdirSync(path.join(REPO_ROOT, 'test/manual/samples'));
 
-	const samples = sampleNames.map((sampleName) => {
 
+	let samples = sampleNames.map((sampleName) => {
 
 		const samplePath = path.join(REPO_ROOT, 'test/manual/samples', sampleName);
 
 		const sampleContent = fs.readFileSync(samplePath).toString();
 
 		return {
 
@@ -29,6 +29,24 @@ function generateTestSamplesTask() {
 
 			content: sampleContent
 
 		};
 
 	});
 
+
 
+	// Add samples from website
 
+	{
 
+		let sampleNames = fs.readdirSync(path.join(REPO_ROOT, 'website/index/samples'));
 
+		sampleNames = sampleNames.filter((name) => /^sample/.test(name));
 
+
 
+		samples = samples.concat(
 
+			sampleNames.map((sampleName) => {
 
+				const samplePath = path.join(REPO_ROOT, 'website/index/samples', sampleName);
 
+				const sampleContent = fs.readFileSync(samplePath).toString();
 
+				return {
 
+					name: sampleName,
 
+					content: sampleContent
 
+				};
 
+			})
 
+		);
 
+	}
 
+
 
 	const prefix =
 
 		'//This is a generated file via `npm run simpleserver`\ndefine([], function() { return';
 
 	const suffix = '; });';

+ 0 - 35
test/manual/2040/iframe.html
Переглянути файл 

@@ -1,35 +0,0 @@
 
-<!DOCTYPE html>
 
-<html>
 
-	<head>
 
-		<meta http-equiv="Content-Type" content="text/html;charset=utf-8" />
 
-		<style>
 
-			html,
 
-			body {
 
-				height: 100%;
 
-			}
 
-
 
-			body {
 
-				margin: 0;
 
-				overflow: hidden;
 
-			}
 
-
 
-			#container {
 
-				position: fixed;
 
-				top: 0;
 
-				left: 0;
 
-				bottom: 0;
 
-				right: 0;
 
-			}
 
-
 
-			.dev-setup-control {
 
-				display: none;
 
-			}
 
-		</style>
 
-	</head>
 
-	<body>
 
-		<div id="container"></div>
 
-		<script src="../../../metadata.js"></script>
 
-		<script src="../dev-setup.js"></script>
 
-		<script src="iframe.js"></script>
 
-	</body>
 
-</html>

+ 0 - 22
test/manual/2040/iframe.js
Переглянути файл 

@@ -1,22 +0,0 @@
 
-const init = () => {
 
-	loadEditor(function () {
 
-		// create the editor
 
-		const target = document.getElementById('container');
 
-		const editor = monaco.editor.create(target, { language: 'html' });
 
-
 
-		// load some sample data
 
-		(async () => {
 
-			const response = await fetch('https://microsoft.github.io/monaco-editor/');
 
-			const html = await response.text();
 
-			editor.getModel().setValue(html);
 
-		})();
 
-	});
 
-};
 
-
 
-window.addEventListener('DOMContentLoaded', () => {
 
-	if (!window.innerWidth || !window.innerHeight) {
 
-		window.addEventListener('resize', init, { once: true });
 
-	} else {
 
-		init();
 
-	}
 
-});

+ 0 - 42
test/manual/2040/index.html
Переглянути файл 

@@ -1,42 +0,0 @@
 
-<!DOCTYPE html>
 
-<html>
 
-	<head>
 
-		<script type="module">
 
-			class MonacoEditorElement extends HTMLElement {
 
-				constructor() {
 
-					super();
 
-					this.style = 'display: block;';
 
-					const shadow = this.attachShadow({ mode: 'open' });
 
-					const iframe = document.createElement('iframe');
 
-					iframe.src = new URL('iframe.html?editor=src', import.meta.url).href;
 
-					iframe.style = `width: 100%; height: 100%;`;
 
-					shadow.appendChild(iframe);
 
-				}
 
-			}
 
-
 
-			customElements.define('monaco-editor', MonacoEditorElement);
 
-		</script>
 
-		<style>
 
-			section {
 
-				margin: 80px;
 
-			}
 
-
 
-			iframe,
 
-			monaco-editor {
 
-				width: 640px;
 
-				height: 400px;
 
-			}
 
-		</style>
 
-	</head>
 
-	<body>
 
-		<section>
 
-			<h1>Monaco in a shadowRoot + iframe context</h1>
 
-			<monaco-editor></monaco-editor>
 
-		</section>
 
-		<hr />
 
-		<section>
 
-			<h1>Monaco in an iframe context</h1>
 
-			<iframe src="iframe.html?editor=src"></iframe>
 
-		</section>
 
-	</body>
 
-</html>

+ 0 - 67
test/manual/2096/index.html
Переглянути файл 

@@ -1,67 +0,0 @@
 
-<!DOCTYPE html>
 
-<html>
 
-	<head>
 
-		<title>Editor in tiny iframe</title>
 
-
 
-		<style>
 
-			#myIframe {
 
-				border: 1px solid pink;
 
-			}
 
-		</style>
 
-	</head>
 
-
 
-	<body>
 
-		<h2>Monaco Editor inside iframes sample</h2>
 
-
 
-		<br />
 
-		<br />
 
-		<iframe id="myIframe"></iframe>
 
-		<br />
 
-		<script>
 
-			var myIframe = document.getElementById('myIframe');
 
-			myIframe.style.width = '400px';
 
-			myIframe.style.height = '100px';
 
-			myIframe.style.display = 'block';
 
-			myIframe.style.visibility = 'visible';
 
-			const longText = `function x() {\n\tconsole.log("Hello world!");\n}function x()
 
-			{\n\tconsole.log("Hello world!");\n}function x() {\n\tconsole.log("Hello world!");\n}function x()
 
-			{\n\tconsole.log("Hello world!");\n}function x() {\n\tconsole.log("Hello world!");\n}function x()
 
-			{\n\tconsole.log("Hello world!");\n}function x() {\n\tconsole.log("Hello world!");\n}function x()
 
-			{\n\tconsole.log("Hello world!");\n}function x() {\n\tconsole.log("Hello world!");\n}function x()
 
-			{\n\tconsole.log("Hello world!");\n}function x() {\n\tconsole.log("Hello world!");\n}function x()
 
-			{\n\tconsole.log("Hello world!");\n}function x() {\n\tconsole.log("Hello world!");\n}function x()
 
-			{\n\tconsole.log("Hello world!");\n}function x() {\n\tconsole.log("Hello world!");\n}function x()
 
-			{\n\tconsole.log("Hello world!");\n}function x() {\n\tconsole.log("Hello world!");\n}function x()
 
-			{\n\tconsole.log("Hello world!");\n}function x() {\n\tconsole.log("Hello world!");\n}function x()
 
-			{\n\tconsole.log("Hello world!");\n}`;
 
-			const iframeDoc = myIframe.contentDocument;
 
-			const iframeWin = myIframe.contentWindow;
 
-			const injectSourceFiles = function () {
 
-				iframeWin.require.config({
 
-					paths: {
 
-						vs: '/vscode/out/vs'
 
-					}
 
-				});
 
-
 
-				iframeWin.require(['vs/editor/editor.main'], function () {
 
-					const container = iframeDoc.createElement('div');
 
-					container.setAttribute('id', 'container');
 
-					container.style.height = '100vh';
 
-					iframeDoc.body.appendChild(container);
 
-					var editor = iframeWin.monaco.editor.create(iframeDoc.getElementById('container'), {
 
-						value: longText,
 
-						language: 'javascript'
 
-					});
 
-
 
-					iframeWin.onresize = function () {
 
-						editor.layout();
 
-					};
 
-				});
 
-			};
 
-			const script = iframeDoc.createElement('script');
 
-			script.src = '/vscode/out/vs/loader.js';
 
-			script.onload = injectSourceFiles;
 
-			iframeDoc.head.appendChild(script);
 
-		</script>
 
-	</body>
 
-</html>

+ 1 - 1
test/manual/samples-all.generated.js
Переглянути файл 

@@ -94,7 +94,7 @@ define([], function() { return[
 
 	},
 
 	{
 
 		"name": "sample.csharp.txt",
 
-		"content": "/*\r\n* C# Program to Display All the Prime Numbers Between 1 to 100\r\n*/\r\n\r\nusing System;\r\nusing System.Collections.Generic;\r\nusing System.Linq;\r\nusing System.Text;\r\n\r\nnamespace VS\r\n{\r\n\tclass Program\r\n\t{\r\n\t\tstatic void Main(string[] args)\r\n    \t\t{\r\n\t\t\tbool isPrime = true;\r\n\t\t\tConsole.WriteLine(\"Prime Numbers : \");\r\n\t\t\tfor (int i = 2; i <= 100; i++)\r\n\t\t\t{\r\n\t\t\t\tfor (int j = 2; j <= 100; j++)\r\n\t\t\t\t{\r\n\t\t\t\t\tif (i != j && i % j == 0)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tisPrime = false;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif (isPrime)\r\n\t\t\t\t{\r\n\t\t\t\t\tConsole.Write(\"\\t\" +i);\r\n\t\t\t\t}\r\n\t\t\t\tisPrime = true;\r\n\t\t\t}\r\n\t\t\tConsole.ReadKey();\r\n\t\t}\r\n\t}\r\n}\r\n"
 
+		"content": "/*\r\n* C# Program to Display All the Prime Numbers Between 1 to 100\r\n*/\r\n\r\nusing System;\r\nusing System.Collections.Generic;\r\nusing System.Linq;\r\nusing System.Text;\r\n\r\nnamespace VS\r\n{\r\n\tclass Program\r\n\t{\r\n\t\tstatic void Main(string[] args)\r\n\t\t{\r\n\t\t\tbool isPrime = true;\r\n\t\t\tConsole.WriteLine(\"Prime Numbers : \");\r\n\t\t\tfor (int i = 2; i <= 100; i++)\r\n\t\t\t{\r\n\t\t\t\tfor (int j = 2; j <= 100; j++)\r\n\t\t\t\t{\r\n\t\t\t\t\tif (i != j && i % j == 0)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tisPrime = false;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif (isPrime)\r\n\t\t\t\t{\r\n\t\t\t\t\tConsole.Write(\"\\t\" +i);\r\n\t\t\t\t}\r\n\t\t\t\tisPrime = true;\r\n\t\t\t}\r\n\t\t\tConsole.ReadKey();\r\n\t\t}\r\n\t}\r\n}\r\n"
 
 	},
 
 	{
 
 		"name": "sample.csp.txt",

+ 0 - 29
test/manual/samples/sample.abap.txt
Переглянути файл 

@@ -1,29 +0,0 @@
 
-REPORT zrosetta_base64_encode_data.
 
-
 
-DATA: li_client  TYPE REF TO if_http_client,
 
-      lv_encoded TYPE string,
 
-      lv_data    TYPE xstring.
 
-
 
-
 
-cl_http_client=>create_by_url(
 
-  EXPORTING
 
-    url    = 'http://rosettacode.org/favicon.ico'
 
-  IMPORTING
 
-    client = li_client ).
 
-
 
-li_client->send( ).
 
-li_client->receive( ).
 
-
 
-lv_data = li_client->response->get_data( ).
 
-
 
-CALL FUNCTION 'SSFC_BASE64_ENCODE'
 
-  EXPORTING
 
-    bindata = lv_data
 
-  IMPORTING
 
-    b64data = lv_encoded.
 
-
 
-WHILE strlen( lv_encoded ) > 100.
 
-  WRITE: / lv_encoded(100).
 
-  lv_encoded = lv_encoded+100.
 
-ENDWHILE.
 
-WRITE: / lv_encoded.

+ 0 - 38
test/manual/samples/sample.aes.txt
Переглянути файл 

@@ -1,38 +0,0 @@
 
-// Contract simulating developers organization
 
-contract HackBG =
 
-
 
-    record state = { developers: map(address, developer) }
 
-
 
-    record developer = { name: string
 
-                       , age: int
 
-                       , skillset: map(skill, experience) }
 
-
 
-    type skill = string
 
-    type experience = int
 
-
 
-    datatype event =
 
-          LogDeveloperAdded(indexed address, indexed int, string)
 
-
 
-    entrypoint init() : state = { developers = {} }
 
-
 
-    stateful entrypoint dev_add(account: address, dev_name: string, dev_age: int) =
 
-        require(!is_member(account), "ERROR_DEVELOPER_ALREADY_EXISTS")
 
-        let dev : developer = { name = dev_name
 
-                              , age = dev_age
 
-                              , skillset = {} }
 
-        put(state{ developers[account] = dev })
 
-        Chain.event(LogDeveloperAdded(account, Chain.timestamp, dev_name))
 
-
 
-    stateful entrypoint dev_update(account: address, dev_name: string, dev_age: int) =
 
-        require(is_member(account), "ERROR_DEVELOPER_DOES_NOT_EXIST")
 
-        put(state{ developers[account].name = dev_name })
 
-        put(state{ developers[account].age = dev_age })
 
-
 
-    function is_member(account: address) : bool =
 
-        Map.member(account, state.developers)
 
-
 
-    stateful entrypoint dev_skill_modify(account: address, skill: string, experience: int) =
 
-        put(state{ developers[account].skillset[skill] = experience })
 
-
 
-    entrypoint dev_get(account: address) : developer =
 
-        state.developers[account]

+ 0 - 7
test/manual/samples/sample.apex.txt
Переглянути файл 

@@ -1,7 +0,0 @@
 
-/* Using a single database query, find all the leads in
 
-    the database that have the same email address as any
 
-    of the leads being inserted or updated. */
 
-for (Lead lead : [SELECT Email FROM Lead WHERE Email IN :leadMap.KeySet()]) {
 
-    Lead newLead = leadMap.get(lead.Email);
 
-    newLead.Email.addError('A lead with this email address already exists.');
 
-}

+ 0 - 5
test/manual/samples/sample.azcli.txt
Переглянути файл 

@@ -1,5 +0,0 @@
 
-# Create a resource group.
 
-az group create --name myResourceGroup --location westeurope
 
-
 
-# Create a new virtual machine, this creates SSH keys if not present.
 
-az vm create --resource-group myResourceGroup --name myVM --image UbuntuLTS --generate-ssh-keys

+ 0 - 13
test/manual/samples/sample.bat.txt
Переглянути файл 

@@ -1,13 +0,0 @@
 
-rem *******Begin Comment**************
 
-rem This program starts the superapp batch program on the network,
 
-rem directs the output to a file, and displays the file
 
-rem in Notepad.
 
-rem *******End Comment**************
 
-@echo off
 
-if exist C:\output.txt goto EMPTYEXISTS
 
-setlocal
 
-	path=g:\programs\superapp;%path%
 
-	call superapp>C:\output.txt
 
-endlocal
 
-:EMPTYEXISTS
 
-start notepad c:\output.txt

+ 0 - 29
test/manual/samples/sample.bicep.txt
Переглянути файл 

@@ -1,29 +0,0 @@
 
-targetScope = 'subscription'
 
-
 
-param deployStorage bool = true
 
-
 
-@description('The object ID of the principal that will get the role assignment')
 
-param aadPrincipalId string
 
-
 
-module stg './storage.bicep' = if(deployStorage) {
 
-  name: 'storageDeploy'
 
-  scope: resourceGroup('another-rg') // this will target another resource group in the same subscription
 
-  params: {
 
-    storageAccountName: '<YOURUNIQUESTORAGENAME>'
 
-  }
 
-}
 
-
 
-var contributor = 'b24988ac-6180-42a0-ab88-20f7382dd24c'
 
-resource roleDef 'Microsoft.Authorization/roleDefinitions@2018-01-01-preview' existing = {
 
-  name: contributor
 
-}
 
-
 
-resource rbac 'Microsoft.Authorization/roleAssignments@2020-04-01-preview' = {
 
-  name: guid(subscription().id, aadPrincipalId, contributor)
 
-  properties: {
 
-    roleDefinitionId: roleDef.id
 
-    principalId: aadPrincipalId
 
-  }
 
-}
 
-
 
-output storageName array = stg.outputs.containerProps

+ 0 - 3463
test/manual/samples/sample.c.txt
Переглянути файл 

@@ -1,3463 +0,0 @@
 
-// Copyright (c) Microsoft. All rights reserved.
 
-// Licensed under the MIT license. See LICENSE file in the project root for full
 
-// license information.
 
-
 
-/*
 
- *	COMMAND LINE: -Ox -Gz -YX -UPROTOTYPES_REQUIRED
 
- */
 
-
 
-#pragma warning(disable : 4532)
 
-#pragma warning(disable : 4702)
 
-
 
-#if defined(_WIN32)
 
-
 
-#if defined(_M_SH)
 
-#define WIN_CE
 
-#endif
 
-
 
-#if defined(_M_AMD64)
 
-#define NEST_IN_FINALLY /* allow when __try nested in __finally OK */
 
-#endif
 
-
 
-#define NTSTATUS LONG
 
-#define EXCEPTION_NESTED_CALL 0x10
 
-#define RtlRaiseStatus(x) RaiseException((x), 0, 0, NULL)
 
-#define RtlRaiseException(x)                                                   \
 
-  RaiseException((x)->ExceptionCode, (x)->ExceptionFlags,                      \
 
-                 (x)->NumberParameters, (x)->ExceptionInformation)
 
-#define IN
 
-#define OUT
 
-#if !(defined(_M_IA64) || defined(_M_ALPHA) || defined(_M_PPC) ||              \
 
-      defined(_M_AMD64) || defined(_M_ARM) || defined(_M_ARM64))
 
-#define i386 1
 
-#endif
 
-#define try __try
 
-#define except __except
 
-#define finally __finally
 
-#define leave __leave
 
-
 
-#endif
 
-
 
-#define WIN32_LEAN_AND_MEAN
 
-
 
-#include "stdio.h"
 
-#if defined(_M_IA64) || defined(_M_ALPHA) || defined(_M_PPC) ||                \
 
-    defined(_M_AMD64) || defined(_M_ARM) || defined(_M_ARM64)
 
-#include "setjmpex.h"
 
-#else
 
-#include "setjmp.h"
 
-#endif
 
-#include "float.h"
 
-#include "windows.h"
 
-#include "math.h"
 
-
 
-#if !defined(STATUS_SUCCESS)
 
-#define STATUS_SUCCESS 0
 
-#endif
 
-#if !defined(STATUS_UNSUCCESSFUL)
 
-#define STATUS_UNSUCCESSFUL ((NTSTATUS)0xC0000001L)
 
-#endif
 
-
 
-//
 
-// Define switch constants.
 
-//
 
-
 
-#define BLUE 0
 
-#define RED 1
 
-
 
-//
 
-// Define function prototypes.
 
-//
 
-
 
-VOID addtwo(IN LONG First, IN LONG Second, IN PLONG Place);
 
-
 
-VOID bar1(IN NTSTATUS Status, IN PLONG Counter);
 
-
 
-VOID bar2(IN PLONG BlackHole, IN PLONG BadAddress, IN PLONG Counter);
 
-
 
-VOID dojump(IN jmp_buf JumpBuffer, IN PLONG Counter);
 
-
 
-LONG Echo(IN LONG Value);
 
-
 
-#if !defined(WIN_CE) // return through finally not allowed on WinCE
 
-VOID eret(IN NTSTATUS Status, IN PLONG Counter);
 
-#endif
 
-
 
-VOID except1(IN PLONG Counter);
 
-
 
-ULONG
 
-except2(IN PEXCEPTION_POINTERS ExceptionPointers, IN PLONG Counter);
 
-
 
-ULONG
 
-except3(IN PEXCEPTION_POINTERS ExceptionPointers, IN PLONG Counter);
 
-
 
-VOID foo1(IN NTSTATUS Status);
 
-
 
-VOID foo2(IN PLONG BlackHole, IN PLONG BadAddress);
 
-
 
-#if !defined(WIN_CE) // return from finally not allowed on WinCE
 
-VOID fret(IN PLONG Counter);
 
-#endif
 
-
 
-BOOLEAN
 
-Tkm(VOID);
 
-
 
-VOID Test61Part2(IN OUT PULONG Counter);
 
-
 
-double SquareDouble(IN double op);
 
-
 
-DECLSPEC_NOINLINE
 
-ULONG
 
-PgFilter(VOID)
 
-
 
-{
 
-
 
-  printf("filter entered...");
 
-  return EXCEPTION_EXECUTE_HANDLER;
 
-}
 
-
 
-#pragma warning(push)
 
-#pragma warning(disable : 4532)
 
-
 
-VOID PgTest69(IN PLONG State, IN PLONG Fault)
 
-
 
-{
 
-
 
-  try {
 
-    try {
 
-      *Fault += 1;
 
-    }
 
-    finally {
 
-      if (AbnormalTermination()) {
 
-        if (*State == 1) {
 
-          *State += 1;
 
-
 
-        } else {
 
-          *Fault += 1;
 
-        }
 
-      }
 
-    }
 
-  }
 
-  except(((*State += 1) == 1) ? PgFilter() : EXCEPTION_CONTINUE_SEARCH) {
 
-    if (*State != 2) {
 
-      *Fault += 1;
 
-    }
 
-  }
 
-
 
-  return;
 
-}
 
-
 
-VOID PgTest70(IN PLONG State, IN PLONG Fault)
 
-
 
-{
 
-
 
-  try {
 
-    try {
 
-      *Fault += 1;
 
-    }
 
-    finally {
 
-      if (AbnormalTermination()) {
 
-        if (*State == 2) {
 
-          PgFilter();
 
-          return;
 
-
 
-        } else {
 
-          *Fault += 1;
 
-        }
 
-      }
 
-    }
 
-  }
 
-  except(((*State += 2) == 2) ? EXCEPTION_EXECUTE_HANDLER
 
-                              : EXCEPTION_CONTINUE_SEARCH) {
 
-    *Fault += 1;
 
-  }
 
-
 
-  return;
 
-}
 
-
 
-VOID PgTest71(IN PLONG State, IN PLONG Fault)
 
-
 
-{
 
-
 
-  try {
 
-    try {
 
-      try {
 
-        *Fault += 1;
 
-      }
 
-      finally {
 
-        if (AbnormalTermination()) {
 
-          if (*State == 3) {
 
-            *State += 3;
 
-            return;
 
-
 
-          } else {
 
-            *Fault += 1;
 
-          }
 
-        }
 
-      }
 
-    }
 
-    finally {
 
-      if (AbnormalTermination()) {
 
-        if (*State == 6) {
 
-          *State += 3;
 
-
 
-        } else {
 
-          *Fault += 1;
 
-        }
 
-      }
 
-    }
 
-  }
 
-  except(((*State += 3) == 3) ? PgFilter() : EXCEPTION_CONTINUE_SEARCH) {
 
-    *Fault += 1;
 
-  }
 
-
 
-  return;
 
-}
 
-
 
-VOID PgTest72(IN PLONG State, IN PLONG Fault)
 
-
 
-{
 
-
 
-  try {
 
-    try {
 
-      try {
 
-        *Fault += 1;
 
-      }
 
-      finally {
 
-        if (AbnormalTermination()) {
 
-          if (*State == 4) {
 
-            *State += 4;
 
-            return;
 
-
 
-          } else {
 
-            *Fault += 1;
 
-          }
 
-        }
 
-      }
 
-    }
 
-    finally {
 
-      if (AbnormalTermination()) {
 
-        if (*State == 8) {
 
-          *State += 4;
 
-          PgFilter();
 
-
 
-        } else {
 
-          *Fault += 1;
 
-        }
 
-      }
 
-    }
 
-  }
 
-  except(((*State += 4) == 4) ? EXCEPTION_EXECUTE_HANDLER
 
-                              : EXCEPTION_CONTINUE_SEARCH) {
 
-    *Fault += 1;
 
-  }
 
-
 
-  return;
 
-}
 
-
 
-VOID PgTest73(IN PLONG State, IN PLONG Fault)
 
-
 
-{
 
-
 
-  try {
 
-    try {
 
-      try {
 
-        *Fault += 1;
 
-      }
 
-      finally {
 
-        if (AbnormalTermination()) {
 
-          if (*State == 5) {
 
-            *State += 5;
 
-
 
-          } else {
 
-            *Fault += 1;
 
-          }
 
-        }
 
-      }
 
-    }
 
-    finally {
 
-      if (AbnormalTermination()) {
 
-        if (*State == 10) {
 
-          *State += 5;
 
-          return;
 
-
 
-        } else {
 
-          *Fault += 1;
 
-        }
 
-      }
 
-    }
 
-  }
 
-  except(((*State += 5) == 5) ? PgFilter() : EXCEPTION_CONTINUE_SEARCH) {
 
-    *Fault += 1;
 
-  }
 
-
 
-  return;
 
-}
 
-
 
-VOID PgTest74(IN PLONG State, IN PLONG Fault)
 
-
 
-{
 
-
 
-  try {
 
-    try {
 
-      try {
 
-        *Fault += 1;
 
-      }
 
-      finally {
 
-        if (AbnormalTermination()) {
 
-          if (*State == 6) {
 
-            *State += 6;
 
-
 
-          } else {
 
-            *Fault += 1;
 
-          }
 
-        }
 
-      }
 
-    }
 
-    finally {
 
-      if (AbnormalTermination()) {
 
-        if (*State == 12) {
 
-          *State += 6;
 
-          PgFilter();
 
-          return;
 
-
 
-        } else {
 
-          *Fault += 1;
 
-        }
 
-      }
 
-    }
 
-  }
 
-  except(((*State += 6) == 6) ? EXCEPTION_EXECUTE_HANDLER
 
-                              : EXCEPTION_CONTINUE_SEARCH) {
 
-    *Fault += 1;
 
-  }
 
-
 
-  return;
 
-}
 
-
 
-VOID PgTest75(IN PLONG State, IN PLONG Fault)
 
-
 
-{
 
-
 
-  try {
 
-    try {
 
-      try {
 
-        try {
 
-          *Fault += 1;
 
-        }
 
-        finally {
 
-          if (AbnormalTermination()) {
 
-            if (*State == 7) {
 
-              *State += 7;
 
-              *Fault += 1;
 
-
 
-            } else {
 
-              *State += 10;
 
-            }
 
-          }
 
-        }
 
-      }
 
-      except(((*State += 7) == 7) ? EXCEPTION_EXECUTE_HANDLER
 
-                                  : EXCEPTION_CONTINUE_SEARCH) {
 
-        *Fault += 1;
 
-      }
 
-    }
 
-    finally {
 
-      if (AbnormalTermination()) {
 
-        if (*State == 28) {
 
-          *State += 7;
 
-          return;
 
-
 
-        } else {
 
-          *Fault += 1;
 
-        }
 
-      }
 
-    }
 
-  }
 
-  except(((*State += 7) == 28) ? PgFilter() : EXCEPTION_CONTINUE_SEARCH) {
 
-    *Fault += 1;
 
-  }
 
-
 
-  return;
 
-}
 
-
 
-VOID PgTest76(IN PLONG State, IN PLONG Fault)
 
-
 
-{
 
-
 
-  try {
 
-    try {
 
-      try {
 
-        try {
 
-          *Fault += 1;
 
-        }
 
-        finally {
 
-          if (AbnormalTermination()) {
 
-            if (*State == 8) {
 
-              *State += 8;
 
-              *Fault += 1;
 
-
 
-            } else {
 
-              *State += 10;
 
-            }
 
-          }
 
-        }
 
-      }
 
-      except(((*State += 8) == 8) ? EXCEPTION_EXECUTE_HANDLER
 
-                                  : EXCEPTION_CONTINUE_SEARCH) {
 
-        *Fault += 1;
 
-      }
 
-    }
 
-    finally {
 
-      if (AbnormalTermination()) {
 
-        if (*State == 32) {
 
-          *State += 8;
 
-          PgFilter();
 
-          return;
 
-
 
-        } else {
 
-          *Fault += 1;
 
-        }
 
-      }
 
-    }
 
-  }
 
-  except(((*State += 8) == 32) ? EXCEPTION_EXECUTE_HANDLER
 
-                               : EXCEPTION_CONTINUE_SEARCH) {
 
-    *Fault += 1;
 
-  }
 
-
 
-  return;
 
-}
 
-
 
-VOID PgTest77(IN PLONG State, IN PLONG Fault)
 
-
 
-{
 
-
 
-  try {
 
-    try {
 
-      try {
 
-        try {
 
-          *Fault += 1;
 
-        }
 
-        finally {
 
-          if (AbnormalTermination()) {
 
-            if (*State == 9) {
 
-              *State += 9;
 
-              *Fault += 1;
 
-
 
-            } else {
 
-              *State += 10;
 
-            }
 
-          }
 
-        }
 
-      }
 
-      except(((*State += 9) == 9) ? PgFilter() : EXCEPTION_CONTINUE_SEARCH) {
 
-        *Fault += 1;
 
-      }
 
-    }
 
-    finally {
 
-      if (AbnormalTermination()) {
 
-        if (*State == 36) {
 
-          *State += 9;
 
-          return;
 
-
 
-        } else {
 
-          *Fault += 1;
 
-        }
 
-      }
 
-    }
 
-  }
 
-  except(((*State += 9) == 36) ? EXCEPTION_EXECUTE_HANDLER
 
-                               : EXCEPTION_CONTINUE_SEARCH) {
 
-    *Fault += 1;
 
-  }
 
-
 
-  return;
 
-}
 
-
 
-VOID PgTest78(IN PLONG State, IN PLONG Fault)
 
-
 
-{
 
-
 
-  try {
 
-    try {
 
-      try {
 
-        try {
 
-          *Fault += 1;
 
-        }
 
-        finally {
 
-          if (AbnormalTermination()) {
 
-            if (*State == 10) {
 
-              *State += 10;
 
-              PgFilter();
 
-              *Fault += 1;
 
-
 
-            } else {
 
-              *State += 10;
 
-            }
 
-          }
 
-        }
 
-      }
 
-      except(((*State += 10) == 10) ? EXCEPTION_EXECUTE_HANDLER
 
-                                    : EXCEPTION_CONTINUE_SEARCH) {
 
-        *Fault += 1;
 
-      }
 
-    }
 
-    finally {
 
-      if (AbnormalTermination()) {
 
-        if (*State == 40) {
 
-          *State += 10;
 
-          return;
 
-
 
-        } else {
 
-          *Fault += 1;
 
-        }
 
-      }
 
-    }
 
-  }
 
-  except(((*State += 10) == 40) ? EXCEPTION_EXECUTE_HANDLER
 
-                                : EXCEPTION_CONTINUE_SEARCH) {
 
-    *Fault += 1;
 
-  }
 
-
 
-  return;
 
-}
 
-
 
-#pragma warning(pop)
 
-
 
-VOID Test79(PLONG Counter, PLONG Fault)
 
-
 
-{
 
-
 
-  try {
 
-    try {
 
-      try {
 
-        *Fault += 1;
 
-      }
 
-      finally {
 
-        printf("finally 1...");
 
-        *Fault += 1;
 
-      }
 
-    }
 
-    finally { printf("finally 2..."); }
 
-  }
 
-  except(*Counter += 1, printf("filter 1..."), EXCEPTION_CONTINUE_SEARCH) {}
 
-
 
-  return;
 
-}
 
-
 
-ULONG G;
 
-
 
-ULONG
 
-Test80(VOID)
 
-
 
-{
 
-
 
-  G = 1;
 
-  try {
 
-    while (G) {
 
-      try {
 
-        if (G == 10) {
 
-          return 1;
 
-        }
 
-
 
-        if (G == 1) {
 
-          continue;
 
-        }
 
-      }
 
-      finally { G = 0; }
 
-    }
 
-  }
 
-  finally { G = 10; }
 
-
 
-  return 0;
 
-}
 
-
 
-void Test81(int *pCounter) {
 
-  volatile char *AvPtr = NULL;
 
-
 
-  __try {
 
-    __try { *AvPtr = '\0'; }
 
-    __except(EXCEPTION_EXECUTE_HANDLER) { __leave; }
 
-  }
 
-  __finally {
 
-    printf("in finally ");
 
-    *pCounter += 1;
 
-  }
 
-  return;
 
-}
 
-
 
-DECLSPEC_NOINLINE
 
-VOID Test82Foo(VOID)
 
-
 
-{
 
-  *(volatile int *)0 = 0;
 
-}
 
-
 
-VOID Test82(__inout PLONG Counter)
 
-
 
-{
 
-
 
-  int retval = 1;
 
-
 
-  __try {
 
-    __try { Test82Foo(); }
 
-    __finally {
 
-      switch (*Counter) {
 
-      case 0:
 
-        printf("something failed!\n");
 
-        retval = 6;
 
-        break;
 
-
 
-      case 1:
 
-        retval = 0;
 
-        break;
 
-
 
-      case 2:
 
-        printf("how did you get here?\n");
 
-        retval = 2;
 
-        break;
 
-
 
-      case 3:
 
-        printf("what?!?\n");
 
-        retval = 3;
 
-        break;
 
-
 
-      case 4:
 
-        printf("not correct\n");
 
-        retval = 4;
 
-        break;
 
-
 
-      case 5:
 
-        printf("error!\n");
 
-        retval = 5;
 
-        break;
 
-      }
 
-    }
 
-  }
 
-  __except(1){}
 
-
 
-  *Counter = retval;
 
-  return;
 
-}
 
-
 
-LONG Test83(VOID)
 
-
 
-{
 
-
 
-  G = 1;
 
-  try {
 
-    try {
 
-      while (G) {
 
-        try {
 
-          if (G == 10) {
 
-            return 1;
 
-          }
 
-
 
-          if (G == 1) {
 
-            continue;
 
-          }
 
-        }
 
-        finally { G = 0; }
 
-      }
 
-    }
 
-    except(EXCEPTION_EXECUTE_HANDLER) { leave; }
 
-  }
 
-  finally { G = 10; }
 
-
 
-  return 0;
 
-}
 
-
 
-DECLSPEC_NOINLINE
 
-VOID Test84(_Inout_ PLONG Counter)
 
-
 
-{
 
-  volatile int *Fault = 0;
 
-
 
-  try {
 
-    try {
 
-      *Fault += 1;
 
-    }
 
-    except(EXCEPTION_EXECUTE_HANDLER) {
 
-      try {
 
-        return;
 
-      }
 
-      finally { *Counter += 1; }
 
-    }
 
-  }
 
-  finally {
 
-
 
-    if (AbnormalTermination()) {
 
-      *Counter += 1;
 
-    }
 
-  }
 
-
 
-  return;
 
-}
 
-
 
-DECLSPEC_NOINLINE
 
-LONG Test85(_Inout_ PLONG Counter)
 
-
 
-{
 
-  volatile int *Fault = 0;
 
-
 
-  G = 1;
 
-  try {
 
-    try {
 
-      try {
 
-        while (G) {
 
-          try {
 
-            try {
 
-              if (G == 10) {
 
-                return 1;
 
-              }
 
-              try {
 
-                *Counter += 1;
 
-              }
 
-              except(EXCEPTION_EXECUTE_HANDLER) {}
 
-
 
-              if (G == 1) {
 
-                continue;
 
-              }
 
-            }
 
-            finally {
 
-              G = 0;
 
-              *Counter += 1;
 
-              *Fault += 1;
 
-            }
 
-          }
 
-          except(EXCEPTION_EXECUTE_HANDLER) {
 
-            *Counter += 1;
 
-            leave;
 
-          }
 
-        }
 
-      }
 
-      finally {
 
-        G = 10;
 
-        *Counter += 1;
 
-        *Fault += 1;
 
-      }
 
-    }
 
-    except(EXCEPTION_EXECUTE_HANDLER) { *Counter += 1; }
 
-    *Counter += 1;
 
-  }
 
-  finally { *Counter += 1; }
 
-  return 1;
 
-}
 
-
 
-DECLSPEC_NOINLINE
 
-VOID Test86(_Inout_ PLONG Counter)
 
-
 
-{
 
-  volatile int *Fault = 0;
 
-
 
-  try {
 
-    try {
 
-      try {
 
-        try {
 
-          try {
 
-            try {
 
-              *Fault += 1;
 
-            }
 
-            except(printf("Filter1 %d..", *Counter),
 
-                   EXCEPTION_EXECUTE_HANDLER) {
 
-              try {
 
-                printf("Handler1 %d..", *Counter);
 
-                return;
 
-              }
 
-              finally {
 
-                printf("Finally1 %d..", *Counter);
 
-                *Counter += 1;
 
-              }
 
-            }
 
-          }
 
-          finally {
 
-            printf("Finally2 %d..", *Counter);
 
-            *Counter += 1;
 
-          }
 
-        }
 
-        except(EXCEPTION_EXECUTE_HANDLER) { leave; }
 
-      }
 
-      finally { *Counter += 1; }
 
-    }
 
-    except(EXCEPTION_EXECUTE_HANDLER) { leave; }
 
-  }
 
-  finally { *Counter += 1; }
 
-
 
-  return;
 
-}
 
-
 
-VOID Test87(_Inout_ PLONG Counter)
 
-
 
-/*++
 
-
 
-Routine Description:
 
-
 
-    This function verifies the behavior of nested exception dispatching.
 
-
 
-Arguments:
 
-
 
-    Counter - Supplies a pointer to the state counter.
 
-
 
-Return Value:
 
-    None.
 
-
 
---*/
 
-
 
-{
 
-  volatile int *Fault = 0;
 
-
 
-//
 
-// N.B.  Disabled on x86 due to failing test case with handling of returns
 
-//       in nested termination handlers on x86.
 
-//
 
-//       Disabled on ARM due to failing test case with handling of abutting
 
-//       termination handlers within an except handler.
 
-//
 
-//       Disabled on AMD64 due to failing test case with handling of
 
-//       abutting termination handlers within an except handler when a
 
-//       non-local goto is involved.
 
-//
 
-
 
-#if !defined(_X86_)
 
-  try {
 
-    try {
 
-      try {
 
-        try {
 
-          try {
 
-            *Fault += 1;
 
-
 
-            try {
 
-            }
 
-            finally {
 
-              if (AbnormalTermination()) {
 
-                *Fault += 1;
 
-              }
 
-            }
 
-          }
 
-          finally {
 
-
 
-            if (AbnormalTermination()) {
 
-              if ((*Counter += 13) == 26) {
 
-                return;
 
-
 
-              } else {
 
-                *Fault += 1;
 
-              }
 
-            }
 
-          }
 
-        }
 
-        finally {
 
-          if (AbnormalTermination()) {
 
-            *Counter += 13;
 
-            *Fault += 1;
 
-          }
 
-        }
 
-      }
 
-      except(((*Counter += 13) == 13) ? EXCEPTION_EXECUTE_HANDLER
 
-                                      : EXCEPTION_CONTINUE_SEARCH) {
 
-        *Fault += 1;
 
-      }
 
-    }
 
-    except(((*Counter += 13) == 65) ? EXCEPTION_EXECUTE_HANDLER
 
-                                    : EXCEPTION_CONTINUE_SEARCH) {
 
-      try {
 
-        *Counter += 13;
 
-        return;
 
-      }
 
-      finally {
 
-        if (AbnormalTermination()) {
 
-          *Counter += 13;
 
-          goto Finish;
 
-        }
 
-      }
 
-    }
 
-  }
 
-  finally {
 
-
 
-    if (AbnormalTermination()) {
 
-      if ((*Counter += 13) == 104) {
 
-        goto Finish;
 
-      }
 
-    }
 
-  }
 
-
 
-Finish:
 
-#else
 
-  *Counter = 104;
 
-#endif
 
-
 
-  return;
 
-}
 
-
 
-VOID Test88(_Inout_ PLONG Counter)
 
-
 
-{
 
-  volatile int *Fault = 0;
 
-
 
-  try {
 
-    try {
 
-      try {
 
-        try {
 
-          try {
 
-            try {
 
-              try {
 
-                try {
 
-                  *Fault += 1;
 
-                }
 
-                except(((*Counter += 1) == 1) ? *Fault
 
-                                              : EXCEPTION_CONTINUE_SEARCH) {}
 
-              }
 
-              except(*Counter += 1, EXCEPTION_EXECUTE_HANDLER) { *Fault += 2; }
 
-            }
 
-            except(*Counter += 1, EXCEPTION_CONTINUE_SEARCH) { leave; }
 
-          }
 
-          except(*Counter += 1, EXCEPTION_CONTINUE_SEARCH) { leave; }
 
-        }
 
-        except(EXCEPTION_EXECUTE_HANDLER) {}
 
-      }
 
-      except(EXCEPTION_EXECUTE_HANDLER) {}
 
-    }
 
-    except(EXCEPTION_EXECUTE_HANDLER) { leave; }
 
-  }
 
-  finally { *Counter += 1; }
 
-}
 
-
 
-int main(int argc, char *argv[])
 
-
 
-{
 
-
 
-  PLONG BadAddress;
 
-  PCHAR BadByte;
 
-  PLONG BlackHole;
 
-  ULONG Index1;
 
-  ULONG Index2 = RED;
 
-  jmp_buf JumpBuffer;
 
-  LONG Counter;
 
-  EXCEPTION_RECORD ExceptionRecord;
 
-  double doubleresult;
 
-
 
-  //
 
-  // Announce start of exception test.
 
-  //
 
-
 
-  printf("Start of exception test\n");
 
-
 
-  //
 
-  // Initialize exception record.
 
-  //
 
-
 
-  ExceptionRecord.ExceptionCode = STATUS_INTEGER_OVERFLOW;
 
-  ExceptionRecord.ExceptionFlags = 0;
 
-  ExceptionRecord.ExceptionRecord = NULL;
 
-  ExceptionRecord.NumberParameters = 0;
 
-
 
-  //
 
-  // Initialize pointers.
 
-  //
 
-
 
-  BadAddress = (PLONG)NULL;
 
-  BadByte = (PCHAR)NULL;
 
-  BadByte += 1;
 
-  BlackHole = &Counter;
 
-
 
-  //
 
-  // Simply try statement with a finally clause that is entered sequentially.
 
-  //
 
-
 
-  printf("    test1...");
 
-  Counter = 0;
 
-  try {
 
-    Counter += 1;
 
-  }
 
-  finally {
 
-    if (abnormal_termination() == FALSE) {
 
-      Counter += 1;
 
-    }
 
-  }
 
-
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Simple try statement with an exception clause that is never executed
 
-  // because there is no exception raised in the try clause.
 
-  //
 
-
 
-  printf("    test2...");
 
-  Counter = 0;
 
-  try {
 
-    Counter += 1;
 
-  }
 
-  except(Counter) { Counter += 1; }
 
-
 
-  if (Counter != 1) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Simple try statement with an exception handler that is never executed
 
-  // because the exception expression continues execution.
 
-  //
 
-
 
-  printf("    test3...");
 
-  Counter = 0;
 
-  try {
 
-    Counter -= 1;
 
-    RtlRaiseException(&ExceptionRecord);
 
-  }
 
-  except(Counter) { Counter -= 1; }
 
-
 
-  if (Counter != -1) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Simple try statement with an exception clause that is always executed.
 
-  //
 
-
 
-  printf("    test4...");
 
-  Counter = 0;
 
-  try {
 
-    Counter += 1;
 
-    RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-  }
 
-  except(Counter) { Counter += 1; }
 
-
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Simple try statement with an exception clause that is always executed.
 
-  //
 
-
 
-  printf("    test5...");
 
-  Counter = 0;
 
-  try {
 
-    Counter += 1;
 
-    *BlackHole += *BadAddress;
 
-  }
 
-  except(Counter) { Counter += 1; }
 
-
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Simply try statement with a finally clause that is entered as the
 
-  // result of an exception.
 
-  //
 
-
 
-  printf("    test6...");
 
-  Counter = 0;
 
-  try {
 
-    try {
 
-      Counter += 1;
 
-      RtlRaiseException(&ExceptionRecord);
 
-    }
 
-    finally {
 
-      if (abnormal_termination() != FALSE) {
 
-        Counter += 1;
 
-      }
 
-    }
 
-  }
 
-  except(Counter) {
 
-    if (Counter == 2) {
 
-      Counter += 1;
 
-    }
 
-  }
 
-
 
-  if (Counter != 3) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Simply try statement with a finally clause that is entered as the
 
-  // result of an exception.
 
-  //
 
-
 
-  printf("    test7...");
 
-  Counter = 0;
 
-  try {
 
-    try {
 
-      Counter += 1;
 
-      *BlackHole += *BadAddress;
 
-    }
 
-    finally {
 
-      if (abnormal_termination() != FALSE) {
 
-        Counter += 1;
 
-      }
 
-    }
 
-  }
 
-  except(Counter) {
 
-    if (Counter == 2) {
 
-      Counter += 1;
 
-    }
 
-  }
 
-
 
-  if (Counter != 3) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Simple try that calls a function which raises an exception.
 
-  //
 
-
 
-  printf("    test8...");
 
-  Counter = 0;
 
-  try {
 
-    Counter += 1;
 
-    foo1(STATUS_ACCESS_VIOLATION);
 
-  }
 
-  except((GetExceptionCode() == STATUS_ACCESS_VIOLATION)
 
-             ? EXCEPTION_EXECUTE_HANDLER
 
-             : EXCEPTION_CONTINUE_SEARCH) {
 
-    Counter += 1;
 
-  }
 
-
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Simple try that calls a function which raises an exception.
 
-  //
 
-
 
-  printf("    test9...");
 
-  Counter = 0;
 
-  try {
 
-    Counter += 1;
 
-    foo2(BlackHole, BadAddress);
 
-  }
 
-  except((GetExceptionCode() == STATUS_ACCESS_VIOLATION)
 
-             ? EXCEPTION_EXECUTE_HANDLER
 
-             : EXCEPTION_CONTINUE_SEARCH) {
 
-    Counter += 1;
 
-  }
 
-
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Simple try that calls a function which calls a function that
 
-  // raises an exception. The first function has a finally clause
 
-  // that must be executed for this test to work.
 
-  //
 
-
 
-  printf("    test10...");
 
-  Counter = 0;
 
-  try {
 
-    bar1(STATUS_ACCESS_VIOLATION, &Counter);
 
-  }
 
-  except((GetExceptionCode() == STATUS_ACCESS_VIOLATION)
 
-             ? EXCEPTION_EXECUTE_HANDLER
 
-             : EXCEPTION_CONTINUE_SEARCH) {
 
-    Counter -= 1;
 
-  }
 
-
 
-  if (Counter != 98) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Simple try that calls a function which calls a function that
 
-  // raises an exception. The first function has a finally clause
 
-  // that must be executed for this test to work.
 
-  //
 
-
 
-  printf("    test11...");
 
-  Counter = 0;
 
-  try {
 
-    bar2(BlackHole, BadAddress, &Counter);
 
-  }
 
-  except((GetExceptionCode() == STATUS_ACCESS_VIOLATION)
 
-             ? EXCEPTION_EXECUTE_HANDLER
 
-             : EXCEPTION_CONTINUE_SEARCH) {
 
-    Counter -= 1;
 
-  }
 
-
 
-  if (Counter != 98) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A try within an except
 
-  //
 
-
 
-  printf("    test12...");
 
-  Counter = 0;
 
-  try {
 
-    foo1(STATUS_ACCESS_VIOLATION);
 
-  }
 
-  except((GetExceptionCode() == STATUS_ACCESS_VIOLATION)
 
-             ? EXCEPTION_EXECUTE_HANDLER
 
-             : EXCEPTION_CONTINUE_SEARCH) {
 
-    Counter += 1;
 
-    try {
 
-      foo1(STATUS_SUCCESS);
 
-    }
 
-    except((GetExceptionCode() == STATUS_SUCCESS) ? EXCEPTION_EXECUTE_HANDLER
 
-                                                  : EXCEPTION_CONTINUE_SEARCH) {
 
-      if (Counter != 1) {
 
-        printf("failed, count = %d\n", Counter);
 
-
 
-      } else {
 
-        printf("succeeded...");
 
-      }
 
-
 
-      Counter += 1;
 
-    }
 
-  }
 
-
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A try within an except
 
-  //
 
-
 
-  printf("    test13...");
 
-  Counter = 0;
 
-  try {
 
-    foo2(BlackHole, BadAddress);
 
-  }
 
-  except((GetExceptionCode() == STATUS_ACCESS_VIOLATION)
 
-             ? EXCEPTION_EXECUTE_HANDLER
 
-             : EXCEPTION_CONTINUE_SEARCH) {
 
-    Counter += 1;
 
-    try {
 
-      foo1(STATUS_SUCCESS);
 
-    }
 
-    except((GetExceptionCode() == STATUS_SUCCESS) ? EXCEPTION_EXECUTE_HANDLER
 
-                                                  : EXCEPTION_CONTINUE_SEARCH) {
 
-      if (Counter != 1) {
 
-        printf("failed, count = %d\n", Counter);
 
-
 
-      } else {
 
-        printf("succeeded...");
 
-      }
 
-
 
-      Counter += 1;
 
-    }
 
-  }
 
-
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-#if !defined(WIN_CE) // gotos from except/finally not allowed on WinCE
 
-  //
 
-  // A goto from an exception clause that needs to pass
 
-  // through a finally
 
-  //
 
-
 
-  printf("    test14...");
 
-  Counter = 0;
 
-  try {
 
-    try {
 
-      foo1(STATUS_ACCESS_VIOLATION);
 
-    }
 
-    except((GetExceptionCode() == STATUS_ACCESS_VIOLATION)
 
-               ? EXCEPTION_EXECUTE_HANDLER
 
-               : EXCEPTION_CONTINUE_SEARCH) {
 
-      Counter += 1;
 
-      goto t9;
 
-    }
 
-  }
 
-  finally { Counter += 1; }
 
-
 
-t9:
 
-  ;
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A goto from an finally clause that needs to pass
 
-  // through a finally
 
-  //
 
-
 
-  printf("    test15...");
 
-  Counter = 0;
 
-  try {
 
-    try {
 
-      Counter += 1;
 
-    }
 
-    finally {
 
-      Counter += 1;
 
-      goto t10;
 
-    }
 
-  }
 
-  finally { Counter += 1; }
 
-
 
-t10:
 
-  ;
 
-  if (Counter != 3) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A goto from an exception clause that needs to pass
 
-  // through a finally into the outer finally clause.
 
-  //
 
-
 
-  printf("    test16...");
 
-  Counter = 0;
 
-  try {
 
-    try {
 
-      try {
 
-        Counter += 1;
 
-        foo1(STATUS_INTEGER_OVERFLOW);
 
-      }
 
-      except(EXCEPTION_EXECUTE_HANDLER) {
 
-        Counter += 1;
 
-        goto t11;
 
-      }
 
-    }
 
-    finally { Counter += 1; }
 
-  t11:
 
-    ;
 
-  }
 
-  finally { Counter += 1; }
 
-
 
-  if (Counter != 4) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A goto from an finally clause that needs to pass
 
-  // through a finally into the outer finally clause.
 
-  //
 
-
 
-  printf("    test17...");
 
-  Counter = 0;
 
-  try {
 
-    try {
 
-      Counter += 1;
 
-    }
 
-    finally {
 
-      Counter += 1;
 
-      goto t12;
 
-    }
 
-  t12:
 
-    ;
 
-  }
 
-  finally { Counter += 1; }
 
-
 
-  if (Counter != 3) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A return from an except clause
 
-  //
 
-
 
-  printf("    test18...");
 
-  Counter = 0;
 
-  try {
 
-    Counter += 1;
 
-    eret(STATUS_ACCESS_VIOLATION, &Counter);
 
-  }
 
-  finally { Counter += 1; }
 
-
 
-  if (Counter != 4) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A return from a finally clause
 
-  //
 
-
 
-  printf("    test19...");
 
-  Counter = 0;
 
-  try {
 
-    Counter += 1;
 
-    fret(&Counter);
 
-  }
 
-  finally { Counter += 1; }
 
-
 
-  if (Counter != 5) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-#endif
 
-
 
-  //
 
-  // A simple set jump followed by a long jump.
 
-  //
 
-
 
-  printf("    test20...");
 
-  Counter = 0;
 
-  if (setjmp(JumpBuffer) == 0) {
 
-    Counter += 1;
 
-    longjmp(JumpBuffer, 1);
 
-
 
-  } else {
 
-    Counter += 1;
 
-  }
 
-
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A set jump followed by a long jump out of a finally clause that is
 
-  // sequentially executed.
 
-  //
 
-
 
-  printf("    test21...");
 
-  Counter = 0;
 
-  if (setjmp(JumpBuffer) == 0) {
 
-    try {
 
-      Counter += 1;
 
-    }
 
-    finally {
 
-      Counter += 1;
 
-      longjmp(JumpBuffer, 1);
 
-    }
 
-
 
-  } else {
 
-    Counter += 1;
 
-  }
 
-
 
-  if (Counter != 3) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A set jump within a try clause followed by a long jump out of a
 
-  // finally clause that is sequentially executed.
 
-  //
 
-
 
-  printf("    test22...");
 
-  Counter = 0;
 
-  try {
 
-    if (setjmp(JumpBuffer) == 0) {
 
-      Counter += 1;
 
-
 
-    } else {
 
-      Counter += 1;
 
-    }
 
-  }
 
-  finally {
 
-    Counter += 1;
 
-    if (Counter == 2) {
 
-      Counter += 1;
 
-      longjmp(JumpBuffer, 1);
 
-    }
 
-  }
 
-
 
-  if (Counter != 5) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A set jump followed by a try/except, followed by a try/finally where
 
-  // the try body of the try/finally raises an exception that is handled
 
-  // by the try/excecpt which causes the try/finally to do a long jump out
 
-  // of a finally clause. This will create a collided unwind.
 
-  //
 
-
 
-  printf("    test23...");
 
-  Counter = 0;
 
-  if (setjmp(JumpBuffer) == 0) {
 
-    try {
 
-      try {
 
-        Counter += 1;
 
-        RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-      }
 
-      finally {
 
-        Counter += 1;
 
-        longjmp(JumpBuffer, 1);
 
-      }
 
-    }
 
-    except(EXCEPTION_EXECUTE_HANDLER) { Counter += 1; }
 
-
 
-  } else {
 
-    Counter += 1;
 
-  }
 
-
 
-  if (Counter != 3) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A set jump followed by a try/except, followed by a several nested
 
-  // try/finally's where the inner try body of the try/finally raises an
 
-  // exception that is handled by the try/except which causes the
 
-  // try/finally to do a long jump out of a finally clause. This will
 
-  // create a collided unwind.
 
-  //
 
-
 
-  printf("    test24...");
 
-  Counter = 0;
 
-  if (setjmp(JumpBuffer) == 0) {
 
-    try {
 
-      try {
 
-        try {
 
-          try {
 
-            Counter += 1;
 
-            RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-          }
 
-          finally { Counter += 1; }
 
-        }
 
-        finally {
 
-          Counter += 1;
 
-          longjmp(JumpBuffer, 1);
 
-        }
 
-      }
 
-      finally { Counter += 1; }
 
-    }
 
-    except(EXCEPTION_EXECUTE_HANDLER) { Counter += 1; }
 
-
 
-  } else {
 
-    Counter += 1;
 
-  }
 
-
 
-  if (Counter != 5) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A set jump followed by a try/except, followed by a try/finally which
 
-  // calls a subroutine which contains a try finally that raises an
 
-  // exception that is handled to the try/except.
 
-  //
 
-
 
-  printf("    test25...");
 
-  Counter = 0;
 
-  if (setjmp(JumpBuffer) == 0) {
 
-    try {
 
-      try {
 
-        try {
 
-          Counter += 1;
 
-          dojump(JumpBuffer, &Counter);
 
-        }
 
-        finally { Counter += 1; }
 
-      }
 
-      finally { Counter += 1; }
 
-    }
 
-    except(EXCEPTION_EXECUTE_HANDLER) { Counter += 1; }
 
-
 
-  } else {
 
-    Counter += 1;
 
-  }
 
-
 
-  if (Counter != 7) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A set jump followed by a try/except, followed by a try/finally which
 
-  // calls a subroutine which contains a try finally that raises an
 
-  // exception that is handled to the try/except.
 
-  //
 
-
 
-  printf("    test26...");
 
-  Counter = 0;
 
-  if (setjmp(JumpBuffer) == 0) {
 
-    try {
 
-      try {
 
-        try {
 
-          try {
 
-            Counter += 1;
 
-            dojump(JumpBuffer, &Counter);
 
-          }
 
-          finally { Counter += 1; }
 
-        }
 
-        finally {
 
-          Counter += 1;
 
-          longjmp(JumpBuffer, 1);
 
-        }
 
-      }
 
-      finally { Counter += 1; }
 
-    }
 
-    except(EXCEPTION_EXECUTE_HANDLER) { Counter += 1; }
 
-
 
-  } else {
 
-    Counter += 1;
 
-  }
 
-
 
-  if (Counter != 8) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Test nested exceptions.
 
-  //
 
-
 
-  printf("    test27...");
 
-  Counter = 0;
 
-  try {
 
-    try {
 
-      Counter += 1;
 
-      except1(&Counter);
 
-    }
 
-    except(except2(GetExceptionInformation(), &Counter)) { Counter += 2; }
 
-  }
 
-  except(EXCEPTION_EXECUTE_HANDLER) { Counter += 3; }
 
-
 
-  if (Counter != 55) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Simple try that causes an integer overflow exception.
 
-  //
 
-
 
-  printf("    test28...");
 
-  Counter = 0;
 
-  try {
 
-    Counter += 1;
 
-    addtwo(0x7fff0000, 0x10000, &Counter);
 
-  }
 
-  except((GetExceptionCode() == STATUS_INTEGER_OVERFLOW)
 
-             ? EXCEPTION_EXECUTE_HANDLER
 
-             : EXCEPTION_CONTINUE_SEARCH) {
 
-    Counter += 1;
 
-  }
 
-
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-//
 
-// Simple try that raises an misaligned data exception.
 
-//
 
-#if !defined(i386) && !defined(_M_IA64) && !defined(_M_AMD64) &&               \
 
-    !defined(_M_ARM) && !defined(_M_ARM64)
 
-  printf("    test29...");
 
-  Counter = 0;
 
-  try {
 
-    Counter += 1;
 
-    foo2(BlackHole, (PLONG)BadByte);
 
-  }
 
-  except((GetExceptionCode() == STATUS_DATATYPE_MISALIGNMENT)
 
-             ? EXCEPTION_EXECUTE_HANDLER
 
-             : EXCEPTION_CONTINUE_SEARCH) {
 
-    Counter += 1;
 
-  }
 
-
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-#endif
 
-  //
 
-  // Continue from a try body with an exception clause in a loop.
 
-  //
 
-
 
-  printf("    test30...");
 
-  Counter = 0;
 
-  for (Index1 = 0; Index1 < 10; Index1 += 1) {
 
-    try {
 
-      if ((Index1 & 0x1) == 0) {
 
-        continue;
 
-
 
-      } else {
 
-        Counter += 1;
 
-      }
 
-    }
 
-    except(EXCEPTION_EXECUTE_HANDLER) { Counter += 40; }
 
-
 
-    Counter += 2;
 
-  }
 
-
 
-  if (Counter != 15) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-#if !defined(WIN_CE) // gotos from try/finally not allowed on WinCE
 
-  //
 
-  // Continue from a try body with an finally clause in a loop.
 
-  //
 
-
 
-  printf("    test31...");
 
-  Counter = 0;
 
-  for (Index1 = 0; Index1 < 10; Index1 += 1) {
 
-    try {
 
-      if ((Index1 & 0x1) == 0) {
 
-        continue;
 
-
 
-      } else {
 
-        Counter += 1;
 
-      }
 
-    }
 
-    finally { Counter += 2; }
 
-
 
-    Counter += 3;
 
-  }
 
-
 
-  if (Counter != 40) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-#endif
 
-
 
-  //
 
-  // Continue from doubly nested try body with an exception clause in a
 
-  // loop.
 
-  //
 
-
 
-  printf("    test32...");
 
-  Counter = 0;
 
-  for (Index1 = 0; Index1 < 10; Index1 += 1) {
 
-    try {
 
-      try {
 
-        if ((Index1 & 0x1) == 0) {
 
-          continue;
 
-
 
-        } else {
 
-          Counter += 1;
 
-        }
 
-      }
 
-      except(EXCEPTION_EXECUTE_HANDLER) { Counter += 10; }
 
-
 
-      Counter += 2;
 
-    }
 
-    except(EXCEPTION_EXECUTE_HANDLER) { Counter += 20; }
 
-
 
-    Counter += 3;
 
-  }
 
-
 
-  if (Counter != 30) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-#if !defined(WIN_CE) // gotos from try/finally not allowed on WinCE
 
-  //
 
-  // Continue from doubly nested try body with an finally clause in a loop.
 
-  //
 
-
 
-  printf("    test33...");
 
-  Counter = 0;
 
-  for (Index1 = 0; Index1 < 10; Index1 += 1) {
 
-    try {
 
-      try {
 
-        if ((Index1 & 0x1) == 0) {
 
-          continue;
 
-
 
-        } else {
 
-          Counter += 1;
 
-        }
 
-      }
 
-      finally { Counter += 2; }
 
-
 
-      Counter += 3;
 
-    }
 
-    finally { Counter += 4; }
 
-
 
-    Counter += 5;
 
-  }
 
-
 
-  if (Counter != 105) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Continue from a finally clause in a loop.
 
-  //
 
-
 
-  printf("    test34...");
 
-  Counter = 0;
 
-  for (Index1 = 0; Index1 < 10; Index1 += 1) {
 
-    try {
 
-      if ((Index1 & 0x1) == 0) {
 
-        Counter += 1;
 
-      }
 
-    }
 
-    finally {
 
-      Counter += 2;
 
-      continue;
 
-    }
 
-
 
-    Counter += 4;
 
-  }
 
-
 
-  if (Counter != 25) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Continue from a doubly nested finally clause in a loop.
 
-  //
 
-
 
-  printf("    test35...");
 
-  Counter = 0;
 
-  for (Index1 = 0; Index1 < 10; Index1 += 1) {
 
-    try {
 
-      try {
 
-        if ((Index1 & 0x1) == 0) {
 
-          Counter += 1;
 
-        }
 
-      }
 
-      finally {
 
-        Counter += 2;
 
-        continue;
 
-      }
 
-
 
-      Counter += 4;
 
-    }
 
-    finally { Counter += 5; }
 
-
 
-    Counter += 6;
 
-  }
 
-
 
-  if (Counter != 75) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Continue from a doubly nested finally clause in a loop.
 
-  //
 
-
 
-  printf("    test36...");
 
-  Counter = 0;
 
-  for (Index1 = 0; Index1 < 10; Index1 += 1) {
 
-    try {
 
-      try {
 
-        if ((Index1 & 0x1) == 0) {
 
-          Counter += 1;
 
-        }
 
-      }
 
-      finally { Counter += 2; }
 
-
 
-      Counter += 4;
 
-    }
 
-    finally {
 
-      Counter += 5;
 
-      continue;
 
-    }
 
-
 
-    Counter += 6;
 
-  }
 
-
 
-  if (Counter != 115) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-#endif
 
-
 
-  //
 
-  // Break from a try body with an exception clause in a loop.
 
-  //
 
-
 
-  printf("    test37...");
 
-  Counter = 0;
 
-  for (Index1 = 0; Index1 < 10; Index1 += 1) {
 
-    try {
 
-      if ((Index1 & 0x1) == 1) {
 
-        break;
 
-
 
-      } else {
 
-        Counter += 1;
 
-      }
 
-    }
 
-    except(EXCEPTION_EXECUTE_HANDLER) { Counter += 40; }
 
-
 
-    Counter += 2;
 
-  }
 
-
 
-  if (Counter != 3) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-#if !defined(WIN_CE) // gotos from try/finally not allowed on WinCE
 
-  //
 
-  // Break from a try body with an finally clause in a loop.
 
-  //
 
-
 
-  printf("    test38...");
 
-  Counter = 0;
 
-  for (Index1 = 0; Index1 < 10; Index1 += 1) {
 
-    try {
 
-      if ((Index1 & 0x1) == 1) {
 
-        break;
 
-
 
-      } else {
 
-        Counter += 1;
 
-      }
 
-    }
 
-    finally { Counter += 2; }
 
-
 
-    Counter += 3;
 
-  }
 
-
 
-  if (Counter != 8) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-#endif
 
-
 
-  //
 
-  // Break from doubly nested try body with an exception clause in a
 
-  // loop.
 
-  //
 
-
 
-  printf("    test39...");
 
-  Counter = 0;
 
-  for (Index1 = 0; Index1 < 10; Index1 += 1) {
 
-    try {
 
-      try {
 
-        if ((Index1 & 0x1) == 1) {
 
-          break;
 
-
 
-        } else {
 
-          Counter += 1;
 
-        }
 
-      }
 
-      except(EXCEPTION_EXECUTE_HANDLER) { Counter += 10; }
 
-
 
-      Counter += 2;
 
-    }
 
-    except(EXCEPTION_EXECUTE_HANDLER) { Counter += 20; }
 
-
 
-    Counter += 3;
 
-  }
 
-
 
-  if (Counter != 6) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-#if !defined(WIN_CE) // gotos from try/finally not allowed on WinCE
 
-  //
 
-  // Break from doubly nested try body with an finally clause in a loop.
 
-  //
 
-
 
-  printf("    test40...");
 
-  Counter = 0;
 
-  for (Index1 = 0; Index1 < 10; Index1 += 1) {
 
-    try {
 
-      try {
 
-        if ((Index1 & 0x1) == 1) {
 
-          break;
 
-
 
-        } else {
 
-          Counter += 1;
 
-        }
 
-      }
 
-      finally { Counter += 2; }
 
-
 
-      Counter += 3;
 
-    }
 
-    finally { Counter += 4; }
 
-
 
-    Counter += 5;
 
-  }
 
-
 
-  if (Counter != 21) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Break from a finally clause in a loop.
 
-  //
 
-
 
-  printf("    test41...");
 
-  Counter = 0;
 
-  for (Index1 = 0; Index1 < 10; Index1 += 1) {
 
-    try {
 
-      if ((Index1 & 0x1) == 1) {
 
-        Counter += 1;
 
-      }
 
-    }
 
-    finally {
 
-      Counter += 2;
 
-      break;
 
-    }
 
-
 
-    Counter += 4;
 
-  }
 
-
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Break from a doubly nested finally clause in a loop.
 
-  //
 
-
 
-  printf("    test42...");
 
-  Counter = 0;
 
-  for (Index1 = 0; Index1 < 10; Index1 += 1) {
 
-    try {
 
-      try {
 
-        if ((Index1 & 0x1) == 1) {
 
-          Counter += 1;
 
-        }
 
-      }
 
-      finally {
 
-        Counter += 2;
 
-        break;
 
-      }
 
-
 
-      Counter += 4;
 
-    }
 
-    finally { Counter += 5; }
 
-
 
-    Counter += 6;
 
-  }
 
-
 
-  if (Counter != 7) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Break from a doubly nested finally clause in a loop.
 
-  //
 
-
 
-  printf("    test43...");
 
-  Counter = 0;
 
-  for (Index1 = 0; Index1 < 10; Index1 += 1) {
 
-    try {
 
-      try {
 
-        if ((Index1 & 0x1) == 1) {
 
-          Counter += 1;
 
-        }
 
-      }
 
-      finally { Counter += 2; }
 
-
 
-      Counter += 4;
 
-    }
 
-    finally {
 
-      Counter += 5;
 
-      break;
 
-    }
 
-
 
-    Counter += 6;
 
-  }
 
-
 
-  if (Counter != 11) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-#endif
 
-
 
-  //
 
-  // Break from a try body with an exception clause in a switch.
 
-  //
 
-
 
-  printf("    test44...");
 
-  Counter = 0;
 
-  Index1 = 1;
 
-  switch (Index2) {
 
-  case BLUE:
 
-    Counter += 100;
 
-    break;
 
-
 
-  case RED:
 
-    try {
 
-      if ((Index1 & 0x1) == 1) {
 
-        break;
 
-
 
-      } else {
 
-        Counter += 1;
 
-      }
 
-    }
 
-    except(EXCEPTION_EXECUTE_HANDLER) { Counter += 40; }
 
-
 
-    Counter += 2;
 
-    break;
 
-  }
 
-
 
-  if (Counter != 0) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-#if !defined(WIN_CE) // gotos from try/finally not allowed on WinCE
 
-  //
 
-  // Break from a try body with an finally clause in a switch.
 
-  //
 
-
 
-  printf("    test45...");
 
-  Counter = 0;
 
-  Index1 = 1;
 
-  switch (Index2) {
 
-  case BLUE:
 
-    Counter += 100;
 
-    break;
 
-
 
-  case RED:
 
-    try {
 
-      if ((Index1 & 0x1) == 1) {
 
-        break;
 
-
 
-      } else {
 
-        Counter += 1;
 
-      }
 
-    }
 
-    finally { Counter += 2; }
 
-
 
-    Counter += 3;
 
-  }
 
-
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-#endif
 
-
 
-  //
 
-  // Break from doubly nested try body with an exception clause in a
 
-  // switch.
 
-  //
 
-
 
-  printf("    test46...");
 
-  Counter = 0;
 
-  Index1 = 1;
 
-  switch (Index2) {
 
-  case BLUE:
 
-    Counter += 100;
 
-    break;
 
-
 
-  case RED:
 
-    try {
 
-      try {
 
-        if ((Index1 & 0x1) == 1) {
 
-          break;
 
-
 
-        } else {
 
-          Counter += 1;
 
-        }
 
-      }
 
-      except(EXCEPTION_EXECUTE_HANDLER) { Counter += 10; }
 
-
 
-      Counter += 2;
 
-    }
 
-    except(EXCEPTION_EXECUTE_HANDLER) { Counter += 20; }
 
-
 
-    Counter += 3;
 
-  }
 
-
 
-  if (Counter != 0) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-#if !defined(WIN_CE) // gotos from try/finally not allowed on WinCE
 
-  //
 
-  // Break from doubly nested try body with an finally clause in a switch.
 
-  //
 
-
 
-  printf("    test47...");
 
-  Counter = 0;
 
-  Index1 = 1;
 
-  switch (Index2) {
 
-  case BLUE:
 
-    Counter += 100;
 
-    break;
 
-
 
-  case RED:
 
-    try {
 
-      try {
 
-        if ((Index1 & 0x1) == 1) {
 
-          break;
 
-
 
-        } else {
 
-          Counter += 1;
 
-        }
 
-      }
 
-      finally { Counter += 2; }
 
-
 
-      Counter += 3;
 
-    }
 
-    finally { Counter += 4; }
 
-
 
-    Counter += 5;
 
-  }
 
-
 
-  if (Counter != 6) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Break from a finally clause in a switch.
 
-  //
 
-
 
-  printf("    test48...");
 
-  Counter = 0;
 
-  Index1 = 1;
 
-  switch (Index2) {
 
-  case BLUE:
 
-    Counter += 100;
 
-    break;
 
-
 
-  case RED:
 
-    try {
 
-      if ((Index1 & 0x1) == 1) {
 
-        Counter += 1;
 
-      }
 
-    }
 
-    finally {
 
-      Counter += 2;
 
-      break;
 
-    }
 
-
 
-    Counter += 4;
 
-  }
 
-
 
-  if (Counter != 3) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Break from a doubly nested finally clause in a switch.
 
-  //
 
-
 
-  printf("    test49...");
 
-  Counter = 0;
 
-  Index1 = 1;
 
-  switch (Index2) {
 
-  case BLUE:
 
-    Counter += 100;
 
-    break;
 
-
 
-  case RED:
 
-    try {
 
-      try {
 
-        if ((Index1 & 0x1) == 1) {
 
-          Counter += 1;
 
-        }
 
-      }
 
-      finally {
 
-        Counter += 2;
 
-        break;
 
-      }
 
-
 
-      Counter += 4;
 
-    }
 
-    finally { Counter += 5; }
 
-
 
-    Counter += 6;
 
-  }
 
-
 
-  if (Counter != 8) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Break from a doubly nested finally clause in a switch.
 
-  //
 
-
 
-  printf("    test50...");
 
-  Counter = 0;
 
-  Index1 = 1;
 
-  switch (Index2) {
 
-  case BLUE:
 
-    Counter += 100;
 
-    break;
 
-
 
-  case RED:
 
-    try {
 
-      try {
 
-        if ((Index1 & 0x1) == 1) {
 
-          Counter += 1;
 
-        }
 
-      }
 
-      finally { Counter += 2; }
 
-
 
-      Counter += 4;
 
-    }
 
-    finally {
 
-      Counter += 5;
 
-      break;
 
-    }
 
-
 
-    Counter += 6;
 
-  }
 
-
 
-  if (Counter != 12) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-#endif
 
-
 
-  //
 
-  // Leave from an if in a simple try/finally.
 
-  //
 
-
 
-  printf("    test51...");
 
-  Counter = 0;
 
-  try {
 
-    if (Echo(Counter) == Counter) {
 
-      Counter += 3;
 
-      leave;
 
-
 
-    } else {
 
-      Counter += 100;
 
-    }
 
-  }
 
-  finally {
 
-    if (abnormal_termination() == FALSE) {
 
-      Counter += 5;
 
-    }
 
-  }
 
-
 
-  if (Counter != 8) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Leave from a loop in a simple try/finally.
 
-  //
 
-
 
-  printf("    test52...");
 
-  Counter = 0;
 
-  try {
 
-    for (Index1 = 0; Index1 < 10; Index1 += 1) {
 
-      if (Echo(Index1) == Index1) {
 
-        Counter += 3;
 
-        leave;
 
-      }
 
-
 
-      Counter += 100;
 
-    }
 
-  }
 
-  finally {
 
-    if (abnormal_termination() == FALSE) {
 
-      Counter += 5;
 
-    }
 
-  }
 
-
 
-  if (Counter != 8) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Leave from a switch in a simple try/finally.
 
-  //
 
-
 
-  printf("    test53...");
 
-  Counter = 0;
 
-  try {
 
-    switch (Index2) {
 
-    case BLUE:
 
-      break;
 
-
 
-    case RED:
 
-      Counter += 3;
 
-      leave;
 
-    }
 
-
 
-    Counter += 100;
 
-  }
 
-  finally {
 
-    if (abnormal_termination() == FALSE) {
 
-      Counter += 5;
 
-    }
 
-  }
 
-
 
-  if (Counter != 8) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Leave from an if in doubly nested try/finally followed by a leave
 
-  // from an if in the outer try/finally.
 
-  //
 
-
 
-  printf("    test54...");
 
-  Counter = 0;
 
-  try {
 
-    try {
 
-      if (Echo(Counter) == Counter) {
 
-        Counter += 3;
 
-        leave;
 
-
 
-      } else {
 
-        Counter += 100;
 
-      }
 
-    }
 
-    finally {
 
-      if (abnormal_termination() == FALSE) {
 
-        Counter += 5;
 
-      }
 
-    }
 
-
 
-    if (Echo(Counter) == Counter) {
 
-      Counter += 3;
 
-      leave;
 
-
 
-    } else {
 
-      Counter += 100;
 
-    }
 
-  }
 
-  finally {
 
-    if (abnormal_termination() == FALSE) {
 
-      Counter += 5;
 
-    }
 
-  }
 
-
 
-  if (Counter != 16) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-#if !defined(WIN_CE) // leave from finally not allowed on WinCE
 
-  //
 
-  // Leave from an if in doubly nested try/finally followed by a leave
 
-  // from the finally of the outer try/finally.
 
-  //
 
-
 
-  printf("    test55...");
 
-  Counter = 0;
 
-  try {
 
-    try {
 
-      if (Echo(Counter) == Counter) {
 
-        Counter += 3;
 
-        leave;
 
-
 
-      } else {
 
-        Counter += 100;
 
-      }
 
-    }
 
-    finally {
 
-      if (abnormal_termination() == FALSE) {
 
-        Counter += 5;
 
-        leave;
 
-      }
 
-    }
 
-
 
-    Counter += 100;
 
-  }
 
-  finally {
 
-    if (abnormal_termination() == FALSE) {
 
-      Counter += 5;
 
-    }
 
-  }
 
-
 
-  if (Counter != 13) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-#endif
 
-
 
-  //
 
-  // Try/finally within the except clause of a try/except that is always
 
-  // executed.
 
-  //
 
-
 
-  printf("    test56...");
 
-  Counter = 0;
 
-  try {
 
-    Counter += 1;
 
-    RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-  }
 
-  except(Counter) {
 
-    try {
 
-      Counter += 3;
 
-    }
 
-    finally {
 
-      if (abnormal_termination() == FALSE) {
 
-        Counter += 5;
 
-      }
 
-    }
 
-  }
 
-
 
-  if (Counter != 9) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Try/finally within the finally clause of a try/finally.
 
-  //
 
-
 
-  printf("    test57...");
 
-  Counter = 0;
 
-  try {
 
-    Counter += 1;
 
-  }
 
-  finally {
 
-    if (abnormal_termination() == FALSE) {
 
-      try {
 
-        Counter += 3;
 
-      }
 
-      finally {
 
-        if (abnormal_termination() == FALSE) {
 
-          Counter += 5;
 
-        }
 
-      }
 
-    }
 
-  }
 
-
 
-  if (Counter != 9) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Try/except within the finally clause of a try/finally.
 
-  //
 
-
 
-  printf("    test58...");
 
-#if !defined(NEST_IN_FINALLY)
 
-  printf("skipped\n");
 
-#else
 
-  Counter = 0;
 
-  try {
 
-    Counter -= 1;
 
-  }
 
-  finally {
 
-    try {
 
-      Counter += 2;
 
-      RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-    }
 
-    except(Counter) {
 
-      try {
 
-        Counter += 3;
 
-      }
 
-      finally {
 
-        if (abnormal_termination() == FALSE) {
 
-          Counter += 5;
 
-        }
 
-      }
 
-    }
 
-  }
 
-
 
-  if (Counter != 9) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-#endif /* def(NEST_IN_FINALLY) */
 
-
 
-  //
 
-  // Try/except within the except clause of a try/except that is always
 
-  // executed.
 
-  //
 
-
 
-  printf("    test59...");
 
-  Counter = 0;
 
-  try {
 
-    Counter += 1;
 
-    RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-  }
 
-  except(Counter) {
 
-    try {
 
-      Counter += 3;
 
-      RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-    }
 
-    except(Counter - 3) { Counter += 5; }
 
-  }
 
-
 
-  if (Counter != 9) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Try with a Try which exits the scope with a goto
 
-  //
 
-
 
-  printf("    test60...");
 
-  Counter = 0;
 
-  try {
 
-    try {
 
-      goto outside;
 
-    }
 
-    except(1) { Counter += 1; }
 
-
 
-  outside:
 
-    RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-  }
 
-  except(1) { Counter += 3; }
 
-
 
-  if (Counter != 3) {
 
-    printf("failed, count = %d\n", Counter);
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Try/except which gets an exception from a subfunction within
 
-  // a try/finally which has a try/except in the finally clause
 
-  //
 
-
 
-  printf("    test61...");
 
-#if !defined(NEST_IN_FINALLY)
 
-  printf("skipped\n");
 
-#else
 
-  Counter = 0;
 
-  try {
 
-    Test61Part2(&Counter);
 
-  }
 
-  except(EXCEPTION_EXECUTE_HANDLER) { Counter += 11; }
 
-
 
-  if (Counter != 24) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-#endif /* def(NEST_IN_FINALLY) */
 
-
 
-  //
 
-  // Check for precision of exception on floating point
 
-  //
 
-
 
-  printf("    test62...");
 
-
 
-#if defined(i386) || defined(_M_IA64) || defined(_M_ALPHA) || defined(_M_AMD64)
 
-
 
-/* enable floating point overflow */
 
-#if defined(i386)
 
-  _control87(_control87(0, 0) & ~EM_OVERFLOW, _MCW_EM);
 
-#else
 
-  //
 
-  // use portable version of _control87
 
-  //
 
-  _controlfp(_controlfp(0, 0) & ~EM_OVERFLOW, _MCW_EM);
 
-#endif
 
-
 
-  Counter = 0;
 
-  try {
 
-    doubleresult = SquareDouble(1.7e300);
 
-
 
-    try {
 
-      doubleresult = SquareDouble(1.0);
 
-    }
 
-    except(1) { Counter += 3; }
 
-  }
 
-  except(1) { Counter += 1; }
 
-
 
-  if (Counter != 1) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-/* clear up pending unmasked exceptions and restore FP control registers */
 
-#if defined(i386)
 
-  _clear87();
 
-  _control87(_control87(0, 0) | EM_OVERFLOW, 0xfffff);
 
-#else
 
-  _clearfp();
 
-  _controlfp(_controlfp(0, 0) | EM_OVERFLOW, 0xfffff);
 
-#endif
 
-
 
-#else
 
-  printf("skipped\n");
 
-#endif
 
-
 
-  //
 
-  // A try/finally inside a try/except where an exception is raised in the
 
-  // try/finally.
 
-  //
 
-
 
-  printf("    test63...");
 
-  Counter = 0;
 
-  try {
 
-    try {
 
-      Counter += 1;
 
-    }
 
-    finally {
 
-      Counter += 3;
 
-      RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-    }
 
-  }
 
-  except(1) { Counter += 6; }
 
-
 
-  if (Counter != 10) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A try/finally inside a try/except where an exception is raised in the
 
-  // in the try/except and the try/finally.
 
-  //
 
-
 
-  printf("    test64...");
 
-  Counter = 0;
 
-  try {
 
-    try {
 
-      Counter += 1;
 
-      RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-    }
 
-    finally {
 
-      Counter += 3;
 
-      RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-    }
 
-  }
 
-  except(1) { Counter += 6; }
 
-
 
-  if (Counter != 10) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A try/finally inside a try/except where an exception is raised in the
 
-  // try/finally.
 
-  //
 
-
 
-  printf("    test65...");
 
-  Counter = 0;
 
-  try {
 
-    try {
 
-      Counter += 1;
 
-    }
 
-    finally {
 
-      Counter += 3;
 
-      *BlackHole += *BadAddress;
 
-      Counter += 13;
 
-    }
 
-  }
 
-  except(1) { Counter += 6; }
 
-
 
-  if (Counter != 10) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A try/finally inside a try/except where an exception is raised in the
 
-  // in the try/except and the try/finally.
 
-  //
 
-
 
-  printf("    test66...");
 
-  Counter = 0;
 
-  try {
 
-    try {
 
-      Counter += 1;
 
-      *BlackHole += *BadAddress;
 
-      Counter += 13;
 
-    }
 
-    finally {
 
-      Counter += 3;
 
-      *BlackHole += *BadAddress;
 
-      Counter += 13;
 
-    }
 
-  }
 
-  except(1) { Counter += 6; }
 
-
 
-  if (Counter != 10) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A try/finally inside a try/finally inside a try/except where an
 
-  // exception is raised in the in the try/except and in try/finally.
 
-  //
 
-
 
-  printf("    test67...");
 
-  try {
 
-    try {
 
-      *BlackHole += *BadAddress;
 
-    }
 
-    finally {
 
-      try {
 
-        Counter = 0;
 
-      }
 
-      finally {
 
-        if (Counter != 0) {
 
-          Counter += 1;
 
-        }
 
-      }
 
-
 
-      Counter += 1;
 
-      *BlackHole += *BadAddress;
 
-    }
 
-  }
 
-  except(1) { Counter += 1; }
 
-
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // A try/finally inside a try/finally inside a try/except where an
 
-  // exception is raised in the in the try/except and in try/finally.
 
-  //
 
-
 
-  printf("    test68...");
 
-  try {
 
-    try {
 
-      RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-    }
 
-    finally {
 
-      try {
 
-        Counter = 0;
 
-      }
 
-      finally {
 
-        if (Counter != 0) {
 
-          Counter += 1;
 
-        }
 
-      }
 
-
 
-      Counter += 1;
 
-      RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-    }
 
-  }
 
-  except(1) { Counter += 1; }
 
-
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-//
 
-// Patch guard test 69.
 
-//
 
-
 
-#if defined(_AMD64_) || defined(_X86_)
 
-
 
-  printf("    test69...");
 
-  Counter = 0;
 
-  try {
 
-    PgTest69(&Counter, BadAddress);
 
-  }
 
-  except(EXCEPTION_EXECUTE_HANDLER) { printf("unexpected exception..."); }
 
-
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  printf("    test70...");
 
-  Counter = 0;
 
-  try {
 
-    PgTest70(&Counter, BadAddress);
 
-  }
 
-  except(EXCEPTION_EXECUTE_HANDLER) { printf("unexpected exception..."); }
 
-
 
-  if (Counter != 2) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  printf("    test71...");
 
-  Counter = 0;
 
-  try {
 
-    PgTest71(&Counter, BadAddress);
 
-  }
 
-  except(EXCEPTION_EXECUTE_HANDLER) { printf("unexpected exception..."); }
 
-
 
-  if (Counter != 9) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  printf("    test72...");
 
-  Counter = 0;
 
-  try {
 
-    PgTest72(&Counter, BadAddress);
 
-  }
 
-  except(EXCEPTION_EXECUTE_HANDLER) { printf("unexpected exception..."); }
 
-
 
-  if (Counter != 12) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  printf("    test73...");
 
-  Counter = 0;
 
-  try {
 
-    PgTest73(&Counter, BadAddress);
 
-  }
 
-  except(EXCEPTION_EXECUTE_HANDLER) { printf("unexpected exception..."); }
 
-
 
-  if (Counter != 15) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  printf("    test74...");
 
-  Counter = 0;
 
-  try {
 
-    PgTest74(&Counter, BadAddress);
 
-  }
 
-  except(EXCEPTION_EXECUTE_HANDLER) { printf("unexpected exception..."); }
 
-
 
-  if (Counter != 18) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  printf("    test75...");
 
-  Counter = 0;
 
-  try {
 
-    PgTest75(&Counter, BadAddress);
 
-  }
 
-  except(EXCEPTION_EXECUTE_HANDLER) { printf("unexpected exception..."); }
 
-
 
-  if (Counter != 35) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  printf("    test76...");
 
-  Counter = 0;
 
-  try {
 
-    PgTest76(&Counter, BadAddress);
 
-  }
 
-  except(EXCEPTION_EXECUTE_HANDLER) { printf("unexpected exception..."); }
 
-
 
-  if (Counter != 40) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  printf("    test77...");
 
-  Counter = 0;
 
-  try {
 
-    PgTest77(&Counter, BadAddress);
 
-  }
 
-  except(EXCEPTION_EXECUTE_HANDLER) { printf("unexpected exception..."); }
 
-
 
-  if (Counter != 45) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  printf("    test78...");
 
-  Counter = 0;
 
-  try {
 
-    PgTest78(&Counter, BadAddress);
 
-  }
 
-  except(EXCEPTION_EXECUTE_HANDLER) { printf("unexpected exception..."); }
 
-
 
-  if (Counter != 50) {
 
-    printf("failed, count = %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-#else
 
-  printf("    test69...filter entered...succeeded\n");
 
-  printf("    test70...filter entered...succeeded\n");
 
-  printf("    test71...filter entered...succeeded\n");
 
-  printf("    test72...filter entered...succeeded\n");
 
-  printf("    test73...filter entered...succeeded\n");
 
-  printf("    test74...filter entered...succeeded\n");
 
-  printf("    test75...filter entered...succeeded\n");
 
-  printf("    test76...filter entered...succeeded\n");
 
-  printf("    test77...filter entered...succeeded\n");
 
-  printf("    test78...filter entered...succeeded\n");
 
-#endif
 
-
 
-  if (LOBYTE(LOWORD(GetVersion())) < 6) {
 
-    printf("    test79...");
 
-    printf("filter 1...filter 2...finally 1...filter 1...filter 2...finally "
 
-           "2...passed\n");
 
-  } else {
 
-
 
-    printf("    test79...");
 
-    Counter = 0;
 
-    try {
 
-      Test79(&Counter, BadAddress);
 
-    }
 
-    except(printf("filter 2..."), EXCEPTION_EXECUTE_HANDLER) { Counter += 1; }
 
-
 
-    if (Counter == 3) {
 
-      printf("passed\n");
 
-
 
-    } else {
 
-      printf("failed  %d \n", Counter);
 
-    }
 
-  }
 
-
 
-  printf("    test80...");
 
-  if (Test80() != 0) {
 
-    printf("failed\n");
 
-
 
-  } else {
 
-    printf("passed\n");
 
-  }
 
-
 
-  printf("    test81...");
 
-  Counter = 0;
 
-  Test81(&Counter);
 
-  if (Counter != 1) {
 
-    printf("failed  %d \n", Counter);
 
-
 
-  } else {
 
-    printf("passed\n");
 
-  }
 
-
 
-  printf("    test82...");
 
-  Counter = 1;
 
-  Test82(&Counter);
 
-  if (Counter != 0) {
 
-    printf("failed\n");
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  printf("    test83...");
 
-  if (Test83() != 0) {
 
-    printf("failed\n");
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  printf("    test84...");
 
-  Counter = 0;
 
-  Test84(&Counter);
 
-  if (Counter != 2) {
 
-    printf("failed\n");
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  printf("    test85...");
 
-  Counter = 0;
 
-  Test85(&Counter);
 
-  if (Counter != 7) {
 
-    printf("failed\n");
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  printf("    test86...");
 
-  Counter = 0;
 
-  Test86(&Counter);
 
-  if (Counter != 4) {
 
-    printf("failed %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  printf("    test87...");
 
-  Counter = 0;
 
-  Test87(&Counter);
 
-  if (Counter != 104) {
 
-    printf("failed %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  printf("    test88...");
 
-  Counter = 0;
 
-  Test88(&Counter);
 
-  if (Counter != 6) {
 
-    printf("failed %d\n", Counter);
 
-
 
-  } else {
 
-    printf("succeeded\n");
 
-  }
 
-
 
-  //
 
-  // Announce end of exception test.
 
-  //
 
-
 
-  printf("End of exception test\n");
 
-  return;
 
-}
 
-
 
-#pragma optimize("a", off)
 
-VOID addtwo(long First, long Second, long *Place)
 
-
 
-{
 
-
 
-  RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-  *Place = First + Second;
 
-  return;
 
-}
 
-#pragma optimize("", on)
 
-
 
-VOID bar1(IN NTSTATUS Status, IN PLONG Counter) {
 
-
 
-  try {
 
-    foo1(Status);
 
-  }
 
-  finally {
 
-    if (abnormal_termination() != FALSE) {
 
-      *Counter = 99;
 
-
 
-    } else {
 
-      *Counter = 100;
 
-    }
 
-  }
 
-
 
-  return;
 
-}
 
-
 
-VOID bar2(IN PLONG BlackHole, IN PLONG BadAddress, IN PLONG Counter) {
 
-
 
-  try {
 
-    foo2(BlackHole, BadAddress);
 
-  }
 
-  finally {
 
-    if (abnormal_termination() != FALSE) {
 
-      *Counter = 99;
 
-
 
-    } else {
 
-      *Counter = 100;
 
-    }
 
-  }
 
-
 
-  return;
 
-}
 
-
 
-VOID dojump(IN jmp_buf JumpBuffer, IN PLONG Counter)
 
-
 
-{
 
-
 
-  try {
 
-    try {
 
-      *Counter += 1;
 
-      RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-    }
 
-    finally { *Counter += 1; }
 
-  }
 
-  finally {
 
-    *Counter += 1;
 
-    longjmp(JumpBuffer, 1);
 
-  }
 
-}
 
-
 
-#if !defined(WIN_CE) // return through finally not allowed on WinCE
 
-VOID eret(IN NTSTATUS Status, IN PLONG Counter)
 
-
 
-{
 
-
 
-  try {
 
-    try {
 
-      foo1(Status);
 
-    }
 
-    except((GetExceptionCode() == Status) ? EXCEPTION_EXECUTE_HANDLER
 
-                                          : EXCEPTION_CONTINUE_SEARCH) {
 
-      *Counter += 1;
 
-      return;
 
-    }
 
-  }
 
-  finally { *Counter += 1; }
 
-
 
-  return;
 
-}
 
-#endif
 
-
 
-VOID except1(IN PLONG Counter)
 
-
 
-{
 
-
 
-  try {
 
-    *Counter += 5;
 
-    RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-  }
 
-  except(except3(GetExceptionInformation(), Counter)) { *Counter += 7; }
 
-
 
-  *Counter += 9;
 
-  return;
 
-}
 
-
 
-ULONG
 
-except2(IN PEXCEPTION_POINTERS ExceptionPointers, IN PLONG Counter)
 
-
 
-{
 
-
 
-  PEXCEPTION_RECORD ExceptionRecord;
 
-
 
-  ExceptionRecord = ExceptionPointers->ExceptionRecord;
 
-  if ((ExceptionRecord->ExceptionCode == STATUS_UNSUCCESSFUL) &&
 
-      ((ExceptionRecord->ExceptionFlags & EXCEPTION_NESTED_CALL) == 0)) {
 
-    *Counter += 11;
 
-    return EXCEPTION_EXECUTE_HANDLER;
 
-
 
-  } else {
 
-    *Counter += 13;
 
-    return EXCEPTION_CONTINUE_SEARCH;
 
-  }
 
-}
 
-
 
-ULONG
 
-except3(IN PEXCEPTION_POINTERS ExceptionPointers, IN PLONG Counter)
 
-
 
-{
 
-
 
-  PEXCEPTION_RECORD ExceptionRecord;
 
-
 
-  ExceptionRecord = ExceptionPointers->ExceptionRecord;
 
-  if ((ExceptionRecord->ExceptionCode == STATUS_INTEGER_OVERFLOW) &&
 
-      ((ExceptionRecord->ExceptionFlags & EXCEPTION_NESTED_CALL) == 0)) {
 
-    *Counter += 17;
 
-    RtlRaiseStatus(STATUS_UNSUCCESSFUL);
 
-
 
-  } else if ((ExceptionRecord->ExceptionCode == STATUS_UNSUCCESSFUL) &&
 
-             ((ExceptionRecord->ExceptionFlags & EXCEPTION_NESTED_CALL) != 0)) {
 
-    *Counter += 19;
 
-    return EXCEPTION_CONTINUE_SEARCH;
 
-  }
 
-
 
-  *Counter += 23;
 
-  return EXCEPTION_EXECUTE_HANDLER;
 
-}
 
-
 
-VOID foo1(IN NTSTATUS Status)
 
-
 
-{
 
-
 
-  //
 
-  // Raise exception.
 
-  //
 
-
 
-  RtlRaiseStatus(Status);
 
-  return;
 
-}
 
-
 
-VOID foo2(IN PLONG BlackHole, IN PLONG BadAddress)
 
-
 
-{
 
-
 
-  //
 
-  // Raise exception.
 
-  //
 
-
 
-  *BlackHole += *BadAddress;
 
-  return;
 
-}
 
-
 
-#if !defined(WIN_CE) // return from finally not allowed on WinCE
 
-VOID fret(IN PLONG Counter)
 
-
 
-{
 
-
 
-  try {
 
-    try {
 
-      *Counter += 1;
 
-    }
 
-    finally {
 
-      *Counter += 1;
 
-      return;
 
-    }
 
-  }
 
-  finally { *Counter += 1; }
 
-
 
-  return;
 
-}
 
-#endif
 
-
 
-LONG Echo(IN LONG Value)
 
-
 
-{
 
-  return Value;
 
-}
 
-
 
-#if defined(NEST_IN_FINALLY)
 
-VOID Test61Part2(IN OUT PULONG Counter) {
 
-  try {
 
-    *Counter -= 1;
 
-    RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-  }
 
-  finally {
 
-    try {
 
-      *Counter += 2;
 
-      RtlRaiseStatus(STATUS_INTEGER_OVERFLOW);
 
-    }
 
-    except(EXCEPTION_EXECUTE_HANDLER) { *Counter += 5; }
 
-    *Counter += 7;
 
-  }
 
-}
 
-#endif /* def(NEST_IN_FINALLY) */
 
-
 
-double SquareDouble(IN double op) {
 
-  return exp(2.0 * log(op));
 
-}

+ 0 - 17
test/manual/samples/sample.cameligo.txt
Переглянути файл 

@@ -1,17 +0,0 @@
 
-type storage = int
 
-type parameter =
 
-  Increment of int
 
-| Decrement of int
 
-| Reset
 
-type return = operation list * storage
 
-// Two entrypoints
 
-let add (store, delta : storage * int) : storage = store + delta
 
-let sub (store, delta : storage * int) : storage = store - delta
 
-(* Main access point that dispatches to the entrypoints according to
 
-   the smart contract parameter. *)
 
-let main (action, store : parameter * storage) : return =
 
- ([] : operation list),    // No operations
 
- (match action with
 
-   Increment (n) -> add (store, n)
 
- | Decrement (n) -> sub (store, n)
 
- | Reset         -> 0)

+ 0 - 54
test/manual/samples/sample.clojure.txt
Переглянути файл 

@@ -1,54 +0,0 @@
 
-(ns game-of-life
 
-  "Conway's Game of Life, based on the work of
 
-  Christophe Grand (http://clj-me.cgrand.net/2011/08/19/conways-game-of-life)
 
-  and Laurent Petit (https://gist.github.com/1200343).")
 
-
 
-;;; Core game of life's algorithm functions
 
-
 
-(defn neighbors
 
-  "Given a cell's coordinates `[x y]`, returns the coordinates of its
 
-  neighbors."
 
-  [[x y]]
 
-  (for [dx [-1 0 1]
 
-        dy (if (zero? dx)
 
-             [-1 1]
 
-             [-1 0 1])]
 
-    [(+ dx x) (+ dy y)]))
 
-
 
-(defn step
 
-  "Given a set of living `cells`, computes the new set of living cells."
 
-  [cells]
 
-  (set (for [[cell n] (frequencies (mapcat neighbors cells))
 
-             :when (or (= n 3)
 
-                       (and (= n 2)
 
-                            (cells cell)))]
 
-         cell)))
 
-
 
-;;; Utility methods for displaying game on a text terminal
 
-
 
-(defn print-grid
 
-  "Prints a `grid` of `w` columns and `h` rows, on *out*, representing a
 
-  step in the game."
 
-  [grid w h]
 
-  (doseq [x (range (inc w))
 
-          y (range (inc h))]
 
-    (when (= y 0) (println))
 
-    (print (if (grid [x y])
 
-             "[X]"
 
-             " . "))))
 
-
 
-(defn print-grids
 
-  "Prints a sequence of `grids` of `w` columns and `h` rows on *out*,
 
-  representing several steps."
 
-  [grids w h]
 
-  (doseq [grid grids]
 
-    (print-grid grid w h)
 
-    (println)))
 
-
 
-;;; Launches an example grid
 
-
 
-(def grid
 
-  "`grid` represents the initial set of living cells"
 
-  #{[2 1] [2 2] [2 3]})
 
-
 
-(print-grids (take 3 (iterate step grid)) 5 5)

+ 0 - 28
test/manual/samples/sample.coffeescript.txt
Переглянути файл 

@@ -1,28 +0,0 @@
 
-"""
 
-A CoffeeScript sample.
 
-"""
 
-
 
-class Vehicle
 
-  constructor: (@name) =>
 
-  
-  drive: () =>
 
-    alert "Conducting #{@name}"
 
-
 
-class Car extends Vehicle
 
-  drive: () =>
 
-    alert "Driving #{@name}"
 
-
 
-c = new Car "Brandie"
 
-
 
-while notAtDestination()
 
-  c.drive()
 
-
 
-raceVehicles = (new Car for i in [1..100])
 
-
 
-startRace = (vehicles) -> [vehicle.drive() for vehicle in vehicles]
 
-
 
-fancyRegExp = ///
 
-	(\d+)	# numbers
 
-	(\w*)	# letters
 
-	$		# the end
 
-///

+ 0 - 246
test/manual/samples/sample.cpp.txt
Переглянути файл 

@@ -1,246 +0,0 @@
 
-#include "pch.h"
 
-#include "Direct3DBase.h"
 
-
 
-using namespace Microsoft::WRL;
 
-using namespace Windows::UI::Core;
 
-using namespace Windows::Foundation;
 
-
 
-// Constructor.
 
-Direct3DBase::Direct3DBase()
 
-{
 
-}
 
-
 
-// Initialize the Direct3D resources required to run.
 
-void Direct3DBase::Initialize(CoreWindow^ window)
 
-{
 
-    m_window = window;
 
-    
-    CreateDeviceResources();
 
-    CreateWindowSizeDependentResources();
 
-}
 
-
 
-// These are the resources that depend on the device.
 
-void Direct3DBase::CreateDeviceResources()
 
-{
 
-    // This flag adds support for surfaces with a different color channel ordering than the API default.
 
-    // It is recommended usage, and is required for compatibility with Direct2D.
 
-    UINT creationFlags = D3D11_CREATE_DEVICE_BGRA_SUPPORT;
 
-
 
-#if defined(_DEBUG)
 
-    // If the project is in a debug build, enable debugging via SDK Layers with this flag.
 
-    creationFlags |= D3D11_CREATE_DEVICE_DEBUG;
 
-#endif
 
-
 
-    // This array defines the set of DirectX hardware feature levels this app will support.
 
-    // Note the ordering should be preserved.
 
-    // Don't forget to declare your application's minimum required feature level in its
 
-    // description.  All applications are assumed to support 9.1 unless otherwise stated.
 
-    D3D_FEATURE_LEVEL featureLevels[] = 
-    {
 
-        D3D_FEATURE_LEVEL_11_1,
 
-        D3D_FEATURE_LEVEL_11_0,
 
-        D3D_FEATURE_LEVEL_10_1,
 
-        D3D_FEATURE_LEVEL_10_0,
 
-        D3D_FEATURE_LEVEL_9_3,
 
-        D3D_FEATURE_LEVEL_9_2,
 
-        D3D_FEATURE_LEVEL_9_1
 
-    };
 
-
 
-    // Create the DX11 API device object, and get a corresponding context.
 
-    ComPtr<ID3D11Device> device;
 
-    ComPtr<ID3D11DeviceContext> context;
 
-    DX::ThrowIfFailed(
 
-        D3D11CreateDevice(
 
-            nullptr,                    // specify null to use the default adapter
 
-            D3D_DRIVER_TYPE_HARDWARE,
 
-            nullptr,                    // leave as nullptr unless software device
 
-            creationFlags,              // optionally set debug and Direct2D compatibility flags
 
-            featureLevels,              // list of feature levels this app can support
 
-            ARRAYSIZE(featureLevels),   // number of entries in above list
 
-            D3D11_SDK_VERSION,          // always set this to D3D11_SDK_VERSION
 
-            &device,                    // returns the Direct3D device created
 
-            &m_featureLevel,            // returns feature level of device created
 
-            &context                    // returns the device immediate context
 
-            )
 
-        );
 
-
 
-    // Get the DirectX11.1 device by QI off the DirectX11 one.
 
-    DX::ThrowIfFailed(
 
-        device.As(&m_d3dDevice)
 
-        );
 
-
 
-    // And get the corresponding device context in the same way.
 
-    DX::ThrowIfFailed(
 
-        context.As(&m_d3dContext)
 
-        );
 
-}
 
-
 
-// Allocate all memory resources that change on a window SizeChanged event.
 
-void Direct3DBase::CreateWindowSizeDependentResources()
 
-{ 
-    // Store the window bounds so the next time we get a SizeChanged event we can
 
-    // avoid rebuilding everything if the size is identical.
 
-    m_windowBounds = m_window->Bounds;
 
-
 
-    // If the swap chain already exists, resize it.
 
-    if(m_swapChain != nullptr)
 
-    {
 
-        DX::ThrowIfFailed(
 
-            m_swapChain->ResizeBuffers(2, 0, 0, DXGI_FORMAT_B8G8R8A8_UNORM, 0)
 
-            );
 
-    }
 
-    // Otherwise, create a new one.
 
-    else
 
-    {
 
-        // Create a descriptor for the swap chain.
 
-        DXGI_SWAP_CHAIN_DESC1 swapChainDesc = {0};
 
-        swapChainDesc.Width = 0;                                     // use automatic sizing
 
-        swapChainDesc.Height = 0;
 
-        swapChainDesc.Format = DXGI_FORMAT_B8G8R8A8_UNORM;           // this is the most common swapchain format
 
-        swapChainDesc.Stereo = false; 
-        swapChainDesc.SampleDesc.Count = 1;                          // don't use multi-sampling
 
-        swapChainDesc.SampleDesc.Quality = 0;
 
-        swapChainDesc.BufferUsage = DXGI_USAGE_RENDER_TARGET_OUTPUT;
 
-        swapChainDesc.BufferCount = 2;                               // use two buffers to enable flip effect
 
-        swapChainDesc.Scaling = DXGI_SCALING_NONE;
 
-        swapChainDesc.SwapEffect = DXGI_SWAP_EFFECT_FLIP_SEQUENTIAL; // we recommend using this swap effect for all applications
 
-        swapChainDesc.Flags = 0;
 
-
 
-        // Once the desired swap chain description is configured, it must be created on the same adapter as our D3D Device
 
-
 
-        // First, retrieve the underlying DXGI Device from the D3D Device
 
-        ComPtr<IDXGIDevice1>  dxgiDevice;
 
-        DX::ThrowIfFailed(
 
-            m_d3dDevice.As(&dxgiDevice)
 
-            );
 
-
 
-        // Identify the physical adapter (GPU or card) this device is running on.
 
-        ComPtr<IDXGIAdapter> dxgiAdapter;
 
-        DX::ThrowIfFailed(
 
-            dxgiDevice->GetAdapter(&dxgiAdapter)
 
-            );
 
-
 
-        // And obtain the factory object that created it.
 
-        ComPtr<IDXGIFactory2> dxgiFactory;
 
-        DX::ThrowIfFailed(
 
-            dxgiAdapter->GetParent(
 
-                __uuidof(IDXGIFactory2), 
-                &dxgiFactory
 
-                )
 
-            );
 
-
 
-		Windows::UI::Core::CoreWindow^ p = m_window.Get();
 
-
 
-        // Create a swap chain for this window from the DXGI factory.
 
-        DX::ThrowIfFailed(
 
-            dxgiFactory->CreateSwapChainForCoreWindow(
 
-                m_d3dDevice.Get(),
 
-                reinterpret_cast<IUnknown*>(p),
 
-                &swapChainDesc,
 
-                nullptr,    // allow on all displays
 
-                &m_swapChain
 
-                )
 
-            );
 
-            
-        // Ensure that DXGI does not queue more than one frame at a time. This both reduces 
-        // latency and ensures that the application will only render after each VSync, minimizing 
-        // power consumption.
 
-        DX::ThrowIfFailed(
 
-            dxgiDevice->SetMaximumFrameLatency(1)
 
-            );
 
-    }
 
-    
-    // Obtain the backbuffer for this window which will be the final 3D rendertarget.
 
-    ComPtr<ID3D11Texture2D> backBuffer;
 
-    DX::ThrowIfFailed(
 
-        m_swapChain->GetBuffer(
 
-            0,
 
-            __uuidof(ID3D11Texture2D),
 
-            &backBuffer
 
-            )
 
-        );
 
-
 
-    // Create a view interface on the rendertarget to use on bind.
 
-    DX::ThrowIfFailed(
 
-        m_d3dDevice->CreateRenderTargetView(
 
-            backBuffer.Get(),
 
-            nullptr,
 
-            &m_renderTargetView
 
-            )
 
-        );
 
-
 
-    // Cache the rendertarget dimensions in our helper class for convenient use.
 
-    D3D11_TEXTURE2D_DESC backBufferDesc;
 
-    backBuffer->GetDesc(&backBufferDesc);
 
-    m_renderTargetSize.Width  = static_cast<float>(backBufferDesc.Width);
 
-    m_renderTargetSize.Height = static_cast<float>(backBufferDesc.Height);
 
-
 
-    // Create a descriptor for the depth/stencil buffer.
 
-    CD3D11_TEXTURE2D_DESC depthStencilDesc(
 
-        DXGI_FORMAT_D24_UNORM_S8_UINT, 
-        backBufferDesc.Width,
 
-        backBufferDesc.Height,
 
-        1,
 
-        1,
 
-        D3D11_BIND_DEPTH_STENCIL);
 
-
 
-    // Allocate a 2-D surface as the depth/stencil buffer.
 
-    ComPtr<ID3D11Texture2D> depthStencil;
 
-    DX::ThrowIfFailed(
 
-        m_d3dDevice->CreateTexture2D(
 
-            &depthStencilDesc,
 
-            nullptr,
 
-            &depthStencil
 
-            )
 
-        );
 
-
 
-    // Create a DepthStencil view on this surface to use on bind.
 
-    DX::ThrowIfFailed(
 
-        m_d3dDevice->CreateDepthStencilView(
 
-            depthStencil.Get(),
 
-            &CD3D11_DEPTH_STENCIL_VIEW_DESC(D3D11_DSV_DIMENSION_TEXTURE2D),
 
-            &m_depthStencilView
 
-            )
 
-        );
 
-
 
-    // Create a viewport descriptor of the full window size.
 
-    CD3D11_VIEWPORT viewPort(
 
-        0.0f,
 
-        0.0f,
 
-        static_cast<float>(backBufferDesc.Width),
 
-        static_cast<float>(backBufferDesc.Height)
 
-        );
 
-        
-    // Set the current viewport using the descriptor.
 
-    m_d3dContext->RSSetViewports(1, &viewPort);
 
-}
 
-
 
-void Direct3DBase::UpdateForWindowSizeChange()
 
-{
 
-    if (m_window->Bounds.Width  != m_windowBounds.Width ||
 
-        m_window->Bounds.Height != m_windowBounds.Height)
 
-    {
 
-        m_renderTargetView = nullptr;
 
-        m_depthStencilView = nullptr;
 
-        CreateWindowSizeDependentResources();
 
-    }
 
-}
 
-
 
-void Direct3DBase::Present()
 
-{
 
-    // The first argument instructs DXGI to block until VSync, putting the application
 
-    // to sleep until the next VSync. This ensures we don't waste any cycles rendering
 
-    // frames that will never be displayed to the screen.
 
-    HRESULT hr = m_swapChain->Present(1, 0);
 
-
 
-    // If the device was removed either by a disconnect or a driver upgrade, we 
-    // must completely reinitialize the renderer.
 
-    if (hr == DXGI_ERROR_DEVICE_REMOVED || hr == DXGI_ERROR_DEVICE_RESET)
 
-    {
 
-        Initialize(m_window.Get());
 
-    }
 
-    else
 
-    {
 
-        DX::ThrowIfFailed(hr);
 
-    }
 
-}

+ 0 - 38
test/manual/samples/sample.csharp.txt
Переглянути файл 

@@ -1,38 +0,0 @@
 
-/*

-* C# Program to Display All the Prime Numbers Between 1 to 100

-*/

-

-using System;

-using System.Collections.Generic;

-using System.Linq;

-using System.Text;

-

-namespace VS

-{

-	class Program

-	{

-		static void Main(string[] args)

-    		{

-			bool isPrime = true;

-			Console.WriteLine("Prime Numbers : ");

-			for (int i = 2; i <= 100; i++)

-			{

-				for (int j = 2; j <= 100; j++)

-				{

-					if (i != j && i % j == 0)

-					{

-						isPrime = false;

-						break;

-					}

-				}

-				

-				if (isPrime)

-				{

-					Console.Write("\t" +i);

-				}

-				isPrime = true;

-			}

-			Console.ReadKey();

-		}

-	}

-}

+ 0 - 1
test/manual/samples/sample.csp.txt
Переглянути файл 

@@ -1 +0,0 @@
 
-Content-Security-Policy: default-src 'self'; img-src *; media-src media1.com media2.com; script-src userscripts.example.com

+ 0 - 828
test/manual/samples/sample.css.txt
Переглянути файл 

@@ -1,828 +0,0 @@
 
-html {

-    background-color: #e2e2e2;

-    margin: 0;

-    padding: 0;

-}

-

-body {

-    background-color: #fff;

-    border-top: solid 10px #000;

-    color: #333;

-    font-size: .85em;

-    font-family: "Segoe UI","HelveticaNeue-Light", sans-serif;

-    margin: 0;

-    padding: 0;

-}

-

-a:link, a:visited, 

-a:active, a:hover {

-    color: #333;

-    outline: none;

-    padding-left: 0;

-    padding-right: 3px;

-    text-decoration: none;

-        

-}

-

-

-a:hover {

-    background-color: #c7d1d6;

-}

-

-

-header, footer, hgroup

-nav, section {

-    display: block;

-}

-

-.float-left {

-    float: left;

-}

-

-.float-right {

-    float: right;

-}

-

-.highlight {

-/*    background-color: #a6dbed;

-    padding-left: 5px;

-    padding-right: 5px;*/

-}

-

-.clear-fix:after {

-    content: ".";

-    clear: both;

-    display: block;

-    height: 0;

-    visibility: hidden;

-}

-

-h1, h2, h3, 

-h4, h5, h6 {

-    color: #000;

-    margin-bottom: 0;

-    padding-bottom: 0;

-    

-}

-

-h1 {

-    font-size: 2em; 

-}

-

-h2 {

-    font-size: 1.75em;

-}

-

-h3 {

-    font-size: 1.2em;

-}

-

-h4 {

-    font-size: 1.1em;

-}

-

-h5, h6 {

-    font-size: 1em;

-}

-

-

-.tile {

-    /* 2px solid #7ac0da; */

-    border: 0;

-    

-    float: left;

-    width: 200px;

-    height: 325px;

-    

-    padding: 5px;

-    margin-right: 5px;

-    margin-bottom: 20px;

-    margin-top: 20px;

-    -webkit-perspective: 0;

-    -webkit-transform-style: preserve-3d;

-    -webkit-transition: -webkit-transform 0.2s;

-    -webkit-box-shadow: 0 1px 1px rgba(0,0,0,0.3);

-    background-position: center center;

-    background-repeat: no-repeat;

-    

-    background-color:  #fff;

-}

-

-.tile-item {

-    /* 2px solid #7ac0da; */

-    border-color: inherit;

-    float: left;

-    width: 50px;

-    height: 70px;

-    margin-right: 20px;

-    margin-bottom: 20px;

-    margin-top: 20px;

-    background-image: url('../Images/documents.png');

-    background-repeat: no-repeat;

-    

-}

-

-.tile-wrapper {

-    width: 100%;

-    font-family: "Segoe UI" , Tahoma, Geneva, Verdana, sans-serif;

-    line-height: 21px;

-    font-size: 14px;

-}

-

-a.blue-box {

-    font-size: 28px;

-    height: 100px;

-    display: block;

-    border-style: solid;

-    border-width: 1px 1px 4px 1px;

-    border-color: #C0C0C0 #C0C0C0 #8ABAE4 #C0C0C0;

-    padding-top: 15px;

-    padding-left: 15px;

-}

-

-    a.blue-box:hover {

-    border: 4px solid #8ABAE4; 

-    padding-top: 12px;

-    padding-left: 12px;

-    background-color: #FFFFFF;

-}

-    

-a.green-box {

-    font-size: 28px;

-    height: 100px;

-    display: block;

-    border-style: solid;

-    border-width: 1px 1px 4px 1px;

-    border-color: #C0C0C0 #C0C0C0 #9CCF42 #C0C0C0;

-    padding-top: 15px;

-    padding-left: 15px;

-}

-

-    a.green-box:hover {

-        border: 4px solid #9CCF42; 

-        padding-top: 12px;

-        padding-left: 12px;

-        background-color: #FFFFFF;

-}

-

-

-a.green-box2 {

-    font-size: 14px;

-    height: 48px;

-    width: 48px;

-    display: block; /* border-color: #C0C0C0; */

-    padding-top: 6px;

-    font-weight: bold;

-    

-}

-

-    a.green-box2:hover {

-    border: solid #8ABAE4;

-    padding-top: 0px;

-    padding-left: 0px;

-    background-image: url('../Images/documents.png');

-    background-color: #EFEFEF;

-}

-

-a.yellow-box {

-    font-size: 28px;

-    height: 100px;

-    display: block;

-    border-style: solid;

-    border-width: 1px 1px 4px 1px;

-    border-color: #C0C0C0 #C0C0C0 #DECF6B #C0C0C0;

-    padding-top: 15px;

-    padding-left: 15px;

-}

-

-    a.yellow-box:hover {

-        border: 4px solid #DECF6B; 

-        padding-top: 12px;

-        padding-left: 12px;

-        background-color: #FFFFFF;

-}

-    

-    

-a.red-box {

-    font-size: 28px;

-    height: 100px;

-    display: block;

-    border-style: solid;

-    border-width: 1px 1px 4px 1px;

-    border-color: #C0C0C0 #C0C0C0 #F79E84 #C0C0C0;

-    padding-top: 15px;

-    padding-left: 15px;

-}

-

-    a.red-box:hover {

-    border: 4px solid #F79E84; 

-    padding-top: 12px;

-    padding-left: 12px;

-    background-color: #FFFFFF;

-}

-    

-/* main layout 

-----------------------------------------------------------*/

-.content-wrapper {

-    margin: 0 auto;

-    max-width: 960px;

-}

-

-#body {

-    background-color: #efeeef;

-    clear: both;

-    padding-bottom: 35px;

-}

-

-    .main-content {

-        background: url("../images/accent.png") no-repeat;

-        padding-left: 10px;

-        padding-top: 30px;

-    }

-

-    .featured + .main-content {

-        background: url("../images/heroaccent.png") no-repeat;

-    }

-

-footer {

-    clear: both;

-    background-color: #e2e2e2;

-    font-size: .8em;

-    height: 100px;

-}

-

-

-/* site title

-----------------------------------------------------------*/

-.site-title {

-    color: #0066CC; /* font-family: Rockwell, Consolas, "Courier New", Courier, monospace; */

-    font-size: 3.3em;

-    margin-top: 40px;

-    margin-bottom: 0;

-}

-

-.site-title a, .site-title a:hover, .site-title a:active  {

-    background: none;

-    color: #0066CC;

-    outline: none;

-    text-decoration: none;

-}

-

-

-/* login  

-----------------------------------------------------------*/

-#login {

-    display: block;

-    font-size: .85em;

-    margin-top: 20px;

-    text-align: right;

-}

-

-    #login a {

-        background-color: #d3dce0;

-        margin-left: 10px;

-        margin-right: 3px;

-        padding: 2px 3px;

-        text-decoration: none;

-    }

-    

-    #login a.username {

-        background: none;

-        margin-left: 0px;

-        text-decoration: underline;

-    }

-

-    #login li {

-        display: inline;

-        list-style: none;

-    }

-    

-    

-/* menu  

-----------------------------------------------------------*/

-ul#menu {

-    font-size: 1.3em;

-    font-weight: 600;

-    margin: 0;

-    text-align: right;

-            text-decoration: none;

-

-}

-

-    ul#menu li {

-        display: inline;

-        list-style: none;

-        padding-left: 15px;

-    }

-

-        ul#menu li a {

-            background: none;

-            color: #999;

-            text-decoration: none;

-        }

-

-        ul#menu li a:hover {

-            color: #333;

-            text-decoration: none;

-        }

-

-

-

-/* page elements  

-----------------------------------------------------------*/

-/* featured */

-.featured {

-    background-color: #fff;

-}

-

-    .featured .content-wrapper {

-        /*background-color: #7ac0da;

-        background-image: -ms-linear-gradient(left, #7AC0DA 0%, #A4D4E6 100%);

-        background-image: -o-linear-gradient(left, #7AC0DA 0%, #A4D4E6 100%);

-        background-image: -webkit-gradient(linear, left top, right top, color-stop(0, #7AC0DA), color-stop(1, #A4D4E6));

-        background-image: -webkit-linear-gradient(left, #7AC0DA 0%, #A4D4E6 100%);

-        background-image: linear-gradient(left, #7AC0DA 0%, #A4D4E6 100%);

-        color: #3e5667;

-        */

-        padding:  0px 40px 30px 40px;

-    }

-

-        .featured hgroup.title h1, .featured hgroup.title h2 {

-            /* color: #fff;

-                */

-        }

-

-        .featured p {

-            font-size: 1.1em;

-        }

-

-/* page titles */ 

-hgroup.title {

-    margin-bottom: 10px;

-}

-

-hgroup.title h1, hgroup.title h2 {

-display: inline;

-}

-

-hgroup.title h2 {

-    font-weight: normal;

-}

-

-/* releases */

-.milestone {

-    color: #fff;

-    background-color: #8ABAE4;

-    font-weight:  normal;

-    padding:  10px 10px 10px 10px;

-    margin: 0 0 0 0;

-}

-    .milestone .primary {

-        font-size: 1.75em;

-    }

-

-    .milestone .secondary {

-    font-size: 1.2em;

-    font-weight: normal;

-    /* padding: 5px 5px 5px 10px;*/

-        }

-    

-/* features */

-section.feature {

-    width: 200px;

-    float: left;

-    padding: 10px;

-}

-

-/* ordered list */

-ol.round {

-    list-style-type: none;

-    padding-left: 0;

-}

-

-    ol.round li {

-        margin: 25px 0;

-        padding-left: 45px;

-    }

-    

-        ol.round li.one {

-            background: url("../images/orderedlistOne.png") no-repeat;        

-        }

-    

-        ol.round li.two {

-            background: url("../images/orderedlistTwo.png") no-repeat;        

-        }

-    

-        ol.round li.three {

-            background: url("../images/orderedlistThree.png") no-repeat;        

-        }

-    

-/* content */  

-article {

-    float: left;

-    width: 70%;

-}

-

-aside {

-    float: right;

-    width: 25%;

-}

-

-    aside ul {

-        list-style: none;

-        padding: 0;

-    }

-    

-     aside ul li {

-        background: url("../images/bullet.png") no-repeat 0 50%;

-        padding: 2px 0 2px 20px;

-     }

-     

-.label {

-    font-weight: 700;

-}

-

-/* login page */ 

-#loginForm {

-    border-right: solid 2px #c8c8c8;

-    float: left;

-    width: 45%;

-}

-

-    #loginForm .validation-error {

-        display: block;

-        margin-left: 15px;

-    }

-

-#socialLoginForm {

-    margin-left: 40px;

-    float: left;

-    width: 50%;

-}

-

-/* contact */

-.contact h3 {

-    font-size: 1.2em;

-}

-

-.contact p {

-    margin: 5px 0 0 10px;

-}

-

-.contact iframe {

-    border: solid 1px #333;

-    margin: 5px 0 0 10px;

-}

-

-/* forms */

-fieldset {

-    border: none;

-    margin: 0;

-    padding: 0;

-}

-

-    fieldset legend {

-        display: none;

-    }

-    

-    fieldset ol {

-        padding: 0;

-        list-style: none;

-    }

-    

-        fieldset ol li {

-            padding-bottom: 5px;

-        }

-    

-    fieldset label {

-        display: block;

-        font-size: 1.2em;

-        font-weight: 600;

-    }

-    

-    fieldset label.checkbox {

-        display: inline;

-    }

-    

-    fieldset input[type="text"], 

-    fieldset input[type="password"] {

-        border: 1px solid #e2e2e2;

-        color: #333;

-        font-size: 1.2em;

-        margin: 5px 0 6px 0;

-        padding: 5px;

-        width: 300px;

-    }

-    

-        fieldset input[type="text"]:focus, 

-        fieldset input[type="password"]:focus {

-            border: 1px solid #7ac0da;

-        }

-    

-    fieldset input[type="submit"] {

-        background-color: #d3dce0;

-        border: solid 1px #787878;

-        cursor: pointer;

-        font-size: 1.2em;

-        font-weight: 600;

-        padding: 7px;

-    }

-

-/* ajax login/registration dialog */

-.modal-popup {

-    font-size: 0.7em;

-}

-

-/* info and errors */  

-.message-info {

-    border: solid 1px;

-    clear: both;

-    padding: 10px 20px;

-}

-

-.message-error {

-    clear: both;

-    color: #e80c4d;

-    font-size: 1.1em;

-    font-weight: bold;

-    margin: 20px 0 10px 0;

-}

-

-.message-success {

-    color: #7ac0da;

-    font-size: 1.3em;

-    font-weight: bold;

-    margin: 20px 0 10px 0;

-}

-

-.success {

-    color: #7ac0da;

-}

-

-.error {

-    color: #e80c4d;

-}

-

-/* styles for validation helpers */

-.field-validation-error {

-    color: #e80c4d;

-    font-weight: bold;

-}

-

-.field-validation-valid {

-    display: none;

-}

-

-input[type="text"].input-validation-error,

-input[type="password"].input-validation-error {

-    border: solid 1px #e80c4d;

-}

-

-.validation-summary-errors {

-    color: #e80c4d;

-    font-weight: bold;

-    font-size: 1.1em;

-}

-

-.validation-summary-valid {

-    display: none;

-}

-

-

-/* social */

-ul#social li {

-    display: inline;

-    list-style: none;

-}

-

-    ul#social li a {

-        color: #999;

-        text-decoration: none;

-    }

-        

-    a.facebook, a.twitter {

-        display: block;

-        float: left;

-        height: 24px;

-        padding-left: 17px;

-        text-indent: -9999px;

-        width: 16px;

-    }

-        

-    a.facebook {

-        background: url("../images/facebook.png") no-repeat;

-    }

-        

-    a.twitter {

-        background: url("../images/twitter.png") no-repeat;

-    }

-        

-        

-        

-/********************

-*   Mobile Styles   *

-********************/

-@media only screen and (max-width: 850px) {

-    

-    /* header  

-    ----------------------------------------------------------*/

-    header .float-left, 

-    header .float-right {

-        float: none;

-    }

-    

-    /* logo */

-    header .site-title {

-        /*margin: 0; */

-        /*margin: 10px;*/

-        text-align: left;

-        padding-left: 0;

-    }

-

-    /* login */

-    #login {

-        font-size: .85em;

-        margin-top: 0;

-        text-align: center;

-    }

-    

-        #login ul {

-            margin: 5px 0;

-            padding: 0;

-        }

-        

-        #login li {

-            display: inline;

-            list-style: none;

-            margin: 0;

-            padding:0;

-        }

-

-        #login a {

-            background: none;

-            color: #999;

-            font-weight: 600;

-            margin: 2px;

-            padding: 0;

-        }

-        

-        #login a:hover {

-            color: #333;

-        }

-

-    /* menu */

-    nav {

-        margin-bottom: 5px;

-    }

-    

-    ul#menu {

-        margin: 0;

-        padding:0;

-        text-align: center;

-    }

-

-        ul#menu li {

-            margin: 0;

-            padding: 0;

-        }

-

-        

-    /* main layout  

-    ----------------------------------------------------------*/

-    .main-content,

-    .featured + .main-content {

-        background-position: 10px 0;

-    }

-    

-    .content-wrapper {

-        padding-right: 10px;

-        padding-left: 10px;

-    }

-

-    .featured .content-wrapper {

-        padding: 10px;

-    }

-    

-    /* page content */  

-    article, aside {

-        float: none;

-        width: 100%;

-    }

-    

-    /* ordered list */

-    ol.round {

-        list-style-type: none;

-        padding-left: 0;

-    }

-

-        ol.round li {

-            padding-left: 10px;

-            margin: 25px 0;

-        }

-    

-            ol.round li.one,

-            ol.round li.two,

-            ol.round li.three {

-                background: none;        

-            }

-     

-     /* features */

-     section.feature {

-        float: none;

-        padding: 10px;

-        width: auto;

-     }

-     

-        section.feature img {

-            color: #999;

-            content: attr(alt);

-            font-size: 1.5em;

-            font-weight: 600;

-        }

-        

-    /* forms */    

-    fieldset input[type="text"], 

-    fieldset input[type="password"] {

-        width: 90%;

-    }

-    

-    /* login page */ 

-    #loginForm {

-        border-right: none;

-        float: none;

-        width: auto;

-    }

-

-        #loginForm .validation-error {

-            display: block;

-            margin-left: 15px;

-        }

-

-    #socialLoginForm {

-        margin-left: 0;

-        float: none;

-        width: auto;

-    }

-

-    /* footer  

-    ----------------------------------------------------------*/    

-    footer .float-left,

-    footer .float-right {

-        float: none;

-    }

-    

-    footer {

-        text-align: center;

-        height: auto;

-        padding: 10px 0;

-    }

-    

-        footer p {

-            margin: 0;

-        }

-    

-        ul#social {

-            padding:0;

-            margin: 0;

-        }

-    

-         a.facebook, a.twitter {

-            background: none;

-            display: inline;

-            float: none;

-            height: auto;

-            padding-left: 0;

-            text-indent: 0;

-            width: auto;

-        }    

-}

-

-.subsite {

-	color: #444;

-}

-

-h3 {

-	font-weight: normal;

-	font-size: 24px;

-	color: #444;

-	margin-bottom: 20px;

-}

-

-.tiles {

-	padding-bottom: 20px;

-	background-color: #e3e3e3;

-}

-

-#editor {

-	margin: 0 auto;

-	height: 500px;

-	border: 1px solid #ccc;

-}

-

-.monaco-editor.monaco, .monaco-editor.vs, .monaco-editor.eclipse {

-	background: #F9F9F9;

-}

-

-.monaco-editor.monaco .monaco-editor-background, .monaco-editor.vs .monaco-editor-background, .monaco-editor.eclipse .monaco-editor-background {

-	background: #F9F9F9;

-}

+ 0 - 37
test/manual/samples/sample.dart.txt
Переглянути файл 

@@ -1,37 +0,0 @@
 
-import 'dart:async';
 
-import 'dart:math' show Random;
 
-main() async {
 
-  print('Compute π using the Monte Carlo method.');
 
-  await for (var estimate in computePi().take(100)) {
 
-    print('π ≅ $estimate');
 
-  }
 
-}
 
-/// Generates a stream of increasingly accurate estimates of π.
 
-Stream<double> computePi({int batch: 100000}) async* {
 
-  var total = 0;
 
-  var count = 0;
 
-  while (true) {
 
-    var points = generateRandom().take(batch);
 
-    var inside = points.where((p) => p.isInsideUnitCircle);
 
-    total += batch;
 
-    count += inside.length;
 
-    var ratio = count / total;
 
-    // Area of a circle is A = π⋅r², therefore π = A/r².
 
-    // So, when given random points with x ∈ <0,1>,
 
-    // y ∈ <0,1>, the ratio of those inside a unit circle
 
-    // should approach π / 4. Therefore, the value of π
 
-    // should be:
 
-    yield ratio * 4;
 
-  }
 
-}
 
-Iterable<Point> generateRandom([int seed]) sync* {
 
-  final random = Random(seed);
 
-  while (true) {
 
-    yield Point(random.nextDouble(), random.nextDouble());
 
-  }
 
-}
 
-class Point {
 
-  final double x, y;
 
-  const Point(this.x, this.y);
 
-  bool get isInsideUnitCircle => x * x + y * y <= 1;
 
-}

+ 0 - 32
test/manual/samples/sample.dockerfile.txt
Переглянути файл 

@@ -1,32 +0,0 @@
 
-FROM mono:3.12

-

-ENV KRE_FEED https://www.myget.org/F/aspnetvnext/api/v2

-ENV KRE_USER_HOME /opt/kre

-

-RUN apt-get -qq update && apt-get -qqy install unzip 

-

-ONBUILD RUN curl -sSL https://raw.githubusercontent.com/aspnet/Home/dev/kvminstall.sh | sh

-ONBUILD RUN bash -c "source $KRE_USER_HOME/kvm/kvm.sh \

-    && kvm install latest -a default \

-    && kvm alias default | xargs -i ln -s $KRE_USER_HOME/packages/{} $KRE_USER_HOME/packages/default"

-

-# Install libuv for Kestrel from source code (binary is not in wheezy and one in jessie is still too old)

-RUN apt-get -qqy install \

-    autoconf \

-    automake \

-    build-essential \

-    libtool 

-RUN LIBUV_VERSION=1.0.0-rc2 \

-    && curl -sSL https://github.com/joyent/libuv/archive/v${LIBUV_VERSION}.tar.gz | tar zxfv - -C /usr/local/src \

-    && cd /usr/local/src/libuv-$LIBUV_VERSION \

-    && sh autogen.sh && ./configure && make && make install \

-    && rm -rf /usr/local/src/libuv-$LIBUV_VERSION \

-    && ldconfig

-

-ENV PATH $PATH:$KRE_USER_HOME/packages/default/bin

-

-# Extra things to test

-RUN echo "string at end"

-RUN echo must work 'some str' and some more

-RUN echo hi this is # not a comment

-RUN echo 'String with ${VAR} and another $one here'

+ 0 - 80
test/manual/samples/sample.elixir.txt
Переглянути файл 

@@ -1,80 +0,0 @@
 
-# Elixir is a dynamic, functional language for building scalable
 
-# and maintainable applications. Learn more: https://elixir-lang.org
 
-
 
-"Elixir" |> String.graphemes() |> Enum.frequencies()
 
-#=> %{"E" => 1, "i" => 2, "l" => 1, "r" => 1, "x" => 1}
 
-
 
-
 
-### Scalability ###
 
-
 
-# All Elixir code runs inside lightweight threads of execution (called processes)
 
-# that are isolated and exchange information via messages:
 
-
 
-current_process = self()
 
-
 
-# Spawn an Elixir process (not an operating system one!)
 
-spawn_link(fn ->
 
-  send(current_process, {:msg, "hello world"})
 
-end)
 
-
 
-# Block until the message is received
 
-receive do
 
-  {:msg, contents} -> IO.puts(contents)
 
-end
 
-
 
-
 
-### Fault-tolerance ###
 
-
 
-# To cope with failures, Elixir provides supervisors which describe
 
-# how to restart parts of your system when things go awry, going back
 
-# to a known initial state that is guaranteed to work:
 
-
 
-children = [
 
-  TCP.Pool,
 
-  {TCP.Acceptor, port: 4040}
 
-]
 
-
 
-Supervisor.start_link(children, strategy: :one_for_one)
 
-
 
-
 
-### Functional programming ###
 
-
 
-# Functional programming promotes a coding style that helps
 
-# developers write code that is short, concise, and maintainable.
 
-# One prominent example is pattern matching:
 
-
 
-%User{name: name, age: age} = User.get("John Doe")
 
-name #=> "John Doe"
 
-
 
-# When mixed with guards, pattern matching allows us to elegantly
 
-# match and assert specific conditions for some code to execute:
 
-
 
-def drive(%User{age: age}) when age >= 16 do
 
-  # Code that drives a car
 
-end
 
-
 
-drive(User.get("John Doe"))
 
-#=> Fails if the user is under 16
 
-
 
-
 
-### Extensibility and DSLs ###
 
-
 
-# Elixir has been designed to be extensible, letting developers
 
-# naturally extend the language to particular domains,
 
-# in order to increase their productivity.
 
-
 
-defmodule MathTest do
 
-  use ExUnit.Case, async: true
 
-
 
-  test "can add two numbers" do
 
-    assert 1 + 1 == 2
 
-  end
 
-end
 
-
 
-
 
-### Erlang compatible ###
 
-
 
-# An Elixir programmer can invoke any Erlang function with no runtime cost:
 
-
 
-:crypto.hash(:md5, "Using crypto from Erlang OTP")
 
-#=> <<192, 223, 75, 115, ...>>

+ 0 - 8
test/manual/samples/sample.fsharp.txt
Переглянути файл 

@@ -1,8 +0,0 @@
 
-(* Sample F# application *)

-[<EntryPoint>]

-let main argv = 

-    printfn "%A" argv

-    System.Console.WriteLine("Hello from F#")

-    0 // return an integer exit code

-

-//--------------------------------------------------------

+ 0 - 111
test/manual/samples/sample.go.txt
Переглянути файл 

@@ -1,111 +0,0 @@
 
-// We often need our programs to perform operations on

-// collections of data, like selecting all items that

-// satisfy a given predicate or mapping all items to a new

-// collection with a custom function.

-

-// In some languages it's idiomatic to use [generic](http://en.wikipedia.org/wiki/Generic_programming)

-// data structures and algorithms. Go does not support

-// generics; in Go it's common to provide collection

-// functions if and when they are specifically needed for

-// your program and data types.

-

-// Here are some example collection functions for slices

-// of `strings`. You can use these examples to build your

-// own functions. Note that in some cases it may be

-// clearest to just inline the collection-manipulating

-// code directly, instead of creating and calling a

-// helper function.

-

-package main

-

-import "strings"

-import "fmt"

-

-// Returns the first index of the target string `t`, or

-// -1 if no match is found.

-func Index(vs []string, t string) int {

-    for i, v := range vs {

-        if v == t {

-            return i

-        }

-    }

-    return -1

-}

-

-// Returns `true` if the target string t is in the

-// slice.

-func Include(vs []string, t string) bool {

-    return Index(vs, t) >= 0

-}

-

-// Returns `true` if one of the strings in the slice

-// satisfies the predicate `f`.

-func Any(vs []string, f func(string) bool) bool {

-    for _, v := range vs {

-        if f(v) {

-            return true

-        }

-    }

-    return false

-}

-

-// Returns `true` if all of the strings in the slice

-// satisfy the predicate `f`.

-func All(vs []string, f func(string) bool) bool {

-    for _, v := range vs {

-        if !f(v) {

-            return false

-        }

-    }

-    return true

-}

-

-// Returns a new slice containing all strings in the

-// slice that satisfy the predicate `f`.

-func Filter(vs []string, f func(string) bool) []string {

-    vsf := make([]string, 0)

-    for _, v := range vs {

-        if f(v) {

-            vsf = append(vsf, v)

-        }

-    }

-    return vsf

-}

-

-// Returns a new slice containing the results of applying

-// the function `f` to each string in the original slice.

-func Map(vs []string, f func(string) string) []string {

-    vsm := make([]string, len(vs))

-    for i, v := range vs {

-        vsm[i] = f(v)

-    }

-    return vsm

-}

-

-func main() {

-

-    // Here we try out our various collection functions.

-    var strs = []string{"peach", "apple", "pear", "plum"}

-

-    fmt.Println(Index(strs, "pear"))

-

-    fmt.Println(Include(strs, "grape"))

-

-    fmt.Println(Any(strs, func(v string) bool {

-        return strings.HasPrefix(v, "p")

-    }))

-

-    fmt.Println(All(strs, func(v string) bool {

-        return strings.HasPrefix(v, "p")

-    }))

-

-    fmt.Println(Filter(strs, func(v string) bool {

-        return strings.Contains(v, "e")

-    }))

-

-    // The above examples all used anonymous functions,

-    // but you can also use named functions of the correct

-    // type.

-    fmt.Println(Map(strs, strings.ToUpper))

-

-}

+ 0 - 263
test/manual/samples/sample.graphql.txt
Переглянути файл 

@@ -1,263 +0,0 @@
 
-# GraphQL Schema Definition Language
 
-
 
-"""
 
-Color value
 
-"""
 
-scalar Color
 
-
 
-"""
 
-Node interface
 
-
 
-- allows (re)fetch arbitrary entity only by ID
 
-- allows client side cache normalization
 
-
 
-See [Relay Global Object Identification Specification](https://facebook.github.io/relay/graphql/objectidentification.htm)
 
-"""
 
-interface Node {
 
-  """
 
-  Globally unique identifier,
 
-  typically `${__typename}:${dbId}`
 
-  may be encoded in *base64*
 
-  """
 
-  id: ID!
 
-}
 
-
 
-"""
 
-A character in the Star Wars Trilogy
 
-"""
 
-interface Character {
 
-  """
 
-  The id of the character.
 
-  """
 
-  id: ID!
 
-
 
-  """
 
-  The name of the character.
 
-  """
 
-  name: String
 
-
 
-  """
 
-  The friends of the character, or an empty list if they have none.
 
-  """
 
-  friends: [Character]
 
-
 
-  """
 
-  Which movies they appear in
 
-  """
 
-  appearsIn: [Episode]
 
-
 
-  """
 
-  All secrets about their past
 
-  """
 
-  secretBackstory: String
 
-}
 
-
 
-"""
 
-A mechanical creature in the Star Wars universe.
 
-"""
 
-type Droid implements Character {
 
-  """
 
-  The id of the droid.
 
-  """
 
-  id: ID!
 
-
 
-  """
 
-  The name of the droid.
 
-  """
 
-  name: String
 
-
 
-  """
 
-  The friends of the droid, or an empty list if they have none.
 
-  """
 
-  friends: [Character]
 
-
 
-  """
 
-  Which movies they appear in.
 
-  """
 
-  appearsIn: [Episode]
 
-
 
-  """
 
-  Construction date and the name of the designer.
 
-  """
 
-  secretBackstory: String
 
-
 
-  """
 
-  The primary function of the droid.
 
-  """
 
-  primaryFunction: String
 
-
 
-  """
 
-  Chase color of the droid.
 
-  """
 
-  color: Color
 
-}
 
-
 
-# One of the films in the Star Wars Trilogy
 
-enum Episode {
 
-  """
 
-  Released in 1977.
 
-  """
 
-  NEWHOPE
 
-
 
-  """
 
-  Released in 1980.
 
-  """
 
-  EMPIRE
 
-
 
-  """
 
-  Released in 1983.
 
-  """
 
-  JEDI
 
-}
 
-
 
-"""
 
-A humanoid creature in the Star Wars universe.
 
-"""
 
-type Human implements Character {
 
-  """
 
-  The id of the human.
 
-  """
 
-  id: ID!
 
-
 
-  """
 
-  The name of the human.
 
-  """
 
-  name: String
 
-
 
-  """
 
-  The friends of the human, or an empty list if they have none.
 
-  """
 
-  friends: [Character]
 
-
 
-  """
 
-  Which movies they appear in.
 
-  """
 
-  appearsIn: [Episode]
 
-
 
-  """
 
-  The home planet of the human, or null if unknown.
 
-  """
 
-  homePlanet: String
 
-
 
-  """
 
-  Where are they from and how they came to be who they are.
 
-  """
 
-  secretBackstory: String
 
-}
 
-
 
-enum LengthUnit {
 
-  METER
 
-  FEET
 
-}
 
-
 
-type Starship {
 
-  id: ID!
 
-  name: String!
 
-  length(unit: LengthUnit = METER): Float
 
-}
 
-
 
-union SearchResult = Human | Droid | Starship
 
-
 
-input SearchInput {
 
-  name: String
 
-  episode: Episode
 
-}
 
-
 
-"""
 
-Root Query
 
-"""
 
-type Query {
 
-  """
 
-  Return the hero by episode.
 
-  """
 
-  hero(
 
-    """
 
-    If omitted, returns the hero of the whole saga. If provided, returns the hero of that particular episode.
 
-    """
 
-    episode: Episode
 
-  ): Character
 
-
 
-  """
 
-  Return the Human by ID.
 
-  """
 
-  human(
 
-    """
 
-    id of the human
 
-    """
 
-    id: ID!
 
-  ): Human
 
-
 
-  """
 
-  Return the Droid by ID.
 
-  """
 
-  droid(
 
-    """
 
-    id of the droid
 
-    """
 
-    id: ID!
 
-  ): Droid
 
-
 
-  """
 
-  Search everything by name
 
-
 
-  __NOTE__: You should use Relay pagination
 
-  """
 
-  search(search: SearchInput!): [SearchResult]
 
-    @deprecated(reason: "`search` will be replaced.")
 
-}
 
-
 
-"""
 
-Root Mutation
 
-"""
 
-type Mutation {
 
-  """
 
-  Save the favorite episode.
 
-  """
 
-  favorite(
 
-    """
 
-    Favorite episode.
 
-    """
 
-    episode: Episode!
 
-  ): Episode
 
-}
 
-
 
-"""
 
-Subscriptions — live events
 
-"""
 
-type Subscription {
 
-  """
 
-  Message
 
-  """
 
-  message: String
 
-}
 
-
 
-extend type Query {
 
-  """
 
-  Dummy query for highlighting test
 
-  """
 
-  dummy(
 
-    int: Int = 123
 
-    float: Float = 123.456
 
-    str: String = "Hello World!"
 
-    boolDefaultTrue: Boolean = true
 
-    boolDefaultFalse: Boolean = false
 
-    id: ID
 
-    search: SearchInput = null
 
-  ): Boolean
 
-}
 
-
 
-schema {
 
-  query: Query
 
-  mutation: Mutation
 
-  subscription: Subscription
 
-}
 
-
 
-# GraphQL Query Language
 
-
 
-query dummyQuery($int: Int) {
 
-  dummy(int: $int)
 
-}
 
-
 
-mutation favoriteEpisode($episode: Episode) {
 
-  favorite(episode: $episode)
 
-}

+ 0 - 31
test/manual/samples/sample.handlebars.txt
Переглянути файл 

@@ -1,31 +0,0 @@
 
-
 
-<div class="entry">
 
-	<h1>{{title}}</h1>
 
-	{{#if author}}
 
-	<h2>{{author.firstName}} {{author.lastName}}</h2>
 
-	{{else}}
 
-	<h2>Unknown Author</h2>
 
-	{{/if}}
 
-	{{contentBody}}
 
-</div>
 
-
 
-{{#unless license}}
 
-  <h3 class="warning">WARNING: This entry does not have a license!</h3>
 
-{{/unless}}
 
-
 
-<div class="footnotes">
 
-	<ul>
 
-		{{#each footnotes}}
 
-		<li>{{this}}</li>
 
-		{{/each}}
 
-	</ul>
 
-</div>
 
-
 
-<h1>Comments</h1>
 
-
 
-<div id="comments">
 
-	{{#each comments}}
 
-	<h2><a href="/posts/{{../permalink}}#{{id}}">{{title}}</a></h2>
 
-	<div>{{body}}</div>
 
-	{{/each}}
 
-</div>

+ 0 - 48
test/manual/samples/sample.hcl.txt
Переглянути файл 

@@ -1,48 +0,0 @@
 
-terraform {

-  required_providers {

-    aws = {

-      source  = "hashicorp/aws"

-      version = "~> 1.0.4"

-    }

-  }

-}

-

-variable "aws_region" {}

-

-variable "base_cidr_block" {

-  description = "A /16 CIDR range definition, such as 10.1.0.0/16, that the VPC will use"

-  default = "10.1.0.0/16"

-}

-

-variable "availability_zones" {

-  description = "A list of availability zones in which to create subnets"

-  type = list(string)

-}

-

-provider "aws" {

-  region = var.aws_region

-}

-

-resource "aws_vpc" "main" {

-  # Referencing the base_cidr_block variable allows the network address

-  # to be changed without modifying the configuration.

-  cidr_block = var.base_cidr_block

-}

-

-resource "aws_subnet" "az" {

-  # Create one subnet for each given availability zone.

-  count = length(var.availability_zones)

-

-  # For each subnet, use one of the specified availability zones.

-  availability_zone = var.availability_zones[count.index]

-

-  # By referencing the aws_vpc.main object, Terraform knows that the subnet

-  # must be created only after the VPC is created.

-  vpc_id = aws_vpc.main.id

-

-  # Built-in functions and operators can be used for simple transformations of

-  # values, such as computing a subnet address. Here we create a /20 prefix for

-  # each subnet, using consecutive addresses for each availability zone,

-  # such as 10.1.16.0/20 .

-  cidr_block = cidrsubnet(aws_vpc.main.cidr_block, 4, count.index+1)

-}

+ 0 - 100
test/manual/samples/sample.html.txt
Переглянути файл 

@@ -1,100 +0,0 @@
 
-<!DOCTYPE HTML>

-<!--Example of comments in HTML-->

-<html>

-<head>

-	<!--This is the head section-->

-	<title>HTML Sample</title>

-	<meta charset="utf-8">

-

-	<!--This is the style tag to set style on elements-->

-	<style type="text/css">

-		h1

-		{

-			font-family: Tahoma;

-			font-size: 40px;

-			font-weight: normal;

-			margin: 50px;

-			color: #a0a0a0;

-		}

-

-		h2

-		{

-			font-family: Tahoma;

-			font-size: 30px;

-			font-weight: normal;

-			margin: 50px;

-			color: #fff;

-		}

-

-		p

-		{

-			font-family: Tahoma;

-			font-size: 17px;

-			font-weight: normal;

-			margin: 0px 200px;

-			color: #fff;

-		}

-

-		div.Center

-		{

-			text-align: center;

-		}

-

-		div.Blue

-		{

-			padding: 50px;

-			background-color: #7bd2ff;

-		}

-

-		button.Gray

-		{

-			font-family: Tahoma;

-			font-size: 17px;

-			font-weight: normal;

-			margin-top: 100px;

-			padding: 10px 50px;

-			background-color: #727272;

-			color: #fff;

-			outline: 0;

-    			border: none;

-    			cursor: pointer;

-		}

-

-		button.Gray:hover

-		{

-			background-color: #898888;

-		}

-

-		button.Gray:active

-		{

-			background-color: #636161;

-		}

-

-	</style>

-

-	<!--This is the script tag-->

-	<script type="text/javascript">

-		function ButtonClick(){

-			// Example of comments in JavaScript

-			window.alert("I'm an alert sample!");

-		}

-	</script>

-</head>

-<body>

-	<!--This is the body section-->

-	<div class="Center">

-		<h1>NAME OF SITE</h1>

-	</div>

-	<div class="Center Blue">

-			<h2>I'm h2 Header! Edit me in &lt;h2&gt;</h2>

-			<p>

-				I'm a paragraph! Edit me in &lt;p&gt;

-				to add your own content and make changes to the style and font.

-				It's easy! Just change the text between &lt;p&gt; ... &lt;/p&gt; and change the style in &lt;style&gt;.

-				You can make it as long as you wish. The browser will automatically wrap the lines to accommodate the

-				size of the browser window.

-			</p>

-			<button class="Gray" onclick="ButtonClick()">Click Me!</button>

-	</div>

-</body>

-</html>

+ 0 - 15
test/manual/samples/sample.ini.txt
Переглянути файл 

@@ -1,15 +0,0 @@
 
-# Example of a .gitconfig file

-

-[core]

-	repositoryformatversion = 0

-	filemode = false

-	bare = false

-	logallrefupdates = true

-	symlinks = false

-	ignorecase = true

-	hideDotFiles = dotGitOnly

-

-# Defines the master branch

-[branch "master"]

-	remote = origin

-	merge = refs/heads/master

+ 0 - 54
test/manual/samples/sample.java.txt
Переглянути файл 

@@ -1,54 +0,0 @@
 
-/*
 
-	Basic Java example using FizzBuzz
 
-*/
 
-
 
-import java.util.Random;
 
-
 
-public class Example {
 
-	public static void main (String[] args){
 
-		// Generate a random number between 1-100. (See generateRandomNumber method.)
 
-		int random = generateRandomNumber(100);
 
-
 
-		// Output generated number.
 
-		System.out.println("Generated number: " + random + "\n");
 
-
 
-		// Loop between 1 and the number we just generated.
 
-		for (int i=1; i<=random; i++){
 
-			// If i is divisible by both 3 and 5, output "FizzBuzz".
 
-			if (i % 3 == 0 && i % 5 == 0){
 
-				System.out.println("FizzBuzz");
 
-			}
 
-			// If i is divisible by 3, output "Fizz"
 
-			else if (i % 3 == 0){
 
-				System.out.println("Fizz");
 
-			}
 
-			// If i is divisible by 5, output "Buzz".
 
-			else if (i % 5 == 0){
 
-				System.out.println("Buzz");
 
-			}
 
-			// If i is not divisible by either 3 or 5, output the number.
 
-			else {
 
-				System.out.println(i);
 
-			}
 
-		}
 
-	}
 
-
 
-	/**
 
-		Generates a new random number between 0 and 100.
 
-		@param bound The highest number that should be generated.
 
-		@return An integer representing a randomly generated number between 0 and 100.
 
-	*/
 
-	private static int generateRandomNumber(int bound){
 
-		// Create new Random generator object and generate the random number.
 
-		Random randGen = new Random();
 
-		int randomNum = randGen.nextInt(bound);
 
-
 
-		// If the random number generated is zero, use recursion to regenerate the number until it is not zero.
 
-		if (randomNum < 1){
 
-			randomNum = generateRandomNumber(bound);
 
-		}
 
-
 
-		return randomNum;
 
-	}
 
-}
 
-

+ 0 - 214
test/manual/samples/sample.javascript.txt
Переглянути файл 

@@ -1,214 +0,0 @@
 
-/*

-  © Microsoft. All rights reserved.

-

-  This library is supported for use in Windows Tailored Apps only.

-

-  Build: 6.2.8100.0 

-  Version: 0.5 

-*/

-

-(function (global, undefined) {

-	"use strict";

-	undefinedVariable = {};

-	undefinedVariable.prop = 5;

-

-	function initializeProperties(target, members) {

-		var keys = Object.keys(members);

-		var properties;

-		var i, len;

-		for (i = 0, len = keys.length; i < len; i++) {

-			var key = keys[i];

-			var enumerable = key.charCodeAt(0) !== /*_*/95;

-			var member = members[key];

-			if (member && typeof member === 'object') {

-				if (member.value !== undefined || typeof member.get === 'function' || typeof member.set === 'function') {

-					if (member.enumerable === undefined) {

-						member.enumerable = enumerable;

-					}

-					properties = properties || {};

-					properties[key] = member;

-					continue;

-				} 

-			}

-			if (!enumerable) {

-				properties = properties || {};

-				properties[key] = { value: member, enumerable: enumerable, configurable: true, writable: true }

-				continue;

-			}

-			target[key] = member;

-		}

-		if (properties) {

-			Object.defineProperties(target, properties);

-		}

-	}

-

-	(function (rootNamespace) {

-

-		// Create the rootNamespace in the global namespace

-		if (!global[rootNamespace]) {

-			global[rootNamespace] = Object.create(Object.prototype);

-		}

-

-		// Cache the rootNamespace we just created in a local variable

-		var _rootNamespace = global[rootNamespace];

-		if (!_rootNamespace.Namespace) {

-			_rootNamespace.Namespace = Object.create(Object.prototype);

-		}

-

-		function defineWithParent(parentNamespace, name, members) {

-			/// <summary locid="1">

-			/// Defines a new namespace with the specified name, under the specified parent namespace.

-			/// </summary>

-			/// <param name="parentNamespace" type="Object" locid="2">

-			/// The parent namespace which will contain the new namespace.

-			/// </param>

-			/// <param name="name" type="String" locid="3">

-			/// Name of the new namespace.

-			/// </param>

-			/// <param name="members" type="Object" locid="4">

-			/// Members in the new namespace.

-			/// </param>

-			/// <returns locid="5">

-			/// The newly defined namespace.

-			/// </returns>

-			var currentNamespace = parentNamespace,

-				namespaceFragments = name.split(".");

-

-			for (var i = 0, len = namespaceFragments.length; i < len; i++) {

-				var namespaceName = namespaceFragments[i];

-				if (!currentNamespace[namespaceName]) {

-					Object.defineProperty(currentNamespace, namespaceName, 

-						{ value: {}, writable: false, enumerable: true, configurable: true }

-					);

-				}

-				currentNamespace = currentNamespace[namespaceName];

-			}

-

-			if (members) {

-				initializeProperties(currentNamespace, members);

-			}

-

-			return currentNamespace;

-		}

-

-		function define(name, members) {

-			/// <summary locid="6">

-			/// Defines a new namespace with the specified name.

-			/// </summary>

-			/// <param name="name" type="String" locid="7">

-			/// Name of the namespace.  This could be a dot-separated nested name.

-			/// </param>

-			/// <param name="members" type="Object" locid="4">

-			/// Members in the new namespace.

-			/// </param>

-			/// <returns locid="5">

-			/// The newly defined namespace.

-			/// </returns>

-			return defineWithParent(global, name, members);

-		}

-

-		// Establish members of the "WinJS.Namespace" namespace

-		Object.defineProperties(_rootNamespace.Namespace, {

-

-			defineWithParent: { value: defineWithParent, writable: true, enumerable: true },

-

-			define: { value: define, writable: true, enumerable: true }

-

-		});

-

-	})("WinJS");

-

-	(function (WinJS) {

-

-		function define(constructor, instanceMembers, staticMembers) {

-			/// <summary locid="8">

-			/// Defines a class using the given constructor and with the specified instance members.

-			/// </summary>

-			/// <param name="constructor" type="Function" locid="9">

-			/// A constructor function that will be used to instantiate this class.

-			/// </param>

-			/// <param name="instanceMembers" type="Object" locid="10">

-			/// The set of instance fields, properties and methods to be made available on the class.

-			/// </param>

-			/// <param name="staticMembers" type="Object" locid="11">

-			/// The set of static fields, properties and methods to be made available on the class.

-			/// </param>

-			/// <returns type="Function" locid="12">

-			/// The newly defined class.

-			/// </returns>

-			constructor = constructor || function () { };

-			if (instanceMembers) {

-				initializeProperties(constructor.prototype, instanceMembers);

-			}

-			if (staticMembers) {

-				initializeProperties(constructor, staticMembers);

-			}

-			return constructor;

-		}

-

-		function derive(baseClass, constructor, instanceMembers, staticMembers) {

-			/// <summary locid="13">

-			/// Uses prototypal inheritance to create a sub-class based on the supplied baseClass parameter.

-			/// </summary>

-			/// <param name="baseClass" type="Function" locid="14">

-			/// The class to inherit from.

-			/// </param>

-			/// <param name="constructor" type="Function" locid="9">

-			/// A constructor function that will be used to instantiate this class.

-			/// </param>

-			/// <param name="instanceMembers" type="Object" locid="10">

-			/// The set of instance fields, properties and methods to be made available on the class.

-			/// </param>

-			/// <param name="staticMembers" type="Object" locid="11">

-			/// The set of static fields, properties and methods to be made available on the class.

-			/// </param>

-			/// <returns type="Function" locid="12">

-			/// The newly defined class.

-			/// </returns>

-			if (baseClass) {

-				constructor = constructor || function () { };

-				var basePrototype = baseClass.prototype;

-				constructor.prototype = Object.create(basePrototype);

-				Object.defineProperty(constructor.prototype, "_super", { value: basePrototype });

-				Object.defineProperty(constructor.prototype, "constructor", { value: constructor });

-				if (instanceMembers) {

-					initializeProperties(constructor.prototype, instanceMembers);

-				}

-				if (staticMembers) {

-					initializeProperties(constructor, staticMembers);

-				}

-				return constructor;

-			} else {

-				return define(constructor, instanceMembers, staticMembers);

-			}

-		}

-

-		function mix(constructor) {

-			/// <summary locid="15">

-			/// Defines a class using the given constructor and the union of the set of instance members

-			/// specified by all the mixin objects.  The mixin parameter list can be of variable length.

-			/// </summary>

-			/// <param name="constructor" locid="9">

-			/// A constructor function that will be used to instantiate this class.

-			/// </param>

-			/// <returns locid="12">

-			/// The newly defined class.

-			/// </returns>

-			constructor = constructor || function () { };

-			var i, len;

-			for (i = 0, len = arguments.length; i < len; i++) {

-				initializeProperties(constructor.prototype, arguments[i]);

-			}

-			return constructor;

-		}

-

-		// Establish members of "WinJS.Class" namespace

-		WinJS.Namespace.define("WinJS.Class", {

-			define: define,

-			derive: derive,

-			mix: mix

-		});

-

-	})(WinJS);

-

-})(this);

+ 0 - 68
test/manual/samples/sample.json.txt
Переглянути файл 

@@ -1,68 +0,0 @@
 
-{

-	"type": "team",

-	"test": {

-		"testPage": "tools/testing/run-tests.htm",

-		"enabled": true

-	},

-    "search": {

-        "excludeFolders": [

-			".git",

-			"node_modules",

-			"tools/bin",

-			"tools/counts",

-			"tools/policheck",

-			"tools/tfs_build_extensions",

-			"tools/testing/jscoverage",

-			"tools/testing/qunit",

-			"tools/testing/chutzpah",

-			"server.net"

-        ]

-    },

-	"languages": {

-		"vs.languages.typescript": {

-			"validationSettings": [{

-				"scope":"/",

-				"noImplicitAny":true,

-				"noLib":false,

-				"extraLibs":[],

-				"semanticValidation":true,

-				"syntaxValidation":true,

-				"codeGenTarget":"ES5",

-				"moduleGenTarget":"",

-				"lint": {

-                    "emptyBlocksWithoutComment": "warning",

-                    "curlyBracketsMustNotBeOmitted": "warning",

-                    "comparisonOperatorsNotStrict": "warning",

-                    "missingSemicolon": "warning",

-                    "unknownTypeOfResults": "warning",

-                    "semicolonsInsteadOfBlocks": "warning",

-                    "functionsInsideLoops": "warning",

-                    "functionsWithoutReturnType": "warning",

-                    "tripleSlashReferenceAlike": "warning",

-                    "unusedImports": "warning",

-                    "unusedVariables": "warning",

-                    "unusedFunctions": "warning",

-                    "unusedMembers": "warning"

-                }

-			}, 

-			{

-				"scope":"/client",

-				"baseUrl":"/client",

-				"moduleGenTarget":"amd"

-			},

-			{

-				"scope":"/server",

-				"moduleGenTarget":"commonjs"

-			},

-			{

-				"scope":"/build",

-				"moduleGenTarget":"commonjs"

-			},

-			{

-				"scope":"/node_modules/nake",

-				"moduleGenTarget":"commonjs"

-			}],

-			"allowMultipleWorkers": true

-		}

-	}

-}

+ 0 - 23
test/manual/samples/sample.julia.txt
Переглянути файл 

@@ -1,23 +0,0 @@
 
-# good style
 
-function fixedpointmap(f; iv, tolerance=1E-7, maxiter=1000)
 
-    # setup the algorithm
 
-    x_old = iv
 
-    normdiff = Inf
 
-    iter = 1
 
-    while normdiff > tolerance && iter <= maxiter
 
-        x_new = f(x_old) # use the passed in map
 
-        normdiff = norm(x_new - x_old)
 
-        x_old = x_new
 
-        iter = iter + 1
 
-    end
 
-    return (value = x_old, normdiff=normdiff, iter=iter) # A named tuple
 
-end
 
-
 
-# define a map and parameters
 
-p = 1.0
 
-β = 0.9
 
-f(v) = p + β * v # note that p and β are used in the function!
 
-
 
-sol = fixedpointmap(f, iv=0.8, tolerance=1.0E-8) # don't need to pass
 
-println("Fixed point = $(sol.value), and |f(x) - x| = $(sol.normdiff) in $(sol.iter)"*
 
-        " iterations")

+ 0 - 28
test/manual/samples/sample.kotlin.txt
Переглянути файл 

@@ -1,28 +0,0 @@
 
-const val POINTS_X_PASS: Int = 15

-val EZPassAccounts: MutableMap<Int, Int> = mutableMapOf(1 to 100, 2 to 100, 3 to 100)

-val EZPassReport: Map<Int, Int> = EZPassAccounts

-

-// update points credit

-fun updatePointsCredit(accountId: Int) {

-    if (EZPassAccounts.containsKey(accountId)) {

-        println("Updating $accountId...")

-        EZPassAccounts[accountId] = EZPassAccounts.getValue(accountId) + POINTS_X_PASS

-    } else {

-        println("Error: Trying to update a non-existing account (id: $accountId)")

-    }

-}

-

-fun accountsReport() {

-    println("EZ-Pass report:")

-    EZPassReport.forEach{

-        k, v -> println("ID $k: credit $v")

-    }

-}

-

-fun main() {

-    accountsReport()

-    updatePointsCredit(1)

-    updatePointsCredit(1)

-    updatePointsCredit(5)

-    accountsReport()

-}

+ 0 - 46
test/manual/samples/sample.less.txt
Переглянути файл 

@@ -1,46 +0,0 @@
 
-@base: #f938ab;

-

-.box-shadow(@style, @c) when (iscolor(@c)) {

-	border-radius: @style @c;

-}

-

-.box-shadow(@style, @alpha: 50%) when (isnumber(@alpha)) {

-	.box-shadow(@style, rgba(0, 0, 0, @alpha));

-}

-

-.box { 

-	color: saturate(@base, 5%);

-	border-color: lighten(@base, 30%);

-	

-	div {

-		.box-shadow((0 0 5px), 30%);

-	}

-}

-

-#header {

-	h1 {

-		font-size: 26px;

-		font-weight: bold;

-	}

-	

-	p { font-size: 12px;

-		a { text-decoration: none;

-			&:hover { border-width: 1px }

-		}

-	}

-}

-

-@the-border: 1px;

-@base-color: #111;

-@red:        #842210;

-

-#header {

-	color: (@base-color * 3);

-	border-left: @the-border;

-	border-right: (@the-border * 2);

-}

-

-#footer {

-	color: (@base-color + #003300);

-	border-color: desaturate(@red, 10%);

-}

+ 0 - 21
test/manual/samples/sample.lex.txt
Переглянути файл 

@@ -1,21 +0,0 @@
 
-LEX Paid Escrow.
 
-LEXON: 0.2.20
 
-COMMENT: 3.f - an escrow that is controlled by a third party for a fee.
 
-
 
-“Payer” is a person.
 
-“Payee” is a person.
 
-“Arbiter” is a person.
 
-“Fee” is an amount.
 
-
 
-The Payer pays an Amount into escrow,
 
-appoints the Payee,
 
-appoints the Arbiter,
 
-and also fixes the Fee.
 
-
 
-CLAUSE: Pay Out.
 
-The Arbiter may pay from escrow the Fee to themselves,
 
-and afterwards pay the remainder of the escrow to the Payee.
 
-
 
-CLAUSE: Pay Back.
 
-The Arbiter may pay from escrow the Fee to themselves,
 
-and afterwards return the remainder of the escrow to the Payer.

+ 0 - 12
test/manual/samples/sample.lua.txt
Переглянути файл 

@@ -1,12 +0,0 @@
 
-    -- defines a factorial function
 
-    function fact (n)
 
-      if n == 0 then
 
-        return 1
 
-      else
 
-        return n * fact(n-1)
 
-      end
 
-    end
 
-    
-    print("enter a number:")
 
-    a = io.read("*number")        -- read a number
 
-    print(fact(a))

+ 0 - 104
test/manual/samples/sample.markdown.txt
Переглянути файл 

@@ -1,104 +0,0 @@
 
-# Header 1 #

-## Header 2 ##

-### Header 3 ###             (Hashes on right are optional)

-## Markdown plus h2 with a custom ID ##   {#id-goes-here}

-[Link back to H2](#id-goes-here)

-

-```js

-var x = "string";

-function f() {

-  return x;

-}

-```

-

-<!-- html madness -->

-<div class="custom-class" markdown="1">

-  <div>

-    nested div

-  </div>

-  <script type='text/x-koka'>

-    function( x: int ) { return x*x; }

-  </script>

-  This is a div _with_ underscores

-  and a & <b class="bold">bold</b> element.

-  <style>

-    body { font: "Consolas" }

-  </style>

-</div>

-

-* Bullet lists are easy too

-- Another one

-+ Another one

-

-This is a paragraph, which is text surrounded by

-whitespace. Paragraphs can be on one

-line (or many), and can drone on for hours.

-

-Now some inline markup like _italics_,  **bold**,

-and `code()`. Note that underscores

-in_words_are ignored.

-

-````application/json

-  { value: ["or with a mime type"] }

-````

-

-> Blockquotes are like quoted text in email replies

->> And, they can be nested

-

-1. A numbered list

-2. Which is numbered

-3. With periods and a space

-

-And now some code:

-

-    // Code is just text indented a bit

-    which(is_easy) to_remember();

-

-And a block

-

-~~~

-// Markdown extra adds un-indented code blocks too

-

-if (this_is_more_code == true && !indented) {

-    // tild wrapped code blocks, also not indented

-}

-~~~

-

-Text with

-two trailing spaces

-(on the right)

-can be used

-for things like poems

-

-### Horizontal rules

-

-* * * *

-****

---------------------------

-

-![picture alt](/images/photo.jpeg "Title is optional")

-

-## Markdown plus tables ##

-

-| Header | Header | Right  |

-| ------ | ------ | -----: |

-|  Cell  |  Cell  |   $10  |

-|  Cell  |  Cell  |   $20  |

-

-* Outer pipes on tables are optional

-* Colon used for alignment (right versus left)

-

-## Markdown plus definition lists ##

-

-Bottled water

-: $ 1.25

-: $ 1.55 (Large)

-

-Milk

-Pop

-: $ 1.75

-

-* Multiple definitions and terms are possible

-* Definitions can include multiple paragraphs too

-

-*[ABBR]: Markdown plus abbreviations (produces an <abbr> tag)

+ 0 - 13
test/manual/samples/sample.mips.txt
Переглянути файл 

@@ -1,13 +0,0 @@
 
-# A[i] = A[i/2] + 1;
 
-    lw     $t0, 0($gp)       # fetch i
 
-    srl    $t1, $t0, 1       # i/2
 
-    sll    $t1, $t1, 2       # turn i/2 into a byte offset (*4)
 
-    add    $t1, $gp, $t1     # &A[i/2] - 28
 
-    lw     $t1, 28($t1)      # fetch A[i/2]
 
-    addi   $t1, $t1, 1       # A[i/2] + 1
 
-    sll    $t2, $t0, 2       # turn i into a byte offset
 
-    add    $t2, $t2, $gp     # &A[i] - 28
 
-    sw     $t1, 28($t2)      # A[i] = ...
 
-# A[i+1] = -1;
 
-    addi   $t1, $zero, -1    # -1
 
-    sw     $t1, 32($t2)      # A[i+1] = -1

+ 0 - 1
test/manual/samples/sample.msdax.txt
Переглянути файл 

@@ -1 +0,0 @@
 
- = CALCULATE(SUM(Sales[SalesAmount]), PREVIOUSQUARTER(Calendar[DateKey]))

+ 0 - 8
test/manual/samples/sample.mysql.txt
Переглянути файл 

@@ -1,8 +0,0 @@
 
-CREATE TABLE shop (
 
-    article INT(4) UNSIGNED ZEROFILL DEFAULT '0000' NOT NULL,
 
-    dealer  CHAR(20)                 DEFAULT ''     NOT NULL,
 
-    price   DOUBLE(16,2)             DEFAULT '0.00' NOT NULL,
 
-    PRIMARY KEY(article, dealer));
 
-INSERT INTO shop VALUES
 
-    (1,'A',3.45),(1,'B',3.99),(2,'A',10.99),(3,'B',1.45),
 
-    (3,'C',1.69),(3,'D',1.25),(4,'D',19.95);

+ 0 - 52
test/manual/samples/sample.objective-c.txt
Переглянути файл 

@@ -1,52 +0,0 @@
 
-//

-//  Copyright (c) Microsoft Corporation. All rights reserved.

-//

-

-#import "UseQuotes.h"

-#import <Use/GTLT.h> 

-

-/*

-	Multi 

-	Line

-	Comments 

-*/

-@implementation Test

-

-- (void) applicationWillFinishLaunching:(NSNotification *)notification

-{

-}

-

-- (IBAction)onSelectInput:(id)sender

-{

-    NSString* defaultDir = NSSearchPathForDirectoriesInDomains(NSDocumentDirectory, NSUserDomainMask, true)[0];

-    

-    NSOpenPanel* panel = [NSOpenPanel openPanel];

-    [panel setAllowedFileTypes:[[NSArray alloc] initWithObjects:@"ipa", @"xcarchive", @"app", nil]];

-    

-    [panel beginWithCompletionHandler:^(NSInteger result)

-     {

-         if (result == NSFileHandlingPanelOKButton)

-             [self.inputTextField setStringValue:[panel.URL path]];

-     }];

-     return YES;

-

-     int hex = 0xFEF1F0F;

-	 float ing = 3.14;

-	 ing = 3.14e0;

-	 ing = 31.4e-2;

-}

-

--(id) initWithParams:(id<anObject>) aHandler withDeviceStateManager:(id<anotherObject>) deviceStateManager

-{

-    // add a tap gesture recognizer

-    UITapGestureRecognizer *tapGesture = [[UITapGestureRecognizer alloc] initWithTarget:self action:@selector(handleTap:)];

-    NSMutableArray *gestureRecognizers = [NSMutableArray array];

-    [gestureRecognizers addObject:tapGesture];

-    [gestureRecognizers addObjectsFromArray:scnView.gestureRecognizers];

-    scnView.gestureRecognizers = gestureRecognizers;

-

-	return tapGesture;

-	return nil;

-}

-

-@end

+ 0 - 28
test/manual/samples/sample.pascal.txt
Переглянути файл 

@@ -1,28 +0,0 @@
 
-program GreetingsNumberOfTimes;
 
-
 
-{$APPTYPE CONSOLE}
 
-
 
-{$R *.res}
 
-
 
-uses
 
-  System.SysUtils;
 
-
 
-var
 
-  greetingsMessage: string;
 
-  numberOfTimes, i: integer;
 
-
 
-begin
 
-  try
 
-    { TODO -oUser -cConsole Main : Insert code here }
 
-    greetingsMessage := 'Hello World!';
 
-    numberOfTimes := 10;
 
-
 
-    for i := 1 to numberOfTimes do
 
-    begin
 
-      Writeln(greetingsMessage);
 
-    end;
 
-  except
 
-    on E: Exception do
 
-      Writeln(E.ClassName, ': ', E.Message);
 
-  end;
 
-end.

+ 0 - 20
test/manual/samples/sample.pascaligo.txt
Переглянути файл 

@@ -1,20 +0,0 @@
 
-type storage is int
 
-type parameter is
 
-  Increment of int
 
-| Decrement of int
 
-| Reset
 
-type return is list (operation) * storage
 
-// Two entrypoints
 
-function add (const store : storage; const delta : int) : storage is
 
-  store + delta
 
-function sub (const store : storage; const delta : int) : storage is
 
-  store - delta
 
-(* Main access point that dispatches to the entrypoints according to
 
-   the smart contract parameter. *)
 
-function main (const action : parameter; const store : storage) : return is
 
- ((nil : list (operation)),    // No operations
 
-  case action of
 
-    Increment (n) -> add (store, n)
 
-  | Decrement (n) -> sub (store, n)
 
-  | Reset         -> 0
 
-  end)

+ 0 - 18
test/manual/samples/sample.perl.txt
Переглянути файл 

@@ -1,18 +0,0 @@
 
-#!/usr/bin/perl
 
-use strict;
 
-use warnings;
 
-
 
-use Path::Tiny;
 
-
 
-my $dir = path('foo','bar'); # foo/bar
 
-
 
-# Iterate over the content of foo/bar
 
-my $iter = $dir->iterator;
 
-while (my $file = $iter->()) {
 
-
 
-    # See if it is a directory and skip
 
-    next if $file->is_dir();
 
-
 
-    # Print out the file name and path
 
-    print "$file\n";
 
-}

+ 0 - 8
test/manual/samples/sample.pgsql.txt
Переглянути файл 

@@ -1,8 +0,0 @@
 
-BEGIN
 
-    SELECT * INTO STRICT myrec FROM emp WHERE empname = myname;
 
-    EXCEPTION
 
-        WHEN NO_DATA_FOUND THEN
 
-            RAISE EXCEPTION 'employee % not found', myname;
 
-        WHEN TOO_MANY_ROWS THEN
 
-            RAISE EXCEPTION 'employee % not unique', myname;
 
-END;

+ 0 - 82
test/manual/samples/sample.php.txt
Переглянути файл 

@@ -1,82 +0,0 @@
 
-<?php

-// The next line contains a syntax error:

-if () {

-	return "The parser recovers from this type of syntax error";

-}

-?>

-<html>

-<head>

-	<title>Example page</title>

-</head>

-

-<body>

-

-<script type="text/javascript">

-	// Some PHP embedded inside JS

-	// Generated <?=date('l, F jS, Y')?>

-	

-	var server_token = <?=rand(5, 10000)?>

-	if (typeof server_token === 'number') {

-		alert('token: ' + server_token);

-	}

-</script>

-

-<div>

-Hello

-<? if (isset($user)) { ?>

-	<b><?=$user?></b>

-<? } else { ?>

-	<i>guest</i>

-<? } ?>

-!

-</div>

-

-<?php

-

-	/* Example PHP file

-	multiline comment

-	*/

-

-	$cards = array("ah", "ac", "ad", "as",

-		"2h", "2c", "2d", "2s",

-		"3h", "3c", "3d", "3s",

-		"4h", "4c", "4d", "4s",

-		"5h", "5c", "5d", "5s",

-		"6h", "6c", "6d", "6s",

-		"7h", "7c", "7d", "7s",

-		"8h", "8c", "8d", "8s",

-		"9h", "9c", "9d", "9s",

-		"th", "tc", "td", "ts",

-		"jh", "jc", "jd", "js",

-		"qh", "qc", "qd", "qs",

-		"kh", "kc", "kd", "ks");

-

-	srand(time());

-

-	for($i = 0; $i < 52; $i++) {

-		$count = count($cards);

-		$random = (rand()%$count);

-

-		if($cards[$random] == "") {

-			$i--;

-		} else {

-			$deck[] = $cards[$random];

-			$cards[$random] = "";

-		}

-	}

-

-	srand(time());

-	$starting_point = (rand()%51);

-	print("Starting point for cut cards is: $starting_point<p>");

-

-	// display shuffled cards (EXAMPLE ONLY)

-	for ($index = 0; $index < 52; $index++) {

-		if ($starting_point == 52) { $starting_point = 0; }

-		print("Uncut Point: <strong>$deck[$index]</strong> ");

-		print("Starting Point: <strong>$deck[$starting_point]</strong><br>");

-		$starting_point++;

-	}

-?>

-

-</body>

-</html>

+ 0 - 9
test/manual/samples/sample.plaintext.txt
Переглянути файл 

@@ -1,9 +0,0 @@
 
-Lorem ipsum dolor sit amet, consectetur adipiscing elit. Donec cursus aliquet sapien, sed rhoncus leo ullamcorper ornare. Interdum et malesuada fames ac ante ipsum primis in faucibus. Phasellus feugiat eleifend nisl, aliquet rhoncus quam scelerisque vel. Morbi eu pellentesque ex. Nam suscipit maximus leo blandit cursus. Aenean sollicitudin nisi luctus, ornare nibh viverra, laoreet ex. Donec eget nibh sit amet dolor ornare elementum. Morbi sollicitudin enim vitae risus pretium vestibulum. Ut pretium hendrerit libero, non vulputate ante volutpat et. Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia Curae; Nullam malesuada turpis vitae est porttitor, id tincidunt neque dignissim. Integer rhoncus vestibulum justo in iaculis. Praesent nec augue ut dui scelerisque gravida vel id velit. Donec vehicula feugiat mollis. Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas.

-

-Praesent diam lorem, luctus quis ullamcorper non, consequat quis orci. Ut vel massa vel nunc sagittis porttitor a vitae ante. Quisque euismod lobortis imperdiet. Vestibulum tincidunt vehicula posuere. Nulla facilisi. Donec sodales imperdiet risus id ullamcorper. Nulla luctus orci tortor, vitae tincidunt urna aliquet nec. Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos himenaeos. Etiam consequat dapibus massa. Sed ac pharetra magna, in imperdiet neque. Nullam nunc nisi, consequat vel nunc et, sagittis aliquam arcu. Aliquam non orci magna. Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos himenaeos. Sed id sem ut sem pulvinar rhoncus. Aenean venenatis nunc eget mi ornare, vitae maximus lacus varius. Quisque quis vestibulum justo.

-

-Donec euismod luctus volutpat. Donec sed lacinia enim. Vivamus aliquam elit cursus, convallis diam at, volutpat turpis. Sed lacinia nisl in auctor dapibus. Nunc turpis mi, mattis ut rhoncus id, lacinia sed lectus. Donec sodales tellus quis libero gravida pretium et quis magna. Etiam ultricies mollis purus, eget consequat velit. Duis vitae nibh vitae arcu tincidunt congue. Maecenas ut velit in ipsum condimentum dictum quis eget urna. Sed mattis nulla arcu, vitae mattis ligula dictum at.

-

-Praesent at dignissim dolor. Donec quis placerat sem. Cras vitae placerat sapien, eu sagittis ex. Mauris nec luctus risus. Cras imperdiet semper neque suscipit auctor. Mauris nisl massa, commodo sit amet dignissim id, malesuada sed ante. Praesent varius sapien eget eros vehicula porttitor.

-

-Mauris auctor nunc in quam tempor, eget consectetur nisi rhoncus. Donec et nulla imperdiet, gravida dui at, accumsan velit. Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas. Proin sollicitudin condimentum auctor. Sed lacinia eleifend nisi, id scelerisque leo laoreet sit amet. Morbi congue augue a malesuada pulvinar. Curabitur nec ante finibus, commodo orci vel, aliquam libero. Morbi molestie purus non nunc placerat fermentum. Pellentesque commodo ligula sed pretium aliquam. Praesent ut nibh ex. Vivamus vestibulum velit in leo suscipit, vitae pellentesque urna vulputate. Suspendisse pretium placerat ligula eu ullamcorper. Nam eleifend mi tellus, ut tristique ante ultricies vitae. Quisque venenatis dapibus tellus sit amet mattis. Donec erat arcu, elementum vel nisl at, sagittis vulputate nisi.

+ 0 - 64
test/manual/samples/sample.postiats.txt
Переглянути файл 

@@ -1,64 +0,0 @@
 
-// http://www.ats-lang.org/
 
-(* Say Hello! once *)
 
-val () = print"Hello!\n"
 
-//
 
-(* Say Hello! 3 times *)
 
-val () = 3*delay(print"Hello!")
 
-val () = print_newline((*void*))
 
-//
 
-
 
-//
 
-(* Build a list of 3 *)
 
-val xs = $list{int}(0, 1, 2)
 
-//
 
-val x0 = xs[0] // legal
 
-val x1 = xs[1] // legal
 
-val x2 = xs[2] // legal
 
-val x3 = xs[3] // illegal
 
-//
 
-
 
-//
 
-extern
 
-fun{} f0 (): int
 
-extern
 
-fun{} f1 (int): int
 
-extern
 
-fun{} repeat_f0f1 (int): int
 
-//
 
-implement
 
-{}(*tmp*)
 
-repeat_f0f1(n) =
 
-  if n = 0
 
-    then f0()
 
-    else f1(repeat_f0f1(n-1))
 
-  // end of [if]
 
-//
 
-fun
 
-times (
 
-  m:int, n:int
 
-) : int = // m*n
 
-  repeat_f0f1 (m) where
 
-{
 
-  implement f0<> () = 0
 
-  implement f1<> (x) = x + n
 
-}
 
-//
 
-fun
 
-power (
 
-  m:int, n:int
 
-) : int = // m^n
 
-  repeat_f0f1 (n) where
 
-{
 
-  implement f0<> () = 1
 
-  implement f1<> (x) = m * x
 
-}
 
-//
 
-val () =
 
-println! ("5*5 = ", times(5,5))
 
-val () =
 
-println! ("5^2 = ", power(5,2))
 
-val () =
 
-println! ("2^10 = ", power(2,10))
 
-val () =
 
-println! ("3^10 = ", power(3,10))
 
-//

+ 0 - 12
test/manual/samples/sample.powerquery.txt
Переглянути файл 

@@ -1,12 +0,0 @@
 
-let
 
-    Source = Excel.CurrentWorkbook(){[Name="Table1"]}[Content],
 
-    SplitColumnDelimiter = Table.SplitColumn(Source,"Input",Splitter.SplitTextByDelimiter(","),13),
 
-    Unpivot = Table.Unpivot(SplitColumnDelimiter,{"Input.1", "Input.2", "Input.3", "Input.4",
 
-    "Input.5", "Input.6",    "Input.7", "Input.8", "Input.9", "Input.10", "Input.11", "Input.12"
 
-    ,  "Input.13"},"Attribute","Value"),
 
-    RemovedColumns = Table.RemoveColumns(Unpivot,{"Attribute"}),
 
-    DuplicatesRemoved = Table.Distinct(RemovedColumns),
 
-    GroupedRows = Table.Group(DuplicatesRemoved, {"RowID"}, {{"Count of Distinct Values"
 
-    , each Table.RowCount(_), type number}})
 
-in
 
-    GroupedRows

+ 0 - 30
test/manual/samples/sample.powershell.txt
Переглянути файл 

@@ -1,30 +0,0 @@
 
-$SelectedObjectNames=@();
 
-$XenCenterNodeSelected = 0;
 
-#the object info array contains hashmaps, each of which represent a parameter set and describe a target in the XenCenter resource list
 
-foreach($parameterSet in $ObjInfoArray)
 
-{
 
-	if ($parameterSet["class"] -eq "blank")
 
-	{
 
-		#When the XenCenter node is selected a parameter set is created for each of your connected servers with the class and objUuid keys marked as blank
 
-		if ($XenCenterNodeSelected)
 
-		{
 
-			continue
 
-		}
 
-		$XenCenterNodeSelected = 1;
 
-		$SelectedObjectNames += "XenCenter"
 
-	}
 
-	elseif ($parameterSet["sessionRef"] -eq "null")
 
-	{
 
-		#When a disconnected server is selected there is no session information, we get null for everything except class
 
-	}
 
-		$SelectedObjectNames += "a disconnected server"
 
-	else
 
-	{
 
-		Connect-XenServer -url $parameterSet["url"] -opaqueref $parameterSet["sessionRef"]
 
-		#Use $class to determine which server objects to get
 
-		#-properties allows us to filter the results to just include the selected object
 
-		$exp = "Get-XenServer:{0} -properties @{{uuid='{1}'}}" -f $parameterSet["class"], $parameterSet["objUuid"]
 
-		$obj = Invoke-Expression $exp
 
-		$SelectedObjectNames += $obj.name_label;
 
-	} 
-}

+ 0 - 18
test/manual/samples/sample.pug.txt
Переглянути файл 

@@ -1,18 +0,0 @@
 
-doctype 5
 
-html(lang="en")
 
-    head
 
-        title= pageTitle
 
-        script(type='text/javascript')
 
-            if (foo) {
 
-                bar()
 
-            }
 
-    body
 
-        // Disclaimer: You will need to turn insertSpaces to true in order for the
 
-            syntax highlighting to kick in properly (especially for comments)
 
-            Enjoy :)
 
-        h1 Pug - node template engine
 
-        #container
 
-            if youAreUsingPug
 
-                p You are amazing
 
-            else
 
-                p Get on it!

+ 0 - 13
test/manual/samples/sample.python.txt
Переглянути файл 

@@ -1,13 +0,0 @@
 
-import banana

-

-

-class Monkey:

-    # Bananas the monkey can eat.

-    capacity = 10

-    def eat(self, n):

-        """Make the monkey eat n bananas!"""

-        self.capacity -= n * banana.size

-

-    def feeding_frenzy(self):

-        self.eat(9.25)

-        return "Yum yum"

+ 0 - 41
test/manual/samples/sample.r.txt
Переглянути файл 

@@ -1,41 +0,0 @@
 
-# © Microsoft. All rights reserved.

-

-#' Add together two numbers.

-#' 

-#' @param x A number.

-#' @param y A number.

-#' @return The sum of \code{x} and \code{y}.

-#' @examples

-#' add(1, 1)

-#' add(10, 1)

-add <- function(x, y) {

-  x + y

-}

-

-add(1, 2)

-add(1.0, 2.0)

-add(-1, -2)

-add(-1.0, -2.0)

-add(1.0e10, 2.0e10)

-

-

-#' Concatenate together two strings.

-#' 

-#' @param x A string.

-#' @param y A string.

-#' @return The concatenated string built of \code{x} and \code{y}.

-#' @examples

-#' strcat("one", "two")

-strcat <- function(x, y) {

-  paste(x, y)

-}

-

-paste("one", "two")

-paste('one', 'two')

-paste(NULL, NULL)

-paste(NA, NA)

-

-paste("multi-

-      line",

-      'multi-

-      line')

+ 0 - 46
test/manual/samples/sample.razor.txt
Переглянути файл 

@@ -1,46 +0,0 @@
 
-@{

-    var total = 0;

-    var totalMessage = "";

-    @* a multiline

-      razor comment embedded in csharp *@

-    if (IsPost) {

-

-        // Retrieve the numbers that the user entered.

-        var num1 = Request["text1"];

-        var num2 = Request["text2"];

-

-        // Convert the entered strings into integers numbers and add.

-        total = num1.AsInt() + num2.AsInt();

-		<italic><bold>totalMessage = "Total = " + total;</bold></italic>

-    }

-}

-

-<!DOCTYPE html>

-<html lang="en">

-  <head>

-    <title>Add Numbers</title>

-    <meta charset="utf-8" />

-  </head>

-<body>

-  <p>Enter two whole numbers and then click <strong>Add</strong>.</p>

-  <form action="" method="post">

-    <p><label for="text1">First Number:</label>

-      <input type="text" name="text1" />

-    </p>

-    <p><label for="text2">Second Number:</label>

-      <input type="text" name="text2" />

-    </p>

-    <p><input type="submit" value="Add" /></p>

-  </form>

-

-	@* now we call the totalMessage method 

-	   (a multi line razor comment outside code) *@

-

-  <p>@totalMessage</p>

-  

-  <p>@(totalMessage+"!")</p>

-  

-  An email address (with escaped at character): name@@domain.com

- 

-</body>

-</html>

+ 0 - 4
test/manual/samples/sample.redis.txt
Переглянути файл 

@@ -1,4 +0,0 @@
 
-EXISTS mykey
 
-APPEND mykey "Hello"
 
-APPEND mykey " World"
 
-GET mykey

+ 0 - 9
test/manual/samples/sample.redshift.txt
Переглянути файл 

@@ -1,9 +0,0 @@
 
-create view tables_vw as
 
-select distinct(id) table_id
 
-,trim(datname)   db_name
 
-,trim(nspname)   schema_name
 
-,trim(relname)   table_name
 
-from stv_tbl_perm
 
-join pg_class on pg_class.oid = stv_tbl_perm.id
 
-join pg_namespace on pg_namespace.oid = relnamespace
 
-join pg_database on pg_database.oid = stv_tbl_perm.db_id;

+ 0 - 26
test/manual/samples/sample.restructuredtext.txt
Переглянути файл 

@@ -1,26 +0,0 @@
 
-=================
 
-My Project Readme
 
-=================
 
--------------------------
 
-Clever subtitle goes here
 
--------------------------
 
-
 
-Introduction
 
-============
 
-
 
-This is an example reStructuredText document that starts at the very top
 
-with a title and a sub-title. There is one primary header, Introduction.
 
-There is one example subheading below.
 
-The document is just plain text so it is easily readable even before
 
-being converted to HTML, man page, PDF or other formats.
 
-
 
-Subheading
 
-----------
 
-
 
-The basic syntax is not that different from Markdown, but it also
 
-has many more powerful features that Markdown doesn't have. We aren't
 
-taking advantage of those yet though.
 
-
 
-- Bullet points
 
-- Are intuitive
 
-- And simple too

+ 0 - 21
test/manual/samples/sample.ruby.txt
Переглянути файл 

@@ -1,21 +0,0 @@
 
-#-------------------------------------------------------------------------

-# Copyright (c) Microsoft. All rights reserved.

-#--------------------------------------------------------------------------

-

-module Azure

-  module Blob

-    class Blob

-      

-      def initialize

-        @properties = {}

-        @metadata = {}

-        yield self if block_given?

-      end

-

-      attr_accessor :name

-      attr_accessor :snapshot

-      attr_accessor :properties

-      attr_accessor :metadata

-    end

-  end

-end

+ 0 - 29
test/manual/samples/sample.rust.txt
Переглянути файл 

@@ -1,29 +0,0 @@
 
-fn main() {
 
-    let greetings = ["Hello", "Hola", "Bonjour",
 
-                     "Ciao", "こんにちは", "안녕하세요",
 
-                     "Cześć", "Olá", "Здравствуйте",
 
-                     "Chào bạn", "您好", "Hallo",
 
-                     "Hej", "Ahoj", "سلام"];
 
-
 
-    for (num, greeting) in greetings.iter().enumerate() {
 
-        print!("{} : ", greeting);
 
-        match num {
 
-            0 =>  println!("This code is editable and runnable!"),
 
-            1 =>  println!("¡Este código es editable y ejecutable!"),
 
-            2 =>  println!("Ce code est modifiable et exécutable !"),
 
-            3 =>  println!("Questo codice è modificabile ed eseguibile!"),
 
-            4 =>  println!("このコードは編集して実行出来ます！"),
 
-            5 =>  println!("여기에서 코드를 수정하고 실행할 수 있습니다!"),
 
-            6 =>  println!("Ten kod można edytować oraz uruchomić!"),
 
-            7 =>  println!("Este código é editável e executável!"),
 
-            8 =>  println!("Этот код можно отредактировать и запустить!"),
 
-            9 =>  println!("Bạn có thể edit và run code trực tiếp!"),
 
-            10 => println!("这段代码是可以编辑并且能够运行的！"),
 
-            11 => println!("Dieser Code kann bearbeitet und ausgeführt werden!"),
 
-            12 => println!("Den här koden kan redigeras och köras!"),
 
-            13 => println!("Tento kód můžete upravit a spustit"),
 
-            14 => println!("این کد قابلیت ویرایش و اجرا دارد!"),
 
-            _ =>  {},
 
-        }
 
-    }
 
-}

+ 0 - 10
test/manual/samples/sample.sb.txt
Переглянути файл 

@@ -1,10 +0,0 @@
 
-begin:
 
-TextWindow.Write("Enter a number: ")
 
-num = TextWindow.ReadNumber()
 
-remainder = Math.Remainder(num, 2)
 
-If (remainder = 0) Then
 
- TextWindow.WriteLine("The number is Even")
 
-Else
 
- TextWindow.WriteLine("The number is Odd")
 
-EndIf
 
-Goto begin

+ 0 - 53
test/manual/samples/sample.scala.txt
Переглянути файл 

@@ -1,53 +0,0 @@
 
-package examples
 
-
 
-/** Quick sort, imperative style */
 
-object sort {
 
-
 
-  /** Nested methods can use and even update everything
 
-   *  visible in their scope (including local variables or
 
-   *  arguments of enclosing methods).
 
-   */
 
-  def sort(a: Array[Int]) {
 
-
 
-    def swap(i: Int, j: Int) {
 
-      val t = a(i); a(i) = a(j); a(j) = t
 
-    }
 
-
 
-    def sort1(l: Int, r: Int) {
 
-      val pivot = a((l + r) / 2)
 
-      var i = l
 
-      var j = r
 
-      while (i <= j) {
 
-        while (a(i) < pivot) i += 1
 
-        while (a(j) > pivot) j -= 1
 
-        if (i <= j) {
 
-          swap(i, j)
 
-          i += 1
 
-          j -= 1
 
-        }
 
-      }
 
-      if (l < j) sort1(l, j)
 
-      if (j < r) sort1(i, r)
 
-    }
 
-
 
-    if (a.length > 0)
 
-      sort1(0, a.length - 1)
 
-  }
 
-
 
-  def println(ar: Array[Int]) {
 
-    def print1 = {
 
-      def iter(i: Int): String =
 
-        ar(i) + (if (i < ar.length-1) "," + iter(i+1) else "")
 
-      if (ar.length == 0) "" else iter(0)
 
-    }
 
-    Console.println("[" + print1 + "]")
 
-  }
 
-
 
-  def main(args: Array[String]) {
 
-    val ar = Array(6, 2, 8, 5, 1)
 
-    println(ar)
 
-    sort(ar)
 
-    println(ar)
 
-  }
 
-
 
-}

+ 0 - 105
test/manual/samples/sample.scheme.txt
Переглянути файл 

@@ -1,105 +0,0 @@
 
-;;; make-matrix creates a matrix (a vector of vectors).
 
-(define make-matrix
 
-  (lambda (rows columns)
 
-    (do ((m (make-vector rows))
 
-         (i 0 (+ i 1)))
 
-        ((= i rows) m)
 
-        (vector-set! m i (make-vector columns)))))
 
-
 
-;;; matrix? checks to see if its argument is a matrix.
 
-;;; It isn't foolproof, but it's generally good enough.
 
-(define matrix?
 
-  (lambda (x)
 
-    (and (vector? x)
 
-         (> (vector-length x) 0)
 
-         (vector? (vector-ref x 0)))))
 
-
 
-;; matrix-rows returns the number of rows in a matrix.
 
-(define matrix-rows
 
-   (lambda (x)
 
-      (vector-length x)))
 
-
 
-;; matrix-columns returns the number of columns in a matrix.
 
-(define matrix-columns
 
-   (lambda (x)
 
-      (vector-length (vector-ref x 0))))
 
-
 
-;;; matrix-ref returns the jth element of the ith row.
 
-(define matrix-ref
 
-  (lambda (m i j)
 
-    (vector-ref (vector-ref m i) j)))
 
-
 
-;;; matrix-set! changes the jth element of the ith row.
 
-(define matrix-set!
 
-  (lambda (m i j x)
 
-    (vector-set! (vector-ref m i) j x)))
 
-
 
-;;; mul is the generic matrix/scalar multiplication procedure
 
-(define mul
 
-  (lambda (x y)
 
-    ;; mat-sca-mul multiplies a matrix by a scalar.
 
-    (define mat-sca-mul
 
-       (lambda (m x)
 
-          (let* ((nr (matrix-rows m))
 
-                 (nc (matrix-columns m))
 
-                 (r  (make-matrix nr nc)))
 
-             (do ((i 0 (+ i 1)))
 
-                 ((= i nr) r)
 
-                 (do ((j 0 (+ j 1)))
 
-                     ((= j nc))
 
-                     (matrix-set! r i j
 
-                        (* x (matrix-ref m i j))))))))
 
-
 
-    ;; mat-mat-mul multiplies one matrix by another, after verifying
 
-    ;; that the first matrix has as many columns as the second
 
-    ;; matrix has rows.
 
-    (define mat-mat-mul
 
-       (lambda (m1 m2)
 
-          (let* ((nr1 (matrix-rows m1))
 
-                 (nr2 (matrix-rows m2))
 
-                 (nc2 (matrix-columns m2))
 
-                 (r   (make-matrix nr1 nc2)))
 
-             (if (not (= (matrix-columns m1) nr2))
 
-                 (match-error m1 m2))
 
-             (do ((i 0 (+ i 1)))
 
-                 ((= i nr1) r)
 
-                 (do ((j 0 (+ j 1)))
 
-                     ((= j nc2))
 
-                     (do ((k 0 (+ k 1))
 
-                          (a 0
 
-                             (+ a
 
-                                (* (matrix-ref m1 i k)
 
-                                   (matrix-ref m2 k j)))))
 
-                         ((= k nr2)
 
-                          (matrix-set! r i j a))))))))
 
-
 
-   ;; type-error is called to complain when mul receives an invalid
 
-   ;; type of argument.
 
-    (define type-error
 
-       (lambda (what)
 
-          (error 'mul
 
-             "~s is not a number or matrix"
 
-             what)))
 
-
 
-    ;; match-error is called to complain when mul receives a pair of
 
-    ;; incompatible arguments.
 
-    (define match-error
 
-       (lambda (what1 what2)
 
-          (error 'mul
 
-             "~s and ~s are incompatible operands"
 
-             what1
 
-             what2)))
 
-
 
-    ;; body of mul; dispatch based on input types
 
-    (cond
 
-      ((number? x)
 
-       (cond
 
-         ((number? y) (* x y))
 
-         ((matrix? y) (mat-sca-mul y x))
 
-         (else (type-error y))))
 
-      ((matrix? x)
 
-       (cond
 
-         ((number? y) (mat-sca-mul x y))
 
-         ((matrix? y) (mat-mat-mul x y))
 
-         (else (type-error y))))
 
-      (else (type-error x)))))

+ 0 - 37
test/manual/samples/sample.scss.txt
Переглянути файл 

@@ -1,37 +0,0 @@
 
-$baseFontSizeInPixels: 14;

-

-@function px2em ($font_size, $base_font_size: $baseFontSizeInPixels) {  

-  @return ($font_size / $base_font_size) + em; 

-}

-

-h1 {

-  font-size: px2em(36, $baseFontSizeInPixels);

-}

-h2  {

-  font-size: px2em(28, $baseFontSizeInPixels);

-}

-.class {

-  font-size: px2em(14, $baseFontSizeInPixels);

-}

-

-nav {

-  ul {

-    margin: 0;

-    padding: 0;

-    list-style: none;

-  }

-

-  li { display: inline-block; }

-

-  a {

-    display: block;

-    padding: 6px 12px;

-    text-decoration: none;

-  }

-  

-  @each $animal in puma, sea-slug, egret, salamander {

-    .#{$animal}-icon {

-      background-image: url('/images/#{$animal}.png');

-    }

-  }

-}

+ 0 - 42
test/manual/samples/sample.shell.txt
Переглянути файл 

@@ -1,42 +0,0 @@
 
-#!/bin/bash
 
-# Simple line count example, using bash
 
-#
 
-# Bash tutorial: http://linuxconfig.org/Bash_scripting_Tutorial#8-2-read-file-into-bash-array
 
-# My scripting link: http://www.macs.hw.ac.uk/~hwloidl/docs/index.html#scripting
 
-#
 
-# Usage: ./line_count.sh file
 
-# -----------------------------------------------------------------------------
 
-
 
-# Link filedescriptor 10 with stdin
 
-exec 10<&0
 
-# stdin replaced with a file supplied as a first argument
 
-exec < $1
 
-# remember the name of the input file
 
-in=$1
 
-
 
-# init
 
-file="current_line.txt"
 
-let count=0
 
-
 
-# this while loop iterates over all lines of the file
 
-while read LINE
 
-do
 
-    # increase line counter
 
-    ((count++))
 
-    # write current line to a tmp file with name $file (not needed for counting)
 
-    echo $LINE > $file
 
-    # this checks the return code of echo (not needed for writing; just for demo)
 
-    if [ $? -ne 0 ]
 
-     then echo "Error in writing to file ${file}; check its permissions!"
 
-    fi
 
-done
 
-
 
-echo "Number of lines: $count"
 
-echo "The last line of the file is: `cat ${file}`"
 
-
 
-# Note: You can achieve the same by just using the tool wc like this
 
-echo "Expected number of lines: `wc -l $in`"
 
-
 
-# restore stdin from filedescriptor 10
 
-# and close filedescriptor 10
 
-exec 0<&10 10<&-

+ 0 - 139
test/manual/samples/sample.sol.txt
Переглянути файл 

@@ -1,139 +0,0 @@
 
-pragma solidity ^0.4.11;
 
-
 
-/// @title Voting with delegation.
 
-contract Ballot {
 
-    // This declares a new complex type which will
 
-    // be used for variables later.
 
-    // It will represent a single voter.
 
-    struct Voter {
 
-        uint weight; // weight is accumulated by delegation
 
-        bool voted;  // if true, that person already voted
 
-        address delegate; // person delegated to
 
-        uint vote;   // index of the voted proposal
 
-    }
 
-
 
-    // This is a type for a single proposal.
 
-    struct Proposal {
 
-        bytes32 name;   // short name (up to 32 bytes)
 
-        uint voteCount; // number of accumulated votes
 
-    }
 
-
 
-    address public chairperson;
 
-
 
-    // This declares a state variable that
 
-    // stores a `Voter` struct for each possible address.
 
-    mapping(address => Voter) public voters;
 
-
 
-    // A dynamically-sized array of `Proposal` structs.
 
-    Proposal[] public proposals;
 
-
 
-    /// Create a new ballot to choose one of `proposalNames`.
 
-    function Ballot(bytes32[] proposalNames) {
 
-        chairperson = msg.sender;
 
-        voters[chairperson].weight = 1;
 
-
 
-        // For each of the provided proposal names,
 
-        // create a new proposal object and add it
 
-        // to the end of the array.
 
-        for (uint i = 0; i < proposalNames.length; i++) {
 
-            // `Proposal({...})` creates a temporary
 
-            // Proposal object and `proposals.push(...)`
 
-            // appends it to the end of `proposals`.
 
-            proposals.push(Proposal({
 
-                name: proposalNames[i],
 
-                voteCount: 0
 
-            }));
 
-        }
 
-    }
 
-
 
-    // Give `voter` the right to vote on this ballot.
 
-    // May only be called by `chairperson`.
 
-    function giveRightToVote(address voter) {
 
-        // If the argument of `require` evaluates to `false`,
 
-        // it terminates and reverts all changes to
 
-        // the state and to Ether balances. It is often
 
-        // a good idea to use this if functions are
 
-        // called incorrectly. But watch out, this
 
-        // will currently also consume all provided gas
 
-        // (this is planned to change in the future).
 
-        require((msg.sender == chairperson) && !voters[voter].voted && (voters[voter].weight == 0));
 
-        voters[voter].weight = 1;
 
-    }
 
-
 
-    /// Delegate your vote to the voter `to`.
 
-    function delegate(address to) {
 
-        // assigns reference
 
-        Voter sender = voters[msg.sender];
 
-        require(!sender.voted);
 
-
 
-        // Self-delegation is not allowed.
 
-        require(to != msg.sender);
 
-
 
-        // Forward the delegation as long as
 
-        // `to` also delegated.
 
-        // In general, such loops are very dangerous,
 
-        // because if they run too long, they might
 
-        // need more gas than is available in a block.
 
-        // In this case, the delegation will not be executed,
 
-        // but in other situations, such loops might
 
-        // cause a contract to get "stuck" completely.
 
-        while (voters[to].delegate != address(0)) {
 
-            to = voters[to].delegate;
 
-
 
-            // We found a loop in the delegation, not allowed.
 
-            require(to != msg.sender);
 
-        }
 
-
 
-        // Since `sender` is a reference, this
 
-        // modifies `voters[msg.sender].voted`
 
-        sender.voted = true;
 
-        sender.delegate = to;
 
-        Voter delegate = voters[to];
 
-        if (delegate.voted) {
 
-            // If the delegate already voted,
 
-            // directly add to the number of votes
 
-            proposals[delegate.vote].voteCount += sender.weight;
 
-        } else {
 
-            // If the delegate did not vote yet,
 
-            // add to her weight.
 
-            delegate.weight += sender.weight;
 
-        }
 
-    }
 
-
 
-    /// Give your vote (including votes delegated to you)
 
-    /// to proposal `proposals[proposal].name`.
 
-    function vote(uint proposal) {
 
-        Voter sender = voters[msg.sender];
 
-        require(!sender.voted);
 
-        sender.voted = true;
 
-        sender.vote = proposal;
 
-
 
-        // If `proposal` is out of the range of the array,
 
-        // this will throw automatically and revert all
 
-        // changes.
 
-        proposals[proposal].voteCount += sender.weight;
 
-    }
 
-
 
-    /// @dev Computes the winning proposal taking all
 
-    /// previous votes into account.
 
-    function winningProposal() constant
 
-            returns (uint winningProposal)
 
-    {
 
-        uint winningVoteCount = 0;
 
-        for (uint p = 0; p < proposals.length; p++) {
 
-            if (proposals[p].voteCount > winningVoteCount) {
 
-                winningVoteCount = proposals[p].voteCount;
 
-                winningProposal = p;
 
-            }
 
-        }
 
-    }
 
-
 
-    // Calls winningProposal() function to get the index
 
-    // of the winner contained in the proposals array and then
 
-    // returns the name of the winner
 
-    function winnerName() constant
 
-            returns (bytes32 winnerName)
 
-    {
 
-        winnerName = proposals[winningProposal()].name;
 
-    }
 
-}

+ 0 - 52
test/manual/samples/sample.sql.txt
Переглянути файл 

@@ -1,52 +0,0 @@
 
-CREATE TABLE dbo.EmployeePhoto
 
-(
 
-    EmployeeId INT NOT NULL PRIMARY KEY,
 
-    Photo VARBINARY(MAX) FILESTREAM NULL,
 
-    MyRowGuidColumn UNIQUEIDENTIFIER NOT NULL ROWGUIDCOL
 
-                    UNIQUE DEFAULT NEWID()
 
-);
 
-
 
-GO
 
-
 
-/*
 
-text_of_comment
 
-/* nested comment */
 
-*/
 
-
 
--- line comment
 
-
 
-CREATE NONCLUSTERED INDEX IX_WorkOrder_ProductID
 
-    ON Production.WorkOrder(ProductID)
 
-    WITH (FILLFACTOR = 80,
 
-        PAD_INDEX = ON,
 
-        DROP_EXISTING = ON);
 
-GO
 
-
 
-WHILE (SELECT AVG(ListPrice) FROM Production.Product) < $300
 
-BEGIN
 
-   UPDATE Production.Product
 
-      SET ListPrice = ListPrice * 2
 
-   SELECT MAX(ListPrice) FROM Production.Product
 
-   IF (SELECT MAX(ListPrice) FROM Production.Product) > $500
 
-      BREAK
 
-   ELSE
 
-      CONTINUE
 
-END
 
-PRINT 'Too much for the market to bear';
 
-
 
-MERGE INTO Sales.SalesReason AS [Target]
 
-USING (VALUES ('Recommendation','Other'), ('Review', 'Marketing'), ('Internet', 'Promotion'))
 
-       AS [Source] ([NewName], NewReasonType)
 
-ON [Target].[Name] = [Source].[NewName]
 
-WHEN MATCHED
 
-THEN UPDATE SET ReasonType = [Source].NewReasonType
 
-WHEN NOT MATCHED BY TARGET
 
-THEN INSERT ([Name], ReasonType) VALUES ([NewName], NewReasonType)
 
-OUTPUT $action INTO @SummaryOfChanges;
 
-
 
-SELECT ProductID, OrderQty, SUM(LineTotal) AS Total
 
-FROM Sales.SalesOrderDetail
 
-WHERE UnitPrice < $5.00
 
-GROUP BY ProductID, OrderQty
 
-ORDER BY ProductID, OrderQty
 
-OPTION (HASH GROUP, FAST 10);

+ 0 - 34
test/manual/samples/sample.st.txt
Переглянути файл 

@@ -1,34 +0,0 @@
 
-CONFIGURATION DefaultCfg
 
-    VAR_GLOBAL
 
-        Start_Stop AT %IX0.0: BOOL; (* This is a comment *)
 
-    END_VAR
 
-    TASK NewTask  (INTERVAL := T#20ms);
 
-    PROGRAM Main WITH NewTask : PLC_PRG;
 
-END_CONFIGURATION
 
-
 
-PROGRAM demo
 
-    VAR_EXTERNAL
 
-        Start_Stop: BOOL;
 
-    END_VAR
 
-    VAR
 
-        a : REAL; // Another comment
 
-        todTest: TIME_OF_DAY := TOD#12:55;
 
-    END_VAR
 
-    a := csq(12.5);
 
-    TON1(IN := TRUE, PT := T#2s);
 
-    16#FAC0 2#1001_0110
 
-    IF TON1.Q AND a > REAL#100 THEN
 
-        Start_Stop := TRUE;
 
-    END_IF
 
-END_PROGRAM;
 
-
 
-/* Get a square of the circle */
 
-FUNCTION csq : REAL
 
-    VAR_INPUT
 
-        r: REAL;
 
-    END_VAR
 
-    VAR CONSTANT
 
-        c_pi: REAL := 3.14;
 
-    END_VAR
 
-    csq := ABS(c_pi * (r * 2));
 
-END_FUNCTION

+ 0 - 50
test/manual/samples/sample.swift.txt
Переглянути файл 

@@ -1,50 +0,0 @@
 
-import Foundation

-

-protocol APIControllerProtocol {

-    func didReceiveAPIResults(results: NSArray)

-}

-

-class APIController {

-    var delegate: APIControllerProtocol

-

-    init(delegate: APIControllerProtocol) {

-        self.delegate = delegate

-    }

-

-    func get(path: String) {

-        let url = NSURL(string: path)

-        let session = NSURLSession.sharedSession()

-        let task = session.dataTaskWithURL(url!, completionHandler: {data, response, error -> Void in

-            println("Task completed")

-            if(error != nil) {

-                // If there is an error in the web request, print it to the console

-                println(error.localizedDescription)

-            }

-            var err: NSError?

-            if let jsonResult = NSJSONSerialization.JSONObjectWithData(data, options: NSJSONReadingOptions.MutableContainers, error: &err) as? NSDictionary {

-                if(err != nil) {

-                    // If there is an error parsing JSON, print it to the console

-                    println("JSON Error \(err!.localizedDescription)")

-                }

-                if let results: NSArray = jsonResult["results"] as? NSArray {

-                    self.delegate.didReceiveAPIResults(results)

-                }

-            }

-        })

-

-        // The task is just an object with all these properties set

-        // In order to actually make the web request, we need to "resume"

-        task.resume()

-    }

-

-    func searchItunesFor(searchTerm: String) {

-        // The iTunes API wants multiple terms separated by + symbols, so replace spaces with + signs

-        let itunesSearchTerm = searchTerm.stringByReplacingOccurrencesOfString(" ", withString: "+", options: NSStringCompareOptions.CaseInsensitiveSearch, range: nil)

-

-        // Now escape anything else that isn't URL-friendly

-        if let escapedSearchTerm = itunesSearchTerm.stringByAddingPercentEscapesUsingEncoding(NSUTF8StringEncoding) {

-            let urlPath = "https://itunes.apple.com/search?term=\(escapedSearchTerm)&media=music&entity=album"

-        }

-    }

-

-}

+ 0 - 28
test/manual/samples/sample.systemverilog.txt
Переглянути файл 

@@ -1,28 +0,0 @@
 
-// File : tb_top.sv
 
-module tb_top ();
 
-
 
-	reg clk;
 
-	reg resetn;
 
-	reg d;
 
-	wire q;
 
-
 
-	// Instantiate the design
 
-	d_ff  d_ff0 (	.clk (clk),
 
-		       		.resetn (resetn),
 
-		       		.d (d),
 
-		       		.q (q));
 
-
 
-	// Create a clock
 
-	always #10 clk <= ~clk;
 
-
 
-	initial begin
 
-		resetn <= 0;
 
-		d <= 0;
 
-
 
-		#10 resetn <= 1;
 
-		#5      d <= 1;
 
-		#8      d <= 0;
 
-		#2      d <= 1;
 
-		#10     d <= 0;
 
-	end
 
-endmodule

+ 0 - 18
test/manual/samples/sample.tcl.txt
Переглянути файл 

@@ -1,18 +0,0 @@
 
-proc find {{basedir .} {filterScript {}}} {
 
-    set oldwd [pwd]
 
-    cd $basedir
 
-    set cwd [pwd]
 
-    set filenames [glob -nocomplain * .*]
 
-    set files {}
 
-    set filt [string length $filterScript]
 
-    foreach filename $filenames {
 
-        if {!$filt || [eval $filterScript [list $filename]]} {
 
-            lappend files [file join $cwd $filename]
 
-        }
 
-        if {[file isdirectory $filename]} {
 
-            set files [concat $files [find $filename $filterScript]]
 
-        }
 
-    }
 
-    cd $oldwd
 
-    return $files
 
-}

+ 0 - 12
test/manual/samples/sample.twig.txt
Переглянути файл 

@@ -1,12 +0,0 @@
 
-<!DOCTYPE html>
 
-<html>
 
-    <head>
 
-        <meta charset="UTF-8">
 
-        <title>{% block title %}Welcome!{% endblock %}</title>
 
-        {% block stylesheets %}{% endblock %}
 
-    </head>
 
-    <body>
 
-        {% block body %}{% endblock %}
 
-        {% block javascripts %}{% endblock %}
 
-    </body>
 
-</html>

+ 0 - 124
test/manual/samples/sample.typescript.txt
Переглянути файл 

@@ -1,124 +0,0 @@
 
-/* Game of Life

- * Implemented in TypeScript

- * To learn more about TypeScript, please visit http://www.typescriptlang.org/

- */

-

-namespace Conway {

-

-	export class Cell {

-		public row: number;

-		public col: number;

-		public live: boolean;

-

-		constructor(row: number, col: number, live: boolean) {

-			this.row = row;

-			this.col = col;

-			this.live = live;

-		}

-	}

-

-	export class GameOfLife {

-		private gridSize: number;

-		private canvasSize: number;

-		private lineColor: string;

-		private liveColor: string;

-		private deadColor: string;

-		private initialLifeProbability: number;

-		private animationRate: number;

-		private cellSize: number;

-		private context: CanvasRenderingContext2D;

-		private world;

-

-

-		constructor() {

-			this.gridSize = 50;

-			this.canvasSize = 600;

-			this.lineColor = '#cdcdcd';

-			this.liveColor = '#666';

-			this.deadColor = '#eee';

-			this.initialLifeProbability = 0.5;

-			this.animationRate = 60;

-			this.cellSize = 0;

-			this.world = this.createWorld();

-			this.circleOfLife();

-		}

-

-		public createWorld() {

-			return this.travelWorld( (cell : Cell) =>  {

-				cell.live = Math.random() < this.initialLifeProbability;

-				return cell;

-			});

-		}

-

-		public circleOfLife() : void {

-			this.world = this.travelWorld( (cell: Cell) => {

-				cell = this.world[cell.row][cell.col];

-				this.draw(cell);

-				return this.resolveNextGeneration(cell);

-			});

-			setTimeout( () => {this.circleOfLife()}, this.animationRate);

-		}

-

-		public resolveNextGeneration(cell : Cell) {

-			var count = this.countNeighbors(cell);

-			var newCell = new Cell(cell.row, cell.col, cell.live);

-			if(count < 2 || count > 3) newCell.live = false;

-			else if(count == 3) newCell.live = true;

-			return newCell;

-		}

-

-		public countNeighbors(cell : Cell) {

-			var neighbors = 0;

-			for(var row = -1; row <=1; row++) {

-				for(var col = -1; col <= 1; col++) {

-					if(row == 0 && col == 0) continue;

-					if(this.isAlive(cell.row + row, cell.col + col)) {

-						neighbors++;

-					}

-				}

-			}

-			return neighbors;

-		}

-

-		public isAlive(row : number, col : number) {

-			if(row < 0 || col < 0 || row >= this.gridSize || col >= this.gridSize) return false;

-			return this.world[row][col].live;

-		}

-

-		public travelWorld(callback) {

-			var result = [];

-			for(var row = 0; row < this.gridSize; row++) {

-				var rowData = [];

-				for(var col = 0; col < this.gridSize; col++) {

-					rowData.push(callback(new Cell(row, col, false)));

-				}

-				result.push(rowData);

-			}

-			return result;

-		}

-

-		public draw(cell : Cell) {

-			if(this.context == null) this.context = this.createDrawingContext();

-			if(this.cellSize == 0) this.cellSize = this.canvasSize/this.gridSize;

-

-			this.context.strokeStyle = this.lineColor;

-			this.context.strokeRect(cell.row * this.cellSize, cell.col*this.cellSize, this.cellSize, this.cellSize);

-			this.context.fillStyle = cell.live ? this.liveColor : this.deadColor;

-			this.context.fillRect(cell.row * this.cellSize, cell.col*this.cellSize, this.cellSize, this.cellSize);

-		}

-

-		public createDrawingContext() {

-			var canvas = <HTMLCanvasElement> document.getElementById('conway-canvas');

-			if(canvas == null) {

-					canvas = document.createElement('canvas');

-					canvas.id = 'conway-canvas';

-					canvas.width = this.canvasSize;

-					canvas.height = this.canvasSize;

-					document.body.appendChild(canvas);

-			}

-			return canvas.getContext('2d');

-		}

-	}

-}

-

-var game = new Conway.GameOfLife();

+ 0 - 59
test/manual/samples/sample.vb.txt
Переглянути файл 

@@ -1,59 +0,0 @@
 
-Imports System

-Imports System.Collections.Generic

-

-Module Module1

-

-    Sub Main()

-        Dim a As New M8Ball

-

-        Do While True

-

-            Dim q As String = ""

-            Console.Write("ask me about the future... ")

-            q = Console.ReadLine()

-

-            If q.Trim <> "" Then

-                Console.WriteLine("the answer is... {0}", a.getAnswer(q))

-            Else

-                Exit Do

-            End If

-        Loop

-

-    End Sub

-

-End Module

-

-Class M8Ball

-

-    Public Answers As System.Collections.Generic.Dictionary(Of Integer, String)

-

-    Public Sub New()

-        Answers = New System.Collections.Generic.Dictionary(Of Integer, String)

-        Answers.Add(0, "It is certain")

-        Answers.Add(1, "It is decidedly so")

-        Answers.Add(2, "Without a doubt")

-        Answers.Add(3, "Yes, definitely")

-        Answers.Add(4, "You may rely on ")

-        Answers.Add(5, "As I see it, yes")

-        Answers.Add(6, "Most likely")

-        Answers.Add(7, "Outlook good")

-        Answers.Add(8, "Signs point to yes")

-        Answers.Add(9, "Yes")

-        Answers.Add(10, "Reply hazy, try again")

-        Answers.Add(11, "Ask again later")

-        Answers.Add(12, "Better not tell you now")

-        Answers.Add(13, "Cannot predict now")

-        Answers.Add(14, "Concentrate and ask again")

-        Answers.Add(15, "Don't count on it")

-        Answers.Add(16, "My reply is no")

-        Answers.Add(17, "My sources say no")

-        Answers.Add(18, "Outlook not so")

-        Answers.Add(19, "Very doubtful")

-    End Sub

-

-    Public Function getAnswer(theQuestion As String) As String

-        Dim r As New Random

-        Return Answers(r.Next(0, 19))

-    End Function

-

-End Class

+ 0 - 35
test/manual/samples/sample.verilog.txt
Переглянути файл 

@@ -1,35 +0,0 @@
 
-`include "first_counter.v"
 
-module first_counter_tb();
 
-// Declare inputs as regs and outputs as wires
 
-reg clock, reset, enable;
 
-wire [3:0] counter_out;
 
-
 
-// Initialize all variables
 
-initial begin
 
-  $display ("time\t clk reset enable counter");
 
-  $monitor ("%g\t %b   %b     %b      %b",
 
-	  $time, clock, reset, enable, counter_out);
 
-  clock = 1;       // initial value of clock
 
-  reset = 0;       // initial value of reset
 
-  enable = 0;      // initial value of enable
 
-   #5  reset = 1;    // Assert the reset
 
-   #10  reset = 0;   // De-assert the reset
 
-   #10  enable = 1;  // Assert enable
 
-   #100  enable = 0; // De-assert enable
 
-   #5  $finish;      // Terminate simulation
 
-end
 
-
 
-// Clock generator
 
-always begin
 
-   #5  clock = ~clock; // Toggle clock every 5 ticks
 
-end
 
-
 
-// Connect DUT to test bench
 
-first_counter U_counter (
 
-clock,
 
-reset,
 
-enable,
 
-counter_out
 
-);
 
-
 
-endmodule

+ 0 - 14
test/manual/samples/sample.xml.txt
Переглянути файл 

@@ -1,14 +0,0 @@
 
-<?xml version="1.0"?>

-<configuration xmlns:xdt="http://schemas.microsoft.com/XML-Document-Transform">

-  <connectionStrings>

-    <add name="MyDB" 

-      connectionString="value for the deployed Web.config file" 

-      xdt:Transform="SetAttributes" xdt:Locator="Match(name)"/>

-  </connectionStrings>

-  <system.web>

-    <customErrors defaultRedirect="GenericError.htm"

-      mode="RemoteOnly" xdt:Transform="Replace">

-      <error statusCode="500" redirect="InternalError.htm"/>

-    </customErrors>

-  </system.web>

-</configuration>

+ 0 - 14
test/manual/samples/sample.yaml.txt
Переглянути файл 

@@ -1,14 +0,0 @@
 
-%TAG ! tag:clarkevans.com,2002:
 
---- !shape
 
-  # Use the ! handle for presenting
 
-  # tag:clarkevans.com,2002:circle
 
-- !circle
 
-  center: &ORIGIN {x: 73, y: 129}
 
-  radius: 7
 
-- !line
 
-  start: *ORIGIN
 
-  finish: { x: 89, y: 102 }
 
-- !label
 
-  start: *ORIGIN
 
-  color: 0xFFEEBB
 
-  text: Pretty vector drawing.