# Combinator
### The programming model to integrate AI components
[](https://travis-ci.org/joemccann/dillinger)
Combinator is a programming model to build integrative AI solutions. Programs can be generated in the form of graphs such that functions are represented by nodes and dataflow between them by edges. It loosly follows the functional style of programming with lazy evaluation. The features of the programming model can be enumerated as following.
- Dynamical program generation - Can generate aribitrary subprograms at runtime
- Modularity - Every part of the program is modular
- Expressivity - Preloaded with required primitives to build complex logics
- Abstraction - Can build arbitrary reusable components
- Ease of integration - With a proper UI programs can be easily built by connection nodes with edges.
- API integration - This packaged model contains a basic version of the environment object to make post calls to remote APIs
For more details please check [this](https://link.springer.com/article/10.1007/s40031-021-00676-5) paper and [this](https://www.tandfonline.com/doi/abs/10.1080/03772063.2021.2004461) one.
### Get started
The programming model is built on Python. You can install the package by running the following command
```python
pip install combinator
```
Then load the package in Python by running the following command
```python
import combinator as cb
```
### Examples
Here are few program examples in combinator
##### Add two constant numbers
```Python
from combinator import creategraph, createnode, addlink, init_world, runp
operation = '+' # this example can be run by setting operation as '-' or '*' or '/' or '^' or '=' or '>'
graph = creategraph('TestGraph') # Takes graphname as argument
g1 = createnode(graph,'iW',init_world) # 1st argument should be the graph object, 2nd the node short name and 3rd argument should be specific parameters needed to create specific nodes. Except for initworld, constant, sensor and actuator 3rd argument is not needed.
g2 = createnode(graph,'K',2);
g3 = createnode(graph,'K',3)
g4 = createnode(graph,operation)
addlink(graph,g1);
addlink(graph,g2,g1); # first argument should be the graph object, 2nd the node which needs to be connect to its parents and rest of the arguments should be the parent nodes in sequence.
addlink(graph,g3,g1);
addlink(graph,g4,g3,g2);
output = runp(g4,graph) # The first argument should be the terminal node which needs to be run and 2nd the graph object
print (output[0])
```
##### Conjuction of two boolean values
```python
from combinator import creategraph, createnode, addlink, init_world, runp
operation = '&' # this example can also be run by setting operation as '|'
graph = creategraph()
g1 = createnode(graph,'iW',init_world)
g2 = createnode(graph,'K',True);
g3 = createnode(graph,'K',False)
g4 = createnode(graph,operation)
addlink(graph,g1);
addlink(graph,g2,g1);
addlink(graph,g3,g1);
addlink(graph,g4,g3,g2);
output = runp(g4,graph)
print (output[0])
```
##### Conditional execution
```python
from combinator import creategraph, createnode, addlink, init_world, runp
graph = creategraph()
g1 = createnode(graph,'iW',init_world)
g2 = createnode(graph,'K',2)
g3 = createnode(graph,'K',3);
g4 = createnode(graph,'=')
g5 = createnode(graph,'if')
addlink(graph,g1);addlink(graph,g2,g1);addlink(graph,g3,g1);addlink(graph,g4,g2,g3);addlink(graph,g5,g4,g1,g2);
output = runp(g5,graph)
print(output[0])
```
##### Square all elements of list with fmap
```python
from combinator import creategraph, createnode, addlink, init_world, runp
graph = creategraph()
g1 = createnode(graph,'iW',init_world)
g2 = createnode(graph,'K',[3,4,5]);
g3 = createnode(graph,'*')
g4 = createnode(graph,'fm')
addlink(graph,g1);addlink(graph,g2,g1);addlink(graph,g3,g1,g1);addlink(graph,g4,g3,g2);
output = runp(g4,graph)
print(output[0])
```
##### Zip two lists
```python
from combinator import creategraph, createnode, addlink, init_world, runp
graph = creategraph()
g1 = createnode(graph,'iW',init_world)
g2 = createnode(graph,'K',[3,4,5]);
g3 = createnode(graph,'K',[14,12,4]);
g4 = createnode(graph,'zp')
addlink(graph,g1);addlink(graph,g2,g1);addlink(graph,g3,g1);addlink(graph,g4,g3,g2);
output = runp(g4,graph)
print(output[0])
```
##### Run loop
```python
from combinator import creategraph, createnode, addlink, init_world, runp
graph = creategraph()
g1 = createnode(graph,'iW',init_world)
g2 = createnode(graph,'K',2);
g3 = createnode(graph,'+')
g4 = createnode(graph,'lp')
addlink(graph,g1);addlink(graph,g2,g1);addlink(graph,g3,g1,g1);addlink(graph,g4,g3,g2);
output = runp(g4,graph)
print(output[0])
```
##### Run Recurse
```python
from combinator import creategraph, createnode, addlink, init_world, runp
graph = creategraph()
g1 = createnode(graph,'iW',init_world)
g2 = createnode(graph,'K',7);
g3 = createnode(graph,'K',1);
g4 = createnode(graph,'+');
g5 = createnode(graph,'K',100);
g6 = createnode(graph,'>');
g7 = createnode(graph,'lg')
g8 = createnode(graph,'lg')
g9 = createnode(graph,'rc')
addlink(graph,g1);addlink(graph,g2,g1);addlink(graph,g3,g1);addlink(graph,g4,g3,g1);addlink(graph,g5,g1);addlink(graph,g6,g1,g5);addlink(graph,g7,g6);addlink(graph,g8,g4);addlink(graph,g9,g8,g7,g2);
output = runp(g9,graph)
print(output[0])
```
##### External function call
```python
from combinator import creategraph, createnode, addlink, init_world, runp, worldclass
def extadd(a,b):
print("ext",a,b)
return a+b
extfunction = {"extadd": {"function": extadd}}
init_world = worldclass(extfunction)
graph = creategraph('TestGraph') # Takes graphname as argument
g1 = createnode(graph,'iW',init_world) # 1st argument should be the graph object, 2nd the node short name and 3rd argument should be specific parameters needed to create specific nodes. Except for initworld, constant, sensor and actuator 3rd argument is not needed.
g2 = createnode(graph,'K',6);
g3 = createnode(graph,'K',3)
g4 = createnode(graph,"extadd")
addlink(graph,g1);
addlink(graph,g2,g1); # first argument should be the graph object, 2nd the node which needs to be connect to its parents and rest of the arguments should be the parent nodes in sequence.
addlink(graph,g3,g1);
addlink(graph,g4,g3,g2);
output = runp(g4,graph) # The first argument should be the terminal node which needs to be run and 2nd the graph object
print (output[0])
```
##### Get runtime errors
```python
from combinator import creategraph, createnode, addlink, init_world, runp,combinatorruntimeerror
graph = creategraph()
g1 = createnode(graph,'iW',init_world)
g2 = createnode(graph,'K',2);
g3 = createnode(graph,'K','3')
g4 = createnode(graph,'-')
print(g1,g2,g2,g4)
addlink(graph,g1);addlink(graph,g2,g1);addlink(graph,g3,g1);addlink(graph,g4,g3,g2);
try:
print(runp(g4,graph))
except integratorruntimeerror as e:
print(e.error)
```
### List of available primitives
Following are the list of available primitives in combinator:
-------------------------------------------------------------------------
| Full Name | short name | Description|
|-----------|------------|------------|
| initWorld | iW | Initializes the environment|
| constant | K | Outputs a constant value as set during node creation |
| identity | id | Outputs the input value unchanged |
| add | + | Adds two input numbers. Joins two lists. Updates 2nd key-value pair in the 1st. |
| subtract | - | Subtracts the number in 2nd input port from the 1st |
| multiply | * | Multiplies two numbers |
| divide | / | Divides the number in 1st input port with respect to the 2nd |
| exponent | ^ | Raises the number in the 1st input port to the power of the 2nd |
| conjunction | & | Does logical AND operation between two inputs |
| disjunction | \| | Does logical OR operation between two inputs |
| negate | ! | Inverts the input boolean value |
| greater |> | Outputs True if 1st input is greater than second else False |
| equal |= | Outputs True if 1st input is equal to second else False |
| emptylistordict |nl | Outputs empty key-value pair if input is 'keyvalue' else empty list |
| head |hd | Outputs 1st element of the list |
| tail |tl | Outputs rest of the list except the 1st element |
| pop |pop | Outputs the _n_ th element from the list in the 2nd input port. The value _n_ should be provided in the 1st input port. It fetches the value corresponding to the key _k_ if 1st input is a key-value pair. In that case the 2nd input should provide the key _k_. |
|append| cn | Appends an element _e_ to the list provided in the 2nd input, where the 1st input provides the element _e_ |
|addkey| ak | Adds a key value pair to the key-value pairs provided in the 1st input. The 2nd input should provide the key and 3rd the value. |
|condition| if | Executes the parent graph connected to 2nd input port if 1st input is True else the parent graph of 3rd input port is executed. |
|lambdagraph| lg | Outputs the parent graph as subgraph. The iW node in the subgraph is replaced with an identity node. Any other initial nodes in the subgraph is connected to the newly created idenity node. |
|apply| ap | Outputs the parent graph as subgraph. The iW node in the subgraph is replaced with an identity node. Any other initial nodes in the subgraph is connected to the newly created idenity node. |
|fmap| fm | Converts the subgraph corresponding to parentnode1, a function and thereby applies it to each element of the list supplied in the input port 2. It outputs the new list. |
|zip| zp | Joins two list element wise. The two list should be provided in two input ports. It outputs a list of lists. |
|aggregator| ag | Aggregates the element of a list by an aggregator function. The aggregator function should be provided in input port 1 and the list in input port 2. |
|loop| lp | Converts the subgraph corresponding to parentnode1, a function and applies it _n_ number of times to its output. The initial argument of the function will be _n_ , where _n_ is supplied as an integer to its input port 2. |
|recurse| rc | Takes 2 function and one data value of any type as input. The function supplied to input port 1 is applied recursively on the 3rd input until stopping condition is met. The function supplied to input port 2 is applied on 3rd input to evaluate the stopping condition. |
Raw data
{
"_id": null,
"home_page": "https://github.com/swarna-kpaul/combinatorlite",
"name": "combinatorlite",
"maintainer": null,
"docs_url": null,
"requires_python": ">=3.6",
"maintainer_email": null,
"keywords": "programming model, dataflow graph, functional programming, Integrative AI",
"author": "Swarna Kamal Paul",
"author_email": "swarna.kpaul@gmail.com",
"download_url": "https://files.pythonhosted.org/packages/6d/a3/4dea9aaafd525b990c71c1c0a557f394349e739c241c151d5f9bfbbe06f6/combinatorlite-2.0.tar.gz",
"platform": null,
"description": "# Combinator\r\n### The programming model to integrate AI components \r\n\r\n[](https://travis-ci.org/joemccann/dillinger)\r\n\r\nCombinator is a programming model to build integrative AI solutions. Programs can be generated in the form of graphs such that functions are represented by nodes and dataflow between them by edges. It loosly follows the functional style of programming with lazy evaluation. The features of the programming model can be enumerated as following.\r\n\r\n- Dynamical program generation - Can generate aribitrary subprograms at runtime\r\n- Modularity - Every part of the program is modular \r\n- Expressivity - Preloaded with required primitives to build complex logics\r\n- Abstraction - Can build arbitrary reusable components\r\n- Ease of integration - With a proper UI programs can be easily built by connection nodes with edges. \r\n- API integration - This packaged model contains a basic version of the environment object to make post calls to remote APIs\r\n\r\nFor more details please check [this](https://link.springer.com/article/10.1007/s40031-021-00676-5) paper and [this](https://www.tandfonline.com/doi/abs/10.1080/03772063.2021.2004461) one.\r\n\r\n### Get started\r\nThe programming model is built on Python. You can install the package by running the following command\r\n\r\n```python\r\npip install combinator\r\n```\r\n\r\nThen load the package in Python by running the following command\r\n```python\r\nimport combinator as cb\r\n```\r\n\r\n### Examples\r\nHere are few program examples in combinator\r\n\r\n##### Add two constant numbers\r\n```Python\r\nfrom combinator import creategraph, createnode, addlink, init_world, runp\r\noperation = '+' # this example can be run by setting operation as '-' or '*' or '/' or '^' or '=' or '>'\r\ngraph = creategraph('TestGraph') # Takes graphname as argument\r\ng1 = createnode(graph,'iW',init_world) # 1st argument should be the graph object, 2nd the node short name and 3rd argument should be specific parameters needed to create specific nodes. Except for initworld, constant, sensor and actuator 3rd argument is not needed. \r\ng2 = createnode(graph,'K',2);\r\ng3 = createnode(graph,'K',3)\r\ng4 = createnode(graph,operation)\r\naddlink(graph,g1); \r\naddlink(graph,g2,g1); # first argument should be the graph object, 2nd the node which needs to be connect to its parents and rest of the arguments should be the parent nodes in sequence.\r\naddlink(graph,g3,g1);\r\naddlink(graph,g4,g3,g2);\r\noutput = runp(g4,graph) # The first argument should be the terminal node which needs to be run and 2nd the graph object\r\nprint (output[0])\r\n```\r\n##### Conjuction of two boolean values\r\n```python\r\nfrom combinator import creategraph, createnode, addlink, init_world, runp\r\noperation = '&' # this example can also be run by setting operation as '|'\r\ngraph = creategraph()\r\ng1 = createnode(graph,'iW',init_world)\r\ng2 = createnode(graph,'K',True);\r\ng3 = createnode(graph,'K',False)\r\ng4 = createnode(graph,operation)\r\naddlink(graph,g1);\r\naddlink(graph,g2,g1);\r\naddlink(graph,g3,g1);\r\naddlink(graph,g4,g3,g2);\r\noutput = runp(g4,graph)\r\nprint (output[0])\r\n```\r\n##### Conditional execution\r\n```python\r\nfrom combinator import creategraph, createnode, addlink, init_world, runp\r\ngraph = creategraph()\r\ng1 = createnode(graph,'iW',init_world)\r\ng2 = createnode(graph,'K',2)\r\ng3 = createnode(graph,'K',3);\r\ng4 = createnode(graph,'=')\r\ng5 = createnode(graph,'if')\r\naddlink(graph,g1);addlink(graph,g2,g1);addlink(graph,g3,g1);addlink(graph,g4,g2,g3);addlink(graph,g5,g4,g1,g2);\r\noutput = runp(g5,graph)\r\nprint(output[0])\r\n```\r\n\r\n##### Square all elements of list with fmap\r\n```python\r\nfrom combinator import creategraph, createnode, addlink, init_world, runp\r\ngraph = creategraph()\r\ng1 = createnode(graph,'iW',init_world)\r\ng2 = createnode(graph,'K',[3,4,5]);\r\ng3 = createnode(graph,'*')\r\ng4 = createnode(graph,'fm')\r\naddlink(graph,g1);addlink(graph,g2,g1);addlink(graph,g3,g1,g1);addlink(graph,g4,g3,g2);\r\noutput = runp(g4,graph)\r\nprint(output[0])\r\n```\r\n\r\n##### Zip two lists\r\n```python\r\nfrom combinator import creategraph, createnode, addlink, init_world, runp\r\ngraph = creategraph()\r\ng1 = createnode(graph,'iW',init_world)\r\ng2 = createnode(graph,'K',[3,4,5]);\r\ng3 = createnode(graph,'K',[14,12,4]);\r\ng4 = createnode(graph,'zp')\r\naddlink(graph,g1);addlink(graph,g2,g1);addlink(graph,g3,g1);addlink(graph,g4,g3,g2);\r\noutput = runp(g4,graph)\r\nprint(output[0])\r\n```\r\n\r\n##### Run loop\r\n```python\r\nfrom combinator import creategraph, createnode, addlink, init_world, runp\r\ngraph = creategraph()\r\ng1 = createnode(graph,'iW',init_world)\r\ng2 = createnode(graph,'K',2);\r\ng3 = createnode(graph,'+')\r\ng4 = createnode(graph,'lp')\r\naddlink(graph,g1);addlink(graph,g2,g1);addlink(graph,g3,g1,g1);addlink(graph,g4,g3,g2);\r\noutput = runp(g4,graph)\r\nprint(output[0])\r\n```\r\n\r\n##### Run Recurse\r\n```python\r\nfrom combinator import creategraph, createnode, addlink, init_world, runp\r\ngraph = creategraph()\r\ng1 = createnode(graph,'iW',init_world)\r\ng2 = createnode(graph,'K',7);\r\ng3 = createnode(graph,'K',1);\r\ng4 = createnode(graph,'+');\r\ng5 = createnode(graph,'K',100);\r\ng6 = createnode(graph,'>');\r\ng7 = createnode(graph,'lg')\r\ng8 = createnode(graph,'lg')\r\ng9 = createnode(graph,'rc')\r\naddlink(graph,g1);addlink(graph,g2,g1);addlink(graph,g3,g1);addlink(graph,g4,g3,g1);addlink(graph,g5,g1);addlink(graph,g6,g1,g5);addlink(graph,g7,g6);addlink(graph,g8,g4);addlink(graph,g9,g8,g7,g2);\r\noutput = runp(g9,graph)\r\nprint(output[0])\r\n```\r\n\r\n##### External function call \r\n```python\r\nfrom combinator import creategraph, createnode, addlink, init_world, runp, worldclass\r\ndef extadd(a,b):\r\n print(\"ext\",a,b)\r\n return a+b\r\nextfunction = {\"extadd\": {\"function\": extadd}}\r\ninit_world = worldclass(extfunction)\r\n\r\n\r\ngraph = creategraph('TestGraph') # Takes graphname as argument\r\ng1 = createnode(graph,'iW',init_world) # 1st argument should be the graph object, 2nd the node short name and 3rd argument should be specific parameters needed to create specific nodes. Except for initworld, constant, sensor and actuator 3rd argument is not needed. \r\ng2 = createnode(graph,'K',6);\r\ng3 = createnode(graph,'K',3)\r\ng4 = createnode(graph,\"extadd\")\r\naddlink(graph,g1); \r\naddlink(graph,g2,g1); # first argument should be the graph object, 2nd the node which needs to be connect to its parents and rest of the arguments should be the parent nodes in sequence.\r\naddlink(graph,g3,g1);\r\naddlink(graph,g4,g3,g2);\r\noutput = runp(g4,graph) # The first argument should be the terminal node which needs to be run and 2nd the graph object\r\nprint (output[0])\r\n```\r\n\r\n\r\n##### Get runtime errors\r\n```python\r\nfrom combinator import creategraph, createnode, addlink, init_world, runp,combinatorruntimeerror\r\ngraph = creategraph()\r\ng1 = createnode(graph,'iW',init_world)\r\ng2 = createnode(graph,'K',2);\r\ng3 = createnode(graph,'K','3')\r\ng4 = createnode(graph,'-')\r\nprint(g1,g2,g2,g4)\r\naddlink(graph,g1);addlink(graph,g2,g1);addlink(graph,g3,g1);addlink(graph,g4,g3,g2);\r\ntry:\r\n print(runp(g4,graph))\r\nexcept integratorruntimeerror as e:\r\n print(e.error)\r\n```\r\n\r\n\r\n### List of available primitives\r\n\r\nFollowing are the list of available primitives in combinator:\r\n\r\n-------------------------------------------------------------------------\r\n\r\n| Full Name | short name | Description|\r\n|-----------|------------|------------|\r\n| initWorld | iW | Initializes the environment|\r\n| constant | K | Outputs a constant value as set during node creation |\r\n| identity | id | Outputs the input value unchanged |\r\n| add | + | Adds two input numbers. Joins two lists. Updates 2nd key-value pair in the 1st. |\r\n| subtract | - | Subtracts the number in 2nd input port from the 1st |\r\n| multiply | * | Multiplies two numbers |\r\n| divide | / | Divides the number in 1st input port with respect to the 2nd |\r\n| exponent | ^ | Raises the number in the 1st input port to the power of the 2nd |\r\n| conjunction | & | Does logical AND operation between two inputs |\r\n| disjunction | \\| | Does logical OR operation between two inputs |\r\n| negate | ! | Inverts the input boolean value |\r\n| greater |> | Outputs True if 1st input is greater than second else False |\r\n| equal |= | Outputs True if 1st input is equal to second else False |\r\n| emptylistordict |nl | Outputs empty key-value pair if input is 'keyvalue' else empty list |\r\n| head |hd | Outputs 1st element of the list |\r\n| tail |tl | Outputs rest of the list except the 1st element |\r\n| pop |pop | Outputs the _n_ th element from the list in the 2nd input port. The value _n_ should be provided in the 1st input port. It fetches the value corresponding to the key _k_ if 1st input is a key-value pair. In that case the 2nd input should provide the key _k_. |\r\n|append| cn | Appends an element _e_ to the list provided in the 2nd input, where the 1st input provides the element _e_ |\r\n|addkey| ak | Adds a key value pair to the key-value pairs provided in the 1st input. The 2nd input should provide the key and 3rd the value. |\r\n|condition| if | Executes the parent graph connected to 2nd input port if 1st input is True else the parent graph of 3rd input port is executed. |\r\n|lambdagraph| lg | Outputs the parent graph as subgraph. The iW node in the subgraph is replaced with an identity node. Any other initial nodes in the subgraph is connected to the newly created idenity node. |\r\n|apply| ap | Outputs the parent graph as subgraph. The iW node in the subgraph is replaced with an identity node. Any other initial nodes in the subgraph is connected to the newly created idenity node. |\r\n|fmap| fm | Converts the subgraph corresponding to parentnode1, a function and thereby applies it to each element of the list supplied in the input port 2. It outputs the new list. |\r\n|zip| zp | Joins two list element wise. The two list should be provided in two input ports. It outputs a list of lists. |\r\n|aggregator| ag | Aggregates the element of a list by an aggregator function. The aggregator function should be provided in input port 1 and the list in input port 2. |\r\n|loop| lp | Converts the subgraph corresponding to parentnode1, a function and applies it _n_ number of times to its output. The initial argument of the function will be _n_ , where _n_ is supplied as an integer to its input port 2. |\r\n|recurse| rc | Takes 2 function and one data value of any type as input. The function supplied to input port 1 is applied recursively on the 3rd input until stopping condition is met. The function supplied to input port 2 is applied on 3rd input to evaluate the stopping condition. |\r\n",
"bugtrack_url": null,
"license": null,
"summary": "The programming model to integrate AI components",
"version": "2.0",
"project_urls": {
"Bug Tracker": "https://github.com/swarna-kpaul/combinatorlite/issues",
"Homepage": "https://github.com/swarna-kpaul/combinatorlite"
},
"split_keywords": [
"programming model",
" dataflow graph",
" functional programming",
" integrative ai"
],
"urls": [
{
"comment_text": "",
"digests": {
"blake2b_256": "9540dd66b9deedf025f4fdc3d47c563a35d192fbbb3faa634e7045348435de9b",
"md5": "d886ec73cd767504bcc3a8093fd12358",
"sha256": "c54189947c1e42fcf7980f4805b11bb59b8b867e90adf49c17d6c121a148885b"
},
"downloads": -1,
"filename": "combinatorlite-2.0-py3-none-any.whl",
"has_sig": false,
"md5_digest": "d886ec73cd767504bcc3a8093fd12358",
"packagetype": "bdist_wheel",
"python_version": "py3",
"requires_python": ">=3.6",
"size": 22210,
"upload_time": "2024-09-12T15:32:54",
"upload_time_iso_8601": "2024-09-12T15:32:54.278826Z",
"url": "https://files.pythonhosted.org/packages/95/40/dd66b9deedf025f4fdc3d47c563a35d192fbbb3faa634e7045348435de9b/combinatorlite-2.0-py3-none-any.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "6da34dea9aaafd525b990c71c1c0a557f394349e739c241c151d5f9bfbbe06f6",
"md5": "1635ed349c3576df0222dd39b8d538c0",
"sha256": "0b8b5a1278c6239485bf8359001cfb26ff2a03e59e4725f12651080043221fcc"
},
"downloads": -1,
"filename": "combinatorlite-2.0.tar.gz",
"has_sig": false,
"md5_digest": "1635ed349c3576df0222dd39b8d538c0",
"packagetype": "sdist",
"python_version": "source",
"requires_python": ">=3.6",
"size": 22687,
"upload_time": "2024-09-12T15:32:58",
"upload_time_iso_8601": "2024-09-12T15:32:58.014691Z",
"url": "https://files.pythonhosted.org/packages/6d/a3/4dea9aaafd525b990c71c1c0a557f394349e739c241c151d5f9bfbbe06f6/combinatorlite-2.0.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2024-09-12 15:32:58",
"github": true,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"github_user": "swarna-kpaul",
"github_project": "combinatorlite",
"travis_ci": false,
"coveralls": false,
"github_actions": false,
"lcname": "combinatorlite"
}
JSON
