Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
executable file
·
93 lines (78 loc) · 3.24 KB

File metadata and controls

executable file
·
93 lines (78 loc) · 3.24 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
module main;
import core.memory : GC;
import std.datetime : StopWatch;
import std.performance.array : Appender;
import std.serialization : serializable;
import std.serialization.bson : fromBSON, toBSON;
import std.serialization.json : fromJSON, toJSON;
import std.serialization.xml : fromXML, toXML;
import std.stdio;
enum ObjectCount = 100000;
@serializable final class SimpleObject
{
int id;
string name;
string address;
int[] scores;
public static SimpleObject Create(int id)
{
import std.conv : to;
import std.random : uniform;
auto so = new SimpleObject();
so.id = uniform(0, ObjectCount);
so.name = "Simple-" ~ to!string(id);
so.address = "Planet Earth";
auto scoreCount = uniform(0, 10);
for (auto i = 0; i < scoreCount; i++)
{
// This is a uniform random with a uniform bias torward 0, to produce more realistic
// data as input. (as most data has a tendancy to group torwards 0)
so.scores ~= uniform(uniform(int.min, 0), uniform(0, int.max));
}
return so;
}
}
// serializeFunc must be of the type `void function(SimpleObject a, ref Appender!(ubyte[]) ret)`
// deserializeFunc must be of the type `SimpleObject function(ubyte[] val)`
static void runBenchmark(string serializationFormatName, alias serializeFunc, alias deserializeFunc)(ref SimpleObject[] sourceArray, ref ubyte[][] intermediateArray, ref SimpleObject[] destinationArray)
{
writeln(serializationFormatName, ':');
size_t totalPayload = 0;
StopWatch swSerialize;
auto ret = Appender!(ubyte[])();
foreach (i, so; sourceArray)
{
swSerialize.start();
serializeFunc(so, ret);
swSerialize.stop();
intermediateArray[i] = ret.data;
totalPayload += intermediateArray[i].length;
ret.clear();
}
writefln("\tTook %s ms (%s ms / %s/sec) to serialize 100k SimpleObjects with an average payload of %s bytes (%s).", swSerialize.peek().msecs, cast(real)swSerialize.peek().msecs / ObjectCount, cast(ulong)(cast(real)ObjectCount * (1000.0 / swSerialize.peek().msecs)), cast(real)totalPayload / ObjectCount, totalPayload);
StopWatch swDeserialize;
foreach (i, val; intermediateArray)
{
swDeserialize.start();
destinationArray[i] = deserializeFunc(val);
swDeserialize.stop();
}
writefln("\tTook %s ms (%s ms / %s/sec) to deserialize 100k SimpleObjects", swDeserialize.peek().msecs, cast(real)swDeserialize.peek().msecs / ObjectCount, cast(ulong)(cast(real)ObjectCount * (1000.0 / swDeserialize.peek().msecs)));
writeln();
intermediateArray[] = null;
destinationArray[] = null;
GC.collect();
}
void main(string[] args)
{
GC.disable();
ubyte[][] intermediateArray = new ubyte[][ObjectCount];
SimpleObject[] sourceArray = new SimpleObject[ObjectCount];
SimpleObject[] destinationArray = new SimpleObject[ObjectCount];
for (auto i = 0; i < ObjectCount; i++)
sourceArray[i] = SimpleObject.Create(i);
GC.collect();
runBenchmark!("JSON", (so, ref ret) => toJSON(so, ret), (val) => fromJSON!SimpleObject(cast(string)val))(sourceArray, intermediateArray, destinationArray);
runBenchmark!("BSON", (so, ref ret) => toBSON(so, ret), (val) => fromBSON!SimpleObject(val))(sourceArray, intermediateArray, destinationArray);
runBenchmark!("XML", (so, ref ret) => toXML(so, ret), (val) => fromXML!SimpleObject(cast(string)val))(sourceArray, intermediateArray, destinationArray);
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.