| \n <#nested>\n |
We have these animals:\n\n
| \\n <#nested>\\n |
We have these animals:\\n\\n
| \n <#nested>\n |
We have these animals:\n\n
| \\n <#nested>\\n |
We have these animals:\\n\\n
| \n [#nested]\n |
We have these animals:\n\n
| \\n [#nested]\\n |
We have these animals:\\n\\n
Enter two whole numbers and then click Add.
\n \n\n\t@* now we call the totalMessage method \n\t (a multi line razor comment outside code) *@\n\n@totalMessage
\n \n@(totalMessage+"!")
\n \n An email address (with escaped at character): name@@domain.com\n \n\n\n'}}]); +//# sourceMappingURL=4773.js.map \ No newline at end of file diff --git a/4773.js.map b/4773.js.map new file mode 100644 index 00000000..d6dbdfc6 --- /dev/null +++ b/4773.js.map @@ -0,0 +1 @@ +{"version":3,"file":"4773.js","mappings":"8IAAA,msC","sources":["file:////home/runner/work/monaco-editor/monaco-editor/website/src/website/data/home-samples/sample.razor.txt"],"sourcesContent":["export default \"@{\\n var total = 0;\\n var totalMessage = \\\"\\\";\\n @* a multiline\\n razor comment embedded in csharp *@\\n if (IsPost) {\\n\\n // Retrieve the numbers that the user entered.\\n var num1 = Request[\\\"text1\\\"];\\n var num2 = Request[\\\"text2\\\"];\\n\\n // Convert the entered strings into integers numbers and add.\\n total = num1.AsInt() + num2.AsInt();\\n\\t\\tEnter two whole numbers and then click Add.
\\n \\n\\n\\t@* now we call the totalMessage method \\n\\t (a multi line razor comment outside code) *@\\n\\n@totalMessage
\\n \\n@(totalMessage+\\\"!\\\")
\\n \\n An email address (with escaped at character): name@@domain.com\\n \\n\\n\\n\";"],"names":[],"sourceRoot":""} \ No newline at end of file diff --git a/4942.js b/4942.js new file mode 100644 index 00000000..d309fb99 --- /dev/null +++ b/4942.js @@ -0,0 +1,2 @@ +"use strict";(self.webpackChunkmy_application=self.webpackChunkmy_application||[]).push([[4942],{4942:(n,e,i)=>{i.r(e),i.d(e,{default:()=>s});const s='(ns game-of-life\n "Conway\'s Game of Life, based on the work of\n Christophe Grand (http://clj-me.cgrand.net/2011/08/19/conways-game-of-life)\n and Laurent Petit (https://gist.github.com/1200343).")\n\n;;; Core game of life\'s algorithm functions\n\n(defn neighbors\n "Given a cell\'s coordinates `[x y]`, returns the coordinates of its\n neighbors."\n [[x y]]\n (for [dx [-1 0 1]\n dy (if (zero? dx)\n [-1 1]\n [-1 0 1])]\n [(+ dx x) (+ dy y)]))\n\n(defn step\n "Given a set of living `cells`, computes the new set of living cells."\n [cells]\n (set (for [[cell n] (frequencies (mapcat neighbors cells))\n :when (or (= n 3)\n (and (= n 2)\n (cells cell)))]\n cell)))\n\n;;; Utility methods for displaying game on a text terminal\n\n(defn print-grid\n "Prints a `grid` of `w` columns and `h` rows, on *out*, representing a\n step in the game."\n [grid w h]\n (doseq [x (range (inc w))\n y (range (inc h))]\n (when (= y 0) (println))\n (print (if (grid [x y])\n "[X]"\n " . "))))\n\n(defn print-grids\n "Prints a sequence of `grids` of `w` columns and `h` rows on *out*,\n representing several steps."\n [grids w h]\n (doseq [grid grids]\n (print-grid grid w h)\n (println)))\n\n;;; Launches an example grid\n\n(def grid\n "`grid` represents the initial set of living cells"\n #{[2 1] [2 2] [2 3]})\n\n(print-grids (take 3 (iterate step grid)) 5 5)'}}]); +//# sourceMappingURL=4942.js.map \ No newline at end of file diff --git a/4942.js.map b/4942.js.map new file mode 100644 index 00000000..85f6e024 --- /dev/null +++ b/4942.js.map @@ -0,0 +1 @@ +{"version":3,"file":"4942.js","mappings":"8IAAA,s/C","sources":["file:////home/runner/work/monaco-editor/monaco-editor/website/src/website/data/home-samples/sample.clojure.txt"],"sourcesContent":["export default \"(ns game-of-life\\n \\\"Conway's Game of Life, based on the work of\\n Christophe Grand (http://clj-me.cgrand.net/2011/08/19/conways-game-of-life)\\n and Laurent Petit (https://gist.github.com/1200343).\\\")\\n\\n;;; Core game of life's algorithm functions\\n\\n(defn neighbors\\n \\\"Given a cell's coordinates `[x y]`, returns the coordinates of its\\n neighbors.\\\"\\n [[x y]]\\n (for [dx [-1 0 1]\\n dy (if (zero? dx)\\n [-1 1]\\n [-1 0 1])]\\n [(+ dx x) (+ dy y)]))\\n\\n(defn step\\n \\\"Given a set of living `cells`, computes the new set of living cells.\\\"\\n [cells]\\n (set (for [[cell n] (frequencies (mapcat neighbors cells))\\n :when (or (= n 3)\\n (and (= n 2)\\n (cells cell)))]\\n cell)))\\n\\n;;; Utility methods for displaying game on a text terminal\\n\\n(defn print-grid\\n \\\"Prints a `grid` of `w` columns and `h` rows, on *out*, representing a\\n step in the game.\\\"\\n [grid w h]\\n (doseq [x (range (inc w))\\n y (range (inc h))]\\n (when (= y 0) (println))\\n (print (if (grid [x y])\\n \\\"[X]\\\"\\n \\\" . \\\"))))\\n\\n(defn print-grids\\n \\\"Prints a sequence of `grids` of `w` columns and `h` rows on *out*,\\n representing several steps.\\\"\\n [grids w h]\\n (doseq [grid grids]\\n (print-grid grid w h)\\n (println)))\\n\\n;;; Launches an example grid\\n\\n(def grid\\n \\\"`grid` represents the initial set of living cells\\\"\\n #{[2 1] [2 2] [2 3]})\\n\\n(print-grids (take 3 (iterate step grid)) 5 5)\";"],"names":[],"sourceRoot":""} \ No newline at end of file diff --git a/5087.js b/5087.js new file mode 100644 index 00000000..7f1b67f7 --- /dev/null +++ b/5087.js @@ -0,0 +1,2 @@ +"use strict";(self.webpackChunkmy_application=self.webpackChunkmy_application||[]).push([[5087],{5087:(t,n,e)=>{e.r(n),e.d(n,{default:()=>i});const i='/*\n\tBasic Java example using FizzBuzz\n*/\n\nimport java.util.Random;\n\npublic class Example {\n\tpublic static void main (String[] args){\n\t\t// Generate a random number between 1-100. (See generateRandomNumber method.)\n\t\tint random = generateRandomNumber(100);\n\n\t\t// Output generated number.\n\t\tSystem.out.println("Generated number: " + random + "\\n");\n\n\t\t// Loop between 1 and the number we just generated.\n\t\tfor (int i=1; i<=random; i++){\n\t\t\t// If i is divisible by both 3 and 5, output "FizzBuzz".\n\t\t\tif (i % 3 == 0 && i % 5 == 0){\n\t\t\t\tSystem.out.println("FizzBuzz");\n\t\t\t}\n\t\t\t// If i is divisible by 3, output "Fizz"\n\t\t\telse if (i % 3 == 0){\n\t\t\t\tSystem.out.println("Fizz");\n\t\t\t}\n\t\t\t// If i is divisible by 5, output "Buzz".\n\t\t\telse if (i % 5 == 0){\n\t\t\t\tSystem.out.println("Buzz");\n\t\t\t}\n\t\t\t// If i is not divisible by either 3 or 5, output the number.\n\t\t\telse {\n\t\t\t\tSystem.out.println(i);\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t\tGenerates a new random number between 0 and 100.\n\t\t@param bound The highest number that should be generated.\n\t\t@return An integer representing a randomly generated number between 0 and 100.\n\t*/\n\tprivate static int generateRandomNumber(int bound){\n\t\t// Create new Random generator object and generate the random number.\n\t\tRandom randGen = new Random();\n\t\tint randomNum = randGen.nextInt(bound);\n\n\t\t// If the random number generated is zero, use recursion to regenerate the number until it is not zero.\n\t\tif (randomNum < 1){\n\t\t\trandomNum = generateRandomNumber(bound);\n\t\t}\n\n\t\treturn randomNum;\n\t}\n}\n '}}]); +//# sourceMappingURL=5087.js.map \ No newline at end of file diff --git a/5087.js.map b/5087.js.map new file mode 100644 index 00000000..5602b3d2 --- /dev/null +++ b/5087.js.map @@ -0,0 +1 @@ +{"version":3,"file":"5087.js","mappings":"8IAAA,8nD","sources":["file:////home/runner/work/monaco-editor/monaco-editor/website/src/website/data/home-samples/sample.java.txt"],"sourcesContent":["export default \"/*\\n\\tBasic Java example using FizzBuzz\\n*/\\n\\nimport java.util.Random;\\n\\npublic class Example {\\n\\tpublic static void main (String[] args){\\n\\t\\t// Generate a random number between 1-100. (See generateRandomNumber method.)\\n\\t\\tint random = generateRandomNumber(100);\\n\\n\\t\\t// Output generated number.\\n\\t\\tSystem.out.println(\\\"Generated number: \\\" + random + \\\"\\\\n\\\");\\n\\n\\t\\t// Loop between 1 and the number we just generated.\\n\\t\\tfor (int i=1; i<=random; i++){\\n\\t\\t\\t// If i is divisible by both 3 and 5, output \\\"FizzBuzz\\\".\\n\\t\\t\\tif (i % 3 == 0 && i % 5 == 0){\\n\\t\\t\\t\\tSystem.out.println(\\\"FizzBuzz\\\");\\n\\t\\t\\t}\\n\\t\\t\\t// If i is divisible by 3, output \\\"Fizz\\\"\\n\\t\\t\\telse if (i % 3 == 0){\\n\\t\\t\\t\\tSystem.out.println(\\\"Fizz\\\");\\n\\t\\t\\t}\\n\\t\\t\\t// If i is divisible by 5, output \\\"Buzz\\\".\\n\\t\\t\\telse if (i % 5 == 0){\\n\\t\\t\\t\\tSystem.out.println(\\\"Buzz\\\");\\n\\t\\t\\t}\\n\\t\\t\\t// If i is not divisible by either 3 or 5, output the number.\\n\\t\\t\\telse {\\n\\t\\t\\t\\tSystem.out.println(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t/**\\n\\t\\tGenerates a new random number between 0 and 100.\\n\\t\\t@param bound The highest number that should be generated.\\n\\t\\t@return An integer representing a randomly generated number between 0 and 100.\\n\\t*/\\n\\tprivate static int generateRandomNumber(int bound){\\n\\t\\t// Create new Random generator object and generate the random number.\\n\\t\\tRandom randGen = new Random();\\n\\t\\tint randomNum = randGen.nextInt(bound);\\n\\n\\t\\t// If the random number generated is zero, use recursion to regenerate the number until it is not zero.\\n\\t\\tif (randomNum < 1){\\n\\t\\t\\trandomNum = generateRandomNumber(bound);\\n\\t\\t}\\n\\n\\t\\treturn randomNum;\\n\\t}\\n}\\n \";"],"names":[],"sourceRoot":""} \ No newline at end of file diff --git a/5115.js b/5115.js new file mode 100644 index 00000000..ace55e84 --- /dev/null +++ b/5115.js @@ -0,0 +1,2 @@ +"use strict";(self.webpackChunkmy_application=self.webpackChunkmy_application||[]).push([[5115],{4323:(n,e,r)=>{r.r(e),r.d(e,{default:()=>o});const o="targetScope = 'subscription'\n\nparam deployStorage bool = true\n\n@description('The object ID of the principal that will get the role assignment')\nparam aadPrincipalId string\n\nmodule stg './storage.bicep' = if(deployStorage) {\n name: 'storageDeploy'\n scope: resourceGroup('another-rg') // this will target another resource group in the same subscription\n params: {\n storageAccountName: '
{{title}}
\n\t