-
The algorithms that form the core value of GEOS are developed in Java in the JTS library. C++ developers will find this annoying, but:
- This is just history, JTS was written first and GEOS was a slavish port.
- Being memory managed, JTS is an easier language to prototype in.
- Having various visual tooling, JTS is an easier platform to debug spatial algorithms in.
- Being Java, JTS has less language legacy than GEOS, which was originally ported when STL was not part of the standard, and therefore reflects a mix of styles and eras.
-
Ideally, new algorithms are implemented in JTS and then ported to GEOS.
- Sometimes GEOS gains new functionality; ideally this is backported to JTS
-
Performance optimizations in GEOS can backport to JTS.
- Short circuits, indexes, other non-language optimizations, should be ticketed in JTS when they are added to GEOS.
-
Don't rename things! It makes it harder to port updates and fixes.
- Class names
- Method names
- Variable names
- Class members
- If class members are shadowed by local variables, use the
m_
prefix convention for the member.
- If class members are shadowed by local variables, use the
C++ is a large, complex language, with many patterns that have evolved over the years. The GEOS codebase has also evolved over the years, but parts still exhibit obsolete language and project patterns. When porting or adding code, follow the style of the most recently written code (use the commit history to find this).
In general, we follow the C++ Core Guidelines. The following summarizes some of the key patterns used in GEOS.
- Frequently objects are only used local to a method and not returned to the caller.
- In such cases, avoid lifecycle issues entirely by instantiating on the local stack.
MyObj foo = new MyObj("bar");
MyObj foo("bar");
- Long-lived members of objects that are passed around should be held using std::unique_ptr<>.
private MyMember foo = new MyMember();
private:
std::unique_ptr<MyMember> foo;
public:
MyMember()
: foo(new MyMember())
{}
- You can pass pointers to the object to other methods using
std::unique_ptr<>.get()
.
- Prefer T* over T& when “no argument” is a valid option
-
Heap allocations (objects created using
new
) are more expensive than stack allocations, but they can show up in batchs in JTS in places where structures are built, like index trees, or graphs. -
To both lower the overhead of heap allocations, and to manage the life-cycle of the objects, we recommend storing small objects in an appropriate "double-ended queue", like std::deque<>.
-
The implementation of
edgegraph
is an example.-
The
edgegraph
consists of a structure of manyHalfEdge
objects (two for each edge!), created in theEdgeGraph::createEdge()
method and stored in astd::deque<>
. -
The
std::deque<>
provides two benefits:- It lowers the number of heap allocations, because it allocates larger blocks of space to store multiple
HalfEdge
objects. - It handles the lifecycle of the
HalfEdge
objects that make up theEdgeGraph
, because when theEdgeGraph
is deallocated, thestd::deque<>
and all its contents are also automatically deallocated.
- It lowers the number of heap allocations, because it allocates larger blocks of space to store multiple
-