unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Make Browser Window Blink in Task Bar
===
How do I make a user's browser blink/flash/highlight in the task bar using JavaScript? For example, if I make an AJAX request every 10 seconds to see if the user has any new messages on the server, I want the user to know it right away, even if he is using another application ... | 0 | [
2,
233,
16495,
1463,
11718,
19,
3005,
748,
800,
3726,
3726,
184,
107,
31,
233,
21,
4155,
22,
18,
16495,
11718,
118,
26694,
118,
4542,
3130,
19,
14,
3005,
748,
568,
8247,
8741,
60,
26,
823,
15,
100,
31,
233,
40,
20624,
3772,
352,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
"Programming" for a 9 year old
===
I am looking for recommendations on a web site/software for providing an introduction to programming concepts for my 9 year old.
I remember using Logo/turtle graphics at a similar age and would love a simple self-contained web site that gave a number of step-by-step tutorials. ... | 4 | [
2,
13,
7,
19746,
3863,
7,
26,
21,
561,
159,
315,
800,
3726,
3726,
31,
589,
699,
26,
12121,
27,
21,
2741,
689,
118,
12980,
5011,
26,
2674,
40,
3445,
20,
3143,
8700,
26,
51,
561,
159,
315,
9,
31,
1518,
568,
6449,
118,
2517,
5866... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 maintain a project schedule?
===
One of the elements of the [Joel Test][1] is that you have an up to date schedule. How do you create and maintain your project schedule? How often is it updated?
[1]: http://www.joelonsoftware.com/articles/fog0000000043.html | 0 | [
2,
184,
107,
42,
4027,
21,
669,
4345,
60,
800,
3726,
3726,
53,
16,
14,
2065,
16,
14,
636,
1636,
532,
1289,
500,
2558,
165,
500,
25,
30,
42,
57,
40,
71,
20,
1231,
4345,
9,
184,
107,
42,
1600,
17,
4027,
154,
669,
4345,
60,
184... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Event handling in Dojo
===
Hello All: Apologies in advance for the appaling long post (and pretty applaing code, too).
Taking Jeff Atwood's [advice](http://www.codinghorror.com/blog/archives/001163.html), I decided to use a JavaScript library for the very basic to-do list application I'm writing. I picked the [Dojo... | 0 | [
2,
807,
7988,
19,
107,
1636,
800,
3726,
3726,
10975,
65,
45,
27101,
19,
3612,
26,
14,
13,
18303,
802,
175,
678,
13,
5,
290,
1772,
4865,
531,
68,
1797,
15,
266,
6,
9,
741,
3292,
35,
1208,
22,
18,
636,
1283,
18507,
500,
5,
21127... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to make Ruby or Python web sites to use multiple cores?
===
Even though [Python][1] and [Ruby][2] have one kernel thread per interpreter thread, they have a global interpreter lock (GIL) that is used to protect potentially shared data structures, so this inhibits multi-processor execution. Even though the portions... | 0 | [
2,
184,
20,
233,
10811,
54,
20059,
2741,
3259,
20,
275,
1886,
2884,
18,
60,
800,
3726,
3726,
166,
362,
636,
6448,
11570,
500,
2558,
165,
500,
17,
636,
1820,
779,
500,
2558,
135,
500,
57,
53,
17007,
9322,
416,
19336,
9322,
15,
59,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Caching MySQL queries
===
Is there a simple way to cache MySQL queries in PHP or failing that, is there a small class set that someone has written and made available that will do it? I can cache a whole page but that won't work as some data changes but some does not, I want to cache the part that does not. | 0 | [
2,
1658,
7192,
51,
18,
22402,
9386,
2829,
800,
3726,
3726,
25,
80,
21,
1935,
161,
20,
16522,
51,
18,
22402,
9386,
2829,
19,
13,
26120,
54,
7250,
30,
15,
25,
80,
21,
284,
718,
309,
30,
737,
63,
642,
17,
117,
904,
30,
129,
107,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 make an HTML page print in landscape when the user selects 'print'?
===
We generate web pages that should always be printed in landscape mode. Web browser print dialogs default to portrait, so for every print job the user has to manually select landscape. It's minor, but would be nice for the user if we can r... | 0 | [
2,
184,
107,
31,
233,
40,
13,
15895,
2478,
4793,
19,
4453,
76,
14,
4155,
5407,
18,
13,
22,
10299,
22,
60,
800,
3726,
3726,
95,
7920,
2741,
4434,
30,
378,
550,
44,
5317,
19,
4453,
3740,
9,
2741,
16495,
4793,
28223,
18,
12838,
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... |
What's the idiomatic way to do async socket programming in Delphi?
===
What is the normal way people writing network code in Delphi use Windows-style overlapped asynchronous socket I/O?
Here's my prior research into this question:
The [Indy][1] components seem entirely synchronous. On the other hand, while ScktC... | 0 | [
2,
98,
22,
18,
14,
28380,
12479,
161,
20,
107,
21,
9507,
150,
18482,
3143,
19,
23030,
60,
800,
3726,
3726,
98,
25,
14,
1826,
161,
148,
1174,
982,
1797,
19,
23030,
275,
1936,
8,
4381,
15406,
3631,
21,
16023,
1291,
18482,
31,
118,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# console program can't send fax when run as a scheduled task
===
I have a console program written in C# that I am using to send faxes. When I step through the program in Visual Studio it works fine. When I double click on the program in Windows Explorer it works fine. When I setup a Windows scheduled task to run ... | 0 | [
2,
272,
5910,
8650,
625,
92,
22,
38,
2660,
13,
18947,
76,
485,
28,
21,
3758,
3005,
800,
3726,
3726,
31,
57,
21,
8650,
625,
642,
19,
272,
5910,
30,
31,
589,
568,
20,
2660,
13,
18947,
160,
9,
76,
31,
1424,
120,
14,
625,
19,
34... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to get OS specific information in Java?
===
Specifically getting on Windows the "..\Documents & Settings/All Users,
the current users My Documents dirctory,
and basicaly any path that needs the front end to be dynamically derived based on the OS your software is running on. | 0 | [
2,
98,
25,
14,
246,
161,
20,
164,
13,
759,
1903,
676,
19,
8247,
60,
800,
3726,
3726,
3524,
1017,
27,
1936,
14,
13,
7,
9,
9,
1,
28132,
18,
279,
12410,
118,
1233,
3878,
15,
14,
866,
3878,
51,
4374,
926,
5453,
14599,
15,
17,
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... |
How do you remove a specific revision in the git history?
===
Suppose you git history looks like this:
1
2
3
4
5
Where 1-5 are separate revisions. You need to remove 3 while still keeping 1, 2, 4 and 5. How to do it?
Is there an efficient method when there are hundreds of revisions after the one to be del... | 0 | [
2,
184,
107,
42,
4681,
21,
1903,
11323,
19,
14,
13,
10404,
447,
60,
800,
3726,
3726,
5787,
42,
13,
10404,
447,
1879,
101,
48,
45,
137,
172,
203,
268,
331,
113,
137,
8,
264,
50,
1725,
11323,
18,
9,
42,
376,
20,
4681,
203,
133,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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# Preprocessor
===
While the C# spec does include a pre-processor and basic directives (#define, #if, etc), the language does not have the same flexible pre-processor found in languages such as C/C++. I believe the lack of such a flexible pre-processor was a design decision made by Anders Hejlsberg (although, unfortu... | 0 | [
2,
272,
5910,
782,
16835,
248,
800,
3726,
3726,
133,
14,
272,
5910,
12737,
630,
468,
21,
782,
8,
16835,
248,
17,
2125,
15626,
18,
13,
5,
5910,
546,
7509,
15,
6926,
821,
15,
2722,
6,
15,
14,
816,
630,
52,
57,
14,
205,
13568,
78... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where does "Change Management" end and "Project Failure" begin?
===
I got into a mini-argument with my boss recently regarding "project failure." After three years, our project to migrate a codebase to a new platform (a project I was on for 1.5 years, but my team lead was on for only a few months) went live. He, along... | 0 | [
2,
113,
630,
13,
7,
16229,
1097,
7,
241,
17,
13,
7,
21011,
2990,
7,
2348,
60,
800,
3726,
3726,
31,
330,
77,
21,
4236,
8,
512,
3073,
1130,
29,
51,
4054,
1989,
3467,
13,
7,
21011,
2990,
9,
7,
75,
132,
122,
15,
318,
669,
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... |
What's the best way to persist data in a Java Desktop Application?
===
I have a large tree of Java Objects in my Desktop Application and am trying to decide on the best way of persisting them as a file to the file system.
Some thoughts I've had were:
- **Roll my own serializer using DataOutputStream**: This wou... | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
22084,
1054,
19,
21,
8247,
17404,
3010,
60,
800,
3726,
3726,
31,
57,
21,
370,
1541,
16,
8247,
3916,
19,
51,
17404,
3010,
17,
589,
749,
20,
4073,
27,
14,
246,
161,
16,
22084,
68,
105,
28,
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... |
SQL Query for Logins
===
What is the SQL query to select all of the MSSQL Server's logins? | 0 | [
2,
4444,
255,
25597,
26,
2205,
17040,
800,
3726,
3726,
98,
25,
14,
4444,
255,
25597,
20,
5407,
65,
16,
14,
4235,
18,
22402,
8128,
22,
18,
2205,
17040,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 robustly, but minimally, distribute items across a peer-to-peer system
===
If one has a peer-to-peer system that can be queried, one would like to
- reduce the total number of queries across the network (by distributing "popular" items widely and "similar" items together)
- avoid excess storage at eac... | 0 | [
2,
184,
20,
15313,
102,
15,
47,
8663,
102,
15,
14751,
3755,
464,
21,
7617,
8,
262,
8,
1664,
106,
329,
800,
3726,
3726,
100,
53,
63,
21,
7617,
8,
262,
8,
1664,
106,
329,
30,
92,
44,
9386,
11942,
15,
53,
83,
101,
20,
13,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XCode equivalent of ' __asm int 3 / DebugBreak() / Halt ?
===
What's the instruction to cause a hard-break in XCode? For example under Visual Studio I could do '_asm int 3' or 'DebugBreak()'. Under some GCC implementations it's asm("break 0") or asm("trap").
I've tried various combos under XCode without any luck. (... | 0 | [
2,
993,
9375,
4602,
16,
13,
22,
13,
1,
472,
79,
19,
38,
203,
13,
118,
121,
16254,
12008,
5,
6,
13,
118,
7278,
13,
60,
800,
3726,
3726,
98,
22,
18,
14,
7304,
20,
1679,
21,
552,
8,
12008,
19,
993,
9375,
60,
26,
823,
131,
345... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a good way to use an OS-dependent font in Windows Forms?
===
I'd like to use Segoe UI 9 pt on Vista, and Tahoma 8 pt on Windows XP/etc. (Actually, I'd settle for Segoe UI on both, but my users probably don't have it installed.) But, these being quite different, they really screw up the layout of my forms. So.... | 0 | [
2,
25,
80,
21,
254,
161,
20,
275,
40,
13,
759,
8,
19374,
9978,
19,
1936,
1997,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
275,
13,
18,
8811,
62,
13,
5661,
561,
12923,
27,
13520,
15,
17,
13,
12515,
4955,
469,
12923,
27,
1936,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Checking the results of a Factory in a unit test
===
I have developed some classes with similar behavior, they all implement the same interface. I implemented a factory that creates the appropriate object and returns the interface. I am writing a unit test for the factory. All you get back is an interface to the ob... | 0 | [
2,
9886,
14,
1736,
16,
21,
3129,
19,
21,
1237,
1289,
800,
3726,
3726,
31,
57,
885,
109,
2684,
29,
835,
3257,
15,
59,
65,
8713,
14,
205,
6573,
9,
31,
6807,
21,
3129,
30,
9695,
14,
4593,
3095,
17,
4815,
14,
6573,
9,
31,
589,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you return the focus to the last used control after clicking a button in a winform app?
===
I'm working on a windows forms application (C#) where a user is entering data in a form. At any point while editing the data in the form the user can click one of the buttons on the form to perform certain actions. By ... | 0 | [
2,
184,
107,
42,
788,
14,
1776,
20,
14,
236,
147,
569,
75,
25590,
21,
5167,
19,
21,
628,
4190,
4865,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
1936,
1997,
3010,
13,
5,
150,
5910,
6,
113,
21,
4155,
25,
4604,
1054,
19,
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... |
What is the syntax for an inner join in linq to sql?
===
I'm writing a linq to sql statement & I'm just after the standard syntax for a normal inner join with an 'on' clause in C#.
ie how do you represent this in LINQ to SQL?:
SELECT * FROM table1
inner join table2 on table1.field table2.field | 0 | [
2,
98,
25,
14,
22649,
26,
40,
3754,
1865,
19,
6294,
1251,
20,
4444,
255,
60,
800,
3726,
3726,
31,
22,
79,
1174,
21,
6294,
1251,
20,
4444,
255,
3331,
279,
31,
22,
79,
114,
75,
14,
1236,
22649,
26,
21,
1826,
3754,
1865,
29,
40,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to deal with "java.lang.OutOfMemoryError: Java heap space" error (64MB heap size)
===
I am writing a client-side Swing application (graphical font designer) on Java 5. Recently, I am running into "java.lang.OutOfMemoryError: Java heap space" error because I am not being conservative on memory usage. The user can o... | 0 | [
2,
184,
20,
1183,
29,
13,
7,
1004,
1385,
9,
9949,
9,
1320,
1041,
790,
5171,
93,
29992,
45,
8247,
15414,
726,
7,
7019,
13,
5,
3470,
5024,
15414,
1072,
6,
800,
3726,
3726,
31,
589,
1174,
21,
6819,
8,
1416,
5587,
3010,
13,
5,
120... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Beyond GoF design patterns
===
Do you frequently use design patterns outside the [Gang of Four design patterns book][1]? If so, where did you pick them up from?
[1]: http://www.amazon.com/Design-Patterns-Object-Oriented-Addison-Wesley-Professional/dp/0201633612 | 0 | [
2,
1701,
162,
410,
704,
6282,
800,
3726,
3726,
107,
42,
3086,
275,
704,
6282,
719,
14,
636,
13019,
16,
222,
704,
6282,
360,
500,
2558,
165,
500,
60,
100,
86,
15,
113,
144,
42,
2036,
105,
71,
37,
60,
636,
165,
500,
45,
7775,
69... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Wordpress MediaWiki Cookie Integration
===
I have my Wordpress install and MediaWiki [sharing the same login information][1]. Unfortunately users need to log into both separately, but at least they use the same credentials.
What I would like to do is cause a successful log in on the Wordpress blog to also cause ... | 0 | [
2,
833,
5890,
941,
17375,
19980,
8078,
800,
3726,
3726,
31,
57,
51,
833,
5890,
16146,
17,
941,
17375,
636,
25213,
14,
205,
6738,
108,
676,
500,
2558,
165,
500,
9,
6200,
3878,
376,
20,
6738,
77,
156,
10714,
15,
47,
35,
639,
59,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why can't a forward declaration be used for a std::vector?
===
If I create a class like so:
// B.h
#ifndef _B_H_
#define _B_H_
class B
{
private:
int x;
int y;
};
#endif // _B_H_
and use it like this:
// main.cpp
#include <iostream>
... | 0 | [
2,
483,
92,
22,
38,
21,
917,
7098,
44,
147,
26,
21,
354,
43,
45,
45,
28033,
60,
800,
3726,
3726,
100,
31,
1600,
21,
718,
101,
86,
45,
12894,
334,
9,
252,
6926,
821,
103,
13862,
13,
1,
220,
1,
252,
1,
6926,
546,
7509,
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 you implement caching in Linq to SQL?
===
This may well end up being a [subjective][1] question, but anyway:
We've just started using LINQ to SQL at work for our DAL & we haven't really come up with a standard for out caching model. Previously we had being using a base 'DAL' class that implemented a cache m... | 0 | [
2,
184,
107,
42,
8713,
1658,
7192,
19,
6294,
1251,
20,
4444,
255,
60,
800,
3726,
3726,
48,
123,
134,
241,
71,
142,
21,
636,
28743,
1284,
500,
2558,
165,
500,
1301,
15,
47,
2774,
45,
95,
22,
195,
114,
373,
568,
6294,
1251,
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 I unit test a WCF service?
===
We have a whole bunch of DLLs that give us access to our database and other applications and services.
We've wrapped these DLLs with a thin WCF service layer which our clients then consume.
I'm a little unsure on how to write unit tests that only test the WCF service layer. ... | 0 | [
2,
184,
107,
31,
1237,
1289,
21,
11801,
410,
365,
60,
800,
3726,
3726,
95,
57,
21,
979,
7653,
16,
13,
43,
211,
18,
30,
590,
182,
1381,
20,
318,
6018,
17,
89,
3767,
17,
687,
9,
95,
22,
195,
3684,
158,
13,
43,
211,
18,
29,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to convince my co-workers not to use datasets for enterprise development (.NET 2.0+)
===
Everyone I work with is obsessed with the data-centric approach to enterprise development and hates the idea of using custom collections/objects. What is the best way to convince them otherwise? | 0 | [
2,
184,
20,
6218,
51,
326,
8,
16355,
52,
20,
275,
1054,
3554,
18,
26,
6002,
522,
13,
5,
9,
2328,
172,
9,
387,
2430,
6,
800,
3726,
3726,
1266,
31,
170,
29,
25,
19262,
29,
14,
1054,
8,
20829,
2141,
20,
6002,
522,
17,
3223,
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... |
What's a good way to write a Cocoa front-end to an Erlang application?
===
I'm exploring the possibility of writing an application in Erlang, but it would need to have a portion written in Cocoa (presumably Objective-C). I'd like the front-end and back-end to be able to communicate easily. How can this best be done?
... | 0 | [
2,
98,
22,
18,
21,
254,
161,
20,
2757,
21,
24507,
431,
8,
2451,
20,
40,
13,
106,
9949,
3010,
60,
800,
3726,
3726,
31,
22,
79,
11748,
14,
4813,
16,
1174,
40,
3010,
19,
13,
106,
9949,
15,
47,
32,
83,
376,
20,
57,
21,
2980,
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... |
Having MSDN on a usb key
===
Is there a way to have msdn documentation on a usb key ?
either web or the MSDN Library program.
i've been setting up my usbkey with portableapps stuff. | 0 | [
2,
452,
4235,
43,
103,
27,
21,
182,
220,
1246,
800,
3726,
3726,
25,
80,
21,
161,
20,
57,
4235,
43,
103,
13945,
27,
21,
182,
220,
1246,
13,
60,
694,
2741,
54,
14,
4235,
43,
103,
1248,
625,
9,
31,
22,
195,
74,
2697,
71,
51,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Arithmetic with Arbitrarily Large Integers in PHP
===
Ok, so PHP isn't the best language to be dealing with arbitrarily large integers in, considering that it only natively supports 32-bit signed integers. What I'm trying to do though is create a class that could represent an arbitrarily large binary number and be abl... | 0 | [
2,
21211,
29,
13,
25267,
18966,
370,
13820,
18,
19,
13,
26120,
800,
3726,
3726,
5854,
15,
86,
13,
26120,
2532,
22,
38,
14,
246,
816,
20,
44,
5746,
29,
13,
25267,
18966,
370,
13820,
18,
19,
15,
5154,
30,
32,
104,
1275,
102,
6747,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Lightweight Distro and X Windows for Development
===
I want to build a lightweight linux configuration to use for development. The first idea is to use it inside a Virtual Machine under Windows, or old Laptops with 1Gb RAM top. Maybe even a distributable environment for developers.
So the whole idea is to use... | 0 | [
2,
13024,
13613,
1460,
3996,
17,
993,
1936,
26,
522,
800,
3726,
3726,
31,
259,
20,
1895,
21,
13613,
13024,
8091,
20,
275,
26,
522,
9,
14,
64,
882,
25,
20,
275,
32,
572,
21,
6599,
1940,
131,
1936,
15,
54,
315,
12294,
18,
29,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I make a fully statically linked .exe with Visual Studio Express 2005 ?
===
My current preferred C++ environment is the free and largely excellent Microsoft Visual Studio 2005 Express edition. From time to time I have sent release .exe files to other people with pleasing results. However recently I made the dis... | 0 | [
2,
184,
107,
31,
233,
21,
2337,
12038,
1326,
4727,
13,
9,
1706,
62,
29,
3458,
1120,
2999,
812,
13,
60,
800,
3726,
3726,
51,
866,
5981,
272,
20512,
2307,
25,
14,
551,
17,
2679,
5977,
7099,
3458,
1120,
812,
2999,
1322,
9,
37,
85,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to interpret Perfmon analysis into application specific observations/data?
===
Many of us have used Perfmon tool to do performance analysis. Especially with .Net counters, but there are so many variables going on in Perfmon, that it always becomes hard to interpret Perfmon results in to valuable f... | 0 | [
2,
98,
25,
14,
246,
161,
20,
11584,
416,
410,
2111,
2495,
77,
3010,
1903,
9820,
118,
18768,
60,
800,
3726,
3726,
151,
16,
182,
57,
147,
416,
410,
2111,
5607,
20,
107,
956,
2495,
9,
1118,
29,
13,
9,
2328,
2105,
18,
15,
47,
80,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 back to basics. How do I get back into C++?
===
I haven't used C++ since college. Even though I've wanted to I haven't needed to do any until I started wanting to write plugins for Launchy. Is there a good book to read to get back into it? My experience since college is mainly C# and recently ruby. I bought s... | 0 | [
2,
164,
97,
20,
2125,
18,
9,
184,
107,
31,
164,
97,
77,
272,
20512,
60,
800,
3726,
3726,
31,
2933,
22,
38,
147,
272,
20512,
179,
314,
9,
166,
362,
31,
22,
195,
417,
20,
31,
2933,
22,
38,
851,
20,
107,
186,
163,
31,
373,
46... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Reasons for SQL differences
===
First of all, I should point out that I'm not asking this question for any practical reason. I'm just asking out of sheer curiosity.
Why is it that SQL distributions are so non-standard? I know there's an ANSI standard for SQL, but it just seems that developers of SQL databases go ... | 0 | [
2,
2932,
26,
4444,
255,
4921,
800,
3726,
3726,
64,
16,
65,
15,
31,
378,
454,
70,
30,
31,
22,
79,
52,
3379,
48,
1301,
26,
186,
5713,
1215,
9,
31,
22,
79,
114,
3379,
70,
16,
14694,
11581,
9,
483,
25,
32,
30,
4444,
255,
2523,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Equivalent to StAX for C
===
I've used the StAX API in Java quite a bit, and find it quite a clean way of dealing with XML files. Is there any equivalent library I could use for performing similar processing in C? | 0 | [
2,
4602,
20,
13,
18,
15514,
26,
272,
800,
3726,
3726,
31,
22,
195,
147,
14,
13,
18,
15514,
21,
2159,
19,
8247,
1450,
21,
1142,
15,
17,
477,
32,
1450,
21,
2745,
161,
16,
5746,
29,
23504,
6488,
9,
25,
80,
186,
4602,
1248,
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,
0,
0,
0,
0,
0,
0,
0,
0... |
iPhone App Minus App Store?
===
I've been looking into iPhone development, but I've been having problems coming up with the answer to a certain question.
If I create an application on my Mac, is there any way I can get it to run on an iPhone without going through the app store?
It doesn't matter if the iPhone ha... | 0 | [
2,
21024,
4865,
13,
15495,
4865,
1718,
60,
800,
3726,
3726,
31,
22,
195,
74,
699,
77,
21024,
522,
15,
47,
31,
22,
195,
74,
452,
1716,
880,
71,
29,
14,
1623,
20,
21,
1200,
1301,
9,
100,
31,
1600,
40,
3010,
27,
51,
1572,
15,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to Determine the Installed ASP.NET Version of Host from a Web Page
===
I have a site running in a Windows shared hosting environment. In their control panel for the shared hosting account I have it set to use ASP.NET version 3.0 but it doesn't say 3.5 SP1 specifically.
How can I view the installed version runni... | 0 | [
2,
184,
20,
3746,
14,
4066,
28,
306,
9,
2328,
615,
16,
2015,
37,
21,
2741,
2478,
800,
3726,
3726,
31,
57,
21,
689,
946,
19,
21,
1936,
2592,
10637,
2307,
9,
19,
66,
569,
4113,
26,
14,
2592,
10637,
2176,
31,
57,
32,
309,
20,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is this minimum spanning tree algorithm correct?
===
The minimum spanning tree problem is to take a connected weighted graph and find the sub set of it's edges with the lowest total weight that keeps the connected restriction but results in an acyclic graph.
The algorithm I am considering is:
- Find all cycles... | 0 | [
2,
25,
48,
5187,
16092,
1541,
9083,
4456,
60,
800,
3726,
3726,
14,
5187,
16092,
1541,
1448,
25,
20,
247,
21,
2587,
23350,
7210,
17,
477,
14,
972,
309,
16,
32,
22,
18,
7840,
29,
14,
6543,
600,
1763,
30,
8968,
14,
2587,
18732,
47,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I `assert()` without `abort()`ing?
===
If I use `assert()` and the assertion fails then `assert()` will call `abort()`, ending the running program abruptly. I can't afford that in my production code. Is there a way to assert in runtime yet be able to catch failed assertions so I have the chance to handle the... | 0 | [
2,
184,
92,
31,
13,
1,
22220,
38,
5,
6,
1,
366,
13,
1,
58,
6157,
38,
5,
6,
1,
68,
60,
800,
3726,
3726,
100,
31,
275,
13,
1,
22220,
38,
5,
6,
1,
17,
14,
20878,
13614,
94,
13,
1,
22220,
38,
5,
6,
1,
129,
645,
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... |
Can I simply decorate an existing instance?
===
below I have a very simple example of what I'm trying to do. I want to be able to use HTMLDecorator with any other class.
import cgi
class ClassX(object):
pass # ... with own __repr__
class ClassY(object):
pass # ... with own __repr__... | 0 | [
2,
92,
31,
1659,
27117,
40,
3149,
4851,
60,
800,
3726,
3726,
1021,
31,
57,
21,
253,
1935,
823,
16,
98,
31,
22,
79,
749,
20,
107,
9,
31,
259,
20,
44,
777,
20,
275,
13,
15895,
546,
4966,
3457,
29,
186,
89,
718,
9,
9010,
272,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Calculate Video Duration
===
I suck at math. I need to figure out how to calculate a video duration with only a few examples of values. For example, a value of 70966 is displayed as 1:10 minutes. A value of 30533 displays as 30 seconds. A value of 7007 displays as 7 seconds. | 2 | [
2,
18469,
763,
9403,
800,
3726,
3726,
31,
8466,
35,
5057,
9,
31,
376,
20,
1465,
70,
184,
20,
18469,
21,
763,
9403,
29,
104,
21,
310,
3770,
16,
4070,
9,
26,
823,
15,
21,
1923,
16,
453,
2545,
3526,
25,
6115,
28,
137,
6608,
902,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Filter out HTML tags and resolve entities in python
===
Because regular expressions scare me, I'm trying to find a way to remove all HTML tags and resolve HTML entities from a string in Python. | 0 | [
2,
11945,
70,
13,
15895,
3383,
18,
17,
9854,
12549,
19,
20059,
800,
3726,
3726,
185,
1290,
13832,
11813,
55,
15,
31,
22,
79,
749,
20,
477,
21,
161,
20,
4681,
65,
13,
15895,
3383,
18,
17,
9854,
13,
15895,
12549,
37,
21,
3724,
19,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Silverlight enabled browser tracking
===
I'm trying to get some stats on how many of the visitors to our website have Silverlight enabled browsers.
We currently use Google Analytics for the rest of our stats so ideally we'd like to just add 'Silverlight enabled' tracking in with the rest of our Google Analytics... | 0 | [
2,
1172,
3130,
9338,
16495,
10353,
800,
3726,
3726,
31,
22,
79,
749,
20,
164,
109,
12819,
18,
27,
184,
151,
16,
14,
4531,
20,
318,
2271,
57,
1172,
3130,
9338,
16495,
18,
9,
95,
871,
275,
8144,
26320,
26,
14,
760,
16,
318,
12819,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
List of ASP.NET Versions?
===
Thanks to a Q&A on stackoverflow I just found out how to determine the installed version on my hosting provider's server. Now I need to know what that number means.
Using <%=Environment.Version%> on my local machine returns 2.0.50727.3053. Which I've found to mean v3.5 SP1.
Can some... | 0 | [
2,
968,
16,
28,
306,
9,
2328,
3281,
60,
800,
3726,
3726,
3669,
20,
21,
2593,
1569,
58,
27,
7566,
2549,
9990,
31,
114,
216,
70,
184,
20,
3746,
14,
4066,
615,
27,
51,
10637,
11747,
22,
18,
8128,
9,
130,
31,
376,
20,
143,
98,
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... |
Is it possible to convert projects wizard created for MSVS 2005 to MSVS 2008 format autom
===
I have a bunch of wizards created for MSVS 2005. Is it possible to convert them to MSVS 2008 format automatically? | 0 | [
2,
25,
32,
938,
20,
8406,
2314,
10276,
679,
26,
4235,
710,
18,
812,
20,
4235,
710,
18,
570,
2595,
3108,
79,
800,
3726,
3726,
31,
57,
21,
7653,
16,
19577,
679,
26,
4235,
710,
18,
812,
9,
25,
32,
938,
20,
8406,
105,
20,
4235,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Recursion in Live VC++ Code
===
Would you use recursion in live VC++ code?
| 0 | [
2,
26604,
5991,
19,
515,
13,
8990,
20512,
1797,
800,
3726,
3726,
83,
42,
275,
26604,
5991,
19,
515,
13,
8990,
20512,
1797,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Incomplete information card game
===
I would like to develop a [trick taking](http://en.wikipedia.org/wiki/Trick-taking_game) card game. The game is between four players, one of which is a human and the other three hands are played by the computer.
Where can I read up about developing the AI for such games? | 0 | [
2,
14011,
676,
2056,
250,
800,
3726,
3726,
31,
83,
101,
20,
2803,
21,
636,
15294,
741,
500,
5,
21127,
6903,
219,
9,
17375,
26132,
9,
5583,
118,
17375,
118,
15294,
8,
11167,
1,
5128,
6,
2056,
250,
9,
14,
250,
25,
128,
222,
1007,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 XML Comments to class properties generated by the LINQ to SQL designer
===
I used the LINQ to SQL designer in Visual Studio to create an object model of a database. Now, I want to add XML comments to each generated property but I can't figure out how to do it without erasing the properties the next time the dbml ... | 0 | [
2,
3547,
23504,
7534,
20,
718,
3704,
6756,
34,
14,
6294,
1251,
20,
4444,
255,
4742,
800,
3726,
3726,
31,
147,
14,
6294,
1251,
20,
4444,
255,
4742,
19,
3458,
1120,
20,
1600,
40,
3095,
1061,
16,
21,
6018,
9,
130,
15,
31,
259,
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... |
What steps can I give a windows user to make a given file writeable
===
Imagine we have a program trying to write to a particular file, but failing.
On the Windows platform, what are the possible things which might be causing the file to be un-writable, and what steps could be suggested to an end user/administrator... | 0 | [
2,
98,
2382,
92,
31,
590,
21,
1936,
4155,
20,
233,
21,
504,
3893,
2757,
579,
800,
3726,
3726,
4382,
95,
57,
21,
625,
749,
20,
2757,
20,
21,
1498,
3893,
15,
47,
7250,
9,
27,
14,
1936,
2452,
15,
98,
50,
14,
938,
564,
56,
530,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Simple audio input API on a Mac?
===
I'd like to pull a stream of PCM samples from a Mac's line-in or built-in mic and do a little live analysis (the exact nature doesn't pertain to this question, but it could be an FFT every so often, or some basic statistics on the sample levels, or what have you).
What's a good ... | 0 | [
2,
1935,
4023,
6367,
21,
2159,
27,
21,
1572,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
2201,
21,
3766,
16,
5168,
79,
7855,
37,
21,
1572,
22,
18,
293,
8,
108,
54,
392,
8,
108,
13,
5410,
17,
107,
21,
265,
515,
2495,
13,
5,
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... |
Start Schedulrd Windows Task From SSIS
===
Does anyone know if you can and how to start off a scheduled Windows task on a Remote Server from within an SSIS package?
Cheers
Nigel | 0 | [
2,
799,
13,
7526,
11203,
897,
1936,
3005,
37,
13,
18,
4557,
800,
3726,
3726,
630,
1276,
143,
100,
42,
92,
17,
184,
20,
799,
168,
21,
3758,
1936,
3005,
27,
21,
5388,
8128,
37,
363,
40,
13,
18,
4557,
6030,
60,
10497,
18,
13963,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What's the easiest way to read a FoxPro DBF file from Python?
===
I've got a bunch of FoxPro (VFP9) DBF files on my Ubuntu system, is there a library to open these in Python? I only need to read them, and would preferably have access to the memo fields too. | 0 | [
2,
98,
22,
18,
14,
27237,
161,
20,
1302,
21,
2385,
2740,
13,
43,
12425,
3893,
37,
20059,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
7653,
16,
2385,
2740,
13,
5,
710,
12087,
518,
6,
13,
43,
12425,
6488,
27,
51,
287,
12968,
2473... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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) How do I determine the size of my array?
===
i.e., the number of elements the array can hold? | 0 | [
2,
13,
5,
150,
6,
184,
107,
31,
3746,
14,
1072,
16,
51,
7718,
60,
800,
3726,
3726,
31,
9,
62,
9,
15,
14,
234,
16,
2065,
14,
7718,
92,
1027,
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,
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... |
Multiple threads stuck in native calls (Java)
===
I have a problem with an application running on Fedora Core 6 with JDK 1.5.0_08.
After some amount of uptime (usually some days) threads begin getting stuck in native methods.
The threads are locked in something like this:
"pool-2-thread-2571" prio=1 tid=0... | 0 | [
2,
1886,
20396,
4549,
19,
1275,
3029,
13,
5,
1004,
1385,
6,
800,
3726,
3726,
31,
57,
21,
1448,
29,
40,
3010,
946,
27,
26726,
58,
2884,
400,
29,
487,
43,
197,
137,
9,
264,
9,
387,
1,
3099,
9,
75,
109,
2006,
16,
71,
891,
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... |
Adding server-side event to extender control
===
I have an extender control that raises a textbox's OnTextChanged event 500ms after the user has finished typing. The problem with this is that OnTextChanged get raised when the textbox loses focus, which causes problems (because of the postback).
What I'd like to do ... | 0 | [
2,
4721,
8128,
8,
1416,
807,
20,
7206,
106,
569,
800,
3726,
3726,
31,
57,
40,
7206,
106,
569,
30,
15303,
21,
1854,
5309,
22,
18,
27,
11969,
16229,
43,
807,
3033,
79,
18,
75,
14,
4155,
63,
842,
25266,
9,
14,
1448,
29,
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 exactly is Appdomain recycling
===
I am trying to figure out what exactly is Appdomain recycling?
When a aspx page is requested for the first time from a DotNet application, i understand that an appdomain for that app is created, and required assemblies are loaded into that appdomain, and the request will be ser... | 0 | [
2,
98,
1890,
25,
4865,
537,
6232,
20777,
800,
3726,
3726,
31,
589,
749,
20,
1465,
70,
98,
1890,
25,
4865,
537,
6232,
20777,
60,
76,
21,
28,
306,
396,
2478,
25,
6602,
26,
14,
64,
85,
37,
21,
14123,
2328,
3010,
15,
31,
1369,
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... |
find duplicate addresses in database, stop users entering them early?
===
How do I find duplicate addresses in a database, or better stop people already when filling in the form ? I guess the earlier the better?
Is there any good way of abstracting street, postal code etc so that typos and simple attempts to get 2 ... | 0 | [
2,
477,
19429,
12636,
19,
6018,
15,
747,
3878,
4604,
105,
274,
60,
800,
3726,
3726,
184,
107,
31,
477,
19429,
12636,
19,
21,
6018,
15,
54,
574,
747,
148,
614,
76,
7702,
19,
14,
505,
13,
60,
31,
2321,
14,
1201,
14,
574,
60,
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... |
Integrating InstantRails with Aptana or any other IDE
===
So I've been using InstantRails to check out Ruby on rails. I've been using Notepad++ for the editing. Now I don't want to install Ruby or Rails on my machine. Is there any walk through/tutorial on how to integrate Radrails or Netbeans with InstantRails? | 0 | [
2,
24529,
6322,
7301,
18,
29,
8442,
9068,
54,
186,
89,
13,
3448,
800,
3726,
3726,
86,
31,
22,
195,
74,
568,
6322,
7301,
18,
20,
2631,
70,
10811,
27,
2240,
18,
9,
31,
22,
195,
74,
568,
1945,
8240,
20512,
26,
14,
9510,
9,
130,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Queue alternatives to MSMQ on Windows?
===
If you want to use a queuing product for durable messaging under Windows, running .NET 2.0 and above, which alternatives to MSMQ exist today? I know of ActiveMQ (http://activemq.apache.org/), and I've seen references to WSMQ (pointing to http://wsmq.net), but the site seems t... | 0 | [
2,
22521,
2676,
18,
20,
4235,
79,
1251,
27,
1936,
60,
800,
3726,
3726,
100,
42,
259,
20,
275,
21,
9386,
291,
68,
2374,
26,
26901,
26437,
131,
1936,
15,
946,
13,
9,
2328,
172,
9,
387,
17,
784,
15,
56,
2676,
18,
20,
4235,
79,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
InfoPath 2003 and the xs:any type
===
I am implementing exception handling for our BizTalk services, and have run into a fairly major stumbling block.
In order to make the exception processing as generic as possible, and therefore to allow us to use it for any BizTalk application, our XML error schema includes an x... | 0 | [
2,
15404,
8353,
973,
17,
14,
993,
18,
45,
6001,
1001,
800,
3726,
3726,
31,
589,
17333,
5391,
7988,
26,
318,
1732,
380,
9718,
687,
15,
17,
57,
485,
77,
21,
6647,
394,
23034,
1921,
9,
19,
389,
20,
233,
14,
5391,
5511,
28,
12733,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Consuming web services from Oracle PL/SQL
===
Our application is interfacing with a lot of web services these days. We have our own package that someone wrote a few years back using UTL_HTTP and it generally works, but needs some hard-coding of the SOAP envelope to work with certain systems. I would like to make it mo... | 0 | [
2,
13,
17601,
2741,
687,
37,
15759,
12443,
118,
18,
22402,
800,
3726,
3726,
318,
3010,
25,
1480,
17231,
29,
21,
865,
16,
2741,
687,
158,
509,
9,
95,
57,
318,
258,
6030,
30,
737,
738,
21,
310,
122,
97,
568,
287,
7786,
1,
21127,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 convert .ICO to .PNG?
===
What tool can I use to convert a .ICO file to a .PNG file? | 0 | [
2,
184,
20,
8406,
13,
9,
7776,
20,
13,
9,
306,
2723,
60,
800,
3726,
3726,
98,
5607,
92,
31,
275,
20,
8406,
21,
13,
9,
7776,
3893,
20,
21,
13,
9,
306,
2723,
3893,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Displaying XML data in a Winfoms control
===
I would like to display details of an xml error log to a user in a winforms application and am looking for the best control to do the job.
The error data contains all of the sever variables at the time that the error occurred. These have been formatted into an XML docume... | 0 | [
2,
17418,
23504,
1054,
19,
21,
628,
4120,
79,
18,
569,
800,
3726,
3726,
31,
83,
101,
20,
3042,
3289,
16,
40,
23504,
7019,
6738,
20,
21,
4155,
19,
21,
628,
4190,
18,
3010,
17,
589,
699,
26,
14,
246,
569,
20,
107,
14,
1205,
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... |
Where can I get free Vista style developer graphics?
===
What is the best source of free Vista style graphics for application development? I want 32x32 and 16x16 that I can use in a Winforms application. | 0 | [
2,
113,
92,
31,
164,
551,
13520,
1034,
10058,
8351,
60,
800,
3726,
3726,
98,
25,
14,
246,
1267,
16,
551,
13520,
1034,
8351,
26,
3010,
522,
60,
31,
259,
2512,
396,
3125,
17,
347,
396,
1091,
30,
31,
92,
275,
19,
21,
628,
4190,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Why does TreeNodeCollection not implenent IEnumerable<TreeNode>?
===
TreeNodeCollection, like some of the other control collections in System.Windows.Forms, implements IEnumerable. Is there any design reason behind this or is it just a hangover from the days before generics? | 0 | [
2,
483,
630,
1541,
251,
546,
15015,
872,
52,
5420,
2284,
2291,
13,
660,
6336,
106,
579,
1,
8101,
251,
546,
1,
60,
800,
3726,
3726,
1541,
251,
546,
15015,
872,
15,
101,
109,
16,
14,
89,
569,
5721,
19,
329,
9,
27508,
18,
9,
4190... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Team Explorer on codeplex anonymously
===
I was on codeplex and trying to connect to their source control using team explorer. No joy though.
I tried connecting with https or http, using the server name and the project name. As I do not have a user on codeplex I could not login.
I am just trying to check out so... | 0 | [
2,
173,
8520,
27,
1797,
11326,
10364,
102,
800,
3726,
3726,
31,
23,
27,
1797,
11326,
17,
749,
20,
6379,
20,
66,
1267,
569,
568,
173,
8520,
9,
90,
4512,
362,
9,
31,
794,
6440,
29,
7775,
18,
54,
7775,
15,
568,
14,
8128,
204,
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... |
Reflection
===
What is reflection, and why is it useful?
I'm particularly interested in Java, but I assume the principles are the same in any language(?). | 0 | [
2,
9138,
800,
3726,
3726,
98,
25,
9138,
15,
17,
483,
25,
32,
4811,
60,
31,
22,
79,
1653,
3158,
19,
8247,
15,
47,
31,
7158,
14,
5624,
50,
14,
205,
19,
186,
816,
5,
60,
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,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Best GUI tool for documenting a SQL Server DB
===
What tool(s) do you use to generate documentation for a database (preferably into a .chm help file)? | 0 | [
2,
246,
9457,
5607,
26,
4492,
68,
21,
4444,
255,
8128,
13,
9007,
800,
3726,
3726,
98,
5607,
5,
18,
6,
107,
42,
275,
20,
7920,
13945,
26,
21,
6018,
13,
5,
3515,
2407,
4801,
77,
21,
13,
9,
673,
79,
448,
3893,
6,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Examining Berkeley DB files from the CLI
===
I have a set of Berkeley DB files on my Linux file system that I'd like to examine.
What useful tools exist for getting a quick overview of the contents? I can write Perl scripts that use BDB modules for examining them, but I'm looking for some CLI utility to be able to ... | 0 | [
2,
14470,
8039,
13,
9007,
6488,
37,
14,
19391,
800,
3726,
3726,
31,
57,
21,
309,
16,
8039,
13,
9007,
6488,
27,
51,
13024,
3893,
329,
30,
31,
22,
43,
101,
20,
9691,
9,
98,
4811,
4672,
3182,
26,
1017,
21,
2231,
21598,
16,
14,
84... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Swapping column values in MySQL
===
I have a MySQL table with coordinates, the column names are X and Y. Now I want to swap the column values in this table, so that X becomes Y and Y becomes X. The most apparent solution would be renaming the columns, but I don't want to make structure changes since I don't necessaril... | 0 | [
2,
10143,
5574,
4698,
4070,
19,
51,
18,
22402,
800,
3726,
3726,
31,
57,
21,
51,
18,
22402,
859,
29,
13714,
15,
14,
4698,
1817,
50,
993,
17,
13,
93,
9,
130,
31,
259,
20,
17150,
14,
4698,
4070,
19,
48,
859,
15,
86,
30,
993,
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... |
How to implement a file download in asp.net
===
What is the best way to implement, from a web page a download action using asp.net 2.0?
Log files for a action are created in a directory called [Application Root]/Logs. I have the full path and want to provide a button, that when clicked will download the log file f... | 0 | [
2,
184,
20,
8713,
21,
3893,
7121,
19,
28,
306,
9,
2328,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
8713,
15,
37,
21,
2741,
2478,
21,
7121,
1028,
568,
28,
306,
9,
2328,
172,
9,
387,
60,
6738,
6488,
26,
21,
1028,
50,
679,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Looking for a n-ary tree implementation in Perl
===
I'm writing a Perl script and would like to use a n-ary tree data structure.
Is there a good implementation that is available as source code (rather than part of a Perl library) ? | 0 | [
2,
699,
26,
21,
13,
103,
8,
1857,
1541,
6123,
19,
416,
255,
800,
3726,
3726,
31,
22,
79,
1174,
21,
416,
255,
3884,
17,
83,
101,
20,
275,
21,
13,
103,
8,
1857,
1541,
1054,
1411,
9,
25,
80,
21,
254,
6123,
30,
25,
904,
28,
12... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0... |
Create DB in Sql Server based on Visio Data Model
===
I have created a database model in Visio Professional (2003). I know that the Enterprise version has the ability to create a DB in Sql Server based on the data in Visio. I do not have the option to install Enterprise. Aside from going through the entire thing one t... | 0 | [
2,
1600,
13,
9007,
19,
4444,
255,
8128,
432,
27,
9060,
1963,
1054,
1061,
800,
3726,
3726,
31,
57,
679,
21,
6018,
1061,
19,
9060,
1963,
736,
13,
5,
3325,
6,
9,
31,
143,
30,
14,
6002,
615,
63,
14,
2165,
20,
1600,
21,
13,
9007,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
replace URL with HTML Links javascript
===
i am using the next function to match urls inside a given text and replace them for html links. The regex is working great but currently i am only replacing the first match.
Does anyone knows how I can replace all the url? I guess i should be using *exec* command but i did... | 0 | [
2,
3934,
287,
6362,
29,
13,
15895,
6271,
8247,
8741,
800,
3726,
3726,
31,
589,
568,
14,
328,
1990,
20,
730,
13,
911,
7532,
572,
21,
504,
1854,
17,
3934,
105,
26,
13,
15895,
6271,
9,
14,
7953,
1706,
25,
638,
374,
47,
871,
31,
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... |
Eclipse Plugin Dev: How do I get the paths for the currently selected project?
===
I'm writing a plugin that will parse a bunch of files in a project. But for the moment I'm stuck searching through the Eclipse API for answers.
The plugin works like this: Whenever I open a source file I let the plugin parse the sour... | 0 | [
2,
11652,
10922,
108,
9664,
45,
184,
107,
31,
164,
14,
12074,
26,
14,
871,
1704,
669,
60,
800,
3726,
3726,
31,
22,
79,
1174,
21,
10922,
108,
30,
129,
2017,
870,
21,
7653,
16,
6488,
19,
21,
669,
9,
47,
26,
14,
688,
31,
22,
79... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
concatenate several fields into one with SQL
===
i have three tables *tag*, *page*, *page-tag*
With the next data
***page***
ID NAME
1 page 1
2 page 2
3 page 3
4 page 4
***tag***
ID NAME
1 tag 1
2 tag 2
3 tag 3
4 tag 4
***page-tag***
I... | 0 | [
2,
1065,
9530,
8820,
238,
2861,
77,
53,
29,
4444,
255,
800,
3726,
3726,
31,
57,
132,
7484,
1637,
8628,
2483,
15,
1637,
6486,
2483,
15,
1637,
6486,
8,
8628,
2483,
29,
14,
328,
1054,
8980,
6486,
2483,
1409,
4924,
204,
137,
2478,
137... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
True random number generator
===
Sorry for this not being a "real" question, but Sometime back i remember seeing a post here about randomizing a randomizer randomly to generate truly random numbers, not just pseudo random. I dont see it if i search for it.
Does anybody know about that article? | 0 | [
2,
1151,
5477,
234,
15286,
800,
3726,
3726,
1875,
26,
48,
52,
142,
21,
13,
7,
7467,
7,
1301,
15,
47,
8530,
97,
31,
1518,
2078,
21,
678,
235,
88,
5477,
3335,
21,
5477,
11907,
21324,
20,
7920,
4574,
5477,
2116,
15,
52,
114,
8452,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
To use views or not to use views.
===
I seem right now to be embroiled in a debate with another programmer on this project who thinks that views have no merits. He proposes a system that PHP looks something like this:
$draw = new Draw;
$nav = $draw->wideHeaderBox().
$draw->left().
$draw->image(... | 0 | [
2,
20,
275,
4146,
54,
52,
20,
275,
4146,
9,
800,
3726,
3726,
31,
2260,
193,
130,
20,
44,
11911,
139,
21644,
19,
21,
4503,
29,
226,
17968,
27,
48,
669,
72,
7973,
30,
4146,
57,
90,
5848,
18,
9,
24,
20621,
21,
329,
30,
13,
2612... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 regex pattern for datetime (2008-09-01 12:35:45 ) ?
===
Dont have any additional information. Just what is the regex pattern for datetime (2008-09-01 12:35:45 ) ? | 0 | [
2,
98,
25,
14,
7953,
1706,
3732,
26,
1231,
891,
13,
5,
2753,
8,
2545,
8,
3026,
390,
45,
2599,
45,
2520,
13,
6,
13,
60,
800,
3726,
3726,
1049,
57,
186,
1351,
676,
9,
114,
98,
25,
14,
7953,
1706,
3732,
26,
1231,
891,
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,
0,
0... |
SQL query to get the top "n" scores out of a list
===
I'd like to find the different ways to solve a real life problem I had: imagine to have a contest, or a game, during which the users collect points. You have to build a query to show the list of users with the best "n" scores.
I'm making an example to clarify. ... | 0 | [
2,
4444,
255,
25597,
20,
164,
14,
371,
13,
7,
103,
7,
7369,
70,
16,
21,
968,
800,
3726,
3726,
31,
22,
43,
101,
20,
477,
14,
421,
2847,
20,
8402,
21,
683,
201,
1448,
31,
41,
45,
4382,
20,
57,
21,
3013,
15,
54,
21,
250,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you prevent default site web.config file being inherited by virtual directories?
===
I have the following code in a web.config file of the default IIS site.
<httpModules>
<add type="MDL.BexWebControls.Charts.ChartStreamHandler,Charts" name="ChartStreamHandler"/>
</httpModules>
Then when ... | 0 | [
2,
184,
107,
42,
2501,
12838,
689,
2741,
9,
14093,
2816,
3893,
142,
7179,
34,
6599,
559,
1596,
60,
800,
3726,
3726,
31,
57,
14,
249,
1797,
19,
21,
2741,
9,
14093,
2816,
3893,
16,
14,
12838,
595,
18,
689,
9,
13,
1,
21127,
19673,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SugarCRM 5 - Create a sub panel for invoices in Account Panel
===
I'm customizing a SugarCRM 5, and in my **SugarCRM database** I've all invoices, which were imported from our ERP. Now, I would like to know if it is possible to create a new Sub panel in the Accounts Panel **without editing the original SugarCRM files*... | 0 | [
2,
4200,
6711,
79,
331,
13,
8,
1600,
21,
972,
4113,
26,
19,
13379,
18,
19,
2176,
4113,
800,
3726,
3726,
31,
22,
79,
5816,
3335,
21,
4200,
6711,
79,
331,
15,
17,
19,
51,
13,
1409,
26149,
6711,
79,
6018,
1409,
31,
22,
195,
65,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are there any guidelines for designing user interface for mobile devices?
===
I am creating an application for a Windows Mobile computer. The catch is that the device (<a href="http://www.motorola.com/business/v/index.jsp?vgnextoid=d4397b103d175110VgnVCM1000008406b00aRCRD">Motorola MC17</a>) does not have a touch scre... | 0 | [
2,
50,
80,
186,
12629,
26,
15026,
4155,
6573,
26,
3241,
4690,
60,
800,
3726,
3726,
31,
589,
2936,
40,
3010,
26,
21,
1936,
3241,
1428,
9,
14,
2949,
25,
30,
14,
3646,
13,
5,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
6483,
9,
2045... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
unit testing dynamic fixtures in CakePHP
===
> If you are not familiar with the CakePHP framework, you can maybe still help me. CakePHP uses [SimpleTest][1]
In the cakephp framework i am building tests for a behavior that is configured by adding fields to the table. This is intended to work in the same way that add... | 0 | [
2,
1237,
4431,
7782,
19914,
19,
8390,
26120,
800,
3726,
3726,
13,
1,
100,
42,
50,
52,
3694,
29,
14,
8390,
26120,
6596,
15,
42,
92,
913,
174,
448,
55,
9,
8390,
26120,
2027,
636,
24629,
10543,
500,
2558,
165,
500,
19,
14,
8390,
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... |
How do you manage SQL Queries
===
At the moment my code (PHP) has too many SQL queries in it. eg...
// not a real example, but you get the idea...
$results = $db->GetResults("SELECT * FROM sometable WHERE iUser=$userid");
if ($results) {
// Do something
}
I am looking into using sto... | 0 | [
2,
184,
107,
42,
4705,
4444,
255,
9386,
2829,
800,
3726,
3726,
35,
14,
688,
51,
1797,
13,
5,
26120,
6,
63,
266,
151,
4444,
255,
9386,
2829,
19,
32,
9,
12369,
9,
9,
9,
12894,
52,
21,
683,
823,
15,
47,
42,
164,
14,
882,
9,
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... |
GCOV for multi-threaded apps
===
Is it possible to use gcov for coverage testing of multi-threaded applications?
I've set some trivial tests of our code-base up, but it would be nice to have some idea of the coverage we're achieving. If gcov isn't appropriate can anyone recommend an alternative tool (possible opro... | 0 | [
2,
13,
10362,
2026,
26,
1889,
8,
96,
10647,
69,
4865,
18,
800,
3726,
3726,
25,
32,
938,
20,
275,
13,
10362,
2026,
26,
5245,
4431,
16,
1889,
8,
96,
10647,
69,
3767,
60,
31,
22,
195,
309,
109,
13,
19712,
4894,
16,
318,
1797,
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... |
How to create a graphical user interface mock-up for research?
===
I am a student and interested in doing some research on user interface. For some experiments, I have to change the behaviors of many default interactions in an operating system such as double-click or drag-and-drop in Windows (to make it faster, more e... | 0 | [
2,
184,
20,
1600,
21,
21755,
4155,
6573,
10506,
8,
576,
26,
527,
60,
800,
3726,
3726,
31,
589,
21,
1209,
17,
3158,
19,
845,
109,
527,
27,
4155,
6573,
9,
26,
109,
7715,
15,
31,
57,
20,
753,
14,
3257,
18,
16,
151,
12838,
11224,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Link to samba shares in html
===
*First off if you're unaware, samba or smb == Windows file sharing, \\\computer\share etc.*
I have a bunch of different files on a bunch of different computers. It's mostly media and there is quite a bit of it. I'm looking into various ways of consolidating this into something more ... | 0 | [
2,
3508,
20,
13,
18,
7483,
5945,
19,
13,
15895,
800,
3726,
3726,
1637,
3552,
168,
100,
42,
22,
99,
12100,
15,
13,
18,
7483,
54,
13,
18,
5024,
800,
3726,
1936,
3893,
6126,
15,
13,
1,
18448,
1,
16608,
2722,
9,
2483,
31,
57,
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... |
Filter linq list on property value
===
I have a `List<int>` and a `List<customObject>`. The customObject class has an ID property. How can I get a `List<customObject>` containing only the objects where the ID property is in the `List<int>` using LINQ?
| 0 | [
2,
11945,
6294,
1251,
968,
27,
1354,
1923,
800,
3726,
3726,
31,
57,
21,
13,
1,
5739,
1,
6391,
1,
17,
21,
13,
1,
5739,
1,
4636,
6015,
23793,
1,
9,
14,
5816,
23793,
718,
63,
40,
4924,
1354,
9,
184,
92,
31,
164,
21,
13,
1,
57... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Examples of using semantic web technologies in real world applications
===
Are you working on a (probably commercial) product which uses RDF/OWL/SPARQL technologies? If so, can you please describe your product? | 0 | [
2,
3770,
16,
568,
17220,
2741,
5740,
19,
683,
126,
3767,
800,
3726,
3726,
50,
42,
638,
27,
21,
13,
5,
14097,
1439,
6,
2374,
56,
2027,
13,
897,
410,
118,
3581,
255,
118,
18,
3574,
22402,
5740,
60,
100,
86,
15,
92,
42,
2247,
499... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 do I generate a Friendly URL in C#?
===
How can I go about generating a Friendly URL in C#? Currently I simple replace spaces with an underscore, but how would I go about generating URL's like Stack Overflow?
For example how can I convert:
> How do I generate a Friendly URL in C#?
Into
> how-do-i-gener... | 0 | [
2,
184,
107,
31,
7920,
21,
4753,
287,
6362,
19,
272,
5910,
60,
800,
3726,
3726,
184,
92,
31,
162,
88,
13500,
21,
4753,
287,
6362,
19,
272,
5910,
60,
871,
31,
1935,
3934,
7644,
29,
40,
131,
15077,
15,
47,
184,
83,
31,
162,
88,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MSMQ monitoring
===
Is there anything which can help with msmq monitoring? I'd like to get some event/monit when a message appears in queue and the same on leave. | 0 | [
2,
4235,
79,
1251,
8984,
800,
3726,
3726,
25,
80,
602,
56,
92,
448,
29,
4235,
79,
1251,
8984,
60,
31,
22,
43,
101,
20,
164,
109,
807,
118,
2111,
242,
76,
21,
2802,
1780,
19,
22521,
17,
14,
205,
27,
767,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Viewing event log via a web interface
===
I'd like to be able to view the event log for a series of asp.net websites running on IIS. Can I do this externally, for example, through a web interface? | 0 | [
2,
11244,
807,
6738,
1197,
21,
2741,
6573,
800,
3726,
3726,
31,
22,
43,
101,
20,
44,
777,
20,
1418,
14,
807,
6738,
26,
21,
231,
16,
28,
306,
9,
2328,
13931,
946,
27,
595,
18,
9,
92,
31,
107,
48,
4886,
102,
15,
26,
823,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is it just the iPhone simulator that is restricted to intel only Mac's?
===
I have read that the iPhone SDK (part of xcode 3) is restricted to Mac's with the intel chipset. Does this restriction apply to only the simulator part of the SDK or the complete shebang? | 0 | [
2,
25,
32,
114,
14,
21024,
24565,
30,
25,
7079,
20,
14635,
104,
1572,
22,
18,
60,
800,
3726,
3726,
31,
57,
1302,
30,
14,
21024,
13,
18,
43,
197,
13,
5,
3091,
16,
993,
9375,
203,
6,
25,
7079,
20,
1572,
22,
18,
29,
14,
14635,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Good reasons NOT to use a relational database?
===
Can you please point to alternative data storage tools and give good reasons to use them instead of good-old relational databases? Imo most applications rarely use full power of SQL, it would be interesting to see how to build a SQL-free application. | 0 | [
2,
254,
2932,
52,
20,
275,
21,
5827,
192,
6018,
60,
800,
3726,
3726,
92,
42,
2247,
454,
20,
2676,
1054,
4326,
4672,
17,
590,
254,
2932,
20,
275,
105,
700,
16,
254,
8,
1218,
5827,
192,
6018,
18,
60,
13,
11947,
127,
3767,
5664,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 implement a chromeless window with WPF?
===
I want to show a chromeless modal window with a close button in the upper right corner.
Is this possible? | 0 | [
2,
184,
107,
31,
8713,
21,
13,
12985,
923,
1463,
29,
619,
7721,
60,
800,
3726,
3726,
31,
259,
20,
298,
21,
13,
12985,
923,
13,
20756,
1463,
29,
21,
543,
5167,
19,
14,
1508,
193,
1531,
9,
25,
48,
938,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
UI and event testing
===
So I know that unit testing is a must. I get the idea that TDD is the way to go when adding new modules. Even if, in practice, I don't actually do it. A bit like commenting code, really.
The real thing is, I'm struggling to get my head around how to unit-test the UI and more generally obje... | 0 | [
2,
13,
5661,
17,
807,
4431,
800,
3726,
3726,
86,
31,
143,
30,
1237,
4431,
25,
21,
491,
9,
31,
164,
14,
882,
30,
15596,
43,
25,
14,
161,
20,
162,
76,
4721,
78,
17113,
9,
166,
100,
15,
19,
1345,
15,
31,
221,
22,
38,
1121,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is WPF?
===
I have seen lots of questions recently about WPF...
- What is it?
- What does it stand for?
- How can I begin programming WPF? | 0 | [
2,
98,
25,
619,
7721,
60,
800,
3726,
3726,
31,
57,
541,
7503,
16,
2346,
1989,
88,
619,
7721,
9,
9,
9,
13,
8,
98,
25,
32,
60,
13,
8,
98,
630,
32,
1261,
26,
60,
13,
8,
184,
92,
31,
2348,
3143,
619,
7721,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.