Search Results for "block"
Sort By:
Showing 2 open source projects for "block"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Stop Storing Third-Party Tokens in Your DatabaseRolling your own OAuth token storage can be a security liability. Token Vault securely stores access and refresh tokens from federated providers and handles exchange and renewal automatically. Connected accounts, refresh exchange, and privileged worker flows included.
-
1
FlexiList.
FlexiList is a Java data structure that combines the benefits of array
...->Dynamic Size: FlexiList can grow or shrink dynamically as elements are added or removed, whereas arrays have a fixed size. ->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. -
2
Lnkdlst
Single sided linked list (kind of lib with test-code, C, C++ and java)
Use own (user) data section for each Linked-List-Element (LLEl) including a fix Identifier which is for search via basic Lnkdlst function (fast ID-part-search, e.g. to find all elements with a specific bit in the ID set). Main list-linkage-change functions: append, insert, delete. - Examples: use of flexible variable ArgList (OnePointerArg, optional valid if not NULL, Argument-Type by ID-Number is easy to get), key-value pairs, build FIFO{queue}/LIFO{stack}, auto-list with max....
- Previous
- You're on page 1
- Next
