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';2 3// src/utils.js4var SPACE_REGEX = /\s+/g;5var removeExtraSpaces = (str) => {6 if (typeof str !== "string" || !str) return str;7 return str.replace(SPACE_REGEX, " ").trim();8};9var cx = (...classnames) => {10 const classList = [];11 const buildClassString = (input) => {12 if (!input && input !== 0 && input !== 0n) return;13 if (Array.isArray(input)) {14 for (let i = 0, len = input.length; i < len; i++) buildClassString(input[i]);15 return;16 }17 const type = typeof input;18 if (type === "string" || type === "number" || type === "bigint") {19 if (type === "number" && input !== input) return;20 classList.push(String(input));21 } else if (type === "object") {22 const keys = Object.keys(input);23 for (let i = 0, len = keys.length; i < len; i++) {24 const key = keys[i];25 if (input[key]) classList.push(key);26 }27 }28 };29 for (let i = 0, len = classnames.length; i < len; i++) {30 const c = classnames[i];31 if (c !== null && c !== void 0) buildClassString(c);32 }33 return classList.length > 0 ? removeExtraSpaces(classList.join(" ")) : void 0;34};35var falsyToString = (value) => value === false ? "false" : value === true ? "true" : value === 0 ? "0" : value;36var isEmptyObject = (obj) => {37 if (!obj || typeof obj !== "object") return true;38 for (const _ in obj) return false;39 return true;40};41var isEqual = (obj1, obj2) => {42 if (obj1 === obj2) return true;43 if (!obj1 || !obj2) return false;44 const keys1 = Object.keys(obj1);45 const keys2 = Object.keys(obj2);46 if (keys1.length !== keys2.length) return false;47 for (let i = 0; i < keys1.length; i++) {48 const key = keys1[i];49 if (!keys2.includes(key)) return false;50 if (obj1[key] !== obj2[key]) return false;51 }52 return true;53};54var isBoolean = (value) => value === true || value === false;55var joinObjects = (obj1, obj2) => {56 for (const key in obj2) {57 if (Object.prototype.hasOwnProperty.call(obj2, key)) {58 const val2 = obj2[key];59 if (key in obj1) {60 obj1[key] = cx(obj1[key], val2);61 } else {62 obj1[key] = val2;63 }64 }65 }66 return obj1;67};68var flat = (arr, target) => {69 for (let i = 0; i < arr.length; i++) {70 const el = arr[i];71 if (Array.isArray(el)) flat(el, target);72 else if (el) target.push(el);73 }74};75function flatArray(arr) {76 const flattened = [];77 flat(arr, flattened);78 return flattened;79}80var flatMergeArrays = (...arrays) => {81 const result = [];82 flat(arrays, result);83 const filtered = [];84 for (let i = 0; i < result.length; i++) {85 if (result[i]) filtered.push(result[i]);86 }87 return filtered;88};89var mergeObjects = (obj1, obj2) => {90 const result = {};91 for (const key in obj1) {92 const val1 = obj1[key];93 if (key in obj2) {94 const val2 = obj2[key];95 if (Array.isArray(val1) || Array.isArray(val2)) {96 result[key] = flatMergeArrays(val2, val1);97 } else if (typeof val1 === "object" && typeof val2 === "object" && val1 && val2) {98 result[key] = mergeObjects(val1, val2);99 } else {100 result[key] = val2 + " " + val1;101 }102 } else {103 result[key] = val1;104 }105 }106 for (const key in obj2) {107 if (!(key in obj1)) {108 result[key] = obj2[key];109 }110 }111 return result;112};113 114exports.cx = cx;115exports.falsyToString = falsyToString;116exports.flat = flat;117exports.flatArray = flatArray;118exports.flatMergeArrays = flatMergeArrays;119exports.isBoolean = isBoolean;120exports.isEmptyObject = isEmptyObject;121exports.isEqual = isEqual;122exports.joinObjects = joinObjects;123exports.mergeObjects = mergeObjects;124exports.removeExtraSpaces = removeExtraSpaces;125 