{"id":22301921,"url":"https://github.com/d-k-deng/dataprocessing_practice","last_synced_at":"2025-10-14T00:30:19.564Z","repository":{"id":196380192,"uuid":"695988005","full_name":"D-K-Deng/DataProcessing_Practice","owner":"D-K-Deng","description":"The program processes personal records from a file using custom-implemented data structures such as Binary Search Trees (BST), heaps, and hashmaps, with an emphasis on generics and without relying on built-in Java classes like LinkedList and PriorityQueue.","archived":false,"fork":false,"pushed_at":"2023-10-23T13:05:41.000Z","size":62,"stargazers_count":5,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-06T19:51:22.083Z","etag":null,"topics":["data-processing","data-structures","java"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/D-K-Deng.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2023-09-24T20:06:57.000Z","updated_at":"2024-12-03T15:38:20.000Z","dependencies_parsed_at":"2023-09-24T22:52:32.634Z","dependency_job_id":"eee0e10c-216d-4634-be08-a11d001d8e01","html_url":"https://github.com/D-K-Deng/DataProcessing_Practice","commit_stats":null,"previous_names":["d-k-deng/dataprocessing_practice"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/D-K-Deng/DataProcessing_Practice","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/D-K-Deng%2FDataProcessing_Practice","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/D-K-Deng%2FDataProcessing_Practice/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/D-K-Deng%2FDataProcessing_Practice/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/D-K-Deng%2FDataProcessing_Practice/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/D-K-Deng","download_url":"https://codeload.github.com/D-K-Deng/DataProcessing_Practice/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/D-K-Deng%2FDataProcessing_Practice/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279017353,"owners_count":26086052,"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","status":"online","status_checked_at":"2025-10-13T02:00:06.723Z","response_time":61,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["data-processing","data-structures","java"],"created_at":"2024-12-03T18:32:42.410Z","updated_at":"2025-10-14T00:30:19.245Z","avatar_url":"https://github.com/D-K-Deng.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DataProcessing_Practice\nThe program processes personal records from a file using custom-implemented data structures such as Binary Search Trees (BST), heaps, and hashmaps, with an emphasis on generics and without relying on built-in Java classes like LinkedList and PriorityQueue.\n\n**About people.txt**\n\nEach line in the file contains a person’s record as: \ngiven name; family name; company name; address; city; county; state; zip; phone1; phone2; email; \nweb; birthday\nEach field is split by ‘;’.\n\nThis project uses BST, heap, and hashmap and implements multiple functions without using Java built-in classes LinkedList and PriorityQueue. Moreover, **generic** 🤙\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fd-k-deng%2Fdataprocessing_practice","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fd-k-deng%2Fdataprocessing_practice","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fd-k-deng%2Fdataprocessing_practice/lists"}