Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
CartesianProduct2D |
|
| 0.0;0 | ||||
CartesianProduct2D$Mapper |
|
| 0.0;0 |
1 | /* | |
2 | * Copyright 2007 Sun Microsystems, Inc. All Rights Reserved. | |
3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. | |
4 | * | |
5 | * This code is free software; you can redistribute it and/or modify it | |
6 | * under the terms of the GNU General Public License version 2 only, as | |
7 | * published by the Free Software Foundation. Sun designates this | |
8 | * particular file as subject to the "Classpath" exception as provided | |
9 | * by Sun in the LICENSE file that accompanied this code. | |
10 | * | |
11 | * This code is distributed in the hope that it will be useful, but WITHOUT | |
12 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 | * version 2 for more details (a copy is included in the LICENSE file that | |
15 | * accompanied this code). | |
16 | * | |
17 | * You should have received a copy of the GNU General Public License version | |
18 | * 2 along with this work; if not, write to the Free Software Foundation, | |
19 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
20 | * | |
21 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
22 | * CA 95054 USA or visit www.sun.com if you need additional information or | |
23 | * have any questions. | |
24 | */ | |
25 | ||
26 | package com.sun.javafx.runtime.sequence; | |
27 | ||
28 | /** | |
29 | * Special case for two-dimensional foreach comprehension when there are no where clauses on either list and | |
30 | * the foreach body always returns a single instance. The results are computed as needed rather than | |
31 | * precomputed, to save space. | |
32 | * | |
33 | * @author Brian Goetz | |
34 | */ | |
35 | public class CartesianProduct2D<T, U, V> extends AbstractSequence<T> implements Sequence<T> { | |
36 | ||
37 | public interface Mapper<T, U, V> { | |
38 | public T map(int index1, U value1, int index2, V value2); | |
39 | } | |
40 | ||
41 | private final Sequence<U> seq1; | |
42 | private final Sequence<V> seq2; | |
43 | private final Mapper<T, U, V> mapper; | |
44 | ||
45 | public CartesianProduct2D(Class<T> clazz, Sequence<U> seq1, Sequence<V> seq2, Mapper<T, U, V> mapper) { | |
46 | 2 | super(clazz); |
47 | 2 | this.seq1 = seq1; |
48 | 2 | this.seq2 = seq2; |
49 | 2 | this.mapper = mapper; |
50 | 2 | } |
51 | ||
52 | public int getDepth() { | |
53 | 0 | return Math.max(seq1.getDepth(), seq2.getDepth()) + 1; |
54 | } | |
55 | ||
56 | public int size() { | |
57 | 14 | return seq1.size() * seq2.size(); |
58 | } | |
59 | ||
60 | public T get(int position) { | |
61 | 12 | int index1 = position / seq2.size(); |
62 | 12 | int index2 = position % seq2.size(); |
63 | 12 | return mapper.map(index1, seq1.get(index1), index2, seq2.get(index2)); |
64 | } | |
65 | } |