mirror of
https://github.com/c3lang/c3c.git
synced 2026-02-27 12:01:16 +00:00
Rename def to alias.
This commit is contained in:
@@ -4,9 +4,9 @@ import std::collections::growablebitset;
|
||||
import std::collections::list;
|
||||
import std::io;
|
||||
|
||||
def List = List{usz};
|
||||
alias List = List{usz};
|
||||
|
||||
def BitSet = BitSet{2048};
|
||||
alias BitSet = BitSet{2048};
|
||||
|
||||
fn void set_get()
|
||||
{
|
||||
@@ -45,7 +45,7 @@ fn void set_get()
|
||||
assert(bs.cardinality() == 0);
|
||||
}
|
||||
|
||||
def GrowableBitSet = GrowableBitSet{char};
|
||||
alias GrowableBitSet = GrowableBitSet{char};
|
||||
fn void growable_set_get()
|
||||
{
|
||||
GrowableBitSet bs;
|
||||
|
||||
@@ -2,7 +2,7 @@ module test;
|
||||
import std::io;
|
||||
import std::collections::map;
|
||||
|
||||
def IntMap = HashMap{String, int};
|
||||
alias IntMap = HashMap{String, int};
|
||||
fn void copy_map() @test
|
||||
{
|
||||
TrackingAllocator alloc;
|
||||
|
||||
@@ -1,8 +1,8 @@
|
||||
module elastic_array_test @test;
|
||||
import std::collections::elastic_array;
|
||||
|
||||
def IntList = ElasticArray{int, 10};
|
||||
def PtrList = ElasticArray{void*, 10};
|
||||
alias IntList = ElasticArray{int, 10};
|
||||
alias PtrList = ElasticArray{void*, 10};
|
||||
|
||||
fn void delete_contains_index()
|
||||
{
|
||||
|
||||
@@ -8,7 +8,7 @@ enum FooEnum
|
||||
THREE,
|
||||
}
|
||||
|
||||
def FooEnumMap = EnumMap{FooEnum, uint};
|
||||
alias FooEnumMap = EnumMap{FooEnum, uint};
|
||||
|
||||
fn void enums()
|
||||
{
|
||||
|
||||
@@ -1,7 +1,7 @@
|
||||
module linkedlist_test @test;
|
||||
import std::collections::linkedlist;
|
||||
|
||||
def IntList = LinkedList{int};
|
||||
alias IntList = LinkedList{int};
|
||||
|
||||
fn void test_is_initialized()
|
||||
{
|
||||
|
||||
@@ -1,15 +1,15 @@
|
||||
module list_test @test;
|
||||
import std::collections::list;
|
||||
|
||||
def IntList = List{int};
|
||||
def PtrList = List{void*};
|
||||
alias IntList = List{int};
|
||||
alias PtrList = List{void*};
|
||||
|
||||
struct Overalign
|
||||
{
|
||||
float[<4>] x @align(128);
|
||||
}
|
||||
|
||||
def OveralignList = List{Overalign};
|
||||
alias OveralignList = List{Overalign};
|
||||
fn void overaligned_type()
|
||||
{
|
||||
OveralignList l;
|
||||
|
||||
@@ -4,14 +4,14 @@ import std::collections::map;
|
||||
import std::sort;
|
||||
import std::io;
|
||||
|
||||
def TestHashMap = HashMap{String, usz};
|
||||
alias TestHashMap = HashMap{String, usz};
|
||||
|
||||
struct MapTest
|
||||
{
|
||||
String key;
|
||||
usz value;
|
||||
}
|
||||
def List = List{MapTest};
|
||||
alias List = List{MapTest};
|
||||
|
||||
fn void map()
|
||||
{
|
||||
@@ -55,7 +55,7 @@ fn void map()
|
||||
}
|
||||
}
|
||||
|
||||
def FooMap = HashMap{char, Foobar};
|
||||
alias FooMap = HashMap{char, Foobar};
|
||||
enum Foobar : inline char
|
||||
{
|
||||
FOO,
|
||||
|
||||
@@ -2,7 +2,7 @@ module priorityqueue_test @test;
|
||||
import std::collections;
|
||||
import std::collections::priorityqueue;
|
||||
|
||||
def Queue = PriorityQueue{int};
|
||||
alias Queue = PriorityQueue{int};
|
||||
|
||||
fn void priorityqueue()
|
||||
{
|
||||
@@ -32,7 +32,7 @@ fn void priorityqueue()
|
||||
assert(x == 3, "got %d; want %d", x, 3);
|
||||
}
|
||||
|
||||
def QueueMax = PriorityQueueMax{int};
|
||||
alias QueueMax = PriorityQueueMax{int};
|
||||
|
||||
fn void priorityqueue_max()
|
||||
{
|
||||
|
||||
@@ -1,8 +1,8 @@
|
||||
module range_test @test;
|
||||
import std::collections::range;
|
||||
|
||||
def IntRange = Range{int};
|
||||
def IntExRange = ExclusiveRange{int};
|
||||
alias IntRange = Range{int};
|
||||
alias IntExRange = ExclusiveRange{int};
|
||||
|
||||
fn void test_range()
|
||||
{
|
||||
|
||||
@@ -2,7 +2,7 @@ module ringbuffer_test @test;
|
||||
import std::collections::ringbuffer;
|
||||
import std::io;
|
||||
|
||||
def Buffer = RingBuffer{char[4]};
|
||||
alias Buffer = RingBuffer{char[4]};
|
||||
|
||||
fn void push_get()
|
||||
{
|
||||
|
||||
Reference in New Issue
Block a user