This is Java library for working with overlapping trees both as with plain memory and as with hierarchical structure, with quick access to any levels and branches of tree (<page><...><section><line><word>tooLongWordForCurrentLi</line></page><page><line>neAndSectionTwoPages</word></line></section><...></page> (incorrect in classic XML)). There supported the cross-references (from="@leftPanel#template" target="$template"); cursors;copying and removing of parts; functionality to index and search data; convenient factory of dynamic generation of values and parts of data; simple variables and any objects as values and as unnamed data for manipulating. Every object of this container is an child of any numbers of trees and has dynamic address.
The utility is not demanding to resources, requires no extraneous libraries and can be deployed in a small memory. It can run on mobile devices. Do not use linear algorithms, the speed is only slightly dependent on the size of data.

Project Activity

See All Activity >

Follow OverlappingTreesPlainMap

OverlappingTreesPlainMap Web Site

Other Useful Business Software
Resolve Support Tickets 2x Faster​ with ServoDesk Icon
Resolve Support Tickets 2x Faster​ with ServoDesk

Full access to Enterprise features. No credit card required.

What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
Try ServoDesk for free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of OverlappingTreesPlainMap!

Additional Project Details

Programming Language

Java

Related Categories

Java Algorithms, Java Interpreters, Java Libraries

Registered

2017-01-17