All relations of a poset

[rbeezer]

This adds methods for posets to create an iterator and a list, for all the relations of the poset (not just the cover relations).

Apply:

1. attachment: trac_11293-all-relations-poset-v2.patch

CC: @saliola

Component: combinatorics

Keywords: days30

Author: Rob Beezer, Franco Saliola

Reviewer: Franco Saliola, Rob Beezer

Merged: sage-4.7.1.alpha1

Issue created by migration from https://trac.sagemath.org/ticket/11293

[rbeezer]

Attachment: trac_11293-all-relations-poset.patch.gz

[rbeezer]

Author: Rob Beezer

[rbeezer]

Description changed:

--- 
+++ 
@@ -1 +1,5 @@
 This adds methods for posets to create an iterator and a list, for all the relations of the poset (not just the cover relations).
+
+**Apply:**
+1. [attachment: trac_11293-all-relations-poset.patch](https://github.com/sagemath/sage-prod/files/10652784/trac_11293-all-relations-poset.patch.gz)
+

[saliola]

comment:2

Hello! I am going to upload a reviewer patch. By doing lookups in the lequal_matrix instead of using the is_less_than method, we get a speed-up in computation time.

[saliola]

Attachment: trac_11293-review.patch.gz

[rbeezer]

Reviewer: Franco Saliola, Rob Beezer

[rbeezer]

Changed author from Rob Beezer to Rob Beezer, Franco Saliola

[rbeezer]

comment:3

Attachment: trac_11293-all-relations-poset-v2.patch.gz

Franco's reviewer patch looks real good. So positive review on that part from me.

Franco also mentioned that we need to include the "diagonal relation", so the inner loop index has been adjusted to make that happen, and doctests updated. Then I rolled up the original patch, the reviewer patch, and the "diagonal" changes all into a single v2 patch.