Difference between revisions of "Standard Library"
Jump to navigation
Jump to search
(创建页面，内容为“ == Java == == Data Structures == * Binary-Indexed Tree * Segment Tree == Math == * Multiply, Power and Inverse * Extended Euclid”) |
Xiejiadong (talk | contribs) (→Others) |
||
| (22 intermediate revisions by 4 users not shown) | |||
| Line 1: | Line 1: | ||
| + | <span style="color:red">'''Attention:''' This library is no longer maintained. It has been moved to [https://github.com/zerolfx/template here].</span> | ||
== Java == | == Java == | ||
| + | * [[RedBlackBST]] | ||
| + | * [[KMP]] | ||
| + | == Calculation == | ||
| + | |||
| + | * [[Value Integration]] | ||
| + | * [[BigInteger]] | ||
== Data Structures == | == Data Structures == | ||
| − | * Binary-Indexed Tree | + | * [[Binary-Indexed Tree]] |
| − | * Segment Tree | + | * [[Segment Tree]] |
| + | * [[Sparse Table]] | ||
| + | * [[Heap]] | ||
| + | * [[Self-Balanced BST]] | ||
| + | * [[Persistence Data Structures]] | ||
| + | * [[Link-Cut Tree]] | ||
| + | * [[Cartesian Tree]] | ||
| + | |||
| + | == Graph Theory == | ||
| + | |||
| + | * [[Eulerian Path]] | ||
| + | * [[Connected Component, 2-SAT]] | ||
| + | * [[Spanning Trees]] | ||
| + | * [[Bipartite Graph]] | ||
| + | * [[Network Flow]] | ||
| + | * [[Heavy-light Decomposition]] | ||
| + | * [[Maximal Clique]] | ||
| + | * [[Perfect Elimination Ordering]] | ||
| + | * [[Tree and Graph Isomorphism]] | ||
| + | |||
| + | == Geometry == | ||
| + | |||
| + | * [[2D Misc]] | ||
| + | * [[Convex Hull]] | ||
| + | * [[Rotating Calipers]] | ||
| + | * [[Half-plane Intersection]] | ||
| + | * [[Circle Union]] | ||
| + | * [[Inversion]] | ||
| + | |||
| + | * [[3D Misc]] | ||
| + | |||
| + | == Linear Algebra == | ||
| + | |||
| + | * [[Matrix Fundamentals]] | ||
| + | * [[Linear Equation Group]] | ||
| + | * [[Vector Orthogonalization]] | ||
| + | * [[Recursion Optimization]] | ||
| + | |||
| + | == Number Theory == | ||
| + | |||
| + | * [[Multiply, Power and Inverse]] | ||
| + | * [[Sieve]] | ||
| + | * [[Extended Euclid]] | ||
| + | * [[Chinese Remainder Theorem]] | ||
| + | * [[Primitive Root]] | ||
| + | * [[Quadratic Residue and Discrete Roots]] | ||
| + | * [[Discrete Logarithm]] | ||
| + | * [[Miller-Rabin]] | ||
| + | * [[Pollard's Rho]] | ||
| + | * [[Gaussian Elimination]] | ||
| + | * [[NTT & FFT]] | ||
| + | == Others == | ||
| + | * [[FastIO]] | ||
| + | * [[Modulo]] | ||
| + | * [[Date Magic]] | ||
| + | * [[Discretization]] | ||
| + | * [[Permutation Rank]] | ||
| + | * [[Expression Parsing]] | ||
| + | * [[Kth Number]] | ||
| + | * [[Longest Common Sequence]] | ||
| + | * [[Area and Circumference Union]] | ||
| + | * [[General Ideas]] | ||
| + | * [[Mo's Algorithm]] | ||
| + | * [[Digit DP]] | ||
| + | * [[Template]] | ||
| − | == | + | == String Processing == |
| − | * | + | * [[KMP and Aho-Corasick Automaton]] |
| − | * | + | * [[Suffix array and Suffix Automaton(Suffix Tree)]] |
| + | * [[Manacher and Palindrome Automaton]] | ||
| + | * [[String Hash]] | ||
Latest revision as of 10:13, 26 April 2019
Attention: This library is no longer maintained. It has been moved to here.
Java
Calculation
Data Structures
- Binary-Indexed Tree
- Segment Tree
- Sparse Table
- Heap
- Self-Balanced BST
- Persistence Data Structures
- Link-Cut Tree
- Cartesian Tree
Graph Theory
- Eulerian Path
- Connected Component, 2-SAT
- Spanning Trees
- Bipartite Graph
- Network Flow
- Heavy-light Decomposition
- Maximal Clique
- Perfect Elimination Ordering
- Tree and Graph Isomorphism
Geometry
Linear Algebra
Number Theory
- Multiply, Power and Inverse
- Sieve
- Extended Euclid
- Chinese Remainder Theorem
- Primitive Root
- Quadratic Residue and Discrete Roots
- Discrete Logarithm
- Miller-Rabin
- Pollard's Rho
- Gaussian Elimination
- NTT & FFT
Others
- FastIO
- Modulo
- Date Magic
- Discretization
- Permutation Rank
- Expression Parsing
- Kth Number
- Longest Common Sequence
- Area and Circumference Union
- General Ideas
- Mo's Algorithm
- Digit DP
- Template