unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
PHP Object as XML Document
===
What is the best way to take a given PHP object and serialize it as XML? I am looking at simple_xml and I have used it to parse XML into objects, but it isn't clear to me how it works the other way around. | 0 | [
2,
13,
26120,
3095,
28,
23504,
4492,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
247,
21,
504,
13,
26120,
3095,
17,
5956,
2952,
32,
28,
23504,
60,
31,
589,
699,
35,
1935,
1,
396,
8184,
17,
31,
57,
147,
32,
20,
2017,
870,
23504,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 programmatically determine if I have write priveledges using C# in .Net?
===
How can I determine if I have write permission on a remote machine in my intranet using C# in .Net? | 0 | [
2,
184,
92,
31,
625,
6732,
1326,
3746,
100,
31,
57,
2757,
4566,
6532,
8840,
18,
568,
272,
5910,
19,
13,
9,
2328,
60,
800,
3726,
3726,
184,
92,
31,
3746,
100,
31,
57,
2757,
5572,
27,
21,
5388,
1940,
19,
51,
14369,
2328,
568,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do you get assembler output from C/C++ source in gcc?
===
How does one do this?
If I want to analyze how something is getting compiled, how would I get the emitted assembly code? | 0 | [
2,
184,
107,
42,
164,
13,
13736,
139,
5196,
37,
272,
118,
150,
20512,
1267,
19,
489,
3384,
60,
800,
3726,
3726,
184,
630,
53,
107,
48,
60,
100,
31,
259,
20,
16051,
184,
301,
25,
1017,
9316,
15,
184,
83,
31,
164,
14,
25675,
147... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
What's the best way to read and parse a large text file over the network?
===
I have a problem which requires me to parse several log files from a remote machine.
There are a few complications:
1) The file may be in use
2) The files can be quite large (100mb+)
3) Each entry may be multi-line
To solve the in-use... | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
1302,
17,
2017,
870,
21,
370,
1854,
3893,
84,
14,
982,
60,
800,
3726,
3726,
31,
57,
21,
1448,
56,
4781,
55,
20,
2017,
870,
238,
6738,
6488,
37,
21,
5388,
1940,
9,
80,
50,
21,
310,
14030,
45,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 emacs re-indent a big blob of HTML for me?
===
When editing HTML in emacs, is there a way to automatically pretty-format a blob of markup, changing something like this:
<table>
<tr>
<td>blah</td></tr></table>
...into this?
<table>
<tr>
<td>
blah
</td>
... | 0 | [
2,
92,
13,
62,
6893,
18,
302,
8,
108,
817,
38,
21,
580,
334,
10904,
16,
13,
15895,
26,
55,
60,
800,
3726,
3726,
76,
9510,
13,
15895,
19,
13,
62,
6893,
18,
15,
25,
80,
21,
161,
20,
7499,
1772,
8,
23588,
21,
334,
10904,
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... |
How do I tell if I can re-use a 'free' software library in a commercial app?
===
Whats the easiest way, of telling if I can redistribute it in a piece of commercial software?
In license agreements I often read the terms GPL, OpenSource, Freeware, Artistic License but have never got a definitive answer on what the d... | 2 | [
2,
184,
107,
31,
494,
100,
31,
92,
302,
8,
3699,
21,
13,
22,
4639,
22,
2306,
1248,
19,
21,
1439,
4865,
60,
800,
3726,
3726,
98,
18,
14,
27237,
161,
15,
16,
2497,
100,
31,
92,
402,
403,
14755,
32,
19,
21,
1855,
16,
1439,
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 validate ASPNET AJAX installation
===
How can I validate that my ASPNET AJAX installation is correct.
I have Visual Studio 2008 and had never previously installed any AJAX version.
My UpdatePanel is nto working within IIS6, although it works ok within Visual Studio's web server. The behaviour I get is as ... | 0 | [
2,
184,
20,
7394,
1373,
28,
306,
2328,
20624,
7758,
800,
3726,
3726,
184,
92,
31,
7394,
1373,
30,
51,
28,
306,
2328,
20624,
7758,
25,
4456,
9,
31,
57,
3458,
1120,
570,
17,
41,
243,
1343,
4066,
186,
20624,
615,
9,
51,
11100,
3206... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Too many "pattern suffixes" - design smell?
===
I just found myself creating a class called "InstructionBuilderFactoryMapFactory". That's 4 "pattern suffixes" on one class. It immediately reminded me of this:
[http://www.jroller.com/landers/entry/the_design_pattern_facade_pattern][1]
Is this a design smell? Sh... | 0 | [
2,
266,
151,
13,
7,
5972,
8766,
15447,
160,
7,
13,
8,
704,
3408,
60,
800,
3726,
3726,
31,
114,
216,
992,
2936,
21,
718,
227,
13,
7,
108,
10346,
872,
20904,
17455,
93,
15022,
17455,
93,
7,
9,
30,
22,
18,
268,
13,
7,
5972,
876... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Don't have exclusive access to database and so cannot save changes
===
I'm working on a MS Access database. I've made some changes to one of the modules. I want to go out for lunch, but when I try closing the database, I get the following message:
"You do not have exclusive access to the database. Your design ch... | 0 | [
2,
221,
22,
38,
57,
6753,
1381,
20,
6018,
17,
86,
1967,
2079,
1693,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
4235,
1381,
6018,
9,
31,
22,
195,
117,
109,
1693,
20,
53,
16,
14,
17113,
9,
31,
259,
20,
162,
70,
26,
4311,
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... |
Boost::signal memory access error
===
I'm trying to use boost::signal to implement a callback mechanism, and I'm getting a memory access assert in the boost::signal code on even the most trivial usage of the library. I have simplified it down to this code:
#include <boost/signal.hpp>
typedef boost::signa... | 0 | [
2,
10419,
45,
45,
11255,
192,
1912,
1381,
7019,
800,
3726,
3726,
31,
22,
79,
749,
20,
275,
10419,
45,
45,
11255,
192,
20,
8713,
21,
645,
1958,
6534,
15,
17,
31,
22,
79,
1017,
21,
1912,
1381,
10908,
19,
14,
10419,
45,
45,
11255,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Converting days since epoch to milliseconds since epoch
===
At my new workplace, they represent a lot of dates as "days since epoch" (which I will hereafter call DSE). I'm running into issues in JavaScript converting from DSE to milliseconds since epoch (UNIX timestamps). Here's my function to do the conversion:
... | 0 | [
2,
19583,
509,
179,
24612,
20,
13436,
5007,
18,
179,
24612,
800,
3726,
3726,
35,
51,
78,
16932,
15,
59,
3501,
21,
865,
16,
4076,
28,
13,
7,
1185,
18,
179,
24612,
7,
13,
5,
2140,
31,
129,
235,
5162,
645,
13,
43,
870,
6,
9,
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... |
Alternatives to using delays when automatically testing a web UI
===
I will soon be working on AJAX driven web pages that have a lot of content generated from a Web Service (WCF).
I've tested this sort of thing in the past (and found it easy) but not with this level of dynamic content.
I'm developing in .NET 3.5... | 0 | [
2,
2676,
18,
20,
568,
16730,
76,
7499,
4431,
21,
2741,
13,
5661,
800,
3726,
3726,
31,
129,
651,
44,
638,
27,
20624,
5355,
2741,
4434,
30,
57,
21,
865,
16,
2331,
6756,
37,
21,
2741,
365,
13,
5,
499,
8940,
6,
9,
31,
22,
195,
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... |
What's the different between the open source licences
===
I read all the licenses, and frankly I am kindda baffled by the many choices available. I know some relex the limitation of the license so that open source stuff can be used in commercial application.
But other than that why is there so many licenses out the... | 0 | [
2,
98,
22,
18,
14,
421,
128,
14,
368,
1267,
10899,
18,
800,
3726,
3726,
31,
1302,
65,
14,
3962,
18,
15,
17,
22662,
31,
589,
825,
593,
29027,
34,
14,
151,
10978,
904,
9,
31,
143,
109,
302,
20718,
14,
24943,
16,
14,
3962,
86,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 visual merge tool for Git?
===
Title says it. What's the best tool for viewing and editing a merge in Git? I'd like to get a 3-way merge view, with "mine", "theirs" and "output" in separate panels.
Also, instructions for invoking said tool would be great. (I still haven't figure out how to start kdi... | 4 | [
2,
98,
22,
18,
14,
246,
3458,
12666,
5607,
26,
13,
10404,
60,
800,
3726,
3726,
581,
898,
32,
9,
98,
22,
18,
14,
246,
5607,
26,
11244,
17,
9510,
21,
12666,
19,
13,
10404,
60,
31,
22,
43,
101,
20,
164,
21,
203,
8,
1443,
12666,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 Round in MS Access, VBA
===
Whats the best way to round in VBA Access?
My current method utilizes the Excel method
Excel.WorksheetFunction.Round(...
But I am looking for a means that does not rely on Excel.
| 0 | [
2,
184,
20,
560,
19,
4235,
1381,
15,
566,
969,
800,
3726,
3726,
98,
18,
14,
246,
161,
20,
560,
19,
566,
969,
1381,
60,
51,
866,
2109,
13151,
18,
14,
20700,
2109,
20700,
9,
3783,
17627,
22359,
9,
5000,
5,
9,
9,
9,
47,
31,
589... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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,
0,
0,
0,
0,
0... |
Is there a way to add a Subversion section to the right click menu for TextMate ?
===
I'd like to be able to click on a file to revert it, or check in a directory, etc. It would be much more convenient to have these available from the right click menu. | 0 | [
2,
25,
80,
21,
161,
20,
3547,
21,
972,
10898,
1050,
20,
14,
193,
10840,
11379,
26,
1854,
5281,
13,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
44,
777,
20,
10840,
27,
21,
3893,
20,
24156,
32,
15,
54,
2631,
19,
21,
16755,
15,
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... |
Is there something like ZenTest/Autotest for Java and JUnit
===
I've used ZenTest and autotest to work on Ruby projects before, and I used to using them for test-driven development a la [this configuration][1]. I have a project that I'm currently working on in Java, and I was wondering if there is something similar in... | 0 | [
2,
25,
80,
301,
101,
10526,
10543,
118,
18042,
10543,
26,
8247,
17,
7446,
242,
800,
3726,
3726,
31,
22,
195,
147,
10526,
10543,
17,
3108,
10543,
20,
170,
27,
10811,
2314,
115,
15,
17,
31,
147,
20,
568,
105,
26,
1289,
8,
14489,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
finding apache build options
===
I need to rebuild an apache server, but the original source is no longer available. Is there any way ( command line switch to httpd? ) to get the build options which were originally used? | 0 | [
2,
3007,
17140,
1895,
6368,
800,
3726,
3726,
31,
376,
20,
16128,
40,
17140,
8128,
15,
47,
14,
501,
1267,
25,
90,
1045,
904,
9,
25,
80,
186,
161,
13,
5,
1202,
293,
5521,
20,
7775,
43,
60,
13,
6,
20,
164,
14,
1895,
6368,
56,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Lauch windows regedit with ceartain path located
===
How to lauch windows regedit with ceartain path located, like "HKEY_CURRENT_USER\Software\Microsoft\VisualStudio\8.0", so I don't have to do the clicking. What's the command line argument to do this? Or Any place to find the explanation of regedit switches? | 0 | [
2,
333,
6396,
1936,
7953,
69,
242,
29,
4000,
512,
5851,
2013,
335,
800,
3726,
3726,
184,
20,
333,
6396,
1936,
7953,
69,
242,
29,
4000,
512,
5851,
2013,
335,
15,
101,
13,
7,
252,
4237,
1,
17657,
1,
16704,
1,
12980,
5011,
1,
22019... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 solve performance problem with Java SecureRandom?
===
If you want a cryptographically strong random number in Java, you use SecureRandom. Unfortunately, SecureRandom can be very slow. If it uses /dev/random on Linux, it can block waiting for sufficient entropy to build up. How do you avoid the peformance penalt... | 0 | [
2,
184,
20,
8402,
956,
1448,
29,
8247,
4315,
2195,
5555,
60,
800,
3726,
3726,
100,
42,
259,
21,
16277,
12084,
1326,
966,
5477,
234,
19,
8247,
15,
42,
275,
4315,
2195,
5555,
9,
6200,
15,
4315,
2195,
5555,
92,
44,
253,
2276,
9,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Where can I find an AutoComplete TextBox code sample for Silverlight?
===
I've searched around for a while today, but I haven't been able to come up with an AutoComplete TextBox code sample for Silverlight 2 Beta 2. The most promising reference was found on [nikhilk.net][1] but the online demo doesn't currently rende... | 0 | [
2,
113,
92,
31,
477,
40,
3108,
15990,
1854,
5309,
1797,
5717,
26,
1172,
3130,
60,
800,
3726,
3726,
31,
22,
195,
9036,
140,
26,
21,
133,
786,
15,
47,
31,
2933,
22,
38,
74,
777,
20,
340,
71,
29,
40,
3108,
15990,
1854,
5309,
1797... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 you optimize tables for specific queries?
===
1. what are the manners you use to determine the frequent queries?
2. how do you select the optimization factors?
2. what are the types of changes one can make? | 0 | [
2,
184,
107,
42,
22864,
7484,
26,
1903,
9386,
2829,
60,
800,
3726,
3726,
137,
9,
98,
50,
14,
18122,
42,
275,
20,
3746,
14,
5408,
9386,
2829,
60,
172,
9,
184,
107,
42,
5407,
14,
21597,
4776,
60,
172,
9,
98,
50,
14,
2551,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
List all types declared by module in Ruby
===
How can I list all the types that are declared by a module in Ruby? | 0 | [
2,
968,
65,
2551,
2482,
34,
12613,
19,
10811,
800,
3726,
3726,
184,
92,
31,
968,
65,
14,
2551,
30,
50,
2482,
34,
21,
12613,
19,
10811,
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,
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... |
MSBuild doesn't pick up references of the referenced project
===
I bumped into a strange situation with MSBuild just now. There's a solution which has three projects: LibX, LibY and Exe. Exe references LibX. LibX in its turn references LibY, has some content files, and also references to a third-party library (several... | 0 | [
2,
4235,
29361,
1437,
22,
38,
2036,
71,
7231,
16,
14,
17571,
669,
800,
3726,
3726,
31,
22315,
77,
21,
2578,
1858,
29,
4235,
29361,
114,
130,
9,
80,
22,
18,
21,
4295,
56,
63,
132,
2314,
45,
13,
8326,
396,
15,
2093,
779,
17,
139... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Lazy Registration on the Web: Best Practices
===
I first encountered the concept of [lazy registration][1] the [Ajax Patterns][2] site, where they define it as accumulating "bits of information about the user as they interact, with formal registration occurring later on." I'm looking at doing something similar for my ... | 0 | [
2,
16792,
8587,
27,
14,
2741,
45,
246,
5242,
800,
3726,
3726,
31,
64,
8208,
14,
2420,
16,
636,
531,
3327,
8587,
500,
2558,
165,
500,
14,
636,
6881,
7522,
6282,
500,
2558,
135,
500,
689,
15,
113,
59,
9267,
32,
28,
7602,
723,
1003... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Code run by Hudson can't find executable on the command line
===
I'm setting up my first job in Hudson, and I'm running into some problems. The job monitors two repositories, one containing our DB setup files, the other a bit of code that validates and tests the DB setup files.
Part of the code that runs will throw... | 0 | [
2,
1797,
485,
34,
6195,
92,
22,
38,
477,
1396,
17194,
5924,
27,
14,
1202,
293,
800,
3726,
3726,
31,
22,
79,
2697,
71,
51,
64,
1205,
19,
6195,
15,
17,
31,
22,
79,
946,
77,
109,
1716,
9,
14,
1205,
18521,
81,
302,
14882,
262,
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... |
Is it possible to impersonate a user without loggin him on?
===
Is it possible to impersonate a user without supplying user name/password? Basically, I'd like to get the `CSIDL_LOCAL_APPDATA` for a user (not the current one) using the `ShGetFolderPath()` function. All I currently have is a SID for that user.
Thanks... | 0 | [
2,
25,
32,
938,
20,
797,
7276,
1373,
21,
4155,
366,
6738,
5831,
61,
27,
60,
800,
3726,
3726,
25,
32,
938,
20,
797,
7276,
1373,
21,
4155,
366,
20679,
4155,
204,
118,
6201,
9587,
60,
11374,
15,
31,
22,
43,
101,
20,
164,
14,
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... |
How can I determine if a remote drive has enough space to write a file using C#?
===
How can I determine if a remote drive has enough space for me to upload a given file using C# in .Net? | 0 | [
2,
184,
92,
31,
3746,
100,
21,
5388,
1493,
63,
511,
726,
20,
2757,
21,
3893,
568,
272,
5910,
60,
800,
3726,
3726,
184,
92,
31,
3746,
100,
21,
5388,
1493,
63,
511,
726,
26,
55,
20,
71,
8294,
21,
504,
3893,
568,
272,
5910,
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,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
std::map iteration - order differences between Debug and Release builds
===
Here's a common code pattern I have to work with:
class foo {
public:
void InitMap();
void InvokeMethodsInMap();
void abcMethod();
void defMethod();
private:
typedef std::map<const ... | 0 | [
2,
354,
43,
45,
45,
15022,
23534,
13,
8,
389,
4921,
128,
121,
16254,
17,
830,
1895,
18,
800,
3726,
3726,
235,
22,
18,
21,
757,
1797,
3732,
31,
57,
20,
170,
29,
45,
718,
4310,
111,
13,
1,
317,
45,
11364,
19,
242,
15022,
5,
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... |
Dangers of making a method virtual
===
I've been doing some mocking with RhinoMocks and it requires that mocked methods be made virtual. This is fine except we have a custom framework which contains the methods that I want to mock which are currently not marked as virtual.
I can't forsee any problem with making the... | 0 | [
2,
3589,
18,
16,
544,
21,
2109,
6599,
800,
3726,
3726,
31,
22,
195,
74,
845,
109,
18446,
29,
18642,
79,
5668,
18,
17,
32,
4781,
30,
25900,
3195,
44,
117,
6599,
9,
48,
25,
1123,
1613,
95,
57,
21,
5816,
6596,
56,
1588,
14,
3195,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Running Apache Archiva standalone in Gentoo?
===
I have a server running Gentoo 2.6.12 r6 and I want to run Apache Archiva as a standalone server at startup. Does anyone have a working init.d script to accomplish this? Thanks! | 0 | [
2,
946,
17140,
13,
25328,
58,
26986,
19,
4380,
8175,
60,
800,
3726,
3726,
31,
57,
21,
8128,
946,
4380,
8175,
172,
9,
379,
9,
918,
761,
379,
17,
31,
259,
20,
485,
17140,
13,
25328,
58,
28,
21,
26986,
8128,
35,
20205,
9,
630,
12... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 can avoid the Diamond of Death in C++ if I use multiple inheritance?
===
http://en.wikipedia.org/wiki/Diamond_problem
I know what it means, but what steps can I take to avoid it? | 0 | [
2,
184,
92,
2658,
14,
5313,
16,
372,
19,
272,
20512,
100,
31,
275,
1886,
13852,
60,
800,
3726,
3726,
7775,
6903,
219,
9,
17375,
26132,
9,
5583,
118,
17375,
118,
4286,
4660,
1,
2740,
2854,
79,
31,
143,
98,
32,
1108,
15,
47,
98,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
What is the best tool to inspect the state and size of a user's session state in a ASP.Net 2.0 application.
===
We'd like to inspect the state of a user's session state and predefined points during the flow of a legacy web application. We'd like to see which objects are currently present and what the total size is. | 0 | [
2,
98,
25,
14,
246,
5607,
20,
19,
7350,
14,
146,
17,
1072,
16,
21,
4155,
22,
18,
3723,
146,
19,
21,
28,
306,
9,
2328,
172,
9,
387,
3010,
9,
800,
3726,
3726,
95,
22,
43,
101,
20,
19,
7350,
14,
146,
16,
21,
4155,
22,
18,
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... |
Truncate stdin line length?
===
I've been parsing through some log files and I've found that some of the lines are too long to display on one line so Terminal.app kindly wraps them onto the next line. However, I've been looking for a way to truncate a line after a certain number of characters so that Terminal doesn't ... | 0 | [
2,
22328,
62,
354,
3653,
293,
1476,
60,
800,
3726,
3726,
31,
22,
195,
74,
2017,
18,
68,
120,
109,
6738,
6488,
17,
31,
22,
195,
216,
30,
109,
16,
14,
1560,
50,
266,
175,
20,
3042,
27,
53,
293,
86,
3855,
9,
7753,
22215,
8118,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Three table related model in CakePHP
===
I've got a CAkePHP 1.2 site. I've got three related Models/tables:
A Comment has exactly one Touch, a Touch has exactly one Touchtype.
In each model, I have a belongs to, so I have
Comments belongs to Touch, Touch belongs to Touchtype.
I'm trying to get a list of commen... | 0 | [
2,
132,
859,
1597,
1061,
19,
8390,
26120,
800,
3726,
3726,
31,
22,
195,
330,
21,
8390,
26120,
137,
9,
135,
689,
9,
31,
22,
195,
330,
132,
1597,
2761,
118,
5924,
18,
45,
21,
6484,
63,
1890,
53,
1723,
15,
21,
1723,
63,
1890,
53,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 embed a swf into an html page?
===
need I say more? | 0 | [
2,
246,
161,
20,
11911,
69,
21,
13,
18,
15263,
77,
40,
13,
15895,
2478,
60,
800,
3726,
3726,
376,
31,
395,
91,
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,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Php: preventing using the incorrect type (ie type safety)?
===
Php, as we all know is very loosely typed. The language does not require you to specify any kind of type for function parameters or class variables. This can be a powerful feature. Sometimes though, it can make debugging your script a painful experience. F... | 0 | [
2,
13,
26120,
45,
11520,
568,
14,
18867,
1001,
13,
5,
660,
1001,
2108,
6,
60,
800,
3726,
3726,
13,
26120,
15,
28,
95,
65,
143,
25,
253,
13166,
1001,
43,
9,
14,
816,
630,
52,
4077,
42,
20,
19077,
186,
825,
16,
1001,
26,
1990,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Could a truly random number be generated using pings to psuedo-randomly selected IP addresses?
===
The question posed came about during a 2nd Year Comp Science lecture while discussing the impossibility of generating numbers in a deterministic computational device.
This was the only suggestion which didn't depend o... | 0 | [
2,
110,
21,
4574,
5477,
234,
44,
6756,
568,
13,
3181,
18,
20,
8613,
4185,
537,
8,
2195,
5555,
102,
1704,
15735,
12636,
60,
800,
3726,
3726,
14,
1301,
15760,
281,
88,
112,
21,
172,
706,
159,
6479,
762,
8143,
133,
10988,
14,
5420,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Should the base case be Open Source?
===
I hatched as a software developer in a proprietary world dominated by large corporations with closed source software - it wasn't questioned. As my career grew, the Internet became more and more of a presence and I was exposed to more and more open source software.
Looking b... | 0 | [
2,
378,
14,
1000,
610,
44,
368,
1267,
60,
800,
3726,
3726,
31,
6882,
69,
28,
21,
2306,
10058,
19,
21,
18856,
126,
6562,
34,
370,
13548,
29,
827,
1267,
2306,
13,
8,
32,
526,
22,
38,
8673,
9,
28,
51,
545,
1642,
15,
14,
2620,
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... |
Excel CSV - Number cell format
===
I produce a report as an CSV file.
When I try to open the file in Excel, it makes an assumption about the data type based on the contents of the cell, and reformats it accordingly.
For example, if the CSV file contains
...,005,...
Then Excel shows it as 5.
Is there a w... | 0 | [
2,
20700,
272,
18,
710,
13,
8,
234,
1667,
2595,
800,
3726,
3726,
31,
2213,
21,
1330,
28,
40,
272,
18,
710,
3893,
9,
76,
31,
1131,
20,
368,
14,
3893,
19,
20700,
15,
32,
1364,
40,
12027,
88,
14,
1054,
1001,
432,
27,
14,
8478,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 any way in .NET to programmatically listen to HTTP traffic?
===
I'm using browser automation for testing web sites but I need to verify HTTP requests from the browser (i.e., images, external scripts, XmlHttpRequest objects). Is there a way to programmatically instantiate a proxy for the browser to use in orde... | 0 | [
2,
25,
80,
186,
161,
19,
13,
9,
2328,
20,
625,
6732,
1326,
3834,
20,
7775,
2227,
60,
800,
3726,
3726,
31,
22,
79,
568,
16495,
23217,
26,
4431,
2741,
3259,
47,
31,
376,
20,
21012,
7775,
12279,
37,
14,
16495,
13,
5,
49,
9,
62,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 should I do too keep a tiny Open Source project active and sustainable?
===
A couple of months ago I've coded a tiny tool that we needed at work for a specific task, and I've decided to share it on CodePlex. It's written in C# and honestly it's not big deal but since it's the first project I've ever built from sc... | 0 | [
2,
98,
378,
31,
107,
266,
643,
21,
3228,
368,
1267,
669,
1348,
17,
9206,
60,
800,
3726,
3726,
21,
1335,
16,
818,
1464,
31,
22,
195,
13,
22254,
21,
3228,
5607,
30,
95,
851,
35,
170,
26,
21,
1903,
3005,
15,
17,
31,
22,
195,
86... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Process to pass from problem to code
===
I'm teaching/helping a student to program in java.
I remember the following process always helped me when I started; I apply it to pascal, then to C and when I started as professional with Java. It looks pretty intuitive and I wonder if someone else have had a similar appro... | 0 | [
2,
953,
20,
1477,
37,
1448,
20,
1797,
800,
3726,
3726,
31,
22,
79,
2540,
118,
14593,
68,
21,
1209,
20,
625,
19,
8247,
9,
31,
1518,
14,
249,
953,
550,
1456,
55,
76,
31,
373,
73,
31,
5645,
32,
20,
18661,
15,
94,
20,
272,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
NLP: Building (small) corpora, or "Where to get lots of not-too-specialized English-language text files?"
===
Does anyone have a suggestion for where to find archives or collections of everyday English text for use in a small corpus? I have been using Gutenberg Project books for a working prototype, and would like to... | 0 | [
2,
13,
103,
5478,
45,
353,
13,
5,
15988,
6,
12995,
6055,
15,
54,
13,
7,
2798,
20,
164,
7503,
16,
52,
8,
8175,
8,
11118,
1333,
486,
8,
7020,
1854,
6488,
60,
7,
800,
3726,
3726,
630,
1276,
57,
21,
10910,
26,
113,
20,
477,
8111... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 obtain the size of a folder?
===
I'm converting an old app that records folder sizes on a daily basis. The legacy app uses the Scripting.FileSystemObject library:
Set fso = CreateObject("Scripting.FileSystemObject")
Set folderObject = fso.GetFolder(folder)
size = folderObject.Size
There is... | 0 | [
2,
184,
107,
31,
5545,
14,
1072,
16,
21,
19294,
60,
800,
3726,
3726,
31,
22,
79,
19583,
40,
315,
4865,
30,
742,
19294,
13403,
27,
21,
1954,
2239,
9,
14,
7780,
4865,
2027,
14,
3884,
68,
9,
16877,
10724,
23793,
1248,
45,
309,
398,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Conditional compile based on compiler version (c#)
===
I am maintaining .net 1.1 and .net 3.5 c# code at once. For this purpose I created two csproject files, one for .net 1.1 and another for .net 3.5.
Now, in my source code I am adding new features that are only available in .net 3.5 version, but I also want the c... | 0 | [
2,
21206,
26561,
432,
27,
21486,
615,
13,
5,
150,
5910,
6,
800,
3726,
3726,
31,
589,
8215,
13,
9,
2328,
137,
9,
165,
17,
13,
9,
2328,
203,
9,
264,
272,
5910,
1797,
35,
382,
9,
26,
48,
2131,
31,
679,
81,
272,
18,
21011,
6488,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Password composition algorithm
===
I'm sick of remembering all the passwords for different logins. Lately I found the interesting tool [password composer][1] which lets you generate passwords base on the **hostname** and a secret **master password**. But I don't want to use a website or installing software to generate... | 0 | [
2,
20884,
4046,
9083,
800,
3726,
3726,
31,
22,
79,
3352,
16,
11135,
65,
14,
20884,
18,
26,
421,
2205,
17040,
9,
10434,
31,
216,
14,
4883,
5607,
636,
6201,
9587,
3039,
500,
2558,
165,
500,
56,
6884,
42,
7920,
20884,
18,
1000,
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... |
SQL Null set to Zero for adding
===
I have an SQL query (MS Access) for which I need to add two columns, either of which may be null. For instance:
SELECT Column1, Column2, Column3+Column4 AS [Added Values]
FROM Table
where Column3 or Column4 may be null. In this case, I want null to be considered as ze... | 0 | [
2,
4444,
255,
16203,
309,
20,
4606,
26,
4721,
800,
3726,
3726,
31,
57,
40,
4444,
255,
25597,
13,
5,
79,
18,
1381,
6,
26,
56,
31,
376,
20,
3547,
81,
7498,
15,
694,
16,
56,
123,
44,
16203,
9,
26,
4851,
45,
5407,
4698,
165,
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... |
Unit Testing without Assertions
===
Occasionally I come accross a unit test that doesn't Assert anything. The particular example I came across this morning was testing that a log file got written to when a condition was met. The assumption was that if no error was thrown the test passed.
I personally don't have a p... | 0 | [
2,
1237,
4431,
366,
20878,
18,
800,
3726,
3726,
4533,
31,
340,
21,
150,
7703,
21,
1237,
1289,
30,
1437,
22,
38,
10908,
602,
9,
14,
1498,
823,
31,
281,
464,
48,
959,
23,
4431,
30,
21,
6738,
3893,
330,
642,
20,
76,
21,
2874,
23,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 difference between a worker thread and a io thread?
===
Looking at the processmodel element in the Web.Config there's two attributes.
maxWorkerThreads="25"
maxIoThreads="25"
What's the difference between worker threads and io threads? | 0 | [
2,
98,
22,
18,
14,
2841,
128,
21,
7444,
9322,
17,
21,
13,
1963,
9322,
60,
800,
3726,
3726,
699,
35,
14,
953,
13998,
4520,
19,
14,
2741,
9,
14093,
2816,
80,
22,
18,
81,
13422,
9,
2049,
22560,
96,
10647,
18,
3726,
7,
1811,
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... |
Is there any way in .NET to programmatically listen to HTTP traffic?
===
I'm using browser automation for testing web sites but I need to verify HTTP requests from the browser (i.e., images, external scripts, XmlHttpRequest objects). Is there a way to programmatically instantiate a proxy for the browser to use in orde... | 0 | [
2,
25,
80,
186,
161,
19,
13,
9,
2328,
20,
625,
6732,
1326,
3834,
20,
7775,
2227,
60,
800,
3726,
3726,
31,
22,
79,
568,
16495,
23217,
26,
4431,
2741,
3259,
47,
31,
376,
20,
21012,
7775,
12279,
37,
14,
16495,
13,
5,
49,
9,
62,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
client -side reporting vs server-side reporting
===
when do we use client- side reporting and when we use server- side reporting. Which reporting is best practice (client/server). SSRS reporting. | 0 | [
2,
6819,
13,
8,
1416,
6670,
4611,
8128,
8,
1416,
6670,
800,
3726,
3726,
76,
107,
95,
275,
6819,
8,
270,
6670,
17,
76,
95,
275,
8128,
8,
270,
6670,
9,
56,
6670,
25,
246,
1345,
13,
5,
150,
18513,
38,
118,
10321,
106,
6,
9,
221... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I automate using a web proxy in .NET for unit tests (including set up and tear down)?
===
Following Jonathan Holland's suggestion in his comment for my previous question, *[Is there any way in .NET to programmatically listen to HTTP traffic?][1]*, I've made a separate (but not exactly a duplicate) question for... | 0 | [
2,
184,
107,
31,
3108,
5281,
568,
21,
2741,
27188,
19,
13,
9,
2328,
26,
1237,
4894,
13,
5,
3970,
309,
71,
17,
5898,
125,
6,
60,
800,
3726,
3726,
249,
4473,
6834,
22,
18,
10910,
19,
33,
6484,
26,
51,
1158,
1301,
15,
1637,
2558,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 turn an image file of a game map into boundaries in my program?
===
I have an image of a basic game map. Think of it as just horizontal and vertical walls which can't be crossed. How can I go from a png image of the walls to something in code easily?
The hard way is pretty straight forward... it's just ... | 0 | [
2,
184,
92,
31,
805,
40,
1961,
3893,
16,
21,
250,
2942,
77,
6361,
19,
51,
625,
60,
800,
3726,
3726,
31,
57,
40,
1961,
16,
21,
2125,
250,
2942,
9,
277,
16,
32,
28,
114,
10095,
17,
7035,
2021,
56,
92,
22,
38,
44,
3081,
9,
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... |
Why are languages like c# so redundant?
===
Take the following snippet:
List<int> distances = new List<int>();
Why so much redundancy? Why so much verbosity?
I'm sure there's a legitimate reason I don't know about. I'm not just writing to complain about the language. Does this have something to do with the ... | 0 | [
2,
483,
50,
2556,
101,
272,
5910,
86,
24295,
60,
800,
3726,
3726,
247,
14,
249,
13,
29061,
45,
968,
1,
6391,
1,
15731,
800,
78,
968,
1,
6391,
1,
5,
6,
73,
483,
86,
212,
402,
8724,
10821,
60,
483,
86,
212,
9504,
759,
856,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CSS for hover that includes all child elements
===
I have a draggable div element with a hover style. This works fine, but the div contains some form elements (label, input). The problem is that when the mouse is over these child elements the hover is disabled.
<div class="app_setting">
<label">Name</lab... | 0 | [
2,
272,
18,
18,
26,
21350,
30,
1103,
65,
850,
2065,
800,
3726,
3726,
31,
57,
21,
5501,
263,
579,
13,
12916,
4520,
29,
21,
21350,
1034,
9,
48,
693,
1123,
15,
47,
14,
13,
12916,
1588,
109,
505,
2065,
13,
5,
21018,
15,
6367,
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... |
How do I change SQL Server 2005 to be case sensitive?
===
I hate case sensitivity in databases, but I'm developing for a client who uses it. How can I turn on this option on my SQL Server, so I can be sure I've gotten the case right in all my queries? | 0 | [
2,
184,
107,
31,
753,
4444,
255,
8128,
812,
20,
44,
610,
7830,
60,
800,
3726,
3726,
31,
3223,
610,
17018,
19,
6018,
18,
15,
47,
31,
22,
79,
3561,
26,
21,
6819,
72,
2027,
32,
9,
184,
92,
31,
805,
27,
48,
4255,
27,
51,
4444,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 is the "private" modifier needed?
===
Consider private is the default access modifier, why is the keyword even needed? | 0 | [
2,
483,
25,
14,
13,
7,
20181,
7,
7226,
16292,
851,
60,
800,
3726,
3726,
3563,
932,
25,
14,
12838,
1381,
7226,
16292,
15,
483,
25,
14,
1246,
9587,
166,
851,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Null vs. False vs. 0
===
I am told that good developers can spot/utilize the difference between Null and False and 0 and all the other good "nothing" entities.
What *is* the difference, specifically in PHP? Does it have something to do with ===?
| 0 | [
2,
16203,
4611,
9,
4997,
4611,
9,
713,
800,
3726,
3726,
31,
589,
470,
30,
254,
10168,
92,
1999,
118,
14255,
2952,
14,
2841,
128,
16203,
17,
4997,
17,
713,
17,
65,
14,
89,
254,
13,
7,
8297,
7,
12549,
9,
98,
1637,
403,
2483,
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... |
Fully unrap a view
===
In Oracle, is there an easy way to fully unrap a view? eg, if I have a view which is made up of selects on more views, is there some way to unrap it to just selects directly on real tables?
| 0 | [
2,
2337,
367,
10817,
21,
1418,
800,
3726,
3726,
19,
15759,
15,
25,
80,
40,
2010,
161,
20,
2337,
367,
10817,
21,
1418,
60,
12369,
15,
100,
31,
57,
21,
1418,
56,
25,
117,
71,
16,
5407,
18,
27,
91,
4146,
15,
25,
80,
109,
161,
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,
0,
0,
0,
0... |
How do I programmatically show or hide the Outlook envelope icon?
===
For example, how do I show or hide the Outlook envelope icon from an Outlook Rule?
(The envelope icon option is set by going to
Tools -> Options...
E-mail Options
Advanced E-mail Options
Show an envelope icon in the notification area) | 0 | [
2,
184,
107,
31,
625,
6732,
1326,
298,
54,
3077,
14,
19837,
9127,
9801,
60,
800,
3726,
3726,
26,
823,
15,
184,
107,
31,
298,
54,
3077,
14,
19837,
9127,
9801,
37,
40,
19837,
1828,
60,
13,
5,
124,
9127,
9801,
4255,
25,
309,
34,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 protect a Rails model attribute?
===
My Invoice model has an address\_id attribute, and I don't want this address\_id to change FOREVER. So I don't want this to happen outside the class:
invoice.address_id = 1
invoice.address = some_address
Rails automatically adds this address_id attribute to th... | 0 | [
2,
184,
20,
2196,
21,
2240,
18,
1061,
35,
14755,
60,
800,
3726,
3726,
51,
19,
13379,
1061,
63,
40,
3218,
1,
1340,
35,
14755,
15,
17,
31,
221,
22,
38,
259,
48,
3218,
1,
1340,
20,
753,
3818,
9,
86,
31,
221,
22,
38,
259,
48,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Assembler on OS X
===
I'd like to learn assembler. However, there are very few resources for doing assembler with OS X.
Is there anyone out there who has programmed in assembly on a Mac? Where did you learn?
And, is there any reason I shouldn't be doing assembly? Do I risk (significantly) crashing my computer... | 0 | [
2,
13,
13736,
139,
27,
13,
759,
993,
800,
3726,
3726,
31,
22,
43,
101,
20,
2484,
13,
13736,
139,
9,
207,
15,
80,
50,
253,
310,
2566,
26,
845,
13,
13736,
139,
29,
13,
759,
993,
9,
25,
80,
1276,
70,
80,
72,
63,
2866,
43,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PHP: How set system-wide what encoding must be used by a site?
===
On some systems it is UTF-8, on others latin-1. How do you set this? Is it something in php.ini?
(I know you can set the encoding/charset for a given page by setting HTTP headers, but this is not what I am looking for.)
Alex | 0 | [
2,
13,
26120,
45,
184,
309,
329,
8,
8077,
98,
19608,
491,
44,
147,
34,
21,
689,
60,
800,
3726,
3726,
27,
109,
1242,
32,
25,
287,
11720,
8,
457,
15,
27,
654,
2068,
8,
165,
9,
184,
107,
42,
309,
48,
60,
25,
32,
301,
19,
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... |
Delphi: Why is my stored procedure receiving a null parameter?
===
Ok, this is a curly one. I'm working on some Delphi code that I didn't write, and I'm encountering a very strange problem. One of my stored procedures' parameters is coming through as `null`, even though it's definitely being sent `1`.
The Delphi co... | 0 | [
2,
23030,
45,
483,
25,
51,
8214,
7004,
3396,
21,
16203,
18906,
60,
800,
3726,
3726,
5854,
15,
48,
25,
21,
21056,
53,
9,
31,
22,
79,
638,
27,
109,
23030,
1797,
30,
31,
223,
22,
38,
2757,
15,
17,
31,
22,
79,
7007,
68,
21,
253,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Fastest JavaScript for printing 1 to 1,000,000 (separated by spaces) in a web browser
===
I was reading about output buffering in JavaScript **[here][1],** and was trying to get my head around the script the author says was the fastest at printing 1 to 1,000,000 to a web page. (Scroll down to the header "The winning o... | 0 | [
2,
7518,
8247,
8741,
26,
7312,
137,
20,
137,
11623,
13,
5,
18,
14189,
7432,
34,
7644,
6,
19,
21,
2741,
16495,
800,
3726,
3726,
31,
23,
1876,
88,
5196,
17497,
68,
19,
8247,
8741,
13,
1409,
2558,
6836,
500,
2558,
165,
500,
15,
140... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 web-based Subversion client
===
What is your favorite web-based svn client? I'd like one that supports commits via the web.
One tool per post please! Please include platform and notable features (e.g. read-write support). | 0 | [
2,
246,
2741,
8,
1281,
972,
10898,
6819,
800,
3726,
3726,
98,
25,
154,
3839,
2741,
8,
1281,
13,
18,
16578,
6819,
60,
31,
22,
43,
101,
53,
30,
6747,
9686,
18,
1197,
14,
2741,
9,
53,
5607,
416,
678,
2247,
187,
2247,
468,
2452,
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,
0,
0,
0... |
x86 assembler via .NET
===
Is there such a thing as an x86 assembler that I can call through C#? I want to be able to pass x86 instructions as a string and get a byte array back. If one doesn't exist, how can I make my own? | 0 | [
2,
993,
3274,
13,
13736,
139,
1197,
13,
9,
2328,
800,
3726,
3726,
25,
80,
145,
21,
584,
28,
40,
993,
3274,
13,
13736,
139,
30,
31,
92,
645,
120,
272,
5910,
60,
31,
259,
20,
44,
777,
20,
1477,
993,
3274,
7650,
28,
21,
3724,
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... |
Programming == Math
===
I've heard many times that all programming is really a subset of math. <a href="http://c2.com/cgi-bin/wiki?ProgrammingIsMath">Some suggest</a> that OO, at its roots, is mathematically based. I don't get the connection. Aside from some obvious examples:
* using induction to prove a recursive ... | 0 | [
2,
3143,
800,
3726,
5057,
800,
3726,
3726,
31,
22,
195,
752,
151,
436,
30,
65,
3143,
25,
510,
21,
16622,
16,
5057,
9,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
150,
135,
9,
960,
118,
150,
2234,
8,
4772,
118,
17375,
60,
1974... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 perform a HEAD request with the mechanize library?
===
I know how to do a HEAD request with httplib, but I have to use mechanize for this site. Any suggestions how I would do this?
Essentially, what I need to do is grab a value from the header (filename) without actually downloading the file. | 0 | [
2,
184,
92,
31,
2985,
21,
157,
3772,
29,
14,
55,
3606,
2952,
1248,
60,
800,
3726,
3726,
31,
143,
184,
20,
107,
21,
157,
3772,
29,
7775,
8326,
15,
47,
31,
57,
20,
275,
55,
3606,
2952,
26,
48,
689,
9,
186,
18389,
184,
31,
83,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Word Automation - How do I embed a custom user-control in MS Word ?
===
Context: The environment is .Net 3.0 land, the DB is abstracted well out and the solution would need to work for Office 2000 and up I guess..
The need is to get a customized report for which the user would like to have certain application wind... | 0 | [
2,
833,
23217,
13,
8,
184,
107,
31,
11911,
69,
21,
5816,
4155,
8,
12898,
19,
4235,
833,
13,
60,
800,
3726,
3726,
4141,
45,
14,
2307,
25,
13,
9,
2328,
203,
9,
387,
476,
15,
14,
13,
9007,
25,
8502,
69,
134,
70,
17,
14,
4295,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 best way to parse a web page in Ruby?
===
I have been looking at XML and HTML libraries on rubyforge for a simple way to pull data out of a web page. For example if I want to parse a user page on stackoverflow how can I get the data into a usable format?
Say I want to parse my own user page for my curr... | 0 | [
2,
98,
25,
14,
246,
161,
20,
2017,
870,
21,
2741,
2478,
19,
10811,
60,
800,
3726,
3726,
31,
57,
74,
699,
35,
23504,
17,
13,
15895,
8649,
27,
10811,
1106,
834,
26,
21,
1935,
161,
20,
2201,
1054,
70,
16,
21,
2741,
2478,
9,
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... |
Virtual method called from Dispose or destructor
===
I can't find a reference to it but I remember reading that it wasn't a good idea to call virtual (polymorphic) methods within a destructor or the Dispose() method of IDisposable.
Is this true and if so can someone explain why?
| 0 | [
2,
6599,
2109,
227,
37,
17913,
54,
13,
20137,
248,
800,
3726,
3726,
31,
92,
22,
38,
477,
21,
2801,
20,
32,
47,
31,
1518,
1876,
30,
32,
526,
22,
38,
21,
254,
882,
20,
645,
6599,
13,
5,
17108,
12498,
596,
6,
3195,
363,
21,
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... |
Is Test Driven Development good for a starter?
===
Expanding this question on how I learnt to pass from <a href="http://stackoverflow.com/questions/137375/"> problem description to code </a> Two people mentioned TDD.
Would it be good for a starter to get into TDD ( and avoid bad habits in the future ? ) Or would i... | 0 | [
2,
25,
1289,
5355,
522,
254,
26,
21,
11744,
60,
800,
3726,
3726,
9393,
48,
1301,
27,
184,
31,
2484,
38,
20,
1477,
37,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
13786,
18266,
118... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Encapsulating SQL in a named_scope
===
I was wondering if there was a way to use "find_by_sql" within a named_scope. I'd like to treat custom sql as named_scope so I can chain it to my existing named_scopes. It would also be good for optimizing a sql snippet I use frequently. | 0 | [
2,
1957,
4666,
18,
10038,
4444,
255,
19,
21,
377,
1,
11555,
800,
3726,
3726,
31,
23,
5712,
100,
80,
23,
21,
161,
20,
275,
13,
7,
19811,
1,
779,
1,
18,
22402,
7,
363,
21,
377,
1,
11555,
9,
31,
22,
43,
101,
20,
5752,
5816,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 you pipe an inputstream to a zipped file as it's read in with Java?
===
I'm wanting to execute a program and as it runs read in it's output and pipe out the output into a zipped file. The output of the program can be quite large so the idea is to not hold too much in memory - just to send it to the zip as I ge... | 0 | [
2,
184,
107,
42,
7642,
40,
6367,
11260,
20,
21,
28693,
3893,
28,
32,
22,
18,
1302,
19,
29,
8247,
60,
800,
3726,
3726,
31,
22,
79,
4638,
20,
15644,
21,
625,
17,
28,
32,
1461,
1302,
19,
32,
22,
18,
5196,
17,
7642,
70,
14,
5196... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
IoC Containers - Which is best? (.Net)
===
I'd like to get a feel for what people are using for IoC containers. I've read some good things about Castle Windsor, but I know a lot of people use StructureMap, Unity, Ninject, etc.
What are some of the differences amongst those mentioned (and any I neglected). Strength... | 4 | [
2,
31,
2499,
18988,
13,
8,
56,
25,
246,
60,
13,
5,
9,
2328,
6,
800,
3726,
3726,
31,
22,
43,
101,
20,
164,
21,
583,
26,
98,
148,
50,
568,
26,
31,
2499,
18988,
9,
31,
22,
195,
1302,
109,
254,
564,
88,
1339,
10784,
15,
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... |
Free insaller
===
Is there something like install shield that I can use for free? | 4 | [
2,
551,
19,
18,
1233,
106,
800,
3726,
3726,
25,
80,
301,
101,
16146,
4179,
30,
31,
92,
275,
26,
551,
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,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Persistence of an std::map in C++
===
Do you know any easy or simple way to make a map object (from the STL library) persistent (i.e. write it to a file) so that you can recover its state later when the program in run later ??
Thanks for your help | 0 | [
2,
28584,
16,
40,
354,
43,
45,
45,
15022,
19,
272,
20512,
800,
3726,
3726,
107,
42,
143,
186,
2010,
54,
1935,
161,
20,
233,
21,
2942,
3095,
13,
5,
2665,
14,
354,
255,
1248,
6,
15348,
13,
5,
49,
9,
62,
9,
2757,
32,
20,
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... |
Where does Console.WriteLine go in ASP.NET?
===
In a J2EE application (like one running in WebSphere), when I use `System.out.println()`, my text goes to standard out, which is mapped to a file by the WebSphere admin console.
In an ASP.NET application (like one running in IIS), where does the output of `Console.Wri... | 0 | [
2,
113,
630,
8650,
9,
23716,
1143,
162,
19,
28,
306,
9,
2328,
60,
800,
3726,
3726,
19,
21,
487,
135,
2851,
3010,
13,
5,
1403,
53,
946,
19,
2741,
14079,
6,
15,
76,
31,
275,
13,
1,
10724,
9,
1320,
9,
10299,
16600,
5,
6,
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,
0,
0,
0,
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 you do polymorphism in Ruby?
===
In C#, I can do this:
class Program
{
static void Main(string[] args)
{
List<Animal> animals = new List<Animal>();
animals.Add(new Dog());
animals.Add(new Cat());
foreach (Animal a in animals)
... | 0 | [
2,
184,
107,
42,
107,
3446,
13348,
19,
10811,
60,
800,
3726,
3726,
19,
272,
5910,
15,
31,
92,
107,
48,
45,
718,
625,
13,
1,
12038,
11364,
407,
5,
11130,
2558,
500,
13,
10663,
18,
6,
13,
1,
968,
1,
25480,
1,
2522,
800,
78,
96... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Apache Redirect only when entering a password
===
I setup phpMyID on one of my machines, and I'm trying to get apache to redirect to HTTPS only when a password is being submitted. I am doing this as my original setup of redirecting all openid traffic didn't work stackoverflow doesn't like my self signed certificate. ... | 0 | [
2,
17140,
302,
14706,
104,
76,
4604,
21,
20884,
800,
3726,
3726,
31,
18161,
13,
26120,
915,
1340,
27,
53,
16,
51,
6035,
15,
17,
31,
22,
79,
749,
20,
164,
17140,
20,
302,
14706,
20,
7775,
18,
104,
76,
21,
20884,
25,
142,
7368,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
C# 3 new feature posts (and not about .Net 3.5 features)
===
There are a lot of new features that came with the .Net Framework 3.5. Most of the posts and info on the subject list stuff about new 3.5 features and C# 3 changes at the same time. But C# 3 can be used without .Net 3.5. Does anyone know of a good post descr... | 3 | [
2,
272,
5910,
203,
78,
1580,
9868,
13,
5,
290,
52,
88,
13,
9,
2328,
203,
9,
264,
967,
6,
800,
3726,
3726,
80,
50,
21,
865,
16,
78,
967,
30,
281,
29,
14,
13,
9,
2328,
6596,
203,
9,
264,
9,
127,
16,
14,
9868,
17,
15404,
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... |
Does WebMethods ESB scale?
===
I'm looking for people who have had experiences scaling WebMethods ESB to large traffic volumes (both size and number of messages). How has that gone? Were there any issues and how did you solve them? | 0 | [
2,
630,
2741,
5909,
1807,
43,
18,
13,
160,
220,
3464,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
148,
72,
57,
41,
5513,
26829,
2741,
5909,
1807,
43,
18,
13,
160,
220,
20,
370,
2227,
6127,
13,
5,
8110,
1072,
17,
234,
16,
7561,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 WebSphere ESB scale?
===
I'm looking for people who have had experience scaling IBM's WebSphere to high traffic volumes. This is in terms of both the number of messages and the size of the data. Have there been any issues and are there any gotchas to be looking out for? | 0 | [
2,
630,
2741,
14079,
13,
160,
220,
3464,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
148,
72,
57,
41,
1496,
26829,
10233,
22,
18,
2741,
14079,
20,
183,
2227,
6127,
9,
48,
25,
19,
1663,
16,
156,
14,
234,
16,
7561,
17,
14,
1072,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Spell-check in Aquamacs Emacs won't work: "Wrong endian order."
===
This is aquamacs 1.5 on a macbook. Exact error when I try to spell-check:
Error: The file "/Library/Application Support/cocoAspell/aspell6-en-6.0-0//en-common.rws" is not in the proper format. Wrong endian order. | 0 | [
2,
4762,
8,
12542,
19,
14299,
6893,
18,
13,
62,
6893,
18,
230,
22,
38,
170,
45,
13,
7,
499,
14271,
241,
806,
389,
9,
7,
800,
3726,
3726,
48,
25,
14299,
6893,
18,
137,
9,
264,
27,
21,
1572,
5199,
9,
5340,
7019,
76,
31,
1131,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 distro of Linux is best suited for Java web apps?
===
There are so many Linux distributions to choose from! What is the "best" linux flavor for a web hosting environment running primarily:
Apache HTTP, Tomcat or JBoss, MySQL and Alfresco (not necessarily all in the same instance).
Are there any significant ... | 0 | [
2,
56,
1460,
3996,
16,
13024,
25,
246,
12949,
26,
8247,
2741,
4865,
18,
60,
800,
3726,
3726,
80,
50,
86,
151,
13024,
2523,
18,
20,
3538,
37,
187,
98,
25,
14,
13,
7,
4936,
7,
13024,
11974,
26,
21,
2741,
10637,
2307,
946,
2257,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 to convert csv/excel to xml
===
As title but would like the flexibility to specify how the output xml file will look like. Any free tool available on windows platform that I can use to achieve that? Thanks | 0 | [
2,
5607,
20,
8406,
272,
18,
710,
118,
1706,
11040,
20,
23504,
800,
3726,
3726,
28,
581,
47,
83,
101,
14,
19401,
20,
19077,
184,
14,
5196,
23504,
3893,
129,
361,
101,
9,
186,
551,
5607,
904,
27,
1936,
2452,
30,
31,
92,
275,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Free mulitplatform installer
===
Expanding on <http://stackoverflow.com/questions/137657/free-insaller> I am looking for a cross platform installer. We support something like 27 platform variations and most of the installers mentioned in the other question are windows only. We are looking for something portable, pos... | 0 | [
2,
551,
6633,
242,
27035,
16146,
106,
800,
3726,
3726,
9393,
27,
13,
1,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
13786,
3577,
9816,
4639,
8,
108,
18,
1233,
106,
1,
31,
589,
699,
26,
21,
919,
2452,
16146,
106,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
html form with username, password, multiple file uploads and php code to process
===
How to post a username, password and multiple binary files from a single html form and process it using php? I'm not allowed to use ajax.
| 0 | [
2,
13,
15895,
505,
29,
4155,
7259,
15,
20884,
15,
1886,
3893,
71,
8294,
18,
17,
13,
26120,
1797,
20,
953,
800,
3726,
3726,
184,
20,
678,
21,
4155,
7259,
15,
20884,
17,
1886,
14171,
6488,
37,
21,
345,
13,
15895,
505,
17,
953,
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,
0,
0,
0,
0,
0... |
Free code review software options for ASP.NET and Subversion
===
Does anyone know about free code review solutions out there (for asp.net)? I am trying to find something that is free or inexpensive for a startup. Also, It would be nice if it had some sort of subversion integration, as this is always a pain to manage m... | 0 | [
2,
551,
1797,
1487,
2306,
6368,
26,
28,
306,
9,
2328,
17,
972,
10898,
800,
3726,
3726,
630,
1276,
143,
88,
551,
1797,
1487,
6776,
70,
80,
13,
5,
1106,
28,
306,
9,
2328,
6,
60,
31,
589,
749,
20,
477,
301,
30,
25,
551,
54,
259... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
MDIParent Tiling children
===
Is there any way to tile all of the form children of an mdi parent easily? I'm looking for most of the functionality that windows offers, tile cascade. Anyone know of an easy way? | 0 | [
2,
8138,
49,
18908,
9189,
68,
391,
800,
3726,
3726,
25,
80,
186,
161,
20,
13,
9802,
65,
16,
14,
505,
391,
16,
40,
8138,
49,
4766,
2351,
60,
31,
22,
79,
699,
26,
127,
16,
14,
18548,
30,
1936,
2486,
15,
13,
9802,
13542,
9,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Best Data Structure to be Enumerated by String Key or Index in C#
===
I'm looking for the most ideal data structure (for performance and ease of use) from which values can be retrieved by string key or index. Dictionary<string, object> doesn't work because you can't really retrieve by index. Any ideas? | 0 | [
2,
246,
1054,
1411,
20,
44,
26940,
69,
34,
3724,
1246,
54,
4348,
19,
272,
5910,
800,
3726,
3726,
31,
22,
79,
699,
26,
14,
127,
5628,
1054,
1411,
13,
5,
1106,
956,
17,
6378,
16,
275,
6,
37,
56,
4070,
92,
44,
3685,
34,
3724,
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 is a real-world simulation designed?
===
I am fascinated by the performance of applications such as "Rollercoaster Tycoon" and "The Sims" and FPS games. I would like to know more about the basic application architecture. (Not so concerned with the UI - I assume MVC/MVP piriciples apply here. Nor am I concerned w... | 0 | [
2,
184,
25,
21,
683,
8,
4423,
10926,
1006,
60,
800,
3726,
3726,
31,
589,
17452,
34,
14,
956,
16,
3767,
145,
28,
13,
7,
8694,
106,
20494,
106,
29301,
7,
17,
13,
7,
124,
4861,
18,
7,
17,
13,
12087,
18,
466,
9,
31,
83,
101,
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... |
Should extension properties be added to C# 4.0?
===
I've wanted this for fluent interfaces. See, for example [this][1] Channel9 discussion. Would probably [require][2] also adding indexed properties.
What are your thoughts? Would the advantages outweigh the "language clutter"?
[1]: http://channel9.msdn.com/for... | 4 | [
2,
378,
3896,
3704,
44,
905,
20,
272,
5910,
268,
9,
387,
60,
800,
3726,
3726,
31,
22,
195,
417,
48,
26,
19252,
6573,
18,
9,
196,
15,
26,
823,
636,
1565,
500,
2558,
165,
500,
1318,
518,
5460,
9,
83,
910,
636,
99,
3003,
99,
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... |
Given a function which produces a random integer in the range 1 to 5, write a function which produces a random integer in the range 1 to 7
===
1. what is simple solution
2. what is effective solution to less minimum memory and(or) cpu speed?
| 0 | [
2,
504,
21,
1990,
56,
6700,
21,
5477,
13820,
19,
14,
978,
137,
20,
331,
15,
2757,
21,
1990,
56,
6700,
21,
5477,
13820,
19,
14,
978,
137,
20,
453,
800,
3726,
3726,
137,
9,
98,
25,
1935,
4295,
172,
9,
98,
25,
3140,
4295,
20,
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,
0,
0,
0,
0,
0,
0,
0... |
SSRS: Change SQL Statement Dynamically
===
I have a report in SSRS 2005 that's based on a query that's similar to this one:
SELECT * FROM MyTable (NOLOCK)
WHERE col1 = 'ABC'
AND col2 LIKE '%XYZ%'
I need to be able to dynamically include the AND part of the WHERE clause in the query based on wheth... | 0 | [
2,
22118,
18,
45,
753,
4444,
255,
3331,
7782,
1326,
800,
3726,
3726,
31,
57,
21,
1330,
19,
22118,
18,
812,
30,
22,
18,
432,
27,
21,
25597,
30,
22,
18,
835,
20,
48,
53,
45,
5407,
1637,
37,
51,
5924,
13,
5,
251,
3966,
6,
113,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Suggetions on using Flex with WCF and Linq to Entities.
===
So I am working on a project that uses a ASP.NET server and we have entities being passed over WCF from LINQ-to-Entity queries. I have already overcome the cyclic reference issue with WCF. Now that I am looking toward the next step, the Flex UI, I am wonderin... | 0 | [
2,
13,
18,
5127,
3060,
5757,
27,
568,
14409,
29,
11801,
410,
17,
6294,
1251,
20,
12549,
9,
800,
3726,
3726,
86,
31,
589,
638,
27,
21,
669,
30,
2027,
21,
28,
306,
9,
2328,
8128,
17,
95,
57,
12549,
142,
1100,
84,
11801,
410,
37,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
SQL SERVER, SELECT statement with auto generate row id
===
Does anyone happen to remember what is the the function of select state to grab records from sql server with additional row id column automatically generate?
| 0 | [
2,
4444,
255,
8128,
15,
5407,
3331,
29,
3108,
7920,
3131,
4924,
800,
3726,
3726,
630,
1276,
2384,
20,
1518,
98,
25,
14,
14,
1990,
16,
5407,
146,
20,
4931,
742,
37,
4444,
255,
8128,
29,
1351,
3131,
4924,
4698,
7499,
7920,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What's your favorite C++0x feature?
===
As many of us know (and many, many more don't), C++ is currently undergoing final drafting for the next revision of the International Standard, expected to be published in about 2 years. Drafts and papers are currently available from the [committee website][1]. All sorts of new ... | 4 | [
2,
98,
22,
18,
154,
3839,
272,
20512,
387,
396,
1580,
60,
800,
3726,
3726,
28,
151,
16,
182,
143,
13,
5,
290,
151,
15,
151,
91,
221,
22,
38,
6,
15,
272,
20512,
25,
871,
16863,
426,
2472,
68,
26,
14,
328,
11323,
16,
14,
294,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.