| Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
| RestrictedReferencePoemType |
|
| 1.0;1 |
| 1 | /* | |
| 2 | * $Source$ | |
| 3 | * $Revision$ | |
| 4 | * | |
| 5 | * Copyright (C) 2000 William Chesters | |
| 6 | * | |
| 7 | * Part of Melati (http://melati.org), a framework for the rapid | |
| 8 | * development of clean, maintainable web applications. | |
| 9 | * | |
| 10 | * Melati is free software; Permission is granted to copy, distribute | |
| 11 | * and/or modify this software under the terms either: | |
| 12 | * | |
| 13 | * a) the GNU General Public License as published by the Free Software | |
| 14 | * Foundation; either version 2 of the License, or (at your option) | |
| 15 | * any later version, | |
| 16 | * | |
| 17 | * or | |
| 18 | * | |
| 19 | * b) any version of the Melati Software License, as published | |
| 20 | * at http://melati.org | |
| 21 | * | |
| 22 | * You should have received a copy of the GNU General Public License and | |
| 23 | * the Melati Software License along with this program; | |
| 24 | * if not, write to the Free Software Foundation, Inc., | |
| 25 | * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA to obtain the | |
| 26 | * GNU General Public License and visit http://melati.org to obtain the | |
| 27 | * Melati Software License. | |
| 28 | * | |
| 29 | * Feel free to contact the Developers of Melati (http://melati.org), | |
| 30 | * if you would like to work out a different arrangement than the options | |
| 31 | * outlined here. It is our intention to allow Melati to be used by as | |
| 32 | * wide an audience as possible. | |
| 33 | * | |
| 34 | * This program is distributed in the hope that it will be useful, | |
| 35 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
| 36 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
| 37 | * GNU General Public License for more details. | |
| 38 | * | |
| 39 | * Contact details for copyright holder: | |
| 40 | * | |
| 41 | * William Chesters <williamc At paneris.org> | |
| 42 | * http://paneris.org/~williamc | |
| 43 | * Obrechtstraat 114, 2517VX Den Haag, The Netherlands | |
| 44 | */ | |
| 45 | ||
| 46 | package org.melati.poem; | |
| 47 | ||
| 48 | import java.util.Enumeration; | |
| 49 | ||
| 50 | /** | |
| 51 | * A pointer to a subset of a {@link Table}. | |
| 52 | * | |
| 53 | * Note this doesn't do quite what you'd expect, and can't unless it parses | |
| 54 | * the selection's <code>whereClause</code> in order to determine what a | |
| 55 | * valid value is, so use a simple where clause. | |
| 56 | */ | |
| 57 | ||
| 58 | public class RestrictedReferencePoemType<P extends Persistent> extends ReferencePoemType { | |
| 59 | ||
| 60 | private final CachedSelection<P> selection; | |
| 61 | ||
| 62 | /** | |
| 63 | * Constructor. | |
| 64 | * @param selection a CachedSelection of that is the sub-set | |
| 65 | * @param nullable whether instance may be null | |
| 66 | */ | |
| 67 | public RestrictedReferencePoemType(CachedSelection<P> selection, | |
| 68 | boolean nullable) { | |
| 69 | 4 | super(selection.getTable(), nullable); |
| 70 | 4 | this.selection = selection; |
| 71 | 4 | } |
| 72 | ||
| 73 | protected Enumeration<Integer> _possibleRaws() { | |
| 74 | 4 | return selection.troids(); |
| 75 | } | |
| 76 | } |