magik

name

magik

description

This skill should be used when the user is writing, reviewing, or asking questions about Magik code — the programming language used in GE Smallworld GIS. Use this skill when the user mentions Magik, Smallworld, exemplars, def_slotted_exemplar, _method, _pragma, sw:rope, sw:property_list, or any Smallworld-specific constructs. Also use it when the user asks about GIS application development, Smallworld modules, or Java interop in a Magik context.

What Is Magik?

Magik is a dynamically typed, object-oriented programming language built for Smallworld GIS (now GE Smallworld Geo Network Management). It compiles to Java bytecode and runs on the JVM. It is strictly OO and imperative — similar in spirit to Smalltalk — and is used for enterprise GIS applications in utilities and telecoms.

---

Core Syntax

Comments

# This is a single-line comment
## This is a method documentation comment (used by tooling)

Assignment

a << 1.234         # "a becomes 1.234"
b +<< a            # b << b + a  (compound assignment)

Never use = for assignment. = is equality comparison only.

Output

write("Hello, world!")      # prints with newline
show(some_variable)         # inspect/debug print

Data Types

# Integer
x << 42

# Float
y << 3.14

# String
name << "Alice"

# Symbol (unique token, like an interned string — used heavily for identifiers)
sym << :my_symbol
escaped_sym << :|hello world|

# Boolean — NOTE: _true and _false, NOT true/false
flag << _true
flag << _false

# Null equivalent
nothing << _unset    # like null/nil in other languages

# Character literal
ch << %A             # the character 'A'

# Simple vector (array literal)
v << {1, 2, 3}

# Property list (ordered key-value, preserves insertion order)
pl << sw:property_list.new_with(:key1, "val1", :key2, "val2")

# Hash table (unordered)
ht << sw:hash_table.new()

# Concurrent hash map (preferred in Smallworld 5 — thread-safe and fastest)
chm << sw:concurrent_hash_map.new()

Boolean Keywords

Magik uses keyword booleans — NEVER use bare true / false:

_true
_false
_maybe    # tri-state Kleenean: _true, _maybe, or _false

Methods returning a Kleenean result are named with ?? suffix (e.g. inside??()). Do not use the result directly as a boolean condition — compare explicitly with _is _true / _is _false / _is _maybe.

Logical operators:

_and    _or    _not    _xor          # always evaluate both sides
_andif  _orif  _xorif                # short-circuit — skip RHS if LHS decides the result

Use the short-circuit forms whenever the RHS depends on the LHS being safe, e.g. a null-check before a method call:

_if x _isnt _unset _andif x.valid? _then ... _endif

---

Variables

Local variables must be declared with _local:

_local my_count << 0
_local result    << _unset

Global variables use _global (avoid in production — causes namespace pollution):

_global my_global << "some value"

Dynamic (thread-local) variables:

_dynamic !my_dynamic!

Convention: use snake_case with descriptive nouns. No camelCase. No type prefixes.

---

Naming Conventions

Methods and Procedures

• Consistency: The same function should have the same name across classes; different functions should have different names.
• Get/set pairs: If an attribute is read via foo, its setter must be named foo<<.
• Boolean-returning routines end in ? and can be used directly as conditions:

  _if i.odd? _then ... _endif
  

• Kleenean-returning routines (those that may return _true, _false, or _maybe) end in ??. Compare explicitly rather than using as a bare condition:

  # inside?? returns _true if strictly inside, _false if any part outside, _maybe if on edge
  _if rect.inside??(other_rect) _is _true _then ... _endif
  

• Friend / internal-public methods that cannot be strictly private should contain ! within their names (e.g. int!method()). This makes them easy to identify and allows special treatment by method browsers. All such methods must use classify_level=restricted.
• Slot-like methods (no side effects, always returns the same single result on an unmodified object) must be defined without brackets. Methods whose primary purpose is not slot-like access must include brackets. Note that brackets are part of the method name — sqrt and sqrt() are entirely different methods:

  # Slot-like — no brackets (behaves like reading a property):
  my_obj.name
  my_obj.size
  
  # Not slot-like — with brackets (does work, has side effects, or returns multiple values):
  my_obj.calculate()
  my_obj.open_stream()
  

Arguments

• Argument names should indicate role or type.
• Use an indefinite article prefix for names indicating type: a_coordinate, a_rope, an_integer.
• If multiple arguments have the same type, append numbers: new_with_corners(coord1, coord2).

Dynamic Variables

• Dynamic variable names must start and end with !: !output!, !print_length!.

Class Design

• Single initialisation method: Define only one init() method per class. Multiple initialisers make subclassing much harder, as every subclass must find and override each one.
• Link related classes via shared constants rather than accessing globals — this improves efficiency and simplifies subclassing:

  my_object.define_shared_constant(:related_class, other_exemplar, :public)
  $
  

---

Conditionals

_if condition
_then
    # ...
_endif

_if x > 0
_then
    write("positive")
_elif x = 0
_then
    write("zero")
_else
    write("negative")
_endif

Note: Use _is for identity (same object reference), = for value equality:

_if a _is _unset _then write("a is null") _endif
_if a = b _then write("a equals b") _endif

Formatting: In a multi-line _if, place a newline after each _then, _else, _and, _or, _andif, _orif, _xorif.

Expression form / method chaining: _if can be used as an expression and a method called directly on _endif:

result << _if cond _then >> a _else >> b _endif.write_string

---

Loops

# While loop
_local i << 0
_while i < 10
_loop
    i +<< 1
_endloop

# For-over loop (iterate a collection)
_for item _over my_collection.elements()
_loop
    write(item)
_endloop

# For-over with index and value
_for k, v _over my_property_list.fast_keys_and_elements()
_loop
    write(k, " => ", v)
_endloop

# General loop with _leave to break, _continue to skip
_loop
    _if some_condition _then _leave _endif
    _if skip_condition _then _continue _endif
_endloop

---

Procedures (Standalone Functions)

Procedures are first-class objects, assigned to variables:

my_procedure << _proc @my_procedure(a, b, c)
    _return a + b + c
_endproc

x << my_procedure(1, 2, 3)   # x = 6

>> sets the value of its enclosing code block. It is not a short form of _return: >> is positionally restricted — it must be the last statement of its block, and there is at most one per block. The block's value flows outward; it becomes the method's result only when the block in question is the method body itself. _return val, by contrast, is unrelated to block structure: it exits the enclosing method or procedure immediately, cutting through any nested _if / _block / _loop.

_pragma(classify_level=basic)
_method my_obj.classify(x)
    ## Returns a label for X.
    _local label << _if x > 0
                    _then
                        >> "positive"       # value of the _then arm; the _if evaluates to this
                    _else
                        >> "non-positive"   # value of the _else arm
                    _endif

    _if x.is_nan?() _is _true
    _then
        _return "not a number"              # immediate exit — skips everything below
    _endif

    >> label                                # last statement of the method body — method's result
_endmethod
$

Use >> when the result falls out naturally at the end of a block; use _return to exit a method early from anywhere inside it.

---

Multiple Return Values

A method or procedure can yield a tuple of values — either as the final >> of its body, or via an early _return:

_method my_obj.split_name(full)
    ## Splits FULL into first and last. Returns first, last.
    _local idx << full.index_of(% )
    >> full.slice(1, idx - 1), full.slice(idx + 1)
_endmethod
$

The caller has three ways to consume a multi-valued return:

# 1. Take the first value, drop the rest
first << obj.split_name("Ada Lovelace")

# 2. _scatter — spread the tuple into positional locals on the LHS
(first, last) << (_scatter obj.split_name("Ada Lovelace"))

# 3. _allresults — collect the whole tuple into a simple_vector
parts << _allresults obj.split_name("Ada Lovelace")   # → {"Ada", "Lovelace"}

_scatter also works in the other direction — spread a vector into positional arguments of a call:

args << {1, 2, 3}
obj.configure(_scatter args)    # same as obj.configure(1, 2, 3)

---

Named Blocks (_block / _endblock)

A _block is a scoped expression — it evaluates to whatever its >> returns and lets you introduce locals without writing a procedure. Often useful when you need a short inline computation with a few intermediate variables:

result << _block
    _local tmp << compute_something()
    _local clean << tmp.normalised
    >> clean
_endblock

Unlike a _proc, a block runs immediately; there is no separate invocation step. Use _leave to exit early from a block.

---

Thread Synchronisation (_lock / _endlock)

Acquires the monitor on an object for the duration of the block — only one thread at a time can hold it. Required when mutating shared state in Smallworld 5, which is heavily multithreaded.

_lock my_obj
    my_obj.counter +<< 1
    my_obj.last_updated << date_time_now()
_endlock

Lock on the object whose invariants you are protecting — typically _self. Keep lock bodies short; long-held locks are a common source of contention. Pair with concurrent_hash_map where possible to avoid locking entirely.

---

Thread-Local Access (_thisthread)

_thisthread is the currently executing thread object. Common uses:

_thisthread.sleep(100)           # block this thread for 100 ms
_thisthread.as_oop               # integer unique to this thread — handy as a map key
_thisthread.vm_priority          # current priority; e.g. spawn child at priority-1

Treat _thisthread as the entry point for thread-local state and scheduling. Do not cache it across method calls — always re-read.

---

Exemplars (Classes)

Magik does not have classes. It uses exemplars — a prototype-based system where new instances are clones of the exemplar.

Define an Exemplar

def_slotted_exemplar(
    :my_object,
    {
        {:slot_a, _unset},
        {:slot_b, "default_value"}
    },
    {@user:parent_exemplar_a, @user:parent_exemplar_b}  # inheritance list
)
$

Namespace prefixes in exemplar names

Exemplar symbols carry a short prefix that tells you where and how they may be used:

• Package-qualified — pkg:name. A colon separates a package identifier from the exemplar name. sw:rope, sw:property_list, user:my_demo. Use this form for any public cross-package reference.
• Package-private — xx!name. An exemplar whose name contains ! is package-private. Only code within the same package should reference it. The owning package is free to rename or remove !-named exemplars without notice, so external code must never depend on them.

This parallels the !-in-method-name rule: ! in an identifier is always a "don't rely on this from outside" marker, whether the identifier is a method or an exemplar.

# Fine — same-package reference to a package-private exemplar
sw:def_slotted_exemplar(:my_thing, {}, {@user:internal!base_thing})
$

# Also fine — public package-qualified reference
sw:def_slotted_exemplar(:my_thing, {}, {@sw:rope})
$

Slot Accessors

Always define slot accessors using slotted_format_mixin.define_slot_access() rather than writing accessor methods by hand. Slots must only be accessed directly (.slot_name) inside init() and the generated accessor methods — all other code must go through the accessors.

my_object.define_slot_access(:slot_a, :writable, :public)
my_object.define_slot_access(:slot_b, :readable, :public)
$

Constructor Pattern (new/init)

_method my_object.new(val_a, val_b)
    ## Creates a new MY_OBJECT with VAL_A and VAL_B.
    ## Returns a new my_object instance.
    >> _clone.init(val_a, val_b)
_endmethod
$

_private _method my_object.init(val_a, val_b)
    ##
    .slot_a << val_a
    .slot_b << val_b
    >> _self
_endmethod
$

• _clone creates a new instance
• _self refers to the current object
• .slot_name accesses a slot (field) via dot notation — only in init() and accessors
• _super calls the parent's implementation

Shared Constants

Prefer define_shared_constant over defining a constant inside a method body:

my_object.define_shared_constant(:my_const, 42, :public)
$

# Use :private for internal constants:
my_object.define_shared_constant(:default_size, 16, :private)
$

Pragma Annotations

All method definitions must have a _pragma immediately before them with a classify_level:

_pragma(classify_level=basic, topic={my_topic})
_method my_object.do_something(param)
    ## Does something useful with PARAM.
    ## Returns the result of the operation.
    _local result << .slot_a + param
    >> result
_endmethod
$

Valid classify_level values: basic, advanced, restricted, debug.

• Public API methods: basic or advanced
• Internal/non-public methods that are still publicly callable: restricted, and the method name must contain ! — typically as a short prefix like int!foo(), sw!foo(), or krn!foo()
• Private methods (_private): restricted
• Methods intended only for live debugging / REPL inspection: debug — these should not be called from production code

Additional pragma keys:

• topic={name} — single topic; topic={a,b} or the plural topics={a,b} — multiple topics. Always use the braced form for consistency, even for a single topic. Example topic: {code} — use for methods that perform code generation.
• usage={subclassable} — this method or exemplar is explicitly designed to be overridden.
• usage={external} — this method is callable from outside the declaring module. Absence of usage={external} does not automatically make a method internal-only; it is a positive marker on the module API surface.

Example combining several keys:

_pragma(classify_level=advanced, topic={my_topic}, usage={subclassable})
_method my_base.handle(event)
    ## Override to handle EVENT. Returns _unset by default.
_endmethod
$

_pragma(classify_level=restricted)
_method my_object.int!internal_helper()
    ## Internal helper — not part of the public API.
    >> .slot_a * 2
_endmethod
$

_pragma(classify_level=restricted)
_private _method my_object.compute_value()
    ##
    >> .slot_b.size
_endmethod
$

Method Documentation

Every _method definition must include a ## docstring immediately after the method signature (even if empty). Documentation rules:

• Parameter names must be referenced fully UPPERCASE in the description
• Return value must be described as "Returns ..."

_pragma(classify_level=basic)
_method my_object.greet(_optional name)
    ## Greets the user by NAME.
    ## If NAME is not given, defaults to "World".

    write("Hello, ", name.default("World"))
_endmethod
$

Private Methods

Prefix with _private and always pair with _pragma(classify_level=restricted). Private methods can only be called from within the same exemplar.

Optional Parameters

Mark trailing parameters with _optional; they default to _unset when the caller omits them. See the greet example under Method Documentation.

Variadic Parameters

_pragma(classify_level=basic)
_method my_object.sum(_gather values)
    ## Returns the sum of all VALUES.
    _local total << 0
    _for v _over values.elements()
    _loop
        total +<< v
    _endloop
    >> total
_endmethod
$

Abstract Methods

Two idioms coexist for "this must be overridden by a subclass."

The _abstract keyword — compile-time marker, body is empty:

_pragma(classify_level=restricted)
_abstract _method my_base.do_the_thing(arg)
_endmethod
$

The raise-based form — runtime check; common in mixins, lets you attach a docstring and produces a clear error if a concrete subclass forgets to override:

_pragma(classify_level=restricted)
_method my_base.do_the_thing
    ## Subclasses must override. Returns the thing.
    >> condition.raise(:subclass_should_implement, :name, "do_the_thing", :class, _self)
_endmethod
$

---

Mixins

Mixins add behaviour without data. They cannot be instantiated directly:

def_mixin(:my_mixin)
$

_pragma(classify_level=basic)
_method my_mixin.shared_behaviour()
    ## Demonstrates shared mixin behaviour.
    write("I am a mixin method")
_endmethod
$

# Use in an exemplar:
sw:def_slotted_exemplar(:my_class, {}, {@user:my_mixin})
$

Mixins can themselves inherit from other mixins. Pass a vector of @-prefixed exemplar-globals as the second argument — the same shape that def_slotted_exemplar uses for its parents list:

sw:def_mixin(:rope_mixin,
  {@sw:stretchy_indexed_collection_mixin,
   @sw:slotted_format_mixin,
   @sw:serial_structure_indexed_mixin})
$

Equivalent legacy forms still found in sw_core (use bare symbols rather than @-refs and don't survive exemplar reload as cleanly — prefer the @ form for new code):

def_mixin(:range_map_mixin, {:keys_and_elements_mixin, :basic_collection_mixin})
def_mixin(:editable_dataset_mixin, :dataset_notification_mixin)  # single parent, no braces

---

Metaprogramming

Retiring a method (remove_method)

Used in database-upgrade and migration scripts to drop a method whose behaviour has moved elsewhere. Do not reach for this during ordinary development — it is a schema-evolution tool and will break any caller that still expects the method to exist.

my_mixin.remove_method(:modified?)
$

Dynamic dispatch (perform)

Sends a message whose name is computed at runtime. The method name is passed as a symbol — use the symbol-bar form :|name()| to include the brackets for a bracketed method, or a bare symbol for a slot-like one:

# Slot-like method (no brackets)
my_obj.perform(:colour)

# Bracketed method with arguments
my_obj.perform(:|handle_event()|, event, priority)

# Method name built from a string at runtime
obj.perform(method_name.as_symbol())

Do not use sys!perform. Any method whose name contains ! is internal — external callers should always go through the public perform.

---

Iterator Methods

Custom iterators use _iter and _loopbody:

_pragma(classify_level=basic, topic={iter})
_iter _method my_object.even_elements()
    ## Yields each even element from _self.
    _for a _over _self.elements()
    _loop
        _if a.even? _is _true
        _then
            _loopbody(a)
        _endif
    _endloop
_endmethod
$

Usage:

_for val _over my_obj.even_elements()
_loop
    write(val)
_endloop

---

Error Handling

Use _protect / _protection for cleanup (like finally):

_protect
    # code that may fail
    risky_operation()
_protection
    # always runs — cleanup here
    cleanup()
_endprotect

Use _try / _when to catch conditions:

_try
    risky_operation()
_when error
    write("An error occurred")
_endtry

Install a handler for the enclosing scope with _handling ... _with — no block nesting required:

_handling information _with procedure      # suppress information-level conditions
_handling error _with _proc(c) log_it(c) _endproc
# ... subsequent code in this scope is protected by the handler above ...

The handler is a procedure (or the bare word procedure, which is the default "do nothing" handler). Use this form when you want a blanket handler for a long method body without indenting everything inside a _try block.

Conditions

Raise a condition by name with keyword/value pairs carrying the details:

condition.raise(:my_error, :string, "Something went wrong")
condition.raise(:invalid_argument, :name, "size", :value, given_size)

Define a new condition type with a parent and a vector of slot names. Slots hold the context that handlers and formatters pull out with .get_value(:slot):

condition.define_condition(:my_processing_error, :error, {:code, :detail})
$

condition.define_condition(:my_user_error, :user_error, {:detail})
$

Chain by pointing at your own condition as the parent to build a hierarchy (handlers catch the parent and everything below it).

Standard parent conditions:

• :error — unrecoverable internal error; surfaces as a traceback if uncaught.
• :user_error — recoverable, for messages aimed at end users.
• :warning — non-fatal; default handler writes to the output and continues.
• :information — informational; default handler is silent unless a handler is installed.

Always wrap production code in error handling. End users must never see raw tracebacks.

Resource Cleanup

Java closeable resources (streams, writers, etc.) must be closed unconditionally. Put the close/finish call in the _protection block, not as the last step of the try body — so it runs even when an exception is raised. An empty _protection block provides no cleanup and is a bug.

_local stream << some_java_resource.open()
_protect
    stream.write("data")
_protection
    stream.close()
_endprotect

---

Collections Reference

Collection	Ordered?	Thread-safe?	Notes
simple_vector	Yes	No	Fixed size array
rope	Yes	No	Dynamic list
property_list	Yes	No	Ordered key-value
hash_table	No	No	Unordered key-value
concurrent_hash_map	No	Yes	Preferred in SW5
set	No	No	Unique elements
sorted_collection	Yes (custom)	No	Sorted by order proc

Common Collection Methods (from basic_collection_mixin)

These are available on all standard collection types:

col.empty?                          # true if no elements (does NOT clear)
col.includes?(item)                 # true if item is in the collection
col.includes_all?(another)          # true if all elements of another are in col
col.an_element()                    # returns one arbitrary element, or _unset
col.elements()                      # iter: yields each element (safe copy)
col.fast_elements()                 # iter: fast, undefined if modified during loop
col.elements_satisfying(pred)       # iter: yields elements where pred.invoke(e) is true
col.select(pred)                    # returns new collection with matching elements
col.map(fn)                         # returns new collection with fn.invoke(e) applied
col.reduce(fn)                      # folds: fn.invoke(acc, e) over all elements
col.as_simple_vector()              # converts to simple_vector
col.as_sorted_collection(order)     # converts to sorted_collection

Note: empty() (no ?) clears the collection. empty? (with ?) tests if it is empty.

rope (dynamic list)

r << sw:rope.new()
r.add_last("item1")
r.add_last("item2")
r.add_first("item0")
r.size                              # number of elements
r[1]                                # 1-origin indexed access
r.remove_first()                    # remove and return first element
r.remove_last()                     # remove and return last element
r.as_simple_vector()                # convert to simple_vector

_for item _over r.elements()
_loop
    write(item)
_endloop

property_list (ordered key-value)

pl << sw:property_list.new()
pl << sw:property_list.new_with(:a, 1, :b, 2)

pl[:key] << "value"                 # store
pl[:key]                            # retrieve
pl.size                             # count
pl.empty?                           # test if empty
pl.empty()                          # clear all entries
pl.includes?(value)                 # test value membership
pl.key_of(value)                    # find key for a value
pl.lookup_key(key)                  # returns item, success_flag
pl.remove_key(key)                  # remove entry

_for k, v _over pl.keys_and_elements()
_loop
    write(k, " => ", v)
_endloop

_for k, v _over pl.fast_keys_and_elements()   # fast, don't modify during loop
_loop
    write(k, " => ", v)
_endloop

hash_table / concurrent_hash_map

ht << sw:hash_table.new()
chm << sw:concurrent_hash_map.new()
chm << sw:concurrent_hash_map.new_with(:a, 1, :b, 2)

chm[:key] << "value"               # store
chm[:key]                          # retrieve
chm.size                           # count
chm.empty?                         # test if empty
chm.empty()                        # clear
chm.includes?(value)               # test value membership
chm.lookup_key(key)                # returns item, success_flag
chm.remove_key(key)                # remove entry
chm.put_if_absent(key, value)      # only insert if key not already present
chm.add_all(another)               # merge in all entries from another map

_for k, v _over chm.fast_keys_and_elements()
_loop
    write(k, " => ", v)
_endloop

set

s << sw:set.new()
s.add(item)                        # add (no-op if already present)
s.remove(item)                     # returns success flag
s.includes?(item)
s.size
s.intersection(another)
s.difference(another)
s.symmetric_difference(another)

sorted_collection

sc << sw:sorted_collection.new()
sc << sw:sorted_collection.new(_unset, _proc(a, b) >> a _cf b _endproc)
sc << sw:sorted_collection.new_from(any_collection)

sc.add(item)
sc.remove(item)
sc.includes?(item)
sc.size
sc.nth(n)                          # 1-origin access
sc.order_proc << new_proc          # re-sort with new order

_for item _over sc.elements()
_loop
    write(item)
_endloop

---

String Operations

Prefer sw:write_string(a, b, c) over string concatenation (a + b + c) — it avoids intermediate allocations and works with any printable type:

sw:write_string("Hello, ", name, "!")

s << "hello world"
s.size                              # length
s.uppercase                         # "HELLO WORLD"
s.lowercase                         # "hello world"
s.titlecase                         # "Hello World"
s.trim_spaces                       # strip leading/trailing whitespace
s.split_by(%,)                      # split by comma character, returns rope
s.index_of_seq("world")            # find substring (1-origin), _unset if not found
s.substitute_string("hello", "goodbye")  # replace all occurrences
s.as_symbol()                       # convert to symbol
s.includes_seq?("world")           # test substring presence

---

Pathname Handling

Use Smallworld pathname utilities for building file paths — never string concatenation:

# Build a path by descending into subdirectories:
sw:system.pathname_down(base_dir, "subdir", "file.txt")

# Build from a vector of components:
sw:system.pathname_from_components({"C:", "workspace", "myfile"})

# Appending a file extension is NOT path manipulation — sw:write_string is fine:
_local jar_name << sw:write_string(module_name, ".jar")

---

British English Spellings

Magik's core libraries use British English. Always use:

• initialise (not initialize)
• colour (not color)
• neighbour (not neighbor)

---

File Header

Every .magik file starts with two directive lines:

#% text_encoding = utf8
_package sw

• #% text_encoding = ... tells the compiler how to decode the file. Prefer utf8 for new files. Legacy files often declare iso8859_1; leave an existing file's encoding alone unless you are re-saving it in the new encoding.
• _package sw is the default for production code. _package user is reserved for examples, tests, and transient exemplars. Only these two packages appear in practice.

---

File Structure & Chunk Terminator

Each top-level statement or definition in a .magik file must end with $ on its own line:

sw:def_slotted_exemplar(:my_obj, {}, {})
$

_pragma(classify_level=basic)
_method my_obj.hello()
    ## Writes a greeting.
    write("hi")
_endmethod
$

In the REPL prompt, $ submits the block. In files, it acts as a statement delimiter.

---

Numeric Operations

Integer

n << 42
n.incremented       # n + 1 (prefer over n + 1)
n.decremented       # n - 1 (prefer over n - 1)
n.shift(3)          # n * 2^3 (bit shift)
n.factorial()       # n!
n.power2()          # smallest power of 2 >= n
n.as_float()        # convert to float
n.as_character()    # e.g. 65 -> %A

Float

f << 3.14
f.rounded()                         # nearest integer (banker's rounding at .5)
f.truncated()                       # toward zero
f.floor()                           # largest integer <= f
f.ceiling()                         # smallest integer >= f
f.as_rational()                     # exact rational representation
f.is_nan?()                         # IEEE NaN test
f.infinite?()                       # +/- infinity test
f.finite?()                         # finite test
float.pi()                          # Pi constant
float.infinity()                    # +Infinity

---

Common Patterns

Singleton Access

# Many system objects are singletons accessed directly:
gis_program_manager   # the main application manager
ds_environment        # database environment
smallworld_product    # product info

Checking for Unset Before Use / Default Value Assignment

_if .my_slot _isnt _unset _then .my_slot.do_something() _endif

# Prefer the shorthand for default assignment:
var << var.default(_true)
# Over the verbose form:
# var << _if var _isnt _unset _then >> var _else >> _true _endif

Method Chaining / Message Passing

result << my_obj.get_collection().elements().size

Loading Code Dynamically

magik_rep.load_chunk(some_string.read_stream())

---

Anti-Patterns to Avoid

• Don't use camelCase — use snake_case with underscores
• Don't use type-prefix naming (e.g., strName, intCount) — use descriptive names like first_name, item_count
• Don't use _global casually — globals pollute the namespace; prefer locals and passed arguments
• Don't leave production code without error handling — always protect against tracebacks reaching the end user
• Don't use hash_table in Smallworld 5 when not needed — prefer concurrent_hash_map for performance and thread safety; use property_list only when insertion order matters
• Don't concatenate strings with + — use sw:write_string(a, b, c) instead
• Don't access slots directly outside init() and accessor methods — always go through define_slot_access-generated accessors; use _self.x not .x (direct slot syntax is only valid inside init() and accessor implementations)
• Don't define class constants inside method bodies — use define_shared_constant()
• Don't leave _protection blocks empty when a resource must be closed — an empty _protection block is a bug
• Don't confuse empty? and empty() — empty? tests emptiness; empty() clears the collection
• Don't use col.size > 0 to test non-emptiness — use col.empty?.not; likewise use col.size.zero? over col.size = 0
• Use boolean?.not not _not boolean? — the method form is idiomatic Magik
• Don't use string concatenation for file paths — use sw:system.pathname_down() and related utilities
• Don't use !name! naming for globals — the !name! convention is reserved for dynamic (thread-local) variables

---

Tooling

• IDEs: MDT (Eclipse-based), VS Code with smallworld-magik-vscode extension (Systemap)
• Language Server / Linter: magik-tools by StevenLooman (GitHub); see also the magik-lsp plugin in this repository (plugins/magik-lsp/) for Claude Code integration
• REPL: The Magik prompt inside a running Smallworld session
• Compilation: F9 (compile buffer), F2-b, or magik_rep.load_chunk()
• Session start (SW5): gis_aliases file via F2-z in VS Code extension
• Type index: magik-tools can emit a types.jsonl file — one JSON object per exemplar/mixin with sort, type_name, slots, parents, pragma, location, and doc. Useful as a grep-target when locating definitions across a large codebase.

---

Module & Product Layout

Smallworld code is organised into products that contain modules. A typical on-disk layout:

my_product/
  product.def                     # product metadata
  modules/
    my_module/
      module.def                  # module metadata + dependency list
      source/
        load_list.txt             # ordered list of files to load
        my_exemplar.magik
        my_methods.magik
      message_usages.magik        # optional — wires this module's message handler

• product.def / module.def declare metadata (name, version, prerequisites). They are plain-text Smallworld definition files — not Magik code.
• load_list.txt is the manifest the session uses to load the module. Entries are file stems without the .magik extension, one per line. A line may also name a subdirectory that contains its own load_list.txt for nested grouping. Order matters — definitions must load before code that references them.
• message_usages.magik connects a module's message handler to upstream message categories, e.g.:

  message_handler(:my_handler).set_uses_list({:parent_category})
  $
  

When adding a new .magik file to a module, you must also add its stem to the appropriate load_list.txt or the file will not be loaded.

---

Quick Reference Card

Assignment:        a << value
Compound assign:   a +<< value
Equality:          a = b
Identity:          a _is b    /    a _isnt b
Not equal:         a ~= b
Boolean:           _true  _false  _maybe (Kleenean)
Null:              _unset
Self:              _self
Early return:      _return val   (immediate exit from method/proc, any depth)
Block result:      >> val         (final statement of current block — sets the block's value)
New instance:      my_exemplar.new(...)  →  internally _clone.init(...)
Slot access:       .slot_name  (only in init/accessors)
Slot accessors:    my_obj.define_slot_access(:slot, :writable, :public)
Shared constant:   my_obj.define_shared_constant(:name, value, :public)
Private method:    _private _method ...
Internal-public:   _method my_obj.int!name() / sw!name()  (any `!`-containing name, classify_level=restricted)
Abstract method:   _abstract _method ...    or    >> condition.raise(:subclass_should_implement, ...)
Named block:       _block ... >> val _endblock
Thread lock:       _lock obj ... _endlock
Thread-local:      _thisthread.sleep(ms)
Short-circuit:     _andif / _orif / _xorif
Gather tuple:      parts << _allresults expr_with_multi_return
Spread args:       obj.call(_scatter vec)
Handler install:   _handling error _with _proc(c) ... _endproc
Raise condition:   condition.raise(:name, :key, val)
Define condition:  condition.define_condition(:name, :parent, {:slots})
Dynamic send:      obj.perform(:|method()|, args)   (not sys!perform)
Remove method:     my_exemplar.remove_method(:name)   (upgrade scripts only)
File header:       #% text_encoding = utf8  /  _package sw
Package-private:   xx!name in exemplar or method — do not reference from other packages
Pragma usage:      usage={subclassable}  or  usage={external}
Pragma topic:      always braced — topic={name}
Debug classify:    classify_level=debug   (REPL-only, not for production callers)
Optional param:    _optional param_name
Varargs:           _gather param_name
Iterator method:   _iter _method ... _loopbody(val) ...
Loop break:        _leave
Loop continue:     _continue
Pragma:            _pragma(classify_level=basic)
Docstring:         ## Description with PARAMS uppercase. Returns ...
Boolean method:    name ending in ?   (returns _true/_false, usable as condition)
Kleenean method:   name ending in ??  (returns _true/_maybe/_false, compare with _is)
Slot-like method:  no brackets — my_obj.name
Non-slot method:   brackets — my_obj.calculate()
Setter:            foo<<  (paired with slot-like getter foo)
String concat:     sw:write_string(a, b, c)   (not a + b + c)
Empty test:        col.empty?     (not col.empty() which clears!)
Symbol parens:     :|my_method()|  (symbol form for a bracketed method name)