unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
How to get rid of stupid "pad" labels produced by RTML functions?
===
I am unlucky to be in charge of maintaining some old Yahoo! Store built using their RTML-based platform.
Recently I've noticed that HTML code generated by some RTML functions is sprinkled all over with "padding images" (or whatever is the convent... | 0 | [
2,
184,
20,
164,
6681,
16,
3553,
13,
7,
8240,
7,
13173,
671,
34,
13,
5256,
8184,
3719,
60,
800,
3726,
3726,
31,
589,
367,
20653,
20,
44,
19,
1906,
16,
8215,
109,
315,
23553,
187,
1718,
392,
568,
66,
13,
5256,
8184,
8,
1281,
24... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 memoize a recursive funtion in Lisp
===
I'm a Lisp beginner. I'm trying to memoize a recursive function for calculating the number of terms in a [Collatz sequence](http://en.wikipedia.org/wiki/Collatz_conjecture) (for problem 14 in [Project Euler](http://projecteuler.net/index.php?section=problems&id=14)). My... | 0 | [
2,
184,
107,
31,
22236,
2952,
21,
302,
24244,
2414,
3309,
19,
2093,
3401,
800,
3726,
3726,
31,
22,
79,
21,
2093,
3401,
26931,
9,
31,
22,
79,
749,
20,
22236,
2952,
21,
302,
24244,
1990,
26,
22937,
14,
234,
16,
1663,
19,
21,
636,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Skip List vs. Binary Tree
===
I recently came across the data structure known as a [Skip list](http://en.wikipedia.org/wiki/Skip_list). They seem to have very similar behavior to a binary search tree... my question is - why would you ever want to use a skip list over a binary search tree? | 0 | [
2,
12532,
968,
4611,
9,
14171,
1541,
800,
3726,
3726,
31,
1989,
281,
464,
14,
1054,
1411,
167,
28,
21,
636,
2413,
306,
968,
500,
5,
21127,
6903,
219,
9,
17375,
26132,
9,
5583,
118,
17375,
118,
2413,
306,
1,
5739,
6,
9,
59,
2260,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 programming approach/methodology to assure thread safety
===
When I was learning Java coming from a background of some 20 years of procedural programming with basic, Pascal, COBOL and C, I thought at the time that the hardest thing about it was wrapping my head around the OOP jargon and concepts. Now with about ... | 0 | [
2,
246,
3143,
2141,
118,
5909,
1807,
43,
4202,
20,
13421,
9322,
2108,
800,
3726,
3726,
76,
31,
23,
2477,
8247,
880,
37,
21,
2395,
16,
109,
434,
122,
16,
26429,
3143,
29,
2125,
15,
18661,
15,
326,
6966,
17,
272,
15,
31,
289,
35,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Image uploading from URL
===
I have an aspx page,where the user will enter a valid image url(ex : http://stackoverflow.com/Content/Img/stackoverflow-logo-250.png).
I need the program to upload this image to the Server.
How can i do this ? | 0 | [
2,
28,
306,
9,
2328,
1961,
71,
16866,
37,
287,
6362,
800,
3726,
3726,
31,
57,
40,
28,
306,
396,
2478,
15,
2798,
14,
4155,
129,
2830,
21,
7394,
1961,
287,
6362,
5,
1706,
13,
45,
7775,
6903,
25325,
2549,
9990,
9,
960,
118,
25424,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Parsing a local XML Document in WPF (works in debug, fails once published).
===
I am building a WPF application. Inside that application I am using the XmlReader class to parse several local XML files. The code I have written **works perfectly** during debugging, but fails once I publish the application and install i... | 0 | [
2,
2017,
18,
68,
21,
375,
23504,
4492,
19,
619,
7721,
13,
5,
7684,
19,
121,
16254,
15,
13614,
382,
467,
6,
9,
800,
3726,
3726,
31,
589,
353,
21,
619,
7721,
3010,
9,
572,
30,
3010,
31,
589,
568,
14,
23504,
10647,
106,
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... |
Constantly repeating timer in an asp.net ajax page
===
Today I had my first test with the ASP.NET AJAX Timer Control, in hope that it would allow me to constantly keep updating my site.
At the moment, it just updates once; this does not match the behavior of the previous .NET timers.
Was the AJAX Timer control o... | 0 | [
2,
7545,
17389,
85,
139,
19,
40,
28,
306,
9,
2328,
20624,
2478,
800,
3726,
3726,
786,
31,
41,
51,
64,
1289,
29,
14,
28,
306,
9,
2328,
20624,
85,
139,
569,
15,
19,
1376,
30,
32,
83,
1655,
55,
20,
7545,
643,
71,
43,
1880,
51,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Validator for type strings?
===
Anyone know if there is already a validator for "type" strings?
I want to make sure that the type attributes in my custom config are one of the following:
<pre>
type="TopNamespace.SubNameSpace.ContainingClass, MyAssembly"
type="TopNamespace.SubNameSpace.ContainingClass, MyAssemb... | 0 | [
2,
7394,
3457,
26,
1001,
7887,
60,
800,
3726,
3726,
1276,
143,
100,
80,
25,
614,
21,
7394,
3457,
26,
13,
7,
4474,
7,
7887,
60,
31,
259,
20,
233,
562,
30,
14,
1001,
13422,
19,
51,
5816,
13,
14093,
2816,
50,
53,
16,
14,
249,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a way to log or intercept First Chance Exceptions
===
Short of using a profiler, is there any way inside a running program to detect first chance exceptions? Ideally, I would like to record more detailed state information that is not available once the catch block has taken over the final exception. | 0 | [
2,
25,
80,
21,
161,
20,
6738,
54,
18324,
64,
1504,
13392,
800,
3726,
3726,
502,
16,
568,
21,
5296,
139,
15,
25,
80,
186,
161,
572,
21,
946,
625,
20,
9092,
64,
1504,
13392,
60,
5628,
102,
15,
31,
83,
101,
20,
571,
91,
6036,
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... |
Editing .plist files - are single quotes allowed as strings?
===
In particular, I'm editing the AutoCompletion.plist file for CSSEdit (if that even matters).
My question is, are there any characters withing the STRING elements that need to be escaped? spaces? quotes? | 0 | [
2,
9510,
13,
9,
306,
5739,
6488,
13,
8,
50,
345,
18901,
1159,
28,
7887,
60,
800,
3726,
3726,
19,
1498,
15,
31,
22,
79,
9510,
14,
3108,
11103,
1336,
872,
9,
306,
5739,
3893,
26,
272,
18,
18,
69,
242,
13,
5,
821,
30,
166,
4556... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I change the text size and component width of a UIPickerView?
===
I have the following code to create a UIPickerView:
pickerView = [[UIPickerView alloc] initWithFrame:CGRectMake(0.0f, 416.0f - height, 320.0f, height)];
pickerView.delegate = self;
pickerView.showsSelectionIndicator = YES;
[pickerVi... | 0 | [
2,
184,
107,
31,
753,
14,
1854,
1072,
17,
5912,
9456,
16,
21,
13,
5661,
16855,
106,
4725,
60,
800,
3726,
3726,
31,
57,
14,
249,
1797,
20,
1600,
21,
13,
5661,
16855,
106,
4725,
45,
2036,
106,
4725,
800,
636,
2558,
5661,
16855,
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... |
Approaching STL algorithms, lambda, local classes and other approaches.
===
One of the that seems to be necessary with use of STL is a way to specify local functions.
Many of the functions that I would normally provide cannot be created using STL function object creation tools ( eg bind ), I have to hand roll my func... | 0 | [
2,
8371,
354,
255,
15935,
15,
13,
24187,
15,
375,
2684,
17,
89,
7501,
9,
800,
3726,
3726,
53,
16,
14,
30,
2206,
20,
44,
2378,
29,
275,
16,
354,
255,
25,
21,
161,
20,
19077,
375,
3719,
9,
151,
16,
14,
3719,
30,
31,
83,
4147,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Concept of "Data Directory" on each platform
===
This is very similar to [Where should cross-platform apps keep their data?][1], but expanding on it a bit.
There is some good advice on where the parent directory for data should be, but not so much on *what* a given app's directory should be.
For example, let's s... | 0 | [
2,
2420,
16,
13,
7,
18768,
16755,
7,
27,
206,
2452,
800,
3726,
3726,
48,
25,
253,
835,
20,
636,
2798,
378,
919,
8,
27035,
4865,
18,
643,
66,
1054,
60,
500,
2558,
165,
500,
15,
47,
9393,
27,
32,
21,
1142,
9,
80,
25,
109,
254,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Putting a pyCurl XML server response into a variable (Python)
===
I'm a Python noob, trying to use pyCurl. The project I am working on is creating a Python wrapper for the twitpic.com API (http://twitpic.com/api.do). For reference purposes, check out the code ([http://pastebin.com/f4c498b6e][1]) and the error I'm gett... | 0 | [
2,
3873,
21,
7103,
4734,
255,
23504,
8128,
1627,
77,
21,
7612,
13,
5,
6448,
11570,
6,
800,
3726,
3726,
31,
22,
79,
21,
20059,
90,
4995,
15,
749,
20,
275,
7103,
4734,
255,
9,
14,
669,
31,
589,
638,
27,
25,
2936,
21,
20059,
2805... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Class Limiting and Archetypes
===
I'm trying to create a function in C# which will allow me to, when called, return a reference to a given class type. The only types of functions like this that I have seen are in UnrealScript and even then the functionality is hard coded into its compiler. I'm wondering if I can do ... | 0 | [
2,
718,
17567,
17,
13,
21943,
4474,
18,
800,
3726,
3726,
31,
22,
79,
749,
20,
1600,
21,
1990,
19,
272,
5910,
56,
129,
1655,
55,
20,
15,
76,
227,
15,
788,
21,
2801,
20,
21,
504,
718,
1001,
9,
14,
104,
2551,
16,
3719,
101,
48,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
cannot re-install apache 2.2 services on XP through xampp
===
I'm trying to experiment with xampp. After having some space issues, I wanted to move my xampp install onto another drive (d:). However I have the apache 2.2 services in XP services which are still pointing to my original c: install. I only see how to start... | 0 | [
2,
1967,
302,
8,
108,
21300,
17140,
172,
9,
135,
687,
27,
23045,
120,
993,
765,
3421,
800,
3726,
3726,
31,
22,
79,
749,
20,
5737,
29,
993,
765,
3421,
9,
75,
452,
109,
726,
1549,
15,
31,
417,
20,
780,
51,
993,
765,
3421,
16146,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why this "Y"/"N" char field for booleans instead of bit : Microsoft SQL Server
===
I'm working on an application developed by another mob and am confounded by the use of a char field instead of bit for all the boolean columns in the database. It uses "Y" for true and "N" for false (these have to be uppercase). The typ... | 0 | [
2,
483,
48,
13,
7,
93,
7,
118,
7,
103,
7,
4892,
575,
26,
9827,
413,
5950,
700,
16,
1142,
13,
45,
7099,
4444,
255,
8128,
800,
3726,
3726,
31,
22,
79,
638,
27,
40,
3010,
885,
34,
226,
7327,
17,
589,
1065,
7282,
34,
14,
275,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 evaluate the pros and cons when changing language
===
I am working in a company that develops computing kernels. Their design is simple : it's a library in c++ which only has one function available to compute results out of available data.
There are essentially four steps in every one of these kernels :
... | 0 | [
2,
184,
20,
13,
15599,
14,
895,
18,
17,
11608,
76,
4226,
816,
800,
3726,
3726,
31,
589,
638,
19,
21,
237,
30,
13745,
10626,
17007,
18,
9,
66,
704,
25,
1935,
13,
45,
32,
22,
18,
21,
1248,
19,
272,
20512,
56,
104,
63,
53,
1990... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
when to use closure?
===
I have seen samples of closure from - http://stackoverflow.com/questions/36636/what-is-a-closure
Can anyone provide simple example of when to use closure?<br>
<b>Specifically, scenarios in which closure makes sense?</b><Br>
Lets assume that the language doesn't have closure support, h... | 0 | [
2,
76,
20,
275,
7790,
60,
800,
3726,
3726,
31,
57,
541,
7855,
16,
7790,
37,
13,
8,
7775,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
26488,
3775,
118,
608,
8,
403,
8,
58,
8,
13023,
5838,
92,
1276,
1181,
1935,
823,
16... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I set up a callback to run *before* a jquery animation?
===
I'm trying to set up a loop where an animation runs a certain number of times, and a function is run before each iteration of the animation. The timing ends up being off, though -- it runs the callback n times, then runs the animation n times. For ex... | 0 | [
2,
184,
92,
31,
309,
71,
21,
645,
1958,
20,
485,
1637,
12750,
2483,
21,
487,
8190,
93,
6236,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
309,
71,
21,
5293,
113,
40,
6236,
1461,
21,
1200,
234,
16,
436,
15,
17,
21,
1990,
25,
485... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Constructing a simple interpreter
===
I’m starting a project where I need to implement a light-weight interpreter.
The interpreter is used to execute simple scientific algorithms.
The programming language that this interpreter will use should be simple, since it is targeting non- software developers (for example, ma... | 0 | [
2,
18660,
21,
1935,
19336,
800,
3726,
3726,
31,
1,
79,
1422,
21,
669,
113,
31,
376,
20,
8713,
21,
471,
8,
8696,
19336,
9,
14,
19336,
25,
147,
20,
15644,
1935,
2272,
15935,
9,
14,
3143,
816,
30,
48,
19336,
129,
275,
378,
44,
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... |
Calling Webservices in a loop wont execute the custom OnSuccess function
===
I have a problem.
I am coding using VS2008.
I am calling webservices from my Javascript Page.
An example
Services.ChangeDropDownLists.GetNowPlayingMoviesByLocationSVC(
blah,
OnSuccessMoviesByRegio... | 0 | [
2,
2555,
2741,
11449,
18,
19,
21,
5293,
7290,
15644,
14,
5816,
27,
29245,
1990,
800,
3726,
3726,
31,
57,
21,
1448,
9,
31,
589,
13,
15458,
568,
4611,
2753,
9,
31,
589,
2555,
2741,
11449,
18,
37,
51,
8247,
8741,
2478,
9,
40,
823,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Time Code in PLT-Scheme
===
I want to see how long a function takes to run. What's the easiest way to do this in PLT-Scheme? Ideally I'd want to be able to do something like this:
> (define (loopy times)
(if (zero? times)
0
(loopy (sub1 times))))
> (loopy 5000000)
0 ... | 0 | [
2,
85,
1797,
19,
12443,
38,
8,
7526,
790,
800,
3726,
3726,
31,
259,
20,
196,
184,
175,
21,
1990,
1384,
20,
485,
9,
98,
22,
18,
14,
27237,
161,
20,
107,
48,
19,
12443,
38,
8,
7526,
790,
60,
5628,
102,
31,
22,
43,
259,
20,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PL/Ruby equivalent in MySQL
===
PL/Ruby is a loadable procedural language for Postgres that lets you use Ruby to write user defined functions for the database.
Anyone know of an equivalent way of writing user defined functions for MySQL in Ruby? | 0 | [
2,
12443,
118,
1820,
779,
4602,
19,
51,
18,
22402,
800,
3726,
3726,
12443,
118,
1820,
779,
25,
21,
6305,
579,
26429,
816,
26,
678,
6879,
18,
30,
6884,
42,
275,
10811,
20,
2757,
4155,
2811,
3719,
26,
14,
6018,
9,
1276,
143,
16,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... |
Scala combinator parsers - distinguish between number strings and variable strings
===
I'm doing Cay Horstmann's combinator parser exercises, I wonder about the best way to distinguish between strings that represent numbers and strings that represent variables in a match statement:
def factor: Parser[ExprTree] ... | 0 | [
2,
25975,
12994,
108,
3457,
2017,
18,
445,
13,
8,
9705,
128,
234,
7887,
17,
7612,
7887,
800,
3726,
3726,
31,
22,
79,
845,
15407,
13,
19088,
1897,
22,
18,
12994,
108,
3457,
2017,
4104,
12612,
15,
31,
2666,
88,
14,
246,
161,
20,
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... |
Scala syntax - pass string to object
===
While playing around with regexps in Scala I wrote something like this:
scala> val y = "Foo"
y: java.lang.String = Foo
scala> y "Bar"
scala>
As you can see, the second statement is just silently accepted. Is this legal a legal statement, and... | 0 | [
2,
25975,
22649,
13,
8,
1477,
3724,
20,
3095,
800,
3726,
3726,
133,
791,
140,
29,
7953,
6899,
18,
19,
25975,
31,
738,
301,
101,
48,
45,
25975,
1,
3347,
13,
93,
800,
13,
7,
4120,
111,
7,
13,
93,
45,
8247,
9,
9949,
9,
11130,
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 use boost::mpl to compose policies?
===
I have used something like the following to compose policies for my application:
The policy classes look like this:
struct Policy {
void init_options();
void init();
void post_init();
...
};
template <class CarT, class Cdr... | 0 | [
2,
184,
20,
275,
10419,
45,
45,
79,
5727,
20,
18217,
4845,
60,
800,
3726,
3726,
31,
57,
147,
301,
101,
14,
249,
20,
18217,
4845,
26,
51,
3010,
45,
14,
1486,
2684,
361,
101,
48,
45,
13,
10346,
1486,
13,
1,
11364,
19,
242,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Code generators or ORMs?
===
What do you suggest for Data Access layer? Using ORMs like Entity Framework and Hibernate OR Code Generators like Subsonic, .netTiers, T4, etc.? | 0 | [
2,
1797,
20495,
54,
54,
79,
18,
60,
800,
3726,
3726,
98,
107,
42,
5601,
26,
1054,
1381,
5385,
60,
568,
54,
79,
18,
101,
9252,
6596,
17,
4148,
2102,
8820,
54,
1797,
20495,
101,
972,
17766,
15,
13,
9,
2328,
5259,
18,
15,
13,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to programmatically activate the menu in Windows mobile
===
In most versions of windows, you can get to the menu by pressing the F10 key, thus avoiding having to use the mouse. This behaviour does not appear to be present in Windows Mobile 5.0, but is desirable as the device I am using will be more keyboard than ... | 0 | [
2,
184,
20,
625,
6732,
1326,
18163,
14,
11379,
19,
1936,
3241,
800,
3726,
3726,
19,
127,
3281,
16,
1936,
15,
42,
92,
164,
20,
14,
11379,
34,
7196,
14,
398,
1036,
1246,
15,
1086,
10298,
452,
20,
275,
14,
7567,
9,
48,
7727,
630,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 - Retrieving Useful Information
===
We are using SubVersion. We would like to
1. search across all commit messages ?
2. monitor the commits on certain important files ?
3. identify files that are never/rarely used ?
4. identify files that are most frequently changed ?
5. iden... | 0 | [
2,
13,
18,
16578,
13,
8,
13,
6239,
3272,
8397,
4811,
676,
800,
3726,
3726,
95,
50,
568,
972,
10898,
9,
95,
83,
101,
20,
137,
9,
2122,
464,
65,
9686,
7561,
13,
60,
172,
9,
7626,
14,
9686,
18,
27,
1200,
681,
6488,
13,
60,
203,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In C++, is it safe to extend scope via a reference?
===
In C++, is it safe to extend scope via a reference? | 0 | [
2,
19,
272,
20512,
15,
25,
32,
1834,
20,
7206,
9914,
1197,
21,
2801,
60,
800,
3726,
3726,
19,
272,
20512,
15,
25,
32,
1834,
20,
7206,
9914,
1197,
21,
2801,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Why is the WebService not working?
===
function AddTheatres()
{
Services.AdminWebServices.AddTheatresSVC(oTheatres,OnSuccessTheatres,OnError,OnTimeOut);
}
function OnSuccessTheatres(result1)
{
Services.AdminWebServices.AddTicketPricesSVC(oTicketPrices,OnSuccessTicketPrices,OnE... | 0 | [
2,
483,
25,
14,
2741,
11449,
52,
638,
60,
800,
3726,
3726,
1990,
3547,
124,
58,
8722,
5,
6,
13,
1,
687,
9,
1283,
2160,
14113,
11449,
18,
9,
14854,
124,
721,
9058,
8990,
5,
111,
124,
58,
8722,
15,
218,
29245,
124,
58,
8722,
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... |
regex to match a maximum of 4 spaces
===
I have a regular expression to match a persons name.
So far I have ^([a-zA-Z\'\s]+)$ but id like to add a check to allow for a maximum of 4 spaces. How do I amend it to do this?
| 0 | [
2,
7953,
1706,
20,
730,
21,
2979,
16,
268,
7644,
800,
3726,
3726,
31,
57,
21,
1290,
1803,
20,
730,
21,
4280,
204,
9,
86,
463,
31,
57,
13,
1,
5,
2558,
58,
8,
1153,
8,
380,
1,
22,
1,
18,
500,
2430,
6,
4403,
47,
4924,
101,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I monitor the size of a thread's message queue?
===
Our application is getting a System Call Failed RPC error from DCOM (`0x80010100`), we suspect that the target thread's message queue is full (although I'm not convinced this is ture). I know the queue is [limited to `10,000` messages](http://stackoverflow.com/qu... | 0 | [
2,
92,
31,
7626,
14,
1072,
16,
21,
9322,
22,
18,
2802,
22521,
60,
800,
3726,
3726,
318,
3010,
25,
1017,
21,
329,
645,
1702,
761,
5779,
7019,
37,
13,
43,
960,
13,
5,
1,
387,
396,
8464,
1036,
4031,
1,
6,
15,
95,
7551,
30,
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 pass arguments to addEventListener listener function?
===
The situation is somewhat like-
var someVar;
someVar = some_other_function();
someObj.addEventListener("click",
function(){
some_function(someVar);
... | 0 | [
2,
184,
20,
1477,
10553,
20,
3547,
4943,
38,
13891,
106,
21772,
1990,
60,
800,
3726,
3726,
14,
1858,
25,
4131,
101,
8,
4033,
109,
3311,
73,
109,
3311,
800,
109,
1,
9539,
1,
22359,
5,
6,
73,
109,
111,
11741,
9,
14854,
4943,
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... |
Is there a resource to help convert Prototype JavaScript to jQuery?
===
I have extensively used Prototype before and it helped us add considerable interactivity to our web applications. However we are looking at making the move to use jQuery in order to standardize on something better supported in Visual Studio.
I ... | 0 | [
2,
25,
80,
21,
6577,
20,
448,
8406,
7063,
8247,
8741,
20,
487,
8190,
93,
60,
800,
3726,
3726,
31,
57,
7802,
147,
7063,
115,
17,
32,
1456,
182,
3547,
5088,
1480,
19348,
20,
318,
2741,
3767,
9,
207,
95,
50,
699,
35,
544,
14,
780... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Concurrency handling using the filesystem VS an RDMBS (MySQL)
===
I'm building an English web dictionary where users can type in words and get definitions. I thought about this for a while and since the data is 100% static and I was only to retrieve one word at a time I was better off using the filesystem (ext3) as th... | 0 | [
2,
25547,
7988,
568,
14,
3893,
10724,
4611,
40,
13,
897,
5024,
18,
13,
5,
915,
18,
22402,
6,
800,
3726,
3726,
31,
22,
79,
353,
40,
486,
2741,
9186,
113,
3878,
92,
1001,
19,
715,
17,
164,
18544,
9,
31,
289,
88,
48,
26,
21,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What defines data that can be stored in strings
===
A few days ago, I asked why its not possible to store binary data, such as a jpg file into a string variable.
Most of the answers I got said that string is used for textual information such as what I'm writting now.
What is considered textual data though? Bytes... | 0 | [
2,
98,
13110,
1054,
30,
92,
44,
8214,
19,
7887,
800,
3726,
3726,
21,
310,
509,
1464,
15,
31,
411,
483,
82,
52,
938,
20,
1718,
14171,
1054,
15,
145,
28,
21,
487,
9623,
3893,
77,
21,
3724,
7612,
9,
127,
16,
14,
6709,
31,
330,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL custom functions in Enterprise Library
===
Is there a way to execute SQL custom functions with Enterpise Library? I've tried Database.ExecuteScalar() but for some reason it returns null.
This is my function:
Database db = DatabaseFactory.CreateDatabase("ConnectionString");
DbCommand cmd = db.GetStor... | 0 | [
2,
4444,
255,
5816,
3719,
19,
6002,
1248,
800,
3726,
3726,
25,
80,
21,
161,
20,
15644,
4444,
255,
5816,
3719,
29,
2830,
8954,
62,
1248,
60,
31,
22,
195,
794,
6018,
9,
1706,
62,
4118,
13944,
3779,
5,
6,
47,
26,
109,
1215,
32,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to implement scoped lock in C#?
===
A common pattern in C++ is to create a class that wraps a lock - lock is either implicitly taken when object is created, or taken explicitly afterwards. When object goes out of scope, dtor automatically releases the lock.
Is it possible to do this in C#? As far as I ... | 0 | [
2,
25,
32,
938,
20,
8713,
9914,
43,
3991,
19,
272,
5910,
60,
800,
3726,
3726,
21,
757,
3732,
19,
272,
20512,
25,
20,
1600,
21,
718,
30,
8118,
18,
21,
3991,
13,
8,
3991,
25,
694,
20290,
102,
658,
76,
3095,
25,
679,
15,
54,
65... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Check if array index exists
===
Is there any way to check if a given index of an array exists?
I am trying to set numerical index but something like 1, 5, 6,10. And so I want to see if these indexes already exist and if they do just increase another counter.
I normally work with php but I am trying to do this in c... | 0 | [
2,
2631,
100,
7718,
4348,
5636,
800,
3726,
3726,
25,
80,
186,
161,
20,
2631,
100,
21,
504,
4348,
16,
40,
7718,
5636,
60,
31,
589,
749,
20,
309,
16010,
4348,
47,
301,
101,
137,
15,
331,
15,
400,
15,
1036,
9,
17,
86,
31,
259,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to use regex for utf8 in ruby
===
In RoR,how to validate a Chinese or a Japanese word for a posting form with utf8 code.
In GBK code, it uses [\u4e00-\u9fa5]+ to validate Chinese words.
In Php, it uses /^[\x{4e00}-\x{9fa5}]+$/u for utf-8 pages. | 0 | [
2,
184,
20,
275,
7953,
1706,
26,
287,
11720,
457,
19,
10811,
800,
3726,
3726,
19,
761,
248,
15,
1544,
20,
7394,
1373,
21,
1116,
54,
21,
1095,
833,
26,
21,
15669,
505,
29,
287,
11720,
457,
1797,
9,
19,
14857,
197,
1797,
15,
32,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Finding if a TextBox/Label caption fits in the control
===
The scenario is trying to adjust font size to get a nice graphic arrangement, or trying to decide where to break a caption/subtitle.
a) In XL VBA is there a way to find out whether a text on a textbox, or caption on a label, still fits the control?
b) Is the... | 0 | [
2,
3007,
100,
21,
1854,
5309,
118,
21018,
26622,
2742,
18,
19,
14,
569,
800,
3726,
3726,
14,
12705,
25,
749,
20,
14328,
9978,
1072,
20,
164,
21,
2210,
8479,
5497,
15,
54,
749,
20,
4073,
113,
20,
1442,
21,
26622,
118,
7563,
22235,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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# - Fill a combo box with a DataTable
===
I'm used to work with Java where large amounts of examples are available. For various reasons I had to switch to C# and trying to do the following in SharpDevelop:
// Form has a menu containing a combobox added via SharpDevelop's GUI
// --- Variables
la... | 0 | [
2,
272,
5910,
13,
8,
3509,
21,
22621,
1649,
29,
21,
1054,
5924,
800,
3726,
3726,
31,
22,
79,
147,
20,
170,
29,
8247,
113,
370,
8545,
16,
3770,
50,
904,
9,
26,
617,
2932,
31,
41,
20,
5521,
20,
272,
5910,
17,
749,
20,
107,
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... |
Java for loop
===
Is there performance difference between :
for(Object o: objectArrayList){
o.DoSomthing();
}
and
for(int i=0; i<objectArrayList.size(); i++){
objectArrayList.get(i).DoSomthing();
}
| 0 | [
2,
8247,
26,
5293,
800,
3726,
3726,
25,
80,
956,
2841,
128,
13,
45,
26,
5,
23793,
635,
45,
3095,
8576,
93,
5739,
6,
1,
635,
9,
537,
10723,
96,
68,
5,
6,
73,
13,
1,
17,
26,
5,
6391,
31,
3726,
387,
73,
31,
1,
23793,
8576,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
tips for learning MUMPS (M) / Cache?
===
I'm interested in getting involved/up to speed on VistA, the Veterans' Administrations open source medical records system. To that effect, I understand I should learn the MUMPS (M) language upon which the software is based. Does anyone have any getting started tips or book rec... | 0 | [
2,
11034,
26,
2477,
8543,
1919,
13,
5,
79,
6,
13,
118,
16522,
60,
800,
3726,
3726,
31,
22,
79,
3158,
19,
1017,
1013,
118,
576,
20,
1362,
27,
13520,
15,
14,
7926,
22,
1603,
18,
368,
1267,
1088,
742,
329,
9,
20,
30,
1590,
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 backup a SQL database using PHP?
===
How do i backup a SQL database using PHP.
Is there a vendor agnostic way to do this that conforms to ANSI SQL?
If not maybe you can list how to do it for each of the database vendors? | 0 | [
2,
184,
107,
31,
10119,
21,
4444,
255,
6018,
568,
13,
26120,
60,
800,
3726,
3726,
184,
107,
31,
10119,
21,
4444,
255,
6018,
568,
13,
26120,
9,
25,
80,
21,
23510,
21,
21944,
161,
20,
107,
48,
30,
13620,
18,
20,
40,
18,
49,
4444... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SerialPort and the BSOD
===
I've written some C# code that checks whether a device is present on any SerialPort by issuing a command on the port and listening for a reply.
Sometimes it works. Sometimes Vista bluescreens. When I use threads to probe all the ports simultaneously it nearly always bluescreens. My note... | 0 | [
2,
5956,
1993,
17,
14,
334,
656,
43,
800,
3726,
3726,
31,
22,
195,
642,
109,
272,
5910,
1797,
30,
16602,
1472,
21,
3646,
25,
734,
27,
186,
5956,
1993,
34,
17502,
21,
1202,
27,
14,
1295,
17,
4948,
26,
21,
6504,
9,
1030,
32,
693... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 use Defining Query in SSDL in Entity Framework? Advantages and Examples will be helpful.
===
I need some info about using the Defining Query element within the SSDL of the Entity Framework.
Advantages of using it and scenarios where it would be helpful would really help.
An example and links will be great.
... | 0 | [
2,
184,
20,
275,
14684,
25597,
19,
13,
18,
18,
8643,
19,
9252,
6596,
60,
14683,
17,
3770,
129,
44,
15600,
9,
800,
3726,
3726,
31,
376,
109,
15404,
88,
568,
14,
14684,
25597,
4520,
363,
14,
13,
18,
18,
8643,
16,
14,
9252,
6596,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Mocking WebService consumed by a Biztalk Request-Response port
===
I'm using [BizUnit][1] to unit-tests my Biztalk orchestrations, but some orchestrations consume a WebService,and testing these seems more like integration testing than unit testing.
I'm familiar with using a mocking framework to mock the generated p... | 0 | [
2,
18446,
2741,
11449,
10936,
34,
21,
1732,
380,
9718,
3772,
8,
99,
18,
8782,
870,
1295,
800,
3726,
3726,
31,
22,
79,
568,
636,
220,
3186,
15464,
500,
2558,
165,
500,
20,
1237,
8,
10543,
18,
51,
1732,
380,
9718,
27861,
18,
15,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to go about web service security in Java
===
Does anyone have a recommendation about web service security architecture in Java (preferably under JBoss)? Any recommended reading?
I want to expose a fairly rich web service to the world but the data are sensitive and it requires authentication from the current cl... | 0 | [
2,
184,
20,
162,
88,
2741,
365,
1221,
19,
8247,
800,
3726,
3726,
630,
1276,
57,
21,
14066,
88,
2741,
365,
1221,
2607,
19,
8247,
13,
5,
3515,
2407,
4801,
131,
487,
10349,
18,
6,
60,
186,
5773,
1876,
60,
31,
259,
20,
13833,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JSTL forEach tag: problems with enumeration, and with understanding how it should work
===
I've experienced rather strange behavior of JSTL forEach tag.
I have some bean called SessionBean:
public class SessionBean {
private Collection<MyObject> objects;
public Collection<MyObject> getObjects()... | 0 | [
2,
487,
18,
7786,
26,
14322,
3383,
45,
1716,
29,
26940,
872,
15,
17,
29,
3260,
184,
32,
378,
170,
800,
3726,
3726,
31,
22,
195,
3882,
864,
2578,
3257,
16,
487,
18,
7786,
26,
14322,
3383,
9,
31,
57,
109,
15322,
227,
3723,
863,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
StructureMap IOC/DI and object creation
===
I'm building small web shop with asp.net mvc and Structuremap ioc/di. My Basket class uses session object for persistence, and I want use SM to create my basket object through IBasket interface. My basket implementation need HttpSessionStateBase (session state wrapper from m... | 0 | [
2,
1411,
15022,
31,
2499,
118,
1115,
17,
3095,
2502,
800,
3726,
3726,
31,
22,
79,
353,
284,
2741,
2546,
29,
28,
306,
9,
2328,
307,
8990,
17,
1411,
15022,
31,
2499,
118,
1115,
9,
51,
9136,
718,
2027,
3723,
3095,
26,
28584,
15,
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... |
Utilizing Time to Improve Programming Skill
===
In an attempt to be a better programmer, I am planning to read a lot of books and learn at least one new language (which I think is going to be python) during the 3-month long holiday that I am going to have.
The list of books that I am planning to read --
- [Cod... | 0 | [
2,
19894,
85,
20,
3545,
3143,
6148,
800,
3726,
3726,
19,
40,
1735,
20,
44,
21,
574,
17968,
15,
31,
589,
2334,
20,
1302,
21,
865,
16,
964,
17,
2484,
35,
639,
53,
78,
816,
13,
5,
2140,
31,
277,
25,
228,
20,
44,
20059,
6,
112,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 heighlight occurences of a search term in text in Visual Studio?
===
How do I make all occurrences of a phrase (search term) in a file to be highlighted in the VS code editor? | 0 | [
2,
184,
20,
24,
6872,
3130,
3744,
2940,
18,
16,
21,
2122,
981,
19,
1854,
19,
3458,
1120,
60,
800,
3726,
3726,
184,
107,
31,
233,
65,
12933,
18,
16,
21,
6845,
13,
5,
25136,
981,
6,
19,
21,
3893,
20,
44,
12528,
19,
14,
4611,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
getUrl using Java
===
Is there a way of getting the websites absolute URL (http://www.domain.com/) using Java? because I've googled a bit but I only come across with having to make 2 or 3 classes to create that function =/
Thanks | 0 | [
2,
164,
911,
255,
568,
8247,
800,
3726,
3726,
25,
80,
21,
161,
16,
1017,
14,
13931,
7070,
287,
6362,
13,
5,
21127,
6903,
6483,
9,
537,
6232,
9,
960,
118,
6,
568,
8247,
60,
185,
31,
22,
195,
8144,
43,
21,
1142,
47,
31,
104,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why doesn't dynamically generatated content change the height of containing div?
===
I am writing a footer div that displays info from the database. The footer has a different background color than the rest of the page, and will have a height that Depends on how much content the database throws to it. When I generat... | 0 | [
2,
483,
1437,
22,
38,
7782,
1326,
11011,
38,
1669,
2331,
753,
14,
2947,
16,
3503,
13,
12916,
60,
800,
3726,
3726,
31,
589,
1174,
21,
1749,
106,
13,
12916,
30,
9412,
15404,
37,
14,
6018,
9,
14,
1749,
106,
63,
21,
421,
2395,
1665,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PHP calendar control and event calendar needed
===
I'm looking for suggestions for a PHP:
1. calendar control/widget that I can embed on a web page to enable users to select dates
2. calendar software that will provide weekly calendar view, similar to what Microsoft Outlook provides. It should display days of t... | 0 | [
2,
13,
26120,
7036,
569,
17,
807,
7036,
851,
800,
3726,
3726,
31,
22,
79,
699,
26,
18389,
26,
21,
13,
26120,
45,
137,
9,
7036,
569,
118,
3976,
43,
3060,
30,
31,
92,
11911,
69,
27,
21,
2741,
2478,
20,
9240,
3878,
20,
5407,
4076... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Building a Webapp Around User-Workflow
===
The more I think about how I use computers, the more I become convinced that 'workflow' is the key factor in terms of productivity, and the way I should go about designing interactions. I'm thinking of workflow as the way we approach and manage data, information and knowledg... | 4 | [
2,
353,
21,
2741,
7753,
140,
4155,
8,
3783,
9990,
800,
3726,
3726,
14,
91,
31,
277,
88,
184,
31,
275,
7774,
15,
14,
91,
31,
533,
5329,
30,
13,
22,
3783,
9990,
22,
25,
14,
1246,
3932,
19,
1663,
16,
18211,
15,
17,
14,
161,
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... |
HTML 5 versus XHTML 1.0 Transitional?
===
It seems that HTML 5 is going to be supported (partially) by Firefox 3.1 and other browsers. It is adding support for video and audio as tags, but these are new tags that XHTML 1.0 Transitional does not recognize. What is the behavior supposed to be if I use a new HTML 5 tag i... | 0 | [
2,
13,
15895,
331,
5706,
993,
15895,
137,
9,
387,
20178,
60,
800,
3726,
3726,
32,
2206,
30,
13,
15895,
331,
25,
228,
20,
44,
1827,
13,
5,
3091,
49,
1326,
6,
34,
535,
18219,
203,
9,
165,
17,
89,
16495,
18,
9,
32,
25,
4721,
55... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Shortcuts for creating/modifying web forms in PHP?
===
I'm new to PHP and before I waste a lot of time doing things the hard way, I wanted to find out if there are shortcuts/techniques to creating PHP web forms apps. All this app will do is display web forms with data from 1 or more tables. In addition to displaying... | 0 | [
2,
502,
4118,
18,
26,
2936,
118,
13670,
10874,
2741,
1997,
19,
13,
26120,
60,
800,
3726,
3726,
31,
22,
79,
78,
20,
13,
26120,
17,
115,
31,
4600,
21,
865,
16,
85,
845,
564,
14,
552,
161,
15,
31,
417,
20,
477,
70,
100,
80,
50,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Set Return Type of Stored Procedure to Auto - Generated using Entity Framework.
===
In LINQ2SQL it was possible to set the return type of a stored procedure to auto generated.
I am unable to do so with the Entity Framework.
I want to set the return type of a stored procdure to auto-generated with the Entity Framew... | 0 | [
2,
309,
788,
1001,
16,
8214,
7004,
20,
3108,
13,
8,
6756,
568,
9252,
6596,
9,
800,
3726,
3726,
19,
6294,
1251,
135,
18,
22402,
32,
23,
938,
20,
309,
14,
788,
1001,
16,
21,
8214,
7004,
20,
3108,
6756,
9,
31,
589,
2343,
20,
107,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to persist an enum using NHibernate
===
Is there a way to persist an enum to the DB using NHibernate?
I want to keep the enum without an entity, but still have a foreign key from all other referencing entities to the enum's table. | 0 | [
2,
184,
20,
22084,
40,
1957,
723,
568,
12109,
15191,
8820,
800,
3726,
3726,
25,
80,
21,
161,
20,
22084,
40,
1957,
723,
20,
14,
13,
9007,
568,
12109,
15191,
8820,
60,
31,
259,
20,
643,
14,
1957,
723,
366,
40,
9252,
15,
47,
174,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Hierarchical tagging in SQL
===
I have a PHP web application which uses a MySQL database for object tagging, in which I've used the tag structure accepted as the answer to [this SO question][1].
I'd like to implement a tag hierarchy, where each tag can have a unique parent tag. Searches for a parent tag T would the... | 0 | [
2,
21376,
4272,
3383,
2762,
19,
4444,
255,
800,
3726,
3726,
31,
57,
21,
13,
26120,
2741,
3010,
56,
2027,
21,
51,
18,
22402,
6018,
26,
3095,
3383,
2762,
15,
19,
56,
31,
22,
195,
147,
14,
3383,
1411,
2217,
28,
14,
1623,
20,
636,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 takes to deliver a software product?
===
Many of you must have been part of team which successfully launched products. What lessons you learned? Is there good literature out there which I can read?
I was just reading this wonderful article, http://productmusings.wordpress.com/2006/11/05/20-rules-for-deliverin... | 4 | [
2,
98,
25,
1384,
20,
5879,
21,
2306,
2374,
60,
800,
3726,
3726,
151,
16,
42,
491,
57,
74,
141,
16,
173,
56,
3673,
1601,
1985,
9,
98,
7870,
42,
2691,
60,
25,
80,
254,
2233,
70,
80,
56,
31,
92,
1302,
60,
31,
23,
114,
1876,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
DES Encryption
===
Are DES Encryption called "One Way Encryption" or "two way Encryption" ?
Are there a PHP class or method decrypt the DES Encryption ?
thanks | 0 | [
2,
1746,
24420,
800,
3726,
3726,
50,
1746,
24420,
227,
13,
7,
849,
161,
24420,
7,
54,
13,
7,
3734,
161,
24420,
7,
13,
60,
50,
80,
21,
13,
26120,
718,
54,
2109,
121,
11435,
14,
1746,
24420,
13,
60,
3669,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Linq To Sql vs Entity Framework Performance
===
I have been searching for recent performance benchmarks that compare L2S and EF and couldnt find any that tested calling stored procedures using the released version of EF. So, I ran some of my own tests and found some interesting results.
Do these results look right?... | 0 | [
2,
6294,
1251,
20,
4444,
255,
4611,
9252,
6596,
956,
800,
3726,
3726,
31,
57,
74,
5792,
26,
1764,
956,
25324,
18,
30,
11590,
644,
135,
18,
17,
11599,
17,
3245,
477,
186,
30,
7631,
2555,
8214,
8876,
568,
14,
261,
615,
16,
11599,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 create an nullary Functor in C++ (using the loki library)
===
Writing something like this using the [loki library][1],
typedef Functor<void> BitButtonPushHandler;
throws a compiler error, but this works
typedef Functor<void,TYPELIST_1(Matrix3D*)> Perspective;
> Functor.h:530: error: '((Lok... | 0 | [
2,
184,
107,
31,
1600,
40,
16203,
1857,
2414,
150,
2153,
19,
272,
20512,
13,
5,
12655,
14,
25908,
1248,
6,
800,
3726,
3726,
1174,
301,
101,
48,
568,
14,
636,
15127,
49,
1248,
500,
2558,
165,
500,
15,
1001,
13862,
2414,
150,
2153,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is a good design for an extensible query interface?
===
Our application exposes queries by way of web services, and what we've found is that our clients often want custom queries, either by way of further limiting the results returned by specifying additional criteria, or by asking for things that we don't alread... | 0 | [
2,
98,
25,
21,
254,
704,
26,
40,
1396,
8710,
3426,
25597,
6573,
60,
800,
3726,
3726,
318,
3010,
13833,
18,
9386,
2829,
34,
161,
16,
2741,
687,
15,
17,
98,
95,
22,
195,
216,
25,
30,
318,
7421,
478,
259,
5816,
9386,
2829,
15,
69... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Managing the migration of breaking database changes to a database shared by old version of the same application
===
One of my goals is to be able to deploy a new version of a web application that runs side by side the old version. The catch is that everything shares a database. A database that in the new version tend... | 0 | [
2,
5616,
14,
8443,
16,
3892,
6018,
1693,
20,
21,
6018,
2592,
34,
315,
615,
16,
14,
205,
3010,
800,
3726,
3726,
53,
16,
51,
1547,
25,
20,
44,
777,
20,
17617,
21,
78,
615,
16,
21,
2741,
3010,
30,
1461,
270,
34,
270,
14,
315,
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 to divide an area composed of small squares into bigger rectangles?
===
Where would i go to look for algorithms that take a 2d grid of values that are either 0 or 1 as input and then identifies all possible non-overlapping rectangles in it?
In a more practical explanation: I am drawing a grid that is represente... | 0 | [
2,
184,
20,
8918,
40,
217,
1869,
16,
284,
735,
18,
77,
6197,
27181,
18,
60,
800,
3726,
3726,
113,
83,
31,
162,
20,
361,
26,
15935,
30,
247,
21,
172,
43,
7354,
16,
4070,
30,
50,
694,
713,
54,
137,
28,
6367,
17,
94,
17165,
65,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get a particular word from a string in PHP?
===
Say you have a string, but you don't know what it contains. And you want to replace all occurences of a particular word or part of a word with a formatted version of the same word.
For example, I have a string that contains "lorem ipsum" and i want to replace t... | 0 | [
2,
184,
107,
31,
164,
21,
1498,
833,
37,
21,
3724,
19,
13,
26120,
60,
800,
3726,
3726,
395,
42,
57,
21,
3724,
15,
47,
42,
221,
22,
38,
143,
98,
32,
1588,
9,
17,
42,
259,
20,
3934,
65,
3744,
2940,
18,
16,
21,
1498,
833,
54,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 design multiple lookups
===
- The user of an application wants to
assign a task to a programmer.
- The "Edit Task" form is presented to the User.
- A popup (actually an absolutely
positioned div) window comes up with
all the programmers to choose from.
- The programmer is not there ... | 0 | [
2,
184,
20,
704,
1886,
361,
15699,
800,
3726,
3726,
13,
8,
14,
4155,
16,
40,
3010,
2846,
20,
13952,
21,
3005,
20,
21,
17968,
9,
13,
8,
14,
13,
7,
69,
242,
3005,
7,
505,
25,
1831,
20,
14,
4155,
9,
13,
8,
21,
1675,
576,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a way to add a specific version of a file to the git index?
===
The reason I am asking this is that I had accidentally done a `git commit -a` that included a file I did not yet want to commit. My solution was to do the following:
git reset --soft HEAD^
git reset -- file/with/changes_not_to_committ... | 0 | [
2,
25,
80,
21,
161,
20,
3547,
21,
1903,
615,
16,
21,
3893,
20,
14,
13,
10404,
4348,
60,
800,
3726,
3726,
14,
1215,
31,
589,
3379,
48,
25,
30,
31,
41,
9746,
677,
21,
13,
1,
10404,
9686,
13,
8,
58,
1,
30,
506,
21,
3893,
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... |
Microsoft Project
===
Is Microsoft Project the best tool for managing software development or IT projects or is there an alternative that is better? | 2 | [
2,
7099,
669,
800,
3726,
3726,
25,
7099,
669,
14,
246,
5607,
26,
5616,
2306,
522,
54,
32,
2314,
54,
25,
80,
40,
2676,
30,
25,
574,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Javascript not running on IE
===
I Got a javascript that runs very well on firefox and safari, but refuses to run on IE
It's the following:
var drop= function(id)
{
if(document.getElementById("select1").value == "Ficha de pediatria"){
top.location.href = "print.jsp?id="+id+"&type=2";
... | 0 | [
2,
8247,
8741,
52,
946,
27,
13,
660,
800,
3726,
3726,
31,
330,
21,
8247,
8741,
30,
1461,
253,
134,
27,
535,
18219,
17,
25055,
15,
47,
10864,
20,
485,
27,
13,
660,
32,
22,
18,
14,
249,
45,
4033,
2804,
3726,
1990,
5,
1340,
6,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is Visual Studio Tools for Appplications part of Office 2007?
===
The VSTO bit I understand. Visual Studio has the project templates to get you started with creating nice .NET based add-ins.
But where is VSTA? I installed the SDK but it seems to be gears towards adding extensibility to your own applications.
I ... | 0 | [
2,
25,
3458,
1120,
4672,
26,
4865,
20669,
18,
141,
16,
488,
624,
60,
800,
3726,
3726,
14,
4611,
262,
1142,
31,
1369,
9,
3458,
1120,
63,
14,
669,
22894,
18,
20,
164,
42,
373,
29,
2936,
2210,
13,
9,
2328,
432,
3547,
8,
108,
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... |
PHP: Can a function know if it's being assigned as a value?
===
In other words, can `fn()` know that it is being used as `$var = fn();` rather than as `fn();`?
A use case would be to `echo` the return value in the latter case but to `return` it in the former.
Can this be done without passing a parameter to the f... | 0 | [
2,
13,
26120,
45,
92,
21,
1990,
143,
100,
32,
22,
18,
142,
2467,
28,
21,
1923,
60,
800,
3726,
3726,
19,
89,
715,
15,
92,
13,
1,
19035,
5,
6,
1,
143,
30,
32,
25,
142,
147,
28,
13,
1,
4403,
3311,
800,
13,
19035,
5,
6,
73,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Automatic JUnit on SVN checkin
===
I'm using IntelliJ-Idea to write Java daemons. We use JUnit to unit test our code and want to have automated runs on check-in to subversion.
Are there any tools available that can automatically run unit tests and then send reports in email and to [Hobbit][1]?
[1]: http://ho... | 0 | [
2,
6715,
7446,
242,
27,
13,
18,
16578,
2631,
108,
800,
3726,
3726,
31,
22,
79,
568,
19,
4213,
9999,
8,
3448,
58,
20,
2757,
8247,
13127,
18,
9,
95,
275,
7446,
242,
20,
1237,
1289,
318,
1797,
17,
259,
20,
57,
14904,
1461,
27,
26... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ajax Tutorial
===
I am looking for a good resource on Ajax. Framework doesn't matter. Should have good samples for typical real world scenarios.
Thanks in advance. | 0 | [
2,
20624,
29724,
800,
3726,
3726,
31,
589,
699,
26,
21,
254,
6577,
27,
20624,
9,
6596,
1437,
22,
38,
1161,
9,
378,
57,
254,
7855,
26,
3874,
683,
126,
19611,
9,
3669,
19,
3612,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
autoeventwireup performance cost
===
I have been looking at improving my asp.net page performance, is it worth changing autoeventwireup from true to false and adding the event handlers or is the performance penalty very small?
This is an asp.net 2.0 project. | 0 | [
2,
3108,
4943,
38,
13482,
576,
956,
1516,
800,
3726,
3726,
31,
57,
74,
699,
35,
9273,
51,
28,
306,
9,
2328,
2478,
956,
15,
25,
32,
2715,
4226,
3108,
4943,
38,
13482,
576,
37,
1151,
20,
4997,
17,
4721,
14,
807,
24641,
18,
54,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I get the TNMHTTP Get method to respond on a redirect
===
I'm using TNMHTTP in Delphi to retrieve the code from a webpage. The code is relatively simple:
NMHTTP1 := TNMHTTP.Create(Self);
NMHTTP1.InputFileMode := FALSE;
NMHTTP1.OutputFileMode := FALSE;
NMHTTP1.ReportLevel := Status_Basic;
... | 0 | [
2,
184,
92,
31,
164,
14,
13,
38,
103,
79,
21127,
164,
2109,
20,
4590,
27,
21,
302,
14706,
800,
3726,
3726,
31,
22,
79,
568,
13,
38,
103,
79,
21127,
19,
23030,
20,
11917,
14,
1797,
37,
21,
2741,
6486,
9,
14,
1797,
25,
3109,
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... |
(human) Language of a document
===
Is there a way (a program, a library) to approximately know which language a document is written in?
I have a bunch of text documents (~500K) in mixed languages to import in a i18n enabled CMS (Drupal)..
I don't need perfect matches, only some guess. | 0 | [
2,
13,
5,
7057,
6,
816,
16,
21,
4492,
800,
3726,
3726,
25,
80,
21,
161,
13,
5,
58,
625,
15,
21,
1248,
6,
20,
1357,
143,
56,
816,
21,
4492,
25,
642,
19,
60,
31,
57,
21,
7653,
16,
1854,
4374,
13,
5,
1,
6000,
197,
6,
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... |
Weird compile error dealing with Winnt.h
===
When trying to compile a file that include winnt.h via windows.h, I get the following error:
<pre>MyGl.cpp
..\microsoft sdks\windows\v6.0a\include\winnt.h(964) : error C2988: unrecognizable template declaration/definition
..\microsoft sdks\windows\v6.0a\include\winnt.h... | 0 | [
2,
5455,
26561,
7019,
5746,
29,
628,
2877,
9,
252,
800,
3726,
3726,
76,
749,
20,
26561,
21,
3893,
30,
468,
628,
2877,
9,
252,
1197,
1936,
9,
252,
15,
31,
164,
14,
249,
7019,
45,
13,
1,
3515,
1,
915,
8430,
9,
150,
3421,
13,
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... |
User ownership of personal information
===
At the moment it seems that most webapps store their user-data centrally.
I would like to see a movement towards giving the user total access and ownership of their own personal information and data; ultimately allowing the user to choose where their data is stored.
A... | 2 | [
2,
4155,
5074,
16,
1319,
676,
800,
3726,
3726,
35,
14,
688,
32,
2206,
30,
127,
2741,
7753,
18,
1718,
66,
4155,
8,
18768,
521,
102,
9,
31,
83,
101,
20,
196,
21,
1018,
1016,
1438,
14,
4155,
600,
1381,
17,
5074,
16,
66,
258,
1319... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ruby on Rails XML generation
===
I am attempting to build a simple method that creates an xml file from a database in ruby on rails. I feel like my code is right buy i am not getting seeing all of the users in the xml. I am a complete newbie to RoR.
Heres my code:
def create_file
@users = User.find(... | 0 | [
2,
10811,
27,
2240,
18,
23504,
2782,
800,
3726,
3726,
31,
589,
6314,
20,
1895,
21,
1935,
2109,
30,
9695,
40,
23504,
3893,
37,
21,
6018,
19,
10811,
27,
2240,
18,
9,
31,
583,
101,
51,
1797,
25,
193,
3034,
31,
589,
52,
1017,
2078,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
change journal operations in dotnet
===
I'm looking for the .net/c# way of performing <a href="http://msdn.microsoft.com/en-us/library/aa363801(VS.85).aspx">Change Journal Operations</a> (without importing unmanaged code).
Any hints or rtfm-links are appreciated. | 0 | [
2,
753,
1680,
1311,
19,
14123,
2328,
800,
3726,
3726,
31,
22,
79,
699,
26,
14,
13,
9,
2328,
118,
150,
5910,
161,
16,
2955,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
79,
18,
43,
103,
9,
22019,
12980,
9,
960,
118,
219,
8,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Library for browser based outliner
===
I'm looking for a free (GPL or BSD-type license) outliner library that works in a browser.
It doesn't have to be too complicated, just allow keyboard control of collapsing and expanding items, and changing their order.
Anyone know a good library for this? Do any of the big... | 0 | [
2,
1248,
26,
16495,
432,
70,
14813,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
551,
13,
5,
263,
5727,
54,
334,
18,
43,
8,
4474,
3962,
6,
70,
14813,
1248,
30,
693,
19,
21,
16495,
9,
32,
1437,
22,
38,
57,
20,
44,
266,
8343,
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 would be the best approach to designing a highly available pool of web services?
===
I've heard a lot of people touting success using Linux based proxies to handle routing for high availability of web applications, but what are others doing with web services? I have a bank of WCF services that need to be moved to... | 0 | [
2,
98,
83,
44,
14,
246,
2141,
20,
15026,
21,
2157,
904,
3067,
16,
2741,
687,
60,
800,
3726,
3726,
31,
22,
195,
752,
21,
865,
16,
148,
20,
1982,
68,
1280,
568,
13024,
432,
895,
396,
1596,
20,
3053,
19880,
26,
183,
11886,
16,
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... |
MySQL: get differences of each sorted column in set of rows
===
Here is a simple scenario with table characters:
CharacterName GameTime Gold Live
> Foo 10 100 3
> Foo 20 100 2
> Foo 30 95 2
How do I get this output for SELECT Gold, Live FROM characters WHERE name = 'Foo' ORDER BY GameTime:
> Gold L... | 0 | [
2,
51,
18,
22402,
45,
164,
4921,
16,
206,
22554,
4698,
19,
309,
16,
11295,
800,
3726,
3726,
235,
25,
21,
1935,
12705,
29,
859,
1766,
45,
925,
7259,
250,
891,
766,
515,
13,
1,
4310,
111,
332,
808,
203,
13,
1,
4310,
111,
434,
80... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best PHP framework for an experienced PHP developer?
===
Okay, before I start this, I am well aware of how subjective this question is.
For my case, I'd like to define the 'best' for me as:
- Rapid development
- "Pretty" URLs
- Data validation
- Good knowledge base available
- Not impossible to int... | 0 | [
2,
246,
13,
26120,
6596,
26,
40,
3882,
13,
26120,
10058,
60,
800,
3726,
3726,
1705,
15,
115,
31,
799,
48,
15,
31,
589,
134,
3854,
16,
184,
22835,
48,
1301,
25,
9,
26,
51,
610,
15,
31,
22,
43,
101,
20,
9267,
14,
13,
22,
4936,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why does adding a project reference break my build ?
===
solution structure [Plain Winforms + VS 2008 Express Edition]
-
- CoffeeMakerInterface (NS CoffeeMaker)
- CoffeeMakerSoftware (NS CoffeeMakerSoftware)
- TestCoffeeMaker (NS TestCoffeeMaker)
CoffeeMakerSoftware proj references CoffeeMakerInterface.
Tes... | 0 | [
2,
483,
630,
4721,
21,
669,
2801,
1442,
51,
1895,
13,
60,
800,
3726,
3726,
4295,
1411,
636,
9897,
108,
628,
4190,
18,
2754,
4611,
570,
2999,
1322,
500,
13,
8,
13,
8,
2364,
6466,
6280,
6413,
13,
5,
2172,
2364,
6466,
6,
13,
8,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Asp.net multilingual web application - localization
===
What's your opinion for the best possible way to build asp.net multilingual localized web application (only UI localization of string resources). Especially this two things:
1. How to store resources? Xml files, resx files or something else?
2. How to handl... | 0 | [
2,
28,
306,
9,
2328,
1889,
23427,
2741,
3010,
13,
8,
375,
1829,
800,
3726,
3726,
98,
22,
18,
154,
4052,
26,
14,
246,
938,
161,
20,
1895,
28,
306,
9,
2328,
1889,
23427,
24821,
2741,
3010,
13,
5,
4965,
13,
5661,
375,
1829,
16,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
VBA Excel macro writing an input integer into a cell.
===
I am writing a quick application myself - first project, however I am trying to find the VBA code for writing the result of an input string to a named cell in Excel.
For example, a input box asks the question "Which job number would you like to add to the li... | 0 | [
2,
566,
969,
20700,
9069,
1174,
40,
6367,
13820,
77,
21,
1667,
9,
800,
3726,
3726,
31,
589,
1174,
21,
2231,
3010,
992,
13,
8,
64,
669,
15,
207,
31,
589,
749,
20,
477,
14,
566,
969,
1797,
26,
1174,
14,
829,
16,
40,
6367,
3724,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Howto: Taking photos in windows mobile without CameraCaptureDialog?
===
I want to create a windows mobile app (windows mobile 5.0 and above, using CompactFramework [in SharpDevelop]) to capture photos automatically, without user involvement (like it would be with CameraCaptureDialog). After going through google search... | 0 | [
2,
184,
262,
45,
741,
7064,
19,
1936,
3241,
366,
3336,
4666,
6418,
4286,
5567,
60,
800,
3726,
3726,
31,
259,
20,
1600,
21,
1936,
3241,
4865,
13,
5,
27508,
18,
3241,
331,
9,
387,
17,
784,
15,
568,
8285,
8361,
3783,
636,
108,
2641... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 shell dotfile cookbook
===
I constantly hear from other people about how much of the stuff they've used to customize their *nix setup they've shamelessly stolen from other people. So in that spirit, I'd like to start a place to share that stuff here on SO.
Here are the rules:
1. **DON'T POST YOUR ENTIRE DO... | 0 | [
2,
14,
3593,
14123,
16877,
27526,
800,
3726,
3726,
31,
7545,
990,
37,
89,
148,
88,
184,
212,
16,
14,
3217,
59,
22,
195,
147,
20,
5816,
2952,
66,
1637,
14064,
18161,
59,
22,
195,
7912,
9687,
6746,
37,
89,
148,
9,
86,
19,
30,
26... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Message Passing Concurrency Library for C?
===
I've been looking around, but I can't seem to find a message-passing concurrency (Actor) library for C (not C++). Ideally the candidate would be based on something like libevent underneath allowing for non-blocking I/O in most places. Does anyone know of such a library? | 0 | [
2,
2802,
2848,
25547,
1248,
26,
272,
60,
800,
3726,
3726,
31,
22,
195,
74,
699,
140,
15,
47,
31,
92,
22,
38,
2260,
20,
477,
21,
2802,
8,
6201,
68,
25547,
13,
5,
20908,
6,
1248,
26,
272,
13,
5,
1270,
272,
20512,
6,
9,
5628,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the simplest jQuery way to have a 'position:fixed' (always at top) div?
===
I'm relatively new to jQuery, but so far what I've seen I like. What I want is for a div (or any element) to be across the top of the page as if "position: fixed" worked in every browser.
I do not want something complicated. I do no... | 0 | [
2,
98,
25,
14,
24384,
487,
8190,
93,
161,
20,
57,
21,
13,
22,
9339,
45,
18594,
69,
22,
13,
5,
21284,
35,
371,
6,
13,
12916,
60,
800,
3726,
3726,
31,
22,
79,
3109,
78,
20,
487,
8190,
93,
15,
47,
86,
463,
98,
31,
22,
195,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Eclipse Shortcut to Split Long Strings
===
I swear I've seen someone do this, but I can't find it in the various lists of shortcuts.
Given:
String s = "A very long ............................ String";
Is there an Eclipse shortcut to turn it into:
String s = "A very long .............................. | 0 | [
2,
11652,
502,
4118,
20,
2132,
175,
7887,
800,
3726,
3726,
31,
6688,
31,
22,
195,
541,
737,
107,
48,
15,
47,
31,
92,
22,
38,
477,
32,
19,
14,
617,
7227,
16,
502,
4118,
18,
9,
504,
45,
3724,
13,
18,
800,
13,
7,
58,
253,
175... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Generic way to fill out a form in javascript
===
I'm looking for a really generic way to "fill out" a form based on a parameter string using javascript.
for example, if i have this form:
<form id="someform">
<select name="option1">
<option value="1">1</option>
<option value="2">... | 0 | [
2,
12733,
161,
20,
3509,
70,
21,
505,
19,
8247,
8741,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
510,
12733,
161,
20,
13,
7,
19971,
70,
7,
21,
505,
432,
27,
21,
18906,
3724,
568,
8247,
8741,
9,
26,
823,
15,
100,
31,
57,
48,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.