enigma.StringSet Class Reference

Inheritance diagram for enigma.StringSet:

Public Member Functions
def	iterator (self)
def	__iter__ (self)
def	__nonzero__ (self)
def	__bool__ (self)
def	__len__ (self)
def	append (self, x)
def	__contains__ (self, x)
def	__getitem__ (self, i)
def	add (self, x)
def	discard (self, x)
def	__init__ (self, *args)
def	empty (self)
def	size (self)
def	clear (self)
def	swap (self, v)
def	count (self, x)
def	begin (self)
def	end (self)
def	rbegin (self)
def	rend (self)
def	erase (self, *args)
def	find (self, x)
def	lower_bound (self, x)
def	upper_bound (self, x)
def	equal_range (self, x)
def	insert (self, __x)

Static Public Attributes
	thisown = _swig_property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc='The membership flag')
	iterator
	append
	add
	discard
	empty
	size
	clear
	swap
	count
	begin
	end
	rbegin
	rend
	erase
	find
	lower_bound
	upper_bound
	equal_range
	insert

Detailed Description

Proxy of C++ std::set<(std::string)> class.

Constructor & Destructor Documentation

__init__()

def enigma.StringSet.__init__	(		self,
		*	args
	)

__init__(std::set<(std::string)> self, std::less< std::string > const & arg2) -> StringSet
__init__(std::set<(std::string)> self) -> StringSet
__init__(std::set<(std::string)> self, StringSet arg2) -> StringSet

Member Function Documentation

__bool__()

def enigma.StringSet.__bool__

(

self

)

__bool__(StringSet self) -> bool

__contains__()

def enigma.StringSet.__contains__	(		self,
			x
	)

__contains__(StringSet self, std::set< std::string >::value_type x) -> bool

__getitem__()

def enigma.StringSet.__getitem__	(		self,
			i
	)

__getitem__(StringSet self, std::set< std::string >::difference_type i) -> std::set< std::string >::value_type

__iter__()

def enigma.StringSet.__iter__

(

self

)

__len__()

def enigma.StringSet.__len__

(

self

)

__len__(StringSet self) -> std::set< std::string >::size_type

__nonzero__()

def enigma.StringSet.__nonzero__

(

self

)

__nonzero__(StringSet self) -> bool

add()

def enigma.StringSet.add	(		self,
			x
	)

add(StringSet self, std::set< std::string >::value_type x)

append()

def enigma.StringSet.append	(		self,
			x
	)

append(StringSet self, std::set< std::string >::value_type x)

begin()

def enigma.StringSet.begin

(

self

)

begin(StringSet self) -> std::set< std::string >::iterator

clear()

def enigma.StringSet.clear

(

self

)

clear(StringSet self)

count()

def enigma.StringSet.count	(		self,
			x
	)

count(StringSet self, std::set< std::string >::key_type const & x) -> std::set< std::string >::size_type

discard()

def enigma.StringSet.discard	(		self,
			x
	)

discard(StringSet self, std::set< std::string >::value_type x)

empty()

def enigma.StringSet.empty

(

self

)

empty(StringSet self) -> bool

end()

def enigma.StringSet.end

(

self

)

end(StringSet self) -> std::set< std::string >::iterator

equal_range()

def enigma.StringSet.equal_range	(		self,
			x
	)

equal_range(StringSet self, std::set< std::string >::key_type const & x) -> std::pair< std::set< std::string >::iterator,std::set< std::string >::iterator >

erase()

def enigma.StringSet.erase	(		self,
		*	args
	)

erase(StringSet self, std::set< std::string >::key_type const & x) -> std::set< std::string >::size_type
erase(StringSet self, std::set< std::string >::iterator pos)
erase(StringSet self, std::set< std::string >::iterator first, std::set< std::string >::iterator last)

find()

def enigma.StringSet.find	(		self,
			x
	)

find(StringSet self, std::set< std::string >::key_type const & x) -> std::set< std::string >::iterator

insert()

def enigma.StringSet.insert	(		self,
			__x
	)

insert(StringSet self, std::set< std::string >::value_type const & __x) -> std::pair< std::set< std::string >::iterator,bool >

iterator()

def enigma.StringSet.iterator

(

self

)

iterator(StringSet self) -> SwigPyIterator

lower_bound()

def enigma.StringSet.lower_bound	(		self,
			x
	)

lower_bound(StringSet self, std::set< std::string >::key_type const & x) -> std::set< std::string >::iterator

rbegin()

def enigma.StringSet.rbegin

(

self

)

rbegin(StringSet self) -> std::set< std::string >::reverse_iterator

rend()

def enigma.StringSet.rend

(

self

)

rend(StringSet self) -> std::set< std::string >::reverse_iterator

size()

def enigma.StringSet.size

(

self

)

size(StringSet self) -> std::set< std::string >::size_type

swap()

def enigma.StringSet.swap	(		self,
			v
	)

swap(StringSet self, StringSet v)

upper_bound()

def enigma.StringSet.upper_bound	(		self,
			x
	)

upper_bound(StringSet self, std::set< std::string >::key_type const & x) -> std::set< std::string >::iterator

Member Data Documentation

add

enigma.StringSet.add

static

append

enigma.StringSet.append

static

begin

enigma.StringSet.begin

static

clear

enigma.StringSet.clear

static

count

enigma.StringSet.count

static

discard

enigma.StringSet.discard

static

empty

enigma.StringSet.empty

static

end

enigma.StringSet.end

static

equal_range

enigma.StringSet.equal_range

static

erase

enigma.StringSet.erase

static

find

enigma.StringSet.find

static

insert

enigma.StringSet.insert

static

iterator

enigma.StringSet.iterator

static

lower_bound

enigma.StringSet.lower_bound

static

rbegin

enigma.StringSet.rbegin

static

rend

enigma.StringSet.rend

static

size

enigma.StringSet.size

static

swap

enigma.StringSet.swap

static

thisown

enigma.StringSet.thisown = _swig_property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc='The membership flag')

static

upper_bound

enigma.StringSet.upper_bound

static

---

The documentation for this class was generated from the following file:

• usr/lib/enigma2/python/enigma.py