File: File.cs

package info (click to toggle)
mono 6.8.0.105%2Bdfsg-3.3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,284,512 kB
  • sloc: cs: 11,172,132; xml: 2,850,069; ansic: 671,653; cpp: 122,091; perl: 59,366; javascript: 30,841; asm: 22,168; makefile: 20,093; sh: 15,020; python: 4,827; pascal: 925; sql: 859; sed: 16; php: 1
file content (202 lines) | stat: -rw-r--r-- 5,622 bytes parent folder | download | duplicates (7)
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
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
/*
Used to determine Browser Capabilities by the Browsers UserAgent String and related
Browser supplied Headers.
Copyright (C) 2002-Present  Owen Brady (Ocean at owenbrady dot net) 
and Dean Brettle (dean at brettle dot com)

Permission is hereby granted, free of charge, to any person obtaining a copy 
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights 
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 
copies of the Software, and to permit persons to whom the Software is furnished
to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all 
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A 
PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT 
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE 
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
namespace System.Web.Configuration.nBrowser
{
	using System;
	using System.Collections.Generic;
	using System.Text;
	using System.Web.Configuration.nBrowser;

	class File
	{
		private System.Xml.XmlDocument BrowserFile;
		internal System.Web.Configuration.nBrowser.Node[] Nodes;
		private System.Collections.Specialized.ListDictionary Lookup;
		private System.Collections.Specialized.ListDictionary DefaultLookup;
		internal List<Node> RefNodes;
		
		public string FileName
		{
			get
			{
				return pFileName;
			}
		}
		private string pFileName = string.Empty;
		public File(string file)
		{
			pFileName = file;

			BrowserFile = new System.Xml.XmlDocument();
			//I can put this in a try /catch but I want
			//this to bubble up.
			BrowserFile.Load(file);

			this.Load(BrowserFile);
		}
		/// <summary>
		/// 
		/// </summary>
		/// <param name="file"></param>
		public File(System.Xml.XmlDocument BrowserFile, string filename)
		{
			pFileName = filename;
			this.Load(BrowserFile);
		}
		private void Load(System.Xml.XmlDocument BrowserFile)
		{
			Lookup = new System.Collections.Specialized.ListDictionary();
			DefaultLookup = new System.Collections.Specialized.ListDictionary();
			RefNodes = new List<Node>();
			System.Xml.XmlNode node;
			//I know this might allocate more nodes then needed but never less.
			Nodes = new Node[BrowserFile.DocumentElement.ChildNodes.Count];
			for (int a = 0;a <= BrowserFile.DocumentElement.ChildNodes.Count - 1;a++)
			{
				node = BrowserFile.DocumentElement.ChildNodes[a];

				if (node.NodeType == System.Xml.XmlNodeType.Comment)
				{
					continue;
				}
				Nodes[a] = new Node(node);
				Nodes[a].FileName = FileName;
				if (Nodes[a].NameType != NodeType.DefaultBrowser)
				{
					//fxcop sugguested this was faster then
					//Nodes[a].refID != string.Empty
					if (Nodes[a].RefId.Length > 0)
					{
						RefNodes.Add(Nodes[a]);
					}
					else if (Lookup.Contains(Nodes[a].Id) == false)
					{
						Lookup.Add(Nodes[a].Id, a);
					}
					else
					{
						throw new nBrowser.Exception("Duplicate ID found \"" + Nodes[a].Id + "\"");
					}
				}
				else
				{
					//fxcop sugguested this was faster then
					//Nodes[a].refID != string.Empty
					if (Nodes[a].RefId.Length > 0)
					{
						RefNodes.Add(Nodes[a]);
					}
					else if (DefaultLookup.Contains(Nodes[a].Id) == false)
					{
						DefaultLookup.Add(Nodes[a].Id, a);
					}
					else
					{
						throw new nBrowser.Exception("Duplicate ID found \"" + Nodes[a].Id + "\"");
					}
				}
			}
		}
		/// <summary>
		/// Returns a Array of strings, which represent the Id Attributes of all the
		/// Browser/Gatway Nodes
		/// </summary>
		public string[] Keys
		{
			get
			{

				string[] k = new string[Lookup.Keys.Count];
				//12-29-05
				//This will copy the Keys In Alphabetical Order
				//Lookup.Keys.CopyTo(k,0);
				//This Method is ment to copy the Keys in the order
				//that they were in the xml file.
				int b = 0;
				for (int i = 0;i <= Nodes.Length - 1;i++)
				{
					if (Nodes[i] != null && Nodes[i].NameType != NodeType.DefaultBrowser 
						&& Nodes[i].RefId.Length == 0)
					{
						k[b] = Nodes[i].Id;
						b++;
					}
				}
				return k;
			}
		}
		/// <summary>
		/// Returns a Array of strings, which represent the Id Attributes of all the
		/// DefaultBrowser Nodes
		/// </summary>
		public string[] DefaultKeys
		{
			get
			{
				string[] k = new string[DefaultLookup.Keys.Count];
				//12-29-05
				//This will copy the Keys In Alphabetical Order
				//DefaultLookup.Keys.CopyTo(k,0);
				//This Method is ment to copy the Keys in the order
				//that they were in the xml file.
				int b = 0;
				for (int i = 0;i <= Nodes.Length - 1;i++)
				{
					if (Nodes[i] != null && Nodes[i].NameType == NodeType.DefaultBrowser)
					{
						k[b] = Nodes[i].Id;
						b++;
					}
				}
				return k;
			}
		}

		/// <summary>
		/// 
		/// </summary>
		/// <param name="Key"></param>
		/// <returns></returns>
		internal Node GetNode(string Key)
		{
			object o = Lookup[Key];
			if (o == null)
				return GetDefaultNode (Key);
			return Nodes[(int)o];
		}

		/// <summary>
		/// 
		/// </summary>
		/// <param name="Key"></param>
		/// <returns></returns>
		internal Node GetDefaultNode(string Key)
		{
			object o = DefaultLookup[Key];
			if (o == null)
				return null;
			return Nodes[(int)o];
		}
	}
}