CodeSampleX

サンプル

tinyvec 1.12.0: tinyvec::TinyVec

検証済みサンプル — cargo tinyvec 1.12.0: tinyvec::TinyVec. rust 1 · linux alpine/x64 · docker で contract を実行し、成功しました: TinyVec requires the alloc feature and starts…

sha256:a92ae08934ee7c760c701d9160aabb32eb0921f30fd16f14608d0769fdfedcf6

このネットワークが提供するのは一つだけです。ビルドされるサンプル。サンドボックスで実行し、署名済みの受領証を保管します。等級はつけず、何も保証しません — 同じコードがあなたの環境でビルドされるかは測定していません。 合格した契約受領証を提出した異なる署名鍵の数です。1 なら作者だけ、2 以上なら他の誰かもビルドしています。鍵は自己生成で背後に登録された身元がないため、数えているのは人ではなく鍵です。 MIT-0

実行証拠

宣言された環境と署名済みの実行を分けてあります。このサンプルが何をどこで実行したかをそのまま確認できます。

証拠の基準
署名済みコントラクト合格
検証レシート
1
ビルドした署名鍵
1
宣言された環境 linux · alpine · musl x64 cargo

検証実行環境

環境 コントラクト ステージ 実行日
rust 1 · linux alpine/x64 · docker ed25519:c1973797be207ac4 PASS compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS
CONTAINER_RUN · cargo@1rust:1-alpine@sha256:a10e64dd139b…
2026-11-21

ケース

HOW
ゴール
verify tinyvec::TinyVec in pkg:cargo/tinyvec@1.12.0
パッケージ
シンボル
  • tinyvec::TinyVec
作成日
2026-11-21T22:10:25Z

コントラクト

  1. TinyVec requires the alloc feature and starts inline via new/default within its backing array capacity
  2. Pushing beyond inline capacity spills TinyVec from Inline to Heap while preserving element order
  3. TinyVec::with_capacity selects Inline or Heap by capacity threshold and reserve/move_to_the_heap spill to Heap
  4. tiny_vec!, FromIterator, extend_from_slice, insert, remove, retain, and into_vec work across inline and heap storage

ファイル

  • Cargo.lock
  • Cargo.toml
  • PROMPT.md
  • csx.json
  • spec.json
  • src/lib.rs
  • test/contract.rs

ソースアーティファクトをダウンロード (tar.gz)

ソース

Cargo.lock
# This file is automatically @generated by Cargo.
# It is not intended for manual editing.
version = 4

[[package]]
name = "sample-tinyvec"
version = "1.0.0"
dependencies = [
 "tinyvec",
]

[[package]]
name = "tinyvec"
version = "1.12.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "bb4ebadaa0af04fab11ae01eb5f9fdb5f9c5b875506e210e71c07873528baa7f"
dependencies = [
 "tinyvec_macros",
]

[[package]]
name = "tinyvec_macros"
version = "0.1.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "1f3ccbac311fea05f86f61904b462b55fb3df8837a366dfc601a0161d0532f20"
Cargo.toml
[package]
name = "sample-tinyvec"
version = "1.0.0"
edition = "2021"
publish = false

[dependencies]
tinyvec = { version = "=1.12.0", features = ["alloc"] }

[[bin]]
name = "contract"
path = "test/contract.rs"
PROMPT.md
Clean-room public code sample — generation instructions

Write a brand-new, minimal, self-contained code sample in this clean-room directory.
Do not copy, paraphrase, or reference any existing project source. Work only from this spec.

A csx.json manifest scaffold already exists. Do not recreate it from memory. Preserve its case.goal, packages and symbols; fill its empty case.contract with exact assertions and correct its environment, commands and verifierAdapter for the files you generate.

Goal: verify tinyvec::TinyVec in pkg:cargo/tinyvec@1.12.0
Kind: HOW

Use EXACTLY these public packages and versions:
  - pkg:cargo/tinyvec@1.12.0
Demonstrate these symbols/APIs:
  - tinyvec::TinyVec

Rules:
  - One focused purpose; the smallest project that proves the goal.
  - Include a contract test (test/contract.*) that runs OFFLINE and exits 0 exactly when the goal behavior works.
  - Pin every dependency with a lockfile so resolution is reproducible.
  - No secrets, credentials, or tokens. No real URLs (only example.com or localhost). No absolute paths.
  - No personal names, emails, company names, or project identifiers of any kind.
  - No binaries and no generated output (node_modules, dist, target, venv, .git, .env).
  - Keep it under 200 files and 256KB packed.
csx.json
{"case":{"caseId":"case:sha256:a11b72ee1943096033b1bc89eb22d9da75be0ad2c46491027110aa47ca85f462","contract":["TinyVec requires the alloc feature and starts inline via new/default within its backing array capacity","Pushing beyond inline capacity spills TinyVec from Inline to Heap while preserving element order","TinyVec::with_capacity selects Inline or Heap by capacity threshold and reserve/move_to_the_heap spill to Heap","tiny_vec!, FromIterator, extend_from_slice, insert, remove, retain, and into_vec work across inline and heap storage"],"goal":"verify tinyvec::TinyVec in pkg:cargo/tinyvec@1.12.0","kind":"HOW","packages":["pkg:cargo/tinyvec@1.12.0"],"schemaVersion":1,"symbols":["tinyvec::TinyVec"]},"contractCommand":["cargo","run","--offline"],"environment":{"arch":"x64","distro":"alpine","ecosystem":"cargo","libc":"musl","os":"linux","packageManager":"cargo","schemaVersion":1},"license":"MIT-0","packages":["pkg:cargo/tinyvec@1.12.0"],"schemaVersion":1,"subject":"pkg:cargo/tinyvec@1.12.0","symbols":["tinyvec::TinyVec"],"verifierAdapter":"cargo@1"}
spec.json
{
  "schemaVersion": 1,
  "goal": "verify tinyvec::TinyVec in pkg:cargo/tinyvec@1.12.0",
  "kind": "HOW",
  "packages": [
    "pkg:cargo/tinyvec@1.12.0"
  ],
  "symbols": [
    "tinyvec::TinyVec"
  ]
}
src/lib.rs
//! Clean-room verification sample for tinyvec::TinyVec.

pub use tinyvec::TinyVec;
test/contract.rs
use tinyvec::{tiny_vec, TinyVec};

fn main() {
    // 1. TinyVec requires the alloc feature and starts inline within backing array capacity
    let mut tv: TinyVec<[i32; 4]> = TinyVec::new();
    assert!(tv.is_inline());
    assert!(!tv.is_heap());
    assert!(tv.is_empty());
    assert_eq!(tv.capacity(), 4);

    let default_tv: TinyVec<[i32; 4]> = TinyVec::default();
    assert!(default_tv.is_inline());
    assert_eq!(default_tv.len(), 0);

    for v in 1..=4 {
        tv.push(v);
    }
    assert!(tv.is_inline());
    assert_eq!(tv.len(), 4);
    assert_eq!(&*tv, &[1, 2, 3, 4]);
    assert_eq!(tv[2], 3);
    assert_eq!(tv.pop(), Some(4));
    assert_eq!(tv.len(), 3);
    assert!(tv.is_inline());

    // 2. Pushing beyond inline capacity spills TinyVec from Inline to Heap while preserving order
    tv.push(4);
    assert!(tv.is_inline());
    tv.push(5);
    assert!(tv.is_heap());
    assert!(!tv.is_inline());
    assert_eq!(tv.len(), 5);
    assert!(tv.capacity() >= 5);
    assert_eq!(&*tv, &[1, 2, 3, 4, 5]);
    assert!(matches!(tv, TinyVec::Heap(_)));

    // 3. with_capacity selects Inline or Heap by threshold; reserve/move_to_the_heap spill to Heap
    let small = TinyVec::<[u8; 8]>::with_capacity(8);
    assert!(small.is_inline());
    assert_eq!(small.capacity(), 8);

    let large = TinyVec::<[u8; 8]>::with_capacity(16);
    assert!(large.is_heap());
    assert!(large.capacity() >= 16);

    let mut spill = tiny_vec!([i32; 4] => 10, 20, 30, 40);
    assert!(spill.is_inline());
    spill.reserve(1);
    assert!(spill.is_heap());
    assert!(spill.capacity() >= 5);
    assert_eq!(&*spill, &[10, 20, 30, 40]);

    let mut manual = tiny_vec!([i32; 4] => 7, 8);
    assert!(manual.is_inline());
    manual.move_to_the_heap();
    assert!(manual.is_heap());
    assert_eq!(&*manual, &[7, 8]);

    // 4. tiny_vec!, FromIterator, extend_from_slice, insert, remove, retain, and into_vec
    let inline_macro = tiny_vec!([i32; 4] => 1, 2, 3);
    assert!(inline_macro.is_inline());
    assert_eq!(&*inline_macro, &[1, 2, 3]);

    let heap_macro = tiny_vec!([i32; 4] => 1, 2, 3, 4, 5, 6);
    assert!(heap_macro.is_heap());
    assert_eq!(&*heap_macro, &[1, 2, 3, 4, 5, 6]);

    let mut collected: TinyVec<[i32; 3]> = (0..5).collect();
    assert!(collected.is_heap());
    assert_eq!(&*collected, &[0, 1, 2, 3, 4]);

    collected.insert(2, 99);
    assert_eq!(collected.remove(2), 99);
    collected.retain(|x| x % 2 == 0);
    assert_eq!(&*collected, &[0, 2, 4]);
    collected.extend_from_slice(&[6, 8]);
    assert_eq!(&*collected, &[0, 2, 4, 6, 8]);

    let as_vec: Vec<i32> = collected.into_vec();
    assert_eq!(as_vec, vec![0, 2, 4, 6, 8]);

    println!("All tinyvec::TinyVec contract assertions passed.");
}

オリジンシーダー

匿名