fun main(args: Array<String>) {
    val hashSet = HashSet<Int>()
    val treeSet = TreeSet<Int>()

    var timeStart = 0L
    var timeEnd = 0L

    timeStart = System.currentTimeMillis()
    for (i in 0..300_000_000) {
        hashSet.add(i % 300_000)
    }
    timeEnd = System.currentTimeMillis()
    println("HASH ADD: ${(timeEnd - timeStart) / 1000f} sec.")

    timeStart = System.currentTimeMillis()
    for (i in 0..300_000_000) {
        hashSet.contains(i % 300_000)
    }
    timeEnd = System.currentTimeMillis()
    println("HASH FIND: ${(timeEnd - timeStart) / 1000f} sec.")

    timeStart = System.currentTimeMillis()
    for (i in 3_000..200_000_000)
        hashSet.contains(i)
    timeEnd = System.currentTimeMillis()
    println("HASH FIND RANGE: ${(timeEnd - timeStart) / 1000f} sec.")

    timeStart = System.currentTimeMillis()
    for (i in 0..300_000_000) {
        hashSet.remove(i % 300_000)
    }
    timeEnd = System.currentTimeMillis()
    println("HASH DELETE: ${(timeEnd - timeStart) / 1000f} sec.")


    timeStart = System.currentTimeMillis()
    for (i in 0..300_000_000) {
        treeSet.add(i % 300_000)
    }
    timeEnd = System.currentTimeMillis()
    println("TREE ADD: ${(timeEnd - timeStart) / 1000f} sec.")

    timeStart = System.currentTimeMillis()
    for (i in 0..300_000_000) {
        treeSet.contains(i % 300_000)
    }
    timeEnd = System.currentTimeMillis()
    println("TREE FIND: ${(timeEnd - timeStart) / 1000f} sec.")

    timeStart = System.currentTimeMillis()
    treeSet.subSet(3_000, 200_000_000)
    timeEnd = System.currentTimeMillis()
    println("TREE FIND RANGE: ${(timeEnd - timeStart) / 1000f} sec.")

    timeStart = System.currentTimeMillis()
    for (i in 0..300_000_000) {
        treeSet.remove(i % 300_000)
    }
    timeEnd = System.currentTimeMillis()
    println("TREE DELETE: ${(timeEnd - timeStart) / 1000f} sec.")

}