| Name | forbiditerative JSON |
| Version |
1.1.3
JSON |
| download |
| home_page | None |
| Summary | Forbid-Iterative (FI) Planner is an Automated PDDL based planner that includes planners for top-k, top-quality, and diverse computational tasks. |
| upload_time | 2024-07-18 15:47:47 |
| maintainer | None |
| docs_url | None |
| author | None |
| requires_python | >=3.8 |
| license | Forbid-Iterative (FI) Planner is an Automated PDDL based planner that includes planners for top-k, top-quality, and diverse computational tasks. Copyright (C) 2019 Michael Katz, IBM Research, USA. This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see <https://www.gnu.org/licenses/>. |
| keywords |
planning
|
| VCS |
 |
| bugtrack_url |
|
| requirements |
No requirements were recorded.
|
| Travis-CI |
No Travis.
|
| coveralls test coverage |
No coveralls.
|
# Forbid-Iterative (FI) Planner is an Automated PDDL based planner that includes planners for top-k, top-quality, and diverse computational tasks.
## The codebase consists of multiple planners, for multiple computational problems, roughly divided into three categories:
1. Top-k planning
2. Top-quality planning
2.1. Top-quality planning
2.2. Unordered top-quality planning
2.3. Sub(multi)set top-quality planning
3. Diverse planning
3.1. Satisficing/Agile diverse planning
## The planners are based on the idea of obtaining multiple solutions by iteratively reformulating planning tasks to restrict the set of valid plans, forbidding previously found ones. Thus, the planners can be referred to as FI-top-k, FI-top-quality, FI-unordered-top-quality, FI-diverse-agl.
## The codebase also includes multiple useful utilities:
1. Getting the landmarks of a planning problem
2. Constructing a graph from plans
3. Constructing graph representations of a planning task
3.1 Problem Description Graph (PDG)
3.2 Abstract Structure Graph (ASG)
# Installation
```
pip install forbiditerative
```
# Running
```python
from forbiditerative import planners
from pathlib import Path
domain_file = Path("your/path/domain.pddl")
problem_file = Path("your/path/problem.pddl")
# Example: FI-unordered-top-quality
plans = planners.plan_unordered_topq(domain_file=domain_file, problem_file=problem_file, quality_bound=1.0, number_of_plans_bound=100, timeout=20)
print(plans)
# Example: FI-submultisets-top-quality
plans = planners.plan_submultisets_topq(domain_file=domain_file, problem_file=problem_file, quality_bound=1.0, number_of_plans_bound=None)
print(plans)
# Example: FI-subsets-top-quality
plans = planners.plan_subsets_topq(domain_file=domain_file, problem_file=problem_file, quality_bound=1.0, number_of_plans_bound=None)
print(plans)
# Example: FI-topk
plans = planners.plan_topk(domain_file=domain_file, problem_file=problem_file, number_of_plans_bound=100)
print(plans)
# Example: FI-diverse-agl
plans = planners.plan_diverse_agl(domain_file=domain_file, problem_file=problem_file, number_of_plans_bound=100)
print(plans)
# Example: getting landmarks (default method 'rhw')
landmarks = planners.get_landmarks(domain_file=domain_file, problem_file=problem_file)
print(landmarks)
# Example: getting exhaustive landmarks (https://www.fast-downward.org/Doc/LandmarkFactory)
landmarks = planners.get_landmarks(domain_file=domain_file, problem_file=problem_file, method = 'exhaust')
print(landmarks)
# Example: create a dot graph out of plans
import graphviz
dot_txt = planners.get_dot(domain_file=domain_file, problem_file=problem_file, plans = plans)
src = graphviz.Source(dot_txt)
src.render('plans.gv', view=True)
# Example: get a problem description graph (PDG) in dot format
import graphviz
dot_txt = planners.get_PDG(domain_file=domain_file, problem_file=problem_file)
src = graphviz.Source(dot_txt)
src.render('PDG.gv', view=True)
# Example: get an abstract structure graph (ASG) in dot format
import graphviz
dot_txt = planners.get_ASG(domain_file=domain_file, problem_file=problem_file)
src = graphviz.Source(dot_txt)
src.render('ASG.gv', view=True)
```
## Citing
### Top-k planning
```
@InProceedings{katz-et-al-icaps2018,
title = "A Novel Iterative Approach to Top-k Planning",
author = "Michael Katz and Shirin Sohrabi and Octavian Udrea and Dominik Winterer",
booktitle = "Proceedings of the Twenty-Eighth International Conference on
Automated Planning and Scheduling (ICAPS 2018)",
publisher = "{AAAI} Press",
pages = "132--140",
year = "2018"
}
```
### Top-quality planning
```
@InProceedings{katz-et-al-aaai2020,
author = "Michael Katz and Shirin Sohrabi and Octavian Udrea",
title = "Top-Quality Planning: Finding Practically Useful Sets of Best Plans",
booktitle = "Proceedings of the Thirty-Fourth {AAAI} Conference on
Artificial Intelligence ({AAAI} 2020)",
publisher = "{AAAI} Press",
pages = "9900--9907",
year = "2020"
}
@InProceedings{katz-sohrabi-icaps2022,
author = "Michael Katz and Shirin Sohrabi",
title = "Who Needs These Operators Anyway: Top Quality Planning with Operator Subset Criteria",
booktitle = "Proceedings of the Thirty-Second International Conference on
Automated Planning and Scheduling (ICAPS 2022)",
publisher = "{AAAI} Press",
year = "2022"
}
```
### Diverse planning
```
@InProceedings{katz-sohrabi-aaai2020,
title = "Reshaping diverse planning",
author = "Michael Katz and Shirin Sohrabi",
booktitle = "Proceedings of the Thirty-Fourth {AAAI} Conference on
Artificial Intelligence ({AAAI} 2020)",
publisher = "{AAAI} Press",
pages = "9892--9899",
year = "2020"
}
```
### PDG (this modified version, for original see Pochter et al AAAI 2011)
```
@InProceedings{shleyfman-et-al-aaai2015,
title = "Heuristics and Symmetries in Classical Planning",
author = "Alexander Shleyfman and Michael Katz and Malte Helmert and Silvan Sievers and Martin Wehrle",
booktitle = "Proceedings of the Twenty-Ninth {AAAI} Conference on
Artificial Intelligence ({AAAI} 2015)",
publisher = "{AAAI} Press",
pages = "3371--3377",
year = "2015"
}
```
### ASG
```
@InProceedings{sievers-et-al-icaps2019,
title = "Theoretical Foundations for Structural Symmetries of Lifted {PDDL} Tasks",
author = "Silvan Sievers and Gabriele R{\"o}ger and Martin Wehrle and Michael Katz",
booktitle = "Proceedings of the Twenty-Ninth International Conference on
Automated Planning and Scheduling (ICAPS 2019)",
publisher = "{AAAI} Press",
pages = "446--454",
year = "2019"
}
```
## Licensing
Forbid-Iterative (FI) Planner is an Automated PDDL based planner that
includes planners for top-k, top-quality, and diverse computational
tasks. Copyright (C) 2019 Michael Katz, IBM Research, USA.
The code extends the Fast Downward planning system. The license for the
extension is specified in the LICENSE file.
## Fast Downward
<img src="misc/images/fast-downward.svg" width="800" alt="Fast Downward">
Fast Downward is a domain-independent classical planning system.
Copyright 2003-2022 Fast Downward contributors (see below).
For further information:
- Fast Downward website: <https://www.fast-downward.org>
- Report a bug or file an issue: <https://issues.fast-downward.org>
- Fast Downward mailing list: <https://groups.google.com/forum/#!forum/fast-downward>
- Fast Downward main repository: <https://github.com/aibasel/downward>
## Tested software versions
This version of Fast Downward has been tested with the following software versions:
| OS | Python | C++ compiler | CMake |
| ------------ | ------ | ---------------------------------------------------------------- | ----- |
| Ubuntu 20.04 | 3.8 | GCC 9, GCC 10, Clang 10, Clang 11 | 3.16 |
| Ubuntu 18.04 | 3.6 | GCC 7, Clang 6 | 3.10 |
| macOS 10.15 | 3.6 | AppleClang 12 | 3.19 |
| Windows 10 | 3.6 | Visual Studio Enterprise 2017 (MSVC 19.16) and 2019 (MSVC 19.28) | 3.19 |
We test LP support with CPLEX 12.9, SoPlex 3.1.1 and Osi 0.107.9.
On Ubuntu, we test both CPLEX and SoPlex. On Windows, we currently
only test CPLEX, and on macOS, we do not test LP solvers (yet).
## Contributors
The following list includes all people that actively contributed to
Fast Downward, i.e. all people that appear in some commits in Fast
Downward's history (see below for a history on how Fast Downward
emerged) or people that influenced the development of such commits.
Currently, this list is sorted by the last year the person has been
active, and in case of ties, by the earliest year the person started
contributing, and finally by last name.
- 2003-2022 Malte Helmert
- 2008-2016, 2018-2022 Gabriele Roeger
- 2010-2022 Jendrik Seipp
- 2010-2011, 2013-2022 Silvan Sievers
- 2012-2022 Florian Pommerening
- 2013, 2015-2022 Salomé Eriksson
- 2018-2022 Patrick Ferber
- 2021-2022 Clemens Büchner
- 2021-2022 Dominik Drexler
- 2022 Remo Christen
- 2015, 2021 Thomas Keller
- 2016-2020 Cedric Geissmann
- 2017-2020 Guillem Francès
- 2018-2020 Augusto B. Corrêa
- 2020 Rik de Graaff
- 2015-2019 Manuel Heusner
- 2017 Daniel Killenberger
- 2016 Yusra Alkhazraji
- 2016 Martin Wehrle
- 2014-2015 Patrick von Reth
- 2009-2014 Erez Karpas
- 2014 Robert P. Goldman
- 2010-2012 Andrew Coles
- 2010, 2012 Patrik Haslum
- 2003-2011 Silvia Richter
- 2009-2011 Emil Keyder
- 2010-2011 Moritz Gronbach
- 2010-2011 Manuela Ortlieb
- 2011 Vidal Alcázar Saiz
- 2011 Michael Katz
- 2011 Raz Nissim
- 2010 Moritz Goebelbecker
- 2007-2009 Matthias Westphal
- 2009 Christian Muise
## History
The current version of Fast Downward is the merger of three different
projects:
- the original version of Fast Downward developed by Malte Helmert
and Silvia Richter
- LAMA, developed by Silvia Richter and Matthias Westphal based on
the original Fast Downward
- FD-Tech, a modified version of Fast Downward developed by Erez
Karpas and Michael Katz based on the original code
In addition to these three main sources, the codebase incorporates
code and features from numerous branches of the Fast Downward codebase
developed for various research papers. The main contributors to these
branches are Malte Helmert, Gabi Röger and Silvia Richter.
## License
The following directory is not part of Fast Downward as covered by
this license:
- ./src/search/ext
For the rest, the following license applies:
```
Fast Downward is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or (at
your option) any later version.
Fast Downward is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
```
Raw data
{
"_id": null,
"home_page": null,
"name": "forbiditerative",
"maintainer": null,
"docs_url": null,
"requires_python": ">=3.8",
"maintainer_email": null,
"keywords": "planning",
"author": null,
"author_email": "Michael Katz <michael.katz1@ibm.com>",
"download_url": null,
"platform": null,
"description": "# Forbid-Iterative (FI) Planner is an Automated PDDL based planner that includes planners for top-k, top-quality, and diverse computational tasks.\n\n## The codebase consists of multiple planners, for multiple computational problems, roughly divided into three categories:\n\n1. Top-k planning\n2. Top-quality planning \n 2.1. Top-quality planning \n 2.2. Unordered top-quality planning \n 2.3. Sub(multi)set top-quality planning \n3. Diverse planning \n 3.1. Satisficing/Agile diverse planning \n\n## The planners are based on the idea of obtaining multiple solutions by iteratively reformulating planning tasks to restrict the set of valid plans, forbidding previously found ones. Thus, the planners can be referred to as FI-top-k, FI-top-quality, FI-unordered-top-quality, FI-diverse-agl.\n\n## The codebase also includes multiple useful utilities:\n1. Getting the landmarks of a planning problem\n2. Constructing a graph from plans\n3. Constructing graph representations of a planning task\n 3.1 Problem Description Graph (PDG)\n 3.2 Abstract Structure Graph (ASG)\n\n# Installation\n```\npip install forbiditerative \n```\n\n# Running\n```python\n\nfrom forbiditerative import planners\nfrom pathlib import Path\n\ndomain_file = Path(\"your/path/domain.pddl\")\nproblem_file = Path(\"your/path/problem.pddl\")\n\n# Example: FI-unordered-top-quality\nplans = planners.plan_unordered_topq(domain_file=domain_file, problem_file=problem_file, quality_bound=1.0, number_of_plans_bound=100, timeout=20)\nprint(plans)\n\n# Example: FI-submultisets-top-quality\nplans = planners.plan_submultisets_topq(domain_file=domain_file, problem_file=problem_file, quality_bound=1.0, number_of_plans_bound=None)\nprint(plans)\n\n# Example: FI-subsets-top-quality\nplans = planners.plan_subsets_topq(domain_file=domain_file, problem_file=problem_file, quality_bound=1.0, number_of_plans_bound=None)\nprint(plans)\n\n# Example: FI-topk\nplans = planners.plan_topk(domain_file=domain_file, problem_file=problem_file, number_of_plans_bound=100)\nprint(plans)\n\n# Example: FI-diverse-agl\nplans = planners.plan_diverse_agl(domain_file=domain_file, problem_file=problem_file, number_of_plans_bound=100)\nprint(plans)\n\n# Example: getting landmarks (default method 'rhw')\nlandmarks = planners.get_landmarks(domain_file=domain_file, problem_file=problem_file)\nprint(landmarks)\n\n# Example: getting exhaustive landmarks (https://www.fast-downward.org/Doc/LandmarkFactory) \nlandmarks = planners.get_landmarks(domain_file=domain_file, problem_file=problem_file, method = 'exhaust')\nprint(landmarks)\n\n# Example: create a dot graph out of plans\nimport graphviz\ndot_txt = planners.get_dot(domain_file=domain_file, problem_file=problem_file, plans = plans)\nsrc = graphviz.Source(dot_txt)\nsrc.render('plans.gv', view=True)\n\n# Example: get a problem description graph (PDG) in dot format\nimport graphviz\ndot_txt = planners.get_PDG(domain_file=domain_file, problem_file=problem_file)\nsrc = graphviz.Source(dot_txt)\nsrc.render('PDG.gv', view=True)\n\n# Example: get an abstract structure graph (ASG) in dot format\nimport graphviz\ndot_txt = planners.get_ASG(domain_file=domain_file, problem_file=problem_file)\nsrc = graphviz.Source(dot_txt)\nsrc.render('ASG.gv', view=True)\n\n```\n\n\n\n## Citing\n\n### Top-k planning\n```\n@InProceedings{katz-et-al-icaps2018,\n title = \"A Novel Iterative Approach to Top-k Planning\",\n author = \"Michael Katz and Shirin Sohrabi and Octavian Udrea and Dominik Winterer\",\n booktitle = \"Proceedings of the Twenty-Eighth International Conference on\n Automated Planning and Scheduling (ICAPS 2018)\",\n publisher = \"{AAAI} Press\",\n pages = \"132--140\",\n year = \"2018\"\n}\n```\n\n### Top-quality planning\n```\n@InProceedings{katz-et-al-aaai2020,\n author = \"Michael Katz and Shirin Sohrabi and Octavian Udrea\",\n title = \"Top-Quality Planning: Finding Practically Useful Sets of Best Plans\",\n booktitle = \"Proceedings of the Thirty-Fourth {AAAI} Conference on\n Artificial Intelligence ({AAAI} 2020)\",\n publisher = \"{AAAI} Press\",\n pages = \"9900--9907\",\n year = \"2020\"\n}\n\n@InProceedings{katz-sohrabi-icaps2022,\n author = \"Michael Katz and Shirin Sohrabi\",\n title = \"Who Needs These Operators Anyway: Top Quality Planning with Operator Subset Criteria\",\n booktitle = \"Proceedings of the Thirty-Second International Conference on\n Automated Planning and Scheduling (ICAPS 2022)\",\n publisher = \"{AAAI} Press\",\n year = \"2022\"\n}\n```\n\n### Diverse planning\n```\n@InProceedings{katz-sohrabi-aaai2020,\n title = \"Reshaping diverse planning\",\n author = \"Michael Katz and Shirin Sohrabi\",\n booktitle = \"Proceedings of the Thirty-Fourth {AAAI} Conference on\n Artificial Intelligence ({AAAI} 2020)\",\n publisher = \"{AAAI} Press\",\n pages = \"9892--9899\",\n year = \"2020\"\n}\n```\n\n### PDG (this modified version, for original see Pochter et al AAAI 2011)\n```\n@InProceedings{shleyfman-et-al-aaai2015,\n title = \"Heuristics and Symmetries in Classical Planning\",\n author = \"Alexander Shleyfman and Michael Katz and Malte Helmert and Silvan Sievers and Martin Wehrle\",\n booktitle = \"Proceedings of the Twenty-Ninth {AAAI} Conference on\n Artificial Intelligence ({AAAI} 2015)\",\n publisher = \"{AAAI} Press\",\n pages = \"3371--3377\",\n year = \"2015\"\n}\n```\n\n### ASG\n```\n@InProceedings{sievers-et-al-icaps2019,\n title = \"Theoretical Foundations for Structural Symmetries of Lifted {PDDL} Tasks\",\n author = \"Silvan Sievers and Gabriele R{\\\"o}ger and Martin Wehrle and Michael Katz\",\n booktitle = \"Proceedings of the Twenty-Ninth International Conference on\n Automated Planning and Scheduling (ICAPS 2019)\",\n publisher = \"{AAAI} Press\",\n pages = \"446--454\",\n year = \"2019\"\n}\n```\n\n\n## Licensing\n\nForbid-Iterative (FI) Planner is an Automated PDDL based planner that\nincludes planners for top-k, top-quality, and diverse computational\ntasks. Copyright (C) 2019 Michael Katz, IBM Research, USA.\nThe code extends the Fast Downward planning system. The license for the\nextension is specified in the LICENSE file.\n\n## Fast Downward\n<img src=\"misc/images/fast-downward.svg\" width=\"800\" alt=\"Fast Downward\">\n\nFast Downward is a domain-independent classical planning system.\n\nCopyright 2003-2022 Fast Downward contributors (see below).\n\nFor further information:\n- Fast Downward website: <https://www.fast-downward.org>\n- Report a bug or file an issue: <https://issues.fast-downward.org>\n- Fast Downward mailing list: <https://groups.google.com/forum/#!forum/fast-downward>\n- Fast Downward main repository: <https://github.com/aibasel/downward>\n\n\n## Tested software versions\n\nThis version of Fast Downward has been tested with the following software versions:\n\n| OS | Python | C++ compiler | CMake |\n| ------------ | ------ | ---------------------------------------------------------------- | ----- |\n| Ubuntu 20.04 | 3.8 | GCC 9, GCC 10, Clang 10, Clang 11 | 3.16 |\n| Ubuntu 18.04 | 3.6 | GCC 7, Clang 6 | 3.10 |\n| macOS 10.15 | 3.6 | AppleClang 12 | 3.19 |\n| Windows 10 | 3.6 | Visual Studio Enterprise 2017 (MSVC 19.16) and 2019 (MSVC 19.28) | 3.19 |\n\nWe test LP support with CPLEX 12.9, SoPlex 3.1.1 and Osi 0.107.9.\nOn Ubuntu, we test both CPLEX and SoPlex. On Windows, we currently\nonly test CPLEX, and on macOS, we do not test LP solvers (yet).\n\n\n## Contributors\n\nThe following list includes all people that actively contributed to\nFast Downward, i.e. all people that appear in some commits in Fast\nDownward's history (see below for a history on how Fast Downward\nemerged) or people that influenced the development of such commits.\nCurrently, this list is sorted by the last year the person has been\nactive, and in case of ties, by the earliest year the person started\ncontributing, and finally by last name.\n\n- 2003-2022 Malte Helmert\n- 2008-2016, 2018-2022 Gabriele Roeger\n- 2010-2022 Jendrik Seipp\n- 2010-2011, 2013-2022 Silvan Sievers\n- 2012-2022 Florian Pommerening\n- 2013, 2015-2022 Salom\u00e9 Eriksson\n- 2018-2022 Patrick Ferber\n- 2021-2022 Clemens B\u00fcchner\n- 2021-2022 Dominik Drexler\n- 2022 Remo Christen\n- 2015, 2021 Thomas Keller\n- 2016-2020 Cedric Geissmann\n- 2017-2020 Guillem Franc\u00e8s\n- 2018-2020 Augusto B. Corr\u00eaa\n- 2020 Rik de Graaff\n- 2015-2019 Manuel Heusner\n- 2017 Daniel Killenberger\n- 2016 Yusra Alkhazraji\n- 2016 Martin Wehrle\n- 2014-2015 Patrick von Reth\n- 2009-2014 Erez Karpas\n- 2014 Robert P. Goldman\n- 2010-2012 Andrew Coles\n- 2010, 2012 Patrik Haslum\n- 2003-2011 Silvia Richter\n- 2009-2011 Emil Keyder\n- 2010-2011 Moritz Gronbach\n- 2010-2011 Manuela Ortlieb\n- 2011 Vidal Alc\u00e1zar Saiz\n- 2011 Michael Katz\n- 2011 Raz Nissim\n- 2010 Moritz Goebelbecker\n- 2007-2009 Matthias Westphal\n- 2009 Christian Muise\n\n\n## History\n\nThe current version of Fast Downward is the merger of three different\nprojects:\n\n- the original version of Fast Downward developed by Malte Helmert\n and Silvia Richter\n- LAMA, developed by Silvia Richter and Matthias Westphal based on\n the original Fast Downward\n- FD-Tech, a modified version of Fast Downward developed by Erez\n Karpas and Michael Katz based on the original code\n\nIn addition to these three main sources, the codebase incorporates\ncode and features from numerous branches of the Fast Downward codebase\ndeveloped for various research papers. The main contributors to these\nbranches are Malte Helmert, Gabi R\u00f6ger and Silvia Richter.\n\n\n## License\n\nThe following directory is not part of Fast Downward as covered by\nthis license:\n\n- ./src/search/ext\n\nFor the rest, the following license applies:\n\n```\nFast Downward is free software: you can redistribute it and/or modify\nit under the terms of the GNU General Public License as published by\nthe Free Software Foundation, either version 3 of the License, or (at\nyour option) any later version.\n\nFast Downward is distributed in the hope that it will be useful, but\nWITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\nGeneral Public License for more details.\n\nYou should have received a copy of the GNU General Public License\nalong with this program. If not, see <https://www.gnu.org/licenses/>.\n```\n",
"bugtrack_url": null,
"license": "Forbid-Iterative (FI) Planner is an Automated PDDL based planner that includes planners for top-k, top-quality, and diverse computational tasks. Copyright (C) 2019 Michael Katz, IBM Research, USA. This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see <https://www.gnu.org/licenses/>.",
"summary": "Forbid-Iterative (FI) Planner is an Automated PDDL based planner that includes planners for top-k, top-quality, and diverse computational tasks.",
"version": "1.1.3",
"project_urls": {
"Homepage": "https://github.com/IBM/forbiditerative"
},
"split_keywords": [
"planning"
],
"urls": [
{
"comment_text": "",
"digests": {
"blake2b_256": "1a666d9c265bd4d9f08ad6bcc7450697fbaaa19d6e5e70499580e53f14ed895e",
"md5": "189fec08986662b98e22a94f4c2049ae",
"sha256": "600ebe5648a9c04bd800e8c80eddd143808a765be1f446fd50e2f95b071f638d"
},
"downloads": -1,
"filename": "forbiditerative-1.1.3-cp310-cp310-manylinux_2_17_x86_64.manylinux2014_x86_64.whl",
"has_sig": false,
"md5_digest": "189fec08986662b98e22a94f4c2049ae",
"packagetype": "bdist_wheel",
"python_version": "cp310",
"requires_python": ">=3.8",
"size": 64825103,
"upload_time": "2024-07-18T15:47:47",
"upload_time_iso_8601": "2024-07-18T15:47:47.003736Z",
"url": "https://files.pythonhosted.org/packages/1a/66/6d9c265bd4d9f08ad6bcc7450697fbaaa19d6e5e70499580e53f14ed895e/forbiditerative-1.1.3-cp310-cp310-manylinux_2_17_x86_64.manylinux2014_x86_64.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "96932c9e752624a1dac31cdfb6557bc2f282a0ab2c563a834fdf96246bff5d1c",
"md5": "b8887295dffa3dfe66682eb1b7295d1d",
"sha256": "ead3fc79b6d281014cbe9f8b56c2ca505ddf1ad8798c80072738e95febee1eb5"
},
"downloads": -1,
"filename": "forbiditerative-1.1.3-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl",
"has_sig": false,
"md5_digest": "b8887295dffa3dfe66682eb1b7295d1d",
"packagetype": "bdist_wheel",
"python_version": "cp311",
"requires_python": ">=3.8",
"size": 64826254,
"upload_time": "2024-07-18T15:47:48",
"upload_time_iso_8601": "2024-07-18T15:47:48.517698Z",
"url": "https://files.pythonhosted.org/packages/96/93/2c9e752624a1dac31cdfb6557bc2f282a0ab2c563a834fdf96246bff5d1c/forbiditerative-1.1.3-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "efffd65739416126561ced9cc181db9fbd6cb19e40386a2c77ddb6cf2d02de94",
"md5": "a46bf7fbe3eed5efa3fc631a9f225a64",
"sha256": "9bd4bdd26bf2a7e08ff811b87ba165d989e5cd5cffda22673e09e8d2715dea51"
},
"downloads": -1,
"filename": "forbiditerative-1.1.3-cp312-cp312-manylinux_2_17_x86_64.manylinux2014_x86_64.whl",
"has_sig": false,
"md5_digest": "a46bf7fbe3eed5efa3fc631a9f225a64",
"packagetype": "bdist_wheel",
"python_version": "cp312",
"requires_python": ">=3.8",
"size": 64826140,
"upload_time": "2024-07-18T15:47:53",
"upload_time_iso_8601": "2024-07-18T15:47:53.448743Z",
"url": "https://files.pythonhosted.org/packages/ef/ff/d65739416126561ced9cc181db9fbd6cb19e40386a2c77ddb6cf2d02de94/forbiditerative-1.1.3-cp312-cp312-manylinux_2_17_x86_64.manylinux2014_x86_64.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "4978758665ad00de48997815fce48b0174e2b30d5c4f27d4567c9f3d3776e9d9",
"md5": "fc8e15c0a4086d19668224ed97318829",
"sha256": "da88533334687825a034b56803cd8323e0881dba8122c61dcab44d513ec8f11d"
},
"downloads": -1,
"filename": "forbiditerative-1.1.3-cp38-cp38-manylinux_2_17_x86_64.manylinux2014_x86_64.whl",
"has_sig": false,
"md5_digest": "fc8e15c0a4086d19668224ed97318829",
"packagetype": "bdist_wheel",
"python_version": "cp38",
"requires_python": ">=3.8",
"size": 64823806,
"upload_time": "2024-07-18T15:47:58",
"upload_time_iso_8601": "2024-07-18T15:47:58.405237Z",
"url": "https://files.pythonhosted.org/packages/49/78/758665ad00de48997815fce48b0174e2b30d5c4f27d4567c9f3d3776e9d9/forbiditerative-1.1.3-cp38-cp38-manylinux_2_17_x86_64.manylinux2014_x86_64.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "824daa4e59138aef6a973efde13ba1849afba61f847b1641374709536bba7fc3",
"md5": "cf99487bc8515f70c7d8f8b7fd7c8b64",
"sha256": "8a059cc8bf95f4b0eebfd8b09758980d2f33958a78d71a09611e1d22da37dd30"
},
"downloads": -1,
"filename": "forbiditerative-1.1.3-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl",
"has_sig": false,
"md5_digest": "cf99487bc8515f70c7d8f8b7fd7c8b64",
"packagetype": "bdist_wheel",
"python_version": "cp39",
"requires_python": ">=3.8",
"size": 64825435,
"upload_time": "2024-07-18T15:47:50",
"upload_time_iso_8601": "2024-07-18T15:47:50.302565Z",
"url": "https://files.pythonhosted.org/packages/82/4d/aa4e59138aef6a973efde13ba1849afba61f847b1641374709536bba7fc3/forbiditerative-1.1.3-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2024-07-18 15:47:47",
"github": true,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"github_user": "IBM",
"github_project": "forbiditerative",
"travis_ci": false,
"coveralls": false,
"github_actions": true,
"tox": true,
"lcname": "forbiditerative"
}
