mypytool 0.1.1__tar.gz

mypytool-0.1.1/PKG-INFO

@@ -0,0 +1,7 @@
+Metadata-Version: 2.4
+Name: mypytool
+Version: 0.1.1
+Summary: Add your description here
+Requires-Python: >=3.12
+Description-Content-Type: text/markdown
+Requires-Dist: tqdm>=4.67.1

mypytool-0.1.1/mypytool/__init__.py

@@ -0,0 +1,15 @@
+__version__ = "0.1.1"
+__author__ = "Tutu"
+__name__ = "mypytool"
+
+from .graphic import *
+from .sort import *
+from .date import *
+from .queue import *
+from .stack import *
+from .main import *
+from .linked_list import *
+
+# __all__ = ["graphic", "sort", "date", "queue", "stack", "main", "linked_list"]
+
+

mypytool-0.1.1/mypytool/date.py

@@ -0,0 +1,21 @@
+def month_first_day(day,week):
+    day %= 7
+    if day == 0:
+        day=7
+    return week - (day - 1)
+
+def leap_year(y):
+    if (y % 400 == 0) or (y % 4 == 0 and y % 100 != 0):
+        return True
+    return False
+
+def month_day(y = 2026, m=1):
+    if m == 2:
+        if leap_year(y):
+            return 29
+        else:
+            return 28
+    elif m == 1 or m == 3 or m == 5 or m == 7 or m == 8 or m == 10 or m == 12:
+        return 31
+    else:
+        return 30     

mypytool-0.1.1/mypytool/graphic.py

@@ -0,0 +1,104 @@
+import math
+from . import main
+class Circle():
+    def __init__(self,radius):
+        self.Radius = radius
+        self.Area = math.pi * (main.pow(self.Radius,2))
+        self.Perimeter = math.pi * (2 * self.Radius)
+    def radius(self):
+        return self.Radius
+    def area(self):
+        return self.Area
+    def perimeter(self):
+        return self.Perimeter   
+    
+class Square():
+    def __init__(self,side_length):
+        self.Side_length = side_length
+        self.Perimeter = 4 * side_length
+        self.Area = side_length * side_length
+    def side_length(self):
+        return self.Side_length
+    def area(self):
+        return self.Area
+    def perimeter(self):
+        return self.Perimeter
+    
+class Rectangle():
+    def __init__(self,Length, Width):
+        self.Length = Length
+        self.Width = Width
+        self.Perimeter = (self.Length + self.Width) * 2
+        self.Area = self.Length * self.Width
+    def width(self):
+        return self.Width
+    def length(self):
+        return self.Length
+    def area(self):
+        return self.Area
+    def perimeter(self):
+        return self.Perimeter
+    
+class Triangle():
+    def __init__(self,a,h,b,c):
+        self.a = a
+        self.b = b
+        self.c = c
+        self.h = h
+        self.Area = a * h / 2
+        self.Perimeter = a + b + c
+    def alen(self):
+        return self.a
+    def blen(self):
+        return self.b
+    def clen(self):
+        return self.c
+    def high(self):
+        return self.h
+    def area(self):
+        return self.Area
+    def perimeter(self):
+        return self.Perimeter
+
+class Parallelogram():
+    def __init__(self,a,b,h):
+        self.a = a
+        self.b = b
+        self.h = h
+        self.Area = a * h
+        self.Perimeter = a*2 + b*2
+    def alen(self):
+        return self.a
+    def blen(self):
+        return self.b
+    def hlen(self):
+        return self.h
+    def area(self):
+        return self.Area
+    def perimeter(self):
+        return self.Perimeter
+
+class Trapezoid():
+    def __init__(self,a,b,h,c,d):
+        self.a = a
+        self.b = b
+        self.h = h
+        self.c = c
+        self.d = d
+        self.Area = (a + b) * h / 2
+        self.Perimeter = a + b + c + d
+    def alen(self):
+        return self.a
+    def blen(self):
+        return self.b
+    def hlen(self):
+        return self.h
+    def clen(self):
+        return self.c
+    def dblen(self):
+        return self.d
+    def area(self):
+        return self.Area
+    def perimeter(self):
+        return self.Perimeter
+

mypytool-0.1.1/mypytool/linked_list.py

@@ -0,0 +1,181 @@
+class Linked_node:
+    def __init__(self,list,point=None,id=0):
+        self.n = list
+        self.points = point
+        self.id = id
+class General_Linked_list:
+    def __init__(self,n=None):
+        self.head = Linked_node(n)
+        self.element = 1
+    def append(self,n):
+        new_Linkednode = Linked_node(n,None,self.element)
+        temp = self.head
+        for i in range(self.element - 1):
+            temp = self.head.points
+        temp.points = new_Linkednode
+        self.element += 1
+    def display(self):
+        temp = self.head
+        for i in range(self.element):
+            print(temp.n,end=" -> ")
+            temp = temp.points
+    def delet(self):
+        self.element -= 1
+        temp = self.head
+        for i in range(self.element - 1):
+            temp = self.head.points
+        temp.points = None
+    def is_empty(self):
+        return self.head is None
+    def length(self):
+        return self.element
+    def items(self):
+        temp = self.head
+        while temp is not None:
+            yield temp.n
+            temp = temp.points
+    def add(self,n,place=1):
+        temp = self.head
+        temp2 = Linked_node(n,temp.points,place)
+        if self.is_empty():
+            self.head.points = temp2
+        elif place > (self.length() - 1):
+            self.append(n)
+        else:
+            for i in range(place - 1):
+                temp = temp.points
+            temp2.points = temp.points
+            temp.points = temp2
+            temp2.points.id += 1
+        self.element += 1
+    def insert(self,n,place=1):
+        temp = self.head
+        temp2 = Linked_node(n,temp.points,place)
+        if self.is_empty():
+            self.head.points = temp2
+        elif place > (self.length() - 1):
+            self.append(n)
+        else:
+            for i in range(place - 1):
+                temp = temp.points
+            temp2.points = temp.points
+            temp.points = temp2
+            temp2.points.id += 1
+        self.element += 1
+    def remove(self,place=1):
+        temp = self.head
+        if not self.is_empty:
+            if place > (self.length() - 1):
+                self.delet()
+            else:
+                for i in range(place - 1):
+                    temp = temp.points
+                temp2 = temp.points
+                temp2.point.id -= 1
+                temp.points = temp2.points
+        self.element -= 1
+    def find(self,n):
+        return n in self.items()
+class Cycle_Linked_list:
+    def __init__(self,n=None):
+        self.head = Linked_node(n)
+        self.element = 1
+    def append(self,n):
+        temp = Linked_node(n,id=self.element)
+        temp.points = temp
+        if self.element == 1:
+            self.head.points = temp
+        else:
+            temp2 = self.head
+            for i in range(self.element - 1):
+                temp2 = temp2.points
+            temp.points = self.head.points
+            temp2.points = temp
+        self.element += 1
+    def delet(self):
+        temp = self.head
+        self.element -= 1
+        for i in range(self.element - 1):
+            temp = temp.points
+        if self.element == 1:
+            self.head.points = None
+        else:
+             temp.points = self.head.points
+    def items(self):
+        temp = self.head
+        for i in range(self.element):
+            yield temp.n
+            temp = temp.points
+    def display(self):
+        temp = self.head
+        for i in range(self.element):
+            print(temp.n,end=" -> ")
+            temp = temp.points
+    def is_empty(self):
+        return self.head.points is None
+    def length(self):
+        return self.element
+    def add(self,n,place=1):
+        temp = self.head
+        temp2 = Linked_node(n,id=place)
+        temp2.points = temp2
+        if self.is_empty():
+            self.head.points = temp2
+        elif place == 1:
+            temp2.points = temp.points
+            self.head.points = temp2
+            temp3 = self.head
+            for i in range(self.element - 1):
+                temp3 = temp3.points
+            temp3.points = temp2
+        elif place > (self.length() - 1):
+            self.append(n)
+        else:
+            for i in range(place - 1):
+                temp = temp.points
+            temp2.points = temp.points
+            temp.points = temp2
+        self.element += 1
+    def insert(self,n,place=1):
+        temp = self.head
+        temp2 = Linked_node(n,id=place)
+        temp2.points = temp2
+        if self.is_empty():
+            self.head.points = temp2
+        elif place == 1:
+            temp2.points = temp.points
+            self.head.points = temp2
+            temp3 = self.head
+            for i in range(self.element):
+                temp3 = temp3.points
+            temp3.points = temp2
+        elif place > (self.length() - 1):
+            self.append(n)
+        else:
+            for i in range(place - 1):
+                temp = temp.points
+            temp2.points = temp.points
+            temp.points = temp2
+        self.element += 1
+    def remove(self,place = 1):
+        temp = self.head
+        temp2 = self.head
+        if not self.is_empty():
+            if not self.length == 2:
+                if place > (self.length() - 1):
+                    self.delet()
+                elif place == 1:
+                    temp.points = temp.points.points
+                    for i in range(self.element - 1):
+                        temp2 = temp2.points
+                    temp2.points = self.head.points
+                    
+                else:
+                    for i in range(place - 2):
+                        temp = temp.points
+                    temp.points = temp.points.points
+            else:
+                self.head.points = None
+        self.element -= 1
+    def find(self,n):
+        return n in self.items()        

mypytool-0.1.1/mypytool/queue.py

@@ -0,0 +1,34 @@
+class Queue():
+    def __init__(self,Front=0,End = 0):
+        self.Front = Front
+        self.End = End
+        self.endcp = End
+        self.queue = [0]
+        if self.End != 0 or self.Front != 0:
+            for i in range(self.End + self.Front):
+                self.queue.append(0)
+    def push(self,n):
+        if self.End == self.endcp:
+            self.queue[self.End] = n
+        else:
+            self.queue.append(n)
+        self.End += 1
+        return None
+    def pop(self):
+        self.queue[self.Front] = 0
+        self.Front += 1
+        if self.End - self.Front == 0:
+            self.End = 0
+            self.Front = 0
+        return None
+    def size(self):
+        return self.End - self.Front
+    def empty(self):
+        if self.End - self.Front == 0:
+            return True
+        else:
+            return False
+    def front(self):
+        return self.queue[self.Front]
+    def back(self):
+        return self.queue[self.End]

mypytool-0.1.1/mypytool/sort.py

@@ -0,0 +1,183 @@
+def bubble_sort(arr, reverse = False):
+    if reverse:
+        l = len(arr)
+        for i in range(l):
+          for j in range(l - i - 1):
+            if arr[j] < arr[j + 1]:
+                t = arr[j]
+                arr[j] = arr[j+1]
+                arr[j+1] = t
+        return arr
+    else:
+        l = len(arr)
+        for i in range(l):
+            for j in range(0,l-i-1):
+                if arr[j] > arr[j+1]:
+                    t = arr[j]
+                    arr[j] = arr[j+1]
+                    arr[j+1] = t
+        return arr
+
+def bucket_sort(arr, reverse = False):
+    # breakpoint()
+    m_max = arr[0]
+    arr1 = []
+    out = []
+    mem = -1
+    for i in arr:
+        if(i > m_max):
+            m_max = i
+    for i in range(m_max + 1):
+        arr1.append(0)
+    for i in arr:
+        arr1[i] += 1
+    if reverse:
+        for i in range(len(arr1)):
+            ins = len(arr1) - i - 1
+            for j in range(arr1[ins]):
+                out.append(ins)
+        return out
+    else:
+        for i in arr1:
+            mem += 1
+            if i != 0:
+                for j in range(i):
+                    out.append(mem)
+        return out
+
+def selection_sort(arr, reverse = False):
+    if reverse:
+        for i in range(len(arr) - 1):
+            m_min = arr[i]
+            m_min_i = 0
+            for j in range(i,len(arr)):
+                if(arr[j] >= m_min):
+                    m_min = arr[j]
+                    m_min_i = j
+            arr[i] , arr[m_min_i] = arr[m_min_i] , arr[i]
+        return arr
+    else:
+        for i in range(len(arr) - 1):
+            m_min = arr[i]
+            m_min_i = 0
+            for j in range(i,len(arr)):
+                if(arr[j] <= m_min):
+                    m_min = arr[j]
+                    m_min_i = j
+            arr[i] , arr[m_min_i] = arr[m_min_i] , arr[i]
+        return arr
+
+def insertion_sort(arr, reverse = False):
+    if reverse:
+        n = len(arr)
+        for i in range(1,n):
+            k = arr[i]
+            j = i - 1
+            while j >= 0 and k > arr[j]:
+                arr[j + 1] = arr[j]
+                j -= 1
+            arr[j + 1] = k
+        return arr
+    else:
+        n = len(arr)
+        for i in range(1,n):
+            k = arr[i]
+            j = i - 1
+            while j >= 0 and k < arr[j]:
+                arr[j + 1] = arr[j]
+                j -= 1
+            arr[j + 1] = k
+        return arr
+
+def shell_sort(arr, reverse = False):
+    if reverse:
+        n = len(arr)
+        len_t = n // 2
+        while len_t > 0:
+            for i in range(len_t, n):
+                temp = arr[i]
+                j = i
+                while j >= len_t and arr[j - len_t] < temp:
+                    arr[j] = arr[j - len_t]
+                    j -= len_t
+                arr[j] = temp
+            len_t //= 2
+        return arr
+    else:
+        n = len(arr)
+        len_t = n // 2
+        while len_t > 0:
+            for i in range(len_t, n):
+                temp = arr[i]
+                j = i
+                while j >= len_t and arr[j - len_t] > temp:
+                    arr[j] = arr[j - len_t]
+                    j -= len_t
+                arr[j] = temp
+            len_t //= 2
+        return arr
+
+def merge_sort(arr, reverse = False):
+    out = merge_sortt(arr)
+    if reverse:
+        return out.reverse()
+    else:
+        return out
+
+def merge_sortt(arr):
+    if len(arr) <= 1:
+        return arr
+    mid = len(arr) // 2
+    left_half = merge_sortt(arr[:mid])
+    right_half = merge_sortt(arr[mid:])
+    return merge(left_half, right_half)
+
+def merge(left, right):
+    sorted_arr = []
+    i = j = 0
+    while i < len(left) and j < len(right):
+        if left[i] < right[j]:
+            sorted_arr.append(left[i])
+            i += 1
+        else:
+            sorted_arr.append(right[j])
+            j += 1
+    sorted_arr.extend(left[i:])
+    sorted_arr.extend(right[j:])
+    return sorted_arr
+
+def quick_sort(arr, reverse = False):
+    if len(arr) <= 1:
+        return arr
+    right = len(arr)
+    std = arr[0]
+    leftl = []
+    rightl = []
+    time = 0
+    for i in arr:
+        if time == 0:
+            time += 1
+            continue
+        if i <= std:
+            leftl.append(i)
+        if i > std:
+            rightl.append(i)
+        time += 1
+    if reverse:
+        return quick_sort(rightl,True) + [std] + quick_sort(leftl,True)
+    else:
+        return quick_sort(leftl) + [std] + quick_sort(rightl)
+
+def ascending_order(arr, sorting_algorithm):
+    out = sorting_algorithm(arr)
+    return out
+
+def descending_order(arr, sorting_algorithm):
+    out = sorting_algorithm(arr,True)
+    return out
+
+def sort(arr, sorting_algorithm = quick_sort, sort_order = ascending_order, reverse = None):
+    if reverse != None:
+        return sorting_algorithm(arr,reverse)
+    out = sort_order(arr, sorting_algorithm)
+    return out

mypytool-0.1.1/mypytool/stack.py

@@ -0,0 +1,28 @@
+class Stack():
+    def __init__(self,Top = 0):
+        self.Top = Top
+        self.Bottom = Top
+        self.stack = [0]
+
+    def top(self):
+        return self.stack[self.Top - 1]
+    def push(self,n):
+        if self.Top == 0:
+            self.stack[self.Top] = n
+        else:
+            self.stack.append(n)
+        self.Top+=1
+        return None
+    def pop(self):
+        self.Top -= 1
+        self.stack[self.Top] = 0
+        if self.Top - self.Bottom == 0:
+            self.Top = self.Bottom
+        return None
+    def empty(self):
+        if self.Top - self.Bottom == 0:
+            return True
+        else:
+            return False
+    def size(self):
+        return self.Top - self.Bottom

mypytool-0.1.1/mypytool.egg-info/PKG-INFO

@@ -0,0 +1,7 @@
+Metadata-Version: 2.4
+Name: mypytool
+Version: 0.1.1
+Summary: Add your description here
+Requires-Python: >=3.12
+Description-Content-Type: text/markdown
+Requires-Dist: tqdm>=4.67.1

mypytool-0.1.1/mypytool.egg-info/SOURCES.txt

@@ -0,0 +1,14 @@
+README.md
+pyproject.toml
+mypytool/__init__.py
+mypytool/date.py
+mypytool/graphic.py
+mypytool/linked_list.py
+mypytool/queue.py
+mypytool/sort.py
+mypytool/stack.py
+mypytool.egg-info/PKG-INFO
+mypytool.egg-info/SOURCES.txt
+mypytool.egg-info/dependency_links.txt
+mypytool.egg-info/requires.txt
+mypytool.egg-info/top_level.txt

mypytool-0.1.1/mypytool.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

mypytool-0.1.1/mypytool.egg-info/requires.txt

@@ -0,0 +1 @@
+tqdm>=4.67.1

mypytool-0.1.1/mypytool.egg-info/top_level.txt

@@ -0,0 +1 @@
+mypytool

mypytool-0.1.1/pyproject.toml

@@ -0,0 +1,9 @@
+[project]
+name = "mypytool"
+version = "0.1.1"
+description = "Add your description here"
+readme = "README.md"
+requires-python = ">=3.12"
+dependencies = [
+    "tqdm>=4.67.1",
+]

mypytool-0.1.1/setup.cfg

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