-
motoko (
moc)- feat: provide a polymorphic
actorOfPrincipalprimitive (#5882).
- feat: provide a polymorphic
-
motoko (
moc)- Allow destructuring
typeimports fromactor-valued URIs (#5824). - perf: Optimise a few arithmetic/logic operations involving neutral elements (#5706).
- Warn when a
varbinding is never reassigned, suggestingletinstead (#5833). - Adds
--error-format humanoption to print pretty errors with code snippets and labels (#5816), with improved formatting for unused (#5864) and duplicate name (#5865) errors. - Emit machine-applicable code fixes in
--error-format jsondiagnostics for warnings M0223 (redundant type instantiation), M0236 (use dot notation), and M0237 (omit explicit implicit argument). The JSON span format now includesis_primary,label,suggested_replacement, andsuggestion_applicabilityfields, enabling IDEs and tooling to offer automatic fixes (#5831). - Add
--all-libsflag to load all library files from all packages, enabling better diagnostics, e.g. hinting at non-imported items (increases compilation time) (#5861).
- Allow destructuring
-
motoko (
moc)-
Report multiple type errors for compound types at once (#5790).
This means code like
type T = (Na, In)will fail with errors for both the misspelledNaandIntypes at once, so they can be fixed in one go, rather than having to re-run the compiler after fixing the first one. -
Allow
breakandcontinuein loops without labels (#5702). -
Report a better error for labeled
continuetargeting a non-loop (#5800). -
Deprecate older garbage collectors: generational, copying and compating GCs (#5806).
-
Fix contextual dot type note, this should fix the hover hint in the vscode extension, showing the correct function type instead of
()(#5809). -
bugfix: Avoid
moc.jscrashing when passing invalid flags (#5811). -
bugfix: Sometimes
import { type X } = "mo:./X"didn't work, with a confusing error message (#5826). -
Improved type recovery for
letandvardeclarations (enabled only with a type recovery flag for the IDE) (#5819). -
Add
checkWithScopeCachefunction tomoc.js-- a cached version ofcheck(#5820). -
Add
--error-format jsonflag tomocfor machine-readable diagnostic output on stdout in JSON Lines format (#5829). -
Expose contextual dot resolution in
moc.jsvia two new functions:contextualDotSuggestionsreturns matching context-dot functions for a receiver type, andcontextualDotModulereturns the module reference for a resolved context-dot expression. AST expression nodes now carry non-enumerablerawExpreferences, and the root AST node exposes the accumulatedscope(including all transitive imports) to support these APIs (#5797).
-
-
motoko (
moc)-
Warn on unreachable let-else (#5789).
-
bugfix: The source region for
do { ... }blocks now includes thedokeyword too (#5785). -
Omit
blob:*imports frommoc --print-deps(#5781). -
Split unused identifier warnings into separate warnings for shared and non-shared contexts:
M0194for general declarations,M0240for identifiers in shared pattern contexts (e.g.cinshared({caller = c})),M0198for unused fields in object patterns, andM0241for unused fields in shared patterns (e.g.callerinshared({caller})) (#5779). -
Print type constructors using available type paths (#5698).
-
Warn on implicit oneway declarations (#5787).
-
Make the type checker more lenient and continue accumulating typing errors, and try to produce the typed AST even with errors. Enabled only with a type recovery flag for the IDE (Serokell Grant 2 Milestone 3) (#5776).
-
Explain subtype failures (#5643).
-
Removes the Viper support (#5751).
-
Allows resolving local definitions for context-dot (#5731).
Extends contextual-dot resolution to consider local definitions first, to make the following snippet type check. Local definitions take precedence over definitions that are in scope via modules.
func first<A>(self : [A]) : A { return self[0] }; assert [1, 2, 3].first() == 1
- Add privileged primitive for setting Candid type table cutoff (#5642).
-
-
motoko (
moc)-
Shorter, simpler error messages for generic functions (#5650). The compiler now tries to point to the first problematic expression in the function call, rather than the entire function call with type inference details. Simple errors only mention closed types; verbose errors with unsolved type variables are only shown when necessary.
-
Improved error messages for context dot: only the receiver type variables are solved, remaining type variables stay unsolved, not solved to
AnyorNon(#5634). -
Fixed the type instantiation hint to have the correct arity (#5634).
-
Fix for #5618 (compiling dotted
awaits) (#5622). -
Improved type inference of the record update syntax (#5625).
-
New flag
--error-recoveryto enable reporting of multiple syntax errors (#5632). -
Improved solving and error messages for invariant type parameters (#5464). Error messages now include suggested type instantiations when there is no principal solution.
Invariant type parameters with bounds like
Int <: U <: Any(when the upper bound isAny) can now be solved by choosing the lower bound (Inthere) when it has no proper supertypes other thanAny. This means that when choosing between exactly two solutions: the lower bound andAnyas the upper bound, the lower bound is chosen as the solution for the invariant type parameter (Uhere). Symmetrically, with bounds likeNon <: U <: Nat(when the lower bound isNon), the upper bound (Nathere) is chosen when it has no proper subtypes other thanNon.For example, the following code now compiles without explicit type arguments:
import VarArray "mo:core/VarArray"; let varAr = [var 1, 2, 3]; let result = VarArray.map(varAr, func x = x : Int);
This compiles because the body of
func x = x : Inthas typeInt, which implies thatInt <: U <: Any. SinceInthas no proper supertypes other thanAny, it can be chosen as the solution for the invariant type parameterU, resulting in the output type[var Int].However, note that if the function body was of type
Nat, it would not compile, becauseNatis a proper subtype ofInt(Nat <: Int). In this case, there would be no principal solution withNat <: U <: Any, and the error message would suggest:Hint: Add explicit type instantiation, e.g. <Nat, Nat>The suggested type instantiation can be used to fix the code:
let result = VarArray.map<Nat, Nat>(varAr, func x = x);
Note that the error message suggests only one possible solution, but there may be alternatives. In the example above,
<Nat, Int>would also be a valid instantiation. -
Fixes type inference of deferred funcs that use
returnin their body (#5615). Avoids confusing errors likeBool does not have expected type Tonreturnexpressions. Should type check successfully now. -
Add warning
M0239that warns when binding a unit()value byletorvar(#5599). -
Use
selfparameter, notSelftype, to enable contextual dot notation (#5574). -
Add (caffeine) warning
M0237(#5588). Warns if explicit argument could have been inferred and omitted, e.g.a.sort(Nat.compare)vsa.sort(). (allowed by default, warn with-W 0237). -
Add (caffeine) warning
M0236(#5584). Warns if contextual dot notation could have been used, e.g.Map.filter(map, ...)vsmap.filter(...). Does not warn for binaryM.equals(e1, e2)orM.compareXXX(e1, e2). (allowed by default, warn with-W 0236). -
Add (caffeine) deprecation code
M0235(#5583). Deprecates any public types and values with special doc comment/// @deprecated M0235. (allowed by default, warn with-W 0235). -
Experimental support for
implicitargument declarations (#5517). -
Experimental support for Mixins (#5459).
-
bugfix: importing of
blob:file:URLs in subdirectories should work now (#5507, #5569). -
bugfix: escape
composite_queryfields on the Candid side, as it is a keyword (#5617). -
bugfix: implement Candid spec improvements (#5504, #5543, #5505). May now cause rejection of certain type-incorrect Candid messages that were accepted before.
-
-
motoko (
moc)-
Added
Prim.getSelfPrincipal<system>() : Principalto get the principal of the current actor (#5518). -
Contextual dot notation (#5458):
Writing
e0.f(<Ts>)(e1,...,en)is short-hand forM.f(<Ts>)(e0, e1, ..., en), provided:fis not already a field or special member ofe0.- There is a unique module
Mwith memberfin the context that declares:- a public type
Self<T1,..., Tn>that can be instantiated to the type ofe0; - a public field
fthat accepts(e0, e2, ..., en)as arguments.
- a public type
-
Added an optional warning for redundant type instantiations in generic function calls (#5468). Note that this warning is off by default. It can be enabled with the
-W M0223flag. -
Added
-Aand-Wflags to disable and enable warnings given their message codes (#5496).For example, to disable the warning for redundant
stablekeyword, use-A M0217. To enable the warning for redundant type instantiations, use-W M0223. Multiple warnings can be disabled or enabled by comma-separating the message codes, e.g.-A M0217,M0218. Both flags can be used multiple times. -
Added
-Eflag to treat specified warnings as errors given their message codes (#5502). -
Added
--warn-helpflag to show available warning codes, current lint level (Allowed, Warn or Error), and descriptions (#5502). -
moc.js: AddedsetExtraFlagsmethod for passing some of themocflags (#5506).
-
-
motoko (
moc)-
Added primitives to access canister environment variables (#5443):
Prim.envVarNames : <system>() -> [Text] Prim.envVar : <system>(name : Text) -> ?Text
These require
systemcapability to prevent supply-chain attacks. -
Added ability to import
Blobs from the local file system by means of theblob:file:URI scheme (#4935).
-
-
motoko (
moc)-
bugfix: fix compile-time exception showing
???type when using 'improved type inference' (#5423). -
Allow inference of invariant type parameters, but only when the bound/solution is an 'isolated' type (meaning it has no proper subtypes nor supertypes other than
Any/None) (#5359). This addresses the limitation mentioned in #5180. Examples of isolated types include all primitive types exceptNatandInt, such asBool,Text,Blob,Float,Char,Int32, etc.NatandIntare not isolated becauseNatis a subtype ofInt(Nat <: Int).For example, the following code now works without explicit type arguments:
import VarArray "mo:core/VarArray"; let varAr = [var 1, 2, 3]; let result = VarArray.map(varAr, func x = debug_show (x) # "!"); // [var Text]
-
ignorenow warns when its argument has typeasync*, as it will have no effect (#5419). -
bugfix: fix rare compiler crash when using a label and identifier of the same name in the same scope (#5283, #5412).
-
bugfix:
mocnow warns about parentheticals onasync*calls, and makes sure that they get discarded (#5415).
-
-
motoko (
moc)-
Breaking change: add new type constructor
weak Tfor constructing weak references.Prim.allocWeakRef: <T>(value : T) -> weak T Prim.weakGet: <T>weak T -> ?(value : T) Prim.isLive: weak Any -> Bool
A weak reference can only be allocated from a value whose type representation is always a heap reference;
allowWeakRefwill trap on values of other types. A weak reference does not count as a reference to its value and allows the collector to collect the value once no other references to it remain.weakGetwill returnnull, andisLivewill return false once the value of the reference has been collected by the garbage collector. The type constructorweak Tis covariant.Weak reference operations are only supported with --enhanced-orthogonal-persistence and cannot be used with the classic compiler.
-
bugfix: the EOP dynamic stable compatibility check incorrectly rejected upgrades from
Nullto?T(#5404). -
More explanatory upgrade error messages with detailing of cause (#5391).
-
Improved type inference for calling generic functions (#5180). This means that type arguments can be omitted when calling generic functions in most common cases. For example:
let ar = [1, 2, 3]; Array.map(ar, func x = x * 2); // Needs no explicit type arguments anymore!
Previously, type arguments were usually required when there was an anonymous not annotated function in arguments. The reason being that the type inference algorithm cannot infer the type of
funcs in general, e.g.func x = x * 2cannot be inferred without knowing the type ofx.Now, the improved type inference can handle such
funcs when there is enough type information from other arguments. It works by splitting the type inference into two phases:- In the first phase, it infers part of the instantiation from the non-
funcarguments. The goal is to infer all parameters of thefuncarguments, e.g.xin the example above. Thearargument in the example above is used to infer the partial instantiationArray.map<Nat, O>, leaving the second type argumentOto be inferred in the second phase. With this partial instantiation, it knows thatx : Nat. - In the second phase, it completes the instantiation by inferring the bodies of the
funcarguments; assuming that all parameters were inferred in the first phase. In the example above, it knows thatx : Nat, so inferring the bodyx * 2will infer the typeOto beNat. With this, the full instantiationArray.map<Nat, Nat>is inferred, and the type arguments can be omitted.
Limitations:
-
Invariant type parameters must be explicitly provided in most cases. e.g.
VarArray.mapmust have the return type annotation:let result = VarArray.map<Nat, Nat>(varAr, func x = x * 2);
Or the type of the result must be explicitly provided:
let result : [var Nat] = VarArray.map(varAr, func x = x * 2);
-
When there is not enough type information from the non-
funcarguments, the type inference will not be able to infer thefuncarguments. However this is not a problem in most cases.
- In the first phase, it infers part of the instantiation from the non-
-
-
motoko (
moc)-
bugfix:
persistentimported actor classes incorrectly rejected as non-persistent(#5667). -
Allow matching type fields of modules and objects in patterns (#5056) This allows importing a type from a module without requiring an indirection or extra binding.
// What previously required indirection, ... import Result "mo:core/Result"; type MyResult<Ok> = Result.Result<Ok, Text>; // or rebinding, ... import Result "mo:core/Result"; type Result<Ok, Err> = Result.Result<Ok, Err>; type MyResult<Ok> = Result<Ok, Text>; // can now be written more concisely as: import { type Result } "mo:core/Result"; type MyResult<Ok> = Result<Ok, Text>;
-
-
motoko (
moc)-
Breaking change: the
persistentkeyword is now required on actors and actor classes (#5320, #5298). This is a transitional restriction to force users to declare transient declarations astransientand actor/actor classes aspersistent. New error messages and warnings will iteratively guide you to inserttransientandpersistentas required, after which anystablekeywords can be removed. Use the force.In the near future, the
persistentkeyword will be made optional again, andletandvardeclarations within actor and actor classes will bestable(by default) unless declaredtransient, inverting the previous default for non-persistentactors. The goal of this song and dance is to always default actor declarations to stable unless declaredtransientand make thepersistentkeyword redundant. -
Breaking change: enhanced orthogonal persistence is now the default compilation mode for
moc(#5305). Flag--enhanced-orthogonal-persistenceis on by default. Users not willing or able to migrate their code can opt in to the behavior of moc prior to this release with the new flag--legacy-persistence. Flag--legacy-persistenceis required to select the legacy--copying-gc(the previous default),--compacting-gc, orgenerational-gc.As a safeguard, to protect users from unwittingly, and irreversibly, upgrading from legacy to enhanced orthogonal persistence, such upgrades will fail unless the new code is compiled with flag
--enhanced-orthogonal-persistenceexplicitly set. New projects should not require the flag at all (#5308) and will simply adopt enhanced mode.To recap, enhanced orthogonal persistence implements scalable and efficient orthogonal persistence (stable variables) for Motoko:
- The Wasm main memory (heap) is retained on upgrade with new program versions directly picking up this state.
- The Wasm main memory has been extended to 64-bit to scale as large as stable memory in the future.
- The runtime system checks that data changes of new program versions are compatible with the old state.
Implications:
- Upgrades become extremely fast, only depending on the number of types, not on the number of heap objects.
- Upgrades will no longer hit the IC instruction limit, even for maximum heap usage.
- The change to 64-bit increases the memory demand on the heap, in worst case by a factor of two.
- For step-wise release handling, the IC initially only offers a limited capacity of the 64-bit space (e.g. 4GB or 6GB), that will be gradually increased in future to the capacity of stable memory.
- There is moderate performance regression of around 10% for normal execution due to combined related features (precise tagging, change to incremental GC, and handling of compile-time-known data).
- The garbage collector is fixed to incremental GC and cannot be chosen.
Float.format(#hex prec, x)is no longer supported (expected to be very rarely used in practice).- The debug print format of
NaNchanges (originallynan).
-
Fixed file indices in the DWARF encoding of the
debug_linesection. This change is only relevant when using the-gflag (#5281). -
Improved large array behavior under the incremental GC (#5314)
-
-
motoko (
moc)-
Lazy WASM imports: avoids unnecessary function imports from the runtime, improving compatibility with more runtime versions (#5276).
-
Improved stable compatibility error messages to be more concise and clear during canister upgrades (#5271).
-
-
motoko (
moc)-
Introduce
await?to synchronizeasyncfutures, avoiding the commit point when already fulfilled (#5215). -
Adds a
Prim.Array_tabulateVarfunction, that allows faster initialization of mutable arrays (#5256). -
optimization: accelerate IR type checking with caching of sub, lub and check_typ tests (#5260). Reduces need for
-no-check-irflag.
-
-
Added the
rootKeyprimitive (#4994). -
optimization: for
--enhanced-orthogonal-persistence, reduce code-size and compile-time by sharing more static allocations (#5233, #5242). -
bugfix: fix
-fshared-codebug (#5230). -
bugfix: avoid stack overflow and reduce code complexity for large EOP canisters (#5218).
-
motoko (
moc)-
Enhance syntax error messages with examples and support find-references and go-to-definition functionality for fields in the language server (Serokell, Milestone-3) (#5076).
-
bugfix:
mo-docnow correctly extracts record-patterned function arguments (#5128).
-
-
motoko (
moc)- Added new primitives for cost calculation:
costCall,costCreateCanister,costHttpRequest,costSignWithEcdsa,costSignWithSchnorr(#5001).
- Added new primitives for cost calculation:
-
motoko (
moc)- Added new primitives for exploding fixed-width numbers to bytes:
explodeNat16,explodeInt16,explodeNat32,explodeInt32,explodeNat64,explodeInt64(#5057).
- Added new primitives for exploding fixed-width numbers to bytes:
-
motoko (
moc)-
Add random-access indexing to
Blob, support special methodsgetandkeys(#5018). -
Officializing enhanced orthogonal persistence (EOP) after a successful beta testing phase (#5035).
EOP needs to be explicitly enabled by the
--enhanced-orthogonal-persistencecompiler flag or viaargsindfx.json:"type" : "motoko" ... "args" : "--enhanced-orthogonal-persistence" -
Add support for parser error recovery to improve LSP (Serokell, Milestone-2) (#4959).
-
We now provide a proper
motoko-modeforemacs(#5043). -
bugfix: Avoid generating new Candid
types arising from equal homonymous Motokotype(if possible) in service definitions (#4309, #5013). -
bugfix: Provide a more consistent framework for dealing with internally generated type indentifiers, fixing caching bugs, e.g. in the VSCode plugin (#5055).
-
-
motoko (
moc)-
Preserve and infer named types both to improve displayed types in error messages, and to preserve function signatures when deriving Candid types (#4943). The names remain semantically insignificant and are ignored when comparing types for subtyping and equality.
For example,
func add(x : Int, y : Int) : (res : Int) = x + y;
now has inferred type:
(x : Int, y: Int) -> (res : Int)
Previously, the type would be inferred as:
(Int, Int) -> Int
-
Refine the
*.moststable signature file format to distinguish stable variables that are strictly required by the migration function rather than propagated from the actor body (#4991). This enables the stable compatibility check to verify that a migration function will not fail due to missing required fields. Required fields are declaredin, notstable, in the actor's pre-signature. -
Added improved LSP cache for typechecking (thanks to Serokell) (#4931).
-
Reduce enhanced-orthogonal-persistence memory requirements using incremental allocation within partitions (#4979).
-
-
motoko-base
- Deprecated
ExperimentalCycles.add, use a parenthetical(with cycles = <amount>) <send>instead (caffeinelabs/motoko-base#703).
- Deprecated
-
motoko (
moc)-
To prevent implicit data loss due to upgrades, stable fields may no longer be dropped or promoted to lossy supertypes (#4970). Removing a stable variable, or promoting its type to a lossy supertype by, for example, dropping nested record fields, now requires an explicit migration expression. Promotion to non-lossy supertypes, such as
NattoIntor{#version1}to{#version1; #version2}, is still supported. -
Now we detect (and warn for) fields in literal objects and record extensions, (as well as
publicfields or types inobjectandclass) that are inaccessible due to a user-specified type constraint (#4978, #4981). -
We now provide release artefacts for
Darwin-arm64andLinux-aarch64platforms (#4952).
-
-
motoko (
moc)- Performance improvements to the default timer mechanism (#3872, #4967).
-
documentation (
mo-doc)- Changed extracted
letbindings with manifest function type to appear asfuncs (#4963).
- Changed extracted
-
motoko (
moc)- Added
canisterSubnetprimitive (#4857).
- Added
-
motoko-base
-
Added
burn : <system>Nat -> NattoExperimentalCycles(caffeinelabs/motoko-base#699). -
Added
ExperimentalInternetComputer.subnet(caffeinelabs/motoko-base#700).
-
-
motoko (
moc)- Added primitive predicate
isReplicatedExecution(#4929).
- Added primitive predicate
-
motoko-base
-
Added
isRetryPossible : Error -> BooltoError(dfinity/motoko-base#692). -
Made
ExperimentalInternetComputer.replyDeadlineto return an optional return type (dfinity/motoko-base#693). Caveat: Breaking change (minor). -
Added
isReplicated : () -> BooltoExperimentalInternetComputer(caffeinelabs/motoko-base#694).
-
-
motoko (
moc)-
Added support for sending
cyclesand setting atimeoutin parentheticals. This is an experimental feature, with new syntax, and now also allowing best-effort message sends. The legacy callCycles.add<system>is still supported (#4608).For example, if one wants to attach cycles to a message send, one can prefix it with a parenthetical
(with cycles = 5_000) Coins.mine(forMe);
Similarly a timeout for best-effort execution (also called bounded-wait) can be specified like
let worker = (with timeout = 15) async { /* worker loop */ };
A common base for fields optionally goes before the
withand can be customised with both fields after it. Please consult the documentation for more usage information. -
bugfix:
mo-docwill now generate documentation foractors andactor classes (#4905). -
bugfix: Error messages now won't suggest privileged/internal names (#4916).
-
-
motoko (
moc)- bugfix: Be more precise when reporting type errors in
migrationfields (#4888).
- bugfix: Be more precise when reporting type errors in
-
motoko (
moc)-
Add
.values()as an alias to.vals()for arrays andBlobs (#4876). -
Support explicit, safe migration of persistent data allowing arbitrary transformations on a selected subset of stable variables. Additional static checks warn against possible data loss (#4812).
As a very simple example:
import Nat32 "mo:base/Nat32"; (with migration = func (old : { var size : Nat32 }) : { var length : Nat } = { var length = Nat32.toNat(old.size) } ) persistent actor { var length : Nat = 0; }
may be used during an upgrade to rename the stable field
sizetolength, and change its type fromNat32toNat.See the documentation for full details.
-
-
motoko (
moc)- Support passing cycles in primitive
call_raw(resp.ExperimentalInternetComputer.call) (#4868).
- Support passing cycles in primitive
-
motoko (
moc)-
Support the low Wasm memory hook:
system func lowmemory() : async* () { ... }(#4849). -
Breaking change (minor) (#4854):
-
For enhanced orthogonal persistence: The Wasm persistence modes used internally for canister upgrades have been changed to lower case names,
keepandreplaceand instead ofKeepandReplace:If using actor class instances with enhanced orthogonal persistence, you would need to recompile the program and upgrade with latest
mocanddfx. Otherwise, no action is needed.
-
-
bugfix: Checks and mitigations that timer servicing works (#4846).
-
bugfix: Some valid upgrades deleting a stable variable could fail the
--enhanced-orthogonal-persistencestable compatibility check due to a bug (#4855).
-
-
motoko (
moc)-
Breaking change (minor) (#4786):
-
Add new keyword
transientwith exactly the same meaning as the old keywordflexible(but a more familiar reading). -
Add keyword
persistent.When used to modify the
actorkeyword in an actor or actor class definition, the keyword declares that the default stability of aletorvardeclaration isstable(notflexibleortransient).For example, a stateful counter can now be declared as:
persistent actor { // counts increments since last upgrade transient var invocations = 0; // counts increments since first installation var value = 0; // implicitly `stable` public func inc() : async () { value += 1; invocations += 1; } }
On upgrade, the transient variable
invocationswill be reset to0andvalue, now implicitlystable, will retain its current value.Legacy actors and classes declared without the
persistentkeyword have the same semantics as before.
-
-
Added new primitive
replyDeadline : () -> Nat64to obtain when a response for a best-effort message is due (#4795). -
bugfix: fail-fast by limiting subtyping depth to avoid reliance on unpredictable stack overflow (#3057, #4798).
-
-
motoko-base
-
Added
Text.fromListandText.toListfunctions (caffeinelabs/motoko-base#676). -
Added
Text.fromArray/fromVarArrayfunctions (caffeinelabs/motoko-base#674). -
Added
replyDeadlinetoExperimentalInternetComputer(dfinity/motoko-base#677).
-
-
motoko (
moc)- refactoring: Updating and simplifying the runtime system dependencies (#4677).
-
motoko-base
-
Breaking change (minor):
Float.format(#hex)is no longer supported. This is because newer versions of Motoko (such as with enhanced orthogonal persistence) rely on the Rust-native formatter that does not offer this functionality. It is expected that this formatter is very rarely used in practice (dfinity/motoko-base#589). -
Formatter change (minor): The text formatting of
NaN, positive or negative, will beNaNin newer Motoko versions, while it wasnanor-nanin older versions (dfinity/motoko-base#589).
-
-
motoko (
moc)- typing: suggest conversions between primitive types from imported libraries
and, with
--ai-errors, all available package libraries (#4747).
- typing: suggest conversions between primitive types from imported libraries
and, with
-
motoko-base
- Add modules
OrderedMapandOrderedSetto replaceRBTreewith improved functionality, performance and ergonomics avoiding the need for preupgrade hooks (thanks to Serokell) (dfinity/motoko-base#662).
- Add modules
-
motoko (
moc)-
Made the
actor's self identifier available in the toplevel block. This also allows using functions that refer to self from the initialiser (e.g. calls tosetTimer) (#4719). -
bugfix:
actor <exp>now correctly performs definedness tracking (#4731).
-
-
motoko (
moc)-
Improved error messages for unbound identifiers and fields that avoid reporting large types and use an edit-distance based metric to suggest alternatives (#4720).
-
Flag
--ai-errorsto tailor error messages to AI clients (#4720). -
Compilation units containing leading type definitions are now rejected with an improved error message (#4714).
-
bugfix:
floatToInt64now behaves correctly in the interpreter too (#4712).
-
-
motoko (
moc)-
Added a new primitive
cyclesBurn : <system> Nat -> Natfor burning the canister's cycles programmatically (#4690). -
For beta testing: Support enhanced orthogonal persistence, enabled with new
mocflag--enhanced-orthogonal-persistence(#4193).This implements scalable and efficient orthogonal persistence (stable variables) for Motoko:
- The Wasm main memory (heap) is retained on upgrade with new program versions directly picking up this state.
- The Wasm main memory has been extended to 64-bit to scale as large as stable memory in the future.
- The runtime system checks that data changes of new program versions are compatible with the old state.
Implications:
- Upgrades become extremely fast, only depending on the number of types, not on the number of heap objects.
- Upgrades will no longer hit the IC instruction limit, even for maximum heap usage.
- The change to 64-bit increases the memory demand on the heap, in worst case by a factor of two.
- For step-wise release handling, the IC initially only offers a limited capacity of the 64-bit space (e.g. 4GB or 6GB), that will be gradually increased in future to the capacity of stable memory.
- There is moderate performance regression of around 10% for normal execution due to combined related features (precise tagging, change to incremental GC, and handling of compile-time-known data).
- The garbage collector is fixed to incremental GC and cannot be chosen.
Float.format(#hex prec, x)is no longer supported (expected to be very rarely used in practice).- The debug print format of
NaNchanges (originallynan).
To activate enhanced orthogonal persistence under
dfx, the following command-line argument needs to be specified indfx.json:... "type" : "motoko" ... "args" : "--enhanced-orthogonal-persistence" ...BREAKING CHANGE (Minor): changes some aspects of
Floatformatting.For more information, see:
- The Motoko design documentation
design/OrthogonalPersistence.md - The Motoko user documentation
doc/md/canister-maintenance/upgrades.md.
-
Candid decoding: impose an upper limit on the number of values decoded or skipped in a single candid payload, as a linear function,
max_values, of binary payload size.max_values(blob) = (blob.size() * numerator)/denominator + biasThe current default settings are
{numerator = 1; denominator = 1; bias = 1024 }, allowing a maximum of 1024 values plus one additional value per byte in the payload.While hopefully not required, the constant factors can be read/modified using system functions:
- Prim.setCandidLimits:
<system>{numerator : Nat32; denominator : Nat32; bias : Nat32 } -> () - Prim.getCandidLimits:
<system>() -> {numerator : Nat32; denominator : Nat32; bias : Nat32 }
- Prim.setCandidLimits:
-
-
motoko (
moc)-
Added a new command-line flag
--print-source-on-errorto print source code context on error (#4650). -
debugging:
__motoko_runtime_information()as privileged query for runtime statistics (#4635).Exposing a privileged system-level query function
__motoko_runtime_information()that reports the current runtime statistics of the canister, such as the heap size, the total number of allocated objects, the total amount of reclaimed memory and more. This is useful because several statistics of the reported information cannot be inspected on the IC replica dashboard as they are internal to the Motoko runtime system. This query is only authorized to the canister controllers and self-calls of the canister.__motoko_runtime_information : () -> { compilerVersion : Text; rtsVersion : Text; garbageCollector : Text; sanityChecks : Nat; memorySize : Nat; heapSize : Nat; totalAllocation : Nat; reclaimed : Nat; maxLiveSize : Nat; stableMemorySize : Nat; logicalStableMemorySize : Nat; maxStackSize : Nat; callbackTableCount : Nat; callbackTableSize : Nat; }
-
-
motoko-base
- Added
Iter.concatfunction (thanks to AndyGura) (dfinity/motoko-base#650).
- Added
-
motoko (
moc)-
feat:
finallyclauses fortryexpressions (#4507).A trailing
finallyclause totry/catchexpressions facilitates structured resource deallocation (e.g. acquired locks, etc.) and similar cleanups in the presence of control-flow expressions (return,break,continue,throw). Additionally, in presence offinallythecatchclause becomes optional and and any uncaught error from thetryblock will be propagated, after executing thefinallyblock.Note:
finally-expressions that are in scope will be executed even if an execution path following anawait-expression traps. This feature, formerly not available in Motoko, allows programmers to implement cleanups even in the presence of traps. For trapping execution paths prior to anyawait, the replica-provided state roll-back mechanism ensures that no cleanup is required.The relevant security best practices are accessible at https://internetcomputer.org/docs/current/developer-docs/security/security-best-practices/inter-canister-calls#recommendation
BREAKING CHANGE (Minor):
finallyis now a reserved keyword, programs using this identifier will break. -
bugfix:
mo-docwill now generate correct entries forpublicvariables (#4626).
-
-
motoko (
moc)-
feat:
motoko-sancontributions by Serokell. Now able to verify some simple but non-trivial actors (thanks to the entire Serokell team) (#4500). -
bugfix: Corrects the interpreter (and compiler) to recognise certain type parameters as callable function types (#4617).
-
-
motoko (
moc)-
deprecation: Deprecate the use of base library's
ExperimentalStableMemory(ESM) (#4573). Newmocflag--experimental-stable-memory <n>controls the level of deprecation:- n < 0: error on use of stable memory primitives.
- n = 0: warn on use of stable memory primitives.
- n > 1: warning-less use of stable memory primitives (for legacy applications).
Users of ESM should consider migrating their code to use isolated regions (library
Region.mo) instead.
-
bugfix: Fix the detection of unused declarations in
switchandcatchalternatives (#4560). -
improvement: Only warn on unused identifiers if type checking is error-free (#4561).
-
-
motoko (
moc)-
feat: Custom error message for unused, punned field bindings (#4454).
-
feat: Don't report top-level identifiers as unused (#4452).
-
bugfix: Declaring
<system, ...>capability on a class enables system capabilities in its body (#4449). -
bugfix: Fix crash compiling actor reference containing an
await(#4418, #4450). -
bugfix: Fix crash when compiling with flag
--experimental-rtti(#4434).
-
-
motoko (
moc)-
Warn on detection of unused identifiers (code
M0194) (#4377).- By design, warnings are not emitted for code imported from a package.
- A warning can be suppressed by replacing the identifier entirely by a wildcard
_, or by prefixing it with an_, e.g. replacexby_x.
Limitations: recursive and mutually recursive definitions are considered used, even if never referenced outside the recursive definition.
-
Remove
__get_candid_interface_tmp_hackendpoint. Candid interface is already stored as canister metadata, this temporary endpoint is redundant, thus removed. (#4386) -
Improved capability system, introducing a synchronous (
system) capability (#4406).actorinitialisation body,pre/postupgradehooks,asyncfunction bodies (and blocks) possess this capability. Functions (and classes) can demand it by prependingsystemto the type argument list. The capability can be forwarded in calls by mentioning<system, …>in the instantiation parameter list.BREAKING CHANGE (Minor): A few built-in functions have been marked with demand for the
systemcapability. In order to call these, the full call hierarchy needs to be adapted to pass thesystemcapability. -
Introduced the feature for precise tagging of scalar values (#4369).
Controlled by flag
--experimental-rtti(off by default). Minor performance changes for arithmetic expected. We advise to only turn on the feature for testing, as currently no productive upsides exist (though future improvements will depend on it), and performance of arithmetic will degrade somewhat. See the PR for the whole picture.
-
-
motoko-base
- Added
Option.equalfunction (thanks to ByronBecker) (dfinity/motoko-base#615).
- Added
-
motoko (
moc)-
Officializing the new incremental garbage collector after a successful beta testing phase. The incremental GC can be enabled by the
mocflag--incremental-gc(#3837) and is designed to scale for large program heap sizes.Note: While resolving scalability issues with regard to the instruction limit of the GC work, it is now possible to hit other scalability limits:
- Out of memory: A program can run out of memory if it fills the entire memory space with live objects.
- Upgrade limits: When using stable variables, the current mechanism of serialization and deserialization to and from stable memory can exceed the instruction limit or run out of memory.
Recommendations:
- Test the upgrade: Thoroughly test the upgrade mechanism for different data volumes and heap sizes and conservatively determine the amount of stable data that is supported when upgrading the program.
- Monitor the heap size: Monitor the memory and heap size (
Prim.rts_memory_size()andPrim.rts_heap_size()) of the application in production. - Limit the heap size: Implement a custom limit in the application to keep the heap size and data volume below the scalability limit that has been determined during testing, in particular for the upgrade mechanism.
- Avoid large allocations per message: Avoid large allocations of 100 MB or more per message, but rather distribute larger allocations across multiple messages. Large allocations per message extend the duration of the GC increment. Moreover, memory pressure may occur because the GC has a higher reclamation latency than a classical stop-the-world collector.
- Consider a backup query function: Depending on the application case, it can be beneficial to offer an privileged query function to extract the critical canister state in several chunks. The runtime system maintains an extra memory reserve for query functions. Of course, such a function has to be implemented with a check that restricts it to authorized callers only. It is also important to test this function well.
- Last resort if memory would be full: Assuming the memory is full with objects that have shortly become garbage before the memory space has been exhausted, the canister owner or controllers can call the system-level function
__motoko_gc_trigger()multiple times to run extra GC increments and complete a GC run, for collecting the latest garbage in a full heap. Up to 100 calls of this function may be needed to complete a GC run in a 4GB memory space. The GC keeps an specific memory reserve to be able to perform its work even if the application has exhausted the memory. Usually, this functionality is not needed in practice but is only useful in such exceptional cases.
-
Allow type annotations on free-standing
object/module/actorblocks, in order to perform a conformity check with an interface type (#4324).
-
-
motoko (
moc)-
Include doc comments to Candid interfaces generated via the
--idlflag (#4334). -
bugfix: fix broken implementations of
Region.loadNat32,Region.storeNat32,Region.loadInt32,Region.storeInt32(#4335). Values previously stored with the broken 32-bit operations must be loaded with care. If bit 0 is clear, the original value can be obtained by an arithmetic shift right by 1 bit. If bit 0 is set, the value cannot be trusted and should be ignored (it encodes some transient address of a boxed value).
-
-
motoko-base
-
Added
ExperimentalInternetComputer.performanceCounterfunction to get the raw performance counters (dfinity/motoko-base#600). -
Added
Array.takefunction to get some prefix of an array (dfinity/motoko-base#587). -
Deprecated
TrieSet.memin favor ofTrieSet.has(dfinity/motoko-base#576). -
bugfix:
Array.chain(as, f)was incorrectly trapping whenf(a)was an empty array (dfinity/motoko-base#599).
-
-
motoko (
moc)-
bugfix: separate tag from underscore in coverage warnings (#4274).
-
Code compiled for targets WASI (
-wasi-system-api) and pure Wasm (-no-system-api) can now use up to 4GB of (efficiently emulated) stable memory, enabling more offline testing of, for example, stable data structures built using librariesRegions.moandExperimentalStableMemory.mo. Note that any Wasm engine (such aswasmtime), used to execute such binaries, must support and enable Wasm featuresmulti-memoryandbulk-memory(as well as the standard NaN canonicalization) (#4256). -
bugfix: fully implement
Region.loadXXX/storeXXXforInt8,Int16andFloat(#4270). -
BREAKING CHANGE (Minor): values of type
Principalare now constrained to contain at most 29 bytes, matching the IC's notion of principal (#4268).In particular:
-
An actor
importwill be statically rejected if the binary representation of the (aliased) textually encoded principal contains strictly more than 29 bytes. -
Principal.fromBlob(b)will trap ifbcontains strictly more than 29 bytes. -
The actor literal,
actor <exp>, will trap if the binary representation of of the textually encoded principal<exp>contains strictly more than 29 bytes.
-
-
-
motoko-base
- bugfix: fix
Array.tabulateVarto avoid repeated side-effects (dfinity/motoko-base#596)
- bugfix: fix
-
motoko (
moc)-
bugfix: fix assertion failure renaming
or-patterns (#4236, #4224). -
bugfix: unsuccessful Candid decoding of an optional array now defaults to null instead of crashing (#4240).
-
bugfix: Candid decoding of an optional, unknown variant with a payload now succeeds instead of crashing (#4238).
-
Implement Prim.textLowercase and Prim.textUppercase (via Rust) (#4216).
-
perf: inline sharable low-level functions in generated coded, trading code size for reduced cycle count (#4212). Controlled by flags:
-fno-shared-code(default)-fshared-code(legacy) (Helps mitigate the effect of the IC's new cost model, that increases the cost of function calls).
-
-
motoko-base
-
Added
Principal.toLedgerAccount(dfinity/motoko-base#582). -
Added
Text.toLowercaseandText.toUppercase(dfinity/motoko-base#590).
-
-
motoko (
moc)-
Added a new stable
Regiontype of dynamically allocated, independently growable and isolated regions of IC stable memory (#3768). See documentation. BREAKING CHANGE: stable memory changes may occur that can prevent returning to previousmocversions. -
Added doc comments in generated Candid files (#4178).
-
-
motoko-base
-
Exposed conversions between adjacent fixed-width types (dfinity/motoko-base#585).
-
Added library
Region.mooffering isolated regions of IC stable memory (dfinity/motoko-base#580).
-
-
motoko (
moc)-
Added numerical type conversions between adjacent fixed-width types (#4139).
-
Administrative: legacy-named release artefacts are no longer created (#4111).
-
-
motoko (
moc)-
Performance improvement: lower the default allocation for bignums (#4102).
-
Performance improvement: generate better code for pattern matches on some small variants (#4093).
-
bugfix: don't crash on import of Candid composite queries (#4128).
-
-
motoko (
moc)-
Allow canister controllers to call the
__motoko_stable_var_infoquery endpoint (#4103). (Previously only self-queries were permitted.) -
Performance improvement: reduced cycle consumption for allocating objects (#4095).
-
bugfix: reduced memory consumption in the Motoko Playground (#4106).
-
-
motoko (
moc)-
Allow identifiers in
or-patterns (#3807). Bindings in alternatives must mention the same identifiers and have compatible types:let verbose = switch result { case (#ok) "All is good!"; case (#warning why or #error why) "There is some problem: " # why; }
-
Performance improvement: improved cycle consumption allocating fixed-size objects (#4064). Benchmarks indicate up to 10% less cycles burned for allocation-heavy code, and 2.5% savings in realistic applications.
-
Administrative: binary build artefacts are now available according to standard naming conventions (thanks to EnzoPlayer0ne) (#3997). Please consider transitioning to downloading binaries following the new scheme, as legacy naming will be discontinued at some point in the future.
-
-
motoko (
moc)-
Allow multiline text literals (#3995). For example,
"A horse walks into a bar. The barman says: `Why the long face?`"parses as:
"A horse walks into a bar.\nThe barman says: `Why the long face?`" -
Added pipe operator
<exp1> |> <exp2>and placeholder expression_(#3987). For example:Iter.range(0, 10) |> Iter.toList _ |> List.filter<Nat>(_, func n { n % 3 == 0 }) |> { multiples = _ };
may, according to taste, be a more readable rendition of:
{ multiples = List.filter<Nat>( Iter.toList(Iter.range(0, 10)), func n { n % 3 == 0 }) };However, beware the change of evaluation order for code with side-effects.
-
BREAKING CHANGE (Minor):
New keyword
compositeallows one to declare Internet Computer composite queries (#4003).For example,
public shared composite query func sum(counters : [Counter]) : async Nat { var sum = 0; for (counter in counters.vals()) { sum += await counter.peek(); }; sum }
has type:
shared composite query [Counter] -> async Nat
and can call both
queryand othercomposite queryfunctions.See the documentation for full details.
-
Allow canister imports of Candid service constructors, ignoring the service arguments to import the instantiated service instead (with a warning) (#4041).
-
Allow optional terminal semicolons in Candid imports (#4042).
-
bugfix: allow signed float literals as static expressions in modules (#4063).
-
bugfix: improved reporting of patterns with record types in error messages (#4002).
-
-
motoko-base
- Added more
Array(andText) utility functions (thanks to roman-kashitsyn) (dfinity/motoko-base#564).
- Added more
-
motoko (
moc)- Added fields
sender_canister_versionfor actor class version tracking (#4036).
- Added fields
-
motoko (
moc)-
BREAKING CHANGE (Minor):
or-patterns in function definitions cannot be inferred any more. The new error message suggests to add a type annotation instead. This became necessary in order to avoid potentially unsound types (#4012). -
Added implementation for
ic0.canister_versionas a primitive (#4027). -
Added a more efficient
Prim.blobCompare(thanks to nomeata) (#4009). -
bugfix: minor error in grammar for
async*expressions (#4005).
-
-
motoko-base
- Add
Principal.isControllerfunction (caffeinelabs/motoko-base#558).
- Add
-
motoko (
moc)-
Added implementation for
ic0.is_controlleras a primitive (#3935). -
Added ability to enable the new incremental GC in the Motoko Playground (#3976).
-
-
motoko (
moc)-
For beta testing: Add a new incremental GC, enabled with new moc flag
--incremental-gc(#3837). The incremental garbage collector is designed to scale for large program heap sizes.The GC distributes its workload across multiple steps, called increments, that each pause the mutator (user's program) for only a limited amount of time. As a result, the GC work can fit within the instruction-limited IC messages, regardless of the heap size and the object structures.
According to GC benchmark measurements, the incremental GC is more efficient than the existing copying, compacting, and generational GC in the following regards:
- Scalability: Able to use the full heap space, 3x more object allocations on average.
- Shorter interruptions: The GC pause has a maximum limit that is up to 10x shorter.
- Lower runtimes: The number of executed instructions is reduced by 10% on average (compared to the copying GC).
- Less GC overhead: The amount of GC work in proportion to the user's program work drops by 10-16%.
The GC incurs a moderate memory overhead: The allocated WASM memory has been measured to be 9% higher on average compared to the copying GC, which is the current default GC.
To activate the incremental GC under
dfx, the following command-line argument needs to be specified indfx.json:... "type" : "motoko" ... "args" : "--incremental-gc" ... -
bugfix:
array.vals()now returns a working iterator for mutable arrays (#3497, #3967).
-
-
motoko (
moc)- Performance improvement: optimised code generation for pattern matching that cannot fail (#3957).
-
motoko (
moc)-
Added ability to
mo-docfor rendering documentation of nested modules (#3918). -
bugfix: when re-adding recurrent timers, skip over past expirations (#3871).
-
bugfix: eliminated crash compiling local
asyncfunctions that pattern match on arguments (#3910, #3916).
-
-
motoko (
moc)-
bugfix: avoid compiler crash (regression) when
let-matching on constant variants (#3901, #3903). -
Performance improvement: improved cycle usage when receiving messages (#3893).
-
-
motoko (
moc)-
Performance improvement: Values of variant type that are compile-time known are relegated to the static heap now and don't get allocated each time (#3878).
-
bugfix: the global timer expiration callback was called unnecessarily in the default mechanism (#3883).
-
-
motoko (
moc)-
Performance improvement: UTF-8 coding and validation is now properly tail recursive (#3842).
-
Performance improvement: eliminated bounds checking for certain array accesses (thanks to nomeata) (#3853).
-
Performance improvement: optimized
{array, blob, text}.size()operations (thanks to nomeata) (#3863). -
Performance improvement: efficient tuple results in
switchstatements (thanks to nomeata) (#3865). -
Performance improvement: more efficient untagging operation (#3873).
-
bugfix: restored a grammar regression caused by
let-else(#3869).
-
-
motoko-base
-
Add
Array.subArrayfunction (caffeinelabs/motoko-base#445). -
BREAKING CHANGE (Minor)
Optimized
AssocList.{replace, find}to avoid unnecessary allocation (caffeinelabs/motoko-base#535, caffeinelabs/motoko-base#539). Note: this subtly changes the order in which the key-value pairs occur after replacement. May affect other containers that useAssocList. -
Performance improvement: Optimized deletion for
Trie/TrieMap(caffeinelabs/motoko-base#525).
-
-
motoko (
moc)-
new 'let-else' construct for handling pattern-match failure (#3836). This is a frequently asked-for feature that allows to change the control-flow of programs when pattern-match failure occurs, thus providing a means against the famous "pyramid of doom" issue. A common example is look-ups:
shared func getUser(user : Text) : async Id { let ?id = Map.get(users, user) else { throw Error.reject("no such user") }; id }
Similarly, an expression like
(label v : Bool { let <pat> = <exp> else break v false; true })
evaluates to a
Bool, signifying whether<pat>matches<exp>. -
Improve recursive deserialization capacity to match recursive serialization capacity by reducing Wasm stack consumption (#3809). Because of the bounds on recursion depth imposed by fixed-size stack, the advice remains the same: avoid deeply nested recursive data structures. Think "shallow trees good, very long lists bad".
-
bugfix: stack overflow in UTF-8 encode/decode for
moc.js(#3825).
-
-
motoko-base
- add missing
unshare : Tree<K, V> -> ()method to classRBTree<K, V>to restore objects from saved state (caffeinelabs/motoko-base#532).
- add missing
-
motoko (
moc)-
Add compiler flag
--rts-stack-pages <n>to override default number of pages dedicated to fixed runtime system stack. Now defaults to 32 pages (2MiB) (up from previous 2 pages/128KiB) (#3782). In emergencies, increasing this setting may improve your ability to deserialize deeply nested Candid or stable variable data. -
Add stack overflow detection utilising reserved page (#3793).
-
Performance improvement: heap allocator speedup (#3090, #3790).
-
bugfix: avoid more heap-out-bounds errors during deserialization of stable variables by increasing default runtime system stack from 128KiB to 2MiB (#3782). Note: this is a partial fix, as issues with stack growth remain.
-
-
motoko-base
- bugfix: non-leaky deletion for
RBTree(caffeinelabs/motoko-base#524).
- bugfix: non-leaky deletion for
-
motoko (
moc)-
Performance improvement: faster heap allocation (#3765).
-
bugfix:
asyncreturns involving abbreviated tuple types no longer crash the compiler (#3740, #3741). -
bugfix: avoid quadratic code expansion due to imported, but unused, actor classes (#3758).
-
-
motoko (
moc)-
BREAKING CHANGE
Motoko now implements Candid 1.4 (dfinity/candid#311).
In particular, when deserializing an actor or function reference, Motoko will now first check that the type of the deserialized reference is a subtype of the expected type and act accordingly.
Very few users should be affected by this change in behaviour.
-
BREAKING CHANGE
Failure to send a message no longer traps but, instead, throws a catchable
Errorwith new error code#call_error(#3630).On the IC, the act of making a call to a canister function can fail, so that the call cannot (and will not be) performed. This can happen due to a lack of canister resources, typically because the local message queue for the destination canister is full, or because performing the call would reduce the current cycle balance of the calling canister to a level below its freezing threshold. Such call failures are now reported by throwing an
Errorwith newErrorCode#call_error { err_code = n }, wherenis the non-zeroerr_codevalue returned by the IC. Like other errors, call errors can be caught and handled usingtry ... catch ...expressions, if desired.The constructs that now throw call errors, instead of trapping as with previous version of Motoko are:
- calls to
sharedfunctions (including oneway functions that return()). These involve sending a message to another canister, and can fail when the queue for the destination canister is full. - calls to local functions with return type
async. These involve sending a message to self, and can fail when the local queue for sends to self is full. asyncexpressions. These involve sending a message to self, and can fail when the local queue for sends to self is full.awaitexpressions. These can fail on awaiting an already completed future, which requires sending a message to self to suspend and commit state.
(On the other hand,
async*(being delayed) cannot throw, and evaluatingawait*will at most propagate an error from its argument but not, in itself, throw.)Note that exiting a function call via an uncaught throw, rather than a trap, will commit any state changes and currently queued messages. The previous behaviour of trapping would, instead, discard, such changes.
To appreciate the change in semantics, consider the following example:
actor { var count = 0; public func inc() : async () { count += 1; }; public func repeat() : async () { loop { ignore inc(); } }; public func repeatUntil() : async () { try { loop { ignore inc(); } } catch (e) { } }; }
In previous releases of Motoko, calling
repeat()andrepeatUntil()would trap, leavingcountat0, because each infinite loop would eventually exhaust the message queue and issue a trap, rolling back the effects of each call. With this release of Motoko, callingrepeat()will enqueue severalinc()messages (around 500), thenthrowanErrorand exit with the error result, incrementing thecountseveral times (asynchronously). CallingrepeatUntil()will also enqueue severalinc()messages (around 500) but the error is caught so the call returns, still incrementingcountseveral times (asynchronously).The previous semantics of trapping on call errors can be enabled with compiler option
--trap-on-call-error, if desired, or selectively emulated by forcing a trap (e.g.assert false) when an error is caught.For example,
public func allOrNothing() : async () { try { loop { ignore inc(); } } catch (e) { assert false; // trap! } };
Calling
allOrNothing()will not send any messages: the loop exits with an error on queue full, the error is caught, butassert falsetraps so all queuedinc()messages are aborted. - calls to
-
bugfix: system method
inspectinvolving message with single tuple argument no longer crashes the compiler (#3732, #3733).
-
-
motoko (
moc)-
Added support for
ManagementCanister.raw_randin interpreters (#3693). -
Added preliminary Viper support for
oldexpressions in specifications and calls to private methods (#3675). -
bugfix: in the default timer mechanism
cancelTimersometimes wouldn't actually stop a recurring timer (#3695). -
bugfix: zero negation for floating point numbers in compiled code (#3676).
-
-
motoko-base
-
Add user-facing timer functionality (caffeinelabs/motoko-base#474).
-
Add
Array.size(caffeinelabs/motoko-base#486, caffeinelabs/motoko-base#494). -
Add
TrieSetmethodsisEmpty,isSubset(caffeinelabs/motoko-base#503). -
BREAKING CHANGES (Minor):
- renamed
Float.neqtoFloat.neg(this was a misspelling) - renamed
Nat.neqtoNat.neg(this was a misspelling) - removed second argument from
bitnot(this was an oversight)
- renamed
-
bugfix:
Random.Finite.coindidn't use entropy correctly (caffeinelabs/motoko-base#500). -
bugfix:
Trie.mergeDisjoint(caffeinelabs/motoko-base#505). -
bugfix:
TrieSet.equals(caffeinelabs/motoko-base#503). -
Various documentation fixes and API usage examples.
-
-
motoko (
moc)-
Add new primitives for a default timer mechanism (#3542). These are
setTimer : (delayNanos : Nat64, recurring : Bool, job : () -> async ()) -> (id : Nat) cancelTimer : (id : Nat) -> ()
By defining a
system func timerthe default mechanism can now be overridden by a custom implementation. Additionally by supplying the command-line flag-no-timerall aspects of timers can be suppressed, e.g. for space- or security-sensitive purposes, thus effectively reverting canisters to the pre-timers era. -
bugfix: silence bogus cascading errors in stable compatibility check (#3645).
-
-
motoko (
moc)-
Add new keywords
async*andawait*(note the*) for efficient abstraction of asynchronous code (#3609).<typ> ::= ... async* <typ> delayed, asynchronous computation <exp> ::= ... async* <block-or-exp> delay an asynchronous computation await* <block-or-exp> execute a delayed computation (only in async, async*)This avoids the resource consumption and latency of
async/awaitby only committing state and suspending execution when necessary in theawait*-ed computation, not necessarily at theawait*itself.WARNING: Unlike
async/await:- an
async*value has no effect unlessawait*-ed; - each
await*of the sameasync*value repeats its effects.
This feature is experimental and may evolve in future. Use with discretion. See the manual for details.
- an
-
Suppress GC during IC
canister_heartbeat, deferring any GC to the scheduled Motokoheartbeatsystemmethod (#3623). This is a temporary workaround, to be removed once DTS is supported forcanister_heartbeatitself (#3622). -
Add a new generational GC, enabled with new moc flag
--generational-gc(#3495). The generational garbage collector optimizes for fast reclamation of short-lived objects. New objects are allocated in a young generation that is more frequently collected than the older objects that have already survived a GC run.For many cases, the generational GC is more efficient than the existing compacting GC and copying GCs:
- Lower runtimes: Less number of executed instructions on average.
- Shorter interruptions: Young generation collection entails shorter program interruptions.
To activate the generational GC under
dfx, the following command-line argument needs to be specified indfx.json:... "type" : "motoko" ... "args" : "--generational-gc" ... -
moc.js: add trampoline and step limiter to interpreter, avoiding (some) stackoverflows and hangs (#3618, #3541). Enables execution of larger examples on web pages. -
BREAKING CHANGE (Minor):
Consider records with mutable fields as non-static (#3586). Consequently, an imported library declaring a mutable record is now rejected, not accepted, to be consistent with the declarations of mutable fields and mutable objects.
-
Experimental Viper integration by compiling a very narrow subset of Motoko to the verification intermediate language. See
src/viper/README.mdand the PR for details. (#3477).
-
-
motoko-base
-
Unit tests for Trie and fix for
disj(caffeinelabs/motoko-base#438). -
Respect Trie structure in
filter(caffeinelabs/motoko-base#431, caffeinelabs/motoko-base#438). -
Array module reimplementation, tests and documentation (caffeinelabs/motoko-base#425,caffeinelabs/motoko-base#432).
-
-
motoko (
moc)-
Statically reject shared functions and function types with type parameters (#3519, #3522).
-
Performance improvement:
Array.initandArray.tabulate(#3526).
-
-
motoko-base
-
Add some examples to
Bufferlibrary documentation (caffeinelabs/motoko-base#420). -
Fix another bug in
Bufferlibrary affectingfilterEntries(caffeinelabs/motoko-base#422).
-
-
motoko-base
- Fix bugs in
Bufferlibrary affectingremoveandfilterEntries(caffeinelabs/motoko-base#419).
- Fix bugs in
-
motoko (
moc)-
Halve (default ir-checking) compilation times by optimizing type comparison and hashing (#3463)
-
Add support for type components in object type syntax (#3457, also fixes #3449)
type Record = { type T = Nat; x : Nat};
is now legal. Note the definition of
Tis neither recursive, nor bound inx : Nat, but can refer to an existing recursive type declared in an outer scope. -
-
motoko-base
- Optimized and extended
Bufferlibrary (caffeinelabs/motoko-base#417).
- Optimized and extended
-
motoko (
moc)-
BREAKING CHANGE (Minor): Adds new syntax for merging records (objects) and adding/overwriting fields. The expression
{ baseA and baseB with field1 = val1; field2 = val2 }creates a new record by joining all (statically known) fields from
baseA/Band the explicitly specifiedfield1/2. This is a breaking change, as a new keywordwithhas been added. Restrictions for ambiguous andvarfields from bases apply. (#3084) -
Add new support for installing actor class instances on the IC, enabling specification of canister settings, install, upgrade and reinstall. (#3386)
A new expression
(system <exp> . <id>)where
<exp>is an imported library and<id>is the name of an actor class, accesses a secondary constructor of the class that takes an additional argument controlling the installation.For example,
await (system Lib.Node)(#upgrade a)(i);
upgrades actor
awith the code for a new instance of classLib.Node, passing constructor argument(i). -
Performance improvements for assigment-heavy code (thanks to nomeata) (#3406)
-
-
motoko (
moc)-
add primitives
shiftLeft : (Nat, Nat32) -> Nat shiftRight : (Nat, Nat32) -> Nat
for efficiently multiplying/dividing a
Natby a power of 2 (#3112) -
add primitives
rts_mutator_instructions : () -> Nat rts_collector_instructions : () -> Nat
to report approximate IC instruction costs of the last message due to mutation (computation) and collection (GC), respectively (#3381)
-
-
motoko-base
-
Add
Buffer.fromArray Buffer.fromVarArray
for efficiently adding an array to a
Buffer(caffeinelabs/motoko-base#389) -
Add
Iter.sort : (xs : Iter<A>, compare : (A, A) -> Order) : Iter<A>
for sorting an
Itergiven a comparison function (caffeinelabs/motoko-base#406) -
Performance:
HashMapnow avoids re-computing hashes onresize(caffeinelabs/motoko-base#394)
-
-
motoko (
moc)- The language server now supports explicit symbol imports (thanks to rvanasa) (#3282)
- The language server now has improved support for navigating to definitions in external modules (thanks to rvanasa) (#3263)
- Added a primitive
textCompareallowing more efficient three-wayTextcomparisons (#3298) - Fixed a typing bug with annotated, recursive records (#3268)
-
motoko-base
-
Add
ExperimentalInternetComputer.countInstruction : (comp : () -> ()) -> Nat64
to count the Wasm instructions performed during execution of
comp()(caffeinelabs/motoko-base#381) -
Add
ExperimentalStableMemory.stableVarQuery : () -> (shared query () -> async {size : Nat64})
for estimating stable variable storage requirements during upgrade (caffeinelabs/motoko-base#365)
-
Performance improvement to
Text.compare(caffeinelabs/motoko-base#382)
-
-
motoko (
moc)- Add
to_candid,from_candidlanguage constructs for Candid serialization to/from Blobs (#3155) - New
systemfield 'inspect' for accepting/declining canister ingress messages (see doc) (#3210)
- Add
-
motoko (
moc)- Importing modules by relative path is now more robust (#3215).
- Performance: persisting stable variables to stable memory is now performed in streaming fashion, reducing heap consumption and copying during an upgrade (#3149).
- Performance: local 32- and 64-bit numeric values are now stored in using unboxed form when possible (thanks to nomeata) (#3207).
-
motoko-base
- Fixed a bug in
Trie.filter(andTrie.mapFilter) which could lead to missing matches in some cases (caffeinelabs/motoko-base#371).
- Fixed a bug in
-
motoko (
moc)- Performance: inline prim-wrapping functions (thanks to nomeata) (#3159)
- Improve type pretty printer to mirror type parser (avoids producing unparseable stable variable signatures) (#3190)
- Adds new flag
--omit-metadatato omit certain metadata sections fromactor(andactor class) Wasm (#3164) - Performance: avoid redundant heap allocation when deserializing compact Candid
intandnatvalues (#3173) - Added a primitive to obtain stable variable memory footprint (#3049)
-
motoko-base
- Fixed the 32-bit range limitation of
Hash.hash: Nat -> Nat32and deprecate most functions inHash(caffeinelabs/motoko-base#366). - Add
List.toIter(thanks to hoosan) (caffeinelabs/motoko-base#336).
- Fixed the 32-bit range limitation of
-
motoko (
moc)- bugfix: fix bogus elision of type constructors sharing names with primitive types in
--stable-typessection and.mostfile (#3140)
- bugfix: fix bogus elision of type constructors sharing names with primitive types in
-
motoko (
moc)- bugfix: fix bogus identification of distinct type constructors in --stable-types section and .most file (#3140)
-
motoko (
moc)-
bugfix: fix pretty printing of (stable) types and #3128 (#3130)
- Collect constructors transitively before emitting a .most file.
- Modifies type pretty printer to produce well-formed types and stable type signatures.
-
-
motoko (
moc)- Fix: remove bogus error when transitively importing module with selective field imports (#3121)
- Fix: Treating eponymous types from separate candid files (#3103)
-
Various reports from CI are now pushed to https://dfinity.github.io/motoko (#3113)
-
motoko (
moc)- Emit new ICP metadata custom section 'motoko:compiler' with compiler release or revision in UTF8 (e.g. "0.6.21"). Default is
icp:private(#3091). - Generalized
importsupporting pattern matching and selective field imports (#3076). - Fix: insert critical overflow checks preventing rare heap corruptions in out-of-memory allocation and stable variable serialization (#3077).
- Implement support for 128-bit Cycles-API (#3042).
- Emit new ICP metadata custom section 'motoko:compiler' with compiler release or revision in UTF8 (e.g. "0.6.21"). Default is
-
motoko-base
ExperimentalInternetComputerlibrary, exposing low-level, binarycallfunction (a.k.a. "raw calls") (caffeinelabs/motoko-base#334, Motoko #3806).Principal.fromBlobadded (caffeinelabs/motoko-base#331).
-
motoko
- Implement support for
heartbeatsystem methods (thanks to ninegua) (#2971)
- Implement support for
-
motoko-base
- Add
Iter.filter : <A>(Iter<A>, A -> Bool) -> Iter<A>(thanks to jzxchiang1) (caffeinelabs/motoko-base#328).
- Add
-
motoko-base
- Fixed a bug in the
RBTree.size()method.
- Fixed a bug in the
-
moc
- Add runtime support for low-level, direct access to 64-bit IC stable memory, including documentation.
- Add compiler flag
--max-stable-pages <n>to cap any use ofExperimentalStableMemory.mo(see below), while reserving space for stable variables. Defaults to 65536 (4GiB).
-
motoko-base
- (Officially) add
ExperimentalStableMemory.molibrary, exposing 64-bit IC stable memory
- (Officially) add
-
BREAKING CHANGE (Minor): The previously available (but unadvertised)
ExperimentalStableMemory.mousedNat32offsets. This one usesNat64offsets to (eventually) provide access to more address space.
- Improved handling of one-shot messages facilitating zero-downtime upgrades (#2938).
- Further performance improvements to the mark-compact garbage collector (#2952, #2973).
- Stable variable checking for
moc.js(#2969). - A bug was fixed in the scoping checker (#2977).
- Minor performance improvement to the mark-compact garbage collector
- Fixes crash when (ill-typed)
switchexpression on non-variant value has variant alternatives (#2934)
-
The compiler now embeds the existing Candid interface and new stable signature of a canister in additional Wasm custom sections, to be selectively exposed by the IC, and to be used by tools such as
dfxto verify upgrade compatibility (see extended documentation).New compiler options:
--public-metadata <name>: emit ICP custom section<name>(candid:argsorcandid:serviceormotoko:stable-types) aspublic(default isprivate)--stable-types: emit signature of stable types to.mostfile--stable-compatible <pre> <post>: test upgrade compatibility between stable-type signatures<pre>and<post>
A Motoko canister upgrade is safe provided:
- the canister's Candid interface evolves to a Candid subtype; and
- the canister's Motoko stable signature evolves to a stable-compatible one.
(Candid subtyping can be verified using tool
didcavailable at: https://github.com/dfinity/candid.) -
BREAKING CHANGE (Minor): Tightened typing for type-annotated patterns (including function parameters) to prevent some cases of unintended and counter-intuitive type propagation.
This may break some rare programs that were accidentally relying on that propagation. For example, the indexing
xs[i]in the following snippet happend to type-check before, becauseiwas given the more precise typeNat(inferred fromrun's parameter type), regardless of the overly liberal declaration as anInt:func run(f : Nat -> Text) {...}; let xs = ["a", "b", "c"]; run(func(i : Int) { xs[i] });
This no longer works,
ihas to be declared asNat(or the type omitted).If you encounter such cases, please adjust the type annotation.
-
Improved garbage collection scheduling
-
Miscellaneous performance improvements
- code generation for
for-loops over arrays has improved - slightly sped up
Intequality comparisons
- code generation for
Pulled
-
forloops over arrays are now converted to more efficient index-based iteration (#2831). This can result in significant cycle savings for tight loops, as well as slightly less memory usage. -
Add type union and intersection. The type expression
T and U
produces the greatest lower bound of types
TandU, that is, the greatest type that is a subtype of both. Dually,T or U
produces the least upper bound of types
TandU, that is, the smallest type that is a supertype of both.One use case of the former is "extending" an existing object type:
type Person = {name : Text; address : Text}; type Manager = Person and {underlings : [Person]};
Similarly, the latter can be used to "extend" a variant type:
type Workday = {#mon; #tue; #wed; #thu; #fri}; type Weekday = Workday or {#sat; #sun};
- Assertion error messages are now reproducible (#2821)
-
moc
- documentation changes
-
motoko-base
- documentation changes
-
motoko-base
- add Debug.trap : Text -> None (caffeinelabs/motoko-base#288)
- Introduce primitives for
Int⇔Floatconversions (#2733) - Bump LLVM toolchain to version 12 (#2542)
- Support extended name linker sections (#2760)
- Fix crashing bug for formatting huge floats (#2737)
-
moc
- Optimize field access by exploiting field ordering (#2708)
- Fix handling of self references in mark-compact GC (#2721)
- Restore CI reporting of perf-regressions (#2643)
-
motoko-base:
- Fix bug in
AssocList.diff(caffeinelabs/motoko-base#277) - Deprecate unsafe or redundant functions in library
Option(unwrap,assertSome,assertNull) (#275)
- Fix bug in
-
Vastly improved garbage collection scheduling: previously Motoko runtime would do GC after every update message. We now schedule a GC when
- Heap grows more than 50% and 10 MiB since the last GC, or
- Heap size is more than 3 GiB
(1) is to make sure we don't do GC on tiny heaps or after only small amounts of allocation. (2) is to make sure that on large heaps we will have enough allocation space during the next message.
This scheduling reduces cycles substantially, but may moderately increase memory usage.
New flag
--force-gcrestores the old behavior. -
Fix bug in compacting gc causing unnecessary memory growth (#2673)
-
Trap on attempt to upgrade when canister not stopped and there are outstanding callbacks. (This failure mode can be avoided by stopping the canister before upgrade.)
-
Fix issue #2640 (leaked
ClosureTableentry when awaiting futures fails).
-
Add alternative, compacting gc, enabled with new moc flag
--compacting-gc. The compacting gc supports larger heap sizes than the default, 2-space copying collector.NOTE: Dfx 0.7.6 adds optional field
"args"todfx.jsonfiles, so Motoko canisters can specifymoccommand-line arguments. E.g.,... "type" : "motoko" ... "args" : "--compacting-gc" ...
-
Documentation fixes.
-
Command line tools:
--helpoption provides better documentation of command line options that have arguments. -
Fix issue #2319 (crash on import of Candid class).
-
For release builds, the banner (
moc --version) now includes the release version. -
Fix MacOS release builds (the 0.6.3 tarball for MacOS contained the linux binaries)
-
Motoko is now open source!
-
Better internal consistency checking of the intermediate representation
-
motoko-base:
- reformat to style guidelines
- add type bindings
Nat.Nat,Nat8.Nat8etc. to libraries for primitive types.
-
Bugfix: generation of candid from Motoko:
- no longer confused by distinct, but eponymous, type definitions (Bug: #2529);
- numbers eponymous types and specializations from 1 (not 2);
- avoids long chains of type equalities by normalizing before translation.
- Internal: Update to IC interface spec 0.17 (adapt to breaking change to signature of
create_canister)
-
BREAKING CHANGE: The old-style object and block syntax deprecated in 0.5.0 is finally removed.
-
Record punning: As already supported in patterns, short object syntax in expressions now allows omitting the right-hand side if it is an identifier of the same name as the label. That is,
{a; b = 1; var c}is short for
{a = a; b = 1; var c = c}assuming respective variables are in scope.
-
BREAKING CHANGE: The types
Word8,Word16,Word32andWord64have been removed. This also removed theblob.bytes()iterator.Motoko base also dropped the
Word8,Word16,Word32andWord64modules.This concludes the transition to the other fixed-width types that began with version 0.5.8
-
BREAKING CHANGE (Minor):
awaiton a completed future now also commits state and suspends computation, to ensure every await, regardless of its future's state, is a commit point for state changes and tentative message sends.(Previously, only awaits on pending futures would force a commit and suspend, while awaits on completed futures would continue execution without an incremental commit, trading safety for speed.)
-
motoko-base: fixed bug in
Text.compareWith.
- Bugfix:
Blob.toArraywas broken.
-
BREAKING CHANGE (Minor): Type parameter inference will no longer default under-constrained type parameters that are invariant in the result, but require an explicit type argument. This is to avoid confusing the user by inferring non-principal types.
For example, given (invariant) class
Box<A>:class Box<A>(a : A) { public var value = a; };
the code
let box = Box(0); // rejected
is rejected as ambiguous and requires an instantiation, type annotation or expected type. For example:
let box1 = Box<Int>(0); // accepted let box2 : Box<Nat> = Box(0); // accepted
Note that types
Box<Int>andBox<Nat>are unrelated by subtyping, so neither is best (or principal) in the ambiguous, rejected case. -
Bugfix: Type components in objects/actors/modules correctly ignored when involved in serialization, equality and
debug_show, preventing the compiler from crashing. -
motoko-base: The
Text.hashfunction was changed to a better one. If you stored hashes as stable values (which you really shouldn't!) you must rehash after upgrading. -
motoko-base: Conversion functions between
Bloband[Nat8]are provided. -
When the compiler itself crashes, it will now ask the user to report the backtrace at the DFINITY forum
-
The
mocinterpreter now pretty-prints values (as well as types) in the repl, producing more readable output for larger values. -
The family of
Wordtypes are deprecated, and mentioning them produces a warning. These type will be removed completely in a subsequent release. See the user’s guide, section “Word types”, for a migration guide. -
motoko base: because of this deprecation, the
Char.from/toWord32()functions are removed. Migrate away fromWordtypes, or useWord32.from/ToCharfor now.
-
The
moccompiler now pretty-prints types in error messages and the repl, producing more readable output for larger types. -
motoko base: fixed bug in
Text.moaffecting partial matches in, for example,Text.replace(GH issue #234).
-
The
moccompiler no longer rejects occurrences of private or local type definitions in public interfaces.For example,
module { type List = ?(Nat, List); // private public func cons(n : Nat, l : List) : List { ?(n , l) }; }
is now accepted, despite
Listbeing private and appearing in the type of public membercons. -
Type propagation for binary operators has been improved. If the type of one of the operands can be determined locally, then the other operand is checked against that expected type. This should help avoiding tedious type annotations in many cases of literals, e.g.,
x == 0or2 * x, whenxhas a special type likeNat8. -
The
moccompiler now rejects type definitions that are non-productive (to ensure termination).For example, problematic types such as:
type C = C; type D<T, U> = D<U, T>; type E<T> = F<T>; type F<T> = E<T>; type G<T> = Fst<G<T>, Any>;
are now rejected.
-
motoko base:
Textnow containsdecodeUtf8andencodeUtf8.
-
User defined deprecations
Declarations in modules can now be annotated with a deprecation comment, which make the compiler emit warnings on usage.
This lets library authors warn about future breaking changes:
As an example:
module { /// @deprecated Use `bar` instead public func foo() {} public func bar() {} }
will emit a warning whenever
foois used. -
The
moccompiler now rejects type definitions that are expansive, to help ensure termination. For example, problematic types such astype Seq<T> = ?(T, Seq<[T]>)are rejected. -
motoko base:
Time.Timeis now public
-
The
moccompiler now accepts the-Werrorflag to turn warnings into errors. -
The language server now returns documentation comments alongside completions and hover notifications
-
Wrapping arithmetic and bit-wise operations on
NatNandIntNThe conventional arithmetic operators on
NatNandIntNtrap on overflow. If wrap-around semantics is desired, the operators+%,-%,*%and**%can be used. The corresponding assignment operators (+%=etc.) are also available.Likewise, the bit fiddling operators (
&,|,^,<<,>>,<<>,<>>etc.) are now also available onNatNandIntN. The right shift operator (>>) is an unsigned right shift onNatNand a signed right shift onIntN; the+>>operator is not available on these types.The motivation for this change is to eventually deprecate and remove the
WordNtypes.Therefore, the wrapping arithmetic operations on
WordNare deprecated and their use will print a warning. See the user’s guide, section “Word types”, for a migration guide. -
For values
xof typeBlob, an iterator over the elements of the blobx.vals()is introduced. It works likex.bytes(), but returns the elements as typeNat8. -
mo-docnow generates cross-references for types in signatures in both the Html as well as the Asciidoc output. So a signature likefromIter : I.Iter<Nat> -> List.List<Nat>will now let you click onI.IterorList.Listand take you to their definitions. -
Bugfix: Certain ill-typed object literals are now prevented by the type checker.
-
Bugfix: Avoid compiler aborting when object literals have more fields than their type expects.
- The type checker now exploits the expected type, if any,
when typing object literal expressions.
So
{ x = 0 } : { x : Nat8 }now works as expected instead of requiring an additional type annotation on0.
- The compiler now reports errors and warnings with an additional error code
This code can be used to look up a more detailed description for a given error by passing the
--explainflag with a code to the compiler. As of now this isn't going to work for most codes because the detailed descriptions still have to be written. - Internal: The parts of the RTS that were written in C have been ported to Rust.
- new
moccommand-line arguments--args <file>and--args0 <file>for reading newline/NUL terminated arguments from<file>. - motoko base: documentation examples are executable in the browser
-
Option blocks
do ? <block>and option checks<exp> !. Inside an option block, an option check validates that its operand expression is notnull. If it is, the entire option block is aborted and evaluates tonull. This simplifies consecutive null handling by avoiding verboseswitchexpressions.For example, the expression
do? { f(x!, y!) + z!.a }evaluates tonullif eitherx,yorzisnull; otherwise, it takes the options' contents and ultimately returns?r, whereris the result of the addition. -
BREAKING CHANGE (Minor): The light-weight
do <exp>form of the recently added, more generaldo <block-or-exp>form, is no longer legal syntax. That is, the argument to adoordo ?expression must be a block{ ... }, never a simple expression.
- Nothing new, just release moc.js to CDN
- Bugfix: gracefully handle importing ill-typed actor classes
-
BREAKING CHANGE: Simple object literals of the form
{a = foo(); b = bar()}no longer bind the field names locally. This enables writing expressions likefunc foo(a : Nat) { return {x = x} }.However, this breaks expressions like
{a = 1; b = a + 1}. Such object shorthands now have to be written differently, e.g., with an auxiliary declaration, as inlet a = 1; {a = a; b = a + 1}, or by using the "long" object syntaxobject {public let a = 1; public let b = a + 1}.
-
BREAKING CHANGE: Free-standing blocks are disallowed
Blocks are only allowed as sub-expressions of control flow expressions like
if,loop,case, etc. In all other places, braces are always considered to start an object literal.To use blocks in other positions, the new
do <block>expression can be used.The more liberal syntax is still allowed for now but deprecated, i.e., produces a warning.
-
BREAKING CHANGE: actor creation is regarded as asynchronous:
- Actor declarations are asynchronous and can only be used in asynchronous contexts.
- The return type of an actor class, if specified, must be an async actor type.
- To support actor declaration, the top-level context of an interpreted program is an asynchronous context, allowing implicit and explicit await expressions.
(Though breaking, this change mostly affects interpreted programs and compiled programs with explicate actor class return types)
-
Candid support is updated to latest changes of the Candid spec, in particular the ability to extend function with optional parameters in a backward compatible way.
Motoko passes the official Candid compliance test suite.
-
RTS: Injecting a value into an option type (
? <exp>) no longer requires heap allocation in most cases. This removes the memory-tax of using iterators. -
Bugfix: Passing cycles to the instantiation of an actor class works now.
-
Various bug fixes and documentation improvements.
- Significant documentation improvements
- Various bugfixes
- Improved error messages
- Initial DWARF support
- Candid compliance improvements:
- Strict checking of utf8 strings
- More liberal parsing of leb128-encoded numbers
- New motoko-base:
- The Random library is added
- BREAKING CHANGE: a library containing a single actor class is imported as a module, providing access to both the class type and class constructor function as module components. Restores the invariant that imported libraries are modules.
- Backend: Compile captured actor class parameters statically (#2022)
- flip the default for -g (#1546)
- Bug fix: reject array indexing as non-static (could trap) (#2011)
- Initialize tuple length fields (#1992)
- Warns for structural equality on abstract types (#1972)
- Funds Imperative API (#1922)
- Restrict subtyping (#1970)
- Continue labels always have unit codomain (#1975)
- Compile.ml: target and use new builder call pattern (#1974)
- fix scope var bugs (#1973)
- Actor class export
- Accept unit installation args for actors
- Reject platform actor (class) programs with additional decs
- Handle IO exceptions at the top-level
- RTS: Remove duplicate array and blob allocation code
- RTS: Fix pointer arithmetic in BigInt collection function
- Preliminary support for actor class import and dynamic canister installation. Surface syntax may change in future.
- BREAKING CHANGE: a compilation unit/file defining an actor or actor class may only have leading
importdeclarations; other leading declarations (e.g.letortype) are no longer supported. - Rust GC
- Polymorphic equality.
==and!=now work on all shareable types.
- Switching to bumping the third component of the version number
- Bugfix: clashing declarations via function and class caught (#1756)
- Bugfix: Candid
booldecoding rejects invalid input (#1783) - Canisters can take installation arguments (#1809) NB: Communicating the type of the canister installation methods is still missing.
- Optimization: Handling of
Boolin the backend.
- Candid pretty printer to use shorthand when possible (#1774)
- fix candid import to use the new id format (#1787)
- Fixes an issue with boolean encoding to Candid
- Converts the style guide to asciidocs
- The
Blobtype round-trips through candid type export/import (#1744) - Allow actor classes to know the caller of their constructor (#1737)
- Internals:
Prim.time()provided (#1747) - Performance: More dead code removal (#1752)
- Performance: More efficient arithmetic with unboxed values (#1693, #1757)
- Canister references are now parsed and printed according to the new base32-based textual format (#1732).
- The runtime is now embedded into
mocand need not be distributed separately (#1772)
- Beginning of the changelog. Released with dfx-0.6.0.