Coverage for local/lib/python2.7/site-packages/sage/combinat/finite_class.py : 39%
Hot-keys on this page
r m x p toggle line displays
j k next/prev highlighted chunk
0 (zero) top of page
1 (one) first highlighted chunk
|
r""" Finite combinatorial classes """ #***************************************************************************** # Copyright (C) 2007 Mike Hansen <mhansen@gmail.com>, # # Distributed under the terms of the GNU General Public License (GPL) # # This code is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # The full text of the GPL is available at: # # http://www.gnu.org/licenses/ #***************************************************************************** from __future__ import absolute_import from six.moves import range
from .combinat import CombinatorialClass from sage.misc.superseded import deprecation
class FiniteCombinatorialClass(CombinatorialClass): """ This class is deprecated, and will disappear as soon as all derived classes in Sage's library will have been fixed. Please derive directly from Parent and use the category :class:`FiniteEnumeratedSets`.
INPUT:
- l a list or iterable
Returns l, wrapped as a combinatorial class
EXAMPLES::
sage: F = FiniteCombinatorialClass([1,2,3]) doctest:warning...: DeprecationWarning: Please use FiniteEnumeratedSets instead. See http://trac.sagemath.org/13552 for details. sage: F.list() [1, 2, 3] sage: F.cardinality() 3 sage: F.random_element() 1 sage: F.first() 1 sage: F.last() 3 """ def __init__(self, l): """ TESTS::
sage: F = FiniteCombinatorialClass([1,2,3]) doctest:warning...: DeprecationWarning: Please use FiniteEnumeratedSets instead. See http://trac.sagemath.org/13552 for details. sage: F == loads(dumps(F)) True """
def _element_constructor_(self, x): """ EXAMPLES::
sage: F = FiniteCombinatorialClass([1,2,3]) doctest:warning...: DeprecationWarning: Please use FiniteEnumeratedSets instead. See http://trac.sagemath.org/13552 for details. sage: F._element_constructor_(1) 1 sage: F(1) 1 """
def __repr__(self): """ TESTS::
sage: F = FiniteCombinatorialClass([1,2,3]) doctest:warning...: DeprecationWarning: Please use FiniteEnumeratedSets instead. See http://trac.sagemath.org/13552 for details. sage: repr(F) 'Combinatorial class with elements in [1, 2, 3]' """
def __contains__(self, x): """ EXAMPLES::
sage: F = FiniteCombinatorialClass([1,2,3]) doctest:warning...: DeprecationWarning: Please use FiniteEnumeratedSets instead. See http://trac.sagemath.org/13552 for details. sage: 1 in F True sage: 2 in F True sage: 4 in F False sage: ZZ in F False """
def list(self): """ TESTS::
sage: F = FiniteCombinatorialClass([1,2,3]) doctest:warning...: DeprecationWarning: Please use FiniteEnumeratedSets instead. See http://trac.sagemath.org/13552 for details. sage: F.list() [1, 2, 3] """
def cardinality(self): """ EXAMPLES::
sage: F = FiniteCombinatorialClass([1,2,3]) doctest:warning...: DeprecationWarning: Please use FiniteEnumeratedSets instead. See http://trac.sagemath.org/13552 for details. sage: F.cardinality() 3 """
def __getitem__(self, i): # TODO: optimize """ EXAMPLES::
sage: F = FiniteCombinatorialClass(["a", "b", "c"]) doctest:warning...: DeprecationWarning: Please use FiniteEnumeratedSets instead. See http://trac.sagemath.org/13552 for details. sage: F[2] 'c' """
def keys(self): """ EXAMPLES::
sage: F = FiniteCombinatorialClass([1,2,3]) doctest:warning...: DeprecationWarning: Please use FiniteEnumeratedSets instead. See http://trac.sagemath.org/13552 for details. sage: F.keys() [0, 1, 2] """
# Backward compatibility pointer # Needed for unpickling. FiniteCombinatorialClass_l = FiniteCombinatorialClass |