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"use strict";2var __defProp = Object.defineProperty;3var __getOwnPropDesc = Object.getOwnPropertyDescriptor;4var __getOwnPropNames = Object.getOwnPropertyNames;5var __hasOwnProp = Object.prototype.hasOwnProperty;6var __export = (target, all) => {7 for (var name in all)8 __defProp(target, name, { get: all[name], enumerable: true });9};10var __copyProps = (to, from, except, desc) => {11 if (from && typeof from === "object" || typeof from === "function") {12 for (let key of __getOwnPropNames(from))13 if (!__hasOwnProp.call(to, key) && key !== except)14 __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });15 }16 return to;17};18var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);19var callLog_exports = {};20__export(callLog_exports, {21 compressCallLog: () => compressCallLog,22 findRepeatedSubsequencesForTest: () => findRepeatedSubsequencesForTest23});24module.exports = __toCommonJS(callLog_exports);25function compressCallLog(log) {26 const lines = [];27 for (const block of findRepeatedSubsequences(log)) {28 for (let i = 0; i < block.sequence.length; i++) {29 const line = block.sequence[i];30 const leadingWhitespace = line.match(/^\s*/);31 const whitespacePrefix = " " + leadingWhitespace?.[0] || "";32 const countPrefix = `${block.count} \xD7 `;33 if (block.count > 1 && i === 0)34 lines.push(whitespacePrefix + countPrefix + line.trim());35 else if (block.count > 1)36 lines.push(whitespacePrefix + " ".repeat(countPrefix.length - 2) + "- " + line.trim());37 else38 lines.push(whitespacePrefix + "- " + line.trim());39 }40 }41 return lines;42}43function findRepeatedSubsequences(s) {44 const n = s.length;45 const result = [];46 let i = 0;47 const arraysEqual = (a1, a2) => {48 if (a1.length !== a2.length)49 return false;50 for (let j = 0; j < a1.length; j++) {51 if (a1[j] !== a2[j])52 return false;53 }54 return true;55 };56 while (i < n) {57 let maxRepeatCount = 1;58 let maxRepeatSubstr = [s[i]];59 let maxRepeatLength = 1;60 for (let p = 1; p <= n - i; p++) {61 const substr = s.slice(i, i + p);62 let k = 1;63 while (i + p * k <= n && arraysEqual(s.slice(i + p * (k - 1), i + p * k), substr))64 k += 1;65 k -= 1;66 if (k > 1 && k * p > maxRepeatCount * maxRepeatLength) {67 maxRepeatCount = k;68 maxRepeatSubstr = substr;69 maxRepeatLength = p;70 }71 }72 result.push({ sequence: maxRepeatSubstr, count: maxRepeatCount });73 i += maxRepeatLength * maxRepeatCount;74 }75 return result;76}77const findRepeatedSubsequencesForTest = findRepeatedSubsequences;78// Annotate the CommonJS export names for ESM import in node:790 && (module.exports = {80 compressCallLog,81 findRepeatedSubsequencesForTest82});83 