Mike Personick created TINKERPOP-2687:
-----------------------------------------
Summary: Define and Implement Comparability Semantics with Ternary
Boolean Logics
Key: TINKERPOP-2687
URL: https://issues.apache.org/jira/browse/TINKERPOP-2687
Project: TinkerPop
Issue Type: New Feature
Components: language
Affects Versions: 3.6.0
Reporter: Mike Personick
Comparability is currently limited to same type or both Numeric comparisons,
and even for same type the objects must implement Comparable, which is not the
case for many valid Gremlin types (all Elements, Properties, collections, etc.)
This is closely related to the Orderability Semantics work, but Comparability
Semantics will be defined slightly differently. Comparability will be extended
to a ternary binary syntax (TRUE, FALSE, and UNDEF). Comparison across types
would be one example of an UNDEF result. However, UNDEF will not propagate to
the user as an Exception, it will be handled at an appropriate level and
ultimately converted to a Boolean result. For example, OR(TRUE, UNDEF) = TRUE.
--
This message was sent by Atlassian Jira
(v8.20.1#820001)
