unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Lazy Loading with a WCF Service Domain Model?
===
I'm looking to push my domain model into a WCF Service API and wanted to get some thoughts on lazy loading techniques with this type of setup.
Any suggestions when taking this approach? | 0 | [
2,
16792,
12797,
29,
21,
11801,
410,
365,
4603,
1061,
60,
800,
3726,
3726,
31,
22,
79,
699,
20,
3250,
51,
4603,
1061,
77,
21,
11801,
410,
365,
21,
2159,
17,
417,
20,
164,
109,
3064,
27,
16792,
12797,
4212,
29,
48,
1001,
16,
1816... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
How do I make bash reverse-search work in Terminal.app without it displaying garbled output?
===
Using Terminal.app on OS X 10.5, often you see the commands get garbled when you do a reverse-search with Bash. Is there some kind of termcap or perhaps a bash shopt command that can fix this? It is very annoying.
S... | 0 | [
2,
184,
107,
31,
233,
13158,
7006,
8,
25136,
170,
19,
3855,
9,
7753,
366,
32,
17418,
19646,
1294,
5196,
60,
800,
3726,
3726,
568,
3855,
9,
7753,
27,
13,
759,
993,
332,
9,
264,
15,
478,
42,
196,
14,
14294,
164,
19646,
1294,
76,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
RoR on Windows with Mongrel
===
Where is the best tutorial for getting RoR working on a windows box with Mongrel? I'm a complete noob at server management, so the more detailed the better! | 0 | [
2,
761,
248,
27,
1936,
29,
21028,
7256,
800,
3726,
3726,
113,
25,
14,
246,
29724,
26,
1017,
761,
248,
638,
27,
21,
1936,
1649,
29,
21028,
7256,
60,
31,
22,
79,
21,
1279,
90,
4995,
35,
8128,
1097,
15,
86,
14,
91,
6036,
14,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Why does Python's __iter__ on a mapping return keys() instead of iteritems()?
===
It seems like if you want to get the keys of a mapping, you ask for them; otherwise, give me the _whole_ mapping (constituted by a set of key-value pairs). Is there a historical reason for this? | 0 | [
2,
483,
630,
20059,
22,
18,
13,
1,
242,
106,
1,
27,
21,
13305,
788,
5534,
5,
6,
700,
16,
32,
106,
2119,
79,
18,
5,
6,
60,
800,
3726,
3726,
32,
2206,
101,
100,
42,
259,
20,
164,
14,
5534,
16,
21,
13305,
15,
42,
1349,
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... |
What makes the Unix file system more superior to the Windows file system?
===
I'll admit that I don't know the inner workings of the unix operating system, so I was hoping someone could shed some light on this topic.
Why is the unix file system better than the windows file system?
Would grep work just as well on... | 0 | [
2,
98,
1364,
14,
22540,
3893,
329,
91,
4475,
20,
14,
1936,
3893,
329,
60,
800,
3726,
3726,
31,
22,
211,
5251,
30,
31,
221,
22,
38,
143,
14,
3754,
638,
18,
16,
14,
22540,
2455,
329,
15,
86,
31,
23,
3935,
737,
110,
5062,
109,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 programs should I write to truly experience this fancy new lanauge ?
===
<p>Tried Scheme at one point, just built up half of a "math" and "string" library before getting bored...</p>
<p>Similar experience with Java, but stopped early because I was appalled at the lack of operator overloading.</p>
<p>When yo... | 0 | [
2,
98,
1726,
378,
31,
2757,
20,
4574,
1496,
48,
12251,
78,
13,
10167,
13054,
13,
60,
800,
3726,
3726,
13,
1,
306,
1,
3367,
69,
4276,
35,
53,
454,
15,
114,
392,
71,
519,
16,
21,
13,
7,
14825,
7,
17,
13,
7,
11130,
7,
1248,
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... |
What is a good online resource for css 'design patterns'?
===
Can anyone out there recommend a good online resource for CSS 'design patterns'?
I know design patterns in a software context usually refer to OO based design patterns, but I mean design patterns in the broader sense of the term: i.e. common, clean solut... | 4 | [
2,
98,
25,
21,
254,
2087,
6577,
26,
272,
18,
18,
13,
22,
19862,
6282,
22,
60,
800,
3726,
3726,
92,
1276,
70,
80,
12360,
21,
254,
2087,
6577,
26,
272,
18,
18,
13,
22,
19862,
6282,
22,
60,
31,
143,
704,
6282,
19,
21,
2306,
414... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Ruby "is" equivalent
===
Is there a Ruby equivalent for Python's "is"? It tests whether two objects are identical (i.e. have the same memory location). | 0 | [
2,
10811,
13,
7,
403,
7,
4602,
800,
3726,
3726,
25,
80,
21,
10811,
4602,
26,
20059,
22,
18,
13,
7,
403,
7,
60,
32,
4894,
1472,
81,
3916,
50,
6323,
13,
5,
49,
9,
62,
9,
57,
14,
205,
1912,
1474,
6,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Using Office to programatically convert documents?
===
I'm interested in using Office 2007 to convert between the pre-2007 binary formats (.doc, .xls, .ppt) and the new Office Open XML formats (.docx, .xlsx, .pptx)
How would I do this? I'd like to write a simple command line app that takes in two filenames (input a... | 0 | [
2,
568,
488,
20,
625,
721,
8438,
8406,
4374,
60,
800,
3726,
3726,
31,
22,
79,
3158,
19,
568,
488,
624,
20,
8406,
128,
14,
782,
8,
2727,
14171,
13767,
13,
5,
9,
13799,
15,
13,
9,
396,
7532,
15,
13,
9,
3421,
38,
6,
17,
14,
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... |
Do you continue development in a branch or in the trunk?
===
Suppose you're developing a software product that has periodic releases. What are the best practices with regard to branching and merging? Slicing off periodic release branches to the public (or whomever your customer is) and then continuing development on t... | 4 | [
2,
107,
42,
1816,
522,
19,
21,
1686,
54,
19,
14,
6436,
60,
800,
3726,
3726,
5787,
42,
22,
99,
3561,
21,
2306,
2374,
30,
63,
18350,
7073,
9,
98,
50,
14,
246,
5242,
29,
6731,
20,
1686,
68,
17,
18842,
60,
27646,
168,
18350,
830,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 practices when "going dark"
===
I'm sure some of you would have read Jeff's Atwood's [Don't Go Dark][1] article. The gist is that it is anathema to go "lock yourself in a room" and perform a development task or project for long periods of time. The best practice would be to have a team (at least another person) w... | 2 | [
2,
246,
5242,
76,
13,
7,
13269,
659,
7,
800,
3726,
3726,
31,
22,
79,
562,
109,
16,
42,
83,
57,
1302,
3292,
22,
18,
35,
1208,
22,
18,
636,
804,
22,
38,
162,
659,
500,
2558,
165,
500,
2002,
9,
14,
489,
702,
25,
30,
32,
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... |
Windows Home Server versus Vista Backup and Restore Center
===
I've been using Window Home Server for my backups here at home for most of a year now, and I'm really pleased with it. It's far better than the software I was using previously (Acronis). I'm thinking about a backup strategy for my work machine and I'd li... | 0 | [
2,
1936,
213,
8128,
5706,
13520,
10119,
17,
8454,
459,
800,
3726,
3726,
31,
22,
195,
74,
568,
1463,
213,
8128,
26,
51,
10119,
18,
235,
35,
213,
26,
127,
16,
21,
159,
130,
15,
17,
31,
22,
79,
510,
7130,
29,
32,
9,
32,
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... |
Begining SVN
===
I am ready to start using SVN, but I have NO (as in the money required for free bear) experience with source control. I have installed subversion on my server (that was easy, 'apt-get install subversion') but now I don't know what to do, how to configure it, or how to use it.<br /><br />What suggesti... | 0 | [
2,
2348,
68,
13,
18,
16578,
800,
3726,
3726,
31,
589,
1451,
20,
799,
568,
13,
18,
16578,
15,
47,
31,
57,
90,
13,
5,
472,
19,
14,
875,
1390,
26,
551,
2746,
6,
1496,
29,
1267,
569,
9,
31,
57,
4066,
972,
10898,
27,
51,
8128,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 architecture to bridge to XMPP?
===
If I have a separate system with its own concept of users and presence, what is the most appropriate architecture for creating a bridge to an XMPP server network? As far as I can tell there are three primary ways:
1. Act as a server. This creates one touchpoint... | 0 | [
2,
98,
25,
14,
246,
2607,
20,
955,
20,
993,
79,
3421,
60,
800,
3726,
3726,
100,
31,
57,
21,
1725,
329,
29,
82,
258,
2420,
16,
3878,
17,
1970,
15,
98,
25,
14,
127,
4593,
2607,
26,
2936,
21,
955,
20,
40,
993,
79,
3421,
8128,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
"Multi-agent computing" in simple terms
===
I've encountered the term "multi-agent computing" as of late, and I don't quite get what it is. I've read a book about it, but that didn't answer the fundamental question of what an agent was.
Does someone out there have a pointer to some reference which is clear and conc... | 0 | [
2,
13,
7,
21531,
8,
58,
7685,
10626,
7,
19,
1935,
1663,
800,
3726,
3726,
31,
22,
195,
8208,
14,
981,
13,
7,
21531,
8,
58,
7685,
10626,
7,
28,
16,
456,
15,
17,
31,
221,
22,
38,
1450,
164,
98,
32,
25,
9,
31,
22,
195,
1302,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
On a two-column page, how can I grow the left div to the same height of the right div using CSS or Javascript?
===
I'm trying to make a two-column page using a div-based layout (no tables please!). Problem is, I can't grow the left div to match the height of the right one. My right div typically has a lot of content.... | 0 | [
2,
27,
21,
81,
8,
716,
4404,
103,
2478,
15,
184,
92,
31,
3213,
14,
225,
13,
12916,
20,
14,
205,
2947,
16,
14,
193,
13,
12916,
568,
272,
18,
18,
54,
8247,
8741,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
233,
21,
81,
8,
716,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Writing cross-platform apps in C
===
What things should be kept most in mind when writing cross-platform applications in C? Targeted platforms: 32-bit Intel based PC, Mac, and Linux. I'm especially looking for the type of versatility that Jungle Disk has in their USB desktop edition ( <http://www.jungledisk.com/deskto... | 0 | [
2,
1174,
919,
8,
27035,
4865,
18,
19,
272,
800,
3726,
3726,
98,
564,
378,
44,
1025,
127,
19,
594,
76,
1174,
919,
8,
27035,
3767,
19,
272,
60,
9536,
6843,
45,
2512,
8,
3326,
14635,
432,
5168,
15,
1572,
15,
17,
13024,
9,
31,
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... |
Decision making in distributed applications
===
With a distributed application, where you have lots of clients and one main server, should you:
- Make the clients dumb and the server smart: clients are fast and non-invasive. Business rules are needed in only 1 place
- Make the clients smart and the server dumb: ... | 0 | [
2,
1401,
544,
19,
4387,
3767,
800,
3726,
3726,
29,
21,
4387,
3010,
15,
113,
42,
57,
7503,
16,
7421,
17,
53,
407,
8128,
15,
378,
42,
45,
13,
8,
233,
14,
7421,
9317,
17,
14,
8128,
3978,
45,
7421,
50,
1512,
17,
538,
8,
18984,
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... |
Change Active Sound Card on the Fly
===
I currently have speakers set up both in my office and in my living room, connected to my PC via two sound cards, and would like to switch the set of speakers I'm outputting to on the fly.
Anyone know an application or a windows API call that I can use to change the default s... | 0 | [
2,
753,
1348,
646,
2056,
27,
14,
2855,
800,
3726,
3726,
31,
871,
57,
7306,
309,
71,
156,
19,
51,
488,
17,
19,
51,
634,
337,
15,
2587,
20,
51,
5168,
1197,
81,
646,
4092,
15,
17,
83,
101,
20,
5521,
14,
309,
16,
7306,
31,
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... |
Getting started with SideShow Devices
===
Is there a recommendation for a hardware platform for developing/testing SideShow devices, or is the Emulator adequate? | 0 | [
2,
1017,
373,
29,
270,
9303,
4690,
800,
3726,
3726,
25,
80,
21,
14066,
26,
21,
7610,
2452,
26,
3561,
118,
10543,
68,
270,
9303,
4690,
15,
54,
25,
14,
3579,
14868,
12870,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Seeking code highlighter recommendation for WordPress
===
Can anybody recommend a reliable and decently documented code highlighter for WordPress 2.6.1. I have tried Code Snippet by Roman Roan and Developer Formatter by Gilberto Saraiva. But they don't seem to work as described in the documentation and are mangling th... | 4 | [
2,
5246,
1797,
14373,
106,
14066,
26,
833,
5890,
800,
3726,
3726,
92,
11181,
12360,
21,
11398,
17,
12238,
102,
8926,
1797,
14373,
106,
26,
833,
5890,
172,
9,
379,
9,
165,
9,
31,
57,
794,
1797,
13,
29061,
34,
1171,
13,
661,
210,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Desktop search utility for pdf,chm and djvu files
===
I want to write a tool that helps me search pdf/chm/djvu files in linux. Any pointers on how to go about it? The major problem is reading/importing data from all these files. Can this be done with C and shell scripting? | 0 | [
2,
17404,
2122,
10082,
26,
13,
11124,
15,
673,
79,
17,
3857,
8924,
6488,
800,
3726,
3726,
31,
259,
20,
2757,
21,
5607,
30,
7778,
55,
2122,
13,
11124,
118,
673,
79,
118,
14365,
8924,
6488,
19,
13024,
9,
186,
454,
445,
27,
184,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
101 tutorial for setting up nhibernate?
===
I am looking for a tutorial on setting up nhibernate.
There seems to be few out there, but most are either written in gibberish, or are on an extremely ancient release.
Any good resources, possibly even the inclusion of fluent or a code configured install? | 0 | [
2,
7698,
29724,
26,
2697,
71,
12109,
15191,
8820,
60,
800,
3726,
3726,
31,
589,
699,
26,
21,
29724,
27,
2697,
71,
12109,
15191,
8820,
9,
80,
2206,
20,
44,
310,
70,
80,
15,
47,
127,
50,
694,
642,
19,
18814,
106,
1595,
15,
54,
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... |
FileUpload control inside an UpdatePanel without refreshing the whole page?
===
According to [Microsoft][1] the FileUpload control is not compatible with an AJAX UpdatePanel.
I am aware that a PostBackTrigger can be added to the submit button of the form like this:
<Triggers>
<asp:PostBackTrigger Con... | 0 | [
2,
3893,
576,
8294,
569,
572,
40,
11100,
3206,
532,
366,
27134,
14,
979,
2478,
60,
800,
3726,
3726,
496,
20,
636,
22019,
12980,
500,
2558,
165,
500,
14,
3893,
576,
8294,
569,
25,
52,
14961,
29,
40,
20624,
11100,
3206,
532,
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... |
Are there any tools to visualize template/class methods and their usage?
===
I have taken over a large code base and would like to get an overview how and where certain classes and their methods are used.
Is there any good tool that can somehow visualize the dependencies and draw a nice call tree or something simil... | 0 | [
2,
50,
80,
186,
4672,
20,
3458,
2952,
22894,
118,
1898,
3195,
17,
66,
7514,
60,
800,
3726,
3726,
31,
57,
658,
84,
21,
370,
1797,
1000,
17,
83,
101,
20,
164,
40,
21598,
184,
17,
113,
1200,
2684,
17,
66,
3195,
50,
147,
9,
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... |
Is it possible to list named events in Windows?
===
I would like to create events for certain resources that are used across various processes and access these events by name. The problem seems to be that the names of the events must be known to all applications referring to them.
Is there maybe a way to get a list... | 0 | [
2,
25,
32,
938,
20,
968,
377,
963,
19,
1936,
60,
800,
3726,
3726,
31,
83,
101,
20,
1600,
963,
26,
1200,
2566,
30,
50,
147,
464,
617,
5102,
17,
1381,
158,
963,
34,
204,
9,
14,
1448,
2206,
20,
44,
30,
14,
1817,
16,
14,
963,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 Python good for big software projects (not web based)?
===
Right now I'm developing mostly in C/C++, but I wrote some small utilities in Python to automatize some tasks and I really love it as language (especially the productivity).
Except for the performances (a problem that could be sometimes solved thanks to... | 0 | [
2,
25,
20059,
254,
26,
580,
2306,
2314,
13,
5,
1270,
2741,
432,
6,
60,
800,
3726,
3726,
193,
130,
31,
22,
79,
3561,
1555,
19,
272,
118,
150,
20512,
15,
47,
31,
738,
109,
284,
19817,
19,
20059,
20,
3108,
5146,
2952,
109,
8674,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Linux GUI development
===
I have a large GUI project that I'd like to port to Linux.
What is the best framework to use for GUI programming in Linux? Should KDE / Gnome frameworks be used? Or can I use something more generic other than X?
I feel like if I chose one of Gnome or KDE, I'm closing the market out for a... | 0 | [
2,
13024,
9457,
522,
800,
3726,
3726,
31,
57,
21,
370,
9457,
669,
30,
31,
22,
43,
101,
20,
1295,
20,
13024,
9,
98,
25,
14,
246,
6596,
20,
275,
26,
9457,
3143,
19,
13024,
60,
378,
680,
546,
13,
118,
24117,
6596,
18,
44,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to embed user-specific data in .NET windows setup app at setup download time?
===
I'd like to have a link in my ASP.NET web site that authenticated users click to download a windows app that is already pre-configured with their client ID and some site config data. My goal is no typing required for the user during... | 0 | [
2,
184,
20,
11911,
69,
4155,
8,
9219,
1054,
19,
13,
9,
2328,
1936,
18161,
4865,
35,
18161,
7121,
85,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
57,
21,
3508,
19,
51,
28,
306,
9,
2328,
2741,
689,
30,
14351,
1669,
3878,
10840,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Formatting tabular data using unicode characters
===
I need to produce a calculation trace file containing tabular data showing intermediate results. I am currently using a combination of the standard ascii pipe symbols (|) and dashes (-) to draw the table lines:
E.g.
Numerator | Denominator | Result
-... | 0 | [
2,
2595,
1203,
6523,
7451,
1054,
568,
28010,
1766,
800,
3726,
3726,
31,
376,
20,
2213,
21,
19644,
5565,
3893,
3503,
6523,
7451,
1054,
3187,
6889,
1736,
9,
31,
589,
871,
568,
21,
3733,
16,
14,
1236,
28,
1892,
49,
7642,
9794,
13,
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... |
XML serialization in Java?
===
Is there a (preferably free) Java analogue of .NET's XML serialization? | 0 | [
2,
23504,
5956,
1829,
19,
8247,
60,
800,
3726,
3726,
25,
80,
21,
13,
5,
3515,
2407,
4801,
551,
6,
8247,
21574,
16,
13,
9,
2328,
22,
18,
23504,
5956,
1829,
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... |
What XML books do you recommend?
===
XML is everywhere - I am looking for a book that would summarize some key aspects of practical use of XML with possible problems and solutions not a "XML bible" thing.
Thanks for feedback in advance!
| 0 | [
2,
98,
23504,
964,
107,
42,
12360,
60,
800,
3726,
3726,
23504,
25,
6417,
13,
8,
31,
589,
699,
26,
21,
360,
30,
83,
18074,
139,
2952,
109,
1246,
4842,
16,
5713,
275,
16,
23504,
29,
938,
1716,
17,
6776,
52,
21,
13,
7,
396,
8184,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Techniques to detect Polymorphic and Metamorphic viruses?
===
What techniques can be applied to detect [Polymorphic][1] and [Metamorphic][2] viruses?
How difficult is to implement these techniques?
Are these techniques being applied in modern day anti-virus softwares?
[1]: http://en.wikipedia.org/wiki/Com... | 0 | [
2,
4212,
20,
9092,
3446,
12498,
596,
17,
7618,
12498,
596,
6231,
160,
60,
800,
3726,
3726,
98,
4212,
92,
44,
2435,
20,
9092,
636,
17108,
12498,
596,
500,
2558,
165,
500,
17,
636,
5909,
58,
12498,
596,
500,
2558,
135,
500,
6231,
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... |
Why is my instance variable not in __dict__?
===
If I create a class `A` as follows:
class A:
def _ _init_ _(self):
self.name = 'A'
Inspecting the `_ _dict_ _` member looks like `{'name': 'A'}`
If however I create a class `B`:
class B:
name = 'B'
`_ _dict_ _` is ... | 0 | [
2,
483,
25,
51,
4851,
7612,
52,
19,
13,
1,
16315,
1,
60,
800,
3726,
3726,
100,
31,
1600,
21,
718,
13,
1,
58,
1,
28,
2415,
45,
718,
21,
45,
6312,
13,
1,
13,
1,
108,
242,
1,
13,
1,
5,
8411,
6,
45,
1119,
9,
7259,
800,
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... |
What's the best way to escape os.system() calls in Python?
===
When using `os.system()` it's often necessary to escape filenames passed as parameters to commands. What's the best way to do this? Preferably something that would work on multiple operating systems/shells.
I'm currently doing the following, but am su... | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
2220,
13,
759,
9,
10724,
5,
6,
3029,
19,
20059,
60,
800,
3726,
3726,
76,
568,
13,
1,
759,
9,
10724,
5,
6,
1,
32,
22,
18,
478,
2378,
20,
2220,
3893,
7259,
18,
1100,
28,
12905,
20,
14294,
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... |
Get a list of current windows, and give one of them focus, in .Net
===
Without resorting to PInvoke, is there a way in .net to find out what windows are open? This is slightly different than asking what applications are running in memory. For example, Firefox could be running, but could be more than one window. Bas... | 0 | [
2,
164,
21,
968,
16,
866,
1936,
15,
17,
590,
53,
16,
105,
1776,
15,
19,
13,
9,
2328,
800,
3726,
3726,
366,
4765,
68,
20,
3459,
2625,
1048,
15,
25,
80,
21,
161,
19,
13,
9,
2328,
20,
477,
70,
98,
1936,
50,
368,
60,
48,
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... |
What is the Difference Between Mercurial and Git?
===
I've been using git for some time now on Windows (with msysGit) and I like the idea of distributed source control. Just recently I've been looking at Mercurial (hg) and it looks interesting. However, I can't wrap my head around the differences between hg and git.
... | 0 | [
2,
98,
25,
14,
2841,
128,
9046,
3594,
192,
17,
13,
10404,
60,
800,
3726,
3726,
31,
22,
195,
74,
568,
13,
10404,
26,
109,
85,
130,
27,
1936,
13,
5,
1410,
4235,
93,
18,
10404,
6,
17,
31,
101,
14,
882,
16,
4387,
1267,
569,
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... |
Process ID in Java
===
How do I get the id of my Java process? I know there are several platform-dependent hacks, but I'm after a generic solution. | 0 | [
2,
953,
4924,
19,
8247,
800,
3726,
3726,
184,
107,
31,
164,
14,
4924,
16,
51,
8247,
953,
60,
31,
143,
80,
50,
238,
2452,
8,
19374,
11835,
18,
15,
47,
31,
22,
79,
75,
21,
12733,
4295,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
VB.NET form Height Question
===
I have a VB6.0 project and I want to convert it in VB.Net.
In my VB6.0 application some of the MDI Child form’s height is 17000 and width is 13000. Now I want to set the same form size in VB.Net forms, but it allows maximum form width = 1036, height = 780 for resolution 1024x768.... | 0 | [
2,
13,
20468,
9,
2328,
505,
2947,
1301,
800,
3726,
3726,
31,
57,
21,
13,
20468,
379,
9,
387,
669,
17,
31,
259,
20,
8406,
32,
19,
13,
20468,
9,
2328,
9,
19,
51,
13,
20468,
379,
9,
387,
3010,
109,
16,
14,
8138,
49,
850,
505,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 logging is good logging for your app?
===
So we've discussed logging in passing at my place of work and I was wondering if some of you guys here could give me some ideas of your approaches?
Typically our scenario is, no logging really at all, and mostly .NET apps, winforms/WPF clients talking through web servi... | 0 | [
2,
98,
13,
13919,
25,
254,
13,
13919,
26,
154,
4865,
60,
800,
3726,
3726,
86,
95,
22,
195,
6078,
13,
13919,
19,
2848,
35,
51,
209,
16,
170,
17,
31,
23,
5712,
100,
109,
16,
42,
2776,
235,
110,
590,
55,
109,
3478,
16,
154,
750... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
P/Invoke in Mono
===
What's the current status of Mono's Platform Invoke implementation on Linux? And on Solaris? | 0 | [
2,
351,
118,
108,
2625,
1048,
19,
4129,
800,
3726,
3726,
98,
22,
18,
14,
866,
1782,
16,
4129,
22,
18,
2452,
28371,
6123,
27,
13024,
60,
17,
27,
4535,
403,
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... |
Comparison of Lat, Long Coordinates
===
I have a list of more than 15 thousand latitude and longitude coordinates. Given any X,Y coordinates, what is the fastest way to find the closest coordinates on the list?
| 0 | [
2,
6050,
16,
14303,
15,
175,
13714,
800,
3726,
3726,
31,
57,
21,
968,
16,
91,
119,
357,
2996,
16337,
17,
22291,
13714,
9,
504,
186,
993,
15,
93,
13714,
15,
98,
25,
14,
7518,
161,
20,
477,
14,
6993,
13714,
27,
14,
968,
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,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do you enforce or maintain the quality of the bug reports in your bug tracker?
===
High-quality bug reports are essential for effective bug tracking - in an ideal world all bug reports would contain essential information such as which version of the software it affects and a step-by-step description on how to repr... | 0 | [
2,
184,
107,
42,
16525,
54,
4027,
14,
2190,
16,
14,
6256,
2813,
19,
154,
6256,
792,
106,
60,
800,
3726,
3726,
183,
8,
15583,
6256,
2813,
50,
5832,
26,
3140,
6256,
10353,
13,
8,
19,
40,
5628,
126,
65,
6256,
2813,
83,
3717,
5832,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Base64 Encoding Image
===
I am building an open search add-on for Firefox/IE and the image needs to be Base64 Encoded so how can I base 64 encode the favicon I have?
I am only familiar with PHP | 0 | [
2,
1000,
3470,
19608,
1961,
800,
3726,
3726,
31,
589,
353,
40,
368,
2122,
3547,
8,
218,
26,
535,
18219,
118,
660,
17,
14,
1961,
2274,
20,
44,
1000,
3470,
13665,
86,
184,
92,
31,
1000,
4384,
20523,
14,
1399,
6199,
218,
31,
57,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Grid controls compatible with .NET and Mono?
===
Do you know any grid control compatible with .NET and Mono?
DataGridView seems to be quite buggy on Mono, and GTK# controls depends on GTK+ so you need to install it in windows machines where, usually, it's not present. | 0 | [
2,
7354,
8671,
14961,
29,
13,
9,
2328,
17,
4129,
60,
800,
3726,
3726,
107,
42,
143,
186,
7354,
569,
14961,
29,
13,
9,
2328,
17,
4129,
60,
1054,
16375,
4725,
2206,
20,
44,
1450,
6256,
2687,
27,
4129,
15,
17,
9509,
197,
5910,
8671... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 play compressed sound files in C# in a portable way?
===
Is there a portable, not patent-restricted way to play compressed sound files in C# / .Net? <a href="http://msdn.microsoft.com/en-us/library/system.media.soundplayer.aspx">System.Media.SoundPlayer</a> can handle only WAV, but those are typically to big... | 0 | [
2,
184,
92,
31,
418,
18472,
646,
6488,
19,
272,
5910,
19,
21,
13469,
161,
60,
800,
3726,
3726,
25,
80,
21,
13469,
15,
52,
6316,
8,
99,
27245,
69,
161,
20,
418,
18472,
646,
6488,
19,
272,
5910,
13,
118,
13,
9,
2328,
60,
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 do I autorun an application in a terminal in Ubuntu?
===
I've created a few `autorun` script files on various USB devices that run `bash` scripts when they mount. These scripts run "in the background", how do I get them to run in a terminal window? (Like the "Application in Terminal" gnome Launcher type.) | 0 | [
2,
184,
107,
31,
3108,
3169,
40,
3010,
19,
21,
3855,
19,
287,
12968,
2473,
60,
800,
3726,
3726,
31,
22,
195,
679,
21,
310,
13,
1,
18042,
3169,
1,
3884,
6488,
27,
617,
182,
220,
4690,
30,
485,
13,
1,
969,
1635,
1,
17505,
76,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
3rd Party UI components for .net Compact Framework?
===
I have a .Net compact framework application with a frankly unimpressive UI.
My win32 app uses Dev Express components and looks great, but I can't find anything similar for the compact framework.
Can anyone recommend components that will jazz up my UI?
Do... | 0 | [
2,
203,
897,
346,
13,
5661,
5090,
26,
13,
9,
2328,
8285,
6596,
60,
800,
3726,
3726,
31,
57,
21,
13,
9,
2328,
8285,
6596,
3010,
29,
21,
22662,
367,
1660,
5890,
1284,
13,
5661,
9,
51,
628,
3125,
4865,
2027,
9664,
2999,
5090,
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... |
In .NET, how do I launch a file with command line arguments (without knowing the location of the exe)?
===
Here's the situation: I am trying to launch an application, but the location of the .exe isn't known to me. Now, if the file extension is registered (in Windows), I can do something like:
Process.Start("S... | 0 | [
2,
19,
13,
9,
2328,
15,
184,
107,
31,
3394,
21,
3893,
29,
1202,
293,
10553,
13,
5,
14506,
2506,
14,
1474,
16,
14,
1396,
62,
6,
60,
800,
3726,
3726,
235,
22,
18,
14,
1858,
45,
31,
589,
749,
20,
3394,
40,
3010,
15,
47,
14,
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... |
Are there any "nice to program" GUI toolkits for Python?
===
I've played around with GTK, TK, wxPython, Cocoa, curses and others. They are are fairly horrible to use.. GTK/TK/wx/curses all seem to basically be direct-ports of the appropriate C libraries, and Cocoa basically mandates using both PyObjC and Interface Bui... | 0 | [
2,
50,
80,
186,
13,
7,
8862,
20,
625,
7,
9457,
5607,
13703,
18,
26,
20059,
60,
800,
3726,
3726,
31,
22,
195,
257,
140,
29,
9509,
197,
15,
13,
38,
197,
15,
619,
396,
6448,
11570,
15,
24507,
15,
7144,
18,
17,
654,
9,
59,
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... |
Elegant Snippets of F#
===
I'm currently learning F# quite intensively. I really love it as a language, it just sort of 'feels' right and seems to allow you to produce some succint elegant code.
I'm interested in finding some really nice 'wow factor' snippets of F# code which demonstate the elegence of the language... | 0 | [
2,
11614,
13,
29061,
18,
16,
398,
5910,
800,
3726,
3726,
31,
22,
79,
871,
2477,
398,
5910,
1450,
13633,
102,
9,
31,
510,
339,
32,
28,
21,
816,
15,
32,
114,
2058,
16,
13,
22,
16963,
18,
22,
193,
17,
2206,
20,
1655,
42,
20,
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... |
Logging in a PHP webapp
===
I want to keep logs of some things that people do in my app, in some cases so that it can be undone if needed.
Is it best to store such logs in a file or a database? I'm completely at a loss as to what the pros and cons are except that it's another table to setup.
Is there a third (or... | 0 | [
2,
13,
13919,
19,
21,
13,
26120,
2741,
7753,
800,
3726,
3726,
31,
259,
20,
643,
18893,
16,
109,
564,
30,
148,
107,
19,
51,
4865,
15,
19,
109,
1871,
86,
30,
32,
92,
44,
27482,
100,
851,
9,
25,
32,
246,
20,
1718,
145,
18893,
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... |
Django Templates and variable attributes.
===
I'm using Google App Engine and Django Templates.<br>
I have a table that I want to display the objects look something like:<br>
Object Result:
Items = [item1,item2]
Users = [{name='username',item1=3,item2=4},..]
The django template is:
... | 0 | [
2,
3857,
14541,
22894,
18,
17,
7612,
13422,
9,
800,
3726,
3726,
31,
22,
79,
568,
8144,
4865,
1406,
17,
3857,
14541,
22894,
18,
9,
1,
5145,
1,
31,
57,
21,
859,
30,
31,
259,
20,
3042,
14,
3916,
361,
301,
101,
45,
1,
5145,
1,
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... |
I don't understand std::tr1::unordered_map
===
I need an associative container that makes me index a certain object through a string, but that also keeps the order of insertion, so I can look for a specific object by its name or just iterate on it and retrieve objects in the same order I inserted them.
I think this... | 0 | [
2,
31,
221,
22,
38,
1369,
354,
43,
45,
45,
6384,
165,
45,
45,
1020,
7861,
69,
1,
15022,
800,
3726,
3726,
31,
376,
40,
28,
18,
16325,
3366,
12147,
30,
1364,
55,
4348,
21,
1200,
3095,
120,
21,
3724,
15,
47,
30,
67,
8968,
14,
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... |
How do you full-text search multiple criteria on left-joined tables in SQL Server?
===
I have a query that originally looks like this:
select c.Id, c.Name, c.CountryCode, c.CustomerNumber, cacc.AccountNumber, ca.Line1, ca.CityName, ca.PostalCode
from dbo.Customer as c
left join dbo.CustomerAddress as ... | 0 | [
2,
184,
107,
42,
503,
8,
11969,
2122,
1886,
9157,
27,
225,
8,
22922,
7484,
19,
4444,
255,
8128,
60,
800,
3726,
3726,
31,
57,
21,
25597,
30,
912,
1879,
101,
48,
45,
5407,
272,
9,
1340,
15,
272,
9,
7259,
15,
272,
9,
10741,
9375,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
add preddefined data for typedef enums in c
===
What is the best approach to define additional data for typedef enums in C?
Example:
typedef enum {
kVizsla = 0,
kTerrier = 3,
kYellowLab = 10
} DogType;
Now I would like to define names for each, for example kVizsla should be "vi... | 0 | [
2,
3547,
782,
43,
13439,
1054,
26,
1001,
13862,
1957,
723,
18,
19,
272,
800,
3726,
3726,
98,
25,
14,
246,
2141,
20,
9267,
1351,
1054,
26,
1001,
13862,
1957,
723,
18,
19,
272,
60,
823,
45,
1001,
13862,
1957,
723,
13,
1,
13571,
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... |
Embed Images in emails created using SQL Server Database Mail
===
I'm working on an email solution in SQL Server ONLY that will use Database Mail to send out HTML formatted emails. The catch is that the images in the HTML need to be embedded in the outgoing email. This wouldn't be a problem if I were using a .net app... | 0 | [
2,
11911,
69,
3502,
19,
8517,
18,
679,
568,
4444,
255,
8128,
6018,
4216,
800,
3726,
3726,
31,
22,
79,
638,
27,
40,
8517,
4295,
19,
4444,
255,
8128,
104,
30,
129,
275,
6018,
4216,
20,
2660,
70,
13,
15895,
13,
29850,
8517,
18,
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... |
Rollbacking bad changes with svn in Eclipse
===
Let's say I have committed some bad changes to Subversion repository. Then I commit good changes, that I want to keep.
What would be easiest way to roll back those bad changes in Eclipse, and keep the good changes? Assuming that files relating to bad changes are not s... | 0 | [
2,
3001,
1958,
68,
896,
1693,
29,
13,
18,
16578,
19,
11652,
800,
3726,
3726,
408,
22,
18,
395,
31,
57,
4164,
109,
896,
1693,
20,
972,
10898,
24869,
9,
94,
31,
9686,
254,
1693,
15,
30,
31,
259,
20,
643,
9,
98,
83,
44,
27237,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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-like structures in Python
===
Is there a way to conveniently define a C-like structure in Python? I'm tired of writing stuff like:
class MyStruct():
def __init__(self, field1, field2, field3)
self.field1 = field1
self.field2 = field2
self.field3 = field3
(Int... | 0 | [
2,
272,
8,
1403,
3815,
19,
20059,
800,
3726,
3726,
25,
80,
21,
161,
20,
12845,
102,
9267,
21,
272,
8,
1403,
1411,
19,
20059,
60,
31,
22,
79,
4117,
16,
1174,
3217,
101,
45,
718,
51,
10346,
5,
6,
45,
6312,
13,
1,
108,
242,
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... |
Altering database tables in Django
===
I'm considering using Django for a project I'm starting (fyi, a browser-based game) and one of the features I'm liking the most is using `syncdb` to automatically create the database tables based on the Django models I define (a feature that I can't seem to find in any other fram... | 0 | [
2,
7835,
68,
6018,
7484,
19,
3857,
14541,
800,
3726,
3726,
31,
22,
79,
5154,
568,
3857,
14541,
26,
21,
669,
31,
22,
79,
1422,
13,
5,
9596,
49,
15,
21,
16495,
8,
1281,
250,
6,
17,
53,
16,
14,
967,
31,
22,
79,
19007,
14,
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... |
How do I execute a file in Cygwin?
===
I created a C file in Eclipse on Windows and then used Cygwin to navigate to the directory. I called gcc on the C source file and a.exe was produced. How do I execute a.exe in the Cygwin shell? | 0 | [
2,
184,
107,
31,
15644,
21,
3893,
19,
6728,
263,
4181,
60,
800,
3726,
3726,
31,
679,
21,
272,
3893,
19,
11652,
27,
1936,
17,
94,
147,
6728,
263,
4181,
20,
20782,
20,
14,
16755,
9,
31,
227,
489,
3384,
27,
14,
272,
1267,
3893,
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... |
SQL Server 2005 Auto Updated DateTime Column - LastUpdated
===
I have a table defined (see code snippet below). How can I add a constraint or whatever so that the LastUpdate column is automatically updated anytime the row is changed?
CREATE TABLE dbo.Profiles
(
UserName ... | 0 | [
2,
4444,
255,
8128,
812,
3108,
6372,
1231,
891,
4698,
13,
8,
236,
576,
43,
1669,
800,
3726,
3726,
31,
57,
21,
859,
2811,
13,
5,
1798,
1797,
13,
29061,
1021,
6,
9,
184,
92,
31,
3547,
21,
28804,
54,
2099,
86,
30,
14,
236,
576,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 .NET exception not caught by try/catch block?
===
I'm working on a project using the [ANTLR][1] parser library for C#. I've built a grammar to parse some text and it works well. However, when the parser comes across an illegal or unexpected token, it throws one of many exceptions. The problem is that in some... | 0 | [
2,
483,
25,
13,
9,
2328,
5391,
52,
1383,
34,
1131,
118,
18208,
1921,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
669,
568,
14,
636,
1830,
12988,
500,
2558,
165,
500,
2017,
4104,
1248,
26,
272,
5910,
9,
31,
22,
195,
392,
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... |
Deleting messages from Exchange IMAP mailbox on iPhone
===
I have a secondary Exchange mailbox configured on my iPhone using IMAP. This all appears to work fine except when a message is deleted on the phone, it still shows normally in Outlook. It does not seem to matter what I set the "remove deleted messages" setting... | 0 | [
2,
121,
1336,
68,
7561,
37,
1950,
31,
15022,
4216,
5309,
27,
21024,
800,
3726,
3726,
31,
57,
21,
2277,
1950,
4216,
5309,
28895,
27,
51,
21024,
568,
31,
15022,
9,
48,
65,
1780,
20,
170,
1123,
1613,
76,
21,
2802,
25,
19584,
27,
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... |
Single Best hardwear upgrade for the money?
===
If you could upgrade one piece of hardware on your coding machine what would it be? | 0 | [
2,
345,
246,
552,
13691,
9483,
26,
14,
875,
60,
800,
3726,
3726,
100,
42,
110,
9483,
53,
1855,
16,
7610,
27,
154,
13,
15458,
1940,
98,
83,
32,
44,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to assign a method's output to a textbox value without code behind
===
How do I assign a method's output to a textbox value without code behind?
<%@ Page Language="VB" %>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<scri... | 0 | [
2,
184,
20,
13952,
21,
2109,
22,
18,
5196,
20,
21,
1854,
5309,
1923,
366,
1797,
439,
800,
3726,
3726,
184,
107,
31,
13952,
21,
2109,
22,
18,
5196,
20,
21,
1854,
5309,
1923,
366,
1797,
439,
60,
13,
1,
11881,
1,
2478,
816,
3726,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Yaws uses old config file
===
I'm developing a web app on Yaws 1.65 (installed through apt) running on Debian etch on a VPS with UML. Whenever I do /etc/init.d/yaws restart or a stop/start, it initializes according to an old version of the config file (/etc/yaws/yaws.conf).
I know this because I changed the docroo... | 0 | [
2,
2167,
10268,
2027,
315,
13,
14093,
2816,
3893,
800,
3726,
3726,
31,
22,
79,
3561,
21,
2741,
4865,
27,
2167,
10268,
137,
9,
3577,
13,
5,
108,
21300,
69,
120,
21,
4417,
6,
946,
27,
121,
10035,
13,
19913,
27,
21,
13,
10924,
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... |
Templates spread across multiple files
===
C++ seems to be rather grouchy when declaring templates across multiple files. More specifically, when working with templated classes, the linker expect all method definitions for the class in a single compiler object file. When you take into account headers, other declaratio... | 0 | [
2,
22894,
18,
1789,
464,
1886,
6488,
800,
3726,
3726,
272,
20512,
2206,
20,
44,
864,
3452,
6396,
93,
76,
15594,
22894,
18,
464,
1886,
6488,
9,
91,
3524,
15,
76,
638,
29,
22894,
43,
2684,
15,
14,
3508,
106,
4186,
65,
2109,
18544,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 experience with Sphinx speech recognition?
===
Has anyone used the [Sphinx][1] speech recognition stack to build IVR applications? I am looking for open source alternatives to the expensive and somewhat limiting choices from MSFT and others. I have not been able to find a comprehensive package that ties ... | 0 | [
2,
1276,
57,
1496,
29,
27274,
2974,
3514,
60,
800,
3726,
3726,
63,
1276,
147,
14,
636,
18,
19931,
396,
500,
2558,
165,
500,
2974,
3514,
7566,
20,
1895,
31,
6938,
3767,
60,
31,
589,
699,
26,
368,
1267,
2676,
18,
20,
14,
5381,
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... |
What's a good open source VoiceXML implementation?
===
I am trying to find out if it's possible to build a complete IVR application by cobbling together parts from open source projects. Is anyone using a non-commercial VoiceXML implementation to build speech-enabled systems? | 0 | [
2,
98,
22,
18,
21,
254,
368,
1267,
430,
396,
8184,
6123,
60,
800,
3726,
3726,
31,
589,
749,
20,
477,
70,
100,
32,
22,
18,
938,
20,
1895,
21,
1279,
31,
6938,
3010,
34,
16257,
802,
429,
1341,
37,
368,
1267,
2314,
9,
25,
1276,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 replacement of Controller.ReadFromRequest in ASP.NET MVC?
===
I am attempting to update a project from ASP.NET MVC Preview 3 to Preview 5 and it seems that Controller.ReadFromRequest(string key) has been removed from the Controller class. Does anyone know of any alternatives to retrieving information based... | 0 | [
2,
98,
25,
14,
4610,
16,
9919,
9,
10647,
2665,
99,
10351,
19,
28,
306,
9,
2328,
307,
8990,
60,
800,
3726,
3726,
31,
589,
6314,
20,
11100,
21,
669,
37,
28,
306,
9,
2328,
307,
8990,
16121,
203,
20,
16121,
331,
17,
32,
2206,
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... |
Finding out the source of an exception in C++ after it is caught?
===
I'm looking for an answer in MS VC++.
When debugging a large C++ application, which unfortunately has a very extensive usage of C++ exceptions. Sometimes I catch an exception a little later than I actually want.
Example in pseudo code:
... | 0 | [
2,
3007,
70,
14,
1267,
16,
40,
5391,
19,
272,
20512,
75,
32,
25,
1383,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
40,
1623,
19,
4235,
13,
8990,
20512,
9,
76,
121,
16254,
2762,
21,
370,
272,
20512,
3010,
15,
56,
6200,
63,
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... |
PHP mail using Gmail
===
In my PHP webapp, I want to be notified via email whenever certain errors occur. I'd like to use my Gmail account for sending these. How could this be done? | 0 | [
2,
13,
26120,
4216,
568,
489,
8079,
800,
3726,
3726,
19,
51,
13,
26120,
2741,
7753,
15,
31,
259,
20,
44,
22904,
1197,
8517,
6634,
1200,
11908,
3744,
9,
31,
22,
43,
101,
20,
275,
51,
489,
8079,
2176,
26,
4907,
158,
9,
184,
110,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
How to Throw an exception in a using block with .NET 2.0?
===
I'm trying to leverage the using block more and more these days when I have an object that implements IDisposable but one thing I have not figured out is how to throw and exception as I would in a normal try/catch ... any code samples to point me in the rig... | 0 | [
2,
184,
20,
3814,
40,
5391,
19,
21,
568,
1921,
29,
13,
9,
2328,
172,
9,
387,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
19414,
14,
568,
1921,
91,
17,
91,
158,
509,
76,
31,
57,
40,
3095,
30,
8713,
18,
13,
19405,
12551,
579,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 set the name of a window in ROR?
===
How do I "name" a browser window in ROR, such that I can open a page in it later, from another (popup) window (using the target="name" html parameter) | 0 | [
2,
184,
107,
31,
309,
14,
204,
16,
21,
1463,
19,
761,
248,
60,
800,
3726,
3726,
184,
107,
31,
13,
7,
7259,
7,
21,
16495,
1463,
19,
761,
248,
15,
145,
30,
31,
92,
368,
21,
2478,
19,
32,
138,
15,
37,
226,
13,
5,
6057,
576,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 are some alternative bitset data structures?
===
I have an information retrieval application that tracks bit sets with sizes on the order of 10s of millions. The number of "set" bits in the set varies widely, from none to all. Currently, I'm simply setting bits in an array (`java.util.BitSet`), so each bit set ta... | 0 | [
2,
98,
50,
109,
2676,
1142,
3554,
1054,
3815,
60,
800,
3726,
3726,
31,
57,
40,
676,
28419,
3010,
30,
1633,
1142,
3415,
29,
13403,
27,
14,
389,
16,
332,
18,
16,
11999,
9,
14,
234,
16,
13,
7,
3554,
7,
10181,
19,
14,
309,
9803,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 controls in WPF to fill available space?
===
Didn't get a reply to this on the MSDN WPF forum, so I thought I'd try here.
Some WPF controls - like the button - seem to happily consume all the availible space in its' container if you don't specify the height it is to have.
And some - like the ones I ne... | 0 | [
2,
184,
20,
164,
8671,
19,
619,
7721,
20,
3509,
904,
726,
60,
800,
3726,
3726,
223,
22,
38,
164,
21,
6504,
20,
48,
27,
14,
4235,
43,
103,
619,
7721,
5691,
15,
86,
31,
289,
31,
22,
43,
1131,
235,
9,
109,
619,
7721,
8671,
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... |
Quoting command-line arguments in shell scripts
===
The following shell script takes a list of arguments, turns Unix paths into WINE/Windows paths and invokes the given executable under WINE.
#! /bin/sh
if test "${1+set}" != "set"
then
echo "Usage; winewrap EXEC [ARGS...]"
exit 1
... | 0 | [
2,
28146,
1202,
8,
1143,
10553,
19,
3593,
17505,
800,
3726,
3726,
14,
249,
3593,
3884,
1384,
21,
968,
16,
10553,
15,
2844,
22540,
12074,
77,
2667,
118,
27508,
18,
12074,
17,
28371,
18,
14,
504,
1396,
17194,
5924,
131,
2667,
9,
6926,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Variable Holding data in a while statement
===
I know I must be missing something small but in a while statement how does the variable hold the data when it finishes the first pass and goes into the second pass. | 0 | [
2,
7612,
1337,
1054,
19,
21,
133,
3331,
800,
3726,
3726,
31,
143,
31,
491,
44,
2863,
301,
284,
47,
19,
21,
133,
3331,
184,
630,
14,
7612,
1027,
14,
1054,
76,
32,
13625,
14,
64,
1477,
17,
1852,
77,
14,
153,
1477,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What is the most efficient way to keep track of a specific character's index in a string?
===
Take the following string as an example:
"The quick brown fox"
Right now the q in quick is at index 4 of the string (starting at 0) and the f in fox is at index 16. Now lets say the user enters some more text into t... | 0 | [
2,
98,
25,
14,
127,
8243,
161,
20,
643,
792,
16,
21,
1903,
925,
22,
18,
4348,
19,
21,
3724,
60,
800,
3726,
3726,
247,
14,
249,
3724,
28,
40,
823,
45,
13,
7,
124,
2231,
886,
2385,
7,
193,
130,
14,
2593,
19,
2231,
25,
35,
43... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 recommended VC++ settings for better PDB analysis on release builds
===
Are there any VC++ settings I should know about to generate better PDB files that contain more information?
I have a crash dump analysis system in place based on the project [crashrpt][1].
Also, my production build server has the source... | 0 | [
2,
186,
5773,
13,
8990,
20512,
12410,
26,
574,
351,
9007,
2495,
27,
830,
1895,
18,
800,
3726,
3726,
50,
80,
186,
13,
8990,
20512,
12410,
31,
378,
143,
88,
20,
7920,
574,
351,
9007,
6488,
30,
3717,
91,
676,
60,
31,
57,
21,
4597,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 are some real life examples of Design Patterns used in software
===
I'm reading through head first design patterns at the moment and while the book is excellent I also would like to see how these are actually used in the real world.
If you know of a good example of design pattern usage (preferably in a OSS pro... | 0 | [
2,
98,
50,
109,
683,
201,
3770,
16,
704,
6282,
147,
19,
2306,
800,
3726,
3726,
31,
22,
79,
1876,
120,
157,
64,
704,
6282,
35,
14,
688,
17,
133,
14,
360,
25,
5977,
31,
67,
83,
101,
20,
196,
184,
158,
50,
1121,
147,
19,
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... |
How do I sort a list of strings in Python?
===
What is the best way of creating an alphabetically sorted list in Python? | 0 | [
2,
184,
107,
31,
2058,
21,
968,
16,
7887,
19,
20059,
60,
800,
3726,
3726,
98,
25,
14,
246,
161,
16,
2936,
40,
27169,
102,
22554,
968,
19,
20059,
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... | [
1,
1,
1,
1,
1,
1,
1,
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... |
How do you make a post request into a new browser tab using JavaScript / XUL?
===
I'm trying to open a new browser tab with the results of a POST request. I'm trying to do so using a function containing the following code:
var windowManager = Components.classes["@mozilla.org/appshell/window-mediator;... | 0 | [
2,
184,
107,
42,
233,
21,
678,
3772,
77,
21,
78,
16495,
6523,
568,
8247,
8741,
13,
118,
993,
1287,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
368,
21,
78,
16495,
6523,
29,
14,
1736,
16,
21,
678,
3772,
9,
31,
22,
79,
749,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you unsubscribe from a ubiquity command
===
I can't seem to find details on how to unsubscribe from ubiquity commands. The command list page only seems to have information about the installed commands and there are no links to deleting them. Am I missing something? | 0 | [
2,
184,
107,
42,
367,
20330,
37,
21,
13,
12439,
3003,
1084,
1202,
800,
3726,
3726,
31,
92,
22,
38,
2260,
20,
477,
3289,
27,
184,
20,
367,
20330,
37,
13,
12439,
3003,
1084,
14294,
9,
14,
1202,
968,
2478,
104,
2206,
20,
57,
676,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 expensive is ST_GeomFromText
===
In postgis, is the "ST_GeomFromText" call very expensive? I ask mostly because I have a frequently called query that attempts to find the point that is nearest another point that matches some criteria, and which is also within a certain distance of that other point, and the way I ... | 0 | [
2,
184,
5381,
25,
354,
1,
834,
2636,
2665,
11969,
800,
3726,
3726,
19,
678,
12469,
15,
25,
14,
13,
7,
384,
1,
834,
2636,
2665,
11969,
7,
645,
253,
5381,
60,
31,
1349,
1555,
185,
31,
57,
21,
3086,
227,
25597,
30,
3265,
20,
477,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Replacing the nth instance of a regex match in Javascript
===
I'm trying to write a regex function that will identify and replace a single instance of a match within a string without affecting the other instances. For example, I have this string:
12||34||56
I want to replace the second set of pipes with ampersa... | 0 | [
2,
5496,
14,
13,
103,
96,
4851,
16,
21,
7953,
1706,
730,
19,
8247,
8741,
800,
3726,
3726,
31,
22,
79,
749,
20,
2757,
21,
7953,
1706,
1990,
30,
129,
5808,
17,
3934,
21,
345,
4851,
16,
21,
730,
363,
21,
3724,
366,
13808,
14,
89,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 Versioning Tools to use for Photoshop/Illustrator and related binary files?
===
I previously asked about Version Cue 3 vs Subversion. I think this is a better question and someone suggested [http://www.gridironsoftware.com/Flow/][1] I hope this question will allow others to join in and suggest other tools or give... | 0 | [
2,
246,
615,
68,
4672,
20,
275,
26,
7064,
5347,
118,
13898,
1939,
2153,
17,
1597,
14171,
6488,
60,
800,
3726,
3726,
31,
1343,
411,
88,
615,
10963,
203,
4611,
972,
10898,
9,
31,
277,
48,
25,
21,
574,
1301,
17,
737,
2347,
636,
211... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 we do to prepare for 2038?
===
I would like to think that some of the software I'm writing today will be used in 30 years. But I am also aware that a lot of it is based upon the UNIX tradition of exposing time as the number of seconds since 1970.
#include <stdio.h>
#include <time.h>
#inclu... | 0 | [
2,
98,
378,
95,
107,
20,
5723,
26,
434,
3665,
60,
800,
3726,
3726,
31,
83,
101,
20,
277,
30,
109,
16,
14,
2306,
31,
22,
79,
1174,
786,
129,
44,
147,
19,
712,
122,
9,
47,
31,
589,
67,
3854,
30,
21,
865,
16,
32,
25,
432,
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... |
Dealing with circular dependencies in OCaml
===
I'm writing an interpreter for an experimental language. Three of the main constructs of the language are definitions, statements, and expressions. Definitions can contain statements and expressions, statements can contain definitions and expressions, and one kind of exp... | 0 | [
2,
5746,
29,
8155,
29411,
19,
13,
14977,
8184,
800,
3726,
3726,
31,
22,
79,
1174,
40,
19336,
26,
40,
5174,
816,
9,
132,
16,
14,
407,
6960,
18,
16,
14,
816,
50,
18544,
15,
9015,
15,
17,
13832,
9,
18544,
92,
3717,
9015,
17,
1383... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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/expand my email regex
===
I'm really not confident with Regex, I know some basic syntax but not enough to keep me happy.
I'm trying to build a regular expression to check if an email is valid. So far here's what I've got:
[A-Za-z0-9._-]+@[A-Za-z0-9]+.[A-Za-z.]+
It needs to take account of periods in ... | 0 | [
2,
1289,
118,
6899,
290,
51,
8517,
7953,
1706,
800,
3726,
3726,
31,
22,
79,
510,
52,
9019,
29,
7953,
1706,
15,
31,
143,
109,
2125,
22649,
47,
52,
511,
20,
643,
55,
1700,
9,
31,
22,
79,
749,
20,
1895,
21,
1290,
1803,
20,
2631,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 much should one DataSet represent?
===
How much should one DataSet represent? Using the example of an ordering system: While showing your order I also show a list of items similar to one of yours as well as a list of our most popular items.
While your items are tangled in a web of relationships involving you and... | 0 | [
2,
184,
212,
378,
53,
1054,
3554,
3501,
60,
800,
3726,
3726,
184,
212,
378,
53,
1054,
3554,
3501,
60,
568,
14,
823,
16,
40,
15775,
329,
45,
133,
3187,
154,
389,
31,
67,
298,
21,
968,
16,
3755,
835,
20,
53,
16,
154,
18,
28,
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... |
What makes a good website for an open source project?
===
(I'd like to apologize because this IS a somewhat subjective question, but it's one that I'd like to get some ideas on.)
So, an open source project I'm working on is working on redesigning its website. This kind of got me thinking: what exactly is it that ... | 0 | [
2,
98,
1364,
21,
254,
2271,
26,
40,
368,
1267,
669,
60,
800,
3726,
3726,
13,
5,
49,
22,
43,
101,
20,
12059,
185,
48,
25,
21,
4131,
22835,
1301,
15,
47,
32,
22,
18,
53,
30,
31,
22,
43,
101,
20,
164,
109,
3478,
27,
9,
6,
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... |
What is Lazy Loading?
===
What is Lazy Loading? | 0 | [
2,
98,
25,
16792,
12797,
60,
800,
3726,
3726,
98,
25,
16792,
12797,
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,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
F# language - hints for newbie
===
Looks like here in StackOveflow there is a group of **F#** enthusiasts.
I'd like to know better this language, so, apart from the [functional programming theory][1], can you point me to the better starting points to start using the F# language? I mean, tutorials, how-tos, but fir... | 4 | [
2,
398,
5910,
816,
13,
8,
6382,
18,
26,
78,
5893,
800,
3726,
3726,
1879,
101,
235,
19,
7566,
111,
195,
9990,
80,
25,
21,
214,
16,
13,
1409,
410,
5910,
1409,
17821,
18,
9,
31,
22,
43,
101,
20,
143,
574,
48,
816,
15,
86,
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... |
What's the answer to this Microsoft PDC challenge?
===
In [today's channel9.msdn.com video][1], the PDC guys posted a challenge to decipher this code:
2973853263233233753482843823642933243283
6434928432937228939232737732732535234532
9335283373377282333349287338449365335325
32834437832432636737629... | 0 | [
2,
98,
22,
18,
14,
1623,
20,
48,
7099,
351,
7201,
2404,
60,
800,
3726,
3726,
19,
636,
15260,
22,
18,
1318,
518,
9,
79,
18,
43,
103,
9,
960,
763,
500,
2558,
165,
500,
15,
14,
351,
7201,
2776,
6054,
21,
2404,
20,
25277,
48,
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... |
What is 'Currying'?
===
I've seen references to curried functions in several articles and blogs but I can't find a good explanation (or at least one that makes sense!) | 0 | [
2,
98,
25,
13,
22,
4734,
622,
68,
22,
60,
800,
3726,
3726,
31,
22,
195,
541,
7231,
20,
20392,
43,
3719,
19,
238,
3376,
17,
8146,
18,
47,
31,
92,
22,
38,
477,
21,
254,
5764,
13,
5,
248,
35,
639,
53,
30,
1364,
1259,
187,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Alternative to HttpUtility for .NET 3.5 SP1 client framework?
===
It'd be really nice to target my Windows Forms app to the .NET 3.5 SP1 *client* framework. But, right now I'm using the `HttpUtility.HtmlDecode` and `HttpUtility.UrlDecode` functions, and the MSDN documentation doesn't point to any alternatives inside o... | 0 | [
2,
2676,
20,
7775,
14255,
856,
26,
13,
9,
2328,
203,
9,
264,
3782,
165,
6819,
6596,
60,
800,
3726,
3726,
32,
22,
43,
44,
510,
2210,
20,
2935,
51,
1936,
1997,
4865,
20,
14,
13,
9,
2328,
203,
9,
264,
3782,
165,
1637,
150,
18513,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
"The system cannot find the file specified" when invoking subprocess.Popen in python
===
I'm trying to use svnmerge.py to merge some files. Under the hood it uses python, and when I use it I get an error - "The system cannot find the file specified". Colleagues at work are running the same version of svnmerge.py, an... | 0 | [
2,
13,
7,
124,
329,
1967,
477,
14,
3893,
9931,
7,
76,
19,
2625,
1581,
972,
16835,
9,
6057,
219,
19,
20059,
800,
3726,
3726,
31,
22,
79,
749,
20,
275,
13,
18,
16578,
1263,
834,
9,
6448,
20,
12666,
109,
6488,
9,
131,
14,
6124,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 store user-tweakable configuration in app.config?
===
I know it is a good idea to store configuration data in app.config (e.g. database connection strings) instead of hardcoing it, even if I am writing an application just for myself. But is there a way to update the configuration data stored in app.config fr... | 0 | [
2,
184,
92,
31,
1718,
4155,
8,
38,
458,
1378,
579,
8091,
19,
4865,
9,
14093,
2816,
60,
800,
3726,
3726,
31,
143,
32,
25,
21,
254,
882,
20,
1718,
8091,
1054,
19,
4865,
9,
14093,
2816,
13,
5,
62,
9,
263,
9,
6018,
2760,
7887,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.