This module provides several useful functions to calculate timestamps(enter-exit,array-format) overlapping
Find the Overlap Area.
Checks if two geometries have an area of overlap without one being completely contained inside the other.
Takes any LineString or Polygon and returns the overlapping lines between both features.
Overlap two strings that contain new lines. Useful for ASCII drawings.
View-specific transforms for Vega dataflows.
A collection of utility libraries used by other Facebook JS projects
Computes the area of the intersection of two rectangles.
Spatial navigation library
micromark utility to resolve subtokens
Validity check functions. These functions generally take [a tscircuit json array](https://github.com/tscircuit/soup) and output an array of arrays for any issues found.
Check if subnet overlapped.
Implementation of interval tree data structure.
Fast and easy parser of statements in source code in any language ✂️
Cytoscape extension to help prevent overlap of nodes
Format validation for Ajv v7+
common javascript utils that can be required selectively that assume es5+
TypeScript definitions for d3-time
A calculator for humanity’s peculiar conventions of time.
Check if two polygons overlap
hint that that checks using axe for accessibility related best practices
Time zone support for date-fns v3 with the Intl API
High-performance 3D spatial index for cuboids (based on R*-tree with bulk loading and bulk insertion algorithms)
date-fns timezone utils
Write a longer description or delete this line.
It can be useful when you you are developing some app where you will work with meetings, events etc.
Interval data type supporting closed, open, and half-open boundaries with overlap detection, containment, intersection, union, subtraction, shift, scale, split, clamp, merging collections, and finding gaps. Works with any Comparable type including Numeric and Time.
You can manage the beginning and ending date time of a term. You can also check whether two terms are overlapped. When the beginning or ending date time is indefinite, you can represent it by nil.
This gem helps you easily set up time range uniqueness constraints in PostgreSQL using ActiveRecord migrations and validations. It ensures that time ranges do not overlap within a table, supporting optional scoping of uniqueness.
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.