-// $Id: CQLProxNode.java,v 1.5 2002-11-20 17:26:42 mike Exp $
+// $Id: CQLProxNode.java,v 1.14 2007-06-29 12:53:03 mike Exp $
package org.z3950.zing.cql;
-import java.util.Vector;
/**
* candidate records which are sufficiently close to each other, as
* specified by a set of proximity parameters.
*
- * @version $Id: CQLProxNode.java,v 1.5 2002-11-20 17:26:42 mike Exp $
+ * @version $Id: CQLProxNode.java,v 1.14 2007-06-29 12:53:03 mike Exp $
*/
public class CQLProxNode extends CQLBooleanNode {
- ModifierSet ms;
-
- /**
- * Creates a new, <I>incomplete</I>, proximity node with the
- * specified left-hand side. No right-hand side is specified at
- * this stage: that must be specified later, using the
- * <TT>addSecondSubterm()</TT> method. (That may seem odd, but
- * it's just easier to write the parser that way.)
- * <P>
- * Proximity paramaters may be added at any time, before or after
- * the right-hand-side sub-tree is added.
- */
- public CQLProxNode(CQLNode left) {
- ms = new ModifierSet("prox");
- this.left = left;
- // this.right left unresolved for now ...
- }
-
- /**
- * Sets the right-hand side of the proximity node whose
- * left-hand-side was specified at creation time.
- */
- public void addSecondSubterm(CQLNode right) {
- this.right = right;
- }
-
- /**
- * Adds a modifier of the specified <TT>type</TT> and
- * <TT>value</TT> to a proximity node. Valid types are
- * <TT>relation</TT>, <TT>distance</TT>, <TT>unit</TT> and
- * <TT>ordering</TT>.
- * <P>
- * For information on the semantics of these paramaters, see
- * <A href="http://zing.z3950.org/cql/intro.html#3.1"
- * >section 3.1 (Proximity)</A> of
- * <I>A Gentle Introduction to CQL</I></A>.
- */
- public void addModifier(String type, String value) {
- ms.addModifier(type, value);
- }
-
/**
- * Returns an array of the modifiers associated with a proximity
- * node.
- * @return
- * An array of modifiers, each represented by a two-element
- * <TT>Vector</TT>, in which element 0 is the modifier type
- * (e.g. <TT>distance</TT> or <TT>ordering</TT>) and element 1 is
- * the associated value (e.g. <TT>3</TT> or <TT>unordered</TT>).
+ * Creates a new PROX node with the specified left- and right-hand
+ * sides and modifiers.
*/
- public Vector[] getModifiers() {
- return ms.getModifiers();
- }
-
- String op() {
- return ms.toCQL();
- }
-
- String opXCQL(int level) {
- System.err.println("in CQLProxNode.opXCQL()");
- return ms.toXCQL(level, "boolean");
+ public CQLProxNode(CQLNode left, CQLNode right, ModifierSet ms) {
+ super(left, right, ms);
}
/*
* unit-code ::= integer.
*/
String opPQF() {
+ int relCode = getRelCode();
+ int unitCode = getProxUnitCode();
+
+ String res = "prox " +
+ "0 " +
+ ms.modifier("distance") + " " +
+ (ms.modifier("ordering").equals("ordered") ? 1 : 0) + " " +
+ relCode + " " +
+ "1 " +
+ unitCode;
+
+ return res;
+ }
+
+ private int getRelCode() {
String rel = ms.modifier("relation");
- int relCode = 0;
if (rel.equals("<")) {
- relCode = 1;
+ return 1;
} else if (rel.equals("<=")) {
- relCode = 2;
+ return 2;
} else if (rel.equals("=")) {
- relCode = 3;
+ return 3;
} else if (rel.equals(">=")) {
- relCode = 4;
+ return 4;
} else if (rel.equals(">")) {
- relCode = 5;
+ return 5;
} else if (rel.equals("<>")) {
- relCode = 6;
+ return 6;
}
+ return 0;
+ }
+ private int getProxUnitCode() {
String unit = ms.modifier("unit");
- int unitCode = 0;
if (unit.equals("word")) {
- unitCode = 2;
+ return 2;
} else if (unit.equals("sentence")) {
- unitCode = 3;
+ return 3;
} else if (unit.equals("paragraph")) {
- unitCode = 4;
+ return 4;
} else if (unit.equals("element")) {
- unitCode = 8;
+ return 8;
}
+ return 0;
+ }
- String res = "prox " +
- "0 " +
- ms.modifier("distance") + " " +
- (ms.modifier("ordering").equals("ordered") ? 1 : 0) + " " +
- relCode + " " +
- "1 " +
- unitCode;
-
- return res;
+
+ byte[] opType1() {
+ byte[] op = new byte[100];
+ int offset, value;
+ offset = putTag(CONTEXT, 46, CONSTRUCTED, op, 0); // Operator
+ op[offset++] = (byte)(0x80&0xff); // indefinite length
+
+ offset = putTag(CONTEXT, 3, CONSTRUCTED, op, offset); // prox
+ op[offset++] = (byte)(0x80&0xff); // indefinite length
+
+ offset = putTag(CONTEXT, 1, PRIMITIVE, op, offset); // exclusion
+ value = 0; // false
+ offset = putLen(numLen(value), op, offset);
+ offset = putNum(value, op, offset);
+
+ offset = putTag(CONTEXT, 2, PRIMITIVE, op, offset); // distance
+ value = Integer.parseInt(ms.modifier("distance"));
+ offset = putLen(numLen(value), op, offset);
+ offset = putNum(value, op, offset);
+
+ offset = putTag(CONTEXT, 3, PRIMITIVE, op, offset); // ordered
+ value = ms.modifier("ordering").equals("ordered") ? 1 : 0;
+ offset = putLen(numLen(value), op, offset);
+ offset = putNum(value, op, offset);
+
+ offset = putTag(CONTEXT, 4, PRIMITIVE, op, offset); // relationType
+ value = getRelCode();
+ offset = putLen(numLen(value), op, offset);
+ offset = putNum(value, op, offset);
+
+ offset = putTag(CONTEXT, 5, CONSTRUCTED, op, offset); // proximityUnitCode
+ op[offset++] = (byte)(0x80&0xff); // indefinite length
+ offset = putTag(CONTEXT, 1, PRIMITIVE, op, offset); // known
+ value = getProxUnitCode();
+ offset = putLen(numLen(value), op, offset);
+ offset = putNum(value, op, offset);
+ op[offset++] = 0x00; // end of proximityUnitCode
+ op[offset++] = 0x00;
+
+ op[offset++] = 0x00; // end of prox
+ op[offset++] = 0x00;
+ op[offset++] = 0x00; // end of Operator
+ op[offset++] = 0x00;
+
+ byte[] o = new byte[offset];
+ System.arraycopy(op, 0, o, 0, offset);
+ return o;
}
}
projects / cql-java-moved-to-github.git / blobdiff