-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathElementActions.cs
More file actions
134 lines (104 loc) · 4.62 KB
/
ElementActions.cs
File metadata and controls
134 lines (104 loc) · 4.62 KB
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
133
using System.Text.Json;
using Hyperbee.Json.Extensions;
using Hyperbee.Json.Path;
using Hyperbee.Json.Pointer;
using Hyperbee.Json.Query;
namespace Hyperbee.Json.Descriptors.Element;
internal class ElementActions : INodeActions<JsonElement>
{
public bool TryParse( ref Utf8JsonReader reader, out JsonElement element )
{
try
{
if ( JsonDocument.TryParseValue( ref reader, out var document ) )
{
element = document.RootElement;
return true;
}
}
catch
{
// ignored: fall through
}
element = default;
return false;
}
public bool TryGetFromPointer( in JsonElement node, JsonSegment segment, out JsonElement value ) =>
SegmentPointer<JsonElement>.TryGetFromPointer( node, segment, out _, out value );
public bool DeepEquals( JsonElement left, JsonElement right ) =>
left.DeepEquals( right );
public IEnumerable<JsonElement> GetChildren( JsonElement value, ChildEnumerationOptions options )
{
bool complexTypesOnly = options.HasFlag( ChildEnumerationOptions.ComplexTypesOnly );
bool reverse = options.HasFlag( ChildEnumerationOptions.Reverse );
// allocating is faster than using yield return and less memory intensive.
// using a collection results in fewer overall allocations than calling
// LINQ reverse, which internally allocates, and then discards, a new array.
List<JsonElement> results;
switch ( value.ValueKind )
{
case JsonValueKind.Array:
{
var length = value.GetArrayLength();
results = new List<JsonElement>( length );
for ( var index = 0; index < length; index++ )
{
var child = value[index];
if ( complexTypesOnly && child.ValueKind is not (JsonValueKind.Array or JsonValueKind.Object) )
continue;
results.Add( child );
}
return reverse ? results.EnumerateReverse() : results;
}
case JsonValueKind.Object:
{
results = new List<JsonElement>( 8 );
foreach ( var child in value.EnumerateObject() )
{
if ( complexTypesOnly && child.Value.ValueKind is not (JsonValueKind.Array or JsonValueKind.Object) )
continue;
results.Add( child.Value );
}
return reverse ? results.EnumerateReverse() : results;
}
}
return [];
}
public IEnumerable<(JsonElement Value, string Key)> GetChildrenWithName( in JsonElement value, ChildEnumerationOptions options )
{
bool complexTypesOnly = options.HasFlag( ChildEnumerationOptions.ComplexTypesOnly );
bool reverse = options.HasFlag( ChildEnumerationOptions.Reverse );
// allocating is faster than using yield return and less memory intensive.
// using a collection results in fewer overall allocations than calling
// LINQ reverse, which internally allocates, and then discards, a new array.
List<(JsonElement, string)> results;
switch ( value.ValueKind )
{
case JsonValueKind.Array:
{
var length = value.GetArrayLength();
results = new List<(JsonElement, string)>( length );
for ( var index = 0; index < length; index++ )
{
var child = value[index];
if ( complexTypesOnly && child.ValueKind is not (JsonValueKind.Array or JsonValueKind.Object) )
continue;
results.Add( (child, IndexHelper.GetIndexString( index )) );
}
return reverse ? results.EnumerateReverse() : results;
}
case JsonValueKind.Object:
{
results = new List<(JsonElement, string)>( 8 );
foreach ( var child in value.EnumerateObject() )
{
if ( complexTypesOnly && child.Value.ValueKind is not (JsonValueKind.Array or JsonValueKind.Object) )
continue;
results.Add( (child.Value, child.Name) );
}
return reverse ? results.EnumerateReverse() : results;
}
}
return [];
}
}