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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
|
# -*- coding: utf-8 -*-
# EFILTER Forensic Query Language
#
# Copyright 2015 Google Inc. All Rights Reserved.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
"""EFILTER abstract type system."""
from efilter import dispatch
from efilter import protocol
from efilter.protocols import eq
# Declarations:
# pylint: disable=unused-argument
@dispatch.multimethod
def union(x, y):
raise NotImplementedError()
@dispatch.multimethod
def intersection(x, y):
raise NotImplementedError()
@dispatch.multimethod
def difference(x, y):
raise NotImplementedError()
@dispatch.multimethod
def issuperset(x, y):
raise NotImplementedError()
@dispatch.multimethod
def issubset(x, y):
return issuperset(y, x)
@dispatch.multimethod
def isstrictsuperset(x, y):
return issuperset(x, y) and eq.ne(x, y)
@dispatch.multimethod
def isstrictsubset(x, y):
return isstrictsuperset(y, x)
@dispatch.multimethod
def contains(s, e):
raise NotImplementedError()
class ISet(protocol.Protocol):
_required_functions = (union, intersection, difference, issuperset,
contains)
# Default implementations:
ISet.implement(
for_types=(set, frozenset),
implementations={
union: lambda x, y: x | frozenset(y),
intersection: lambda x, y: x & frozenset(y),
difference: lambda x, y: x - frozenset(y),
issuperset: lambda x, y: x >= frozenset(y),
contains: lambda s, e: e in s
}
)
ISet.implement(
for_types=(list, tuple),
implementations={
union: lambda x, y: frozenset(x) | frozenset(y),
intersection: lambda x, y: frozenset(x) & frozenset(y),
difference: lambda x, y: frozenset(x) - frozenset(y),
issuperset: lambda x, y: frozenset(x) >= frozenset(y),
contains: lambda s, e: e in s
}
)
|
