{"id":26385181,"url":"https://github.com/danwallach/java8lazylist","last_synced_at":"2025-03-17T07:40:19.570Z","repository":{"id":26056142,"uuid":"29499599","full_name":"danwallach/Java8LazyList","owner":"danwallach","description":"implementation of concurrent lazy lists in Java8 plus some code to do concurrent iteration over a lazy tree","archived":false,"fork":false,"pushed_at":"2015-01-19T22:32:30.000Z","size":120,"stargazers_count":1,"open_issues_count":1,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-04-18T14:12:49.616Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/danwallach.png","metadata":{"files":{"readme":"README.txt","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2015-01-19T22:21:46.000Z","updated_at":"2024-04-18T14:12:49.617Z","dependencies_parsed_at":"2022-08-24T14:44:56.072Z","dependency_job_id":null,"html_url":"https://github.com/danwallach/Java8LazyList","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danwallach%2FJava8LazyList","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danwallach%2FJava8LazyList/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danwallach%2FJava8LazyList/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danwallach%2FJava8LazyList/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/danwallach","download_url":"https://codeload.github.com/danwallach/Java8LazyList/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243995684,"owners_count":20380861,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-03-17T07:40:19.057Z","updated_at":"2025-03-17T07:40:19.565Z","avatar_url":"https://github.com/danwallach.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"Simple Java8 example code that demonstrates the use of a lazy list to interate\nover a functional tree. \n\nFTree.java -- a simple, parametric functional tree\n  -- In here, you'll also see example code that builds an \"eager\" stream\n     as well as using a Stack to maintain state while iterating over a\n     tree. These are included for performance comparison purposes, and\n     aren't something you should ever seriously use. On the other hand,\n     the visitor pattern (i.e., the inorder() method) runs faster than\n     any stream variant.\n\nEmptyFTree.java -- an \"empty\" leaf node that we use instead of null\nITree.java -- the interface that a tree node has to implement\nLazyList.java -- functional lazy lists, including support for parallel streams\nMain.java -- test code that can drive all of the above and show you performance comparisons\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdanwallach%2Fjava8lazylist","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdanwallach%2Fjava8lazylist","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdanwallach%2Fjava8lazylist/lists"}