2 * Copyright (C) 2013 Red Hat Inc.
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 2 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License along
15 * with this program; if not, write to the Free Software Foundation, Inc.,
16 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
19 (* Returns all unique pairs of integers (i, j) = (0..n-1, 0..n-1) where i != j.
21 * 'pairs_of_ints 3' returns [ (0,1); (0,2); (1,2) ]
25 for i = n-1 downto 0 do
26 for j = i-1 downto 0 do
32 (* Returns all pairs from lists 'xs' and 'ys'. *)
35 List.iter (fun x -> List.iter (fun y -> ret := (x, y) :: !ret) ys) xs;