summaryrefslogtreecommitdiffstats
path: root/src/libavoid
diff options
context:
space:
mode:
Diffstat (limited to 'src/libavoid')
-rw-r--r--src/libavoid/makepath.cpp2
-rw-r--r--src/libavoid/orthogonal.cpp4
2 files changed, 3 insertions, 3 deletions
diff --git a/src/libavoid/makepath.cpp b/src/libavoid/makepath.cpp
index 4e15dbca9..774e0d7f5 100644
--- a/src/libavoid/makepath.cpp
+++ b/src/libavoid/makepath.cpp
@@ -82,7 +82,7 @@ class ANode
// it back into a heap) when getting the next node to examine. This way we
// get better complexity -- logarithmic pushs and pops to the heap.
//
-bool operator<(const ANode &a, const ANode &b)
+static bool operator<(const ANode &a, const ANode &b)
{
if (a.f != b.f)
{
diff --git a/src/libavoid/orthogonal.cpp b/src/libavoid/orthogonal.cpp
index e0a30b246..772fc9668 100644
--- a/src/libavoid/orthogonal.cpp
+++ b/src/libavoid/orthogonal.cpp
@@ -204,7 +204,7 @@ class ShiftSegment
};
typedef std::list<ShiftSegment> ShiftSegmentList;
-bool cmpShiftSegment(const ShiftSegment& u, const ShiftSegment& v)
+static bool cmpShiftSegment(const ShiftSegment& u, const ShiftSegment& v)
{
return u < v;
}
@@ -488,7 +488,7 @@ Event **events;
// Used for quicksort. Must return <0, 0, or >0.
-int compare_events(const void *a, const void *b)
+static int compare_events(const void *a, const void *b)
{
Event *ea = *(Event**) a;
Event *eb = *(Event**) b;