persistent | Generic implementations of fast persistent

by LeoWoerteler Java Version: Current License: No License

X-Ray Key Features Code Snippets Community Discussions Vulnerabilities Install Support

kandi X-RAY | persistent Summary

persistent is a Java library. persistent has no bugs, it has no vulnerabilities, it has build file available and it has low support. You can download it from GitHub.

Generic implementations of fast persistent (functional) data structures in Java

Support

Quality

Security

License

Reuse

Support

persistent has a low active ecosystem.

It has 2 star(s) with 1 fork(s). There are 1 watchers for this library.

It had no major release in the last 6 months.

persistent has no issues reported. There are 1 open pull requests and 0 closed requests.

It has a neutral sentiment in the developer community.

The latest version of persistent is current.

Quality

persistent has no bugs reported.

Security

persistent has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.

License

persistent does not have a standard license declared.

Check the repository for any license declaration and review the terms closely.

Without a license, all rights are reserved, and you cannot use the library in your applications.

Reuse

persistent releases are not available. You will need to build from source code and install.

Build file is available. You can build the component from source.

Top functions reviewed by kandi - BETA

kandi has reviewed persistent and discovered the below as its top functions. This is intended to give you an instant insight into persistent implemented functionality, and help decide if they suit your requirements.

Prints the tree structure
Writes the given object to the given StringBuilder with indentation
Prints this tree into a StringBuilder
Appends this node to the given StringBuilder
Concatenates two trees
Add all nodes to the tree
Returns a slice of this subtree
Returns the next element
Initializes the iterator
Get a sub - region of this sub - tree
Return a new IntArray that contains the smallest digits
Removes the given element
Inserts a node at the specified index
Append the given sequence to this sequence
Append this node to the specified position
Insert the value at the given position in the list
Initialize the tree
Returns a portion of this IntArray
Splits a tree rooted at left and right
Inserts an element into the left digit
Returns a copy of the children with the specified position
Returns the previous element
Append this node to the end of the tree
Returns a list iterator over the items starting at a given position
Append the sub - tree at the given position
Append the children at the given position

Get all kandi verified functions for this library.

persistent Key Features

No Key Features are available at this moment for persistent.

persistent Examples and Code Snippets

No Code Snippets are available at this moment for persistent.

Community Discussions

No Community Discussions are available at this moment for persistent.Refer to stack overflow page for discussions.

Community Discussions, Code Snippets contain sources that include Stack Exchange Network

Vulnerabilities

No vulnerabilities reported

Install persistent

You can download it from GitHub.
You can use persistent like any standard Java library. Please include the the jar files in your classpath. You can also use any IDE and you can run and debug the persistent component as you would do with any other Java program. Best practice is to use a build tool that supports dependency management such as Maven or Gradle. For Maven installation, please refer maven.apache.org. For Gradle installation, please refer gradle.org .

Support

For any new features, suggestions and bugs create an issue on GitHub. If you have any questions check and ask questions on community page Stack Overflow .

Find more information at: