unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Dealing with Date only dates across timezones in .Net
===
Ok - a bit of a mouthful. So the problem I have is this - I need to store a Date for expiry where *only* the date part is required and I don't want any timezone conversion. So for example if I have an expiry set to "08 March 2008" I want that value to be return... | 0 | [
2,
5746,
29,
1231,
104,
4076,
464,
85,
11661,
18,
19,
13,
9,
2328,
800,
3726,
3726,
5854,
13,
8,
21,
1142,
16,
21,
26934,
9,
86,
14,
1448,
31,
57,
25,
48,
13,
8,
31,
376,
20,
1718,
21,
1231,
26,
1396,
2159,
622,
113,
1637,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 HTTP Headers
===
I've had a new found interest in building a small, efficient web server in C and have had some trouble parsing POST methods from the HTTP Header. Would anyone have any advice as to how to handle retrieving the name/value pairs from the "posted" data?
POST /yeah HTTP/1.1
Host: cor.c... | 0 | [
2,
2017,
18,
68,
7775,
157,
445,
800,
3726,
3726,
31,
22,
195,
41,
21,
78,
216,
1163,
19,
353,
21,
284,
15,
8243,
2741,
8128,
19,
272,
17,
57,
41,
109,
2572,
2017,
18,
68,
678,
3195,
37,
14,
7775,
157,
106,
9,
83,
1276,
57,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
screen scraping a command window using .net managed code
===
I am writing a program in dot net that will execute scripts and command line programs using the framework 2.0's Process object. I want to be able to access the screen buffers of the process in my program. I've investigated this and it appears that I need to ... | 0 | [
2,
2324,
25611,
21,
1202,
1463,
568,
13,
9,
2328,
1471,
1797,
800,
3726,
3726,
31,
589,
1174,
21,
625,
19,
14123,
4275,
30,
129,
15644,
17505,
17,
1202,
293,
1726,
568,
14,
6596,
172,
9,
387,
22,
18,
953,
3095,
9,
31,
259,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Elegant method for drawing hourly bar chart from time-interval data?
===
I have a list of timesheet entries that show a start and stop time. This is sitting in a MySQL database. I need to create bar charts based on this data with the 24 hours of the day along the bottom and the amount of man-hours worked for each hour... | 0 | [
2,
11614,
2109,
26,
3533,
1671,
102,
748,
1795,
37,
85,
8,
6280,
3377,
1054,
60,
800,
3726,
3726,
31,
57,
21,
968,
16,
85,
17627,
11399,
30,
298,
21,
799,
17,
747,
85,
9,
48,
25,
1805,
19,
21,
51,
18,
22402,
6018,
9,
31,
376... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 convert local time to UTC in Python?
===
How do I convert a datetime string in local time to a string in UTC time?
I'm sure I've done this before, but can't find it and SO will hopefully help me (and others) do that in future. | 0 | [
2,
184,
107,
31,
8406,
375,
85,
20,
13,
11440,
19,
20059,
60,
800,
3726,
3726,
184,
107,
31,
8406,
21,
1231,
891,
3724,
19,
375,
85,
20,
21,
3724,
19,
13,
11440,
85,
60,
31,
22,
79,
562,
31,
22,
195,
677,
48,
115,
15,
47,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Need javascript code for button press and hold.
===
I'd like a short smallest possible javascript routine that when a mousedown occurs on a button it first responds just like a mouseclick and then if the user keeps the button pressed it responds as if the user was continously sending mouseclicks and after a while with... | 0 | [
2,
376,
8247,
8741,
1797,
26,
5167,
901,
17,
1027,
9,
800,
3726,
3726,
31,
22,
43,
101,
21,
502,
11056,
938,
8247,
8741,
8275,
30,
76,
21,
7567,
2968,
3690,
27,
21,
5167,
32,
64,
4590,
18,
114,
101,
21,
7567,
150,
10129,
17,
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... |
Can anyone recommend a IOC Container for C++?
===
I miss dependency injection more than all the raindrops in the ocean. | 0 | [
2,
92,
1276,
12360,
21,
31,
2499,
12147,
26,
272,
20512,
60,
800,
3726,
3726,
31,
1501,
26835,
13646,
91,
119,
65,
14,
1938,
12361,
18,
19,
14,
2144,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
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... |
Why pay for JIRA when I can use Bugzilla for free?
===
We've always used Bugzilla for issue/bug/enhancement tracking, but I keep thinking about switching to JIRA. However I would need to convince the boss that it's worth paying for something when a seemingly equivalent product is free of charge.
So sell me! What ab... | 0 | [
2,
483,
1372,
26,
487,
3517,
76,
31,
92,
275,
6256,
380,
3247,
26,
551,
60,
800,
3726,
3726,
95,
22,
195,
550,
147,
6256,
380,
3247,
26,
1513,
118,
16254,
118,
219,
252,
2416,
1130,
10353,
15,
47,
31,
643,
1440,
88,
13027,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to load a Hibernate object graph before using it in a UI?
===
The situation is this:
- You have a Hibernate context with an
object graph that has some lazy
loading defined.
- You want to use
the Hibernate objects in your UI as
is without having to copy the data
s... | 0 | [
2,
98,
25,
14,
246,
161,
20,
6305,
21,
4148,
2102,
8820,
3095,
7210,
115,
568,
32,
19,
21,
13,
5661,
60,
800,
3726,
3726,
14,
1858,
25,
48,
45,
13,
8,
42,
57,
21,
4148,
2102,
8820,
4141,
29,
40,
3095,
7210,
30,
63,
109,
1679... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you design data models for Bigtable/Datastore (GAE) ?
===
Since the Google App Engine Datastore is based on [Bigtable][1] and we know that's not a relational database, how do you design a ***database schema*/*data model*** for applications that use this type of database system?
[1]: http://labs.google.co... | 0 | [
2,
184,
107,
42,
704,
1054,
2761,
26,
580,
5924,
118,
18768,
16828,
13,
5,
17721,
6,
13,
60,
800,
3726,
3726,
179,
14,
8144,
4865,
1406,
1054,
16828,
25,
432,
27,
636,
6407,
5924,
500,
2558,
165,
500,
17,
95,
143,
30,
22,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Network Map Algorithm that Detects Unmanaged Layer 2 Switches?
===
I've inherited a network spread out over a warehouse/front office consisting of approximately 50 desktop PCs, various servers, network printers, and routers/switches.
The "intelligent" routers live in the server room. As the company has grown, we've... | 0 | [
2,
982,
2942,
9083,
30,
9092,
18,
367,
177,
8030,
5385,
172,
18114,
60,
800,
3726,
3726,
31,
22,
195,
7179,
21,
982,
1789,
70,
84,
21,
8308,
118,
8068,
488,
4160,
16,
1357,
1222,
17404,
5168,
18,
15,
617,
17595,
15,
982,
12925,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 most efficient way to count the results of a stored procedure, from another stored procedure?
===
In a stored procedure, I need to get the count of the results of another stored procedure. Specifically, I need to know if it returns any results, or an empty set.
I could create a temp table/table variable... | 0 | [
2,
98,
25,
14,
127,
8243,
161,
20,
2468,
14,
1736,
16,
21,
8214,
7004,
15,
37,
226,
8214,
7004,
60,
800,
3726,
3726,
19,
21,
8214,
7004,
15,
31,
376,
20,
164,
14,
2468,
16,
14,
1736,
16,
226,
8214,
7004,
9,
3524,
15,
31,
376... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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# utility to create a CA
===
I'd like to create a utility in C# to allow someone to easily create a Certificate Authority (CA) in Windows. Any ideas/suggestions?
I know I can use OpenSSL to do this. In the end, I'll want this utility to do more than just generate a CA. I'd also like to avoid requiring the instal... | 0 | [
2,
272,
5910,
10082,
20,
1600,
21,
1658,
800,
3726,
3726,
31,
22,
43,
101,
20,
1600,
21,
10082,
19,
272,
5910,
20,
1655,
737,
20,
2351,
1600,
21,
6259,
1959,
13,
5,
793,
6,
19,
1936,
9,
186,
3478,
118,
18,
21606,
1430,
5757,
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... |
ActiveRecord#save_only_valid_attributes
===
I'm looking for a variation on the #save method that will only save
attributes that do not have errors attached to them.
So a model can be updated without being valid overall, and this will
still prevent saving invalid data to the database.
By "valid attributes", I ... | 0 | [
2,
1348,
14953,
5910,
19863,
1,
4965,
1,
18506,
43,
1,
721,
14755,
18,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
7893,
27,
14,
6926,
19863,
2109,
30,
129,
104,
2079,
13422,
30,
107,
52,
57,
11908,
3638,
20,
105,
9,
86,
21,
106... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best testing tool for Swing-based applications?
===
While we try to set up as many unit tests as time allows for our applications, I always find the amount of UI-level tests lacking. There are many options out there, but I'm not sure what would be a good place to start.
What is your preferred unit test... | 0 | [
2,
98,
25,
14,
246,
4431,
5607,
26,
5587,
8,
1281,
3767,
60,
800,
3726,
3726,
133,
95,
1131,
20,
309,
71,
28,
151,
1237,
4894,
28,
85,
2965,
26,
318,
3767,
15,
31,
550,
477,
14,
2006,
16,
13,
5661,
8,
3906,
4894,
11690,
9,
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 does vxWorks deal with two tasks at the same priority?
===
We have two tasks (T1 and T2) in our vxWorks embedded system that have the same priority (110).
How does the regular vxWorks scheduler deal with this if both tasks are ready to run?
Which task executes first? | 0 | [
2,
184,
630,
566,
396,
7684,
1183,
29,
81,
8674,
35,
14,
205,
9857,
60,
800,
3726,
3726,
95,
57,
81,
8674,
13,
5,
38,
165,
17,
13,
38,
135,
6,
19,
318,
566,
396,
7684,
12138,
329,
30,
57,
14,
205,
9857,
13,
5,
11472,
6,
9,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What else does one need on top of programming skillz to be a good Technical Lead?
===
I work in a team that was decent until about 3 months ago when a senior programmer, coleague of mine, was officialy appointed "tech lead". He is a great programmer but he basically sucks at leading.
We all respect him and think he... | 4 | [
2,
98,
962,
630,
53,
376,
27,
371,
16,
3143,
6148,
380,
20,
44,
21,
254,
2447,
672,
60,
800,
3726,
3726,
31,
170,
19,
21,
173,
30,
23,
12238,
163,
88,
203,
818,
1464,
76,
21,
1101,
17968,
15,
326,
6942,
16,
1114,
15,
23,
989... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
mspdbsrv.exe living forever?
===
Is there a way to prevent mspdbsrv.exe from continuing to run
after finishing the compilation? or even after I terminate visual studio? or perhaps even prevent it from even spawning in the first place?
what is this guy good for anyway?
using vs2005
| 0 | [
2,
4235,
9251,
4562,
10359,
9,
1706,
62,
634,
3818,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
2501,
4235,
9251,
4562,
10359,
9,
1706,
62,
37,
4489,
20,
485,
75,
3718,
14,
4868,
60,
54,
166,
75,
31,
17952,
3458,
1120,
60,
54,
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... |
Configuring static analysis tools for uniformity?
===
How are folks integrating various static analysis tools such as PMD, Checkstyle, and FindBugs so that they are used together in some uniform way? In particular, I'm interested in generating a single uniform report that includes warnings from all tools. Also, I want... | 0 | [
2,
1065,
13549,
68,
12038,
2495,
4672,
26,
4347,
856,
60,
800,
3726,
3726,
184,
50,
14563,
24529,
617,
12038,
2495,
4672,
145,
28,
6736,
43,
15,
2631,
4381,
15,
17,
477,
16254,
18,
86,
30,
59,
50,
147,
429,
19,
109,
4347,
161,
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... |
What and where are the stack and heap
===
Programming language books usually explain that value types are created on the stack, and reference types created on the heap, without really explaining what these two things are. With my only programming experience being in high level languages, I haven't read a clear explan... | 0 | [
2,
98,
17,
113,
50,
14,
7566,
17,
15414,
800,
3726,
3726,
3143,
816,
964,
951,
3271,
30,
1923,
2551,
50,
679,
27,
14,
7566,
15,
17,
2801,
2551,
679,
27,
14,
15414,
15,
366,
510,
10225,
98,
158,
81,
564,
50,
9,
29,
51,
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... |
What was the name of the Mac (68000) assembler?
===
I'm sure there were several, but the one I was thinking of would display a nice text screen when you crashed the computer thoroughly.
The Text was "Well smoke me a kipper."
| 0 | [
2,
98,
23,
14,
204,
16,
14,
1572,
13,
5,
4279,
3993,
6,
13,
13736,
139,
60,
800,
3726,
3726,
31,
22,
79,
562,
80,
46,
238,
15,
47,
14,
53,
31,
23,
1440,
16,
83,
3042,
21,
2210,
1854,
2324,
76,
42,
7579,
14,
1428,
13632,
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,
0,
0... |
Perl Robot?
===
Is there an equivalent to Java's Robot class (java.awt.Robot) for Perl? | 0 | [
2,
416,
255,
8288,
60,
800,
3726,
3726,
25,
80,
40,
4602,
20,
8247,
22,
18,
8288,
718,
13,
5,
1004,
1385,
9,
3885,
38,
9,
661,
6813,
6,
26,
416,
255,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Best way of store only date on datetime field?
===
Scenario:
A stored procedure receives from code a DateTime with, let's say DateTime.Now value, as a datetime parameter.
The stored procedure needs to store only the date part of the datetime on the row, but preserving all date related arithmetics for, to say, do s... | 0 | [
2,
246,
161,
16,
1718,
104,
1231,
27,
1231,
891,
575,
60,
800,
3726,
3726,
12705,
45,
21,
8214,
7004,
8359,
37,
1797,
21,
1231,
891,
29,
15,
408,
22,
18,
395,
1231,
891,
9,
1387,
1923,
15,
28,
21,
1231,
891,
18906,
9,
14,
8214... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Reporting with db4o
===
I've used db4o with much success on many projects in the past. Over time it seems to have evolved greatly, and with modern trends like LINQ on everyone's tongue it has peaked my interest again, especially now that I know that it is starting to support transparent activation and persistence whic... | 0 | [
2,
6670,
29,
13,
9007,
300,
111,
800,
3726,
3726,
31,
22,
195,
147,
13,
9007,
300,
111,
29,
212,
1280,
27,
151,
2314,
19,
14,
640,
9,
84,
85,
32,
2206,
20,
57,
7339,
5629,
15,
17,
29,
773,
14947,
101,
6294,
1251,
27,
1266,
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... |
Visual Studio opens default browser instead of IE
===
When I debug in Visual Studio, firefox opens and that is annoying because of the hookups that IE and VS have such as when you close the IE browser that starting debug opened, VS stops debugging. How can I get Visual Studio to open IE instead without having to set ... | 0 | [
2,
3458,
1120,
8965,
12838,
16495,
700,
16,
13,
660,
800,
3726,
3726,
76,
31,
121,
16254,
19,
3458,
1120,
15,
535,
18219,
8965,
17,
30,
25,
17610,
185,
16,
14,
5559,
15699,
30,
13,
660,
17,
4611,
57,
145,
28,
76,
42,
543,
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 Truncate a string in PHP to the word closest to a certain number of characters?
===
I have a code snippet written in PHP that pulls a block of text from a database and sends it out to a widget on a webpage. The original block of text can be a lengthy article or a short sentence or two; but for this widget I ca... | 0 | [
2,
184,
20,
22328,
62,
21,
3724,
19,
13,
26120,
20,
14,
833,
6993,
20,
21,
1200,
234,
16,
1766,
60,
800,
3726,
3726,
31,
57,
21,
1797,
13,
29061,
642,
19,
13,
26120,
30,
8071,
21,
1921,
16,
1854,
37,
21,
6018,
17,
11350,
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... |
Split a string by spaces in Python
===
I have a string which is like this:
this is "a test"
I'm trying to write something in Python to split it up by space while ignoring spaces within quotes. The result I'm looking for is:
['this','is','a test']
PS. I know you are going to ask "what happens if the... | 0 | [
2,
2132,
21,
3724,
34,
7644,
19,
20059,
800,
3726,
3726,
31,
57,
21,
3724,
56,
25,
101,
48,
45,
48,
25,
13,
7,
58,
1289,
7,
31,
22,
79,
749,
20,
2757,
301,
19,
20059,
20,
2132,
32,
71,
34,
726,
133,
9321,
7644,
363,
18901,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 your favorite non-free Content Management System?
===
I say "non-free" because I'd like to see what CMS tools are out there beyond the normal Drupal, Joomla or Wordpress debate. | 4 | [
2,
98,
25,
154,
3839,
538,
8,
4639,
2331,
1097,
329,
60,
800,
3726,
3726,
31,
395,
13,
7,
3951,
8,
4639,
7,
185,
31,
22,
43,
101,
20,
196,
98,
2390,
18,
4672,
50,
70,
80,
1701,
14,
1826,
15708,
6720,
15,
2640,
2636,
531,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Where can I read good code? Any resources for that?
===
I read lot of articles saying that "Reading others code will helps you to be a better programmer". But where can I read good code and bad code so that I can learn how to and how not to code.
If you have any resources that would be helpful? | 0 | [
2,
113,
92,
31,
1302,
254,
1797,
60,
186,
2566,
26,
30,
60,
800,
3726,
3726,
31,
1302,
865,
16,
3376,
1148,
30,
13,
7,
22883,
654,
1797,
129,
7778,
42,
20,
44,
21,
574,
17968,
7,
9,
47,
113,
92,
31,
1302,
254,
1797,
17,
896,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why can't I single-step Clipboard-code within the VS.NET debugger ?
===
Googling on e.g. (( OpenClipboard 1418 vc6 )) finds articles like "GetClipboardData fails in debugger" and "No Error in VC++6 but Error in VC++ 2005". Pragmatically for-the-moment, problem solved - I simply cannot set breakpoints within such code... | 0 | [
2,
483,
92,
22,
38,
31,
345,
8,
8375,
12229,
2806,
8,
9375,
363,
14,
4611,
9,
2328,
121,
2345,
11356,
13,
60,
800,
3726,
3726,
162,
5598,
802,
27,
13,
62,
9,
263,
9,
13,
5,
5,
368,
150,
6013,
2806,
513,
1087,
13,
8990,
379,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 parallel programming model do you recommend today to take advantage of the manycore processors of tomorrow?
===
If you were writing a new application from scratch today, and wanted it to scale to all the cores you could throw at it tomorrow, what parallel programming model/system/language/library would you choose... | 0 | [
2,
98,
3821,
3143,
1061,
107,
42,
12360,
786,
20,
247,
3314,
16,
14,
151,
10375,
21034,
16,
3450,
60,
800,
3726,
3726,
100,
42,
46,
1174,
21,
78,
3010,
37,
12395,
786,
15,
17,
417,
32,
20,
3464,
20,
65,
14,
2884,
18,
42,
110,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it me, or is Eclipse horribly unpredictable?
===
I recently started using Eclipse at work for my Java servlet projects. I've been using jEdit for years, which is a uber-powerful text editor. It has syntax highlighting, but it doesn't have any language-specific features like code completion and intelligent refacto... | 0 | [
2,
25,
32,
55,
15,
54,
25,
11652,
28441,
24421,
60,
800,
3726,
3726,
31,
1989,
373,
568,
11652,
35,
170,
26,
51,
8247,
13,
10321,
1336,
2314,
9,
31,
22,
195,
74,
568,
12671,
242,
26,
122,
15,
56,
25,
21,
13,
8866,
8,
5484,
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 can cause Web.sitemap to not be found?
===
I have a asp:menu object which I set up to use a SiteMapDataSource but everytime I try to run the site, I get a yellow screen from firefox saying it cannot find the web.sitemap. Here's the code for the sitemapdatasource and the menu. The Web.sitemap file is sitting in th... | 0 | [
2,
98,
92,
1679,
2741,
9,
9097,
15022,
20,
52,
44,
216,
60,
800,
3726,
3726,
31,
57,
21,
28,
306,
45,
755,
291,
3095,
56,
31,
309,
71,
20,
275,
21,
689,
15022,
18768,
12097,
47,
352,
891,
31,
1131,
20,
485,
14,
689,
15,
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... |
Best Mocking Library
===
Which is the best mocking library? Why? | 4 | [
2,
246,
18446,
1248,
800,
3726,
3726,
56,
25,
14,
246,
18446,
1248,
60,
483,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Best Reporting application
===
Desinging web application and for reporting iam using crystal reports.sometimes the crystal reports gives runtimes error. What can i do to make my report faster. Retrieving around 1MB of data. It is the month end sales report. what is the best method to solve this issue.
| 0 | [
2,
246,
6670,
3010,
800,
3726,
3726,
1746,
68,
68,
2741,
3010,
17,
26,
6670,
31,
765,
568,
4282,
2813,
9,
9310,
14,
4282,
2813,
2352,
485,
891,
18,
7019,
9,
98,
92,
31,
107,
20,
233,
51,
1330,
4233,
9,
13,
6239,
3272,
8397,
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... |
Anyone Recommend a Good Tutorial on Conditional Random Fields
===
I have been trying to find a good tutorial on Conditional Random Fields and have yet to find one that didn't start sending my brain into meltdown. I have a good grasp of HMM's, and I get the difference between discriminative and generative models ... bu... | 0 | [
2,
1276,
12360,
21,
254,
29724,
27,
21206,
5477,
2861,
800,
3726,
3726,
31,
57,
74,
749,
20,
477,
21,
254,
29724,
27,
21206,
5477,
2861,
17,
57,
768,
20,
477,
53,
30,
223,
22,
38,
799,
4907,
51,
1964,
77,
11865,
2968,
9,
31,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
diff a ruby string or array
===
Is there a ruby library that will take two strings or two arrays and return the difference between the two strings/arrays? | 0 | [
2,
20811,
21,
10811,
3724,
54,
7718,
800,
3726,
3726,
25,
80,
21,
10811,
1248,
30,
129,
247,
81,
7887,
54,
81,
7718,
18,
17,
788,
14,
2841,
128,
14,
81,
7887,
118,
8576,
93,
18,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
iCal Format - Organizer
===
I am currently programming a scheduling application which loosely based on iCalendar standard. Does anyone knows in which property can I store the event creator's information? By browsing through the iCalendar RFC 2445, I find this property: [Organizer][1]. can I store the event creator's i... | 0 | [
2,
13,
4272,
2595,
13,
8,
22555,
800,
3726,
3726,
31,
589,
871,
3143,
21,
23096,
3010,
56,
13166,
432,
27,
13,
4272,
219,
2542,
1236,
9,
630,
1276,
3620,
19,
56,
1354,
92,
31,
1718,
14,
807,
9247,
22,
18,
676,
60,
34,
10175,
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... |
Detect "Clone Mode" display setup
===
How can I determine if my displays are in "Clone Mode" without using either COPP (Computer Output Protection Protocol) or OPM (Output Protection Protocol) on Windows? | 0 | [
2,
9092,
13,
7,
150,
16285,
3740,
7,
3042,
18161,
800,
3726,
3726,
184,
92,
31,
3746,
100,
51,
9412,
50,
19,
13,
7,
150,
16285,
3740,
7,
366,
568,
694,
18202,
13,
5,
18448,
5196,
2057,
8494,
6,
54,
3088,
79,
13,
5,
1320,
4881,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What's the best way to distribute Java applications?
===
Java is one of my programming languages of choice. I always run into the problem though of distributing my application to end-users.
Giving a user a JAR is not always as user friendly as I would like and using Java WebStart requires that I maintain a web ser... | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
14751,
8247,
3767,
60,
800,
3726,
3726,
8247,
25,
53,
16,
51,
3143,
2556,
16,
1837,
9,
31,
550,
485,
77,
14,
1448,
362,
16,
23125,
51,
3010,
20,
241,
8,
16704,
18,
9,
1438,
21,
4155,
21,
5112... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the difference between XML-RPC and SOAP?
===
I've never really understand why a web service implementer would choose one over the other. Is XML-RPC generally found in older systems? Any help in understanding this would be greatly appreciated. | 0 | [
2,
98,
22,
18,
14,
2841,
128,
23504,
8,
139,
5779,
17,
6447,
60,
800,
3726,
3726,
31,
22,
195,
243,
510,
1369,
483,
21,
2741,
365,
8713,
106,
83,
3538,
53,
84,
14,
89,
9,
25,
23504,
8,
139,
5779,
1469,
216,
19,
1234,
1242,
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,
0,
0,
0,
0,
0,
0... |
software Engineering documentation
===
Can anyone suggest where can i find the best software engineering project documentation. I need to do on project for my studies. If i had an sample project would have saved lot of time for me.
| 0 | [
2,
2306,
1552,
13945,
800,
3726,
3726,
92,
1276,
5601,
113,
92,
31,
477,
14,
246,
2306,
1552,
669,
13945,
9,
31,
376,
20,
107,
27,
669,
26,
51,
1011,
9,
100,
31,
41,
40,
5717,
669,
83,
57,
4377,
865,
16,
85,
26,
55,
9,
3,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Cruise Control .Net vs Team Foundation Build
===
Our team is setting up nightly and continuous integration builds. We own Team Foundation Server and could use Team Foundation Build. I'm more familiar with CC.Net and lean that way but management sees all the money spent on TFS and wants to use it.
Some things I li... | 0 | [
2,
6581,
569,
13,
9,
2328,
4611,
173,
1304,
1895,
800,
3726,
3726,
318,
173,
25,
2697,
71,
343,
102,
17,
6357,
8078,
1895,
18,
9,
95,
258,
173,
1304,
8128,
17,
110,
275,
173,
1304,
1895,
9,
31,
22,
79,
91,
3694,
29,
8093,
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... |
storing revision changes of a message
===
What algorithms and processes are involved in storing revision changes like stackoverflow and wikipedia do?
Is only one copy of the message kept? And if so is it only the latest copy? Then only changes to go back to the previous version(s) are stored from there? (This wo... | 0 | [
2,
25615,
11323,
1693,
16,
21,
2802,
800,
3726,
3726,
98,
15935,
17,
5102,
50,
1013,
19,
25615,
11323,
1693,
101,
7566,
2549,
9990,
17,
20169,
107,
60,
25,
104,
53,
4344,
16,
14,
2802,
1025,
60,
17,
100,
86,
25,
32,
104,
14,
573... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 does COINIT_SPEED_OVER_MEMORY do?
===
When calling `CoInitializeEx`, you can specify the following values for `dwCoInit`:
typedef enum tagCOINIT {
COINIT_MULTITHREADED = 0x0,
COINIT_APARTMENTTHREADED = 0x2,
COINIT_DISABLE_OLE1DDE = 0x4,
COINIT_SPEED_OVER_MEMORY = 0... | 0 | [
2,
98,
630,
8646,
242,
1,
6708,
1,
2549,
1,
790,
5171,
93,
107,
60,
800,
3726,
3726,
76,
2555,
13,
1,
716,
27313,
2952,
1706,
1,
15,
42,
92,
19077,
14,
249,
4070,
26,
13,
1,
43,
499,
716,
108,
242,
1,
45,
1001,
13862,
1957,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 hide a column only on the list page in ASP.NET Dynamic Data?
===
This is somewhat similar to [this question][1].
However, rather than wanting to hide a column all together, I am just looking to hide the column on the List.aspx page.
My specific example is that fields that are long (or at least nvarchar(... | 0 | [
2,
184,
107,
31,
3077,
21,
4698,
104,
27,
14,
968,
2478,
19,
28,
306,
9,
2328,
7782,
1054,
60,
800,
3726,
3726,
48,
25,
4131,
835,
20,
636,
1565,
1301,
500,
2558,
165,
500,
9,
207,
15,
864,
119,
4638,
20,
3077,
21,
4698,
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 to track changes to business objects?
===
I get the concept of creating a business object or entity to represent something like a Person. I can then serialize the Person using a DTO and send it down to the client. If the client changes the object, it can have an IsDirty flag on there so when it gets sent back to t... | 0 | [
2,
184,
20,
792,
1693,
20,
508,
3916,
60,
800,
3726,
3726,
31,
164,
14,
2420,
16,
2936,
21,
508,
3095,
54,
9252,
20,
3501,
301,
101,
21,
840,
9,
31,
92,
94,
5956,
2952,
14,
840,
568,
21,
13,
43,
262,
17,
2660,
32,
125,
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... |
High Availability Storage
===
I would like to make 2 TB or so available via NFS and CIFS. I am looking for a 2 (or more) server solution for high availability and the ability to load balance across the servers if possible. Any suggestions for clustering or high availability solutions? | 2 | [
2,
183,
11886,
4326,
800,
3726,
3726,
31,
83,
101,
20,
233,
172,
13,
11872,
54,
86,
904,
1197,
13,
11408,
18,
17,
272,
821,
18,
9,
31,
589,
699,
26,
21,
172,
13,
5,
248,
91,
6,
8128,
4295,
26,
183,
11886,
17,
14,
2165,
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... |
Is this possible in CSS and javascript?
===
I want to use javascript to insert some elements into the current page.
Such as this is the original document:
<p>Hello world!</p>
Now I want to insert an element in to the text so that it will become:
<p>Hello <span id=span1>new</span> ... | 0 | [
2,
25,
48,
938,
19,
272,
18,
18,
17,
8247,
8741,
60,
800,
3726,
3726,
31,
259,
20,
275,
8247,
8741,
20,
14692,
109,
2065,
77,
14,
866,
2478,
9,
145,
28,
48,
25,
14,
501,
4492,
45,
279,
255,
38,
73,
306,
1569,
263,
38,
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... |
Btrieve without Pervasive?
===
Is there any library available to query Btrieve databases without buying something from Pervasive? I'm looking to code in C# or Python. | 0 | [
2,
334,
38,
3272,
195,
366,
416,
8471,
1284,
60,
800,
3726,
3726,
25,
80,
186,
1248,
904,
20,
25597,
334,
38,
3272,
195,
6018,
18,
366,
9459,
301,
37,
416,
8471,
1284,
60,
31,
22,
79,
699,
20,
1797,
19,
272,
5910,
54,
20059,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Do you use application frameworks?
===
Application frameworks such as DotNetNuke, Eclipse, Websphere and so forth are available today which offer customizable frameworks that can be used as dashboard applications. Do you use these or do you and your peers keep writing amazing, modular, maintainable dashboard framewor... | 0 | [
2,
107,
42,
275,
3010,
6596,
18,
60,
800,
3726,
3726,
3010,
6596,
18,
145,
28,
14123,
2328,
4215,
1048,
15,
11652,
15,
2741,
14079,
17,
86,
5882,
50,
904,
786,
56,
1994,
5816,
3186,
579,
6596,
18,
30,
92,
44,
147,
28,
26478,
376... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Open .NET form in designer mode - get "The path is not of a legal form"
===
I attempted to open a C#/VB form in designer mode, and instead of the form, I got an ugly error message saying "The path is not of a legal form". This form used to work! What happened? | 0 | [
2,
368,
13,
9,
2328,
505,
19,
4742,
3740,
13,
8,
164,
13,
7,
124,
2013,
25,
52,
16,
21,
1517,
505,
7,
800,
3726,
3726,
31,
3066,
20,
368,
21,
272,
5910,
118,
20468,
505,
19,
4742,
3740,
15,
17,
700,
16,
14,
505,
15,
31,
33... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does Test Driven Development take the focus from Design?
===
I have mixed feelings about TDD. While I believe in testing I have a issues with the idea of the test driving my development effort.
When you code to satisfy some tests written for an interface for requirements you have right now, you might shift your foc... | 0 | [
2,
630,
1289,
5355,
522,
247,
14,
1776,
37,
704,
60,
800,
3726,
3726,
31,
57,
2198,
4208,
88,
15596,
43,
9,
133,
31,
985,
19,
4431,
31,
57,
21,
1549,
29,
14,
882,
16,
14,
1289,
2891,
51,
522,
2150,
9,
76,
42,
1797,
20,
14711... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get someone started with ALT.NET
===
What is the order of topics to explain to a .NET developer or user group to get them started and interested with alt.net tools and practices.
- ORM
- IoC
- TDD
- DDD
- CI
- MVC - MVP
- Version Control (I think this is the one they get the fastest)
... | 0 | [
2,
184,
20,
164,
737,
373,
29,
7051,
9,
2328,
800,
3726,
3726,
98,
25,
14,
389,
16,
7569,
20,
3271,
20,
21,
13,
9,
2328,
10058,
54,
4155,
214,
20,
164,
105,
373,
17,
3158,
29,
7051,
9,
2328,
4672,
17,
5242,
9,
13,
8,
54,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using SSIS to refresh a training database from a production database
===
I have a particular system on out network where we need to maintain a training installation. The system uses SQL Server 2000 as its database engine and I need to set up a system for refreshing the data in the training database with the data from ... | 0 | [
2,
568,
13,
18,
4557,
20,
24905,
21,
838,
6018,
37,
21,
637,
6018,
800,
3726,
3726,
31,
57,
21,
1498,
329,
27,
70,
982,
113,
95,
376,
20,
4027,
21,
838,
7758,
9,
14,
329,
2027,
4444,
255,
8128,
824,
28,
82,
6018,
1406,
17,
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... |
Using Google Maps in Coldfusion
===
I am trying to use the Google Maps API in a Coldfusion template that is a border type cflayoutarea container. However the map simply doesn't show up:
<cfif isdefined("url.lat")>
<cfset lat="#url.lat#">
<cfset lng="#url.lng#">
</cfif>
<head>
<script src= "http:/... | 0 | [
2,
568,
8144,
6867,
19,
1191,
9818,
800,
3726,
3726,
31,
589,
749,
20,
275,
14,
8144,
6867,
21,
2159,
19,
21,
1191,
9818,
22894,
30,
25,
21,
1862,
1001,
10084,
4414,
1320,
17760,
12147,
9,
207,
14,
2942,
1659,
1437,
22,
38,
298,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Generating Javascript code
===
Are there any good tools to generate javascript.I remember in dotnet, there was Script#, dont know its status today.Anyone has experience with any tools? | 0 | [
2,
13500,
8247,
8741,
1797,
800,
3726,
3726,
50,
80,
186,
254,
4672,
20,
7920,
8247,
8741,
9,
49,
1518,
19,
14123,
2328,
15,
80,
23,
3884,
5910,
15,
1049,
143,
82,
1782,
786,
9,
6001,
849,
63,
1496,
29,
186,
4672,
60,
3,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How can I build a 'dependency tree diagram' from my .NET solution
===
I can get easily see what projects and dlls a single project references from within a Visual Studio .NET project.
Is there any application or use of reflection that can build me a full dependency tree that I can use to plot a graphical chart of d... | 0 | [
2,
184,
92,
31,
1895,
21,
13,
22,
19038,
8883,
1541,
14161,
22,
37,
51,
13,
9,
2328,
4295,
800,
3726,
3726,
31,
92,
164,
2351,
196,
98,
2314,
17,
13,
43,
211,
18,
21,
345,
669,
7231,
37,
363,
21,
3458,
1120,
13,
9,
2328,
669... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Granting access to hundreds of SPs??
===
In Sql Server 2000/2005, I have a few NT user groups that need to be granted access to hundreds of stored procedures.
Is there a nice easy way to do that? | 0 | [
2,
18599,
1381,
20,
4541,
16,
3782,
18,
60,
60,
800,
3726,
3726,
19,
4444,
255,
8128,
824,
118,
2835,
15,
31,
57,
21,
310,
13,
2877,
4155,
1170,
30,
376,
20,
44,
2743,
1381,
20,
4541,
16,
8214,
8876,
9,
25,
80,
21,
2210,
2010,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
mysqli_statement::num_rows() returns the wrong value
===
I was writing a database handler class in PHP using the mysqli class and prepared statements. I was attempting to print out the result. It didn't work right off the bat so I decided to do some debugging. I tried to use the `num_rows()` method from the `mysqli... | 0 | [
2,
51,
18,
1251,
1210,
1,
3859,
1130,
45,
45,
6336,
1,
5417,
18,
5,
6,
4815,
14,
1389,
1923,
800,
3726,
3726,
31,
23,
1174,
21,
6018,
24641,
718,
19,
13,
26120,
568,
14,
51,
18,
1251,
1210,
718,
17,
3268,
9015,
9,
31,
23,
63... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Test Coverage for visual basic project
===
We are developing a visual basic 6.0 project.We have written a library, which we were testing using vbunit and vbmock.But, soon found that the tests were not maintainable.So, we decided to write tests using MBunit.Now, we want to know the test coverage.How can we do it?
than... | 0 | [
2,
1289,
5245,
26,
3458,
2125,
669,
800,
3726,
3726,
95,
50,
3561,
21,
3458,
2125,
400,
9,
387,
669,
9,
458,
57,
642,
21,
1248,
15,
56,
95,
46,
4431,
568,
13,
20468,
15464,
17,
566,
13178,
5668,
9,
811,
15,
651,
216,
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... |
Windows wallpaper: not just BMPs?
===
I've read in a couple of places that the desktop wallpaper can be set to an HTML document. Has anyone had any success changing it programmatically?
The following snippet of VB6 helps me set things up for BMPs but when I try to use it for HTML, I get a nice blue background and ... | 0 | [
2,
1936,
28129,
45,
52,
114,
334,
2554,
18,
60,
800,
3726,
3726,
31,
22,
195,
1302,
19,
21,
1335,
16,
1489,
30,
14,
17404,
28129,
92,
44,
309,
20,
40,
13,
15895,
4492,
9,
63,
1276,
41,
186,
1280,
4226,
32,
625,
6732,
1326,
60,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I preview a url using ajax?
===
How do I preview a url using ajax? I have seen this done with search engine plug ins and would like to learn how to do this. | 0 | [
2,
184,
107,
31,
16121,
21,
287,
6362,
568,
20624,
60,
800,
3726,
3726,
184,
107,
31,
16121,
21,
287,
6362,
568,
20624,
60,
31,
57,
541,
48,
677,
29,
2122,
1406,
10922,
19,
18,
17,
83,
101,
20,
2484,
184,
20,
107,
48,
9,
3,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Convert 00:00:00 to hours, minutes, seconds
===
I have video durations stored in HH:MM:SS format. I'd like to display it as HH hours, MM minutes, SS seconds. It shouldn't display hours if its less than 1.
| 0 | [
2,
8406,
13,
2032,
45,
2032,
45,
2032,
20,
974,
15,
902,
15,
2582,
800,
3726,
3726,
31,
57,
763,
9403,
18,
8214,
19,
13,
10681,
45,
3363,
45,
18,
18,
2595,
9,
31,
22,
43,
101,
20,
3042,
32,
28,
13,
10681,
974,
15,
1620,
902,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Poppler programming
===
Poppler is a classic example of something without documentation that you would prefer be documented. This question is language agnostic, just asking about the general idea..
In short, how do you make a PDF viewer control with poppler?
From what I can tell, you'd need to use poppler to rende... | 0 | [
2,
1675,
306,
1252,
3143,
800,
3726,
3726,
1675,
306,
1252,
25,
21,
2732,
823,
16,
301,
366,
13945,
30,
42,
83,
6369,
44,
8926,
9,
48,
1301,
25,
816,
21,
21944,
15,
114,
3379,
88,
14,
297,
882,
9,
9,
19,
502,
15,
184,
107,
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... |
SQL Server 2008 Reporting Services Report Definition Customization Extensions
===
I've been looking into report definition customization extensions (RDCE) in SQL2K8 recently and I've been at a loss to find much documentation or even chatter on the internet about it.
MSDN has a brief overview: http://msdn.microsoft.... | 0 | [
2,
4444,
255,
8128,
570,
6670,
687,
1330,
5465,
5816,
1829,
17529,
800,
3726,
3726,
31,
22,
195,
74,
699,
77,
1330,
5465,
5816,
1829,
17529,
13,
5,
897,
1105,
6,
19,
4444,
255,
135,
197,
457,
1989,
17,
31,
22,
195,
74,
35,
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... |
Best OS App for Outbound SMTP Packet Capture?
===
Okay, so this probably sounds terribly nefarious, but I need such capabilities for my senior project. Essentially I'm tasked with writing something that will cut down outbound spam on a zombified pc through a system of packet interception and evaluation. We have a numb... | 0 | [
2,
246,
13,
759,
4865,
26,
70,
7410,
7613,
13726,
12795,
3683,
60,
800,
3726,
3726,
1705,
15,
86,
48,
910,
2795,
19629,
2836,
3700,
5907,
15,
47,
31,
376,
145,
10209,
26,
51,
1101,
669,
9,
7398,
31,
22,
79,
14605,
29,
1174,
301,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 debugging on OS X - hopeless?
===
I have tried:
1. Xdebug and Eclipse. Eclipse launches a web browser, but the browser tries to access a non-existent file in Eclipse's .app bundle.
2. Xdebug and NetBeans. It does a little bit better; a browser opens a page in /tmp which says "Launching. Please wait…" but nothi... | 0 | [
2,
13,
26120,
121,
16254,
2762,
27,
13,
759,
993,
13,
8,
18846,
60,
800,
3726,
3726,
31,
57,
794,
45,
137,
9,
993,
546,
16254,
17,
11652,
9,
11652,
22933,
21,
2741,
16495,
15,
47,
14,
16495,
3919,
20,
1381,
21,
538,
8,
20788,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 - Match All Occurrences Of a Regex
===
Is there a quick way to find every match of a regular expression in Ruby? I've looked through the Regex object in the Ruby STL and searched on Google to no avail. Thanks! | 0 | [
2,
10811,
13,
8,
730,
65,
12933,
18,
16,
21,
7953,
1706,
800,
3726,
3726,
25,
80,
21,
2231,
161,
20,
477,
352,
730,
16,
21,
1290,
1803,
19,
10811,
60,
31,
22,
195,
292,
120,
14,
7953,
1706,
3095,
19,
14,
10811,
354,
255,
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,
0,
0,
0,
0,
0,
0,
0,
0... |
How do you get the asp:Menu to follow the url provided in the Web.sitemap?
===
I have a _simple_ asp:menu item that uses the Web.sitemap to get the menu items. The page will postback but fails to get the page associated to the clicked item. I will mention that the navigation bar code is within the masterpage file.
... | 0 | [
2,
184,
107,
42,
164,
14,
28,
306,
45,
755,
291,
20,
1740,
14,
287,
6362,
1173,
19,
14,
2741,
9,
9097,
15022,
60,
800,
3726,
3726,
31,
57,
21,
13,
1,
24629,
1,
28,
306,
45,
755,
291,
9101,
30,
2027,
14,
2741,
9,
9097,
15022,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Reparenting a Window as a Tab in a GTK Notebook
===
I'm using Mono with GTK# and am trying to display an existing window as a new tab in a GTK.Notebook. I'm currently re-parenting the widget to the notebook as follows:
<pre>
MyWindow myWindow = new MyWindow();
myWindow.Children[0].Reparent(myNotebook)
</pre>
... | 0 | [
2,
302,
18908,
68,
21,
1463,
28,
21,
6523,
19,
21,
9509,
197,
14630,
800,
3726,
3726,
31,
22,
79,
568,
4129,
29,
9509,
197,
5910,
17,
589,
749,
20,
3042,
40,
3149,
1463,
28,
21,
78,
6523,
19,
21,
9509,
197,
9,
10280,
5199,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What Is The Vim Feature That You Like The Most?
===
I am interested in what people use as their text editor, and would specifically like to know what is the feature of vim that you like the most?
In answering, please state what you mostly use vim to do, sysadmin tasks, programming, and in what language you mostly p... | 0 | [
2,
98,
25,
14,
1790,
79,
1580,
30,
42,
101,
14,
127,
60,
800,
3726,
3726,
31,
589,
3158,
19,
98,
148,
275,
28,
66,
1854,
1835,
15,
17,
83,
3524,
101,
20,
143,
98,
25,
14,
1580,
16,
1790,
79,
30,
42,
101,
14,
127,
60,
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... |
WPF Data Triggers and Story Boards
===
I'm trying to trigger a progress animation when ever the ViewModel/Presentation Model is Bussy. I have a IsBussy Property, and the ViewModel is set as the DataContext of the UserControl. What is the best way to trigger a "progressAnimation" story board when the IsBussy property i... | 0 | [
2,
619,
7721,
1054,
7286,
18,
17,
609,
8755,
800,
3726,
3726,
31,
22,
79,
749,
20,
7286,
21,
3455,
6236,
76,
462,
14,
1418,
13998,
118,
3914,
857,
1061,
25,
1683,
4980,
9,
31,
57,
21,
25,
3822,
4980,
1354,
15,
17,
14,
1418,
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 constitutes 'real time'
===
I am having trouble deciding on whether to classify my application as 'real time' or 'near real time', or perhaps even something else.
The software receives data immediately as it is generated from the source, then based on certain rules, raises an alert when certain conditions are ... | 0 | [
2,
98,
20362,
13,
22,
7467,
85,
22,
800,
3726,
3726,
31,
589,
452,
2572,
11211,
27,
1472,
20,
25117,
51,
3010,
28,
13,
22,
7467,
85,
22,
54,
13,
22,
14114,
683,
85,
22,
15,
54,
1774,
166,
301,
962,
9,
14,
2306,
8359,
1054,
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... |
Perl Regex Match and Removal
===
I have a string which starts with //#... goes upto the newline characater. I have figured out the regex for the which is this ..#([^\n]*).
My question is how do you remove this line from a file if the following condition matches | 0 | [
2,
416,
255,
7953,
1706,
730,
17,
7797,
800,
3726,
3726,
31,
57,
21,
3724,
56,
3244,
29,
12894,
5910,
9,
9,
9,
1852,
71,
262,
14,
78,
1143,
4892,
9721,
815,
9,
31,
57,
5700,
70,
14,
7953,
1706,
26,
14,
56,
25,
48,
13,
9,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Overriding "find" in ActiveRecord the DRY way
===
I have a few models that need to have custom find conditions placed on them. For example, if I have a Contact model, every time Contact.find is called, I want to restrict the contacts returned that only belong to the Account in use.
I found this via Google (which I... | 0 | [
2,
84,
5175,
68,
13,
7,
19811,
7,
19,
1348,
14953,
14,
2273,
161,
800,
3726,
3726,
31,
57,
21,
310,
2761,
30,
376,
20,
57,
5816,
477,
2039,
1037,
27,
105,
9,
26,
823,
15,
100,
31,
57,
21,
2203,
1061,
15,
352,
85,
2203,
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... |
Iterate over and check the byte value of every character in a string - VBA
===
Iterate over and check the byte value of every character in a string - VBA
Code I have:
cell_val = CStr(Nz(fld.value, ""))
Dim iter As Long
For iter = 0 To Len(cell_val) - 1 Step 1
I... | 0 | [
2,
32,
106,
1373,
84,
17,
2631,
14,
34,
591,
1923,
16,
352,
925,
19,
21,
3724,
13,
8,
566,
969,
800,
3726,
3726,
32,
106,
1373,
84,
17,
2631,
14,
34,
591,
1923,
16,
352,
925,
19,
21,
3724,
13,
8,
566,
969,
1797,
31,
57,
45... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the best resources for Windows Workflow Foundation (WWF)?
===
I am looking for a few books, blogs or articles on WWF. I've read the books below; however, I need resources that cover the topic in more depth. I am especially interested in local services, persistence, tracking and viewing Workflows from a websit... | 0 | [
2,
98,
50,
14,
246,
2566,
26,
1936,
170,
9990,
1304,
13,
5,
14178,
410,
6,
60,
800,
3726,
3726,
31,
589,
699,
26,
21,
310,
964,
15,
8146,
18,
54,
3376,
27,
20844,
9,
31,
22,
195,
1302,
14,
964,
1021,
73,
207,
15,
31,
376,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 technology for developing an app that runs on DESKTOP and in BROWSER?
===
Microsoft WPF? Adobe AIR/Flex? Adobe Flash? Curl programming language?
How does AJAX fit in?
Given a server written in C++ .NET. | 0 | [
2,
246,
1099,
26,
3561,
40,
4865,
30,
1461,
27,
17404,
17,
19,
16495,
60,
800,
3726,
3726,
7099,
619,
7721,
60,
20299,
282,
118,
19752,
60,
20299,
4433,
60,
14320,
3143,
816,
60,
184,
630,
20624,
2742,
19,
60,
504,
21,
8128,
642,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Performance of an large directory structure, networked application
===
I'm trying to find out what the performance of a large directory structure would be if deep directories were to be accessed on a shared, nfs filesystem. The structure would be excessively large, with 4 levels of nested directories, each level conta... | 0 | [
2,
956,
16,
40,
370,
16755,
1411,
15,
982,
69,
3010,
800,
3726,
3726,
31,
22,
79,
749,
20,
477,
70,
98,
14,
956,
16,
21,
370,
16755,
1411,
83,
44,
100,
855,
559,
1596,
46,
20,
44,
12904,
27,
21,
2592,
15,
13,
11408,
18,
3893... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 concatenate two arrays in Java?
===
I need to concatenate to String arrays in Java.
void f(String[] first, String[] second) {
String[] both = ???
}
What is the easiest way to do this? | 0 | [
2,
184,
20,
1065,
9530,
8820,
81,
7718,
18,
19,
8247,
60,
800,
3726,
3726,
31,
376,
20,
1065,
9530,
8820,
20,
3724,
7718,
18,
19,
8247,
9,
11364,
398,
5,
11130,
2558,
500,
64,
15,
3724,
2558,
500,
153,
6,
13,
1,
3724,
2558,
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... |
How do you turn on Code Coverage in Builds within TFS?
===
I need to know how to turn on Code Coverage when running TFS builds on a solution with a .testrunconfig file.
There is an option i the testrunconfig file that is for code coverage, but when running a TFS build there is no code coverage results | 0 | [
2,
184,
107,
42,
805,
27,
1797,
5245,
19,
1895,
18,
363,
13,
11720,
18,
60,
800,
3726,
3726,
31,
376,
20,
143,
184,
20,
805,
27,
1797,
5245,
76,
946,
13,
11720,
18,
1895,
18,
27,
21,
4295,
29,
21,
13,
9,
10543,
3169,
14093,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Reading Unformatted Data
===
In C, using the standard Windows API, what is the best way to read an unformatted disk? Specifically, I have an [MMC][1] or [SD card][2] with data, but no file system (not FAT16, not FAT32, just raw data). If there was a simple way to open the entire card for byte by byte binary access, th... | 0 | [
2,
1876,
367,
29850,
1054,
800,
3726,
3726,
19,
272,
15,
568,
14,
1236,
1936,
21,
2159,
15,
98,
25,
14,
246,
161,
20,
1302,
40,
367,
29850,
8582,
60,
3524,
15,
31,
57,
40,
636,
79,
4829,
500,
2558,
165,
500,
54,
636,
18,
43,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the location of OpenOffice.org templates in Linux?
===
I'd like to install some presentation templates, but don't know where to put them...
Thanks a lot | 0 | [
2,
98,
25,
14,
1474,
16,
368,
17047,
9,
5583,
22894,
18,
19,
13024,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
16146,
109,
6364,
22894,
18,
15,
47,
221,
22,
38,
143,
113,
20,
442,
105,
9,
9,
9,
3669,
21,
865,
3,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What happens when the stylus "lifts" on a tablet pc? How best to capture that event?
===
I am working on a legacy project in VC++/Win32/MFC. Recently it became a requirement that the application work on a **tablet pc**, and this ushered in a host of new issues:
> 1. the software keyboard has to use a "toggle" mode... | 0 | [
2,
98,
5531,
76,
14,
13,
9433,
4334,
13,
7,
10805,
18,
7,
27,
21,
16394,
5168,
60,
184,
246,
20,
3683,
30,
807,
60,
800,
3726,
3726,
31,
589,
638,
27,
21,
7780,
669,
19,
13,
8990,
20512,
118,
4181,
3125,
118,
79,
7061,
9,
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... |
Given two dates what is the best way of finding the number of weekdays in PHP?
===
The title is pretty much self explanatory. Given two dates what is the best way of finding the number of weekdays using PHP?
For instance, how would I find out that there are 10 week days in between 31/08/2008 and 13/09/2008? | 0 | [
2,
504,
81,
4076,
98,
25,
14,
246,
161,
16,
3007,
14,
234,
16,
13411,
18,
19,
13,
26120,
60,
800,
3726,
3726,
14,
581,
25,
1772,
212,
1119,
1396,
9863,
7496,
9,
504,
81,
4076,
98,
25,
14,
246,
161,
16,
3007,
14,
234,
16,
134... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there any good tool for working on Dabtabase apart from Toad which requires license and DBVisualiser not supportive
===
Is there any good tool for working on Dabtabase apart from Toad which requires license and DBVisualiser not supportive | 0 | [
2,
25,
80,
186,
254,
5607,
26,
638,
27,
14690,
536,
8436,
2629,
37,
20,
1283,
56,
4781,
3962,
17,
13,
9007,
20893,
13042,
52,
18683,
800,
3726,
3726,
25,
80,
186,
254,
5607,
26,
638,
27,
14690,
536,
8436,
2629,
37,
20,
1283,
56,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Transmitfile, download with weird behaviour
===
I am using httpresponse.Transmitfile to download files. If I, in the file download dialog, choose to save in a different folder than the suggested one, the download rate drops down to 10 - 20 kb. If I cancel, or always choose to download in the same folder, then transfer... | 0 | [
2,
18745,
16877,
15,
7121,
29,
5455,
7727,
800,
3726,
3726,
31,
589,
568,
7775,
99,
18,
8782,
870,
9,
7028,
5130,
16877,
20,
7121,
6488,
9,
100,
31,
15,
19,
14,
3893,
7121,
28223,
15,
3538,
20,
2079,
19,
21,
421,
19294,
119,
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... |
MS CRM4.0 Provisioning Issue using CrmDeploymentService
===
i've been working on Provision of an organization for quite a few days , and had faced few issues which i was successful in resolving them.Let me explain abt the issues i faced, the MSCrmServices is a process that is running under the Network Service.
When ... | 0 | [
2,
4235,
6186,
79,
300,
9,
387,
8738,
68,
1513,
568,
6186,
79,
17309,
10892,
1130,
11449,
800,
3726,
3726,
31,
22,
195,
74,
638,
27,
8738,
16,
40,
1165,
26,
1450,
21,
310,
509,
13,
15,
17,
41,
3110,
310,
1549,
56,
31,
23,
1300... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
File storing strategies for a web hosting website
===
I am going to hosting for files that user submits. I need to grab some data from the file and then move it to some directory.
There two points of interest for the lifetime of this file. The first is when the data is being abstracted and the second is when the fi... | 0 | [
2,
3893,
25615,
10272,
26,
21,
2741,
10637,
2271,
800,
3726,
3726,
31,
589,
228,
20,
10637,
26,
6488,
30,
4155,
12298,
18,
9,
31,
376,
20,
4931,
109,
1054,
37,
14,
3893,
17,
94,
780,
32,
20,
109,
16755,
9,
80,
81,
819,
16,
116... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there an alternative to gdb for Linux systems?
===
Please consider both commercial and free debuggers. Would like to see also the pros and cons for each. | 0 | [
2,
25,
80,
40,
2676,
20,
489,
9007,
26,
13024,
1242,
60,
800,
3726,
3726,
2247,
3563,
156,
1439,
17,
551,
121,
16254,
11896,
9,
83,
101,
20,
196,
67,
14,
895,
18,
17,
11608,
26,
206,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Visual Studio: How to trigger an alarm when a breakpoint is hit?
===
Is there a way to trigger a sound or alarm when my breakpoint is hit? I'm using Visual Studio 2005/2008. | 0 | [
2,
3458,
1120,
45,
184,
20,
7286,
40,
6490,
76,
21,
1442,
3132,
25,
770,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
7286,
21,
646,
54,
6490,
76,
51,
1442,
3132,
25,
770,
60,
31,
22,
79,
568,
3458,
1120,
812,
118,
2753,
9,
3,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to get prepared for an interview?
===
I am an engineer with c, c++ back ground. And am mostly interested to work in data structures and algorithms kind of work. So, obviously asked those kind of questions? Is there any best resource where can I found the best interview questions?
Like to know sites/books:
whic... | 4 | [
2,
184,
20,
164,
3268,
26,
40,
2421,
60,
800,
3726,
3726,
31,
589,
40,
2335,
29,
272,
15,
272,
20512,
97,
666,
9,
17,
589,
1555,
3158,
20,
170,
19,
1054,
3815,
17,
15935,
825,
16,
170,
9,
86,
15,
4409,
411,
273,
825,
16,
234... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Method Local Inner Class
===
public class Test {
public static void main(String[] args) {
}
}
class Outer {
void aMethod() {
class MethodLocalInner {
void bMethod() {
System.out.println("Inside method-local bMethod");
}
}
}
}
Can some one tell me how to print the messag... | 0 | [
2,
2109,
375,
3754,
718,
800,
3726,
3726,
317,
718,
1289,
13,
1,
317,
12038,
11364,
407,
5,
11130,
2558,
500,
13,
10663,
18,
6,
13,
1,
13,
1,
13,
1,
718,
4896,
13,
1,
11364,
589,
6268,
5648,
5,
6,
13,
1,
718,
2109,
15580,
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... |
Enabling embedded controls in a FlowDocument
===
I have a FlowDocument in a standard WPF application window where I have some text, and in this text some hyperlinks and buttons.
The problem is, if I put this FlowDocument inside anything **except** a [FlowDocumentPageViewer][1] the hyperlinks and buttons are disable... | 0 | [
2,
13168,
12138,
8671,
19,
21,
3312,
28132,
800,
3726,
3726,
31,
57,
21,
3312,
28132,
19,
21,
1236,
619,
7721,
3010,
1463,
113,
31,
57,
109,
1854,
15,
17,
19,
48,
1854,
109,
5443,
6258,
18,
17,
12861,
9,
14,
1448,
25,
15,
100,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Merge XML documents
===
I need to "merge" two XML documents, overwriting the overlapsed attributes and elements. For instance if I have **document1** | 0 | [
2,
12666,
23504,
4374,
800,
3726,
3726,
31,
376,
20,
13,
7,
1263,
834,
7,
81,
23504,
4374,
15,
84,
12646,
14,
15406,
18,
69,
13422,
17,
2065,
9,
26,
4851,
100,
31,
57,
13,
1409,
28132,
165,
1409,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Best practises for holding passwords in shell / perl scripts?
===
I've recently had to dust off my perl and shell script skills to help out some colleagues. The colleagues in question have been tasked with providing some reports from an internal application with a large Oracle database backend, and they simply don't h... | 0 | [
2,
246,
27954,
18,
26,
1337,
20884,
18,
19,
3593,
13,
118,
416,
255,
17505,
60,
800,
3726,
3726,
31,
22,
195,
1989,
41,
20,
4346,
168,
51,
416,
255,
17,
3593,
3884,
3207,
20,
448,
70,
109,
8493,
9,
14,
8493,
19,
1301,
57,
74,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Asychronous Programming in Python Twisted
===
I'm having trouble developing a reverse proxy in Twisted. It works, but it seems overly complex and convoluted. So much of it feels like voodoo...
Are there any *simple, solid* examples of asynchronous program structure on the web or in books? A sort of best practices g... | 0 | [
2,
28,
93,
19973,
1291,
3143,
19,
20059,
5308,
800,
3726,
3726,
31,
22,
79,
452,
2572,
3561,
21,
7006,
27188,
19,
5308,
9,
32,
693,
15,
47,
32,
2206,
18234,
1502,
17,
1065,
16261,
1427,
9,
86,
212,
16,
32,
5121,
101,
6593,
8850,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
'Helper' functions in C++
===
While refactoring some old code I have stripped out a number of public methods that should actually of been statics as they a) don't operate on any member data or call any other member functions and b) because they might prove useful elsewhere.
This led me to think about the best way t... | 0 | [
2,
13,
22,
14593,
106,
22,
3719,
19,
272,
20512,
800,
3726,
3726,
133,
302,
17455,
68,
109,
315,
1797,
31,
57,
10841,
70,
21,
234,
16,
317,
3195,
30,
378,
1121,
16,
74,
12038,
18,
28,
59,
21,
6,
221,
22,
38,
4055,
27,
186,
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... |
Best way to make events asynchronous in C#
===
Events are synchronous in C#. I have this application where my main form starts a thread with a loop in it that listens to a stream. When something comes along on the stream an event is fired from the loop to the main form.
If the main form is slow or shows a messageb... | 0 | [
2,
246,
161,
20,
233,
963,
21,
16023,
1291,
19,
272,
5910,
800,
3726,
3726,
963,
50,
13,
16023,
1291,
19,
272,
5910,
9,
31,
57,
48,
3010,
113,
51,
407,
505,
3244,
21,
9322,
29,
21,
5293,
19,
32,
30,
3834,
18,
20,
21,
3766,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.