Paste: clay - what if we used '.' to dereference pointers

./memory/memory.clay:        ptr. <-- x;
./memory/memory.clay:    destroy(ptr.);
./memory/memory.clay:    (alignedPtr - 1). = Byte(alignedPtr - ptr);
./memory/memory.clay:    var offset = SizeT((ptr-1).);
./memory/memory.clay:        x <-- srcPtr.;
./memory/memory.clay:        x <-- moveUnsafe(srcPtr.);
./memory/memory.clay:        x <-- moveUnsafe(srcPtr.);
./memory/memory.clay:        x <-- move(srcPtr.);
./memory/memory.clay:    eachLocationWithCleanup(begin, end, x => { x <-- ptr.; });
./memory/memory.clay:        x = srcPtr.;
./memory/memory.clay:        x = move(srcPtr.);
./memory/memory.clay:        swap(x, srcPtr.);
./memory/memory.clay:        f(ptr.);
./memory/memory.clay:        f(ptr.);
./memory/memory.clay:            f(ptr.);
./memory/memory.clay:            f(ptr.);
./unions/unions.clay:    return ref Pointer[T](&x).;
./expat/constants/constants.clay:XML_GetUserData(parser) = Pointer[RawPointer](parser).;
./printer/printer.clay:        printReprTo(stream, x.);
./printer/printer.clay:        printTo(stream, UniqueValue[T], "(", v., ")");
./algorithms/heaps/heaps.clay:        if (compareLess?(i., first.))
./algorithms/heaps/heaps.clay:        var value = move((first + parent).);
./algorithms/heaps/heaps.clay:    var value = move(result.);
./algorithms/heaps/heaps.clay:    result. = move(first.);
./algorithms/heaps/heaps.clay:    while ((holeIndex > topIndex) and compareLess?((first + parent)., value)) {
./algorithms/heaps/heaps.clay:        (first + holeIndex). = move((first + parent).);
./algorithms/heaps/heaps.clay:    (first + holeIndex). = move(value);
./algorithms/heaps/heaps.clay:        if(compareLess?((first + secondChild)., (first + secondChild - 1).))
./algorithms/heaps/heaps.clay:        (first + holeIndex). = move((first + secondChild).);
./algorithms/heaps/heaps.clay:        (first + holeIndex). = move((first + (secondChild - 1)).);
./algorithms/strings/strings.clay:    while ((b != e) and pred(b.))
./algorithms/strings/strings.clay:    while ((b != e) and pred((e-1).))
./algorithms/algorithms.clay:            resultPtr. = f(resultPtr., x);
./algorithms/algorithms.clay:        if (f(v, result.))
./algorithms/algorithms.clay:    return ref result.;
./algorithms/algorithms.clay:    while ((cur != last) and not pred(cur.))
./algorithms/algorithms.clay:        if (pred(prev.))
./algorithms/algorithms.clay:        if (i. == x)
./algorithms/algorithms.clay:        if (j. == x)
./algorithms/algorithms.clay:        if (mid. < x)
./algorithms/algorithms.clay:        if (mid. <= x)
./algorithms/introsort/introsort.clay:    var cut = unguardedPartition(first + 1, last, first., compareLess?);
./algorithms/introsort/introsort.clay:    swap(first., cut.);
./algorithms/introsort/introsort.clay:    if (compareLess?(a.,  b.)) {
./algorithms/introsort/introsort.clay:        if (compareLess?(b., c.))
./algorithms/introsort/introsort.clay:            swap(a., b.);
./algorithms/introsort/introsort.clay:        else if (compareLess?(a., c.))
./algorithms/introsort/introsort.clay:            swap(a., c.);
./algorithms/introsort/introsort.clay:    else if (compareLess?(a.,  c.))
./algorithms/introsort/introsort.clay:    else if (compareLess?(b., c.))
./algorithms/introsort/introsort.clay:        swap(a., c.);
./algorithms/introsort/introsort.clay:        swap(a., b.);
./algorithms/introsort/introsort.clay:        while (compareLess?(first., pivot))
./algorithms/introsort/introsort.clay:        while (compareLess?(pivot, last.))
./algorithms/introsort/introsort.clay:        swap(first., last.);
./algorithms/introsort/introsort.clay:        if (compareLess?(i., first.)) {
./algorithms/introsort/introsort.clay:            var value = move(i.);
./algorithms/introsort/introsort.clay:            first. = move(value);
./algorithms/introsort/introsort.clay:    var value = move(last.);
./algorithms/introsort/introsort.clay:    while (compareLess?(value, next.)) {
./algorithms/introsort/introsort.clay:        last. = move(next.);
./algorithms/introsort/introsort.clay:    last. = move(value);
./algorithms/introsort/introsort.clay:        newLast. = move(last.);
./values/values.clay:[T] inline overload forwardValue(x:CapturedLValue[T]) = ref x.ptr.;
./values/values.clay:[T] inline overload capturedRef(x:CapturedLValue[T]) = ref x.ptr.;
./remote/marshaling/marshaling.clay:    Pointer[T](buffer). <-- x;
./remote/marshaling/marshaling.clay:        return marshaledSize(context, true) + marshaledSize(context, p.);
./remote/marshaling/marshaling.clay:        return marshalTo(context, buffer, p.);
./remote/marshaling/marshaling.clay:            p., begin <-- ...unmarshalFrom(context, begin, end, T);
./remote/marshaling/marshaling.clay:                + marshaledSize(context, p.);
./remote/marshaling/marshaling.clay:        } else if (not pointerState..sized?) {
./remote/marshaling/marshaling.clay:            pointerState..sized? = true;
./remote/marshaling/marshaling.clay:                + marshaledSize(context, pointerState..id)
./remote/marshaling/marshaling.clay:                + marshaledSize(context, p.);
./remote/marshaling/marshaling.clay:                + marshaledSize(context, pointerState..id);
./remote/marshaling/marshaling.clay:            buffer = marshalTo(context, buffer, p.);
./remote/marshaling/marshaling.clay:        } else if (not pointerState..marshaled?) {
./remote/marshaling/marshaling.clay:            pointerState..marshaled? = true;
./remote/marshaling/marshaling.clay:            buffer = marshalTo(context, buffer, pointerState..id);
./remote/marshaling/marshaling.clay:            buffer = marshalTo(context, buffer, p.);
./remote/marshaling/marshaling.clay:            buffer = marshalTo(context, buffer, pointerState..id);
./remote/marshaling/marshaling.clay:        var ptr = Pointer[RefCounted[UnmarshaledType(T)]](pointerState.);
./remote/marshaling/marshaling.clay:        ptr..refCount += 1;
./remote/marshaling/marshaling.clay:            ptr..refCount = 1;
./remote/marshaling/marshaling.clay:            ptr..value, begin <-- ...unmarshalFrom(context, begin, end, T);
./uniquepointers/uniquepointers.clay:        ptr. <-- x;
./uniquepointers/uniquepointers.clay:        destroy(p.ptr.);
./uniquepointers/uniquepointers.clay:inline overload dereference(p: UniquePointer[T]) = ref p.ptr.;
./uniquepointers/uniquepointers.clay:        UniqueValue(x.);
./uniquepointers/uniquepointers.clay:        to <-- UniqueValue(from.);
./uniquepointers/uniquepointers.clay:        to. = from.;
./uniquepointers/uniquepointers.clay:inline overload dereference(p: UniqueValue[T]) = ref p.ptr.;
./referencetypes/referencetypes.clay:    ref staticIndex(referencePtr(x)., static i);
./referencetypes/referencetypes.clay:referenceTypeFields(x:T) = ref ...tupleElements(referencePtr(x).);
./referencetypes/referencetypes.clay:    referencePtr(returned).ptr..refCount = 1;
./externals/externals.clay:        exp. <-- nothing(Exception);
./externals/externals.clay:        exp. <-- Maybe(ex);
./variants/nested/nested.clay:    return ref ptr.;
./variants/nested/nested.clay:    return move(ptr.);
./variants/nested/nested.clay:    return unboxAlong(ptr., Target, ...rest);
./hashmaps/hashmaps.clay:        ptr. = value;
./hashmaps/hashmaps.clay:        return ref ptr.;
./hashmaps/hashmaps.clay:    return ref bucket..value;
./hashmaps/hashmaps.clay:    var node = &a.buckets[i].;
./hashmaps/hashmaps.clay:        if (node..key == key)
./hashmaps/hashmaps.clay:        node = &node..next.;
./hashmaps/hashmaps.clay:        a.buckets[i] = node..next;
./hashmaps/hashmaps.clay:        prevNode..next = node..next;
./hashmaps/hashmaps.clay:        x.node = &next(x.bucketsIter).;
./hashmaps/hashmaps.clay:    ref key, value = x.node..key, x.node..value;
./hashmaps/hashmaps.clay:    x.node = &x.node..next.;
./hashmaps/hashmaps.clay:        x.node = &next(x.bucketsIter).;
./hashmaps/hashmaps.clay:    var node = &_node.;
./hashmaps/hashmaps.clay:        if (node..key == key)
./hashmaps/hashmaps.clay:            return &node..value;
./hashmaps/hashmaps.clay:        node = &node..next.;
./sha2/sha2.clay:    Pointer[UInt64](end(tailChunkBytes) - 8). = hostToNetwork(UInt64(messageSize) * 8);
./strings/constants/constants.clay:inline overload index(a:StringConstant, i:I) = ref (a.first + i).;
./strings/cstringrefs/cstringrefs.clay:inline overload index(a:CStringRef, i:I) = ref (begin(a) + i).;
./operators/operators.clay:inline bitwiseCast(x: T, static U) = ref Pointer[U](&x).;
./clay/parser/parser.clay:    punc(#"."),
./clay/core/core.clay:    return Maybe(ptr.);
./clay/diagnostics/diagnostics.clay:            println('.');
./clay/lexer/lexer.clay:    "+", "-", "*", "/", "%", "=", "&", ".", "|",
./lambdas/lambdas.clay:    return forward ...x.body..code(x.body..obj., ...args);
./lambdas/lambdas.clay:        ptr. <-- x;
./lambdas/lambdas.clay:    x.destructor(x.obj.);
./deques/deques.clay:[T] private nodeBegin(node: Pointer[Pointer[T]]) Pointer[T] = node.;
./deques/deques.clay:[T] private nodeEnd(node: Pointer[Pointer[T]]) Pointer[T] = node. + DequeBufferSize(T);
./deques/deques.clay:[T] overload dereference(i: DequeCoordinate[T]) = ref i.current.;
./deques/deques.clay:[T, I | Integer?(I)] overload index(i: DequeCoordinate[T], n: I) = ref (i + n).;
./deques/deques.clay:            i. <-- x;
./deques/deques.clay:            i. <-- x;
./deques/deques.clay:        toI. = fromI.;
./deques/deques.clay:[T, I | Integer?(I)] overload index(d: Deque[T], i: I) = ref (d.begin + i).;
./deques/deques.clay:[T] overload front(d: Deque[T]) = ref d.begin.;
./deques/deques.clay:[T] overload back(d: Deque[T]) { var backi = d.end; dec(backi); return ref backi.; }
./deques/deques.clay:        newCurrent. <-- value;
./deques/deques.clay:            i. <-- x;
./deques/deques.clay:        deque.end.current. <-- value;
./deques/deques.clay:            i. <-- x;
./deques/deques.clay:        value <-- moveUnsafe(deque.begin.current.);
./deques/deques.clay:        return moveUnsafe(deque.end.current.);
./deques/deques.clay:    destroy(i.);
./deques/deques.clay:            freeRawMemory(deque.begin.node.);
./deques/deques.clay:            freeRawMemory(deque.end.node.);
./deques/deques.clay:        destroy(i.);
./deques/deques.clay:        toI. <-- moveUnsafe(fromI.);
./deques/deques.clay:        toI. <-- moveUnsafe(fromI.);
./deques/deques.clay:            i. = allocateNode(T);
./deques/deques.clay:        freeRawMemory(i.);
./deques/deques.clay:            prev. <-- value; 
./deques/deques.clay:            resetUnsafe(prev.);
./deques/deques.clay:            i. <-- value;
./deques/deques.clay:            resetUnsafe(i.);
./deques/deques.clay:                ii. <-- x;
./deques/deques.clay:                resetUnsafe(ii.);
./deques/deques.clay:                ii. <-- x;
./deques/deques.clay:                resetUnsafe(ii.);
./deques/deques.clay:    newBeginNode. = allocateNode(T);
./deques/deques.clay:        deque.begin.current. <-- value;
./deques/deques.clay:        freeRawMemory(newBeginNode.);
./deques/deques.clay:    newEndNode. = allocateNode(T);
./deques/deques.clay:        deque.end.current. <-- value;
./deques/deques.clay:        freeRawMemory(newEndNode.);
./deques/deques.clay:    value <-- moveUnsafe(deque.begin.current.);
./deques/deques.clay:    return moveUnsafe(deque.end.current.);
./lua/capi/handwritten/handwritten.clay:    if (not (b..p < end(b..buffer)))
./lua/capi/handwritten/handwritten.clay:    b..p = CChar(c);
./lua/capi/handwritten/handwritten.clay:    b..p += 1;
./lua/capi/handwritten/handwritten.clay:    b..p += n;
./lua/highlevel/highlevel.clay:    libc.longjmp(&panicJmpBuf.[0], 1);
./lua/highlevel/highlevel.clay:    // HACK: assumes that (ptr2 + size). is byte value 0.
./lua/highlevel/highlevel.clay:    // HACK: assumes that (ptr2 + size). is byte value 0.
./lua/highlevel/highlevel.clay:    // HACK: assumes that (ptr2 + size). is byte value 0.
./lua/highlevel/highlevel.clay:        ptr..name, ptr..func = ...unpackNameAndFunction(entry);
./lua/highlevel/highlevel.clay:    ptr..name = Type(ptr..name)(0);
./lua/highlevel/highlevel.clay:    ptr..func = Type(ptr..func)(0);
./lua/highlevel/highlevel.clay:        ptr..name, ptr..func = ...unpackNameAndFunction(entry);
./lua/highlevel/highlevel.clay:    ptr..name = Type(ptr..name)(0);
./lua/highlevel/highlevel.clay:    ptr..func = Type(ptr..func)(0);
./interfaces/interfaces.clay:    ptr..vtbl = &interfaceVtbl[I, T];
./interfaces/interfaces.clay:        Pointer[T](&ptr..this). <-- this;
./interfaces/interfaces.clay:    = ...vtblSlot(i..vtbl., fn)(i..this, ...args);
./pointers/pointers.clay:inline overload index(p:Pointer[T], i:I) = ref (p + i).;
./sequences/lazy/range/range.clay:inline overload index(a:CoordinateRange[T], i:I) = forward ...(a.begin + i).;
./sequences/lazy/range/range.clay:    var x = captureValues(...a.begin.);
./sequences/lazy/range/range.clay:inline overload index(a:ReverseCoordinateRange[T], i:I) = forward ...(a.end - i - 1).;
./sequences/lazy/range/range.clay:    return forward ...a.end.;
./sequences/lazy/zipped/zipped.clay:    return multiValueAll?(reversible?, ...Type(...unpackSequences(null(A).)));
./sequences/lazy/zipped/zipped.clay:    return multiValueAll?(sizeDefined?, ...Type(...unpackSequences(null(A).)));
./sequences/lazy/zipped/zipped.clay:    return allValues?(staticSizeDefined?, ...Type(...unpackSequences(null(A).)));
./sequences/lazy/zipped/zipped.clay:    min([...mapValues(StaticSize, ...Type(...unpackSequences(null(A).)))]);
./sequences/lazy/zipped/zipped.clay:    return multiValueAll?(indexDefined?, ...Type(unpackSequences(null(A).)));
./sequences/lazy/sliced/sliced.clay:inline overload index(a:Sliced[A], i:I) = forward ...(a.first + i).;
./sequences/lazy/sliced/sliced.clay:inline overload front(a:Sliced[A]) = forward ...(a.first.);
./sequences/lazy/sliced/sliced.clay:inline overload back(a:Sliced[A]) = forward ...(a[size(a)-1].);
./sequences/lazy/filtered/filtered.clay:    alias T = Type(captureValues(...next(iterator(null(A).))));
./sequences/lazy/filtered/filtered.clay:    alias T = Type(captureValues(...next(reverseIterator(null(A).))));
./sequences/handle/handle.clay:    = forward ...iterator(seq.inner., ...args);
./sequences/handle/handle.clay:    = forward ...reverseIterator(seq.inner., ...args);
./sequences/handle/handle.clay:    = forward ...size(seq.inner., ...args);
./sequences/handle/handle.clay:    = forward ...index(seq.inner., ...args);
./sequences/handle/handle.clay:    = forward ...begin(seq.inner., ...args);
./sequences/handle/handle.clay:    = forward ...end(seq.inner., ...args);
./sequences/handle/handle.clay:    = forward ...front(seq.inner., ...args);
./sequences/handle/handle.clay:    = forward ...back(seq.inner., ...args);
./sequences/handle/handle.clay:    = forward ...push(seq.inner., ...args);
./sequences/handle/handle.clay:    = forward ...pop(seq.inner., ...args);
./sequences/handle/handle.clay:    = forward ...clear(seq.inner., ...args);
./sequences/handle/handle.clay:    = forward ...insert(seq.inner., ...args);
./sequences/handle/handle.clay:    = forward ...remove(seq.inner., ...args);
./sequences/handle/handle.clay:    = forward ...reserve(seq.inner., ...args);
./arrays/arrays.clay:            ptr. <-- next(srcIter);
./arrays/arrays.clay:            ptr. <-- next(srcIter);
./arrays/arrays.clay:            ptr. <-- elt;
./arrays/arrays.clay:            ptr. <-- next(srcIter);
./arrays/arrays.clay:            ptr. <-- move(x);
./system/system.clay:            var cstr = (argv + i).;
./types/types.clay:inline typeToLValue(a) = ref null(a).;
./unix/errno/errno.linux.clay:errno() = __errno_location().;
./unix/errno/errno.macosx.clay:errno() = __error().;
./unix/unix.clay:    return mappedInnerCoordinate(begin)..1;
./sqlite/sequences/sequences.clay:            intoBuffer. = rowRecord(row, T);
./sqlite/sequences/sequences.clay:[T,n] overload dereference(i: SqliteStatementCoordinate[T,n]) = i.seq.[i.index];
./sqlite/sequences/sequences.clay:    = i.seq.[i.index + j];
./any/any.clay:        ptr. <-- x.copyConstructor(x.ptr.);
./any/any.clay:        x.destructor(x.ptr.);
./any/any.clay:        Pointer[T](ptr). <-- x;
./any/any.clay:    return ref Pointer[T](x.ptr).;
./cocoa/objc/objc.clay:    = IdentifierConcat(#".", encodeIdentifier(T));
./cocoa/objc/objc.clay:overload encodeIdentifier(static RawPointer) = #".v";
./cocoa/objc/objc.clay:    = IdentifierConcat(#"..{", IdentifierStaticName(T), #"}");
./cocoa/objc/objc.clay:overload encodeIdentifier(static Pointer[Pointer[T]]) = #"..{Tuple}";
./cocoa/objc/objc.clay:overload encodeIdentifier(static Pointer[Pointer[T]]) = #"..(Union)";
./cocoa/objc/objc.clay:    ).;
./cocoa/util/util.clay:    = ref ...mapValues(ivar => ref fieldRef(self., ivar.0), ...ClassInstanceVars(O));
./cocoa/util/util.clay:    = (readerSelector, self => T(fieldRef(self., ivarName)), T);
./cocoa/util/util.clay:    = (readerSelector, self => SelectorReturnType(Id, readerSelector)(fieldRef(self., ivarName)));
./cocoa/util/util.clay:    = (writerSelector, (self, value) => { fieldRef(self., ivarName) = value; }, Void, T);
./cocoa/util/util.clay:    = (writerSelector, (self, value) => { fieldRef(self., ivarName) = value; });
./records/records.clay:RecordFieldType(static T, static i) = Type(staticIndex(null(T)., static i));
./records/records.clay:RecordFieldTypes(static T) = ...Type(...recordFields(null(T).));
./win32/win32.clay:    return mappedInnerCoordinate(begin)..1;
./win32/errno/errno.clay:errno() = win32._errno().;
./sharedpointers/sharedpointers.clay:    ptr..refCount = 1;
./sharedpointers/sharedpointers.clay:        ptr..value <-- x;
./sharedpointers/sharedpointers.clay:        src.ptr..refCount += 1;
./sharedpointers/sharedpointers.clay:        p.ptr..refCount -= 1;
./sharedpointers/sharedpointers.clay:        if (p.ptr..refCount == 0) {
./sharedpointers/sharedpointers.clay:            destroy(p.ptr..value);
./sharedpointers/sharedpointers.clay:inline overload dereference(p : SharedPointer[T]) = ref p.ptr..value;
./coordinates/coordinates.clay:inline overload dereference(c:ReverseCoordinate[T]) = forward ...(c.coord - 1).;
./coordinates/coordinates.clay:inline overload dereference(c:ByValueCoordinate[T]) = ...c.coord.;
./twohash/twohash.clay:    return &pEntry..value;
./twohash/twohash.clay:        pEntry..value = value;
./twohash/twohash.clay:        return ref pEntry..value;
./twohash/twohash.clay:    return ref pEntry..value;
./twohash/twohash.clay:    resetUnsafe(set.sentinel..key);
./twohash/twohash.clay:    set.sentinel..next = set.sentinel;
./twohash/twohash.clay:    set.sentinel..prev = set.sentinel;
./twohash/twohash.clay:    entry.prev = sentinel..prev;
./twohash/twohash.clay:    entry.next..prev = &entry;
./twohash/twohash.clay:    entry.prev..next = &entry;
./twohash/twohash.clay:    entry.prev..next = entry.next;
./twohash/twohash.clay:    entry.next..prev = entry.prev;
./twohash/twohash.clay:    entry.prev..next = &entry;
./twohash/twohash.clay:    entry.next..prev = &entry;
./twohash/twohash.clay:overload hasNext?(i: SetVectorItems[K]) = (i.current..next != i.sentinel);
./twohash/twohash.clay:    i.current = i.current..next;
./twohash/twohash.clay:    return ref i.current..key;
./twohash/implementation/implementation.clay:    ref e = x.data..tables[x.i][x.j].entries[k];
./twohash/implementation/implementation.clay:    if (x.j == size(x.data..tables[x.i]))
./twohash/implementation/implementation.clay:    ref th = x.data.;
./twohash/implementation/implementation.clay:            pEntry. <-- moveEntry(entry, th);
./random/random.clay:private bitcast(T, x) = Pointer[T](&x).;
./vectors/generic/generic.clay:inline overload index(a:V, i:I) = ref (vectorData(a) + SizeT(i)).;
./vectors/generic/generic.clay:            first. <-- next(iter);
./vectors/generic/generic.clay:        first. <-- move(x);
./vectors/generic/generic.clay:    first. <-- move(x);
./paged/namedvectors/namedvectors.clay:        header..size = size;
./paged/namedvectors/namedvectors.clay:        header..capacity = capacity;
./paged/namedvectors/namedvectors.clay:overload vectorData(a:NamedVector[T]) = &(a.data.);
./paged/namedvectors/namedvectors.clay:overload vectorSize(a:NamedVector[T]) = a.header..size;
./paged/namedvectors/namedvectors.clay:    a.header..size = n;
./paged/namedvectors/namedvectors.clay:overload vectorCapacity(a:NamedVector[T]) = a.header..capacity;
./paged/namedvectors/namedvectors.clay:    a.header..capacity = capacity;
./paged/strings/strings.clay:    return Pointer[Int8](&(begin(s).));
./paged/allocator/allocator.clay:blockSize(b) = bitwiseAnd(hptr(b)..sizeAndFlag, bitwiseNot(1));
./paged/allocator/allocator.clay:blockFree?(b) = (bitwiseAnd(hptr(b)..sizeAndFlag, 1) != 0);
./paged/allocator/allocator.clay:blockPrevious(b) = hptr(b)..previous;
./paged/allocator/allocator.clay:blockNextInBucket(b) = hptr(b)..nextInBucket;
./paged/allocator/allocator.clay:blockPreviousInBucket(b) = hptr(b)..previousInBucket;
./paged/allocator/allocator.clay:    hptr(b)..sizeAndFlag = bitwiseOr(SizeT(size), SizeT(blockFree?(b)));
./paged/allocator/allocator.clay:    hptr(b)..sizeAndFlag = bitwiseOr(blockSize(b), SizeT(free?));
./paged/allocator/allocator.clay:    hptr(b)..previous = previous;
./paged/allocator/allocator.clay:    hptr(b)..nextInBucket = next;
./paged/allocator/allocator.clay:    hptr(b)..previousInBucket = previous;
./paged/allocator/allocator.clay:    return ref state.freeListBuckets.[i];
./paged/allocator/allocator.clay:    while (i < size(state.freeListBuckets.)) {
./paged/allocator/allocator.clay:        ref head = state.freeListBuckets.[i];
./paged/allocator/allocator.clay:    for (head in x.freeListBuckets.)
./paged/allocator/allocator.clay:    return ref Pointer[T](p.offset + dataBegin()).;
./paged/allocator/allocator.clay:    for (i in range(size(x.freeListBuckets.)))
./paged/namedscalars/namedscalars.clay:        ptr. <-- initial;
./paged/namedscalars/namedscalars.clay:    ref Pointer[T](mappingAddress(x.mapping)).;
./paged/sharedpointers/sharedpointers.clay:    ptr..refCount = 1;
./paged/sharedpointers/sharedpointers.clay:    ptr..value <-- x;
./paged/sharedpointers/sharedpointers.clay:        src.ptr..refCount += 1;
./paged/sharedpointers/sharedpointers.clay:        p.ptr..refCount -= 1;
./paged/sharedpointers/sharedpointers.clay:        if (p.ptr..refCount == 0) {
./paged/sharedpointers/sharedpointers.clay:            destroy(p.ptr..value);
./paged/sharedpointers/sharedpointers.clay:overload dereference(p : SharedPointer[T]) = ref p.ptr..value;
./paged/vectors/vectors.clay:overload vectorData(a:Vector[T]) = &(a.data.);
./paged/vectors/vectors.clay:        ptr. <-- moveUnsafe(x);
./io/files/easy/easy.clay:overload fileHandle(f:File) = fileHandle(f.ptr..file);
./io/files/easy/easy.clay:    ref fd = f.ptr.;
./io/files/easy/easy.clay:    ref fd = f.ptr.;
./io/files/easy/easy.clay:        pendingNewlines += SizeT(src. == Byte('\n'));
./io/files/easy/easy.clay:        dest. = src.;
./io/files/easy/easy.clay:    flushData(f.ptr.);
./io/files/easy/easy.clay:    flush(f.ptr..file);
./io/files/easy/easy.clay:    flushData(f.ptr.);
./io/files/easy/easy.clay:    return fileSize(f.ptr..file);
./io/files/easy/easy.clay:    ref fd = f.ptr.;
./io/files/easy/easy.clay:overload terminal?(f:File) = terminal?(f.ptr..file);
./io/files/lines/lines.clay:        readLine(x.file., x.string);
./io/files/lines/lines.clay:        readLine(x.file., x.string);
./io/sockets/sockets.clay:    addr.host <-- psockaddr_in..sin_addr;
./io/sockets/sockets.clay:    addr.port <-- networkToHost(psockaddr_in..sin_port);
./io/sockets/sockets.clay:    if (hostent..h_addrtype != AF_INET
./io/sockets/sockets.clay:        or hostent..h_length < TypeSize(In_addr)
./io/sockets/sockets.clay:        or null?(hostent..h_addr_list[0]))
./io/sockets/sockets.clay:    return Pointer[In_addr](hostent..h_addr_list[0]).;
./io/mapping/mapping.unix.clay:mappingAddress(fm:FileMapping) = fm.inner..address;
./io/mapping/mapping.unix.clay:mappingLength(fm:FileMapping) = fm.inner..length;
./io/mapping/mapping.unix.clay:    var result = unix.msync(fm.inner..address, fm.inner..length, unix.MS_SYNC);
./io/mapping/mapping.windows.clay:mappingAddress(fm:FileMapping) = fm.inner..address;
./io/mapping/mapping.windows.clay:mappingLength(fm:FileMapping) = fm.inner..length;
./io/mapping/mapping.windows.clay:    var result = win32.FlushViewOfFile(fm.inner..address, fm.inner..length);
./io/mapping/mapping.windows.clay:    result = win32.FlushFileBuffers(fm.inner..fileHandle);
./numbers/parser/parser.clay:    if (end. != 0)
./numbers/parser/parser.clay:    if (end. != 0)
./numbers/parser/parser.clay:    if (end. != 0)
./numbers/parser/parser.clay:    if (end. != 0)
./numbers/parser/parser.clay:    if (end. != 0)
./numbers/parser/parser.clay:    if (end. != 0)
./numbers/parser/parser.clay:    if (end. != 0)
./numbers/parser/parser.clay:    if (end. != 0)
./numbers/parser/parser.clay:    if (end. != 0)
./numbers/parser/parser.clay:    if (end. != 0)