Brunobkr/llama.cpp_AlgMor24_github
ΩFFFΣLLIa • llama.cpp • AlgMor24 ██████╗ ███████╗███████╗███████╗██╗ ██╗ ██╗ █████╗ ██╔═══██╗██╔════╝██╔════╝██╔════╝██║ ██║ ██║██╔══██╗ ██║ ██║█████╗ █████╗ █████╗ ██║ ██║ ██║███████║ ██║ ██║██╔══╝ ██╔══╝ ██╔══╝ ██║ ██║ ██║██╔══██║ ╚██████╔╝██║ ██║ ███████╗███████╗███████╗██║██║ ██║ ╚═════╝ ╚═╝ ╚═╝ ╚══════╝╚══════╝╚══════╝╚═╝╚═╝ ╚═╝ High-Performance LLM / VLM Inference & Autonomous Agentic Ecosystem… See the full description on the dataset page: https://huggingface.co/datasets/Brunobkr/llama.cpp_AlgMor24_github.
03.1k
1(function (Prism) {2 Prism.languages.scheme = {3 // this supports "normal" single-line comments:4 // ; comment5 // and (potentially nested) multiline comments:6 // #| comment #| nested |# still comment |#7 // (only 1 level of nesting is supported)8 'comment': /;.*|#;\s*(?:\((?:[^()]|\([^()]*\))*\)|\[(?:[^\[\]]|\[[^\[\]]*\])*\])|#\|(?:[^#|]|#(?!\|)|\|(?!#)|#\|(?:[^#|]|#(?!\|)|\|(?!#))*\|#)*\|#/,9 'string': {10 pattern: /"(?:[^"\\]|\\.)*"/,11 greedy: true12 },13 'symbol': {14 pattern: /'[^()\[\]#'\s]+/,15 greedy: true16 },17 'char': {18 pattern: /#\\(?:[ux][a-fA-F\d]+\b|[-a-zA-Z]+\b|[\uD800-\uDBFF][\uDC00-\uDFFF]|\S)/,19 greedy: true20 },21 'lambda-parameter': [22 // https://www.cs.cmu.edu/Groups/AI/html/r4rs/r4rs_6.html#SEC3023 {24 pattern: /((?:^|[^'`#])[(\[]lambda\s+)(?:[^|()\[\]'\s]+|\|(?:[^\\|]|\\.)*\|)/,25 lookbehind: true26 },27 {28 pattern: /((?:^|[^'`#])[(\[]lambda\s+[(\[])[^()\[\]']+/,29 lookbehind: true30 }31 ],32 'keyword': {33 pattern: /((?:^|[^'`#])[(\[])(?:begin|case(?:-lambda)?|cond(?:-expand)?|define(?:-library|-macro|-record-type|-syntax|-values)?|defmacro|delay(?:-force)?|do|else|except|export|guard|if|import|include(?:-ci|-library-declarations)?|lambda|let(?:rec)?(?:-syntax|-values|\*)?|let\*-values|only|parameterize|prefix|(?:quasi-?)?quote|rename|set!|syntax-(?:case|rules)|unless|unquote(?:-splicing)?|when)(?=[()\[\]\s]|$)/,34 lookbehind: true35 },36 'builtin': {37 // all functions of the base library of R7RS plus some of built-ins of R5Rs38 pattern: /((?:^|[^'`#])[(\[])(?:abs|and|append|apply|assoc|ass[qv]|binary-port\?|boolean=?\?|bytevector(?:-append|-copy|-copy!|-length|-u8-ref|-u8-set!|\?)?|caar|cadr|call-with-(?:current-continuation|port|values)|call\/cc|car|cdar|cddr|cdr|ceiling|char(?:->integer|-ready\?|\?|<\?|<=\?|=\?|>\?|>=\?)|close-(?:input-port|output-port|port)|complex\?|cons|current-(?:error|input|output)-port|denominator|dynamic-wind|eof-object\??|eq\?|equal\?|eqv\?|error|error-object(?:-irritants|-message|\?)|eval|even\?|exact(?:-integer-sqrt|-integer\?|\?)?|expt|features|file-error\?|floor(?:-quotient|-remainder|\/)?|flush-output-port|for-each|gcd|get-output-(?:bytevector|string)|inexact\??|input-port(?:-open\?|\?)|integer(?:->char|\?)|lcm|length|list(?:->string|->vector|-copy|-ref|-set!|-tail|\?)?|make-(?:bytevector|list|parameter|string|vector)|map|max|member|memq|memv|min|modulo|negative\?|newline|not|null\?|number(?:->string|\?)|numerator|odd\?|open-(?:input|output)-(?:bytevector|string)|or|output-port(?:-open\?|\?)|pair\?|peek-char|peek-u8|port\?|positive\?|procedure\?|quotient|raise|raise-continuable|rational\?|rationalize|read-(?:bytevector|bytevector!|char|error\?|line|string|u8)|real\?|remainder|reverse|round|set-c[ad]r!|square|string(?:->list|->number|->symbol|->utf8|->vector|-append|-copy|-copy!|-fill!|-for-each|-length|-map|-ref|-set!|\?|<\?|<=\?|=\?|>\?|>=\?)?|substring|symbol(?:->string|\?|=\?)|syntax-error|textual-port\?|truncate(?:-quotient|-remainder|\/)?|u8-ready\?|utf8->string|values|vector(?:->list|->string|-append|-copy|-copy!|-fill!|-for-each|-length|-map|-ref|-set!|\?)?|with-exception-handler|write-(?:bytevector|char|string|u8)|zero\?)(?=[()\[\]\s]|$)/,39 lookbehind: true40 },41 'operator': {42 pattern: /((?:^|[^'`#])[(\[])(?:[-+*%/]|[<>]=?|=>?)(?=[()\[\]\s]|$)/,43 lookbehind: true44 },45 'number': {46 // The number pattern from [the R7RS spec](https://small.r7rs.org/attachment/r7rs.pdf).47 //48 // <number> := <num 2>|<num 8>|<num 10>|<num 16>49 // <num R> := <prefix R><complex R>50 // <complex R> := <real R>(?:@<real R>|<imaginary R>)?|<imaginary R>51 // <imaginary R> := [+-](?:<ureal R>|(?:inf|nan)\.0)?i52 // <real R> := [+-]?<ureal R>|[+-](?:inf|nan)\.053 // <ureal R> := <uint R>(?:\/<uint R>)?54 // | <decimal R>55 //56 // <decimal 10> := (?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?57 // <uint R> := <digit R>+58 // <prefix R> := <radix R>(?:#[ei])?|(?:#[ei])?<radix R>59 // <radix 2> := #b60 // <radix 8> := #o61 // <radix 10> := (?:#d)?62 // <radix 16> := #x63 // <digit 2> := [01]64 // <digit 8> := [0-7]65 // <digit 10> := \d66 // <digit 16> := [0-9a-f]67 //68 // The problem with this grammar is that the resulting regex is way to complex, so we simplify by grouping all69 // non-decimal bases together. This results in a decimal (dec) and combined binary, octal, and hexadecimal (box)70 // pattern:71 pattern: RegExp(SortedBNF({72 '<ureal dec>': /\d+(?:\/\d+)|(?:\d+(?:\.\d*)?|\.\d+)(?:[esfdl][+-]?\d+)?/.source,73 '<real dec>': /[+-]?<ureal dec>|[+-](?:inf|nan)\.0/.source,74 '<imaginary dec>': /[+-](?:<ureal dec>|(?:inf|nan)\.0)?i/.source,75 '<complex dec>': /<real dec>(?:@<real dec>|<imaginary dec>)?|<imaginary dec>/.source,76 '<num dec>': /(?:#d(?:#[ei])?|#[ei](?:#d)?)?<complex dec>/.source,77 78 '<ureal box>': /[0-9a-f]+(?:\/[0-9a-f]+)?/.source,79 '<real box>': /[+-]?<ureal box>|[+-](?:inf|nan)\.0/.source,80 '<imaginary box>': /[+-](?:<ureal box>|(?:inf|nan)\.0)?i/.source,81 '<complex box>': /<real box>(?:@<real box>|<imaginary box>)?|<imaginary box>/.source,82 '<num box>': /#[box](?:#[ei])?|(?:#[ei])?#[box]<complex box>/.source,83 84 '<number>': /(^|[()\[\]\s])(?:<num dec>|<num box>)(?=[()\[\]\s]|$)/.source,85 }), 'i'),86 lookbehind: true87 },88 'boolean': {89 pattern: /(^|[()\[\]\s])#(?:[ft]|false|true)(?=[()\[\]\s]|$)/,90 lookbehind: true91 },92 'function': {93 pattern: /((?:^|[^'`#])[(\[])(?:[^|()\[\]'\s]+|\|(?:[^\\|]|\\.)*\|)(?=[()\[\]\s]|$)/,94 lookbehind: true95 },96 'identifier': {97 pattern: /(^|[()\[\]\s])\|(?:[^\\|]|\\.)*\|(?=[()\[\]\s]|$)/,98 lookbehind: true,99 greedy: true100 },101 'punctuation': /[()\[\]']/102 };103 104 /**105 * Given a topologically sorted BNF grammar, this will return the RegExp source of last rule of the grammar.106 *107 * @param {Record<string, string>} grammar108 * @returns {string}109 */110 function SortedBNF(grammar) {111 for (var key in grammar) {112 grammar[key] = grammar[key].replace(/<[\w\s]+>/g, function (key) {113 return '(?:' + grammar[key].trim() + ')';114 });115 }116 // return the last item117 return grammar[key];118 }119 120}(Prism));121 