AbstractSortedSet
Object Hierarchy:
Gee.AbstractSortedSet
Gee.AbstractSortedSet
Gee.AbstractSortedSet
Gee.AbstractSet
Gee.AbstractSet
Gee.AbstractSet->Gee.AbstractSortedSet
Gee.AbstractCollection
Gee.AbstractCollection
Gee.AbstractCollection->Gee.AbstractSet
GLib.Object
GLib.Object
GLib.Object->Gee.AbstractCollection
Gee.Traversable
Gee.Traversable
Gee.Traversable->Gee.AbstractCollection
Gee.Iterable
Gee.Iterable
Gee.Iterable->Gee.AbstractCollection
Gee.Collection
Gee.Collection
Gee.Collection->Gee.AbstractCollection
Gee.Set
Gee.Set
Gee.Set->Gee.AbstractSet
Gee.SortedSet
Gee.SortedSet
Gee.SortedSet->Gee.AbstractSortedSet
Description:
public abstract class AbstractSortedSet <
G > :
AbstractSet <
G >,
SortedSet <
G >
Skeletal implementation of the SortedSet interface.
Contains common code shared by all set implementations.
See also:
TreeSet
Content:
Properties:
Creation methods:
Methods:
public abstract G ceil (G element)
Returns the element which is higher or equal then the specified
element.
public abstract G first ()
Returns the first element of the sorted set. Set must not be empty.
public abstract G floor (G element)
Returns the element which is lower or equal then the specified
element.
public abstract SortedSet <G > head_set (G before)
Returns the sub-set of this sorted set containing elements strictly
lower than the specified element.
public abstract G higher (G element)
Returns the element which is strictly higher than the specified
element.
public abstract Iterator <G >? iterator_at (G element)
Returns a
BidirIterator initially pointed at the specified element.
public abstract G last ()
Returns the last element of the sorted set. Set must not be empty.
public abstract G lower (G element)
Returns the element which is strictly lower than the specified
element.
public abstract SortedSet <G > sub_set (G from, G to)
Returns the right-open sub-set of this sorted set, thus containing
elements equal or higher than the specified from
element, and stricly lower than the specified to
element.
public abstract SortedSet <G > tail_set (G after)
Returns the sub-set of this sorted set containing elements equal or
higher than the specified element.
Inherited Members:
All known members inherited from class Gee.AbstractSet
All known members inherited from class Gee.AbstractCollection
All known members inherited from class GLib.Object
@get
@new
@ref
@set
add_toggle_ref
add_weak_pointer
bind_property
connect
constructed
disconnect
dispose
dup_data
dup_qdata
force_floating
freeze_notify
get_class
get_data
get_property
get_qdata
get_type
getv
interface_find_property
interface_install_property
interface_list_properties
is_floating
new_valist
new_with_properties
newv
notify
notify_property
ref_count
ref_sink
remove_toggle_ref
remove_weak_pointer
replace_data
replace_qdata
set_data
set_data_full
set_property
set_qdata
set_qdata_full
set_valist
setv
steal_data
steal_qdata
thaw_notify
unref
watch_closure
weak_ref
weak_unref
All known members inherited from interface Gee.SortedSet
All known members inherited from interface Gee.Set
All known members inherited from interface Gee.Traversable
All known members inherited from interface Gee.Iterable
All known members inherited from interface Gee.Collection