📄 expression.java
字号:
/*
(c) Copyright 2003, 2004, 2005, 2006, 2007 Hewlett-Packard Development Company, LP, all rights reserved.
[See end of file]
$Id: Expression.java,v 1.28 2007/01/02 11:49:45 andy_seaborne Exp $
*/
package com.hp.hpl.jena.graph.query;
import java.util.*;
import com.hp.hpl.jena.util.CollectionFactory;
/**
Expression - the interface for expressions that is expected by Query for
constraints. An Expression can be evaluated (given a name->value mapping);
it can be prepared into a Valuator (given a name->index mapping); and it can
be analysed into its components.
<p>
An Expression can be a variable, an application, or a literal value. If an access
method (eg getName) is applied to an Expression for which it is not appropriate
(eg an application), <em>the result is unspecified</em>; an implementation is
free to throw an exception, deliver a null result, deliver a misleading value,
whatever is convenient.
<p>
The nested class <code>Util</code> provides some expression utility
methods, including a generic version of <code>prepare</code>. The nested
abstract class <code>Base</code> and its sub-classes <code>Literal</code>,
<code>Variable</code>, and <code>Application</code> provide a framework
for developers to implement Expressions over.
@author kers
*/
public interface Expression
{
/**
Answer a Valuator which, when run with a set of index-to-value bindings,
evaluates this expression in the light of the given variable-to-index bindings
[ie as though the variables were bound to the corresponding values]
*/
public Valuator prepare( VariableIndexes vi );
/**
Answer true iff this Expression represents a variable.
*/
public boolean isVariable();
/**
If this Expression is a variable, answer a [non-null] String which is its name.
Otherwise the behaviour is unspecified.
*/
public String getName();
/**
Answer true iff this Expression represents a literal [Java object] value.
*/
public boolean isConstant();
/**
If this Expression is a literal, answer the value of that literal. Otherwise the
behaviour is unspecified.
*/
public Object getValue();
/**
Answer true iff this Expression represents the application of some function
[or operator] to some arguments [or operands].
*/
public boolean isApply();
/**
If this Expression is an application, return the string identifying the function,
which should be a URI. Otherwise the behaviour is unspecified.
*/
public String getFun();
/**
If this Expression is an application, answer the number of arguments that
it has. Otherwise the behaviour is unspecified.
*/
public int argCount();
/**
If this Expression is an application, and 0 <= i < argCount(), answer the
<code>i</code>th argument. Otherwise the behaviour is unspecified.
*/
public Expression getArg( int i );
/**
An Expression which always evaluates to <code>true</code>.
*/
public static Expression TRUE = new BoolConstant( true );
/**
An Expression which always evaluates to <code>false</code>.
*/
public static Expression FALSE = new BoolConstant( false );
/**
An abstract base class for Expressions; over-ride as appropriate. The
sub-classes may be more useful.
*/
public static abstract class Base implements Expression
{
public boolean isVariable() { return false; }
public boolean isApply() { return false; }
public boolean isConstant() { return false; }
public String getName() { return null; }
public Object getValue() { return null; }
public int argCount() { return 0; }
public String getFun() { return null; }
public Expression getArg( int i ) { return null; }
public boolean equals( Object other )
{ return other instanceof Expression && Expression.Util.equals( this, (Expression) other ); }
}
/**
An abstract base class for literal nodes; subclasses implement getValue().
*/
public static abstract class Constant extends Base
{
public boolean isConstant() { return true; }
public abstract Object getValue();
}
/**
A concrete class for representing fixed constants; each instance
can hold a separate value and its valuator returns that value.
*/
public static class Fixed extends Constant
{
protected Object value;
public Fixed( Object value )
{ this.value = value; }
public Object getValue()
{ return value; }
public Valuator prepare( VariableIndexes vi )
{ return new FixedValuator( value ); }
public String toString()
{ return value.toString(); }
}
/**
An abstract base class for variable nodes; subclasses implement getName().
*/
public static abstract class Variable extends Base
{
public boolean isVariable() { return true; }
public abstract String getName();
}
/**
An abstract base class for apply nodes; subclasses implement getFun(),
argCount(), and getArg().
*/
public static abstract class Application extends Base
{
public boolean isApply() { return true; }
public abstract int argCount();
public abstract String getFun();
public abstract Expression getArg( int i );
}
/**
Utility methods for Expressions, captured in a class because they can't be
written directly in the interface.
*/
public static class Util
{
/**
Answer a set containing exactly the names of variables within
<code>e</code>.
*/
public static Set variablesOf( Expression e )
{ return addVariablesOf( CollectionFactory.createHashedSet(), e ); }
/**
Add all the variables of <code>e</code> to <code>s</code>, and answer
<code>s</code>.
*/
public static Set addVariablesOf( Set s, Expression e )
{
if (e.isVariable())
s.add( e.getName() );
else if (e.isApply())
for (int i = 0; i < e.argCount(); i += 1)
addVariablesOf( s, e.getArg( i ) );
return s;
}
public static boolean containsAllVariablesOf( Set variables, Expression e )
{
if (e.isConstant())
return true;
if (e.isVariable())
return variables.contains( e.getName() );
if (e.isApply())
{
for (int i = 0; i < e.argCount(); i += 1)
if (containsAllVariablesOf( variables, e.getArg(i) ) == false) return false;
return true;
}
return false;
}
public static boolean equals( Expression L, Expression R )
{
return
L.isConstant() ? R.isConstant() && L.getValue().equals( R.getValue() )
: L.isVariable() ? R.isVariable() && R.getName().equals( R.getName() )
: L.isApply() ? R.isApply() && sameApply( L, R )
: false
;
}
public static boolean sameApply( Expression L, Expression R )
{
return
L.argCount() == R.argCount() && L.getFun().equals( R.getFun() )
&& sameArgs( L, R )
;
}
public static boolean sameArgs( Expression L, Expression R )
{
for (int i = 0; i < L.argCount(); i += 1)
if (!equals( L.getArg( i ), R.getArg( i ) )) return false;
return true;
}
}
/**
Valof provides an implementation of VariableValues which composes the
"compile-time" VariableIndexes map with the "run-time" IndexValues map
to produce a VariableValues map. A Valof has mutable state; the setDomain
operation changes the IndexValues mapping of the Valof.
@author kers
*/
static class Valof implements VariableValues
{
private VariableIndexes map;
private IndexValues dom;
public Valof( VariableIndexes map ) { this.map = map; }
public final Object get( String name )
{ return dom.get( map.indexOf( name ) ); }
public final Valof setDomain( IndexValues d ) { dom = d; return this; }
}
/**
Base class used to implement <code>TRUE</code> and <code>FALSE</code>.
*/
public static class BoolConstant extends Base implements Expression, Valuator
{
private boolean value;
public BoolConstant( boolean value ) { this.value = value; }
public boolean isConstant() { return true; }
// TODO when moving to Jave 1.4 can use Boolean.valueOf( value )
public Object getValue() { return value ? Boolean.TRUE : Boolean.FALSE; }
public Valuator prepare( VariableIndexes vi ) { return this; }
public boolean evalBool( VariableValues vv ) { return value; }
public boolean evalBool( IndexValues vv ) { return value; }
public Object evalObject( IndexValues iv ) { return getValue(); }
}
}
/*
(c) Copyright 2003, 2004, 2005, 2006, 2007 Hewlett-Packard Development Company, LP
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -