dictionary.subsref — Look up dictionary entries or inspect Keys and Values.
dictionary.subsref(d,S) applies a standard subscript path to a dictionary. Parentheses or braces select entries by key; dot indexing reads the Keys or Values property.
Syntax
out = dictionary.subsref(d, S)Inputs
obj- Type
Any- Required
- Yes
- Default
- —
- Description
- Table or dictionary value whose indexing method is invoked.
S- Type
Any- Required
- Yes
- Default
- —
- Description
- Standard structure or structure-array indexing path with type and subs fields.
Returns
out- Type
Any- Description
- The selected table, variable, dictionary value, or nested member.
Errors
RunMat:table:InvalidArgument- When
- Arguments or table metadata are invalid.
- Message
table: invalid argument
RunMat:table:InvalidIndex- When
- Table indexing is invalid.
- Message
table: invalid index
RunMat:table:InvalidVariable- When
- A table variable name or value is invalid.
- Message
table: invalid variable
Behavior
Each S element has a type and subs selector. Lookup converts queries to the configured key class, compares integer keys exactly, and reports missing keys as index errors.
A scalar key returns its stored value. Several keys produce an array or cell container according to their value classes; the result depends on runtime contents.
Single key conversion and homogeneous Single results preserve native binary32 class and payloads. Output shape follows the complete key-query geometry.
Chained paths continue indexing into the retrieved value through the shared object protocol.
Execution and placement
Dictionary key lookup is host-side and a numeric fusion boundary. Stored values can have their own residency; a retrieved value is not automatically gathered.
The method may suspend or throw while processing a nested path. Direct distributed dictionary handles are unsupported.
Typed native dictionary lookup admits its index scratch and retained output under the selected context. The public standard-substruct adapter still rejects finite Managed execution before its shared path/component workspace is allocated; this is a shared-ingress limit, not a class conversion or output fallback.
Example
Look up an exact integer-keyed value
key = uint64(9007199254740992) + uint64(1); d = dictionary(key, uint64(7)); S = struct('type', '()', 'subs', {{key}}); v = subsref(d,S);Using dictionary.subsref with coding agents
Open a RunMat example with live inputs, then ask the agent to explain how dictionary.subsref changes the result.
Run a small dictionary.subsref example, explain the result, then change one input and compare the output.
FAQ
What happens if a key is absent?⌄
Lookup reports an invalid-index error instead of adding an entry.
Related Table functions
Indexing
Table
array2table · array2timetable · categorical · cell2table · dictionary · groupsummary · head · iscategorical · isordinal · istable · istimetable · ordinal · pivot · rowfilter · struct2table · table · table2array · table2cell · table2struct · table2timetable · timerange · timetable · timetable2table · uitable · vartype
Source you can read
Every RunMat function's source is public. Read exactly how dictionary.subsref is executed, line by line, in Rust.
- View the source for dictionary.subsref in Rust on GitHub
- Learn how the RunMat runtime works
- Found a bug? Open an issue with a minimal reproduction.
About RunMat
RunMat is a runtime that executes MATLAB-syntax code fast on any GPU. The runtime is free for individuals, including freelancers; students and faculty at an academic institution, for teaching or research there; contributors to an open-source project, for work on that project; organizations with 250 or fewer people and US$10M or less in annual revenue; and anyone, for non-production use. See runmat.com/license.
- RunMat automatically optimizes your math for GPU execution on Apple, Nvidia, and AMD hardware. No code changes needed. Simulations that took hours now take minutes.
- Start running code in seconds. RunMat runs in the browser, on the desktop, or from the CLI. No license server, no IT ticket.