Fix some failing documentation

This fixes the first wave of sphinx errors

Author: Tjstretchalot

docs/Geometry.rst

@@ -491,10 +491,15 @@ Defines an undirected two-dimensional line by an axis, a minimum and a maximum.
     Determine if the line contains the specified point, which is assumed 
     to be defined the same way as min and max.
 
+    .. tip::
+        
+            It is not possible for both returned booleans to be `True`.
+    
+
 Axis-Aligned Line (autogen)
 ---------------------------
 
-.. autoclass:: pygorithm.geometry.AxisAlignedLine
+.. autoclass:: pygorithm.geometry.axisall.AxisAlignedLine
     :members:
 
 Concave Polygon
@@ -519,14 +524,14 @@ index to the larger index will walk clockwise around the polygon.
     To reduce unnecessary recalculations, Polygons notably do not have 
     an easily modifiable position. However, where relevant, the class 
     methods will accept offsets to the polygons.
-    
+
 .. note::
 
     Unfortunately, operations on rotated polygons require recalculating
     the polygon based on its rotated points. This should be avoided 
     unless necessary through the use of Axis-Aligned Bounding Boxes
     and similar tools.
-    
+
 .. attribute:: Polygon2.points 
 
     The ordered list of `Vector2`s in this polygon.
@@ -543,15 +548,15 @@ index to the larger index will walk clockwise around the polygon.
 .. attribute:: Polygon2.center
 
     The `Vector2` center of the polygon. Lazily initialized.
-    
+
 .. attribute:: Polygon2.aabb
 
     The `Rect2` bounding box of this polygon. Lazily initialized.
-    
+
 .. method:: Polygon2(self, points)
 
     - **points** - The ordered list of points in this polygon.
-    
+
 .. staticmethod:: Polygon2.contains_point(polygon, offset, vec)
 
     - **polygon** - polygon to check

pygorithm/geometry/axisall.py

@@ -48,7 +48,7 @@ def __init__(self, axis, point1, point2):
         Construct an axis aligned line with the appropriate min and max.
         
         :param axis: axis this line is on
-        :type axis: :class:`pygorithm.geometry.Vector2`
+        :type axis: :class:`pygorithm.geometry.vector2.Vector2`
         :param point1: one point on this line
         :type point1: :class:`numbers.Number`
         :param point2: a different point on this line
@@ -74,9 +74,9 @@ def intersects(line1, line2):
             the same operations.
         
         :param line1: the first line
-        :type line1: :class:`pygorithm.geometry.AxisAlignedLine`
+        :type line1: :class:`pygorithm.geometry.axisall.AxisAlignedLine`
         :param line2: the second line
-        :type line2: :class:`pygorithm.geometry.AxisAlignedLine`
+        :type line2: :class:`pygorithm.geometry.axisall.AxisAlignedLine`
         :returns: touching, overlapping
         :rtype: bool, bool
         """
@@ -101,9 +101,9 @@ def find_intersection(line1, line2):
         
         
         :param line1: the first line
-        :type line1: :class:`pygorithm.geometry.AxisAlignedLine`
+        :type line1: :class:`pygorithm.geometry.axisall.AxisAlignedLine`
         :param line2: the second line
-        :type line2: :class:`pygorithm.geometry.AxisAlignedLine`
+        :type line2: :class:`pygorithm.geometry.axisall.AxisAlignedLine`
         :returns: touching, mtv against 1
         :rtype: bool, :class:`numbers.Number` or None
         """
@@ -122,7 +122,7 @@ def contains_point(line, point):
             It is not possible for both returned booleans to be `True`.
         
         :param line: the line
-        :type line: :class:`pygorithm.geometry.AxisAlignedLine`
+        :type line: :class:`pygorithm.geometry.axisall.AxisAlignedLine`
         :param point: the point
         :type point: :class:`numbers.Number`
         :returns: if the point is an edge of the line, if the point is contained by the line