[med-svn] [Git][med-team/nim-lapper][upstream] New upstream version 0.1.8

[Nilesh Patra (@nilesh)]

Nilesh Patra pushed to branch upstream at Debian Med / nim-lapper


Commits:
12f4a432 by Nilesh Patra at 2025-09-26T00:42:30+05:30
New upstream version 0.1.8
- - - - -


3 changed files:

- + CITATION.cff
- lapper.nimble
- src/lapper.nim


Changes:

=====================================
CITATION.cff
=====================================
@@ -0,0 +1,12 @@
+cff-version: 1.2.0
+message: "If you use this software, please cite it as below."
+authors:
+  - 
+    family-names: Pedersen
+    given-names: Brent S.
+    email: bpederse at gmail.com
+
+title: "nim-lapper: fast, simple interval overlapping"
+version: 0.1.7
+date-released: 2021-01-01
+license: MIT


=====================================
lapper.nimble
=====================================
@@ -1,6 +1,6 @@
 # Package
 
-version       = "0.1.7"
+version       = "0.1.8"
 author        = "Brent Pedersen"
 description   = "fast, simple interval overlaps with binary search"
 license       = "MIT"


=====================================
src/lapper.nim
=====================================
@@ -129,7 +129,6 @@ proc empty*[T:Interval](L:Lapper[T]): bool {.inline.} =
 iterator find*[T:Interval](L:var Lapper[T], start:int, stop:int): T =
   ## fill ivs with all intervals in L that overlap start .. stop.
   #if ivs.len != 0: ivs.set_len(0)
-  shallow(L.intervals)
   let off = lowerBound(L.intervals, start - L.max_len)
   for i in off..L.intervals.high:
     let x = L.intervals[i]
@@ -140,7 +139,6 @@ iterator find*[T:Interval](L:var Lapper[T], start:int, stop:int): T =
 proc find*[T:Interval](L:var Lapper[T], start:int, stop:int, ivs:var seq[T]): bool =
   ## fill ivs with all intervals in L that overlap start .. stop.
   #if ivs.len != 0: ivs.set_len(0)
-  shallow(L.intervals)
   let off = lowerBound(L.intervals, start - L.max_len)
   var n = 0
   for i in off..L.intervals.high:
@@ -158,7 +156,6 @@ proc find*[T:Interval](L:var Lapper[T], start:int, stop:int, ivs:var seq[T]): bo
 
 proc count*[T:Interval](L:var Lapper[T], start:int, stop:int): int =
   ## fill ivs with all intervals in L that overlap start .. stop.
-  shallow(L.intervals)
   let off = lowerBound(L.intervals, start - L.max_len)
   for i in off..L.intervals.high:
     let x = L.intervals[i]



View it on GitLab: https://salsa.debian.org/med-team/nim-lapper/-/commit/12f4a4323797bd77f3a99c4a889b2a0056235d73

-- 
View it on GitLab: https://salsa.debian.org/med-team/nim-lapper/-/commit/12f4a4323797bd77f3a99c4a889b2a0056235d73
You're receiving this email because of your account on salsa.debian.org.


-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://alioth-lists.debian.net/pipermail/debian-med-commit/attachments/20250925/a59e1346/attachment-0001.htm>