-
Notifications
You must be signed in to change notification settings - Fork 0
/
tuple_definition.rb
173 lines (132 loc) · 5.58 KB
/
tuple_definition.rb
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
#!/usr/bin/env ruby
# =============================================================================================
# Schemaform
# A DSL giving the power of spreadsheets in a relational setting.
#
# [Website] http://schemaform.org
# [Copyright] Copyright 2004-2012 Chris Poirier
# [License] 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.
# =============================================================================================
require Schemaform.locate("schemaform/model/schema.rb")
module Schemaform
module Language
class TupleDefinition
include QualityAssurance
def self.build( name = nil, register = true, &block )
Model::Tuple.new(name).use do |tuple|
Model::Schema.current.register_tuple(tuple) if name && register
TupleDefinition.process(tuple, &block)
end
end
def self.process( tuple, &block )
tuple.use do
dsl = new(tuple)
dsl.instance_eval(&block)
end
end
def initialize( tuple )
@tuple = tuple
@schema = tuple.schema
end
#
# Imports (and potentially redefines) attributes from another tuple type. Redefinitions
# are provided as a block to the import command.
def import( tuple_name, &block )
imported_tuple = @schema.tuples.find(tuple_name)
redefinitions = block ? self.class.build(nil, false, &block) : nil
redefinitions = nil if redefinitions && redefinitions.empty?
imported_tuple.recreate_children_in(@tuple, redefinitions)
end
#
# Defines a required attribute or subtuple within the entity. To define a subtuple, supply a
# block instead of a type.
def required( name, type_name = nil, modifiers = {}, &block )
@tuple.register Model::RequiredAttribute.new(name, type_for(type_name, modifiers, name, &block))
end
#
# Defines an optional attribute or subtuple within the entity. To define a subtuple, supply
# a block instead of a type.
#
# Optional attributes have a default value that will be used if no value is supplied. This is
# optional value is generally supplied via the :default modifier, and can be a static value
# or a formula by which a static value will be calculated (when the tuple is created or when
# an existing value for the attribute is cleared).
#
# As a convenience, as long as you are not supplying a subtuple, you can supply a Proc (not a
# block) in place of the type_name, which will be used as the default, with the attribute type
# inferred from the formula.
def optional( name, type_name = nil, modifiers = {}, &block )
if type_name.is_a?(Proc) then
assert(block.nil?, "please use the formal syntax for default if you are defining a subtuple")
@tuple.register Model::OptionalAttribute.new(name, nil, type_name)
else
@tuple.register Model::OptionalAttribute.new(name, type_for(type_name, modifiers, name, &block))
end
end
#
# Defines a derived attribute within the tuple. A derived attribute is kept
# up to date for you by the system, and you can rely on it being up to date at the
# end of every transaction. Supply a Proc or a block.
def derived( name, *args, &block )
modifiers = args.first.is_a?(Hash) ? args.shift : {}
proc = block || args.shift
@tuple.register Model::DerivedAttribute.new(name, proc)
end
#
# Defines a constraint on the tuple that will be checked on save.
def constrain( description, proc = nil, &block )
warn_todo("constraint support in Tuple")
end
#
# Creates a Reference for use as an attribute definition.
def member_of( entity_name )
type_check(:entity_name, entity_name, Symbol)
Model::EntityReferenceType.new(entity_name)
end
#
# Creates a Set or Relation for use as an attribute definition.
def set_of( type_name, modifiers = {} )
Model::SetType.build(type_for(type_name, modifiers))
end
#
# Creates an (ordered) list for use as an attribute definition.
def list_of( type_name, modifiers = {} )
Model::ListType.build(type_for(type_name, modifiers))
end
#
# Creates a coded or enumerated type for use as an attribute definition.
def one_of( *values )
if values.length == 1 && values[0].is_a?(Hash) then
Model::CodedType.new(values[0])
else
Model::EnumeratedType.new(values)
end
end
private
#
# Retrieves or builds a definition for the given name.
def type_for( name, modifiers, implied_name = nil, &block )
return name if name.is_a?(Model::Type)
if block then
Model::TupleType.new(TupleDefinition.build(&block))
elsif @schema.types.member?(name) then
@schema.types.build(name, modifiers)
elsif @schema.tuples.member?(name) then
Model::TupleType.new(@schema.tuples.find(name))
else
member_of(name)
end
end
end # TupleDefinition
end # Language
end # Schemaform