unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
How to plot a long path with Virtual Earth
===
The obvious way to plot a path with virtual earth (VEMap.GetDirections) is limited to 25 points. When trying to plot a vehicle's journey this is extremely limiting.
How can I plot a by-road journey of more than 25 points on a virtual earth map? | 0 | [
2,
184,
20,
3798,
21,
175,
2013,
29,
6599,
1073,
800,
3726,
3726,
14,
4674,
161,
20,
3798,
21,
2013,
29,
6599,
1073,
13,
5,
195,
15022,
9,
3060,
14706,
5757,
6,
25,
1317,
20,
771,
819,
9,
76,
749,
20,
3798,
21,
2664,
22,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Anyone have a diff algorithm for rendered HTML?
===
I'm interested in seeing a good diff algorithm, possibly in Javascript, for rendering a side-by-side diff of two HTML pages. The idea would be that the diff would show the differences of the *rendered* HTML. | 0 | [
2,
1276,
57,
21,
20811,
9083,
26,
10877,
13,
15895,
60,
800,
3726,
3726,
31,
22,
79,
3158,
19,
2078,
21,
254,
20811,
9083,
15,
2879,
19,
8247,
8741,
15,
26,
15307,
21,
270,
8,
779,
8,
1416,
20811,
16,
81,
13,
15895,
4434,
9,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How many ServiceContracts can a WCF Service have?
===
Specifically, since a ServiceContract is an Attribute to an Interface, how many interfaces can I code into one WCF web service? Is it a one-to-one? | 0 | [
2,
184,
151,
365,
23311,
18,
92,
21,
11801,
410,
365,
57,
60,
800,
3726,
3726,
3524,
15,
179,
21,
365,
23311,
25,
40,
35,
14755,
20,
40,
6573,
15,
184,
151,
6573,
18,
92,
31,
1797,
77,
53,
11801,
410,
2741,
365,
60,
25,
32,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
ConfigurationManager
===
In .net frameworks 1.1, I use
`System.Configuration.ConfigurationSettings.AppSettings["name"];`
for application settings. But in Frameworks 2.0, it says ConfigurationSettings is obsolete and to use ConfigurationManager instead. So I swapped it out with this
`System.Configuration.Con... | 0 | [
2,
8091,
22256,
800,
3726,
3726,
19,
13,
9,
2328,
6596,
18,
137,
9,
165,
15,
31,
275,
13,
1,
10724,
9,
1126,
13549,
857,
9,
1126,
13549,
857,
19831,
18,
9,
7753,
19831,
18,
2558,
7,
7259,
7,
12660,
1,
26,
3010,
12410,
9,
47,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Preventing XML Serialization of IEnumerable and ICollection<T> & Inherited Types
===
**NOTE: _XMLIgnore_ is NOT the answer!**
OK, so following on from my question on [XML Serialization and Inherited Types](http://stackoverflow.com/questions/20084/xml-serialization-and-inherited-types), I began integrating that code... | 0 | [
2,
11520,
23504,
5956,
1829,
16,
13,
660,
6336,
106,
579,
17,
31,
15015,
872,
1,
38,
1,
279,
7179,
2551,
800,
3726,
3726,
13,
1409,
10280,
45,
13,
1,
396,
8184,
23565,
99,
1,
25,
52,
14,
1623,
187,
1409,
5854,
15,
86,
249,
27,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to respond to an alternate URI in a RESTful web service
===
I'm building a RESTful web service which has multiple URIs for one of its resources, because there is more than one unique identifier. Should the server respond to a GET request for an alternate URI by returning the resource, or should I send an HTTP 3xx ... | 0 | [
2,
184,
20,
4590,
20,
40,
4912,
13,
3594,
19,
21,
760,
1566,
2741,
365,
800,
3726,
3726,
31,
22,
79,
353,
21,
760,
1566,
2741,
365,
56,
63,
1886,
13,
3594,
18,
26,
53,
16,
82,
2566,
15,
185,
80,
25,
91,
119,
53,
2619,
25570,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Performance issues regarding Access 2003 and the OLE Object data type
===
In MS Access 2003 (I know, I know), I'm using the OLE Object data type to persist the sate of some objects that are marked as serializable (just using a IO.BinaryFormatter to serialize to a MemoryStream, and then saving that to the db as a Byte ... | 0 | [
2,
956,
1549,
3467,
1381,
973,
17,
14,
12116,
3095,
1054,
1001,
800,
3726,
3726,
19,
4235,
1381,
973,
13,
5,
49,
143,
15,
31,
143,
6,
15,
31,
22,
79,
568,
14,
12116,
3095,
1054,
1001,
20,
22084,
14,
847,
62,
16,
109,
3916,
30,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to find out which Service Pack is installed on SQL Server?
===
the title says it all... | 0 | [
2,
184,
20,
477,
70,
56,
365,
3607,
25,
4066,
27,
4444,
255,
8128,
60,
800,
3726,
3726,
14,
581,
898,
32,
65,
9,
9,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Algorithmic complexity of XML parsers/validators
===
I need to know how the performance of different XML tools (parsers, validators, XPath expression evaluators, etc) is affected by the size and complexity of the input document. Are there resources out there that document how CPU time and memory usage are affected by.... | 0 | [
2,
9083,
596,
12745,
16,
23504,
2017,
18,
445,
118,
18506,
43,
9922,
800,
3726,
3726,
31,
376,
20,
143,
184,
14,
956,
16,
421,
23504,
4672,
13,
5,
3574,
18,
445,
15,
7394,
9922,
15,
993,
8353,
1803,
6805,
2377,
9922,
15,
2722,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Generating random terrain in Blender3D
===
I tried finding a python script in google that will generate a random terrain when the game starts (or each time a the player advances to a new scene) but all the tools I found are for creating a terrain to render it, not for the game mode.
Any idea how/where to find one?
... | 0 | [
2,
13500,
5477,
9132,
19,
11138,
106,
240,
43,
800,
3726,
3726,
31,
794,
3007,
21,
20059,
3884,
19,
8144,
30,
129,
7920,
21,
5477,
9132,
76,
14,
250,
3244,
13,
5,
248,
206,
85,
21,
14,
517,
10592,
20,
21,
78,
1691,
6,
47,
65,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best books about TDD
===
I'd like to enhance my TDD knowledge and practice. What would you recommend to read? | 4 | [
2,
246,
964,
88,
15596,
43,
800,
3726,
3726,
31,
22,
43,
101,
20,
10734,
51,
15596,
43,
1918,
17,
1345,
9,
98,
83,
42,
12360,
20,
1302,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Java Logging vs Log4J
===
is it still worth to add the log4j library to a Java 5 project just to log
let's say some exceptions to a file with some nice rollover settings.
Or will the standard util.logging facility do the job as well?
What do you think? Thanks for sharing your thoughts!
Okami
| 0 | [
2,
8247,
13,
13919,
4611,
6738,
300,
728,
800,
3726,
3726,
25,
32,
174,
2715,
20,
3547,
14,
6738,
300,
728,
1248,
20,
21,
8247,
331,
669,
114,
20,
6738,
408,
22,
18,
395,
109,
13392,
20,
21,
3893,
29,
109,
2210,
3001,
2549,
1241... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XML Schema construct for "Any number of these elements - in any order"
===
I need to create an XML schema that looks something like this:
<xs:element name="wrapperElement">
<xs:complexType>
<xs:sequence>
<xs:element type="el1">
<xs:element type="el2">
</xs:sequen... | 0 | [
2,
23504,
23874,
6960,
26,
13,
7,
6001,
234,
16,
158,
2065,
13,
8,
19,
186,
389,
7,
800,
3726,
3726,
31,
376,
20,
1600,
40,
23504,
23874,
30,
1879,
301,
101,
48,
45,
13,
1,
396,
18,
45,
27567,
204,
3726,
7,
499,
525,
8763,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Capturing Cmd-C keyboard event from modular Flex application in browser or AIR.
===
It seems that it is impossible to capture the keyboard event normally used for copy when running a Flex application in the browser or as an AIR app, presumably because the browser or OS is intercepting it first.
Is there a way to te... | 0 | [
2,
12859,
2390,
43,
8,
150,
8896,
807,
37,
20802,
14409,
3010,
19,
16495,
54,
282,
9,
800,
3726,
3726,
32,
2206,
30,
32,
25,
3992,
20,
3683,
14,
8896,
807,
4147,
147,
26,
4344,
76,
946,
21,
14409,
3010,
19,
14,
16495,
54,
28,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to marshal an array of structs - (.Net/C# => C++)
===
Disclaimer: Near zero with marshalling concepts..
I have a struct B that contains a string + an array of structs C. I need to send this across the giant interop chasm to a COM - C++ consumer.
**What are the right set of attributes I need to decorate my st... | 0 | [
2,
184,
20,
7583,
40,
7718,
16,
13,
10346,
18,
13,
8,
13,
5,
9,
2328,
118,
150,
5910,
800,
1,
272,
20512,
6,
800,
3726,
3726,
1460,
22661,
106,
45,
424,
4606,
29,
4526,
68,
8700,
9,
9,
31,
57,
21,
13,
10346,
334,
30,
1588,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Good reasons for not letting the browser launch local applications
===
I know this might be a no-brainer, but please read on.
I also know it's generally not considered a good idea, maybe the worst, to let a browser run and interact with local apps, even in a intranet context.
We use citrix for home-office, and p... | 0 | [
2,
254,
2932,
26,
52,
4252,
14,
16495,
3394,
375,
3767,
800,
3726,
3726,
31,
143,
48,
530,
44,
21,
90,
8,
20128,
106,
15,
47,
2247,
1302,
27,
9,
31,
67,
143,
32,
22,
18,
1469,
52,
724,
21,
254,
882,
15,
913,
14,
4126,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are there any examples where we *need* protected inheritance in C++
===
While I've seen rare cases where *private* inheritance was needed, I've never encountered a case where *protected* inheritance is needed. Does someone have an example? | 0 | [
2,
50,
80,
186,
3770,
113,
95,
1637,
556,
69,
2483,
3803,
13852,
19,
272,
20512,
800,
3726,
3726,
133,
31,
22,
195,
541,
2890,
1871,
113,
1637,
20181,
2483,
13852,
23,
851,
15,
31,
22,
195,
243,
8208,
21,
610,
113,
1637,
16265,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0... |
Upload a file to SharePoint through the built-in web services
===
What is the best way to upload a file to a Document Library on a SharePoint server through the built-in web services that version WSS 3.0 exposes? | 0 | [
2,
71,
8294,
21,
3893,
20,
1891,
3132,
120,
14,
392,
8,
108,
2741,
687,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
71,
8294,
21,
3893,
20,
21,
4492,
1248,
27,
21,
1891,
3132,
8128,
120,
14,
392,
8,
108,
2741,
687,
30,
615,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0... |
using a html entity in xslt (e.g. )
===
what is the best way to include a htlm entity in XSLT?
<xsl:template match="/a/node">
<xsl:value-of select="."/>
<xsl:text> </xsl:text>
</xsl:template>
this one returns a **XsltParseError** | 0 | [
2,
568,
21,
13,
15895,
9252,
19,
993,
18,
255,
38,
13,
5,
62,
9,
263,
9,
13,
6,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
468,
21,
13,
9020,
10363,
9252,
19,
993,
18,
255,
38,
60,
13,
1,
396,
18,
255,
45,
9577,
6554,
73... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WSACancelBlockingCall exception
===
Ok, I have a strange exception thrown from my code that's been bothering me for ages.
This is the code:
TcpListener serverSocket= new TcpListener(new IPEndPoint(bindAddress, port));
serverSocket.Start();
(...)
socket = serverSocket.AcceptTcpClient(); ... | 0 | [
2,
619,
14974,
2416,
255,
12048,
68,
9200,
5391,
800,
3726,
3726,
5854,
15,
31,
57,
21,
2578,
5391,
6027,
37,
51,
1797,
30,
22,
18,
74,
18968,
55,
26,
5520,
9,
48,
25,
14,
1797,
45,
13,
38,
7439,
13891,
106,
17595,
5668,
1198,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a simple, elegant way to define Singletons in Python?
===
There seem to be many ways to define Singletons in python. I was wondering if there is a consensus opinion on StackOverflow. | 0 | [
2,
25,
80,
21,
1935,
15,
11614,
161,
20,
9267,
345,
444,
18,
19,
20059,
60,
800,
3726,
3726,
80,
2260,
20,
44,
151,
2847,
20,
9267,
345,
444,
18,
19,
20059,
9,
31,
23,
5712,
100,
80,
25,
21,
11205,
4052,
27,
7566,
2549,
9990,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
(Why) should I use obfuscation?
===
It seems to me obfuscation is an idea that falls somewhere in the "security by obscurity" or "false sense of protection" camp. To protect intellectual property, there's copyright; to prevent security issues from being found, there's *fixing those issues*. In short, I regard it as a ... | 0 | [
2,
13,
5,
2256,
6,
378,
31,
275,
5122,
13735,
16893,
60,
800,
3726,
3726,
32,
2206,
20,
55,
5122,
13735,
16893,
25,
40,
882,
30,
2564,
3493,
19,
14,
13,
7,
17749,
34,
13,
24193,
856,
7,
54,
13,
7,
13192,
870,
1259,
16,
2057,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does Visual Studio Server Explorer support custom database providers?
===
I had used Server Explorer and related tools for graphical database development with Microsoft SQL Server in some of my learning projects - and it was a great experience. However, in my work I deal with Oracle DB and SQLite and my hobby projects... | 0 | [
2,
630,
3458,
1120,
8128,
8520,
555,
5816,
6018,
13488,
60,
800,
3726,
3726,
31,
41,
147,
8128,
8520,
17,
1597,
4672,
26,
21755,
6018,
522,
29,
7099,
4444,
255,
8128,
19,
109,
16,
51,
2477,
2314,
13,
8,
17,
32,
23,
21,
374,
1496... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to efficiently archive older parts of a big (multi-GB) SQL Server database?
===
Right now I am working on a solution to archive older data from a big working database to a separate archive database with the same schema. I move the data using SQL scripts and SQL Server Management Objects (SMO) from a .Net executabl... | 0 | [
2,
184,
20,
20519,
9250,
1234,
1341,
16,
21,
580,
13,
5,
21531,
8,
11400,
6,
4444,
255,
8128,
6018,
60,
800,
3726,
3726,
193,
130,
31,
589,
638,
27,
21,
4295,
20,
9250,
1234,
1054,
37,
21,
580,
638,
6018,
20,
21,
1725,
9250,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
a more generic visitor pattern
===
I'm sorry if my question is so long and technical but I think it's so important other people will be interested about it
I was looking for a way to separate clearly some softwares internals from their representation in c++
I have a generic parameter class (to be later stored in... | 0 | [
2,
21,
91,
12733,
10875,
3732,
800,
3726,
3726,
31,
22,
79,
1875,
100,
51,
1301,
25,
86,
175,
17,
2447,
47,
31,
277,
32,
22,
18,
86,
681,
89,
148,
129,
44,
3158,
88,
32,
31,
23,
699,
26,
21,
161,
20,
1725,
2885,
109,
2306,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to make the process of debugging an APS.NET application less time consuming?
===
I'm comparing it Java where you can start your application server in debug mode, then attach your IDE to the server. And you can change your code "on the fly" without restarting the serer. As long as your changes don't affect any meth... | 0 | [
2,
184,
20,
233,
14,
953,
16,
121,
16254,
2762,
40,
21,
1919,
9,
2328,
3010,
787,
85,
13,
17601,
60,
800,
3726,
3726,
31,
22,
79,
15047,
32,
8247,
113,
42,
92,
799,
154,
3010,
8128,
19,
121,
16254,
3740,
15,
94,
19514,
154,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Sending e-mail from a Custom SQL Server Reporting Services Delivery Extension
===
I've developed my own delivery extension for Reporting Services 2005, to integrate this with our SaaS marketing solution.
It takes the subscription, and takes a snapshot of the report with a custom set of parameters. It then rend... | 0 | [
2,
4907,
13,
62,
8,
8079,
37,
21,
5816,
4444,
255,
8128,
6670,
687,
6010,
3896,
800,
3726,
3726,
31,
22,
195,
885,
51,
258,
6010,
3896,
26,
6670,
687,
812,
15,
20,
18399,
48,
29,
318,
18194,
18,
4743,
4295,
9,
32,
1384,
14,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the simplest way to decremement a date in Javascript by 1 day?
===
I need to decrement a Javascript date by 1 day, so that it rolls back across months/years correctly. That is, if I have a date of 'Today', I want to get the date for 'Yesterday'.
It always seems to take more code than necessary when I do thi... | 0 | [
2,
98,
22,
18,
14,
24384,
161,
20,
6661,
99,
79,
9632,
21,
1231,
19,
8247,
8741,
34,
137,
208,
60,
800,
3726,
3726,
31,
376,
20,
6661,
99,
1130,
21,
8247,
8741,
1231,
34,
137,
208,
15,
86,
30,
32,
10081,
97,
464,
818,
118,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP.NET AJAX: Firing an UpdatePanel after the page load is complete
===
I'm sure this is easy but I can't figure it out:
I have an ASP.NET page with some UpdatePanels on it. I want the page to *completely* load with some 'Please wait' text in the UpdatePanels. Then once the page is *completely loaded* I want to c... | 0 | [
2,
28,
306,
9,
2328,
20624,
45,
7139,
40,
11100,
3206,
532,
75,
14,
2478,
6305,
25,
1279,
800,
3726,
3726,
31,
22,
79,
562,
48,
25,
2010,
47,
31,
92,
22,
38,
1465,
32,
70,
45,
31,
57,
40,
28,
306,
9,
2328,
2478,
29,
109,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Looking for a good book to learn SQL
===
I'm looking for a good and short book to learn SQL in general, and good modern SQL practices.
Any suggestions? Thanks! | 0 | [
2,
699,
26,
21,
254,
360,
20,
2484,
4444,
255,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
254,
17,
502,
360,
20,
2484,
4444,
255,
19,
297,
15,
17,
254,
773,
4444,
255,
5242,
9,
186,
18389,
60,
3669,
187,
3,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
C# - SQLClient - Simplest INSERT
===
Before someone gets in a tizzy because this was answered elsewhere (not sure if it was,but...), the 5 "related questions" shown right now do not match what I'm looking for, and I searched the string "sql insert" and did not find quite what I was looking for.
So I'm basically try... | 0 | [
2,
272,
5910,
13,
8,
4444,
6109,
18513,
38,
13,
8,
24384,
14692,
800,
3726,
3726,
115,
737,
3049,
19,
21,
13,
38,
12607,
185,
48,
23,
3094,
6040,
13,
5,
1270,
562,
100,
32,
23,
15,
811,
9,
9,
9,
6,
15,
14,
331,
13,
7,
6203... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Resettable Java Timer
===
I'd like to have a java.utils.Timer with a resettable time in java. E.g. the timer should be able to do something like:
Timer timer = new Timer();
timer.schedule(timerTask, 5000); //Timer starts in 5000 ms
//At some point between 0 and 5000 ms...
setNewTime(t... | 0 | [
2,
23422,
5924,
8247,
85,
139,
800,
3726,
3726,
31,
22,
43,
101,
20,
57,
21,
8247,
9,
14255,
18,
9,
891,
139,
29,
21,
23422,
5924,
85,
19,
8247,
9,
13,
62,
9,
263,
9,
14,
85,
139,
378,
44,
777,
20,
107,
301,
101,
45,
85,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tool for commandline "bookmarks" on windows?
===
Im searching a tool which allows me to specify some folders as "bookmarks" and than access them on the commandline (on Windows XP) via a keyword. Something like:
C:\> go home
D:\profiles\user\home\> go svn-project1
D:\projects\project1\svn\branch\src\>
... | 0 | [
2,
5607,
26,
1202,
1143,
13,
7,
5199,
4527,
18,
7,
27,
1936,
60,
800,
3726,
3726,
797,
5792,
21,
5607,
56,
2965,
55,
20,
19077,
109,
19294,
18,
28,
13,
7,
5199,
4527,
18,
7,
17,
119,
1381,
105,
27,
14,
1202,
1143,
13,
5,
218... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
RegexOptions.IgnoreCase
===
[Source][1]
> RegexOptions.IgnoreCase is more expensive than I would have thought (eg, should be barely measurable)
Assuming that this applies to PHP, Python, Perl, Ruby etc as well as C# (which is what I assume Jeff was using), how much of a slowdown is it and will I incur a similar ... | 0 | [
2,
7953,
1706,
25458,
4710,
9,
23565,
99,
10325,
800,
3726,
3726,
636,
12097,
500,
2558,
165,
500,
13,
1,
7953,
1706,
25458,
4710,
9,
23565,
99,
10325,
25,
91,
5381,
119,
31,
83,
57,
289,
13,
5,
5431,
15,
378,
44,
2886,
29613,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is soapUI the best web services testing tool/client/framework?
===
I have been working on a web services related project for about the last year. Our team found [soapUI][1] near the start of our project and we have been satisfied with it (the free version, that is).
My question is: are there other tools/clients/fr... | 0 | [
2,
25,
6447,
5661,
14,
246,
2741,
687,
4431,
5607,
118,
150,
18513,
38,
118,
8361,
3783,
60,
800,
3726,
3726,
31,
57,
74,
638,
27,
21,
2741,
687,
1597,
669,
26,
88,
14,
236,
159,
9,
318,
173,
216,
636,
656,
2552,
5661,
500,
25... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
NAnt and dual platform build - best way to build on Windows AND Mono/Linux
===
I'm new to NAnt but have some experience with Ant and CruiseControl.
What I want to do is have my SVN project include all tools needed (like NUnit and Mocks etc) so I can check out onto a fresh machine and build. This strategy is outline... | 0 | [
2,
13,
11028,
17,
5747,
2452,
1895,
13,
8,
246,
161,
20,
1895,
27,
1936,
17,
4129,
118,
1226,
7147,
800,
3726,
3726,
31,
22,
79,
78,
20,
13,
11028,
47,
57,
109,
1496,
29,
40,
38,
17,
6581,
12898,
9,
98,
31,
259,
20,
107,
25,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In C#, isn't the observer pattern already implemented using Events?
===
After reading the Head First Design Patterns book and using a number of other design patterns, I'm trying to understand the Observer pattern. Isn't this already implemented using Events in the .NET Framework? | 0 | [
2,
19,
272,
5910,
15,
2532,
22,
38,
14,
9855,
3732,
614,
6807,
568,
963,
60,
800,
3726,
3726,
75,
1876,
14,
157,
64,
704,
6282,
360,
17,
568,
21,
234,
16,
89,
704,
6282,
15,
31,
22,
79,
749,
20,
1369,
14,
9855,
3732,
9,
2532... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0... |
How to remove debug statements from production code in Java
===
Is it possible for the compiler to remove statements used for debugging purposes (such as logging) from production code? The debug statements would need to be marked somehow, maybe using annotations.
It's easy to set a property (debug = true) and check... | 0 | [
2,
184,
20,
4681,
121,
16254,
9015,
37,
637,
1797,
19,
8247,
800,
3726,
3726,
25,
32,
938,
26,
14,
21486,
20,
4681,
9015,
147,
26,
121,
16254,
2762,
4612,
13,
5,
4289,
28,
13,
13919,
6,
37,
637,
1797,
60,
14,
121,
16254,
9015,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I render a tree structure (recursive) using a django template?
===
I have a tree structure in memory that I would like to render in HTML using a Django template.
class Node():
name = "node name"
children = []
There will be some object `root` that is a `Node`, and `children` is a list o... | 0 | [
2,
184,
92,
31,
16535,
21,
1541,
1411,
13,
5,
99,
24244,
6,
568,
21,
3857,
14541,
22894,
60,
800,
3726,
3726,
31,
57,
21,
1541,
1411,
19,
1912,
30,
31,
83,
101,
20,
16535,
19,
13,
15895,
568,
21,
3857,
14541,
22894,
9,
718,
15... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I extract the inner exception from a soap exception in ASP.NET?
===
I have a simple web service operation like this one:
[WebMethod]
public string HelloWorld()
{
throw new Exception("HelloWorldException");
return "Hello World";
}
And then I have... | 0 | [
2,
184,
107,
31,
10962,
14,
3754,
5391,
37,
21,
6447,
5391,
19,
28,
306,
9,
2328,
60,
800,
3726,
3726,
31,
57,
21,
1935,
2741,
365,
1453,
101,
48,
53,
45,
636,
14113,
5909,
1807,
43,
500,
317,
3724,
10975,
4423,
5,
6,
13,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get number of occurrences in a SQL IN clause
===
Let say i have four tables PAGE, USER, TAG and PAGE-TAG
PAGE has fields ID, CONTENT ...
TAG has fields ID, NAME ...
USER has fields ID, NAME ...
PAGE-TAG has fields ID, PAGE-ID, TAG-ID, USER-ID
Let say i have four pages
PAGE#1 'Content page 1' ... | 0 | [
2,
184,
20,
164,
234,
16,
12933,
18,
19,
21,
4444,
255,
19,
9040,
800,
3726,
3726,
408,
395,
31,
57,
222,
7484,
2478,
15,
4155,
15,
3383,
17,
2478,
8,
8628,
2478,
63,
2861,
4924,
15,
2331,
13,
9,
9,
9,
3383,
63,
2861,
4924,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What all are the tools/languages for windows shell scripting?
===
I want to know what are the options to do some scripting jobs in windows platform.
I need functionality like file manipulations, registry editing etc. Can files be edited using scripting tools?
What other functionality does windows scripting tools off... | 0 | [
2,
98,
65,
50,
14,
4672,
118,
7020,
18,
26,
1936,
3593,
3884,
68,
60,
800,
3726,
3726,
31,
259,
20,
143,
98,
50,
14,
6368,
20,
107,
109,
3884,
68,
4844,
19,
1936,
2452,
9,
31,
376,
18548,
101,
3893,
17561,
18,
15,
18269,
9510,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the simplest SQL Query to find the second largest value?
===
What is the simplest SQL query to find the second largest integer value in a specific column? Of course there may be duplicate values in the column. | 0 | [
2,
98,
25,
14,
24384,
4444,
255,
25597,
20,
477,
14,
153,
1075,
1923,
60,
800,
3726,
3726,
98,
25,
14,
24384,
4444,
255,
25597,
20,
477,
14,
153,
1075,
13820,
1923,
19,
21,
1903,
4698,
60,
16,
674,
80,
123,
44,
19429,
4070,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
how do you programatically invoke a listview label edit
===
in C# I'd like to invoke the label edit of a newly added item to a ListView.
basically, if I have a *click here to add* scenario, as soon as the new item is added, I want the text label to be in a user editable state.
Thanks! | 0 | [
2,
184,
107,
42,
625,
721,
8438,
28371,
21,
968,
4725,
1899,
9392,
800,
3726,
3726,
19,
272,
5910,
31,
22,
43,
101,
20,
28371,
14,
1899,
9392,
16,
21,
2771,
905,
9101,
20,
21,
968,
4725,
9,
11374,
15,
100,
31,
57,
21,
1637,
15... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
procmail lockfile utility and NFS
===
G'day,
Has anyone used the lockfile utility that ships with procmail in conjunction with NFS mounted directories?
The lockfile man page states that "Lockfile is NFS-resistant and eight-bit clean."
cheers,
Rob | 0 | [
2,
13,
15617,
8079,
3991,
16877,
10082,
17,
13,
11408,
18,
800,
3726,
3726,
489,
22,
1185,
15,
63,
1276,
147,
14,
3991,
16877,
10082,
30,
2034,
29,
13,
15617,
8079,
19,
9558,
29,
13,
11408,
18,
4897,
559,
1596,
60,
14,
3991,
16877... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I introduce code reviews to my group/company?
===
My group is made up of very competent programmers. I work for the company's research team, which is pretty selective in hiring. Having said that, we all tend to work on different projects, so it is very easy to cut corners because no one is watching. I know ... | 2 | [
2,
184,
92,
31,
8500,
1797,
2783,
20,
51,
214,
118,
28359,
60,
800,
3726,
3726,
51,
214,
25,
117,
71,
16,
253,
19895,
17968,
18,
9,
31,
170,
26,
14,
237,
22,
18,
527,
173,
15,
56,
25,
1772,
14092,
19,
16867,
9,
452,
87,
30,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why can't SQL Server run on a Novell server?
===
I'm not sure whether I'm asking the question correctly, but I've been told SQL Server cannot run on a Novell server. Is this true? If yes, why not? | 0 | [
2,
483,
92,
22,
38,
4444,
255,
8128,
485,
27,
21,
1211,
255,
8128,
60,
800,
3726,
3726,
31,
22,
79,
52,
562,
1472,
31,
22,
79,
3379,
14,
1301,
12044,
15,
47,
31,
22,
195,
74,
470,
4444,
255,
8128,
1967,
485,
27,
21,
1211,
25... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... |
Is this a reasonable way to handle getters/setters in a PHP class?
===
I'm going to try something with the format of this question and I'm very open to suggestions about a better way to handle it.
I didn't want to just dump a bunch of code in the question so I've posted the code for the class on refactormycode.
... | 0 | [
2,
25,
48,
21,
9954,
161,
20,
3053,
164,
6052,
118,
18,
22323,
18,
19,
21,
13,
26120,
718,
60,
800,
3726,
3726,
31,
22,
79,
228,
20,
1131,
301,
29,
14,
2595,
16,
48,
1301,
17,
31,
22,
79,
253,
368,
20,
18389,
88,
21,
574,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does anyone have a good Proper Case algorithm
===
Does anyone have a trusted Proper Case or PCase algorithm (similar to a UCase or Upper)? I'm looking for something that takes a value such as "GEORGE BURDELL" or "george burdell" and turns it into "George Burdell".
I have a simple one that handles the simple cases.... | 0 | [
2,
630,
1276,
57,
21,
254,
4119,
610,
9083,
800,
3726,
3726,
630,
1276,
57,
21,
9968,
4119,
610,
54,
351,
10325,
9083,
13,
5,
19107,
20,
21,
287,
10325,
54,
1508,
6,
60,
31,
22,
79,
699,
26,
301,
30,
1384,
21,
1923,
145,
28,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way to export html to Word without having MS Word installed?
===
Is there a way to export a simple html page to word (.doc format, not .docx) without having MSWord installed? | 0 | [
2,
246,
161,
20,
7487,
13,
15895,
20,
833,
366,
452,
4235,
833,
4066,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
7487,
21,
1935,
13,
15895,
2478,
20,
833,
13,
5,
9,
13799,
2595,
15,
52,
13,
9,
13799,
396,
6,
366,
452,
4235,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
C++ cast syntax styles
===
A question related to [Regular cast vs. static_cast vs. dynamic_cast][1]:
What cast syntax style do you prefer in C++?
- C-style cast syntax: `(int)foo`
- C++-style cast syntax: `static_cast<int>(foo)`
- constructor syntax: `int(foo)`
They may not translate to exactly the sa... | 0 | [
2,
272,
20512,
1325,
22649,
6443,
800,
3726,
3726,
21,
1301,
1597,
20,
636,
25049,
1325,
4611,
9,
12038,
1,
6146,
4611,
9,
7782,
1,
6146,
500,
2558,
165,
500,
45,
98,
1325,
22649,
1034,
107,
42,
6369,
19,
272,
20512,
60,
13,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Disable asp.net radiobutton with javascript
===
I'm trying to disable a bunch of controls with javascript (so that they postback values). All the controls work fine except for my radio buttons as they loose their value. In the below code which is called via a recursive function to disable all child controls the Second... | 0 | [
2,
1460,
579,
28,
306,
9,
2328,
603,
811,
444,
29,
8247,
8741,
800,
3726,
3726,
31,
22,
79,
749,
20,
1460,
579,
21,
7653,
16,
8671,
29,
8247,
8741,
13,
5,
656,
30,
59,
678,
1958,
4070,
6,
9,
65,
14,
8671,
170,
1123,
1613,
26... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Installing a .NET service using InstallUtil
===
I'm trying to install a .NET service I wrote. As recommended by MSDN, I'm using InstallUtil. But I have missed how I can set the default service user on the command-line or even in the service itself. Now, when InstallUtil is run, it will display a dialog asking the u... | 0 | [
2,
25429,
21,
13,
9,
2328,
365,
568,
16146,
14255,
800,
3726,
3726,
31,
22,
79,
749,
20,
16146,
21,
13,
9,
2328,
365,
31,
738,
9,
28,
5773,
34,
4235,
43,
103,
15,
31,
22,
79,
568,
16146,
14255,
9,
47,
31,
57,
3238,
184,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
any site with a good resume of Java related APIs and technologies?
===
Hello today in the [java Sun page][1] there is an [article][2] about JAXB technology wich helps on create XML schemas and create java objects instances from/to xml documents.
This tech could help me if have known it before. The same happens to m... | 0 | [
2,
186,
689,
29,
21,
254,
13113,
16,
8247,
1597,
21,
8954,
17,
5740,
60,
800,
3726,
3726,
10975,
786,
19,
14,
636,
1004,
1385,
939,
2478,
500,
2558,
165,
500,
80,
25,
40,
636,
20360,
500,
2558,
135,
500,
88,
11712,
220,
1099,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Data model for a extensible web form
===
Suppose that I have a form that contains three 10 fields: field1..field10. I store the form data in one or more database tables, probably using 10 database columns.
Now suppose a few months later that I want to add 3 more fields. And in the future I may add/delete field... | 0 | [
2,
1054,
1061,
26,
21,
1396,
8710,
3426,
2741,
505,
800,
3726,
3726,
5787,
30,
31,
57,
21,
505,
30,
1588,
132,
332,
2861,
45,
575,
165,
9,
9,
1109,
1036,
9,
31,
1718,
14,
505,
1054,
19,
53,
54,
91,
6018,
7484,
15,
910,
568,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When do you stop testing?
===
What measure(s) do you use to know when it's time to stop testing an application and move it to production? | 0 | [
2,
76,
107,
42,
747,
4431,
60,
800,
3726,
3726,
98,
4058,
5,
18,
6,
107,
42,
275,
20,
143,
76,
32,
22,
18,
85,
20,
747,
4431,
40,
3010,
17,
780,
32,
20,
637,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Tracking down where disk space has gone on Linux?
===
When administering Linux systems I often find myself struggling to track down the culprit after a partition goes full. I normally use
du / | sort -nr
but on a large filesystem this takes a long time before any results are returned. Also, this is usually succe... | 0 | [
2,
10353,
125,
113,
8582,
726,
63,
1042,
27,
13024,
60,
800,
3726,
3726,
76,
14839,
68,
13024,
1242,
31,
478,
477,
992,
7587,
20,
792,
125,
14,
27686,
75,
21,
10711,
1852,
503,
9,
31,
4147,
275,
1052,
13,
118,
13,
1,
2058,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Adaptive Database
===
Are there any rapid Database protoyping tools that don't require me to declare a database schema, but rather create it based on the way I'm using my entities.
For example, assuming an empty database (pseudo code):
user1 = new User() // Creates the user table with a single id column
... | 0 | [
2,
22142,
6018,
800,
3726,
3726,
50,
80,
186,
4470,
6018,
9347,
93,
3181,
4672,
30,
221,
22,
38,
4077,
55,
20,
10123,
21,
6018,
23874,
15,
47,
864,
1600,
32,
432,
27,
14,
161,
31,
22,
79,
568,
51,
12549,
9,
26,
823,
15,
11704,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Algorithm to format text to Pascal or camel casing
===
[Using this question][1] as the base is there an alogrithm or coding example to change some text to Pascal or Camel casing.
For example:
mynameisfred
becomes
Camel: myNameIsFred
Pascal: MyNameIsFred
[1]: http://stackoverflow.com/quest... | 0 | [
2,
9083,
20,
2595,
1854,
20,
18661,
54,
15386,
7167,
68,
800,
3726,
3726,
636,
12655,
48,
1301,
500,
2558,
165,
500,
28,
14,
1000,
25,
80,
40,
21,
5567,
8352,
7015,
54,
13,
15458,
823,
20,
753,
109,
1854,
20,
18661,
54,
15386,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can PNG image transparency be preserved when using PHP's GDlib imagecopyresampled?
===
The following PHP code snippet uses GD to resize a browser-uploaded PNG to 128x128. It works great, except that the transparent areas in the original image are being replaced with a solid color- black in my case.
What's the best... | 0 | [
2,
92,
351,
2723,
1961,
19668,
44,
6190,
76,
568,
13,
26120,
22,
18,
489,
43,
8326,
1961,
19625,
99,
18,
10158,
1294,
60,
800,
3726,
3726,
14,
249,
13,
26120,
1797,
13,
29061,
2027,
489,
43,
20,
302,
10454,
21,
16495,
8,
576,
22... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
how to get the googlebot to get the correct GEOIPed content!?
===
OK. This problem is doing my head in. And I dont know if there even IS a definitive answer.
We have a website, lets call it finalcog.com. It's a UK-based site, with UK based content. Google knows about it, and we have done a load of SEO on it. All is... | 0 | [
2,
184,
20,
164,
14,
8144,
6813,
20,
164,
14,
4456,
6389,
49,
3631,
2331,
187,
60,
800,
3726,
3726,
5854,
9,
48,
1448,
25,
845,
51,
157,
19,
9,
17,
31,
1049,
143,
100,
80,
166,
25,
21,
15676,
1623,
9,
95,
57,
21,
2271,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Sending Email in C#.NET Through Gmail
===
Instead of relying on my host to send email, I was thinking of sending the messages though my gmail account. The emails are personalized emails to the bands I play on my show. Has anyone had success doing this? | 0 | [
2,
4907,
8517,
19,
272,
5910,
9,
2328,
120,
489,
8079,
800,
3726,
3726,
700,
16,
21760,
27,
51,
2015,
20,
2660,
8517,
15,
31,
23,
1440,
16,
4907,
14,
7561,
362,
51,
489,
8079,
2176,
9,
14,
8517,
18,
50,
1319,
1333,
8517,
18,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0... |
Passing null to a method
===
I am in the middle of reading the excellent [Clean Code](http://www.amazon.com/Clean-Code-Handbook-Software-Craftsmanship/dp/0132350882)
One discussion is regarding passing nulls into a method.
public class MetricsCalculator {
public double xProjection(Point p1, Point p2... | 4 | [
2,
2848,
16203,
20,
21,
2109,
800,
3726,
3726,
31,
589,
19,
14,
772,
16,
1876,
14,
5977,
636,
20254,
1797,
500,
5,
21127,
6903,
6483,
9,
3812,
6931,
9,
960,
118,
20254,
8,
9375,
8,
3203,
5199,
8,
12980,
5011,
8,
7856,
18,
17969,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Regex Testing Tools
===
I know of [The Regulator][1] for testing regular expressions. And there's also [RegExr][2] for testing regular expressions as well. Does anyone know of other regex testing tools? Do any of these tools allow you to specify which RE engine you're testing against?
[1]: http://sourceforge... | 4 | [
2,
7953,
1706,
4431,
4672,
800,
3726,
3726,
31,
143,
16,
636,
124,
17235,
500,
2558,
165,
500,
26,
4431,
1290,
13832,
9,
17,
80,
22,
18,
67,
636,
12463,
1706,
139,
500,
2558,
135,
500,
26,
4431,
1290,
13832,
28,
134,
9,
630,
127... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is Web 3.0?
===
My boss asked me this yesterday just to gauge my response. Apparently, some of our clients are asking for "Web 3.0"
I told him I really didn't know.
He said when he's asked around the consensus is that it's microformats, etc. Frankly no one really knew either. (probably get a varied respon... | 0 | [
2,
98,
25,
2741,
203,
9,
387,
60,
800,
3726,
3726,
51,
4054,
411,
55,
48,
7124,
114,
20,
7313,
51,
1627,
9,
3083,
15,
109,
16,
318,
7421,
50,
3379,
26,
13,
7,
14113,
203,
9,
387,
7,
31,
470,
61,
31,
510,
223,
22,
38,
143,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why don't the std::fstream classes take a std::string?
===
This isn't a design question, really, though it may seem like it. (Well, okay, it's kind of a design question). What I'm wondering is why the C++ `std::fstream` classes don't take a `std::string` in their constructor or open methods. Everyone loves code exampl... | 0 | [
2,
483,
221,
22,
38,
14,
354,
43,
45,
45,
410,
11260,
2684,
247,
21,
354,
43,
45,
45,
11130,
60,
800,
3726,
3726,
48,
2532,
22,
38,
21,
704,
1301,
15,
510,
15,
362,
32,
123,
2260,
101,
32,
9,
13,
5,
854,
15,
1705,
15,
32,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I program defensively in Ruby?
===
One thing that concerns me as a security professional is that Ruby doesn't have a parallel of Java's package-privacy. That is, this isn't valid Ruby:
public module Foo
public module Bar
# factory method for new Bar implementations
def self.new... | 0 | [
2,
184,
92,
31,
625,
4222,
102,
19,
10811,
60,
800,
3726,
3726,
53,
584,
30,
4823,
55,
28,
21,
1221,
736,
25,
30,
10811,
1437,
22,
38,
57,
21,
3821,
16,
8247,
22,
18,
6030,
8,
6944,
9961,
93,
9,
30,
25,
15,
48,
2532,
22,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are there similar tools to Code Detective for Other languages/IDEs?
===
Just saw this linked on YCombinator news and the idea heavily appeals to me, and seems like it would be useful for many languages, not just c#, but haven't seen anything similar elsewhere. For reference:
http://www.codeplex.com/CloneDetectiveV... | 0 | [
2,
50,
80,
835,
4672,
20,
1797,
4485,
26,
89,
2556,
118,
8153,
60,
800,
3726,
3726,
114,
441,
48,
4727,
27,
13,
93,
10204,
108,
3457,
996,
17,
14,
882,
2991,
9143,
20,
55,
15,
17,
2206,
101,
32,
83,
44,
4811,
26,
151,
2556,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I list all Entries with a certain tag in Wordpress?
===
I may just be missing this functionality, but does anyone know if there is a widget available:
I need to list the subject for all the entries that are associated with a given tag.
For example: I have 5 articles tagged with "Tutorial", I'd like to see... | 0 | [
2,
184,
107,
31,
968,
65,
11399,
29,
21,
1200,
3383,
19,
833,
5890,
60,
800,
3726,
3726,
31,
123,
114,
44,
2863,
48,
18548,
15,
47,
630,
1276,
143,
100,
80,
25,
21,
4807,
43,
3060,
904,
45,
31,
376,
20,
968,
14,
1550,
26,
65... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
1:1 Foreign Key Constraints
===
How do you specify that a foreign key constraint should be a 1:1 relationship in transact sql? Is declaring the column UNIQUE enough? Below is my existing code. Thanks in advance for the help!
CREATE TABLE [dbo].MyTable(
[MyTablekey] INT IDENTITY(1,1) NOT FOR REPLICATION... | 0 | [
2,
6352,
165,
1228,
1246,
16747,
800,
3726,
3726,
184,
107,
42,
19077,
30,
21,
1228,
1246,
28804,
378,
44,
21,
6352,
165,
1429,
19,
2982,
5183,
4444,
255,
60,
25,
15594,
14,
4698,
2619,
511,
60,
1021,
25,
51,
3149,
1797,
9,
3669,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Assert action redirected to correct action/route?
===
How do I exercise an action to ensure it redirects to the correct action or route? | 0 | [
2,
10908,
1028,
302,
14147,
20,
4456,
1028,
118,
20179,
60,
800,
3726,
3726,
184,
107,
31,
5935,
40,
1028,
20,
4062,
32,
302,
14706,
18,
20,
14,
4456,
1028,
54,
858,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What are the key considerations when creating a web crawler?
===
I just started thinking about creating/customizing a web crawler today, and know very little about web crawler/robot etiquette. A majority of the writings on etiquette I've found seem old and awkward, so I'd like to get some current (and practical) insi... | 0 | [
2,
98,
50,
14,
1246,
20478,
76,
2936,
21,
2741,
12392,
106,
60,
800,
3726,
3726,
31,
114,
373,
1440,
88,
2936,
118,
4636,
6015,
3335,
21,
2741,
12392,
106,
786,
15,
17,
143,
253,
265,
88,
2741,
12392,
106,
118,
661,
6813,
29940,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Disable browser 'Save Password' functionality
===
One of the joys of working for a government healthcare agency is having to deal with all of the paranoia around dealing with PHI (Protected Health Information). Don't get me wrong, I'm all for doing everything possible to protect people's personal information (health, ... | 0 | [
2,
1460,
579,
16495,
13,
22,
19863,
20884,
22,
18548,
800,
3726,
3726,
53,
16,
14,
4512,
18,
16,
638,
26,
21,
283,
9809,
2344,
25,
452,
20,
1183,
29,
65,
16,
14,
28602,
140,
5746,
29,
13424,
13,
5,
16265,
69,
853,
676,
6,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is a good open source B-tree implementation in C?
===
I am looking for a lean and well constructed open source implementation of a B-tree library written in C. It needs to be under a non-GPL license so that it can be used in a commercial application. Ideally, this library supports the B-tree index to be stored/ma... | 0 | [
2,
98,
25,
21,
254,
368,
1267,
334,
8,
8101,
6123,
19,
272,
60,
800,
3726,
3726,
31,
589,
699,
26,
21,
6349,
17,
134,
2096,
368,
1267,
6123,
16,
21,
334,
8,
8101,
1248,
642,
19,
272,
9,
32,
2274,
20,
44,
131,
21,
538,
8,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Test plans and how best to write them
===
We're trying to figure out the best way to write tests in our test plan. Specifically, when writing a test that is meant to be used by anyone including QA staff, should the steps in the test be very specific or more broad giving the tester more leeway in how the task can be a... | 0 | [
2,
1289,
1753,
17,
184,
246,
20,
2757,
105,
800,
3726,
3726,
95,
22,
99,
749,
20,
1465,
70,
14,
246,
161,
20,
2757,
4894,
19,
318,
1289,
944,
9,
3524,
15,
76,
1174,
21,
1289,
30,
25,
1380,
20,
44,
147,
34,
1276,
215,
7234,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Programmatically editing python source
===
This is something that I think would be very useful. Basically, I'd like there to be a way to edit python source programmatically without requiring human intervention. There are a couple of things I would like to do with this:
1) Edit the configuration of python apps th... | 0 | [
2,
625,
6732,
1326,
9510,
20059,
1267,
800,
3726,
3726,
48,
25,
301,
30,
31,
277,
83,
44,
253,
4811,
9,
11374,
15,
31,
22,
43,
101,
80,
20,
44,
21,
161,
20,
9392,
20059,
1267,
625,
6732,
1326,
366,
9052,
585,
6781,
9,
80,
50,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XAML - Accessing static fields
===
How does one go about referencing a class's static properties in xaml? In other words, I want to do something like this:
C#
Class BaseThingy {
public static readonly Style BaseStyle;
...
}
XAML
<ResoureDictionary ...>
<Style BasedOn="Bas... | 0 | [
2,
13,
6791,
8184,
13,
8,
1381,
68,
12038,
2861,
800,
3726,
3726,
184,
630,
53,
162,
88,
13,
29254,
21,
718,
22,
18,
12038,
3704,
19,
13,
6791,
8184,
60,
19,
89,
715,
15,
31,
259,
20,
107,
301,
101,
48,
45,
272,
5910,
718,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Popularity algorithm
===
On SO 18 Joel mentioned an algorithm that would rank items based on their age and popularity and it's based on gravity. Could someone post this? C# would be lovely, but really any language (well, I can't do LISP) would be fine. | 0 | [
2,
5178,
9083,
800,
3726,
3726,
27,
86,
474,
8873,
2211,
40,
9083,
30,
83,
2839,
3755,
432,
27,
66,
348,
17,
5178,
17,
32,
22,
18,
432,
27,
8849,
9,
110,
737,
678,
48,
60,
272,
5910,
83,
44,
8601,
15,
47,
510,
186,
816,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0... |
Validate a UK phone number
===
How do I validate a UK phone number in C# using a regex? | 0 | [
2,
7394,
1373,
21,
1063,
1132,
234,
800,
3726,
3726,
184,
107,
31,
7394,
1373,
21,
1063,
1132,
234,
19,
272,
5910,
568,
21,
7953,
1706,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Can I run a Python script as a service (in Windows)? How?
===
I am sketching the architecture for a set of programs that share various interrelated objects stored in a database. I want one of the programs to act as a service which provides a higher level interface for operations on these objects, and the other program... | 0 | [
2,
92,
31,
485,
21,
20059,
3884,
28,
21,
365,
13,
5,
108,
1936,
6,
60,
184,
60,
800,
3726,
3726,
31,
589,
8998,
68,
14,
2607,
26,
21,
309,
16,
1726,
30,
1891,
617,
1480,
6203,
3916,
8214,
19,
21,
6018,
9,
31,
259,
53,
16,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best way of cleaning up after a SQL Injection?
===
I've been tasked with the the maintenance of a nonprofit website that recently fell victim to a SQL injection attack. Someone exploited a form on the site to add text to every available text-like field in the database (varchar, nvarchar, etc.) which, when r... | 0 | [
2,
98,
22,
18,
14,
246,
161,
16,
9724,
71,
75,
21,
4444,
255,
13646,
60,
800,
3726,
3726,
31,
22,
195,
74,
14605,
29,
14,
14,
5010,
16,
21,
14948,
2271,
30,
1989,
1139,
5508,
20,
21,
4444,
255,
13646,
991,
9,
737,
21632,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Force JavaScript file refresh on client
===
We are currently working in a private Beta and so are still in the process of making fairly rapid changes, although obviously as usage is starting to ramp up, we will be slowing down this process. That being said, one issue we are running into is that after we push out an u... | 0 | [
2,
558,
8247,
8741,
3893,
24905,
27,
6819,
800,
3726,
3726,
95,
50,
871,
638,
19,
21,
932,
8434,
17,
86,
50,
174,
19,
14,
953,
16,
544,
6647,
4470,
1693,
15,
419,
4409,
28,
7514,
25,
1422,
20,
9960,
71,
15,
95,
129,
44,
21745,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I resolve a System.Security.SecurityException with custom code in SSRS?
===
I've created an assembly and referenced it in my Reporting Services report. I've tested the report locally (works), and I then uploaded the report to a report server (doesn't work).
Here is the error that is thrown by the custom code... | 0 | [
2,
184,
107,
31,
9854,
21,
329,
9,
17749,
9,
17749,
10066,
872,
29,
5816,
1797,
19,
22118,
18,
60,
800,
3726,
3726,
31,
22,
195,
679,
40,
1475,
17,
17571,
32,
19,
51,
6670,
687,
1330,
9,
31,
22,
195,
7631,
14,
1330,
6680,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Linq select * with multiple tables
===
This query works great:
var pageObject = (from op in db.ObjectPermissions
join pg in db.Pages on op.ObjectPermissionName equals page.PageName
where pg.PageID == page.PageID
select op).SingleOrDefault();
... | 0 | [
2,
6294,
1251,
5407,
1637,
29,
1886,
7484,
800,
3726,
3726,
48,
25597,
693,
374,
45,
4033,
2478,
23793,
800,
13,
5,
2665,
3088,
19,
13,
9007,
9,
23793,
1432,
12385,
18,
1865,
13,
9623,
19,
13,
9007,
9,
6486,
18,
27,
3088,
9,
237... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which 4.x version of gcc should one use?
===
The product-group I work for is currently using gcc 3.4.6 (we know it is ancient) for a large low-level c-code base, and want to upgrade to a later version. We have seen performance benefits testing different versions of gcc 4.x on all hardware platforms we tested it on. We... | 0 | [
2,
56,
268,
9,
396,
615,
16,
489,
3384,
378,
53,
275,
60,
800,
3726,
3726,
14,
2374,
8,
8024,
31,
170,
26,
25,
871,
568,
489,
3384,
203,
9,
300,
9,
379,
13,
5,
458,
143,
32,
25,
1593,
6,
26,
21,
370,
708,
8,
3906,
272,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Helpful snippits?
===
I'm a relatively new coder, and I'm looking to increase my snippits library. What are some of your most used snippits? I'm mainly looking for ones that I might not have thought about until I've had more experience, but will make me more productive.
Have a snippit that is particularly clever? P... | 4 | [
2,
15600,
8912,
19128,
7363,
60,
800,
3726,
3726,
31,
22,
79,
21,
3109,
78,
1797,
139,
15,
17,
31,
22,
79,
699,
20,
1839,
51,
8912,
19128,
7363,
1248,
9,
98,
50,
109,
16,
154,
127,
147,
8912,
19128,
7363,
60,
31,
22,
79,
2011,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Random data in Unit Tests?
===
I have a coworker who writes unit tests for objects which fill their fields with random data. His reason is that it gives a wider range of testing, since it will test a lot of different values, whereas a normal test only uses a single static value.
I've given him a number of different... | 0 | [
2,
5477,
1054,
19,
1237,
4894,
60,
800,
3726,
3726,
31,
57,
21,
326,
22560,
72,
6215,
1237,
4894,
26,
3916,
56,
3509,
66,
2861,
29,
5477,
1054,
9,
33,
1215,
25,
30,
32,
2352,
21,
6350,
978,
16,
4431,
15,
179,
32,
129,
1289,
21... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Get the DefaultView DataRowView from a DataRow
===
Here's the situation: I need to bind a WPF FixedPage against a DataRow. Bindings don't work against DataRows; they work against DataRowViews. I need to do this in the most generic way possible, as I know nothing about and have no control over what is in the DataRow... | 0 | [
2,
164,
14,
12838,
4725,
1054,
5417,
4725,
37,
21,
1054,
5417,
800,
3726,
3726,
235,
22,
18,
14,
1858,
45,
31,
376,
20,
10193,
21,
619,
7721,
3535,
6486,
149,
21,
1054,
5417,
9,
8728,
18,
221,
22,
38,
170,
149,
1054,
5417,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Pulling limited tagged photos from Flickr
===
So I've got a hobby site I'm working on. I've got items that are tagged and I want to associate those items with photos from Flickr. Even with restrictive searches I might get results numbering in the thousands.
Requirements:
1. I want to display between 10-20
... | 0 | [
2,
3303,
1317,
27945,
7064,
37,
12407,
139,
800,
3726,
3726,
86,
31,
22,
195,
330,
21,
18229,
689,
31,
22,
79,
638,
27,
9,
31,
22,
195,
330,
3755,
30,
50,
27945,
17,
31,
259,
20,
4169,
273,
3755,
29,
7064,
37,
12407,
139,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Google using non-alphanumeric characters
===
So let's say I have an issue with some code and I want to use google to help find a solution. So I paste a code snippet into the search bar. Google will ignore any special characters like operators (especially the '.' operator), returning results that aren't as relevant a... | 0 | [
2,
8144,
568,
538,
8,
22480,
6336,
14744,
1766,
800,
3726,
3726,
86,
408,
22,
18,
395,
31,
57,
40,
1513,
29,
109,
1797,
17,
31,
259,
20,
275,
8144,
20,
448,
477,
21,
4295,
9,
86,
31,
640,
62,
21,
1797,
13,
29061,
77,
14,
212... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Advice on how to be graphically creative
===
I've always felt that my graphic design skills have lacked, but I do have a desire to improve them. Even though I'm not the worlds worst artist, it's discouraging to see the results from a professional designer, who can do an amazing mockup from a simple spec in just a few... | 0 | [
2,
4978,
27,
184,
20,
44,
21755,
102,
4231,
800,
3726,
3726,
31,
22,
195,
550,
427,
30,
51,
8479,
704,
3207,
57,
11444,
15,
47,
31,
107,
57,
21,
3150,
20,
3545,
105,
9,
166,
362,
31,
22,
79,
52,
14,
126,
18,
4126,
1169,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Visual Studio identical token highlighting
===
I coded a Mancala game in Java for a college class this past spring, and I used the [Eclipse][1] IDE to write it. One of the great (and fairly simple) visual aids in Eclipse is if you select a particular token, say a declared variable, then the IDE will automatically hig... | 0 | [
2,
3458,
1120,
6323,
20,
2853,
23102,
800,
3726,
3726,
31,
13,
22254,
21,
169,
3430,
58,
250,
19,
8247,
26,
21,
314,
718,
48,
640,
1573,
15,
17,
31,
147,
14,
636,
3319,
6013,
870,
500,
2558,
165,
500,
13,
3448,
20,
2757,
32,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XML Validation report parser
===
Most XML parsers will give up after the first error in a document. In fact, IIRC, that's actually part of the 'official' spec for parsers.
I'm looking for something that will break that rule. It should take a given schema (assuming a valid schema) and an xml input and attempt to... | 0 | [
2,
23504,
27999,
1330,
2017,
4104,
800,
3726,
3726,
127,
23504,
2017,
18,
445,
129,
590,
71,
75,
14,
64,
7019,
19,
21,
4492,
9,
19,
837,
15,
595,
5453,
15,
30,
22,
18,
1121,
141,
16,
14,
13,
22,
16168,
22,
12737,
26,
2017,
18,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Write files to App_Data under medium trust hack?
===
Is there any way to work around this?
Im sure I've heard about some hack, is that true? | 0 | [
2,
2757,
6488,
20,
4865,
1,
18768,
131,
4152,
1527,
11835,
60,
800,
3726,
3726,
25,
80,
186,
161,
20,
170,
140,
48,
60,
797,
562,
31,
22,
195,
752,
88,
109,
11835,
15,
25,
30,
1151,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Getting Started with Ruby Development
===
What are some good online tutorials/quick starts/screencasts to get up to speed on Ruby development? I recently read Brad Wilson's Ruby article in the Sep/Oct 2008 issue of CoDe magazine and would like to continue down the Ruby/IronRuby path.
(My background is mainly C# and... | 4 | [
2,
1017,
373,
29,
10811,
522,
800,
3726,
3726,
98,
50,
109,
254,
2087,
29724,
18,
118,
25865,
3244,
118,
7187,
6146,
18,
20,
164,
71,
20,
1362,
27,
10811,
522,
60,
31,
1989,
1302,
5413,
2571,
22,
18,
10811,
2002,
19,
14,
10332,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
List in JScrollPane painting outside the viewport
===
I have a list, each item of which has several things in it, including a JProgressBar which can be updating a lot. Each time one of the items updates its JProgressBar, the ListDataListener on the list tries to scroll it the visible range using
/*
*... | 0 | [
2,
968,
19,
487,
3862,
8694,
16660,
2469,
719,
14,
1418,
1993,
800,
3726,
3726,
31,
57,
21,
968,
15,
206,
9101,
16,
56,
63,
238,
564,
19,
32,
15,
215,
21,
487,
2740,
13026,
1850,
56,
92,
44,
71,
43,
1880,
21,
865,
9,
206,
85... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I restrict JFileChooser to a directory?
===
I want to limit my users to a directory and its sub directories but the "Parent Directory" button allows them to browse to an arbitraty directory.
How should I go about doing that? | 0 | [
2,
184,
107,
31,
15436,
487,
16877,
2613,
759,
106,
20,
21,
16755,
60,
800,
3726,
3726,
31,
259,
20,
4496,
51,
3878,
20,
21,
16755,
17,
82,
972,
559,
1596,
47,
14,
13,
7,
18908,
16755,
7,
5167,
2965,
105,
20,
10175,
62,
20,
40... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0... |
How do you write code that is both 32 bit and 64 bit compatible ?
===
What considerations do I need to make if I want my code to run correctly on both 32bit and 64bit platforms ? | 0 | [
2,
184,
107,
42,
2757,
1797,
30,
25,
156,
2512,
1142,
17,
4384,
1142,
14961,
13,
60,
800,
3726,
3726,
98,
20478,
107,
31,
376,
20,
233,
100,
31,
259,
51,
1797,
20,
485,
12044,
27,
156,
2512,
3326,
17,
4384,
3326,
6843,
13,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Alternative "architectural" approaches to javaScript client code?
===
I've been working on a side project for some time now, and the further I get, the more my webpage has turned into a full-featured application. Right now, I'm sticking with <a href="http://jquery.com">jQuery</a>, however, the logic on the page is g... | 0 | [
2,
2676,
13,
7,
27452,
10018,
7,
7501,
20,
8247,
8741,
6819,
1797,
60,
800,
3726,
3726,
31,
22,
195,
74,
638,
27,
21,
270,
669,
26,
109,
85,
130,
15,
17,
14,
653,
31,
164,
15,
14,
91,
51,
2741,
6486,
63,
412,
77,
21,
503,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can you clone a WPF object?
===
Anybody have a good example how to deep clone a WPF object, presering databindings? | 0 | [
2,
184,
92,
42,
13871,
21,
619,
7721,
3095,
60,
800,
3726,
3726,
11181,
57,
21,
254,
823,
184,
20,
855,
13871,
21,
619,
7721,
3095,
15,
782,
18,
7882,
1054,
22260,
18,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.