FlexiList is a Java data structure that combines the benefits of array
...->Good Memory Locality: FlexiList nodes are stored in a contiguous block of memory, making it more cache-friendly than arrays.
->Faster Insertion and Deletion: FlexiList can insert or delete nodes at any position in the list in O(1) time, whereas ArrayList requires shifting all elements after the insertion or deletion point.
This project it's a Java Lib to read some html (a File or a URL) and get a table into that. This returns a ArrayList with the information inside this HTML table. To find the table you need to say a String index to find this table.