Datasetpublic

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.

sourceHugging Faceupdated 2mo agoView on Hugging Face

0likes3.1kdownloads

roottoolsuinode_modulestailwind-mergesrclibutils.ts

utils.ts18 linesDownload Raw Back to lib

1/**2 * Concatenates two arrays faster than the array spread operator.3 */4export const concatArrays = <T, U>(5    array1: readonly T[],6    array2: readonly U[],7): readonly (T | U)[] => {8    // Pre-allocate for better V8 optimization9    const combinedArray: (T | U)[] = new Array(array1.length + array2.length)10    for (let i = 0; i < array1.length; i++) {11        combinedArray[i] = array1[i]!12    }13    for (let i = 0; i < array2.length; i++) {14        combinedArray[array1.length + i] = array2[i]!15    }16    return combinedArray17}18