unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Where can i Find GOOD ASP.NET tutorial(or books) online?
===
Looking for some good resources (or tutorials) that will demonstrate the proper techniques on building ASP.NET web sites.
| 0 | [
2,
113,
92,
31,
477,
254,
28,
306,
9,
2328,
29724,
5,
248,
964,
6,
2087,
60,
800,
3726,
3726,
699,
26,
109,
254,
2566,
13,
5,
248,
29724,
18,
6,
30,
129,
10847,
14,
4119,
4212,
27,
353,
28,
306,
9,
2328,
2741,
3259,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Dealing with SVN keyword expansion with git-svn
===
I recently asked about [keyword expansion in Git](http://stackoverflow.com/questions/39742/does-git-have-anything-like-svn-propset-svnkeywords-or-pre-post-commit-hooks) and I'm willing to accept the design design not to really support this idea in Git.
For better... | 0 | [
2,
5746,
29,
13,
18,
16578,
1246,
9587,
3233,
29,
13,
10404,
8,
18,
16578,
800,
3726,
3726,
31,
1989,
411,
88,
636,
4237,
9587,
3233,
19,
13,
10404,
500,
5,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
3412,
3828,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Error consuming Web Service from Winform App - "Cannot execute a program..."
===
I have a winform app that calls a web service to check for updates. This works in dev and it also works everywhere else I've tried it, just not on the installed copy on my machine (which happens to be the same in dev).
The error is:
... | 0 | [
2,
7019,
13,
17601,
2741,
365,
37,
628,
4190,
4865,
13,
8,
13,
7,
1245,
1270,
15644,
21,
625,
9,
9,
9,
7,
800,
3726,
3726,
31,
57,
21,
628,
4190,
4865,
30,
3029,
21,
2741,
365,
20,
2631,
26,
16779,
9,
48,
693,
19,
9664,
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... |
java package cycle detection: how to find the specific classes involved ?
===
What tool would you recommend to detect **java package cyclic dependencies**,
knowing that the goal is to _list explicitly the specific classes involved in the detected 'across-packages cycle'_ ?
I know about [classycle][1] and [JDepen... | 0 | [
2,
8247,
6030,
4150,
11643,
45,
184,
20,
477,
14,
1903,
2684,
1013,
13,
60,
800,
3726,
3726,
98,
5607,
83,
42,
12360,
20,
9092,
13,
1409,
1004,
1385,
6030,
13,
15888,
29411,
1409,
15,
2506,
30,
14,
1195,
25,
20,
13,
1,
5739,
131... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 liquid layouts still relevant?
===
Now that most of the major browsers support full page zoom (at present, the only notable exception being Google Chrome), are liquid or elastic layouts no longer needed? Is the relative pain of building liquid/elastic layouts worth the effort? Are there any situations where a liqu... | 0 | [
2,
50,
4189,
9106,
18,
174,
7480,
60,
800,
3726,
3726,
130,
30,
127,
16,
14,
394,
16495,
18,
555,
503,
2478,
19469,
13,
5,
721,
734,
15,
14,
104,
2072,
5391,
142,
8144,
13,
12985,
6,
15,
50,
4189,
54,
931,
9428,
9106,
18,
90,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 modify the defaul Check-in Action in TFS?
===
The default check-in action for a work-item is "resolve". I'd like to set it to "associate" so that this work item isn't automaticaly closed if I check-in stuff too fast. How can I do that?
Thanks. | 0 | [
2,
184,
20,
17579,
14,
121,
1473,
1287,
2631,
8,
108,
1028,
19,
13,
11720,
18,
60,
800,
3726,
3726,
14,
12838,
2631,
8,
108,
1028,
26,
21,
170,
8,
2119,
79,
25,
13,
7,
99,
5594,
195,
7,
9,
31,
22,
43,
101,
20,
309,
32,
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 a good book for learning F#?
===
I am looking at taking F# for a test drive. What is a really good book to get started for a C# developer? | 4 | [
2,
98,
1,
18,
21,
254,
360,
26,
2477,
398,
5910,
60,
800,
3726,
3726,
31,
589,
699,
35,
741,
398,
5910,
26,
21,
1289,
1493,
9,
98,
25,
21,
510,
254,
360,
20,
164,
373,
26,
21,
272,
5910,
10058,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Asynchronous APIs
===
When trying to implement a asynchronous API calls / Non-blocking calls, i know a little in a All Plain-C applicaiton I have, i read a about APM(Asynchronous Programming Model) by 'Delegates'. Basically what i want to do is call one API f1() to do a functionality(which takes long time 8-10 seconds... | 0 | [
2,
21,
16023,
1291,
21,
8954,
800,
3726,
3726,
76,
749,
20,
8713,
21,
21,
16023,
1291,
21,
2159,
3029,
13,
118,
538,
8,
12048,
68,
3029,
15,
31,
143,
21,
265,
19,
21,
65,
3748,
8,
150,
4865,
16904,
49,
444,
31,
57,
15,
31,
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... |
Is there an algorithm that tells the semantic similarity of two phrases
===
input: phrase 1, phrase 2
output: semantic similarity value (between 0 and 1), or the probability this two phrases are talking about the same thing | 0 | [
2,
25,
80,
40,
9083,
30,
2609,
14,
17220,
17204,
16,
81,
18492,
800,
3726,
3726,
6367,
45,
6845,
137,
15,
6845,
172,
5196,
45,
17220,
17204,
1923,
13,
5,
14427,
713,
17,
137,
6,
15,
54,
14,
10177,
48,
81,
18492,
50,
1582,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is a pop_back() in a std::vector really invalidates *all* iterators on the vector?
===
std::vector<int> ints;
// ... fill ints with random values
for(std::vector<int>::iterator it = ints.begin(); it != ints.end(); )
{
if(*it < 10)
{
*it = ints.back();
... | 0 | [
2,
25,
21,
1675,
1,
1958,
5,
6,
19,
21,
354,
43,
45,
45,
28033,
510,
16671,
7759,
1637,
1233,
2483,
32,
106,
9922,
27,
14,
7497,
60,
800,
3726,
3726,
354,
43,
45,
45,
28033,
1,
6391,
1,
19,
38,
18,
73,
12894,
13,
9,
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... |
What are the best practices for using Assembly Attributes?
===
I have a solution with multiple project. I am trying to optimize AssemblyInfo.cs files by linking one solution wide assembly info file. What are the best practices for doing this? Which attributes should be in solution wide file and which are project/assem... | 0 | [
2,
98,
50,
14,
246,
5242,
26,
568,
1475,
13422,
60,
800,
3726,
3726,
31,
57,
21,
4295,
29,
1886,
669,
9,
31,
589,
749,
20,
22864,
1475,
108,
4120,
9,
6824,
6488,
34,
12585,
53,
4295,
1051,
1475,
15404,
3893,
9,
98,
50,
14,
246... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using reflection to call an ASP.NET web service
===
Say I have an ASMX web service, MyService. The service has a method, MyMethod. I could execute MyMethod on the server side as follows:
MyService service = new MyService();
service.MyMethod();
I need to do similar, with service and method not known un... | 0 | [
2,
568,
9138,
20,
645,
40,
28,
306,
9,
2328,
2741,
365,
800,
3726,
3726,
395,
31,
57,
40,
28,
79,
396,
2741,
365,
15,
51,
11449,
9,
14,
365,
63,
21,
2109,
15,
51,
5909,
1807,
43,
9,
31,
110,
15644,
51,
5909,
1807,
43,
27,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can you animate a custom dependency property in Silverlight?
===
I might be missing something really obvious. I'm trying to write a custom Panel where the contents are laid out according to a couple of dependency properties (I'm assuming they *have* to be DPs because I want to be able to animate them.)
However, whe... | 0 | [
2,
92,
42,
14487,
591,
21,
5816,
26835,
1354,
19,
1172,
3130,
60,
800,
3726,
3726,
31,
530,
44,
2863,
301,
510,
4674,
9,
31,
22,
79,
749,
20,
2757,
21,
5816,
4113,
113,
14,
8478,
50,
2488,
70,
496,
20,
21,
1335,
16,
26835,
370... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Apache .htaccess files into Lighttpd rules?
===
It's big problem to convert mod_rewrite rules to lighttpd format | 0 | [
2,
184,
20,
8406,
17140,
13,
9,
9020,
20604,
6488,
77,
471,
38,
9251,
1761,
60,
800,
3726,
3726,
32,
22,
18,
580,
1448,
20,
8406,
7226,
1,
99,
23716,
1761,
20,
471,
38,
9251,
2595,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
visual C++ 6.0 VS visual C++ 2008
===
what are the advantages/disadvantages of between msvs c++ 6.0 vs msvs c++ 2008? the main reason for asking such question is that still there are many decent programmers that prefer using the older version insteed of the the newest version. | 0 | [
2,
3458,
272,
20512,
400,
9,
387,
4611,
3458,
272,
20512,
570,
800,
3726,
3726,
98,
50,
14,
14683,
118,
2906,
1283,
17384,
14465,
16,
128,
4235,
710,
18,
272,
20512,
400,
9,
387,
4611,
4235,
710,
18,
272,
20512,
570,
60,
14,
407,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Middleware API Best Practices, What are they?
===
We are developing a middleware SDK, both in C++ and Java to be used as a library/DLL by, for example, game developers, animation software developers, Avatar developers to enhance their products.
What I would like to know is this: Are there standard "Best Practices" ... | 0 | [
2,
772,
5011,
21,
2159,
246,
5242,
15,
98,
50,
59,
60,
800,
3726,
3726,
95,
50,
3561,
21,
772,
5011,
13,
18,
43,
197,
15,
156,
19,
272,
20512,
17,
8247,
20,
44,
147,
28,
21,
1248,
118,
43,
211,
34,
15,
26,
823,
15,
250,
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 technical considerations must a system/network administrator worry about when a site gets onto social bookmarking/sharing sites?
===
The reason I ask is that Stack Overflow has been [Dugg][1], [Slashdotted][2], and [Redditted][3].
First, what kinds of effect does this have on the servers that power a website? ... | 0 | [
2,
98,
2447,
20478,
491,
21,
329,
118,
24106,
8890,
3189,
88,
76,
21,
689,
3049,
1204,
668,
360,
4527,
68,
118,
25213,
3259,
60,
800,
3726,
3726,
14,
1215,
31,
1349,
25,
30,
7566,
20285,
63,
74,
636,
43,
21606,
500,
2558,
165,
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... |
Alternative Style(CSS) methods in SAP Portal?
===
I am overriding a lot of SAP's Portal functionality in my current project. I have to create a custom fixed width framework, custom iView trays, custom KM API functionality, and more.
With all of these custom parts, I will not be using a lot of the style functionali... | 0 | [
2,
2676,
1034,
5,
6824,
18,
6,
3195,
19,
7508,
8281,
60,
800,
3726,
3726,
31,
589,
84,
5175,
68,
21,
865,
16,
7508,
22,
18,
8281,
18548,
19,
51,
866,
669,
9,
31,
57,
20,
1600,
21,
5816,
3535,
9456,
6596,
15,
5816,
31,
4725,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Knowing which java.exe process to kill on a windows machine
===
When a java based application starts to misbehave on a windows machine, you want to be able to kill the process in the task manager if you can't quit the application normally. Most of the time, there's more than one java based application running on my ma... | 0 | [
2,
2506,
56,
8247,
9,
1706,
62,
953,
20,
1177,
27,
21,
1936,
1940,
800,
3726,
3726,
76,
21,
8247,
432,
3010,
3244,
20,
2462,
863,
5815,
27,
21,
1936,
1940,
15,
42,
259,
20,
44,
777,
20,
1177,
14,
953,
19,
14,
3005,
1382,
100,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Regular expression that rejects all input?
===
Is is possible to construct a regular expression that rejects all input strings? | 0 | [
2,
1290,
1803,
30,
12170,
18,
65,
6367,
60,
800,
3726,
3726,
25,
25,
938,
20,
6960,
21,
1290,
1803,
30,
12170,
18,
65,
6367,
7887,
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... | [
1,
1,
1,
1,
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... |
Facebook java integration
===
I have looked in vain for a good example or starting point to write a java based facebook application... I was hoping that someone here would know of one. As well, I hear that facebook will no longer support their java API is this true and if yes does that mean that we should no longer ... | 0 | [
2,
9090,
8247,
8078,
800,
3726,
3726,
31,
57,
292,
19,
15845,
26,
21,
254,
823,
54,
1422,
454,
20,
2757,
21,
8247,
432,
9090,
3010,
9,
9,
9,
31,
23,
3935,
30,
737,
235,
83,
143,
16,
53,
9,
28,
134,
15,
31,
990,
30,
9090,
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... |
DevExpress eXpressApp Framework (XAF) and eXpress Persistent Objects (XPO): how do I speed up the loading time of associations?
===
I am having a problem with the speed of accessing an association property with a large number of records.
I have an XAF app with a parent class called MyParent.
There are 230 record... | 0 | [
2,
9664,
21230,
2999,
7753,
6596,
13,
5,
396,
2565,
6,
17,
2999,
15348,
3916,
13,
5,
396,
1638,
6,
45,
184,
107,
31,
1362,
71,
14,
12797,
85,
16,
10642,
60,
800,
3726,
3726,
31,
589,
452,
21,
1448,
29,
14,
1362,
16,
1381,
68,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 prevent Flash's URLRequest from escaping the url?
===
I load some XML from a servlet from my Flex application like this:
_loader = new URLLoader();
_loader.load(new URLRequest(_servletURL+"?do=load&id="+_id));
As you can imagine _servletURL is something like http://foo.bar/path/to/servlet
In some ca... | 0 | [
2,
184,
107,
31,
2501,
4433,
22,
18,
287,
6362,
99,
10351,
37,
14700,
14,
287,
6362,
60,
800,
3726,
3726,
31,
6305,
109,
23504,
37,
21,
13,
10321,
1336,
37,
51,
14409,
3010,
101,
48,
45,
13,
1,
8294,
106,
800,
78,
287,
6362,
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 spread tcplistener incoming connections over threads in .NET?
===
When using the Net.Sockets.TcpListener, what is the best way to handle incoming connections (.AcceptSocket) in seperate threads?
The idea is to start a new thread when a new incoming connection is accepted, while the tcplistener then stays ava... | 0 | [
2,
184,
20,
1789,
13,
38,
7439,
13891,
106,
17126,
6760,
84,
20396,
19,
13,
9,
2328,
60,
800,
3726,
3726,
76,
568,
14,
4275,
9,
18,
5668,
6095,
9,
38,
7439,
13891,
106,
15,
98,
25,
14,
246,
161,
20,
3053,
17126,
6760,
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... |
Any PHP editors supporting 5.3 syntax?
===
I'm using namespaces in a project and Eclipse PDT, my IDE of choice, recognizes them as syntax errors. Not only it renders its convenient error checking unusable, but it also ruins Eclipse's PHP explorer.
5.3 features are coming to PDT 2.0 scheduled for release in December... | 0 | [
2,
186,
13,
26120,
12149,
3134,
331,
9,
240,
22649,
60,
800,
3726,
3726,
31,
22,
79,
568,
204,
5582,
18,
19,
21,
669,
17,
11652,
13,
9251,
38,
15,
51,
13,
3448,
16,
1837,
15,
17839,
105,
28,
22649,
11908,
9,
52,
104,
32,
16535... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 get Axis 1.4 to not generate several prefixes for the same XML namespace?
===
I am receiving SOAP requests from a client that uses the Axis 1.4 libraries. The requests have the following form:
<soapenv:Envelope xmlns:soapenv="http://schemas.xmlsoap.org/soap/envelope/"
xmlns:xsd... | 0 | [
2,
184,
92,
31,
164,
8577,
137,
9,
300,
20,
52,
7920,
238,
14315,
160,
26,
14,
205,
23504,
204,
5582,
60,
800,
3726,
3726,
31,
589,
3396,
6447,
12279,
37,
21,
6819,
30,
2027,
14,
8577,
137,
9,
300,
8649,
9,
14,
12279,
57,
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 to create J2ME midlets for Nokia S40 using Eclipse
===
Nokia has stopped offering its Developer's Suite, relying on other IDEs, including Eclipse. Meanwhile, Nokia changed its own development tools again and EclipseMe has also changed. This leaves most documentation irrelevant.
I want to know what does it take... | 0 | [
2,
184,
20,
1600,
487,
135,
790,
907,
11045,
26,
24294,
13,
18,
2602,
568,
11652,
800,
3726,
3726,
24294,
63,
1175,
4090,
82,
10058,
22,
18,
6160,
15,
21760,
27,
89,
13,
8153,
15,
215,
11652,
9,
4285,
15,
24294,
1015,
82,
258,
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... |
Similarity between line strings
===
I have a number of tracks recorded by a GPS, which more formally can be described as a number of line strings.
Now, some of the recorded tracks might be recordings of the same route, but because of inaccurasies in the GPS system, the fact that the recordings were made on separate... | 0 | [
2,
17204,
128,
293,
7887,
800,
3726,
3726,
31,
57,
21,
234,
16,
1633,
801,
34,
21,
18298,
15,
56,
91,
5286,
92,
44,
745,
28,
21,
234,
16,
293,
7887,
9,
130,
15,
109,
16,
14,
801,
1633,
530,
44,
4655,
16,
14,
205,
858,
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... |
Remote installing of windows service
===
I need to remotely install windows service on number of computers, so I use CreateService() and other service functions from winapi. I know admin password and user name for machines that I need access to. In order to gain access to remote machine I impersonate calling process w... | 0 | [
2,
5388,
25429,
16,
1936,
365,
800,
3726,
3726,
31,
376,
20,
23288,
16146,
1936,
365,
27,
234,
16,
7774,
15,
86,
31,
275,
1600,
11449,
5,
6,
17,
89,
365,
3719,
37,
628,
2552,
49,
9,
31,
143,
21,
43,
2160,
20884,
17,
4155,
204,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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#, int or Int32? Should I care?
===
From my understanding int and Int32 are the same thing in C#, but I've read a number of times that int is preferred over Int32 but without any reason given. So, what is the reason? Should I care? | 0 | [
2,
272,
5910,
15,
19,
38,
54,
19,
38,
3125,
60,
378,
31,
781,
60,
800,
3726,
3726,
37,
51,
3260,
19,
38,
17,
19,
38,
3125,
50,
14,
205,
584,
19,
272,
5910,
15,
47,
31,
22,
195,
1302,
21,
234,
16,
436,
30,
19,
38,
25,
598... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there any way to create multiple insert statements in a ms-access query?
===
I am using MS Access 2003. I want to run a lot of insert SQL statements in what is called 'Query' in MS Access. Is there any easy(or indeed any way) to do it? | 0 | [
2,
25,
80,
186,
161,
20,
1600,
1886,
14692,
9015,
19,
21,
4235,
8,
20604,
25597,
60,
800,
3726,
3726,
31,
589,
568,
4235,
1381,
973,
9,
31,
259,
20,
485,
21,
865,
16,
14692,
4444,
255,
9015,
19,
98,
25,
227,
13,
22,
8190,
93,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 move tags in Subversion
===
I wish Subversion had a better way of moving tags. The only way that I know to move a tag is to remove the file from the tag and then copy it again. Revision tree browsers don't seem to handle that very well. This also requires keeping the directory structure under the trunk and ta... | 0 | [
2,
184,
107,
31,
780,
3383,
18,
19,
972,
10898,
800,
3726,
3726,
31,
2536,
972,
10898,
41,
21,
574,
161,
16,
1219,
3383,
18,
9,
14,
104,
161,
30,
31,
143,
20,
780,
21,
3383,
25,
20,
4681,
14,
3893,
37,
14,
3383,
17,
94,
4344... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Three dimensional arrays of integers in C++
===
I would like to find out safe ways of implementing three dimensional arrays of integers in C++, using pointer arithmetic / dynamic memory allocation, or, alternatively using STL techniques such as vectors.
Essentially I want my integer array dimensions to look like:
... | 0 | [
2,
132,
13,
7865,
7718,
18,
16,
13820,
18,
19,
272,
20512,
800,
3726,
3726,
31,
83,
101,
20,
477,
70,
1834,
2847,
16,
17333,
132,
13,
7865,
7718,
18,
16,
13820,
18,
19,
272,
20512,
15,
568,
454,
106,
21211,
13,
118,
7782,
1912,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
REST type API for non web based applications, Is It a good idea?
===
We are developing a middleware SDK, both in C++ and Java to be used as a library/DLL by, for example, game developers, animation software developers, Avatar developers to enhance their products.
Having created a typical API using specific calls fo... | 0 | [
2,
760,
1001,
21,
2159,
26,
538,
2741,
432,
3767,
15,
25,
32,
21,
254,
882,
60,
800,
3726,
3726,
95,
50,
3561,
21,
772,
5011,
13,
18,
43,
197,
15,
156,
19,
272,
20512,
17,
8247,
20,
44,
147,
28,
21,
1248,
118,
43,
211,
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... |
Best Practice for Model Design in Ruby on Rails
===
The RoR tutorials posit one model per table for the ORM to work.
My DB schema has some 70 tables divided conceptually into 5 groups of functionality
(eg, any given table lives in one and only one functional group, and relations between tables of different groups a... | 0 | [
2,
246,
1345,
26,
1061,
704,
19,
10811,
27,
2240,
18,
800,
3726,
3726,
14,
761,
248,
29724,
18,
12928,
242,
53,
1061,
416,
859,
26,
14,
54,
79,
20,
170,
9,
51,
13,
9007,
23874,
63,
109,
3201,
7484,
2350,
14425,
102,
77,
331,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to prevent IE6 from refetching already-fetched images added via DOM manipulation
===
If you add a image to your browser's DOM, IE6 will not check its cache to see if it already downloaded the image but will, instead, re-retrieve it from the server. I have not found any combination of HTTP response headers (of the... | 0 | [
2,
184,
20,
2501,
13,
660,
379,
37,
302,
19813,
7192,
614,
8,
28998,
3502,
905,
1197,
11859,
17561,
800,
3726,
3726,
100,
42,
3547,
21,
1961,
20,
154,
16495,
22,
18,
11859,
15,
13,
660,
379,
129,
52,
2631,
82,
16522,
20,
196,
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... |
The Dependency Inversion Principle
===
What is the Dependency Inversion Principle and why is it important? | 0 | [
2,
14,
26835,
19,
10898,
5897,
800,
3726,
3726,
98,
25,
14,
26835,
19,
10898,
5897,
17,
483,
25,
32,
681,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Learning OpenGl
===
what's a good book for learning OpenGl programming? | 4 | [
2,
2477,
368,
8430,
800,
3726,
3726,
98,
22,
18,
21,
254,
360,
26,
2477,
368,
8430,
3143,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is the best free test tracking software?
===
I'm not talking about bug tracking software (like Bugzilla or Jira). I'm looking for something that will let me:
1. Store test specifications in text format
2. Combine test specs into test coverage scenarios
3. Keep track of the progress through testing scenari... | 4 | [
2,
98,
25,
14,
246,
551,
1289,
10353,
2306,
60,
800,
3726,
3726,
31,
22,
79,
52,
1582,
88,
6256,
10353,
2306,
13,
5,
1403,
6256,
380,
3247,
54,
487,
3517,
6,
9,
31,
22,
79,
699,
26,
301,
30,
129,
408,
55,
45,
137,
9,
1718,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ignore case in Python strings
===
What is the easiest way to compare strings in Python, ignoring case?
Of course one can do (str1.lower() <= str2.lower()), etc., but this created two additional temporary strings (whith the obvious alloc/g-c overheads).
I guess I'm looking for an equivalent to C's stricmp(). | 0 | [
2,
7174,
610,
19,
20059,
7887,
800,
3726,
3726,
98,
25,
14,
27237,
161,
20,
11590,
7887,
19,
20059,
15,
9321,
610,
60,
16,
674,
53,
92,
107,
13,
5,
9729,
165,
9,
17591,
5,
6,
13,
1,
3726,
13,
9729,
135,
9,
17591,
5,
6,
6,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I move a file (or folder) from one folder to another in Subversion
===
I would like to move a file or folder from one place to another within the same repository without having to use Repo Browser to do it, and without creating two independent add/delete operations. Using Repo Browser works fine except that yo... | 0 | [
2,
184,
107,
31,
780,
21,
3893,
13,
5,
248,
19294,
6,
37,
53,
19294,
20,
226,
19,
972,
10898,
800,
3726,
3726,
31,
83,
101,
20,
780,
21,
3893,
54,
19294,
37,
53,
209,
20,
226,
363,
14,
205,
24869,
366,
452,
20,
275,
302,
163... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
APIs and Datasets for Natural Languages?
===
Are there any good APIs and public datasets (dictionaries, phrases) for working w/ natural languages?
Specifically, do any good ones exist for working on translation between English and Korean?
| 0 | [
2,
21,
8954,
17,
1054,
3554,
18,
26,
1112,
2556,
60,
800,
3726,
3726,
50,
80,
186,
254,
21,
8954,
17,
317,
1054,
3554,
18,
13,
5,
22595,
11301,
15,
18492,
6,
26,
638,
619,
118,
1112,
2556,
60,
3524,
15,
107,
186,
254,
53,
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,
0,
0,
0,
0,
0,
0,
0... |
Shared/Static variable in Global.asax isolated per request?
===
I have some ASP.NET web services which all share a common helper class they only need to instantiate one instance of *per server*. It's used for simple translation of data, but does spend some time during start-up loading things from the web.config file, ... | 0 | [
2,
2592,
118,
18077,
7612,
19,
2062,
9,
8588,
396,
6331,
416,
3772,
60,
800,
3726,
3726,
31,
57,
109,
28,
306,
9,
2328,
2741,
687,
56,
65,
1891,
21,
757,
448,
106,
718,
59,
104,
376,
20,
6322,
15882,
53,
4851,
16,
1637,
1432,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Setting the namespace of a WinForms UserControl in VB.NET
===
How do you define your UserControls as being in a namespace below the project namespace, ie. [RootNameSpace].[SubSectionOfProgram].Controls? | 0 | [
2,
2697,
14,
204,
5582,
16,
21,
628,
4190,
18,
4155,
12898,
19,
13,
20468,
9,
2328,
800,
3726,
3726,
184,
107,
42,
9267,
154,
4155,
12898,
18,
28,
142,
19,
21,
204,
5582,
1021,
14,
669,
204,
5582,
15,
13,
660,
9,
636,
14032,
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,
0,
0,
0,
0... |
.Net 2+: why does if( 1 == null ) no longer throw a compiler exception?
===
I'm using `int` as an example, but this applies to any value type in .Net
In .Net 1 the following would throw a compiler exception:
int i = SomeFunctionThatReturnsInt();
if( i == null ) //compiler exception here
Now (i... | 0 | [
2,
13,
9,
2328,
13,
21812,
45,
483,
630,
100,
5,
137,
800,
3726,
16203,
13,
6,
90,
1045,
3814,
21,
21486,
5391,
60,
800,
3726,
3726,
31,
22,
79,
568,
13,
1,
6391,
1,
28,
40,
823,
15,
47,
48,
13169,
20,
186,
1923,
1001,
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... |
What's the best way to separate PHP Code and HTML
===
I realy don't like mixing PHP and HTML. It makes it difficult to maintain both the PHP and the HTML, and it just makes sense to keep the two apart.
How to do it? | 4 | [
2,
98,
22,
18,
14,
246,
161,
20,
1725,
13,
26120,
1797,
17,
13,
15895,
800,
3726,
3726,
31,
683,
93,
221,
22,
38,
101,
5826,
13,
26120,
17,
13,
15895,
9,
32,
1364,
32,
1956,
20,
4027,
156,
14,
13,
26120,
17,
14,
13,
15895,
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 the best way to merge mp3 files?
===
I've got many, many mp3 files that I would like to merge into a single file. I've used the command line method
copy /b 1.mp3+2.mp3 3.mp3
but it's a pain when there's a lot of them and they're naming is inconsistent. The time never seems to come out right either. | 0 | [
2,
98,
25,
14,
246,
161,
20,
12666,
4628,
240,
6488,
60,
800,
3726,
3726,
31,
22,
195,
330,
151,
15,
151,
4628,
240,
6488,
30,
31,
83,
101,
20,
12666,
77,
21,
345,
3893,
9,
31,
22,
195,
147,
14,
1202,
293,
2109,
4344,
13,
11... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 detect application Level Focus-In in Qt 4.4.1?
===
I need to determine when my Qt 4.4.1 application receives focus.
I have come up with 2 possible solutions, but they both don’t work exactly as I would like.
In the first possible solution, I connect the focusChanged() signal from qApp to a SLOT. In the... | 0 | [
2,
184,
107,
31,
9092,
3010,
662,
1776,
8,
108,
19,
2593,
38,
268,
9,
300,
9,
165,
60,
800,
3726,
3726,
31,
376,
20,
3746,
76,
51,
2593,
38,
268,
9,
300,
9,
165,
3010,
8359,
1776,
9,
31,
57,
340,
71,
29,
172,
938,
6776,
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... |
Getting PEAR to work on XAMPP (Apache/MySQL stack on Windows)
===
I'm trying to install [Laconica][1], an open-source Microblogging application on my Windows development server using XAMPP as per the [instructions provided][2].
The website cannot find PEAR, and throws the below errors:
Warning: require_once(PEAR... | 0 | [
2,
1017,
16619,
20,
170,
27,
993,
765,
3421,
13,
5,
7738,
2569,
118,
915,
18,
22402,
7566,
27,
1936,
6,
800,
3726,
3726,
31,
22,
79,
749,
20,
16146,
636,
9439,
23308,
500,
2558,
165,
500,
15,
40,
368,
8,
12097,
2899,
220,
13919,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Implementing Porter-Duff Rules in Direct3D
===
What Direct3D render states should be used to implement Java's Porter-Duff compositing rules (CLEAR, SRC, SRCOVER, etc.)? | 0 | [
2,
17333,
8158,
8,
43,
5386,
1761,
19,
1744,
240,
43,
800,
3726,
3726,
98,
1744,
240,
43,
16535,
202,
378,
44,
147,
20,
8713,
8247,
22,
18,
8158,
8,
43,
5386,
6479,
9753,
1203,
1761,
13,
5,
18600,
15,
13,
18,
5453,
15,
3441,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
GDI+ DrawImage() with transparent bitmap to a printer
===
Does anybody have any pointers on how to successfully draw a bitmap that has
an alpha channel using Graphics::DrawImage() when the Graphics context is
created based on a printer HDC? The printer drivers don't generally support alpha blending - so is there an ... | 0 | [
2,
489,
1115,
2430,
2003,
22039,
5,
6,
29,
14862,
1142,
15022,
20,
21,
12925,
800,
3726,
3726,
630,
11181,
57,
186,
454,
445,
27,
184,
20,
3673,
2003,
21,
1142,
15022,
30,
63,
40,
5705,
1318,
568,
8351,
45,
45,
43,
12404,
22039,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Performing validation on a databound object after the property has been updated
===
I have a basic form with controls that are databound to an object implementing the _INotifyPropertyChanged_ interface. I would like to add some validation to a couple of properties but dont want to go through implementing _IDataErrorI... | 0 | [
2,
2955,
27999,
27,
21,
1054,
7410,
3095,
75,
14,
1354,
63,
74,
6372,
800,
3726,
3726,
31,
57,
21,
2125,
505,
29,
8671,
30,
50,
1054,
7410,
20,
40,
3095,
17333,
14,
13,
1,
49,
1270,
8612,
10890,
106,
1084,
16229,
43,
1,
6573,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 start working in open source projects????
===
Im planning to start working in opensource projects. Give some ideas related to that and give references also.. | 0 | [
2,
184,
107,
31,
799,
638,
19,
368,
1267,
2314,
60,
60,
60,
60,
800,
3726,
3726,
797,
2334,
20,
799,
638,
19,
368,
12097,
2314,
9,
590,
109,
3478,
1597,
20,
30,
17,
590,
7231,
67,
9,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Good text on order analysis
===
As a self-taught computer programmer, I'm often at a loss to estimate the O() value for a particular operation. Yeah, I know off the top of my head most of the important ones, like for the major sorts and searches, but I don't know how to calculate one when something new comes along, u... | 0 | [
2,
254,
1854,
27,
389,
2495,
800,
3726,
3726,
28,
21,
1119,
8,
38,
12647,
1428,
17968,
15,
31,
22,
79,
478,
35,
21,
1526,
20,
10243,
14,
635,
5,
6,
1923,
26,
21,
1498,
1453,
9,
3979,
15,
31,
143,
168,
14,
371,
16,
51,
157,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Accessing a bean with a dot(.) in its ID
===
In a flow definition, I am trying to access a bean that has a dot in its ID
(example: `<evaluate expression="bus.MyServiceFacade.someAction()" />`
However, it does not work. SWF tries to find a bean "bus" instead.
Initially, I got over it by using a helper bean to ... | 0 | [
2,
1381,
68,
21,
15322,
29,
21,
14123,
5,
9,
6,
19,
82,
4924,
800,
3726,
3726,
19,
21,
3312,
5465,
15,
31,
589,
749,
20,
1381,
21,
15322,
30,
63,
21,
14123,
19,
82,
4924,
13,
5,
29041,
45,
13,
1,
15599,
1803,
3726,
7,
3822,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SVN externals sub folder changes not showing in view log (tortoise svn)
===
SVN externals allow you to make an SVN folder appear as if it's at another location. A good use for this is having a common folder shared across all of your projects in SVN.
I have a /trunk/common folder in SVN that I share via several dif... | 0 | [
2,
13,
18,
16578,
4886,
18,
972,
19294,
1693,
52,
3187,
19,
1418,
6738,
13,
5,
2153,
38,
16238,
13,
18,
16578,
6,
800,
3726,
3726,
13,
18,
16578,
4886,
18,
1655,
42,
20,
233,
40,
13,
18,
16578,
19294,
1893,
28,
100,
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... |
IIS crashes when serving an ASP.NET application under heavy load. How to troubleshoot it?
===
I am working on an ASP.NET web application, it seems to be working properly when I try to debug it in Visual Studio. However when I emulate heavy load, IIS crashes without any trace -- log entry in the system journal is very ... | 0 | [
2,
595,
18,
21563,
76,
1799,
40,
28,
306,
9,
2328,
3010,
131,
1278,
6305,
9,
184,
20,
2572,
12511,
32,
60,
800,
3726,
3726,
31,
589,
638,
27,
40,
28,
306,
9,
2328,
2741,
3010,
15,
32,
2206,
20,
44,
638,
7428,
76,
31,
1131,
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... |
polyline with gradient
===
Is there a way to draw a line along a curved path with a gradient that varies in a direction perpendicular to the direction of the line? I am using the GDI+ framework for my graphics. | 0 | [
2,
3446,
1143,
29,
17442,
800,
3726,
3726,
25,
80,
21,
161,
20,
2003,
21,
293,
303,
21,
9279,
2013,
29,
21,
17442,
30,
9803,
19,
21,
1400,
20659,
20,
14,
1400,
16,
14,
293,
60,
31,
589,
568,
14,
489,
1115,
2430,
6596,
26,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How check if given string is legal (allowed) file name under Windows?
===
I want to include batch file rename functionality in my application. User can type destination filename pattern and (after replacing some wildcards in pattern) I need to check if it's going to be legal filename under Windows. I tried to use regu... | 0 | [
2,
184,
2631,
100,
504,
3724,
25,
1517,
13,
5,
17976,
69,
6,
3893,
204,
131,
1936,
60,
800,
3726,
3726,
31,
259,
20,
468,
13064,
3893,
302,
7259,
18548,
19,
51,
3010,
9,
4155,
92,
1001,
6970,
3893,
7259,
3732,
17,
13,
5,
5162,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 the Edit -> Copy menu in c#/.net
===
How do I implement a Copy menu item in a Windows application written in .NET 2.0?
I want to let the user to mark some rows in a datagrid and then select the Copy menu item from an Edit menu in the menubar of the application and then do a Paste in for example Exc... | 0 | [
2,
184,
20,
8713,
14,
9392,
13,
8,
1,
4344,
11379,
19,
272,
5910,
118,
9,
2328,
800,
3726,
3726,
184,
107,
31,
8713,
21,
4344,
11379,
9101,
19,
21,
1936,
3010,
642,
19,
13,
9,
2328,
172,
9,
387,
60,
31,
259,
20,
408,
14,
415... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should you design websites that require JavaScript in this day & age?
===
It's fall of 2008, and I still hear developers say that you should not design a site that requires JavaScript.
I understand that you should develop sites that degrade gracefully when JS is not present/on. But at what point do you not include... | 0 | [
2,
378,
42,
704,
13931,
30,
4077,
8247,
8741,
19,
48,
208,
279,
348,
60,
800,
3726,
3726,
32,
22,
18,
1080,
16,
570,
15,
17,
31,
174,
990,
10168,
395,
30,
42,
378,
52,
704,
21,
689,
30,
4781,
8247,
8741,
9,
31,
1369,
30,
42,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Applying AOP
===
I've been using some basic AOP style solutions for cross-cutting concerns like security, logging, validation, etc. My solution has envolved around [Castle Windsor][1] and DynamicProxy. I've gone down this route because I can apply everything using a Boo based DSL and keep my code clean of Attributes... | 0 | [
2,
11989,
21,
2594,
800,
3726,
3726,
31,
22,
195,
74,
568,
109,
2125,
21,
2594,
1034,
6776,
26,
919,
8,
26156,
4823,
101,
1221,
15,
13,
13919,
15,
27999,
15,
2722,
9,
51,
4295,
63,
1957,
5847,
4763,
140,
636,
16736,
10784,
500,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 XS Duration to TimeSpan in VB.Net?
===
Is there a standard library method that converts a string that has duration in the standard XS:Duration format into the .NET TimeSpan object?
For example, P0DT1H0M0S which represents a duration of one hour, is converted into New TimeSpan(0,1,0,0,0).
A Reverse... | 0 | [
2,
184,
20,
8406,
993,
18,
9403,
20,
436,
3206,
19,
13,
20468,
9,
2328,
60,
800,
3726,
3726,
25,
80,
21,
1236,
1248,
2109,
30,
8406,
18,
21,
3724,
30,
63,
9403,
19,
14,
1236,
993,
18,
45,
10852,
857,
2595,
77,
14,
13,
9,
232... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Exceptions not passed correctly thru RCF (using Boost.Serialization)
===
I use RCF with boost.serialization (why use RCF's copy when we already use the original?) It works OK, but when an exception is thrown in the server, it's not passed correctly to the client. Instead, I get an RCF::SerializationException quoting a... | 0 | [
2,
13392,
52,
1100,
12044,
19637,
761,
8940,
13,
5,
12655,
10419,
9,
4104,
2815,
1829,
6,
800,
3726,
3726,
31,
275,
761,
8940,
29,
10419,
9,
4104,
2815,
1829,
13,
5,
2256,
275,
761,
8940,
22,
18,
4344,
76,
95,
614,
275,
14,
501,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Difference between binary semaphore and mutex.
===
Is there any difference between binary semaphore and mutex or they are essentialy same? | 0 | [
2,
2841,
128,
14171,
13,
18,
5996,
11093,
62,
17,
20562,
396,
9,
800,
3726,
3726,
25,
80,
186,
2841,
128,
14171,
13,
18,
5996,
11093,
62,
17,
20562,
396,
54,
59,
50,
5832,
93,
205,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What could be good ways to deploy ASP.Net Web Applications?
===
We currently deploy web applications by creating a database and running SQL scripts through query analyzer. Then we copy the output from "publish website" and set up that website in IIS.
We have seen websetup in visual studio, but that part seems to b... | 0 | [
2,
98,
110,
44,
254,
2847,
20,
17617,
28,
306,
9,
2328,
2741,
3767,
60,
800,
3726,
3726,
95,
871,
17617,
2741,
3767,
34,
2936,
21,
6018,
17,
946,
4444,
255,
17505,
120,
25597,
16051,
139,
9,
94,
95,
4344,
14,
5196,
37,
13,
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... |
Reading data from a log file as a separate application is writing to it.
===
I would like to monitor a log file that is being written to by an application. I want to process the file line by line as, or shortly after, it is written. I have not found a way of detecting that a file has been extended after reaching eof.
... | 0 | [
2,
1876,
1054,
37,
21,
6738,
3893,
28,
21,
1725,
3010,
25,
1174,
20,
32,
9,
800,
3726,
3726,
31,
83,
101,
20,
7626,
21,
6738,
3893,
30,
25,
142,
642,
20,
34,
40,
3010,
9,
31,
259,
20,
953,
14,
3893,
293,
34,
293,
28,
15,
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... |
Regression Testing with Rational Robot
===
Is it possible to run a pre-recorded Rational Robot script on a continuous integration server in a manner that doesn't require the machine to be physically logged into?
| 0 | [
2,
27369,
4431,
29,
7511,
8288,
800,
3726,
3726,
25,
32,
938,
20,
485,
21,
782,
8,
12538,
7511,
8288,
3884,
27,
21,
6357,
8078,
8128,
19,
21,
3832,
30,
1437,
22,
38,
4077,
14,
1940,
20,
44,
7994,
13,
19287,
77,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Can we have customized "Date Prompt" in cognos8?
===
I am working with Cognos8 Report Studio. In my report there are two date prompts, (1) START date, (2) END date. Users can select two different dates or two same dates. But the report has valid data only for last business date of each month. For example, if Jan 31 is... | 0 | [
2,
92,
95,
57,
28779,
13,
7,
8209,
11443,
4417,
7,
19,
326,
17036,
18,
457,
60,
800,
3726,
3726,
31,
589,
638,
29,
326,
17036,
18,
457,
1330,
1120,
9,
19,
51,
1330,
80,
50,
81,
1231,
11443,
13531,
15,
13,
5,
165,
6,
799,
123... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 mac address for remote computer under NT4 in C
===
Is it possible to get the mac address for a remote connection under NT4. The remote pc opens a socket connection into the program and I can get the ip address but need the mac.
I have tried using SendARP but this doesn't seem to be supported in NT4.
| 0 | [
2,
164,
1572,
3218,
26,
5388,
1428,
131,
13,
2877,
300,
19,
272,
800,
3726,
3726,
25,
32,
938,
20,
164,
14,
1572,
3218,
26,
21,
5388,
2760,
131,
13,
2877,
300,
9,
14,
5388,
5168,
8965,
21,
18482,
2760,
77,
14,
625,
17,
31,
92,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 save and retrieve binary files with Oracle 10g?
===
I'm about to implement a feature in our application that allows the user to 'upload' a PDF or Microsoft PowerPoint document, which the application will then make available to other users in a viewer (so they don't get to 'download' it in the 'S... | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
2079,
17,
11917,
14171,
6488,
29,
15759,
332,
263,
60,
800,
3726,
3726,
31,
22,
79,
88,
20,
8713,
21,
1580,
19,
318,
3010,
30,
2965,
14,
4155,
20,
13,
22,
576,
8294,
22,
21,
13,
11124,
54,
70... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using Actionscript 3 to connect to a database
===
I'm looking for advice on how to dynamically create content in flash based on a database. Initially I was thinking that we would export the database to an XML file and use the built in Actionscript XML parser to take care of that, however the size of the XML file may ... | 0 | [
2,
568,
1028,
8741,
203,
20,
6379,
20,
21,
6018,
800,
3726,
3726,
31,
22,
79,
699,
26,
4978,
27,
184,
20,
7782,
1326,
1600,
2331,
19,
4433,
432,
27,
21,
6018,
9,
1537,
31,
23,
1440,
30,
95,
83,
7487,
14,
6018,
20,
40,
23504,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Shareware marketing
===
I make a shareware application, a good one if I say so myself.
I have a listing on all major and minor download sites, which update automatically when I release a new version. My main problem is that I am only selling hundreds of licenses when I should be selling thousands.
I send out pr... | 0 | [
2,
1891,
5011,
4743,
800,
3726,
3726,
31,
233,
21,
1891,
5011,
3010,
15,
21,
254,
53,
100,
31,
395,
86,
992,
9,
31,
57,
21,
9554,
27,
65,
394,
17,
1689,
7121,
3259,
15,
56,
11100,
7499,
76,
31,
830,
21,
78,
615,
9,
51,
407,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Predefined Dialog templates in VB.NET?
===
In VB.NET is there a library of template dialogs I can use? It's easy to create a custom dialog and inherit from that, but it seems like there would be some templates for that sor tof thing.
I just need something simple like Save/Cancel, Yes/No, etc. | 0 | [
2,
782,
13439,
28223,
22894,
18,
19,
13,
20468,
9,
2328,
60,
800,
3726,
3726,
19,
13,
20468,
9,
2328,
25,
80,
21,
1248,
16,
22894,
28223,
18,
31,
92,
275,
60,
32,
22,
18,
2010,
20,
1600,
21,
5816,
28223,
17,
17569,
37,
30,
15,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get logout to work on RubyCAS-Server?
===
I have installed and setup RubyCAS-Server and RubyCAS-Client on my machine. Login works perfectly but when I try to logout I get this error message from the RubyCAS-Server:
Camping Problem!
CASServer::Controllers::Logout.GET
ActiveRecord::Statemen... | 0 | [
2,
184,
107,
31,
164,
6738,
1320,
20,
170,
27,
10811,
5949,
8,
10321,
106,
60,
800,
3726,
3726,
31,
57,
4066,
17,
18161,
10811,
5949,
8,
10321,
106,
17,
10811,
5949,
8,
150,
18513,
38,
27,
51,
1940,
9,
6738,
108,
693,
5759,
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... |
Using GCC from within VS 2005(8) IDE
===
**Is there a way to utilise the GCC compiler whilst still being able to develop via the Visual Studio IDE?**
Our project is cross-platform, and I quite frequently get into trouble from my [colleague][1] because I'm checking in code that's not standards compliant (this can be... | 0 | [
2,
568,
489,
3384,
37,
363,
4611,
812,
5,
457,
6,
13,
3448,
800,
3726,
3726,
13,
1409,
403,
80,
21,
161,
20,
13,
14255,
2628,
14,
489,
3384,
21486,
4575,
174,
142,
777,
20,
2803,
1197,
14,
3458,
1120,
13,
3448,
60,
1409,
318,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 vs Threads
===
How to decide whether to use threads or create seprate process altogether in your application to achieve parallelism. | 0 | [
2,
953,
4611,
20396,
800,
3726,
3726,
184,
20,
4073,
1472,
20,
275,
20396,
54,
1600,
10332,
5487,
953,
11206,
19,
154,
3010,
20,
4689,
3821,
756,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
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... |
What does the number in brackets shown after unix command names mean ?
===
E.g man(1), find(3), updatedb(2) ?
what do these numbers mean ? | 2 | [
2,
98,
630,
14,
234,
19,
21971,
1721,
75,
22540,
1202,
1817,
884,
13,
60,
800,
3726,
3726,
13,
62,
9,
263,
169,
5,
165,
6,
15,
477,
5,
240,
6,
15,
6372,
220,
5,
135,
6,
13,
60,
98,
107,
158,
2116,
884,
13,
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,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Misra standard for embedded software.
===
I have a requirement to make a large amount of code MISRA compliant.
First question: Can somebody to give an **estimation** for passing well written code for embedded system based on experience. I understand that "well written" is poorly defined and vague so i ask for raw e... | 0 | [
2,
2462,
525,
1236,
26,
12138,
2306,
9,
800,
3726,
3726,
31,
57,
21,
8981,
20,
233,
21,
370,
2006,
16,
1797,
2462,
525,
13,
25509,
9,
64,
1301,
45,
92,
8861,
20,
590,
40,
13,
1409,
15018,
79,
857,
1409,
26,
2848,
134,
642,
179... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Implementing CollectionConstraints across NUnit versions
===
We've implemented a CollectionConstraint for Nunit in version 2.4.3 in C#. Some of our developers have already upgraded to version 2.4.7 though, and they get project creation errors when compiling. The error is "doMatch: no suitable method found to overrid... | 0 | [
2,
17333,
1206,
12124,
11809,
38,
18,
464,
10210,
242,
3281,
800,
3726,
3726,
95,
22,
195,
6807,
21,
1206,
12124,
11809,
38,
26,
10210,
242,
19,
615,
172,
9,
300,
9,
240,
19,
272,
5910,
9,
109,
16,
318,
10168,
57,
614,
9958,
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 are the Basics of Networking/Sys-administration a Programmer Should Know?
===
Like:
* Learning the basic troubleshooting skills
* Learning how to configure a network
* Understanding different types of networks
* etc.
I was configuring a home network between my Windows and Ubuntu machine and I had a tough... | 0 | [
2,
98,
50,
14,
2125,
18,
16,
16230,
118,
4980,
18,
8,
1283,
2160,
702,
5946,
21,
17968,
378,
143,
60,
800,
3726,
3726,
101,
45,
1637,
2477,
14,
2125,
2572,
12511,
68,
3207,
1637,
2477,
184,
20,
1065,
15951,
21,
982,
1637,
3260,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 extend Linq to SQL?
===
Last year, Scott Guthrie <a href="http://weblogs.asp.net/scottgu/archive/2007/07/31/linq-to-sql-debug-visualizer.aspx">stated</a> “You can actually override the raw SQL that LINQ to SQL uses if you want absolute control over the SQL executed”, but I can’t find documentation describin... | 0 | [
2,
184,
107,
42,
7206,
6294,
1251,
20,
4444,
255,
60,
800,
3726,
3726,
236,
159,
15,
1824,
22472,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
14113,
5567,
18,
9,
472,
306,
9,
2328,
118,
18,
5987,
3073,
118,
23941,
118,
2727,
11... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP.NET WebService Returns Gibberish Characters When Throwing Exceptions
===
Greetings!
I have a web service (ASMX) and in it, a web method that does some work and throws an exception if the input wasn't valid.
[ScriptMethod]
[WebMethod]
public string MyWebMethod(string input)
{
strin... | 0 | [
2,
28,
306,
9,
2328,
2741,
11449,
4815,
18814,
106,
1595,
1766,
76,
6033,
13392,
800,
3726,
3726,
13769,
18,
187,
31,
57,
21,
2741,
365,
13,
5,
472,
79,
396,
6,
17,
19,
32,
15,
21,
2741,
2109,
30,
630,
109,
170,
17,
13566,
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 write a C++ FireFox 3 plugin (not extension) on Windows?
===
Could someone write-up a step by step guide to developing a C++ based plugin for FireFox on Windows?
The links and examples on http://www.mozilla.org/projects/plugins/ are all old and inaccurate - the "NEW" link was added to the page in 2004.
... | 0 | [
2,
184,
20,
2757,
21,
272,
20512,
535,
18219,
203,
10922,
108,
13,
5,
1270,
3896,
6,
27,
1936,
60,
800,
3726,
3726,
110,
737,
2757,
8,
576,
21,
1424,
34,
1424,
3378,
20,
3561,
21,
272,
20512,
432,
10922,
108,
26,
535,
18219,
27,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way of constructing dynamic sql queries in C#/.NET3.5?
===
A project I'm working on at the moment involves refactoring a C# Com Object which serves as a database access layer to some Sql 2005 databases.
The author of the existent code has built all the sql queries manually using a string and many if-statements... | 0 | [
2,
246,
161,
16,
18660,
7782,
4444,
255,
9386,
2829,
19,
272,
5910,
118,
9,
2328,
240,
9,
264,
60,
800,
3726,
3726,
21,
669,
31,
22,
79,
638,
27,
35,
14,
688,
6569,
302,
17455,
68,
21,
272,
5910,
13,
960,
3095,
56,
2589,
28,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Access Global .resx file in ASP.Net View Page
===
I am currently building in Version 3.5 of the .Net framework and I have a resource (.resx) file that I am trying to access in a web application. I have exposed the .resx properties as public access modifiers and am able to access these properties in the controller fil... | 0 | [
2,
1381,
2062,
13,
9,
99,
18,
396,
3893,
19,
28,
306,
9,
2328,
1418,
2478,
800,
3726,
3726,
31,
589,
871,
353,
19,
615,
203,
9,
264,
16,
14,
13,
9,
2328,
6596,
17,
31,
57,
21,
6577,
13,
5,
9,
99,
18,
396,
6,
3893,
30,
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... |
C# SQL Restore database to default data location
===
I'm writing a C# application which downloads a compressed database backup via FTP. The application then needs to extract the backup and restore it to the default database location.
Since I won't know what version of SQL will be installed on the machine where the... | 0 | [
2,
272,
5910,
4444,
255,
8454,
6018,
20,
12838,
1054,
1474,
800,
3726,
3726,
31,
22,
79,
1174,
21,
272,
5910,
3010,
56,
7121,
18,
21,
18472,
6018,
10119,
1197,
1187,
306,
9,
14,
3010,
94,
2274,
20,
10962,
14,
10119,
17,
8454,
32,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
BufferedImage in IKVM
===
What is the best and/or easiest way to replace the missing BufferedImage functionality for a Java project I am converting to .NET with IKVM?
I'm basically getting "cli.System.NotImplementedException: BufferedImage" exceptions when running the application, which otherwise runs fine. | 0 | [
2,
17497,
69,
22039,
19,
13,
2883,
20147,
800,
3726,
3726,
98,
25,
14,
246,
17,
118,
248,
27237,
161,
20,
3934,
14,
2863,
17497,
69,
22039,
18548,
26,
21,
8247,
669,
31,
589,
19583,
20,
13,
9,
2328,
29,
13,
2883,
20147,
60,
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... |
AS3 FTP Programming and the Socket and ByteArray Classes
===
Sorry for the subject line sounding like an even nerdier Harry Potter title.
I'm trying to use AS3's Socket class to write a simple FTP program to export as an AIR app in Flex Builder 3. I'm using an FTP server on my local network to test the program. I... | 0 | [
2,
28,
240,
1187,
306,
3143,
17,
14,
18482,
17,
34,
591,
8576,
93,
2684,
800,
3726,
3726,
1875,
26,
14,
1550,
293,
10879,
101,
40,
166,
25758,
1944,
2706,
9777,
581,
9,
31,
22,
79,
749,
20,
275,
28,
240,
22,
18,
18482,
718,
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 learn Java5 or Java6?
===
I'm a very experienced Java programmer who has spent my entire time working with Java 1.4 and earlier. Where can I find a quick reference that will give me everything I need to know about the new features in Java5 and later in a quick reference? | 0 | [
2,
184,
107,
31,
2484,
8247,
264,
54,
8247,
379,
60,
800,
3726,
3726,
31,
22,
79,
21,
253,
3882,
8247,
17968,
72,
63,
1111,
51,
1078,
85,
638,
29,
8247,
137,
9,
300,
17,
1201,
9,
113,
92,
31,
477,
21,
2231,
2801,
30,
129,
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... |
WCF Datacontract free serialization (3.5 SP1)
===
Has anybody got this to actually work? Documentation is non existent on how to enable this feature and I get missing attribute exceptions despite having a 3.5 SP1 project. | 0 | [
2,
11801,
410,
1054,
23311,
551,
5956,
1829,
13,
5,
240,
9,
264,
3782,
165,
6,
800,
3726,
3726,
63,
11181,
330,
48,
20,
1121,
170,
60,
13945,
25,
538,
13,
20788,
27,
184,
20,
9240,
48,
1580,
17,
31,
164,
2863,
35,
14755,
13392,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Is there a way around coding in Python without the tab, indent & whitespace criteria?
===
I want to start using Python for small projects but the fact that a misplaced tab or indent can throw a compile error is really getting on my nerves. Is there some type of setting to turn this off?
I'm currently using NotePad+... | 0 | [
2,
25,
80,
21,
161,
140,
13,
15458,
19,
20059,
366,
14,
6523,
15,
19,
817,
38,
279,
359,
5582,
9157,
60,
800,
3726,
3726,
31,
259,
20,
799,
568,
20059,
26,
284,
2314,
47,
14,
837,
30,
21,
2462,
12449,
6523,
54,
19,
817,
38,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Surrogate Vs. Natural/Business Keys
===
Here we go again, the old argument still arises... we'd better have a business key as a primary key, or we'd rather have a surrogate id (i.e. an SQL Server identity) with a unique constraint on the business key field? Please, provide examples or proof to support your theory. | 0 | [
2,
28525,
4611,
9,
1112,
118,
18717,
5534,
800,
3726,
3726,
235,
95,
162,
188,
15,
14,
315,
5476,
174,
21461,
9,
9,
9,
95,
22,
43,
574,
57,
21,
508,
1246,
28,
21,
1256,
1246,
15,
54,
95,
22,
43,
864,
57,
21,
28525,
4924,
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... |
Scrum Process Management - tips, pitfalls, ideas
===
I've been doing scrum with a team for a while, but things seem messy for whatever reasons. I've been thinking on how they can be changed and have a couple of questions that would like to raise here.
First, what should be the role of testers, designers and non-dev... | 0 | [
2,
26562,
953,
1097,
13,
8,
11034,
15,
4175,
5660,
18,
15,
3478,
800,
3726,
3726,
31,
22,
195,
74,
845,
26562,
29,
21,
173,
26,
21,
133,
15,
47,
564,
2260,
21503,
26,
2099,
2932,
9,
31,
22,
195,
74,
1440,
27,
184,
59,
92,
44... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Smarter Vim recovery?
===
When a previous Vim session crashed, you are greeted with the "Swap file ... already exists!" for each and every file that was open in the previous session.
Can you make this Vim recovery prompt smarter? (Without switching off recovery!) Specifically, I'm thinking of:
- If the swapped... | 0 | [
2,
3978,
106,
1790,
79,
6550,
60,
800,
3726,
3726,
76,
21,
1158,
1790,
79,
3723,
7579,
15,
42,
50,
12268,
29,
14,
13,
7,
18,
1608,
306,
3893,
13,
9,
9,
9,
614,
5636,
187,
7,
26,
206,
17,
352,
3893,
30,
23,
368,
19,
14,
115... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 remove this parallel heirachy
===
I'm trying to find the best design for the following scenario - which is an application to store results of dance comeptitions.
An event contains multiple rounds, each round contains a number of performances (one per dance). Each performance is judged by many judges, who re... | 0 | [
2,
184,
20,
4681,
48,
3821,
24,
3517,
5864,
800,
3726,
3726,
31,
22,
79,
749,
20,
477,
14,
246,
704,
26,
14,
249,
12705,
13,
8,
56,
25,
40,
3010,
20,
1718,
1736,
16,
1329,
340,
4417,
9861,
18,
9,
40,
807,
1588,
1886,
5839,
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... |
Blocking part of a website
===
I am trying to block Google Reader:
reader.google.com
www.google.com/reader
I blocked reader.google.com by changing my /etc/hosts file (this is for a Mac)
Is there any way to block www.google.com/reader without buying software?
Note this is for Safari so Greasemonkey won't w... | 0 | [
2,
11828,
141,
16,
21,
2271,
800,
3726,
3726,
31,
589,
749,
20,
1921,
8144,
7765,
45,
7765,
9,
16111,
4875,
9,
960,
13,
6483,
9,
16111,
4875,
9,
960,
118,
10647,
106,
31,
8388,
7765,
9,
16111,
4875,
9,
960,
34,
4226,
51,
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... |
Add Custom TextboxCell to a DataGridView control that contains a button to open the FileDialog
===
I would like to add a DataGridViewTextBoxCell cell to a DataGridViewCell control, but as well as being able to type in the text cell as normal it must also contain a '...' button that once clicks brings up the OpenFileDi... | 0 | [
2,
3547,
5816,
1854,
5309,
9725,
20,
21,
1054,
16375,
4725,
569,
30,
1588,
21,
5167,
20,
368,
14,
5263,
549,
5567,
800,
3726,
3726,
31,
83,
101,
20,
3547,
21,
1054,
16375,
4725,
11969,
5309,
9725,
1667,
20,
21,
1054,
16375,
4725,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Reuse/Release Equivalence Principle
===
What is the Reuse/Release Equivalence Principle and why is it important? | 0 | [
2,
14,
302,
3699,
118,
15202,
27368,
5897,
800,
3726,
3726,
98,
25,
14,
302,
3699,
118,
15202,
27368,
5897,
17,
483,
25,
32,
681,
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... | [
1,
1,
1,
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... |
How to handle file uploads to a dedicated image server?
===
I got a webserver with a running application. There's a webpage with a form: some text data and a file upload field. Now, what I would like to have is it working like this:
The file is sent to the dedicated server, diffrent then the one application is runn... | 0 | [
2,
184,
20,
3053,
3893,
71,
8294,
18,
20,
21,
2360,
1961,
8128,
60,
800,
3726,
3726,
31,
330,
21,
2741,
10321,
106,
29,
21,
946,
3010,
9,
80,
22,
18,
21,
2741,
6486,
29,
21,
505,
45,
109,
1854,
1054,
17,
21,
3893,
71,
8294,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.