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
99
100
101
102
|
#
# This file is part of the Connection-Set Algebra (CSA).
# Copyright (C) 2010,2011,2012 Mikael Djurfeldt
#
# CSA is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 3 of the License, or
# (at your option) any later version.
#
# CSA is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
#
from __future__ import print_function
import sys as _sys
from . import intervalset as _iset
from . import connset as _cs
from . import valueset as _vs
from . import _elementary
from . import _misc
from .csaobject import registerTag
# Connection-Set constructor
#
def cset (mask, *valueSets):
if valueSets:
c = _cs.ExplicitCSet (mask, *valueSets)
return _cs.ConnectionSet (c)
else:
return mask
registerTag (_cs.CSet.tag, cset, 1)
# Selectors
#
def mask (obj):
cset = _cs.coerceCSet (obj)
return cset.mask ()
def value (obj, k):
assert isinstance (obj, _cs.ConnectionSet), 'expected connection-set'
return obj.c.value (k)
def arity (obj):
if isinstance (obj, _cs.ConnectionSet):
return obj.c.arity
else:
return 0
# Value-set constructor
#
def vset (obj):
if not callable (obj):
return _vs.QuotedValueSet (obj)
else:
return _vs.GenericValueSet (obj)
# Intervals
#
def ival (beg, end):
return _iset.IntervalSet ((beg, end))
N = _iset.N
# Cartesian product
#
def cross (set0, set1):
return _cs.intervalSetMask (set0, set1)
# Elementary masks
#
empty = cross ([], [])
full = _elementary.FullMask ()
oneToOne = _elementary.OneToOne ()
random = _misc.Random ()
# Support for parallel simulator
#
def partition (c, masks, selected, seed = None):
if isinstance (c, _cs.Mask):
return _cs.MaskPartition (c, masks, selected, seed)
elif isinstance (c, _cs.ConnectionSet):
return _cs.ConnectionSet (_cs.CSetPartition (c, masks, selected, seed))
# Utilities
#
def tabulate (c):
for x in c:
print(u'{}'.format(x[0]), end=u' ')
for e in x[1:]:
print(u'\t{}'.format(e))
#del _elementary, cs, sys # not for export
|
