| | |
- term.Function(term.BuiltIn)
-
- BI_absoluteValue(term.LightBuiltIn, term.Function)
- BI_difference(term.LightBuiltIn, term.Function)
- BI_exponentiation(term.LightBuiltIn, term.Function)
- BI_integerQuotient(term.LightBuiltIn, term.Function)
- BI_memberCount(term.LightBuiltIn, term.Function)
- BI_negation(term.LightBuiltIn, term.Function, term.ReverseFunction)
- BI_product(term.LightBuiltIn, term.Function)
- BI_quotient(term.LightBuiltIn, term.Function)
- BI_remainder(term.LightBuiltIn, term.Function)
- BI_rounded(term.LightBuiltIn, term.Function)
- BI_sum(term.LightBuiltIn, term.Function)
- term.LightBuiltIn(term.BuiltIn)
-
- BI_absoluteValue(term.LightBuiltIn, term.Function)
- BI_difference(term.LightBuiltIn, term.Function)
- BI_differenceOf(term.LightBuiltIn, term.ReverseFunction)
- BI_equalTo
- BI_exponentiation(term.LightBuiltIn, term.Function)
- BI_exponentiationOf(term.LightBuiltIn, term.ReverseFunction)
- BI_factors(term.LightBuiltIn, term.ReverseFunction)
- BI_greaterThan
- BI_integerQuotient(term.LightBuiltIn, term.Function)
- BI_lessThan
- BI_memberCount(term.LightBuiltIn, term.Function)
- BI_negation(term.LightBuiltIn, term.Function, term.ReverseFunction)
- BI_notEqualTo
- BI_notGreaterThan
- BI_notLessThan
- BI_product(term.LightBuiltIn, term.Function)
- BI_quotient(term.LightBuiltIn, term.Function)
- BI_quotientOf(term.LightBuiltIn, term.ReverseFunction)
- BI_remainder(term.LightBuiltIn, term.Function)
- BI_remainderOf(term.LightBuiltIn, term.ReverseFunction)
- BI_rounded(term.LightBuiltIn, term.Function)
- BI_sum(term.LightBuiltIn, term.Function)
- BI_sumOf(term.LightBuiltIn, term.ReverseFunction)
- term.ReverseFunction(term.BuiltIn)
-
- BI_differenceOf(term.LightBuiltIn, term.ReverseFunction)
- BI_exponentiationOf(term.LightBuiltIn, term.ReverseFunction)
- BI_factors(term.LightBuiltIn, term.ReverseFunction)
- BI_negation(term.LightBuiltIn, term.Function, term.ReverseFunction)
- BI_quotientOf(term.LightBuiltIn, term.ReverseFunction)
- BI_remainderOf(term.LightBuiltIn, term.ReverseFunction)
- BI_sumOf(term.LightBuiltIn, term.ReverseFunction)
class BI_absoluteValue(term.LightBuiltIn, term.Function) |
| |
|
| |
- Method resolution order:
- BI_absoluteValue
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.Function
Methods defined here:
- evaluateObject(self, x)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.Function:
- evalObj(self, subj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
|
class BI_difference(term.LightBuiltIn, term.Function) |
| |
|
| |
- Method resolution order:
- BI_difference
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.Function
Methods defined here:
- evaluateObject(self, subj_py)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.Function:
- evalObj(self, subj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
|
class BI_differenceOf(term.LightBuiltIn, term.ReverseFunction) |
| |
|
| |
- Method resolution order:
- BI_differenceOf
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.ReverseFunction
Methods defined here:
- evaluateSubject(self, obj_py)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.ReverseFunction:
- evalSubj(self, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions
|
class BI_equalTo(term.LightBuiltIn) |
| |
|
| |
- Method resolution order:
- BI_equalTo
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
|
class BI_exponentiation(term.LightBuiltIn, term.Function) |
| |
|
| |
- Method resolution order:
- BI_exponentiation
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.Function
Methods defined here:
- evaluateObject(self, subj_py)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.Function:
- evalObj(self, subj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
|
class BI_exponentiationOf(term.LightBuiltIn, term.ReverseFunction) |
| |
|
| |
- Method resolution order:
- BI_exponentiationOf
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.ReverseFunction
Methods defined here:
- evaluateSubject(self, obj_py)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.ReverseFunction:
- evalSubj(self, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions
|
class BI_factors(term.LightBuiltIn, term.ReverseFunction) |
| |
|
| |
- Method resolution order:
- BI_factors
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.ReverseFunction
Methods defined here:
- evaluateSubject(self, obj_py)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.ReverseFunction:
- evalSubj(self, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions
|
class BI_greaterThan(term.LightBuiltIn) |
| |
|
| |
- Method resolution order:
- BI_greaterThan
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
|
class BI_integerQuotient(term.LightBuiltIn, term.Function) |
| |
|
| |
- Method resolution order:
- BI_integerQuotient
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.Function
Methods defined here:
- evaluateObject(self, subj_py)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.Function:
- evalObj(self, subj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
|
class BI_lessThan(term.LightBuiltIn) |
| |
|
| |
- Method resolution order:
- BI_lessThan
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
|
class BI_memberCount(term.LightBuiltIn, term.Function) |
| |
|
| |
- Method resolution order:
- BI_memberCount
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.Function
Methods defined here:
- evaluateObject(self, subj_py)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.Function:
- evalObj(self, subj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
|
class BI_negation(term.LightBuiltIn, term.Function, term.ReverseFunction) |
| |
|
| |
- Method resolution order:
- BI_negation
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.Function
- term.ReverseFunction
Methods defined here:
- evalaluateObject(self, subject)
- evalaluateSubject(self, object)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.Function:
- evalObj(self, subj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
Methods inherited from term.ReverseFunction:
- evalSubj(self, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions
|
class BI_notEqualTo(term.LightBuiltIn) |
| |
|
| |
- Method resolution order:
- BI_notEqualTo
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
|
class BI_notGreaterThan(term.LightBuiltIn) |
| |
|
| |
- Method resolution order:
- BI_notGreaterThan
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
|
class BI_notLessThan(term.LightBuiltIn) |
| |
|
| |
- Method resolution order:
- BI_notLessThan
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
|
class BI_product(term.LightBuiltIn, term.Function) |
| |
|
| |
- Method resolution order:
- BI_product
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.Function
Methods defined here:
- evaluateObject(self, subj_py)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.Function:
- evalObj(self, subj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
|
class BI_quotient(term.LightBuiltIn, term.Function) |
| |
|
| |
- Method resolution order:
- BI_quotient
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.Function
Methods defined here:
- evaluateObject(self, subj_py)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.Function:
- evalObj(self, subj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
|
class BI_quotientOf(term.LightBuiltIn, term.ReverseFunction) |
| |
|
| |
- Method resolution order:
- BI_quotientOf
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.ReverseFunction
Methods defined here:
- evaluateSubject(self, obj_py)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.ReverseFunction:
- evalSubj(self, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions
|
class BI_remainder(term.LightBuiltIn, term.Function) |
| |
|
| |
- Method resolution order:
- BI_remainder
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.Function
Methods defined here:
- evaluateObject(self, subj_py)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.Function:
- evalObj(self, subj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
|
class BI_remainderOf(term.LightBuiltIn, term.ReverseFunction) |
| |
|
| |
- Method resolution order:
- BI_remainderOf
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.ReverseFunction
Methods defined here:
- evaluateSubject(self, obj_py)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.ReverseFunction:
- evalSubj(self, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions
|
class BI_rounded(term.LightBuiltIn, term.Function) |
| |
|
| |
- Method resolution order:
- BI_rounded
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.Function
Methods defined here:
- evaluateObject(self, x)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.Function:
- evalObj(self, subj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
|
class BI_sum(term.LightBuiltIn, term.Function) |
| |
|
| |
- Method resolution order:
- BI_sum
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.Function
Methods defined here:
- evaluateObject(self, subj_py)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.Function:
- evalObj(self, subj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
|
class BI_sumOf(term.LightBuiltIn, term.ReverseFunction) |
| |
|
| |
- Method resolution order:
- BI_sumOf
- term.LightBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- term.ReverseFunction
Methods defined here:
- evaluateSubject(self, obj_py)
Data and non-method functions defined here:
- __doc__ = None
- __module__ = 'cwm_maths'
Methods inherited from term.BuiltIn:
- __init__(self, resource, fragid)
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
Methods inherited from term.Fragment:
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
- compareTerm(self, other)
- Assume is also a LabelledNode - see function compareTerm in formula.py
- flatten(self, sink, why=None)
- reification(self, sink, bnodeMap={}, why=None)
- Describe myself in RDF to the given context
[ reify:uri "http://example.org/whatever"]
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols, string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already)
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None)
- Return this or a version of me with subsitution made
- unflatten(self, sink, bNodes, why=None)
- unify(self, other, vars, existentials, bindings)
- Unify this which may contain variables with the other,
which may contain existentials but not variables.
Return 0 if impossible.
return [({}, reason] if no new bindings
Return [( {var1: val1, var2: val2,...}, reason), ...] if match
- value(self)
- As a python value - by default, none exists, use self
Methods inherited from term.ReverseFunction:
- evalSubj(self, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions
| |