{"id":28154965,"url":"https://github.com/gmega/sparmap","last_synced_at":"2025-05-15T06:15:36.565Z","repository":{"id":19961940,"uuid":"23228852","full_name":"gmega/sparmap","owner":"gmega","description":"Simple implementation of parallel map for Python. ","archived":false,"fork":false,"pushed_at":"2015-07-09T12:18:29.000Z","size":216,"stargazers_count":4,"open_issues_count":1,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-05-08T21:58:04.411Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/gmega.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.txt","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2014-08-22T14:51:12.000Z","updated_at":"2016-08-29T17:00:05.000Z","dependencies_parsed_at":"2022-08-27T04:00:29.673Z","dependency_job_id":null,"html_url":"https://github.com/gmega/sparmap","commit_stats":null,"previous_names":[],"tags_count":3,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmega%2Fsparmap","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmega%2Fsparmap/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmega%2Fsparmap/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmega%2Fsparmap/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/gmega","download_url":"https://codeload.github.com/gmega/sparmap/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254283214,"owners_count":22045145,"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-05-15T06:15:17.905Z","updated_at":"2025-05-15T06:15:36.492Z","avatar_url":"https://github.com/gmega.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"sparmap [![Build Status](https://travis-ci.org/gmega/sparmap.svg)](https://travis-ci.org/gmega/parmap)\n======\n\nA **S**imple **PAR**allel **MAP** implementation for Python based on the\nmultiprocessing package. \n\nUsage\n-----\nAs an example, to sum 1 to all elements in the array `[1, 2, 3, 4, 5]` using two processes in parallel, \nand printing the output on the terminal, you'd write:\n\n```python\nfrom sparmap import parmap\n\nfor result in parmap([1, 2, 3, 4, 5], fun=lambda x: x + 1, workers=2):\n    print result\n```\n\nStreaming\n---------\n*sparmap* uses a bounded queue internally, and streams results immediately as they \nbecome available. This means that in a situation like:\n\n```python\nfor result in parmap(very_long_list, fun=expensive_computation, workers=8):\n    print result\n```\n\nyou will start seeing results as soon as the first computation inside any of the \nworkers completes, without having to worry about running out of memory (unless you\nhave really big records in the input list, or returned as output from your map \nfunction).\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgmega%2Fsparmap","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgmega%2Fsparmap","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgmega%2Fsparmap/lists"}