lib: rename `standard` as `core`

[nit.git] / lib / standard / collection / range.nit

diff --git a/lib/standard/collection/range.nit b/lib/standard/collection/range.nit
deleted file mode 100644 (file)
index a79f218..0000000
--- a/lib/standard/collection/range.nit
+++ /dev/null
@@ -1,103 +0,0 @@
-# This file is part of NIT ( http://www.nitlanguage.org ).
-#
-# Copyright 2004-2008 Jean Privat <jean@pryen.org>
-#
-# This file is free software, which comes along with NIT.  This software is
-# distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
-# without  even  the implied warranty of  MERCHANTABILITY or  FITNESS FOR A 
-# PARTICULAR PURPOSE.  You can modify it is you want,  provided this header
-# is kept unaltered, and a notification of the changes is added.
-# You  are  allowed  to  redistribute it and sell it, alone or is a part of
-# another product.
-
-# Module for range of discrete objects.
-module range
-
-import abstract_collection
-
-# Range of discrete objects.
-class Range[E: Discrete]
-       super Collection[E]
-
-       redef var first: E
-
-       # Get the last element.
-       var last: E
-
-       # Get the element after the last one.
-       var after: E
-
-       redef fun has(item) do return item >= first and item <= last
-
-       redef fun has_only(item) do return first == item and item == last or is_empty
-
-       redef fun count(item)
-       do
-               if has(item) then
-                       return 1
-               else
-                       return 0
-               end
-       end
-
-       redef fun iterator do return new IteratorRange[E](self)
-
-       redef fun length
-       do
-               var nb = first.distance(after)
-               if nb > 0 then
-                       return nb
-               else
-                       return 0
-               end
-       end
-
-       redef fun is_empty do return first >= after
-
-       # Create a range [`from`, `to`].
-       # The syntax `[from..to[` is equivalent.
-       init(from: E, to: E)
-       do
-               first = from
-               last = to
-               after = to.successor(1)
-       end
-
-       # Create a range [`from`, `to`[.
-       # The syntax `[from..to[` is equivalent.
-       init without_last(from: E, to: E)
-       do
-               first = from
-               last = to.predecessor(1)
-               after = to
-       end
-end
-
-private class IteratorRange[E: Discrete]
-       # Iterator on ranges.
-       super Iterator[E]
-       private var range: Range[E]
-       redef var item is noinit
-
-       redef fun is_ok do return _item < _range.after
-       
-       redef fun next do _item = _item.successor(1)
-       
-       init
-       do
-               _item = _range.first
-       end
-end
-
-redef class Int
-       # Returns the range from 0 to `self-1`, is used to do:
-       #
-       #    var s = new Array[String]
-       #    for i in 3.times do s.add "cool"
-       #    assert s.join(" ") == "cool cool cool"
-       #
-       #    s.clear
-       #    for i in 10.times do s.add(i.to_s)
-       #    assert s.to_s == "0123456789"
-       fun times: Range[Int] do return [0 .. self[
-end