The tcc_ffi Object Is a Recipe | Code Generation Is Central | How Values Move Between R, The Wrapper, And C | Copying Versus Borrowing Happens In The Wrapper | Internal Rule Dispatch | Wrapper Builders Work at the SEXP Boundary | Protection And Lifetime Rules Matter | Ownership And Lifetime Semantics In The Main Cases | Call-scoped borrows from R objects | Owned native allocations | Borrowed native views | Returned R objects | Callback registry lifetime | Compiled object lifetime | Host Symbol Injection Happens Before Relocation | Callback Round-Trips Cross The Boundary Twice | State Creation Is Separate from Compilation | The Compiled Object Is an Environment of Closures | Serialization Works by Recompiling the Recipe | Where To Read Next

Boundary | Backends | R surface | Validation

Scope and authority | Inputs retained for arbitration | Step 1: classification bins | Step 2: exclusions | Step 3: SCV version deduplication | Step 4: 2016 evidence window | Step 5: decisive strong review | Step 6: 60/20 arbitration | Step 7: star assignment | Disease identity | Output and audit columns | Complete-release differential validation

Motivation beyond variant annotation | Discovery-oriented views | Using ducksemantics | Publishing releases to DuckLake | VariantStory boundary | Talos 11.1 compatibility target

What is cached? | Download cache | Exact DuckDB extension artifacts | Persistent relational release store | Import lifecycle | What remains virtual? | Measured complete-release conversions

Task states | Leases fence stale workers | Failures and the retry budget | Supervise work longer than a lease | Checkpoints keep R values | Query state with SQL | Abandoned tasks and native maintenance | Error classification | Limits

Run a task | Resume after a failure | Sleep durably | Watch tasks | Samples, then a cohort | Worker lifetime

Field names | Known driver and engine issues | VARIANT conversion under garbage collection | Nested NULLs | Indexed VARIANT field extraction | How values are read

Base R | qs2 | Sakura: rebuilding reference objects | Your responsibilities

A vector protocol | Composing contracts | Declaring an implementation | Testing behavior

A tinytest property | Laws over an S7 interface | Inspecting and replaying a failure | Composition and shrinking | Dependent inputs | Choices and recursive values | Relationship to Hedgehog

The dictionary | Generated values and functions | Three laws, one suite | A default that breaks the laws

Introduction | Background | A toy assay container | Operations and a consumer-owned interface | When an explicit trait helps | Design cautions | References

Whole days from integer offsets | An inclusive interval protocol | An end date accidentally excluded

Vector-like behavior | One protocol, several implementations | Which cases were tested? | Structural conformance and a behavioral failure | A bug hidden by integer inputs

The protocol and its implementations | Commands and a reference model | One law, two fixtures | A put that truncates keys | A reset that leaves data behind | Commands that return handles

Build a tiny alignment batch | The downstream C consumer | Compile and call it with Rtinycc | Lossless query-group stream

Why Rducks ships exact-version extensions | Runtime selection | Unsupported versions | Maintainer workflow

Setup | Why a bridge is needed | Register selected R helpers for duckplyr | Why scalar mode is the default | Execution plans: in-process and worker-process | Cleanup

Supported transports | Select the plan before registration | Worker-process (ipc) plan | Inspect workers | What rducks_release() does

Source and installed layout | Package and extension split | Runtime scopes | R-thread discipline | Scalar UDF registration and execution | Aggregates | Table functions | Query streams | IPC provider lifecycle | Ownership and copying model

Contract | Select an installed genetic map | Chunk and split the reference | Phase and ligate | SIMD selection

Tables and coordinates | Opaque metadata | Source-population ancestry | Round trips

Enable Rducks | Register a scalar UDF | Register an aggregate | Register a table function | Stream query results back to R | Release connection-local state

Pin file | Patch queue | Developer checkout | Vendored source

Function kind, scalar-UDF mode, and execution plan | Declared descriptors | NULL handling | Error handling and side effects | Runtime reference tables

Async-first surface | Usage from another R package | Minimal usage pattern | Prefix-scoped byte stores | Why this exists

Running Lean | Asserting the axiom base | Expected errors | Why this matters

A small explicit format layer | Add an explicit cache

Write an object and an index | Read selected records by range | Async and byte handles

Root-relative paths | Range-heavy readers | Zarr-like byte stores | Control knobs belong in handles | Error values are first-class

Scalar Inputs Are Converted | Vector Inputs Are Usually Borrowed | tcc_call_symbol() Uses .C()-Style Copy-In/Copy-Out | cstring_array Is Rebuilt Per Call | Returned Arrays Are Copied into Fresh R Vectors | Returned cstring Values Are Copied | Returned ptr Values Stay as Pointers | sexp Passes Through Directly | Owned vs Borrowed Helper Pointers | Bitfields Are Scalar Helpers, Not Addressable Views | Serialization Boundary

Submit and wait | Poll or race | Coordinating several handles with condition variables

S3-compatible examples | Google Drive | Azure Blob / GCS helpers

Aio pattern with the same API

Raw and text modes | Serializers for R objects | Native codecs

Dataflow | Async and thread safety | Serialization and codecs pipeline | Layer controls | API boundaries by function family

Copy the scaffold | Replace the demo kernels | Extending the number of operations | Build

SIMDe and native ISA compilation | Benchmarking backend switching

Three Minimal Cases | Availability | Compilation Latency | Generated Wrapper Code | noop() Call Overhead | fill_rand(out, n) And Zero-Copy Arrays | rand_unif(n) And Copy Cost | What These Numbers Mean

What tcc_link() Is For | A Minimal Linking Example | Adding Helper Code Beside External Symbols | Linking by Name or by Path | Relationship to tcc_compile()

Scalar Types | A Minimal Example | String and Pointer Types | Array Types | Direct R Objects with sexp

Array Returns | Callbacks | Globals | Struct Helpers

Allocation and Ownership | Reading and Writing Raw Bytes | Typed Reads and Writes | Pointer-to-Pointer Helpers | C String Helpers

Working with Struct Helpers | Registering Callbacks | Async Callback Caveats | Soundness Notes

Toolchain Paths | A Minimal FFI Example | Managing Globals | When to Use tcc_link()

Availability | Start from a Header Snippet | Inspect Parsed Functions | Generate a Working FFI Object | Struct Helpers | Conservative Type Mapping