Immutable Set Algorithm
create by Guido van Rossum and first released in 1991, Python's design doctrine emphasizes code readability with its notable purpose of significant whitespace.and later are backed. In January 2019, active Python core developers elected Brett Cannon, Nick Coghlan, Barry Warsaw, Carol Willing and Van Rossum to a five-member" steer Council" to lead the project. Van Rossum shouldered sole responsibility for the project, as the lead developer, until 12 July 2018, when he announced his" permanent vacation" from his responsibility as Python's Benevolent Dictator For life, a title the Python community bestowed upon him to reflect his long-term commitment as the project's chief decision-maker. Python 2.0 was released on 16 October 2000 with many major new features, including a cycle-detecting garbage collector and support for Unicode.
/*
* Copyright (c) 2017 Kotlin Algorithm Club
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
package com.algorithmexamples.datastructures
import com.algorithmexamples.search.BinarySearch
/**
* The class represents set of comparables. The values are stored in a sorted array,
* and the inclusion queries perform binary search, taking logarithmic time in the worst case.
*/
class ImmutableSet<T: Comparable<T>>(values: Array<T>): Set<T> {
private val arr: Array<T> = values.sortedArray()
private val bs = BinarySearch<T>() // TODO: remove
override val size: Int
get() = arr.size
override fun contains(element: T): Boolean {
return bs.perform(arr, element) != -1
}
override fun containsAll(elements: Collection<T>): Boolean {
return elements.all { contains(it) }
}
override fun isEmpty(): Boolean {
return size == 0
}
override fun iterator(): Iterator<T> {
return arr.iterator()
}
}
fun <T: Comparable<T>> immutableSetOf(vararg elements: T): ImmutableSet<out T> {
return ImmutableSet(elements.copyOf())
}
