absurdsortlib 1.0.0__tar.gz

absurdsortlib-1.0.0/LICENSE.txt

@@ -0,0 +1,11 @@
+Copyright 2025 Polecat
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction,
+including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished
+to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH
+THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

absurdsortlib-1.0.0/PKG-INFO

@@ -0,0 +1,36 @@
+Metadata-Version: 2.4
+Name: absurdsortlib
+Version: 1.0.0
+Summary: Very useful sorting algorithms, ignore the title, they are extremely fast and useful
+Author-email: Polecat <polecat@disroot.org>
+License-Expression: MIT
+Project-URL: Repository, https://github.com/polecatttt/absurdSortLib.git
+Keywords: sort,joke,sorting
+Description-Content-Type: text/markdown
+License-File: LICENSE.txt
+Dynamic: license-file
+
+# Absurd Sorting Algorithms (v1.0.0)
+these are the best on the market, completely free!
+
+# Installation
+`pip install absurdsortlib`
+
+# Usage
+`import absurdsortlib`<br>
+Then use any of the totally valid sorting algorithms here:
+
+- `stalinsort`: Sends non confirming numbers to the gulag!
+- `bogosort`: our favorite one, random shuffling until its sorted
+- `intelligentdesignsort`: there is a 1/n! chance the list was ordered in that specific way, so it must be the work of a higher diety. We shall not meddle with it
+- `miraclesort`: one day...
+- `movinggoalpostsort`: changes mathematics so the list is sorted
+- `internsort`: this is why you hired them, right?
+- `orwellsort`: Oceania allows no individuality.
+- `monkeysort`: Infinite monkey theorem, but for ordering lists
+- `zerosort`: multiples every number in the list with zero. Then its sorted!
+- `smallchildsort` - why are you getting a small child to do it for you??
+
+All of these take `list[int | float]` as an argument<br>
+Additionally, `monkeysort` takes `printOutput: bool` (default to false) to print the list every time it changes<br>
+Additionally, `smallchildsort` takes `giveCandy: bool` (default to false) to give candy to the child<br>

absurdsortlib-1.0.0/README.md

@@ -0,0 +1,24 @@
+# Absurd Sorting Algorithms (v1.0.0)
+these are the best on the market, completely free!
+
+# Installation
+`pip install absurdsortlib`
+
+# Usage
+`import absurdsortlib`<br>
+Then use any of the totally valid sorting algorithms here:
+
+- `stalinsort`: Sends non confirming numbers to the gulag!
+- `bogosort`: our favorite one, random shuffling until its sorted
+- `intelligentdesignsort`: there is a 1/n! chance the list was ordered in that specific way, so it must be the work of a higher diety. We shall not meddle with it
+- `miraclesort`: one day...
+- `movinggoalpostsort`: changes mathematics so the list is sorted
+- `internsort`: this is why you hired them, right?
+- `orwellsort`: Oceania allows no individuality.
+- `monkeysort`: Infinite monkey theorem, but for ordering lists
+- `zerosort`: multiples every number in the list with zero. Then its sorted!
+- `smallchildsort` - why are you getting a small child to do it for you??
+
+All of these take `list[int | float]` as an argument<br>
+Additionally, `monkeysort` takes `printOutput: bool` (default to false) to print the list every time it changes<br>
+Additionally, `smallchildsort` takes `giveCandy: bool` (default to false) to give candy to the child<br>

absurdsortlib-1.0.0/pyproject.toml

@@ -0,0 +1,32 @@
+[tool.black]
+line-length = 88
+target-version = ["py311"]
+
+[tool.ruff]
+line-length = 88
+extend-select = ["I"]
+ignore = ["E501", "F401"]
+
+[tool.pyright]
+typeCheckingMode = "strict"
+reportMissingImports = true
+reportUnusedVariable = "warning"
+reportUnusedFunction = "warning"
+
+[build-system]
+requires = ["setuptools >= 77.0.3"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "absurdsortlib"
+version = "1.0.0"
+authors = [
+    {name = "Polecat", email = "polecat@disroot.org"}
+]
+description = "Very useful sorting algorithms, ignore the title, they are extremely fast and useful"
+readme = "README.md"
+license = "MIT"
+keywords = ["sort", "joke", "sorting"]
+
+[project.urls]
+Repository = "https://github.com/polecatttt/absurdSortLib.git"

absurdsortlib-1.0.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

absurdsortlib-1.0.0/src/absurdsortlib.egg-info/PKG-INFO

@@ -0,0 +1,36 @@
+Metadata-Version: 2.4
+Name: absurdsortlib
+Version: 1.0.0
+Summary: Very useful sorting algorithms, ignore the title, they are extremely fast and useful
+Author-email: Polecat <polecat@disroot.org>
+License-Expression: MIT
+Project-URL: Repository, https://github.com/polecatttt/absurdSortLib.git
+Keywords: sort,joke,sorting
+Description-Content-Type: text/markdown
+License-File: LICENSE.txt
+Dynamic: license-file
+
+# Absurd Sorting Algorithms (v1.0.0)
+these are the best on the market, completely free!
+
+# Installation
+`pip install absurdsortlib`
+
+# Usage
+`import absurdsortlib`<br>
+Then use any of the totally valid sorting algorithms here:
+
+- `stalinsort`: Sends non confirming numbers to the gulag!
+- `bogosort`: our favorite one, random shuffling until its sorted
+- `intelligentdesignsort`: there is a 1/n! chance the list was ordered in that specific way, so it must be the work of a higher diety. We shall not meddle with it
+- `miraclesort`: one day...
+- `movinggoalpostsort`: changes mathematics so the list is sorted
+- `internsort`: this is why you hired them, right?
+- `orwellsort`: Oceania allows no individuality.
+- `monkeysort`: Infinite monkey theorem, but for ordering lists
+- `zerosort`: multiples every number in the list with zero. Then its sorted!
+- `smallchildsort` - why are you getting a small child to do it for you??
+
+All of these take `list[int | float]` as an argument<br>
+Additionally, `monkeysort` takes `printOutput: bool` (default to false) to print the list every time it changes<br>
+Additionally, `smallchildsort` takes `giveCandy: bool` (default to false) to give candy to the child<br>

absurdsortlib-1.0.0/src/absurdsortlib.egg-info/SOURCES.txt

@@ -0,0 +1,9 @@
+LICENSE.txt
+README.md
+pyproject.toml
+src/__init__.py
+src/absurdsortlib.py
+src/absurdsortlib.egg-info/PKG-INFO
+src/absurdsortlib.egg-info/SOURCES.txt
+src/absurdsortlib.egg-info/dependency_links.txt
+src/absurdsortlib.egg-info/top_level.txt

absurdsortlib-1.0.0/src/absurdsortlib.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

absurdsortlib-1.0.0/src/absurdsortlib.egg-info/top_level.txt

@@ -0,0 +1,2 @@
+__init__
+absurdsortlib

absurdsortlib-1.0.0/src/absurdsortlib.py

@@ -0,0 +1,98 @@
+from random import shuffle, uniform
+from time import sleep
+
+num = int | float
+
+
+def stalinsort(lst: list[num]) -> list[num]:
+    """Sends Non-Confirming numbers to the gulag! First number always gets a pass."""
+
+    sort = [lst[0]]
+    for n in lst:
+        if n > sort[-1]:
+            sort.append(n)
+
+    lst = sort
+    return lst
+
+
+def bogosort(lst: list[num]) -> list[num]:
+    """Randomly shuffles all items until sorted"""
+
+    while lst != sorted(lst):
+        shuffle(lst)
+
+    return lst
+
+
+def intelligentdesignsort(lst: list[num]) -> list[num]:
+    """An intelligent designer must have made this list. Thus, we shouldn't meddle with it."""
+
+    return lst
+
+
+def miraclesort(lst: list[num]) -> list[num]:
+    """Wait for a miracle to happen"""
+
+    while lst != sorted(lst):
+        sleep(1)
+
+    return lst
+
+
+def movinggoalpostsort(lst: list[num]) -> str:
+    """Redefines mathematics."""
+
+    msg = "<".join(map(str, lst))
+    msg += ", so the list is already sorted."
+    return msg
+
+
+def internsort(lst: list[num]) -> list[num]:
+    """Let the intern do it for you!"""
+
+    print("Creating a jira ticket...")
+    sleep(10)
+    print("The intern quit.")
+    return lst
+
+
+def orwellsort(lst: list[num]) -> list[num]:
+    """Oceania allows no individuality."""
+
+    lst = [1 for _ in lst]
+    return lst
+
+
+def monkeysort(lst: list[num], printOutput: bool = False) -> list[num]:
+    """Shakespeares Monkeys can do the work"""
+
+    while lst != sorted(lst):
+        lst = [uniform(float(sorted(lst)[0]), float(sorted(lst)[-1])) for _ in lst]
+
+        if printOutput:
+            print(lst)
+
+    return lst
+
+
+def zerosort(lst: list[num]) -> list[num]:
+    """The list is sorted if all numbers are multiplied by 0!"""
+
+    lst = [int(n * 0) for n in lst]
+    return lst
+
+
+def smallchildsort(lst: list[num], giveCandy: bool = False) -> str:
+    """Why are you giving the list to a small child????"""
+
+    lst = sorted(lst)
+    if not giveCandy:
+        return "I have the list, but I wont give it! Hmph!"
+
+    del lst
+    return ":000 CANDY!!!!!!!! *runs away, but drops the list, breaking it*"
+
+
+if __name__ == "__main__":
+    print(smallchildsort([1, 5, 7, 3, 2, 91.92]))