From 491291ae24fe5901f4be918cbce2d6c21a0ae0e9 Mon Sep 17 00:00:00 2001
From: Charlie Barto <bartoc@umich.edu>
Date: Thu, 27 Mar 2014 00:21:19 -0400
Subject: added usage example for lower bound

---
 lib/pure/algorithm.nim | 5 +++++
 1 file changed, 5 insertions(+)

(limited to 'lib')

diff --git a/lib/pure/algorithm.nim b/lib/pure/algorithm.nim
index fb0ba5355..49d1ac972 100644
--- a/lib/pure/algorithm.nim
+++ b/lib/pure/algorithm.nim
@@ -63,6 +63,11 @@ proc lowerBound*[T](a: openarray[T], key: T, cmp: proc(x,y: T): int {.closure.})
   ##
   ## `cmp` is the comparator function to use, the expected return values are the same as
   ## that of system.cmp
+  ## 
+  ## example:
+  ## `var arr = @[1,2,3,5,6,7,8,9]`
+  ## `arr.insert(4, arr.lowerBound(4))`
+  ## after running the above arr is `[1,2,3,4,5,6,7,8,9]`
   result = a.low
   var pos = result
   var count, step: int
-- 
cgit 1.4.1-2-gfad0