- Queries
- All Atoms
- Search
- Advanced Search
Diviner All Atoms
All Atoms
All Atoms
- Called when the iterator needs a page of results. You should load the next result page and update your internal cursor to point past it.
- Method
- Called when @{method:rewind} is invoked. You should reset any internal cursor your implementation holds.
- Method
- Example implementation and test case for @{class:PhutilBufferedIterator}.
- Class
- Method
- Method
- Method
- Method
- Array-like object with a default value that is populated when nonexistent keys are accessed. This is particularly useful to avoid constructs like this:
- Class
- Method
- Method
- Method
- Class
- This allows you to sort a list of sort vectors using @{function:msortv}.
- Method
- Method
- Method
- Method
- Truncate a UTF-8 string to a some maximum number of bytes, codepoints, or glyphs.
- Class
- Method
- Method
- Method
- Method
- Method
- Method
- Models a directed graph in a generic way that works well with graphs stored in a database, and allows you to perform operations like cycle detection.
- Class
- Internal cycle detection implementation. Recursively walks the graph, keeping track of where it's been, and returns the first cycle it finds.
- Method
- Detect if there are any cycles reachable from a given node.
- Method
- Load the graph, building it out so operations can be performed on it. This constructs the graph level-by-level, calling @{method:loadEdges} to expand the graph at each stage until it is complete.
- Method
- Get the nodes in topological order, or some roughly similar order if the graph contains cycles.
- Method
- Get the nodes in topological order.
- Method
- Method
- Seed the graph with known nodes. Often, you will provide the candidate edges that a user is trying to create here, or the initial set of edges you know about.
- Method
- Load the edges for a list of nodes. You must override this method. You will be passed a list of nodes, and should return a dictionary mapping each node to the list of nodes that can be reached by following its the edges which originate at it: for example, the child nodes of an object which has a parent-child relationship to other objects.
- Method
- Abstract base class for implementing objects that behave like arrays. This class wraps a basic array and provides trivial implementations for `Countable`, `ArrayAccess` and `Iterator`, so subclasses need only implement specializations.
- Class
- Method
- Method
- Method
- Method
- Method
- Method
- Method
- Method
- Method
- Method
- Method
- Method
- Method
- Method
- Method
- This is an iterator version of `array_chunk()`.
- Class
- Method
- Method
- Method
- Method
- Method
- Method
- Function
- Parse a human-readable byte description (like "6MB") into an integer.
- Function
- Format a byte count for human consumption, e.g. "10MB" instead of "10485760".
- Function
- Format a relative time (duration) into weeks, days, hours, minutes, seconds, but unlike phabricator_format_relative_time, does so for more than just the largest unit.
- Function
- Function
- Function
- Parser and renderer for ".cow" files used by the `cowsay` program.
- Class
- Method
- Method
- Method
- Method
- Method
- Method
- Method
- Class
- Method
- Method
- Method
- Method
- Method
- Method
- Method
- Method
- Class
- Method
- Method
- Method
- Method
- Method
- Method
- NOTE: This class has the same purpose as `CallbackFilterIterator` in PHP 5.4.
- Class
Content licensed under Creative Commons Attribution-ShareAlike 4.0 (CC-BY-SA) unless otherwise noted; code licensed under Apache 2.0 or other open source licenses. · CC BY-SA 4.0 · Apache 2.0