pfc-geometry 0.1.0__tar.gz → 0.1.2__tar.gz

pfc_geometry-0.1.2/LICENSE

@@ -0,0 +1,165 @@
+GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions.
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version.
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+  Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.

pfc_geometry-0.1.2/PKG-INFO

@@ -0,0 +1,24 @@
+Metadata-Version: 2.1
+Name: pfc_geometry
+Version: 0.1.2
+Summary: A package for handling 3D geometry with a nice interface
+Home-page: https://github.com/PyFlightCoach/geometry
+Author: Thomas David
+Author-email: thomasdavid0@gmail.com
+Description-Content-Type: text/markdown
+License-File: LICENSE
+
+# geometry #
+
+Tools for handling 3D geometry, mostly just adds a nice interface to various geometric enterties. Each geometric entity can also be a vector of geometric entities. Each entity wraps a numpy array with the relevant number of columns labelled according to the cols class property and rows equal to the number of elements in the vector. Attribute access to each column is available and returns a numpy array. 
+
+Where operations are supported between geometric types the size of the output is inferred based on the length of the inputs. Where the two vectors of entities are of the same length, elementwise operations are performed. Where one vector is length one and the other is greater than one then the operation will be performed on every element of the longer vector. 
+
+Magic methods are used extensively and the function of operators are logical for each type. If unsure what the logical option is then check the code where it should be pretty clear. 
+
+Many convenience methods and constructors are available. Documentation is limited but if you need something it has probably already been written so check the code first. 
+
+
+now available on pypi:
+
+pip install pfc-geometry

pfc_geometry-0.1.2/README.md

@@ -0,0 +1,14 @@
+# geometry #
+
+Tools for handling 3D geometry, mostly just adds a nice interface to various geometric enterties. Each geometric entity can also be a vector of geometric entities. Each entity wraps a numpy array with the relevant number of columns labelled according to the cols class property and rows equal to the number of elements in the vector. Attribute access to each column is available and returns a numpy array. 
+
+Where operations are supported between geometric types the size of the output is inferred based on the length of the inputs. Where the two vectors of entities are of the same length, elementwise operations are performed. Where one vector is length one and the other is greater than one then the operation will be performed on every element of the longer vector. 
+
+Magic methods are used extensively and the function of operators are logical for each type. If unsure what the logical option is then check the code where it should be pretty clear. 
+
+Many convenience methods and constructors are available. Documentation is limited but if you need something it has probably already been written so check the code first. 
+
+
+now available on pypi:
+
+pip install pfc-geometry

{pfc_geometry-0.1.0 → pfc_geometry-0.1.2}/geometry/__init__.py

@@ -17,11 +17,11 @@ from .transformation import Transformation
 from .mass import Mass
 
 
-def Euler(*args, **kwargs):
+def Euler(*args, **kwargs) -> Quaternion:
     return Quaternion.from_euler(Point(*args, **kwargs))
     
 
-def Euldeg(*args, **kwargs):
+def Euldeg(*args, **kwargs) -> Quaternion:
     return Quaternion.from_euler(Point(*args, **kwargs).radians())
 
 

{pfc_geometry-0.1.0 → pfc_geometry-0.1.2}/geometry/base.py

@@ -47,11 +47,11 @@ class Base:
             elif "data" in kwargs:
                 args = [kwargs["data"]]
             else:
-                raise TypeError("unknown kwargs passed")
+                raise TypeError(f"unknown kwargs passed to {self.__class__.__name__}: {args}")
 
         if len(args)==1: 
-            if isinstance(args[0], np.ndarray): #data was passed directly
-                self.data = self.__class__._clean_data(args[0])
+            if isinstance(args[0], np.ndarray) or isinstance(args[0], list): #data was passed directly
+                self.data = self.__class__._clean_data(np.array(args[0]))
 
             elif all([isinstance(a, self.__class__) for a in args[0]]):
                 #a list of self.__class__ is passed, concatenate into one
@@ -60,7 +60,7 @@ class Base:
             elif isinstance(args[0], pd.DataFrame):
                 self.data = self.__class__._clean_data(np.array(args[0]))
             else:
-                raise TypeError("unknown data passed")
+                raise TypeError(f"unknown args passed to {self.__class__.__name__}: {args[0]}")
             
         elif len(args) == len(self.__class__.cols):
             #three args passed, each represents a col
@@ -80,7 +80,7 @@ class Base:
     def _clean_data(cls, data) -> np.ndarray:
         assert isinstance(data, np.ndarray)
         if data.dtype == 'O': 
-            raise TypeError('data must have homogeneous shape')
+            raise TypeError(f'data must have homogeneous shape for {cls.__name__}, given {data.shape}')
         if len(data.shape) == 1:
             data = data.reshape(1, len(data))
         
@@ -257,4 +257,8 @@ class Base:
         return self.__class__(np.cumsum(self.data,axis=0))
 
     def round(self, decimals=0):
-        return self.__class__(self.data.round(decimals))
+        return self.__class__(self.data.round(decimals))
+    
+    def __repr__(self):
+        return f"{self.__class__.__name__}\n{self.to_pandas()}"
+    

pfc_geometry-0.1.2/pfc_geometry.egg-info/PKG-INFO

@@ -0,0 +1,24 @@
+Metadata-Version: 2.1
+Name: pfc-geometry
+Version: 0.1.2
+Summary: A package for handling 3D geometry with a nice interface
+Home-page: https://github.com/PyFlightCoach/geometry
+Author: Thomas David
+Author-email: thomasdavid0@gmail.com
+Description-Content-Type: text/markdown
+License-File: LICENSE
+
+# geometry #
+
+Tools for handling 3D geometry, mostly just adds a nice interface to various geometric enterties. Each geometric entity can also be a vector of geometric entities. Each entity wraps a numpy array with the relevant number of columns labelled according to the cols class property and rows equal to the number of elements in the vector. Attribute access to each column is available and returns a numpy array. 
+
+Where operations are supported between geometric types the size of the output is inferred based on the length of the inputs. Where the two vectors of entities are of the same length, elementwise operations are performed. Where one vector is length one and the other is greater than one then the operation will be performed on every element of the longer vector. 
+
+Magic methods are used extensively and the function of operators are logical for each type. If unsure what the logical option is then check the code where it should be pretty clear. 
+
+Many convenience methods and constructors are available. Documentation is limited but if you need something it has probably already been written so check the code first. 
+
+
+now available on pypi:
+
+pip install pfc-geometry

{pfc_geometry-0.1.0 → pfc_geometry-0.1.2}/pfc_geometry.egg-info/SOURCES.txt

@@ -1,10 +1,9 @@
-COPYING
+LICENSE
 README.md
 setup.cfg
 setup.py
 geometry/__init__.py
 geometry/base.py
-geometry/circle.py
 geometry/coordinate_frame.py
 geometry/gps.py
 geometry/mass.py
@@ -15,4 +14,12 @@ geometry/transformation.py
 pfc_geometry.egg-info/PKG-INFO
 pfc_geometry.egg-info/SOURCES.txt
 pfc_geometry.egg-info/dependency_links.txt
-pfc_geometry.egg-info/top_level.txt
+pfc_geometry.egg-info/requires.txt
+pfc_geometry.egg-info/top_level.txt
+tests/test_base.py
+tests/test_coord.py
+tests/test_gps.py
+tests/test_mass.py
+tests/test_point.py
+tests/test_quaternion.py
+tests/test_transform.py

pfc_geometry-0.1.2/pfc_geometry.egg-info/requires.txt

@@ -0,0 +1,3 @@
+setuptools
+numpy
+pandas

pfc_geometry-0.1.2/setup.cfg

@@ -0,0 +1,20 @@
+[metadata]
+name = pfc_geometry
+author = Thomas David
+author_email = thomasdavid0@gmail.com
+description = A package for handling 3D geometry with a nice interface
+long_description = file: README.md
+long_description_content_type = text/markdown
+version = 0.1.2
+url = https://github.com/PyFlightCoach/geometry
+
+[options]
+install_requires = 
+	setuptools
+	numpy
+	pandas
+
+[egg_info]
+tag_build = 
+tag_date = 0
+

{pfc_geometry-0.1.0 → pfc_geometry-0.1.2}/setup.py

@@ -12,13 +12,5 @@ this program. If not, see <http://www.gnu.org/licenses/>.
 
 from setuptools import setup
 
-setup(
-   name='pfc_geometry',
-   version='0.1.0',
-   description='Tools for playing with 3D geometry',
-   author='Thomas David',
-   author_email='thomasdavid0@gmail.com',
-   url='https://github.com/PyFlightCoach/geometry',
-   download_url = 'https://github.com/PyFlightCoach/geometry/archive/refs/tags/v0.1.0.tar.gz',
-   packages=['geometry'],
-)
+if __name__ == "__main__":
+   setup()

pfc_geometry-0.1.2/tests/test_base.py

@@ -0,0 +1,216 @@
+from geometry.base import Base
+from pytest import mark, approx, raises
+import numpy as np
+import pandas as pd
+
+a_b_c = ["a", "b", "c"]
+class ABC(Base):
+    cols=list("abc")
+
+
+def test_init_nparray():
+    abc = ABC(np.ones((5,3)))
+    np.testing.assert_array_equal(abc.data, np.ones((5,3)))
+
+    abc = ABC(np.ones(3))
+    np.testing.assert_array_equal(abc.data, np.ones(3).reshape((1,3)))
+
+
+
+def test__dprep():
+    np.testing.assert_array_equal(
+        ABC(np.ones((10,3)))._dprep(np.ones(10)), 
+        np.ones((10,3))
+    )
+
+    np.testing.assert_array_equal(
+        ABC(np.ones((10,3)))._dprep(np.ones((10,3))), 
+        np.ones((10,3))
+    )
+
+    with raises(ValueError):
+        ABC(np.ones((10,3)))._dprep(np.ones((5,3)))
+
+    with raises(ValueError):
+        np.testing.assert_array_equal(
+            ABC(np.ones((10,3)))._dprep(np.ones(3)), 
+            np.ones((10,3))
+        )
+
+    np.testing.assert_array_equal(
+        ABC(np.ones((10,3)))._dprep(np.array([1])), 
+        np.ones((10,3))
+    )
+
+    np.testing.assert_array_equal(
+        ABC(np.ones((10,3)))._dprep(1), 
+        np.ones((10,3))
+    )
+
+
+def test_dot():
+    a = ABC(np.random.random((10, 3)))
+    b = ABC(np.random.random((10, 3)))
+
+    c = a.dot(b)
+
+    c_check = np.array([np.dot(_a.data[0], _b.data[0]) for _a, _b in zip(a,b)])
+
+    np.testing.assert_array_almost_equal(c, c_check)
+
+
+def test_init_values():
+    abc = ABC(1,2,3)
+    np.testing.assert_array_equal(abc.data, np.array([[1,2,3]]))
+
+    abc = ABC(*[np.ones(10) for _ in range(3)])
+    np.testing.assert_array_equal(abc.data, np.ones((10,3)))
+
+    with raises(TypeError):
+        abc = ABC([1,2,3], [1,2], [1,2,3,4])
+
+    abc = ABC([1,2], [1,2], [1,2])
+
+    np.testing.assert_array_equal(abc.data, np.array([[1,2], [1,2], [1,2]]).T)
+
+def test_init_kwargs():
+    with raises(TypeError):
+        abc = ABC(1,b=2,c=3)
+
+    abc = ABC(a=1,b=2,c=3)
+    np.testing.assert_array_equal(abc.data, np.array([[1,2,3]]))
+
+    abc = ABC(a=[1,1],b=[1,1],c=[1,1])
+    np.testing.assert_array_equal(abc.data, np.ones((2,3)))
+
+    abc = ABC(data=np.ones((10,3)))
+    np.testing.assert_array_equal(abc.data, np.ones((10,3)))
+
+    with raises(TypeError):
+        ABC(ggg=234342)
+
+def test_init_list_of_self():
+    abc = ABC([ABC(1,2,3), ABC(np.ones((4,3)))])
+    np.testing.assert_array_equal(abc.b, np.array([2,1,1,1,1]))
+
+def test_init_empty():
+    with raises(TypeError):
+        ABC()
+
+def test_init_df():
+    abc = ABC(pd.DataFrame(np.tile([1,2,3], (20,1)), columns=list("abc")))
+    assert all(abc.c == 3)
+
+def test_attr():
+    abc = ABC(np.ones((5,3)))
+    
+    np.testing.assert_array_equal(abc.a, np.ones(5))
+    np.testing.assert_array_equal(abc.b, np.ones(5))
+    np.testing.assert_array_equal(abc.c, np.ones(5))
+        
+    assert dir(abc) == a_b_c
+
+    with raises(AttributeError):
+        d = abc.d
+
+
+def test_getitem():
+    abc = ABC(np.tile(np.linspace(0,4,5), (3,1)).T)
+
+    assert abc[0] == ABC(np.array([[0,0,0]]))
+    assert abc[0][0] == ABC(np.array([[0,0,0]]))
+
+    assert abc[2:][0] == ABC(np.array([[2,2,2]]))
+
+
+
+def test_eq():
+    assert ABC(np.ones((5,3))) == ABC(np.ones((5,3)))
+
+    assert not ABC(np.zeros((5,3))) == ABC(np.ones((5,3)))
+    with raises(TypeError):
+        ABC(np.zeros((5,3))) == ABC(np.zeros((6,3)))
+
+    assert ABC(1,2,4) == ABC(1.0, 2.0, 4.0)
+    
+    assert ABC(np.ones((5,3))) == 1
+
+def test_add():
+    assert ABC(1,2,3) + 1 == ABC(2,3,4)
+    assert 1 + ABC(1,2,3) == ABC(2,3,4)
+    assert ABC(1,2,3) + ABC(1,2,3) == ABC(2,4,6)
+    assert ABC(1,1,1) + np.ones(10) == ABC(np.full((10,3), 2))
+
+def test_mul():
+    assert ABC(1,2,3) * 2 == ABC(2,4,6)
+    assert 2 * ABC(1,2,3) == ABC(2,4,6)
+    assert ABC(1,2,3) * ABC(1,2,3) == ABC(1,4,9)
+    assert ABC(2,2,2) * np.ones(10) == ABC(np.full((10,3), 2))
+
+    a = ABC(1,1,1) * np.array([2])
+    b = np.array([2]) * ABC(1,1,1)
+    assert a.data.shape == b.data.shape
+
+    assert ABC(1,1,1).tile(10) * np.ones(10) == ABC(np.ones((10,3)))
+
+    assert ABC(1,2,3) * np.full(5, 2) == ABC(2,4,6).tile(5)
+
+    assert ABC(1,2,3) * ABC(2,2,2).tile(10) == ABC(2,4, 6).tile(10)
+
+
+def test_div():
+    assert ABC(1,2,3) / 2 == ABC(0.5,1,1.5)
+    assert 6 / ABC(1,2,3) == ABC(6,3,2)
+
+    assert (6 / ABC(1,2,3)).data.shape == (1,3)
+
+
+def test_abs():
+    assert abs(ABC(1,1,1)) == np.sqrt(3)
+    assert abs(ABC(2,2,2)) == np.sqrt(12)
+    np.testing.assert_array_equal(abs(ABC(np.ones((5,3)))), np.full(5, np.sqrt(3)))
+
+
+def test_diff():
+    testarr = ABC(np.tile(np.linspace(0,100,20), (3,1)).T)
+    np.testing.assert_array_almost_equal(
+        testarr.diff(np.full(20,1)).data, 
+        np.tile(np.full(20, 100/19), (3,1)).T
+    ) 
+
+
+def test_full():
+    full =ABC(1,2,3).tile(100)
+
+    assert len(full) == 100
+    assert full[50] == ABC(1,2,3)
+
+
+
+@mark.skip("not expected to work yet")
+def test_single_col():
+    class A(Base):
+        cols = ["a"]
+
+    assert A(1).data == np.array([[1]])
+
+
+    np.testing.assert_array_equal(A([1,2,3]).data, np.array([[1],[2],[3]]))
+
+
+def test_concatenate():
+    a = ABC.full(ABC(1,2,3), 10)
+    b = ABC.full(ABC(4,5,6), 10)
+    c=ABC.concatenate([a,b])
+
+    assert len(c) == len(a) + len(b) 
+    np.testing.assert_array_equal(c.a, np.concatenate([a.a, b.a], axis=0))
+
+
+
+def test_repr__():
+    p = ABC(1,2,3)
+    rpr = p.__repr__().split("\n")
+    assert rpr[0] == "ABC"
+    assert np.all(rpr[1:] == str(p.to_pandas()).split("\n"))
+    

pfc_geometry-0.1.2/tests/test_coord.py

@@ -0,0 +1,32 @@
+from pytest import approx, mark
+from geometry import Coord, Point, Quaternion, P0, PX, PY, PZ
+import numpy as np
+
+
+
+def test_axes():
+    coord = Coord(np.ones((20, 12)))
+    assert coord.origin == Point(np.ones((20,3)))
+
+def test_from_axes():
+    coord = Coord.from_axes(P0(2), PX(1,2), PY(1,2), PZ(1,2))
+    assert coord.data[:,:3] == P0(2)
+
+
+def test_rotation_matrix():
+    np.testing.assert_array_equal(
+        Coord.from_nothing(10).rotation_matrix(),
+        np.tile(np.identity(3).reshape(1,3,3), (10,1,1))
+    )
+
+
+def test_rotate():
+    q = Quaternion.from_euler(Point(0, 0, np.pi/2))
+
+    c = Coord.from_nothing(10)
+
+    rc = c.rotate(q)
+    assert rc.origin == P0()
+    np.testing.assert_almost_equal(rc.x_axis.data, PY(1,10).data)
+    np.testing.assert_almost_equal(rc.y_axis.data, PX(-1,10).data)
+    np.testing.assert_almost_equal(rc.z_axis.data, PZ(1,10).data)

pfc_geometry-0.1.2/tests/test_gps.py

@@ -0,0 +1,53 @@
+from pytest import approx
+from geometry.gps import GPS
+
+import numpy as np
+
+def test_offset():
+    c = GPS( 52.542375, -1.631038)
+    p = GPS( 52.542264, -1.631817)
+    diff = c - p
+    c2 = p.offset(diff)
+
+    diff2 = c2 - p
+
+    np.testing.assert_array_almost_equal(diff.data, diff2.data, 1e-4)
+
+def test_diff():
+    p0 = GPSPosition( 50.206, 4.1941755999999994)
+    p0n = GPSPosition( 50.201, 4.1941755999999994)
+    
+    diff= p0 - p0n # should be south vector
+    pytest.approx(diff.y, 0)
+    assert diff.x >  0
+    
+    p0e= GPSPosition( 50.206, 4.195)
+    diff= p0 - p0e # should be west vector
+    pytest.approx(diff.x, 0)
+    assert diff.y < 0
+
+def test_diff():
+    p0 = GPS( 50.201, 4.195)
+    p0n = GPS( 50.206, 4.195) #directly north of p0
+    
+    diff= p0 - p0n # should be south vector
+    assert diff.y == approx(0)
+    assert diff.x < 0
+    
+    p0e= GPS( 50.201, 4.196)
+    diff= p0 - p0e # should be west vector
+    assert diff.x == approx(0)
+    assert diff.y < 0
+
+
+
+
+def test_sub():
+    centre = GPS( 52.542375, -1.631038)
+    pilot = GPS( 52.542264, -1.631817)
+
+    vec = centre - pilot 
+
+    assert abs(vec)[0] == approx(54.167, 1e-3)
+    assert vec.x[0] == approx(12.3563, 1e-3)
+    assert vec.y[0] == approx(52.7393, 1e-3)