-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrelationship_primitives.py
More file actions
79 lines (47 loc) · 1.71 KB
/
Copy pathrelationship_primitives.py
File metadata and controls
79 lines (47 loc) · 1.71 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
from typing import Any
from nodes import RelationshipNode
from base_types import DslSet
class Equals(RelationshipNode):
def __init__(self):
super().__init__([Any, Any])
def apply(self, object_1: Any, object_2: Any):
return object_1 == object_2
def is_symmetrical(self) -> bool:
return True
class NotEquals(RelationshipNode):
def __init__(self):
super().__init__([Any, Any])
def apply(self, object_1: Any, object_2: Any):
return object_1 != object_2
def is_symmetrical(self) -> bool:
return True
class LessThan(RelationshipNode):
def __init__(self):
super().__init__([Any, Any])
def apply(self, object_1: Any, object_2: Any):
return object_1 < object_2
class LessThanOrEqual(RelationshipNode):
def __init__(self):
super().__init__([Any, Any])
def apply(self, object_1: Any, object_2: Any):
return object_1 <= object_2
class GreaterThan(RelationshipNode):
def __init__(self):
super().__init__([Any, Any])
def apply(self, object_1: Any, object_2: Any):
return object_1 > object_2
class GreaterThanOrEqual(RelationshipNode):
def __init__(self):
super().__init__([Any, Any])
def apply(self, object_1: Any, object_2: Any):
return object_1 >= object_2
class SetContains(RelationshipNode):
def __init__(self):
super().__init__([DslSet, Any])
def apply(self, object_1: DslSet, object_2: Any):
return object_2 in object_1
class SetNotContains(RelationshipNode):
def __init__(self):
super().__init__([DslSet, Any])
def apply(self, object_1: DslSet, object_2: Any):
return not SetContains().apply(object_1, object_2)