Latest Tech News

Stay updated with the latest in technology, AI, cybersecurity, and more

Filtered by: prefix Clear Filter

Python-Style Kwargs in TypeScript

Python-style kwargs in TypeScript 2025-09-21 PythonTypeScript My TypeScript function signatures always start small. There's usually an optional argument or two, but the call sites are easy to reason about: const greet = ( name : string , prefix = "Hello" ) => ` ${ prefix } , ${ name } . ` ; greet ( "Alice" ) ; greet ( "Bob" , "!" ) ; But as these functions grow, it's cumbersome to specify the last optional argument while using defaults for the rest: const greet = ( name : string , prefix = "

GPU Prefix Sums: A nearly complete collection

GPU Prefix Sums GPUPrefixSums aims to bring state-of-the-art GPU prefix sum techniques from CUDA and make them available in portable compute shaders. In addition to this, it contributes "Decoupled Fallback," a novel fallback technique for Chained Scan with Decoupled Lookback that should allow devices without forward thread progress guarantees to perform the scan without crashing. The D3D12 implementation includes an extensive survey of GPU prefix sums, ranging from the warp to the device level;

GPUPrefixSums – state of the art GPU prefix sum algorithms

GPU Prefix Sums GPUPrefixSums aims to bring state-of-the-art GPU prefix sum techniques from CUDA and make them available in portable compute shaders. In addition to this, it contributes "Decoupled Fallback," a novel fallback technique for Chained Scan with Decoupled Lookback that should allow devices without forward thread progress guarantees to perform the scan without crashing. The D3D12 implementation includes an extensive survey of GPU prefix sums, ranging from the warp to the device level;

P-fast trie, but smaller

Previously, I wrote some sketchy ideas for what I call a p-fast trie, which is basically a wide fan-out variant of an x-fast trie. It allows you to find the longest matching prefix or nearest predecessor or successor of a query string in a set of names in O(log k) time, where k is the key length. My initial sketch was more complicated and greedy for space than necessary, so here’s a simplified revision. (“p” now stands for prefix.) A p-fast trie stores a lexicographically ordered set of names