Sets

class edelweissmeshfree.sets.cellset.CellSet(name, elements)

A basic element set. It has a label, and a list containing unique cells.

Parameters:

• name (str) – The unique label for this element set.

• cells – The list of cells.

• elements (list)

Methods

append(object, /)	Append object to the end of the list.
clear(/)	Remove all items from list.
copy(/)	Return a shallow copy of the list.
count(value, /)	Return number of occurrences of value.
extend(iterable, /)	Extend list by appending elements from the iterable.
index(value[, start, stop])	Return first index of value.
insert(index, object, /)	Insert object before index.
pop([index])	Remove and return item at index (default last).
remove(value, /)	Remove first occurrence of value.
reverse(/)	Reverse IN PLACE.
sort(*[, key, reverse])	Sort the list in ascending order and return None.

extractNodeSet

class edelweissmeshfree.sets.cellelementset.CellElementSet(name, cellElements)

A basic element set. It has a label, and a list containing unique cell elements.

Parameters:

• name (str) – The unique label for this element set.

• cellElements (list) – A list of cell elements.

Methods

append(object, /)	Append object to the end of the list.
clear(/)	Remove all items from list.
copy(/)	Return a shallow copy of the list.
count(value, /)	Return number of occurrences of value.
extend(iterable, /)	Extend list by appending elements from the iterable.
index(value[, start, stop])	Return first index of value.
insert(index, object, /)	Insert object before index.
pop([index])	Remove and return item at index (default last).
remove(value, /)	Remove first occurrence of value.
reverse(/)	Reverse IN PLACE.
sort(*[, key, reverse])	Sort the list in ascending order and return None.

extractNodeSet

class edelweissmeshfree.sets.materialpointset.MaterialPointSet(name, mps)

A basic node set. It has a label, and a list containing the unique nodes.

Parameters:

• label – The unique label for this element set.

• nodes – A list of nodes.

• name (str)

• mps (list)

Methods

add(object, /)	Add an element to a set.
clear(/)	Remove all elements from this set.
copy(/)	Return a shallow copy of a set.
difference(*others)	Return a new set with elements in the set that are not in the others.
difference_update(*others)	Update the set, removing elements found in others.
discard(object, /)	Remove an element from a set if it is a member.
intersection(*others)	Return a new set with elements common to the set and all others.
intersection_update(*others)	Update the set, keeping only elements found in it and all others.
isdisjoint(other, /)	Return True if two sets have a null intersection.
issubset(other, /)	Report whether another set contains this set.
issuperset(other, /)	Report whether this set contains another set.
pop(/)	Remove and return an arbitrary set element.
remove(object, /)	Remove an element from a set; it must be a member.
symmetric_difference(other, /)	Return a new set with elements in either the set or other but not both.
symmetric_difference_update(other, /)	Update the set, keeping only elements found in either set, but not in both.
union(*others)	Return a new set with elements from the set and all others.
update(*others)	Update the set, adding elements from all others.

class edelweissmeshfree.sets.particleset.ParticleSet(label, particles)

A basic particle set. It has a label, and a list containing the unique particles.

Parameters:

• label (str) – The unique label for this element set.

• particles (list[BaseParticle]) – A list of particles.

Methods

add(item_s)	Add an item or an iterable of items to the OrderedSet
checkObjectType(obj)	Checks if the object type is allowed in the OrderedSet
clear()
forceIter(item_s)	Return an iterator object for item_s even if item_s itself is not iterable
get(k[,d])
items()
keys()
pop(k[,d])	If key is not found, d is returned if given, otherwise KeyError is raised.
popitem()	as a 2-tuple; but raise KeyError if D is empty.
setdefault(k[,d])
update([E, ]**F)	If E present and has a .keys() method, does: for k in E.keys(): D[k] = E[k] If E present and lacks .keys() method, does: for (k, v) in E: D[k] = v In either case, this is followed by: for k, v in F.items(): D[k] = v
values()

copy
fromkeys