| | |
- term.Function(term.BuiltIn)
-
- BI_concatenation(term.LightBuiltIn, term.Function)
- BI_encodeForFragID(term.LightBuiltIn, term.Function)
- BI_encodeForURI(term.LightBuiltIn, term.Function)
- BI_format(term.LightBuiltIn, term.Function)
- BI_normalize_space(term.LightBuiltIn, term.Function)
- BI_resolve_uri(term.LightBuiltIn, term.Function)
- BI_scrape(term.LightBuiltIn, term.Function)
- BI_search(term.LightBuiltIn, term.Function)
- BI_split(term.LightBuiltIn, term.Function)
- BI_stringToList(term.LightBuiltIn, term.Function, term.ReverseFunction)
- BI_tokenize(term.LightBuiltIn, term.Function)
- BI_xmlEscapeAttribute(term.LightBuiltIn, term.Function)
- BI_xmlEscapeData(term.LightBuiltIn, term.Function)
- term.LightBuiltIn(term.GenericBuiltIn)
-
- BI_Contains
- BI_ContainsIgnoringCase
- BI_ContainsRoughly
- BI_DoesNotContain
- BI_EndsWith
- BI_GreaterThan
- BI_LessThan
- BI_NotGreaterThan
- BI_NotLessThan
- BI_StartsWith
- BI_concat(term.LightBuiltIn, term.ReverseFunction)
- BI_concatenation(term.LightBuiltIn, term.Function)
- BI_encodeForFragID(term.LightBuiltIn, term.Function)
- BI_encodeForURI(term.LightBuiltIn, term.Function)
- BI_equalIgnoringCase
- BI_format(term.LightBuiltIn, term.Function)
- BI_matches
- BI_normalize_space(term.LightBuiltIn, term.Function)
- BI_notEqualIgnoringCase
- BI_notMatches
- BI_resolve_uri(term.LightBuiltIn, term.Function)
- BI_scrape(term.LightBuiltIn, term.Function)
- BI_search(term.LightBuiltIn, term.Function)
- BI_split(term.LightBuiltIn, term.Function)
- BI_stringToList(term.LightBuiltIn, term.Function, term.ReverseFunction)
- BI_tokenize(term.LightBuiltIn, term.Function)
- BI_xmlEscapeAttribute(term.LightBuiltIn, term.Function)
- BI_xmlEscapeData(term.LightBuiltIn, term.Function)
- term.ReverseFunction(term.BuiltIn)
-
- BI_concat(term.LightBuiltIn, term.ReverseFunction)
- BI_stringToList(term.LightBuiltIn, term.Function, term.ReverseFunction)
class BI_Contains(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_Contains
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_ContainsIgnoringCase(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_ContainsIgnoringCase
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_ContainsRoughly(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_ContainsRoughly
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_DoesNotContain(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_DoesNotContain
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_EndsWith(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_EndsWith
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_GreaterThan(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_GreaterThan
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_LessThan(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_LessThan
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_NotGreaterThan(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_NotGreaterThan
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_NotLessThan(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_NotLessThan
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_StartsWith(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_StartsWith
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_concat(term.LightBuiltIn, term.ReverseFunction) |
| | |
- Method resolution order:
- BI_concat
- term.LightBuiltIn
- term.GenericBuiltIn
- term.ReverseFunction
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluateSubject(self, obj_py)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.ReverseFunction:
- eval(self, subj, obj, queue, bindings, proof, query)
- 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
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_concatenation(term.LightBuiltIn, term.Function) |
| | |
- Method resolution order:
- BI_concatenation
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluateObject(self, subj_py)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
- 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.
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_encodeForFragID(term.LightBuiltIn, term.Function) |
| |
Take a unicode string and return it encoded so as to pass in
a URI grament identifier.
|
| |
- Method resolution order:
- BI_encodeForFragID
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluateObject(self, subj_py)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
- 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.
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_encodeForURI(term.LightBuiltIn, term.Function) |
| |
Take a unicode string and return it encoded so as to pass in an
URI path segment. See
http://www.w3.org/TR/2005/CR-xpath-functions-20051103/#func-encode-for-uri
|
| |
- Method resolution order:
- BI_encodeForURI
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluateObject(self, subj_py)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
- 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.
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_equalIgnoringCase(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_equalIgnoringCase
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_format(term.LightBuiltIn, term.Function) |
| |
a built-in for string formatting,
ala python % or C's sprintf or common-lisp's format
takes a list; the first item is the format string, and the rest are args.
see also: test/@@
|
| |
- Method resolution order:
- BI_format
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluateObject(self, subj_py)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
- 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.
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_matches(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_matches
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_normalize_space(term.LightBuiltIn, term.Function) |
| |
Returns the value of $arg with whitespace normalized by
stripping leading and trailing whitespace and replacing sequences
of one or more than one whitespace character with a single space,
#x20 -- http://www.w3.org/2006/xpath-functions#normalize-space
|
| |
- Method resolution order:
- BI_normalize_space
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluateObject(self, subj_py)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
- 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.
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_notEqualIgnoringCase(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_notEqualIgnoringCase
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_notMatches(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_notMatches
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_resolve_uri(term.LightBuiltIn, term.Function) |
| |
see http://www.w3.org/2006/xpath-functions#resolve-uri
|
| |
- Method resolution order:
- BI_resolve_uri
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluateObject(self, subj_py)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
- 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.
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_scrape(term.LightBuiltIn, term.Function) |
| |
a built-in for scraping using regexps.
takes a list of 2 strings; the first is the
input data, and the second is a regex with one () group.
Returns the data matched by the () group.
see also: test/includes/scrape1.n3
Hmm... negative tests don't seem to work.
|
| |
- Method resolution order:
- BI_scrape
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluateObject(self, subj_py)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
- 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.
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_search(term.LightBuiltIn, term.Function) |
| |
a more powerful built-in for scraping using regexps.
takes a list of 2 strings; the first is the
input data, and the second is a regex with one or more () group.
Returns the list of data matched by the () groups.
see also: test/includes/search.n3
|
| |
- Method resolution order:
- BI_search
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluateObject(self, subj_py)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
- 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.
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_split(term.LightBuiltIn, term.Function) |
| |
split a string into a list of strings
takes a list of 2 strings and an integer; the first is the
input data, and the second is a regex
see re.split in http://docs.python.org/lib/node46.html
|
| |
- Method resolution order:
- BI_split
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluateObject(self, subj_py)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
- 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.
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_stringToList(term.LightBuiltIn, term.Function, term.ReverseFunction) |
| |
You need nothing else. Makes a string a list of characters, and visa versa.
|
| |
- Method resolution order:
- BI_stringToList
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.ReverseFunction
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluateObject(self, subj_py)
- evaluateSubject(self, obj_py)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
- 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
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_tokenize(term.LightBuiltIn, term.Function) |
| |
like split without the max arg
|
| |
- Method resolution order:
- BI_tokenize
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluateObject(self, subj_py)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
- 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.
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_xmlEscapeAttribute(term.LightBuiltIn, term.Function) |
| |
Take a unicode string and return it encoded so as to pass in an XML data
You may need stg different for attributes, escaping quotes.
|
| |
- Method resolution order:
- BI_xmlEscapeAttribute
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluateObject(self, subj_py)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
- 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.
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_xmlEscapeData(term.LightBuiltIn, term.Function) |
| |
Take a unicode string and return it encoded so as to pass in an XML data
You will need the BI_xmlEscapeAttribute on for attributes, escaping quotes.
|
| |
- Method resolution order:
- BI_xmlEscapeData
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluateObject(self, subj_py)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
- 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.
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- 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)
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
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
| |