StringTableBenchmark/StringTableBenchmark.MultiKeySort.cs at main · filipnavara/StringTableBenchmark · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
usingSystem.Buffers;
usingSystem.Text;
usingBenchmarkDotNet.Attributes;
usingMicrosoft.Diagnostics.Tracing.Parsers.Clr;

publicpartialclassStringTableBenchmarks
{
publiculongMultiKeySortByteSize;

[Benchmark]
publicvoidMultiKeySort()
{
// Copy the input
Span<string>inputSpan=inputData.ToArray();

// Output data
varstringTable=newArrayBufferWriter<byte>();
varstringToOffset=newDictionary<string,int>(inputSpan.Length);

// Pre-sort the string based on their matching suffix
MultiKeySort(inputSpan,0);

// Compose the final string table
string?lastSymbol=null;
for(inti=0;i<inputSpan.Length;i++)
{
varstr=inputSpan[i];
if(lastSymbol!=null&&lastSymbol.EndsWith(str,StringComparison.Ordinal))
{
// Suffix matches the last symbol
stringToOffset.Add(str,stringTable.WrittenCount-Encoding.UTF8.GetByteCount(str)-1);
}
else
{
lastSymbol=str;
stringToOffset.Add(str,stringTable.WrittenCount);

intutf8Length=Encoding.UTF8.GetByteCount(str.AsSpan());
varutf8Span=stringTable.GetSpan(utf8Length+1);
Encoding.UTF8.GetBytes(str,utf8Span);
utf8Span[utf8Length]=0;
stringTable.Advance(utf8Length+1);
}
}

MultiKeySortByteSize=(ulong)stringTable.WrittenCount;

staticcharTailCharacter(stringstr,intpos)
{
intindex=str.Length-pos-1;
if((uint)index<str.Length)
returnstr[index];
return'\0';
}

staticvoidMultiKeySort(Span<string>input,intpos)
{
if(!MultiKeySortSmallInput(input,pos))
{
MultiKeySortLargeInput(input,pos);
}
}

staticvoidMultiKeySortLargeInput(Span<string>input,intpos)
{
tailcall:
charpivot=TailCharacter(input[0],pos);
intl=0,h=input.Length;
for(inti=1;i<h;)
{
charc=TailCharacter(input[i],pos);
if(c>pivot)
{
(input[l],input[i])=(input[i],input[l]);
l++;i++;
}
elseif(c<pivot)
{
h--;
(input[h],input[i])=(input[i],input[h]);
}
else
{
i++;
}
}

MultiKeySort(input.Slice(0,l),pos);
MultiKeySort(input.Slice(h),pos);
if(pivot!='\0')
{
// Use a loop as a poor man's tailcall
// MultiKeySort(input.Slice(l, h - l), pos + 1);
pos++;
input=input.Slice(l,h-l);
if(!MultiKeySortSmallInput(input,pos))
{
gototailcall;
}
}
}

staticboolMultiKeySortSmallInput(Span<string>input,intpos)
{
if(input.Length<=1)
returntrue;

// Optimize comparing two strings
if(input.Length==2)
{
while(true)
{
charc0=TailCharacter(input[0],pos);
charc1=TailCharacter(input[1],pos);
if(c0<c1)
{
(input[0],input[1])=(input[1],input[0]);
break;
}
elseif(c0>c1||c0==(char)0)
{
break;
}
pos++;
}
returntrue;
}

returnfalse;
}
}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
usingSystem.Buffers;
usingSystem.Text;
usingBenchmarkDotNet.Attributes;
usingMicrosoft.Diagnostics.Tracing.Parsers.Clr;

publicpartialclassStringTableBenchmarks
{
publiculongMultiKeySortByteSize;

[Benchmark]
publicvoidMultiKeySort()
{
// Copy the input
Span<string>inputSpan=inputData.ToArray();

// Output data
varstringTable=newArrayBufferWriter<byte>();
varstringToOffset=newDictionary<string,int>(inputSpan.Length);

// Pre-sort the string based on their matching suffix
MultiKeySort(inputSpan,0);

// Compose the final string table
string?lastSymbol=null;
for(inti=0;i<inputSpan.Length;i++)
{
varstr=inputSpan[i];
if(lastSymbol!=null&&lastSymbol.EndsWith(str,StringComparison.Ordinal))
{
// Suffix matches the last symbol
stringToOffset.Add(str,stringTable.WrittenCount-Encoding.UTF8.GetByteCount(str)-1);
}
else
{
lastSymbol=str;
stringToOffset.Add(str,stringTable.WrittenCount);

intutf8Length=Encoding.UTF8.GetByteCount(str.AsSpan());
varutf8Span=stringTable.GetSpan(utf8Length+1);
Encoding.UTF8.GetBytes(str,utf8Span);
utf8Span[utf8Length]=0;
stringTable.Advance(utf8Length+1);
}
}

MultiKeySortByteSize=(ulong)stringTable.WrittenCount;

staticcharTailCharacter(stringstr,intpos)
{
intindex=str.Length-pos-1;
if((uint)index<str.Length)
returnstr[index];
return'\0';
}

staticvoidMultiKeySort(Span<string>input,intpos)
{
if(!MultiKeySortSmallInput(input,pos))
{
MultiKeySortLargeInput(input,pos);
}
}

staticvoidMultiKeySortLargeInput(Span<string>input,intpos)
{
tailcall:
charpivot=TailCharacter(input[0],pos);
intl=0,h=input.Length;
for(inti=1;i<h;)
{
charc=TailCharacter(input[i],pos);
if(c>pivot)
{
(input[l],input[i])=(input[i],input[l]);
l++;i++;
}
elseif(c<pivot)
{
h--;
(input[h],input[i])=(input[i],input[h]);
}
else
{
i++;
}
}

MultiKeySort(input.Slice(0,l),pos);
MultiKeySort(input.Slice(h),pos);
if(pivot!='\0')
{
// Use a loop as a poor man's tailcall
// MultiKeySort(input.Slice(l, h - l), pos + 1);
pos++;
input=input.Slice(l,h-l);
if(!MultiKeySortSmallInput(input,pos))
{
gototailcall;
}
}
}

staticboolMultiKeySortSmallInput(Span<string>input,intpos)
{
if(input.Length<=1)
returntrue;

// Optimize comparing two strings
if(input.Length==2)
{
while(true)
{
charc0=TailCharacter(input[0],pos);
charc1=TailCharacter(input[1],pos);
if(c0<c1)
{
(input[0],input[1])=(input[1],input[0]);
break;
}
elseif(c0>c1||c0==(char)0)
{
break;
}
pos++;
}
returntrue;
}

returnfalse;
}
}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
usingSystem.Buffers;
usingSystem.Text;
usingBenchmarkDotNet.Attributes;
usingMicrosoft.Diagnostics.Tracing.Parsers.Clr;

publicpartialclassStringTableBenchmarks
{
publiculongMultiKeySortByteSize;

[Benchmark]
publicvoidMultiKeySort()
{
// Copy the input
Span<string>inputSpan=inputData.ToArray();

// Output data
varstringTable=newArrayBufferWriter<byte>();
varstringToOffset=newDictionary<string,int>(inputSpan.Length);

// Pre-sort the string based on their matching suffix
MultiKeySort(inputSpan,0);

// Compose the final string table
string?lastSymbol=null;
for(inti=0;i<inputSpan.Length;i++)
{
varstr=inputSpan[i];
if(lastSymbol!=null&&lastSymbol.EndsWith(str,StringComparison.Ordinal))
{
// Suffix matches the last symbol
stringToOffset.Add(str,stringTable.WrittenCount-Encoding.UTF8.GetByteCount(str)-1);
}
else
{
lastSymbol=str;
stringToOffset.Add(str,stringTable.WrittenCount);

intutf8Length=Encoding.UTF8.GetByteCount(str.AsSpan());
varutf8Span=stringTable.GetSpan(utf8Length+1);
Encoding.UTF8.GetBytes(str,utf8Span);
utf8Span[utf8Length]=0;
stringTable.Advance(utf8Length+1);
}
}

MultiKeySortByteSize=(ulong)stringTable.WrittenCount;

staticcharTailCharacter(stringstr,intpos)
{
intindex=str.Length-pos-1;
if((uint)index<str.Length)
returnstr[index];
return'\0';
}

staticvoidMultiKeySort(Span<string>input,intpos)
{
if(!MultiKeySortSmallInput(input,pos))
{
MultiKeySortLargeInput(input,pos);
}
}

staticvoidMultiKeySortLargeInput(Span<string>input,intpos)
{
tailcall:
charpivot=TailCharacter(input[0],pos);
intl=0,h=input.Length;
for(inti=1;i<h;)
{
charc=TailCharacter(input[i],pos);
if(c>pivot)
{
(input[l],input[i])=(input[i],input[l]);
l++;i++;
}
elseif(c<pivot)
{
h--;
(input[h],input[i])=(input[i],input[h]);
}
else
{
i++;
}
}

MultiKeySort(input.Slice(0,l),pos);
MultiKeySort(input.Slice(h),pos);
if(pivot!='\0')
{
// Use a loop as a poor man's tailcall
// MultiKeySort(input.Slice(l, h - l), pos + 1);
pos++;
input=input.Slice(l,h-l);
if(!MultiKeySortSmallInput(input,pos))
{
gototailcall;
}
}
}

staticboolMultiKeySortSmallInput(Span<string>input,intpos)
{
if(input.Length<=1)
returntrue;

// Optimize comparing two strings
if(input.Length==2)
{
while(true)
{
charc0=TailCharacter(input[0],pos);
charc1=TailCharacter(input[1],pos);
if(c0<c1)
{
(input[0],input[1])=(input[1],input[0]);
break;
}
elseif(c0>c1||c0==(char)0)
{
break;
}
pos++;
}
returntrue;
}

returnfalse;
}
}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
usingSystem.Buffers;
usingSystem.Text;
usingBenchmarkDotNet.Attributes;
usingMicrosoft.Diagnostics.Tracing.Parsers.Clr;

publicpartialclassStringTableBenchmarks
{
publiculongMultiKeySortByteSize;

[Benchmark]
publicvoidMultiKeySort()
{
// Copy the input
Span<string>inputSpan=inputData.ToArray();

// Output data
varstringTable=newArrayBufferWriter<byte>();
varstringToOffset=newDictionary<string,int>(inputSpan.Length);

// Pre-sort the string based on their matching suffix
MultiKeySort(inputSpan,0);

// Compose the final string table
string?lastSymbol=null;
for(inti=0;i<inputSpan.Length;i++)
{
varstr=inputSpan[i];
if(lastSymbol!=null&&lastSymbol.EndsWith(str,StringComparison.Ordinal))
{
// Suffix matches the last symbol
stringToOffset.Add(str,stringTable.WrittenCount-Encoding.UTF8.GetByteCount(str)-1);
}
else
{
lastSymbol=str;
stringToOffset.Add(str,stringTable.WrittenCount);

intutf8Length=Encoding.UTF8.GetByteCount(str.AsSpan());
varutf8Span=stringTable.GetSpan(utf8Length+1);
Encoding.UTF8.GetBytes(str,utf8Span);
utf8Span[utf8Length]=0;
stringTable.Advance(utf8Length+1);
}
}

MultiKeySortByteSize=(ulong)stringTable.WrittenCount;

staticcharTailCharacter(stringstr,intpos)
{
intindex=str.Length-pos-1;
if((uint)index<str.Length)
returnstr[index];
return'\0';
}

staticvoidMultiKeySort(Span<string>input,intpos)
{
if(!MultiKeySortSmallInput(input,pos))
{
MultiKeySortLargeInput(input,pos);
}
}

staticvoidMultiKeySortLargeInput(Span<string>input,intpos)
{
tailcall:
charpivot=TailCharacter(input[0],pos);
intl=0,h=input.Length;
for(inti=1;i<h;)
{
charc=TailCharacter(input[i],pos);
if(c>pivot)
{
(input[l],input[i])=(input[i],input[l]);
l++;i++;
}
elseif(c<pivot)
{
h--;
(input[h],input[i])=(input[i],input[h]);
}
else
{
i++;
}
}

MultiKeySort(input.Slice(0,l),pos);
MultiKeySort(input.Slice(h),pos);
if(pivot!='\0')
{
// Use a loop as a poor man's tailcall
// MultiKeySort(input.Slice(l, h - l), pos + 1);
pos++;
input=input.Slice(l,h-l);
if(!MultiKeySortSmallInput(input,pos))
{
gototailcall;
}
}
}

staticboolMultiKeySortSmallInput(Span<string>input,intpos)
{
if(input.Length<=1)
returntrue;

// Optimize comparing two strings
if(input.Length==2)
{
while(true)
{
charc0=TailCharacter(input[0],pos);
charc1=TailCharacter(input[1],pos);
if(c0<c1)
{
(input[0],input[1])=(input[1],input[0]);
break;
}
elseif(c0>c1||c0==(char)0)
{
break;
}
pos++;
}
returntrue;
}

returnfalse;
}
}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
usingSystem.Buffers;
usingSystem.Text;
usingBenchmarkDotNet.Attributes;
usingMicrosoft.Diagnostics.Tracing.Parsers.Clr;

publicpartialclassStringTableBenchmarks
{
publiculongMultiKeySortByteSize;

[Benchmark]
publicvoidMultiKeySort()
{
// Copy the input
Span<string>inputSpan=inputData.ToArray();

// Output data
varstringTable=newArrayBufferWriter<byte>();
varstringToOffset=newDictionary<string,int>(inputSpan.Length);

// Pre-sort the string based on their matching suffix
MultiKeySort(inputSpan,0);

// Compose the final string table
string?lastSymbol=null;
for(inti=0;i<inputSpan.Length;i++)
{
varstr=inputSpan[i];
if(lastSymbol!=null&&lastSymbol.EndsWith(str,StringComparison.Ordinal))
{
// Suffix matches the last symbol
stringToOffset.Add(str,stringTable.WrittenCount-Encoding.UTF8.GetByteCount(str)-1);
}
else
{
lastSymbol=str;
stringToOffset.Add(str,stringTable.WrittenCount);

intutf8Length=Encoding.UTF8.GetByteCount(str.AsSpan());
varutf8Span=stringTable.GetSpan(utf8Length+1);
Encoding.UTF8.GetBytes(str,utf8Span);
utf8Span[utf8Length]=0;
stringTable.Advance(utf8Length+1);
}
}

MultiKeySortByteSize=(ulong)stringTable.WrittenCount;

staticcharTailCharacter(stringstr,intpos)
{
intindex=str.Length-pos-1;
if((uint)index<str.Length)
returnstr[index];
return'\0';
}

staticvoidMultiKeySort(Span<string>input,intpos)
{
if(!MultiKeySortSmallInput(input,pos))
{
MultiKeySortLargeInput(input,pos);
}
}

staticvoidMultiKeySortLargeInput(Span<string>input,intpos)
{
tailcall:
charpivot=TailCharacter(input[0],pos);
intl=0,h=input.Length;
for(inti=1;i<h;)
{
charc=TailCharacter(input[i],pos);
if(c>pivot)
{
(input[l],input[i])=(input[i],input[l]);
l++;i++;
}
elseif(c<pivot)
{
h--;
(input[h],input[i])=(input[i],input[h]);
}
else
{
i++;
}
}

MultiKeySort(input.Slice(0,l),pos);
MultiKeySort(input.Slice(h),pos);
if(pivot!='\0')
{
// Use a loop as a poor man's tailcall
// MultiKeySort(input.Slice(l, h - l), pos + 1);
pos++;
input=input.Slice(l,h-l);
if(!MultiKeySortSmallInput(input,pos))
{
gototailcall;
}
}
}

staticboolMultiKeySortSmallInput(Span<string>input,intpos)
{
if(input.Length<=1)
returntrue;

// Optimize comparing two strings
if(input.Length==2)
{
while(true)
{
charc0=TailCharacter(input[0],pos);
charc1=TailCharacter(input[1],pos);
if(c0<c1)
{
(input[0],input[1])=(input[1],input[0]);
break;
}
elseif(c0>c1||c0==(char)0)
{
break;
}
pos++;
}
returntrue;
}

returnfalse;
}
}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
usingSystem.Buffers;
usingSystem.Text;
usingBenchmarkDotNet.Attributes;
usingMicrosoft.Diagnostics.Tracing.Parsers.Clr;

publicpartialclassStringTableBenchmarks
{
publiculongMultiKeySortByteSize;

[Benchmark]
publicvoidMultiKeySort()
{
// Copy the input
Span<string>inputSpan=inputData.ToArray();

// Output data
varstringTable=newArrayBufferWriter<byte>();
varstringToOffset=newDictionary<string,int>(inputSpan.Length);

// Pre-sort the string based on their matching suffix
MultiKeySort(inputSpan,0);

// Compose the final string table
string?lastSymbol=null;
for(inti=0;i<inputSpan.Length;i++)
{
varstr=inputSpan[i];
if(lastSymbol!=null&&lastSymbol.EndsWith(str,StringComparison.Ordinal))
{
// Suffix matches the last symbol
stringToOffset.Add(str,stringTable.WrittenCount-Encoding.UTF8.GetByteCount(str)-1);
}
else
{
lastSymbol=str;
stringToOffset.Add(str,stringTable.WrittenCount);

intutf8Length=Encoding.UTF8.GetByteCount(str.AsSpan());
varutf8Span=stringTable.GetSpan(utf8Length+1);
Encoding.UTF8.GetBytes(str,utf8Span);
utf8Span[utf8Length]=0;
stringTable.Advance(utf8Length+1);
}
}

MultiKeySortByteSize=(ulong)stringTable.WrittenCount;

staticcharTailCharacter(stringstr,intpos)
{
intindex=str.Length-pos-1;
if((uint)index<str.Length)
returnstr[index];
return'\0';
}

staticvoidMultiKeySort(Span<string>input,intpos)
{
if(!MultiKeySortSmallInput(input,pos))
{
MultiKeySortLargeInput(input,pos);
}
}

staticvoidMultiKeySortLargeInput(Span<string>input,intpos)
{
tailcall:
charpivot=TailCharacter(input[0],pos);
intl=0,h=input.Length;
for(inti=1;i<h;)
{
charc=TailCharacter(input[i],pos);
if(c>pivot)
{
(input[l],input[i])=(input[i],input[l]);
l++;i++;
}
elseif(c<pivot)
{
h--;
(input[h],input[i])=(input[i],input[h]);
}
else
{
i++;
}
}

MultiKeySort(input.Slice(0,l),pos);
MultiKeySort(input.Slice(h),pos);
if(pivot!='\0')
{
// Use a loop as a poor man's tailcall
// MultiKeySort(input.Slice(l, h - l), pos + 1);
pos++;
input=input.Slice(l,h-l);
if(!MultiKeySortSmallInput(input,pos))
{
gototailcall;
}
}
}

staticboolMultiKeySortSmallInput(Span<string>input,intpos)
{
if(input.Length<=1)
returntrue;

// Optimize comparing two strings
if(input.Length==2)
{
while(true)
{
charc0=TailCharacter(input[0],pos);
charc1=TailCharacter(input[1],pos);
if(c0<c1)
{
(input[0],input[1])=(input[1],input[0]);
break;
}
elseif(c0>c1||c0==(char)0)
{
break;
}
pos++;
}
returntrue;
}

returnfalse;
}
}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
usingSystem.Buffers;
usingSystem.Text;
usingBenchmarkDotNet.Attributes;
usingMicrosoft.Diagnostics.Tracing.Parsers.Clr;

publicpartialclassStringTableBenchmarks
{
publiculongMultiKeySortByteSize;

[Benchmark]
publicvoidMultiKeySort()
{
// Copy the input
Span<string>inputSpan=inputData.ToArray();

// Output data
varstringTable=newArrayBufferWriter<byte>();
varstringToOffset=newDictionary<string,int>(inputSpan.Length);

// Pre-sort the string based on their matching suffix
MultiKeySort(inputSpan,0);

// Compose the final string table
string?lastSymbol=null;
for(inti=0;i<inputSpan.Length;i++)
{
varstr=inputSpan[i];
if(lastSymbol!=null&&lastSymbol.EndsWith(str,StringComparison.Ordinal))
{
// Suffix matches the last symbol
stringToOffset.Add(str,stringTable.WrittenCount-Encoding.UTF8.GetByteCount(str)-1);
}
else
{
lastSymbol=str;
stringToOffset.Add(str,stringTable.WrittenCount);

intutf8Length=Encoding.UTF8.GetByteCount(str.AsSpan());
varutf8Span=stringTable.GetSpan(utf8Length+1);
Encoding.UTF8.GetBytes(str,utf8Span);
utf8Span[utf8Length]=0;
stringTable.Advance(utf8Length+1);
}
}

MultiKeySortByteSize=(ulong)stringTable.WrittenCount;

staticcharTailCharacter(stringstr,intpos)
{
intindex=str.Length-pos-1;
if((uint)index<str.Length)
returnstr[index];
return'\0';
}

staticvoidMultiKeySort(Span<string>input,intpos)
{
if(!MultiKeySortSmallInput(input,pos))
{
MultiKeySortLargeInput(input,pos);
}
}

staticvoidMultiKeySortLargeInput(Span<string>input,intpos)
{
tailcall:
charpivot=TailCharacter(input[0],pos);
intl=0,h=input.Length;
for(inti=1;i<h;)
{
charc=TailCharacter(input[i],pos);
if(c>pivot)
{
(input[l],input[i])=(input[i],input[l]);
l++;i++;
}
elseif(c<pivot)
{
h--;
(input[h],input[i])=(input[i],input[h]);
}
else
{
i++;
}
}

MultiKeySort(input.Slice(0,l),pos);
MultiKeySort(input.Slice(h),pos);
if(pivot!='\0')
{
// Use a loop as a poor man's tailcall
// MultiKeySort(input.Slice(l, h - l), pos + 1);
pos++;
input=input.Slice(l,h-l);
if(!MultiKeySortSmallInput(input,pos))
{
gototailcall;
}
}
}

staticboolMultiKeySortSmallInput(Span<string>input,intpos)
{
if(input.Length<=1)
returntrue;

// Optimize comparing two strings
if(input.Length==2)
{
while(true)
{
charc0=TailCharacter(input[0],pos);
charc1=TailCharacter(input[1],pos);
if(c0<c1)
{
(input[0],input[1])=(input[1],input[0]);
break;
}
elseif(c0>c1||c0==(char)0)
{
break;
}
pos++;
}
returntrue;
}

returnfalse;
}
}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
usingSystem.Buffers;
usingSystem.Text;
usingBenchmarkDotNet.Attributes;
usingMicrosoft.Diagnostics.Tracing.Parsers.Clr;

publicpartialclassStringTableBenchmarks
{
publiculongMultiKeySortByteSize;

[Benchmark]
publicvoidMultiKeySort()
{
// Copy the input
Span<string>inputSpan=inputData.ToArray();

// Output data
varstringTable=newArrayBufferWriter<byte>();
varstringToOffset=newDictionary<string,int>(inputSpan.Length);

// Pre-sort the string based on their matching suffix
MultiKeySort(inputSpan,0);

// Compose the final string table
string?lastSymbol=null;
for(inti=0;i<inputSpan.Length;i++)
{
varstr=inputSpan[i];
if(lastSymbol!=null&&lastSymbol.EndsWith(str,StringComparison.Ordinal))
{
// Suffix matches the last symbol
stringToOffset.Add(str,stringTable.WrittenCount-Encoding.UTF8.GetByteCount(str)-1);
}
else
{
lastSymbol=str;
stringToOffset.Add(str,stringTable.WrittenCount);

intutf8Length=Encoding.UTF8.GetByteCount(str.AsSpan());
varutf8Span=stringTable.GetSpan(utf8Length+1);
Encoding.UTF8.GetBytes(str,utf8Span);
utf8Span[utf8Length]=0;
stringTable.Advance(utf8Length+1);
}
}

MultiKeySortByteSize=(ulong)stringTable.WrittenCount;

staticcharTailCharacter(stringstr,intpos)
{
intindex=str.Length-pos-1;
if((uint)index<str.Length)
returnstr[index];
return'\0';
}

staticvoidMultiKeySort(Span<string>input,intpos)
{
if(!MultiKeySortSmallInput(input,pos))
{
MultiKeySortLargeInput(input,pos);
}
}

staticvoidMultiKeySortLargeInput(Span<string>input,intpos)
{
tailcall:
charpivot=TailCharacter(input[0],pos);
intl=0,h=input.Length;
for(inti=1;i<h;)
{
charc=TailCharacter(input[i],pos);
if(c>pivot)
{
(input[l],input[i])=(input[i],input[l]);
l++;i++;
}
elseif(c<pivot)
{
h--;
(input[h],input[i])=(input[i],input[h]);
}
else
{
i++;
}
}

MultiKeySort(input.Slice(0,l),pos);
MultiKeySort(input.Slice(h),pos);
if(pivot!='\0')
{
// Use a loop as a poor man's tailcall
// MultiKeySort(input.Slice(l, h - l), pos + 1);
pos++;
input=input.Slice(l,h-l);
if(!MultiKeySortSmallInput(input,pos))
{
gototailcall;
}
}
}

staticboolMultiKeySortSmallInput(Span<string>input,intpos)
{
if(input.Length<=1)
returntrue;

// Optimize comparing two strings
if(input.Length==2)
{
while(true)
{
charc0=TailCharacter(input[0],pos);
charc1=TailCharacter(input[1],pos);
if(c0<c1)
{
(input[0],input[1])=(input[1],input[0]);
break;
}
elseif(c0>c1||c0==(char)0)
{
break;
}
pos++;
}
returntrue;
}

returnfalse;
}
}
}