#11292: Allow broader inputs to lattice meet and join
-----------------------------+----------------------------------------------
   Reporter:  rbeezer        |          Owner:  sage-combinat
       Type:  enhancement    |         Status:  new          
   Priority:  minor          |      Milestone:  sage-4.7.1   
  Component:  combinatorics  |       Keywords:               
Work_issues:                 |       Upstream:  N/A          
   Reviewer:                 |         Author:               
     Merged:                 |   Dependencies:               
-----------------------------+----------------------------------------------
 The meet and join methods of a lattice should be more robust about their
 inputs, like the is_lequal method is.

 {{{
 sage: P = Posets.IntegerCompositions(4)
 sage: L = LatticePoset(P)
 sage: L.list()
 [[4], [3, 1], [2, 2], [2, 1, 1], [1, 3], [1, 2, 1], [1, 1, 2], [1, 1, 1,
 1]]
 sage: L.meet([3,1], [1,2,1])
 ---------------------------------------------------------------------------
 AttributeError                            Traceback (most recent call
 last)
 <snip>
 AttributeError: 'list' object has no attribute 'vertex'
 sage: L.is_lequal([3,1], [1,2,1])
 True
 }}}

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11292>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica, 
and MATLAB

-- 
You received this message because you are subscribed to the Google Groups 
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to 
[email protected].
For more options, visit this group at 
http://groups.google.com/group/sage-trac?hl=en.

Reply via email to