Simplifying use of edge.js to wrap .NET libraries
An edge library for deploying computer vision applications built with Roboflow to JS environments.
Detect react-native-edge-to-edge package install
Effortlessly enable edge-to-edge display in React Native
Launch latest Edge with the Devtools Protocol port open
Official Sentry SDK for the Vercel Edge Runtime
A set of primitives to build Vercel Edge Runtime.
Low level bindings for creating Web Standard contexts.
A ponyfill (doesn't overwrite the native methods) to use Edge Runtime APIs in any environment.
Get the paths of edge browser easily
Run any Edge Function from CLI or Node.js module.
A set of helpers for running edge-compliant code in Node.js environment
A printf-like string formatter for Edge Runtime
node-edge-tts is a module that using Microsoft Edge's online TTS (Text-to-Speech) service on the Node.js
A point in polygon based on the paper Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons
Next.js Firebase Authentication for Edge and server runtimes. Compatible with latest Next.js features.
No description provided.
Cookie helpers compatible with Edge Runtime
Core library for shared utility methods
xyflow core system that powers React Flow and Svelte Flow.
EXPERIMENTAL - USE WITH CAUTION - Launch latest Edge with the Devtools Protocol port open
> ⚠️ Deprecation Notice: This package has been unified in [@vercel/functions](https://www.npmjs.com/package/@vercel/functions). Use it instead!
TypeScript types for Netlify Edge Functions
Use @vercel/edge-config instead.
Rgraphum: Graphum ruby implementation
Microsoft Azure Edge Gateway Client Library for Ruby
google-cloud-edge_container is the official client library for the Distributed Cloud Edge Container API.
google-cloud-edge_container-v1 is the official client library for the Distributed Cloud Edge Container V1 API. Note that google-cloud-edge_container-v1 is a version-specific client library. For most uses, we recommend installing the main client library google-cloud-edge_container instead. See the readme for more details.
Pathname utility library providing atomic writes, safe deletes, directory creation, glob-based file finding, tempfile helpers, copy, move, checksum, append, and file comparison. All operations handle edge cases gracefully.
A Ruby library and CLI tool to use Microsoft Edge's online TTS service from within Ruby code or using the provided rb-edge-tts or rb-edge-playback commands.
Network management API for Distributed Cloud Edge. Note that google-cloud-edge_network-v1 is a version-specific client library. For most uses, we recommend installing the main client library google-cloud-edge_network instead. See the readme for more details.
OverSIP is an async SIP proxy/server programmable in Ruby language. Some features of OverSIP are: - SIP transports: UDP, TCP, TLS and WebSocket. - Full IPv4 and IPv6 support. - RFC 3263: SIP DNS mechanism (NAPTR, SRV, A, AAAA) for failover and load balancing based on DNS. - RFC 5626: OverSIP is a perfect Outbound Edge Proxy, including an integrated STUN server. - Fully programmable in Ruby language (make SIP easy). - Fast and efficient: OverSIP core is coded in C language. OverSIP is build on top of EventMachine-LE async library which follows the Reactor Design Pattern, allowing thousands of concurrent connections and requests in a never-blocking fashion.
Instafill is a robust platform that streamlines the process of filling and processing PDF forms through cutting-edge AI technologies. This Ruby library provides developers with a straightforward interface to integrate Instafill AI's services, featuring automated form filling, batch processing capabilities, and digital signature integration to enhance workflow efficiency.
W3.CSS is a modern CSS framework with built-in responsiveness. Smaller and faster than any other CSS frameworks. Easier to learn, and easier to use than any other CSS frameworks. Better cross-browser compatibility than any other CSS frameworks. Uses standard CSS only (No jQuery or JavaScript library). Supports modern responsive mobile first design by default. Provides CSS equality for all browsers: Chrome, Firefox, Edge, IE, Safari, Opera. Provides CSS equality for all devices: desktop, laptop, tablet, and mobile. Speeds up and simplifies web development.
OverSIP is an async SIP proxy/server programmable in Ruby language. Some features of OverSIP are: - SIP transports: UDP, TCP, TLS and WebSocket. - Full IPv4 and IPv6 support. - RFC 3263: SIP DNS mechanism (NAPTR, SRV, A, AAAA) for failover and load balancing based on DNS. - RFC 5626: OverSIP is a perfect Outbound Edge Proxy, including an integrated STUN server. - Fully programmable in Ruby language (make SIP easy). - Fast and efficient: OverSIP core is coded in C language. OverSIP is build on top of EventMachine async library which follows the Reactor Design Pattern, allowing thousands of concurrent connections and requests in a never-blocking fashion.
In computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that keeps track of a set of elements partitioned into a number of disjoint (non-overlapping) subsets. It provides near-constant-time operations (bounded by the inverse Ackermann function) to add new sets, to merge existing sets, and to determine whether elements are in the same set. In addition to many other uses (see the Applications section), disjoint-sets play a key role in Kruskal's algorithm for finding the minimum spanning tree of a graph. A disjoint-set forest consists of a number of elements each of which stores an id, a parent pointer, and, in efficient algorithms, a value called the "rank". The parent pointers of elements are arranged to form one or more trees, each representing a set. If an element's parent pointer points to no other element, then the element is the root of a tree and is the representative member of its set. A set may consist of only a single element. However, if the element has a parent, the element is part of whatever set is identified by following the chain of parents upwards until a representative element (one without a parent) is reached at the root of the tree. Forests can be represented compactly in memory as arrays in which parents are indicated by their array index. Disjoint-set data structures model the partitioning of a set, for example to keep track of the connected components of an undirected graph. This model can then be used to determine whether two vertices belong to the same component, or whether adding an edge between them would result in a cycle. The Union–Find algorithm is used in high-performance implementations of unification. This data structure is used by the Boost Graph Library to implement its Incremental Connected Components functionality. It is also a key component in implementing Kruskal's algorithm to find the minimum spanning tree of a graph. Note that the implementation as disjoint-set forests doesn't allow the deletion of edges, even without path compression or the rank heuristic. Sharir and Agarwal report connections between the worst-case behavior of disjoint-sets and the length of Davenport–Schinzel sequences, a combinatorial structure from computational geometry.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.