kbjr / bfec Goto Github PK

# === Already Exists ===

# Root lookups
$.foo.bar

# Local lookups
@.foo.bar



# === New Expression Type ===

# Nearest Ancestor lookups
%.foo.bar



# === Example ===

enum Value : b1 {
  a = 0;
  b = 1;
}

struct Foo {
  foo_value: Value;
  foo_field: Bar;
}

struct Bar {
  # This parameter expression means "looking *up* the stack from here,
  # find the nearest ancestor node of type `Foo`, then grab the value
  # of the field `foo_value` from that node"
  bar_field: Baz(%.Foo.foo_value);
}

struct Baz(value: Value) {
  baz_value: Value = value;
}

id SomeID = u32;

struct SomeObject {
  obj_id: SomeID;
}

struct SomeOtherObject {
  obj_reference: ref<SomeID>;
}

struct Image {
  # `data` here would first be encoded as `ImageData`, then that encoded data
  # would be gzip compressed
  data: compress<ImageData>('gzip');

  # Special case for compressing bare buffers?
  other: compress<u8[u32]>('gzip');
}

struct ImageData {
  # ...
}

struct FileContents {
  data: SomeVariousContents;

  # Buffer (`u8[u32]`) containing a signature for the data in `@.data`
  # signed using an ECDSA algorithm
  signed: signature<u8[u32]>(@.data, 'ECDSA');
}