18.12 Finite combinatorial classes

Module: sage.combinat.finite_class

Finite combinatorial classes

Module-level Functions

FiniteCombinatorialClass( l)

Returns the combinatorial class with elements in l.

sage: F = FiniteCombinatorialClass([1,2,3])
sage: F.list()
[1, 2, 3]
sage: F.count()
3
sage: F.random_element()
1
sage: F.first()
1
sage: F.last()
3

Class: FiniteCombinatorialClass_l

class FiniteCombinatorialClass_l
FiniteCombinatorialClass_l( self, l)

TESTS:

sage: F = FiniteCombinatorialClass([1,2,3])
sage: F == loads(dumps(F))
True

Functions: count,$ \,$ list

count( self)

TESTS:

sage: F = FiniteCombinatorialClass([1,2,3])
sage: F.count()
3

list( self)

TESTS:

sage: F = FiniteCombinatorialClass([1,2,3])
sage: F.list()
[1, 2, 3]

Special Functions: __contains__,$ \,$ __init__,$ \,$ __repr__

__contains__( self, x)

TESTS:

sage: F = FiniteCombinatorialClass([1,2,3])
sage: 1 in F
True
sage: 2 in F
True
sage: 4 in F
False
sage: ZZ in F
False

__repr__( self)

TESTS:

sage: F = FiniteCombinatorialClass([1,2,3])
sage: repr(F)
'Combinatorial class with elements in [1, 2, 3]'

See About this document... for information on suggesting changes.