| const code1 = '((7 1 +) 5 +) ((8 ((8 ((8 3 +) 1 +) +) 1 +) +) 1 +) +'; | |
| const code2 = '4 3 -'; | |
| const code3 = '(2 3 +) (23 21 +) +'; | |
| const operators = { | |
| '+': (args) => args[0] + args[1], | |
| '-': (args) => args[0] - args[1], | |
| '*': (args) => args[0] * args[1], | |
| '/': (args) => args[0] / args[1], | |
| }; |
| <!DOCTYPE html> | |
| <html> | |
| <head> | |
| <style> | |
| div { | |
| display: flex; | |
| gap: 1rem; | |
| } |
| module Main where | |
| data Tree a = Leaf a | Node (Tree a) (Tree a) | |
| stringifyTree :: Tree Integer -> [Char] | |
| stringifyTree (Leaf x) = show x | |
| stringifyTree (Node left right) = " {" ++ (stringifyTree left) ++ "} - {" ++ (stringifyTree right) ++ "} " | |
| dump :: Tree a -> [a] | |
| dump (Leaf x) = [x] |
| module Main where | |
| type Pair a = ( [Char], a ) | |
| updateValue :: [Char] -> a -> [Pair a] -> [Pair a] | |
| updateValue key value [] = [(key, value)] | |
| updateValue key value [(a, b)] | |
| | a == key = [(key, value)] | |
| | otherwise = [(a, b), (key, value)] | |
| updateValue key value ((a, b):xs) |
| module Main where | |
| data List a = End a | Node a (List a) deriving (Show) | |
| prepend :: a -> List a -> List a | |
| prepend value x = Node value x | |
| append :: a -> List a -> List a | |
| append value (End x) = Node x (End value) | |
| append value (Node x y) = Node x (append value y) |
Os requisitos desse projeto não são especificos de nenhuma linguagem nem framework, as integrações podem acontecer tanto no frontend quanto no backend. O foco principal é na usabilidade do projeto pelo usuário. A base da aplicação é baseada em 3 etapas:
| /** | |
| * Decodes a Roman numeral to a number. | |
| * | |
| * @param {string} roman - The Roman numeral to decode. | |
| * @returns {number} The decoded Roman numeral. | |
| */ | |
| const numerals: Record<string, number> = { | |
| 'I': 1, | |
| 'V': 5, |
| /** | |
| * Finds the number in an array with the most digits. | |
| * | |
| * @param {string} signals - The incomplete source. | |
| * @returns {string[]} Suggestions of possible complete sources. | |
| */ | |
| const MORSE_DICTIONARY: Record<string, string> = { | |
| ".": "E", | |
| "-": "T", |
| /** | |
| * Evaluates an expression in Reverse Polish Notation. | |
| * | |
| * @param {string} expression - The input expression. | |
| * @returns {number} The result of the RPN expression. | |
| */ | |
| // This script parses the expression into a tree and then evaluates, should be something like O(n) because iterates once on the parsing and once in the evaluating | |
| type Operator = {op: string, left: Operator | number, right: Operator | number}; |
| <html> | |
| <body> | |
| <style contenteditable> | |
| style { display: block; }@keyframes animat { 0% { background-color: pink; } 50% { background-color: orange; } 100% { background-color: red; } }body { animation: animat 750ms infinite alternate; } | |
| </style> | |
| </body> | |
| </html> |
