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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
|
/* ****************************************************************************
*
* Copyright (c) Microsoft Corporation.
*
* This source code is subject to terms and conditions of the Apache License, Version 2.0. A
* copy of the license can be found in the License.html file at the root of this distribution. If
* you cannot locate the Apache License, Version 2.0, please send an email to
* dlr@microsoft.com. By using this source code in any fashion, you are agreeing to be bound
* by the terms of the Apache License, Version 2.0.
*
* You must not remove this notice, or any other, from this software.
*
*
* ***************************************************************************/
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Dynamic.Utils;
using System.Text;
namespace System.Dynamic {
/// <summary>
/// Represents a dynamically assigned class. Expando objects which share the same
/// members will share the same class. Classes are dynamically assigned as the
/// expando object gains members.
/// </summary>
internal class ExpandoClass {
private readonly string[] _keys; // list of names associated with each element in the data array, sorted
private readonly int _hashCode; // pre-calculated hash code of all the keys the class contains
private Dictionary<int, List<WeakReference>> _transitions; // cached transitions
private const int EmptyHashCode = 6551; // hash code of the empty ExpandoClass.
internal static ExpandoClass Empty = new ExpandoClass(); // The empty Expando class - all Expando objects start off w/ this class.
/// <summary>
/// Constructs the empty ExpandoClass. This is the class used when an
/// empty Expando object is initially constructed.
/// </summary>
internal ExpandoClass() {
_hashCode = EmptyHashCode;
_keys = new string[0];
}
/// <summary>
/// Constructs a new ExpandoClass that can hold onto the specified keys. The
/// keys must be sorted ordinally. The hash code must be precalculated for
/// the keys.
/// </summary>
internal ExpandoClass(string[] keys, int hashCode) {
_hashCode = hashCode;
_keys = keys;
}
/// <summary>
/// Finds or creates a new ExpandoClass given the existing set of keys
/// in this ExpandoClass plus the new key to be added. Members in an
/// ExpandoClass are always stored case sensitively.
/// </summary>
internal ExpandoClass FindNewClass(string newKey) {
// just XOR the newKey hash code
int hashCode = _hashCode ^ newKey.GetHashCode();
lock (this) {
List<WeakReference> infos = GetTransitionList(hashCode);
for (int i = 0; i < infos.Count; i++) {
ExpandoClass klass = infos[i].Target as ExpandoClass;
if (klass == null) {
infos.RemoveAt(i);
i--;
continue;
}
if (string.Equals(klass._keys[klass._keys.Length - 1], newKey, StringComparison.Ordinal)) {
// the new key is the key we added in this transition
return klass;
}
}
// no applicable transition, create a new one
string[] keys = new string[_keys.Length + 1];
Array.Copy(_keys, keys, _keys.Length);
keys[_keys.Length] = newKey;
ExpandoClass ec = new ExpandoClass(keys, hashCode);
infos.Add(new WeakReference(ec));
return ec;
}
}
/// <summary>
/// Gets the lists of transitions that are valid from this ExpandoClass
/// to an ExpandoClass whos keys hash to the apporopriate hash code.
/// </summary>
private List<WeakReference> GetTransitionList(int hashCode) {
if (_transitions == null) {
_transitions = new Dictionary<int, List<WeakReference>>();
}
List<WeakReference> infos;
if (!_transitions.TryGetValue(hashCode, out infos)) {
_transitions[hashCode] = infos = new List<WeakReference>();
}
return infos;
}
/// <summary>
/// Gets the index at which the value should be stored for the specified name.
/// </summary>
internal int GetValueIndex(string name, bool caseInsensitive, ExpandoObject obj) {
if (caseInsensitive) {
return GetValueIndexCaseInsensitive(name, obj);
} else {
return GetValueIndexCaseSensitive(name);
}
}
/// <summary>
/// Gets the index at which the value should be stored for the specified name
/// case sensitively. Returns the index even if the member is marked as deleted.
/// </summary>
internal int GetValueIndexCaseSensitive(string name) {
for (int i = 0; i < _keys.Length; i++) {
if (string.Equals(
_keys[i],
name,
StringComparison.Ordinal)) {
return i;
}
}
return ExpandoObject.NoMatch;
}
/// <summary>
/// Gets the index at which the value should be stored for the specified name,
/// the method is only used in the case-insensitive case.
/// </summary>
/// <param name="name">the name of the member</param>
/// <param name="obj">The ExpandoObject associated with the class
/// that is used to check if a member has been deleted.</param>
/// <returns>
/// the exact match if there is one
/// if there is exactly one member with case insensitive match, return it
/// otherwise we throw AmbiguousMatchException.
/// </returns>
private int GetValueIndexCaseInsensitive(string name, ExpandoObject obj) {
int caseInsensitiveMatch = ExpandoObject.NoMatch; //the location of the case-insensitive matching member
lock (obj.LockObject) {
for (int i = _keys.Length - 1; i >= 0; i--) {
if (string.Equals(
_keys[i],
name,
StringComparison.OrdinalIgnoreCase)) {
//if the matching member is deleted, continue searching
if (!obj.IsDeletedMember(i)) {
if (caseInsensitiveMatch == ExpandoObject.NoMatch) {
caseInsensitiveMatch = i;
} else {
//Ambigous match, stop searching
return ExpandoObject.AmbiguousMatchFound;
}
}
}
}
}
//There is exactly one member with case insensitive match.
return caseInsensitiveMatch;
}
/// <summary>
/// Gets the names of the keys that can be stored in the Expando class. The
/// list is sorted ordinally.
/// </summary>
internal string[] Keys {
get {
return _keys;
}
}
}
}
|
