lang111


Namelang111 JSON
Version 0.1.0 PyPI version JSON
download
home_pagehttps://github.com/satya/satya-language
SummaryA natural language interpreter for data structures and algorithms
upload_time2025-07-23 06:25:02
maintainerNone
docs_urlNone
authorSatya
requires_python>=3.6
licenseNone
keywords data structures algorithms natural language education
VCS
bugtrack_url
requirements No requirements were recorded.
Travis-CI No Travis.
coveralls test coverage No coveralls.
            # Satya Language

A natural language interpreter for data structures and algorithms in Python.

## Installation

```bash
# Install from the current directory
pip install .

# Or install from PyPI (once published)
# pip install satya
```

## Installation

```bash
pip install satya-language
```

## Usage

```python
from satya_language import SatyaInterpreter

# Create an interpreter instance
interpreter = SatyaInterpreter()

# Run commands in natural language
print(interpreter.run("Create linked list with 5 nodes"))
print(interpreter.run("Add apple, banana, cherry"))
print(interpreter.run("List show"))

print(interpreter.run("Create stack"))
print(interpreter.run("Push hello"))
print(interpreter.run("Stack show"))

print(interpreter.run("Create graph"))
print(interpreter.run("Add edge A B"))
print(interpreter.run("Add edge B C"))
print(interpreter.run("DFS A"))
```

## Features

- **Data Structures**: Linked List, Stack, Queue, Graph
- **Algorithms**: DFS, BFS, Sorting, Searching
- **Math Operations**: Factorial, Fibonacci, Prime checking, Armstrong number checking
- **Text Operations**: Palindrome checking

## Command Examples

### Linked List
- Create linked list with N nodes
- Add a, b, c
- Remove 2nd element
- List show
- List size

### Stack
- Create stack
- Push x
- Pop
- Stack show

### Queue
- Create queue
- Enqueue 1,2,3
- Dequeue
- Queue show

### Graph
- Create graph
- Add edge A B
- Show graph
- DFS A
- BFS A

### Math & Logic
- Factorial of N
- Fibonacci till N
- Is N palindrome?
- Is N armstrong?
- Is N prime?
- Sort 5 1 3
- Search 3 in 1 2 3

## License

MIT

            

Raw data

            {
    "_id": null,
    "home_page": "https://github.com/satya/satya-language",
    "name": "lang111",
    "maintainer": null,
    "docs_url": null,
    "requires_python": ">=3.6",
    "maintainer_email": null,
    "keywords": "data structures, algorithms, natural language, education",
    "author": "Satya",
    "author_email": "satya@example.com",
    "download_url": null,
    "platform": null,
    "description": "# Satya Language\r\n\r\nA natural language interpreter for data structures and algorithms in Python.\r\n\r\n## Installation\r\n\r\n```bash\r\n# Install from the current directory\r\npip install .\r\n\r\n# Or install from PyPI (once published)\r\n# pip install satya\r\n```\r\n\r\n## Installation\r\n\r\n```bash\r\npip install satya-language\r\n```\r\n\r\n## Usage\r\n\r\n```python\r\nfrom satya_language import SatyaInterpreter\r\n\r\n# Create an interpreter instance\r\ninterpreter = SatyaInterpreter()\r\n\r\n# Run commands in natural language\r\nprint(interpreter.run(\"Create linked list with 5 nodes\"))\r\nprint(interpreter.run(\"Add apple, banana, cherry\"))\r\nprint(interpreter.run(\"List show\"))\r\n\r\nprint(interpreter.run(\"Create stack\"))\r\nprint(interpreter.run(\"Push hello\"))\r\nprint(interpreter.run(\"Stack show\"))\r\n\r\nprint(interpreter.run(\"Create graph\"))\r\nprint(interpreter.run(\"Add edge A B\"))\r\nprint(interpreter.run(\"Add edge B C\"))\r\nprint(interpreter.run(\"DFS A\"))\r\n```\r\n\r\n## Features\r\n\r\n- **Data Structures**: Linked List, Stack, Queue, Graph\r\n- **Algorithms**: DFS, BFS, Sorting, Searching\r\n- **Math Operations**: Factorial, Fibonacci, Prime checking, Armstrong number checking\r\n- **Text Operations**: Palindrome checking\r\n\r\n## Command Examples\r\n\r\n### Linked List\r\n- Create linked list with N nodes\r\n- Add a, b, c\r\n- Remove 2nd element\r\n- List show\r\n- List size\r\n\r\n### Stack\r\n- Create stack\r\n- Push x\r\n- Pop\r\n- Stack show\r\n\r\n### Queue\r\n- Create queue\r\n- Enqueue 1,2,3\r\n- Dequeue\r\n- Queue show\r\n\r\n### Graph\r\n- Create graph\r\n- Add edge A B\r\n- Show graph\r\n- DFS A\r\n- BFS A\r\n\r\n### Math & Logic\r\n- Factorial of N\r\n- Fibonacci till N\r\n- Is N palindrome?\r\n- Is N armstrong?\r\n- Is N prime?\r\n- Sort 5 1 3\r\n- Search 3 in 1 2 3\r\n\r\n## License\r\n\r\nMIT\r\n",
    "bugtrack_url": null,
    "license": null,
    "summary": "A natural language interpreter for data structures and algorithms",
    "version": "0.1.0",
    "project_urls": {
        "Homepage": "https://github.com/satya/satya-language"
    },
    "split_keywords": [
        "data structures",
        " algorithms",
        " natural language",
        " education"
    ],
    "urls": [
        {
            "comment_text": null,
            "digests": {
                "blake2b_256": "a4f9803d529d7b2d8532a936171dbd716ece9f337f9f276a3e895194387a6dc4",
                "md5": "50e1c7e04f5c2b30a5370352dd793971",
                "sha256": "5056ad4a742f2564bd9a03980bde0e838cb5bff71e057d657f518ba1dc2decba"
            },
            "downloads": -1,
            "filename": "lang111-0.1.0-py3-none-any.whl",
            "has_sig": false,
            "md5_digest": "50e1c7e04f5c2b30a5370352dd793971",
            "packagetype": "bdist_wheel",
            "python_version": "py3",
            "requires_python": ">=3.6",
            "size": 5289,
            "upload_time": "2025-07-23T06:25:02",
            "upload_time_iso_8601": "2025-07-23T06:25:02.859346Z",
            "url": "https://files.pythonhosted.org/packages/a4/f9/803d529d7b2d8532a936171dbd716ece9f337f9f276a3e895194387a6dc4/lang111-0.1.0-py3-none-any.whl",
            "yanked": false,
            "yanked_reason": null
        }
    ],
    "upload_time": "2025-07-23 06:25:02",
    "github": true,
    "gitlab": false,
    "bitbucket": false,
    "codeberg": false,
    "github_user": "satya",
    "github_project": "satya-language",
    "github_not_found": true,
    "lcname": "lang111"
}
        
Elapsed time: 0.99558s