draft of base.c

code/base/text.c

@@ -2,112 +2,10 @@
 #	include "text.h"
 #endif
 
-////////////////////////////////
-//~ rjf: Text 2D Coordinate/Range Functions
-
-internal TxtPt
-txt_pt(S64 line, S64 column)
-{
-  TxtPt p = {0};
-  p.line = line;
-  p.column = column;
-  return p;
-}
-
-internal B32
-txt_pt_match(TxtPt a, TxtPt b)
-{
-  return a.line == b.line && a.column == b.column;
-}
-
-internal B32
-txt_pt_less_than(TxtPt a, TxtPt b)
-{
-  B32 result = 0;
-  if(a.line < b.line)
-  {
-    result = 1;
-  }
-  else if(a.line == b.line)
-  {
-    result = a.column < b.column;
-  }
-  return result;
-}
-
-internal TxtPt
-txt_pt_min(TxtPt a, TxtPt b)
-{
-  TxtPt result = b;
-  if(txt_pt_less_than(a, b))
-  {
-    result = a;
-  }
-  return result;
-}
-
-internal TxtPt
-txt_pt_max(TxtPt a, TxtPt b)
-{
-  TxtPt result = a;
-  if(txt_pt_less_than(a, b))
-  {
-    result = b;
-  }
-  return result;
-}
-
-internal TxtRng
-txt_rng(TxtPt min, TxtPt max)
-{
-  TxtRng range = {0};
-  if(txt_pt_less_than(min, max))
-  {
-    range.min = min;
-    range.max = max;
-  }
-  else
-  {
-    range.min = max;
-    range.max = min;
-  }
-  return range;
-}
-
-internal TxtRng
-txt_rng_intersect(TxtRng a, TxtRng b)
-{
-  TxtRng result = {0};
-  result.min = txt_pt_max(a.min, b.min);
-  result.max = txt_pt_min(a.max, b.max);
-  if(txt_pt_less_than(result.max, result.min))
-  {
-    MemoryZeroStruct(&result);
-  }
-  return result;
-}
-
-internal TxtRng
-txt_rng_union(TxtRng a, TxtRng b)
-{
-  TxtRng result = {0};
-  result.min = txt_pt_min(a.min, b.min);
-  result.max = txt_pt_max(a.max, b.max);
-  return result;
-}
-
-internal B32
-txt_rng_contains(TxtRng r, TxtPt pt)
-{
-  B32 result = ((txt_pt_less_than(r.min, pt) || txt_pt_match(r.min, pt)) &&
-                txt_pt_less_than(pt, r.max));
-  return result;
-}
-
 ////////////////////////////////
 //~ rjf: Text Path Helpers
 
-internal String8TxtPtPair
+String8TxtPtPair
 str8_txt_pt_pair_from_string(String8 string)
 {
 	String8TxtPtPair pair = {0};