Merge branch 'master' into master

Author: Ian Doarn

CONTIRBUTORS.md

@@ -13,4 +13,7 @@
  - Songzhuozhuo '[souo](https://github.com/souo)'
  - Emil '[Skeen](https://github.com/Skeen)' Madsen
  - Ian '[IanDoarn](https://github.com/IanDoarn)' Doarn
- - Timothy '[Tjstretchalot](https://github.com/Tjstretchalot)' Moore
+ - Timothy '[Tjstretchalot](https://github.com/Tjstretchalot)' Moore
+ - Sharad '[sharadbhat](https://github.com/sharadbhat)' Bhat
+ - Alexey '[aesee](https://github.com/aesee)' Sarapulov
+ - Anthony '[MrDupin](https://github.com/MrDupin)' Marakis

pygorithm/__init__.py

@@ -30,7 +30,7 @@
 
 """
 
-__version__ = '1.0.0'
+__version__ = '1.0.3'
 __author__ = 'Omkar Pathak'
 
 # List maintainers here
@@ -65,4 +65,5 @@
     'sorting',
     'string',
     'pathfinding'
+    'geometry',
 ]

pygorithm/data_structures/__init__.py

@@ -1,19 +1,21 @@
 """
 Collection of data structure examples
 """
-from . import graph
-from . import heap
-from . import linked_list
-from . import queue
-from . import stack
-from . import tree
+import pkgutil
 
-__all__ = [
-    'graph',
-    'heap',
-    'linked_list',
-    'queue',
-    'stack',
-    'tree',
-    'trie'
-]
+def modules():
+    """
+    Find all functions in pygorithm.data_structures
+    """
+    from pygorithm import data_structures
+    package = data_structures
+    modules_list = []
+    for importer, modname, ispkg in pkgutil.iter_modules(package.__path__):
+        modules_list.append(modname)
+    modules_list.remove('modules')
+    modules_list.sort()
+    return modules_list
+
+modules_list = modules()
+
+__all__ = modules_list

pygorithm/data_structures/modules.py

@@ -1,15 +1,21 @@
 """
 Collection of fibonacci methods and functions
 """
-from . import generator
-from . import goldenratio
-from . import memoization
-from . import modules
-from . import recursion
+import pkgutil
 
-__all__ = [
-    'generator',
-    'goldenratio',
-    'memoization',
-    'recursion'
-]
+def modules():
+    """
+    Find all functions in pygorithm.fibonacci
+    """
+    from pygorithm import fibonacci
+    package = fibonacci
+    modules_list = []
+    for importer, modname, ispkg in pkgutil.iter_modules(package.__path__):
+        modules_list.append(modname)
+    modules_list.remove('modules')
+    modules_list.sort()
+    return modules_list
+
+modules_list = modules()
+
+__all__ = modules_list

pygorithm/fibonacci/__init__.py

@@ -0,0 +1,21 @@
+"""
+Collection of special geometry functions
+"""
+import pkgutil
+
+def modules():
+    """
+    Find all functions in pygorithm.geometry
+    """
+    from pygorithm import geometry
+    package = geometry
+    modules_list = []
+    for importer, modname, ispkg in pkgutil.iter_modules(package.__path__):
+        modules_list.append(modname)
+    modules_list.remove('modules')
+    modules_list.sort()
+    return modules_list
+
+modules_list = modules()
+
+__all__ = modules_list

pygorithm/fibonacci/modules.py

@@ -0,0 +1,61 @@
+"""
+Author: ALEXEY SARAPULOV
+Created On: 23 August 2017
+"""
+
+# To test if two rectangle intersect, we only have to find out
+# if their projections intersect on all of the coordinate axes
+
+import inspect
+
+
+class Coord:
+    """Coord
+    Class to initialize Coordinate of one point
+    """
+
+    def __init__(self, x, y):
+        self.x = x
+        self.y = y
+
+
+class SimpleRectangle:
+    """SimpleRectangle
+    Class to initialize Body of Object
+    """
+
+    def __init__(self, coord1, coord2):
+        """
+        :type coord1: object of class Coord
+        :type coord2: object of class Coord
+        """
+        self.min_x = coord1.x
+        self.min_y = coord1.y
+        self.max_x = coord2.x
+        self.max_y = coord2.y
+
+
+def broad_phase(simpleRect1, simpleRect2):
+    """
+    :type simpleRect1: object
+    :type simpleRect2: object
+    """
+    d1x = simpleRect2.min_x - simpleRect1.max_x
+    d1y = simpleRect2.min_y - simpleRect1.max_y
+    d2x = simpleRect1.min_x - simpleRect2.max_x
+    d2y = simpleRect1.min_y - simpleRect2.max_y
+
+    if d1x > 0 or d1y > 0:
+        return False
+
+    if d2x > 0 or d2y > 0:
+        return False
+
+    return True
+
+
+def get_code():
+    """
+    returns the code for the broad phase function
+    """
+    return inspect.getsource(broad_phase)

pygorithm/geometry/__init__.py

@@ -1,12 +1,21 @@
 """
 Collection of special math functions
 """
-from . import lcm
-from . import lcm_using_gcd
-from . import sieve_of_eratosthenes
+import pkgutil
 
-__all__ = [
-    'lcm',
-    'lcm_using_gcd',
-    'sieve_of_eratosthenes'
-]
+def modules():
+    """
+    Find all functions in pygorithm.math
+    """
+    from pygorithm import math
+    package = math
+    modules_list = []
+    for importer, modname, ispkg in pkgutil.iter_modules(package.__path__):
+        modules_list.append(modname)
+    modules_list.remove('modules')
+    modules_list.sort()
+    return modules_list
+
+modules_list = modules()
+
+__all__ = modules_list