unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
MS SSRS Report Builder: Semantic query execution failed.?
===
I have created an end user model and deployed it. Any report that I create and run gives me an error:
Report execution error
The report might not be valid or the server
could not process the data.
Semantic query execution failed. Invalid column n... | 0 | [
2,
4235,
22118,
18,
1330,
14960,
45,
17220,
25597,
5769,
1702,
9,
60,
800,
3726,
3726,
31,
57,
679,
40,
241,
4155,
1061,
17,
6698,
32,
9,
186,
1330,
30,
31,
1600,
17,
485,
2352,
55,
40,
7019,
45,
1330,
5769,
7019,
14,
1330,
530,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are best practices to implement security when using NHibernate?
===
Traditionalist argue that stored procedures provide better security than if you use a Object Relational Mapping (ORM) framework such as NHibernate.
To counter that argument what are some approaches that can be used with NHibernate to ensure t... | 0 | [
2,
98,
50,
246,
5242,
20,
8713,
1221,
76,
568,
12109,
15191,
8820,
60,
800,
3726,
3726,
1361,
702,
6467,
30,
8214,
8876,
1181,
574,
1221,
119,
100,
42,
275,
21,
3095,
5827,
192,
13305,
13,
5,
248,
79,
6,
6596,
145,
28,
12109,
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... |
Resources that have to be manually cleaned up in C#?
===
What resources have to be manually cleaned up in C#? ...and what are the consquences of not doing so?
For example, say i have the following code:
myBrush = new System.Drawing.SolidBrush(System.Drawing.Color.Black);
//Use Brush
If i don't clea... | 0 | [
2,
2566,
30,
57,
20,
44,
23671,
13143,
71,
19,
272,
5910,
60,
800,
3726,
3726,
98,
2566,
57,
20,
44,
23671,
13143,
71,
19,
272,
5910,
60,
13,
9,
9,
9,
290,
98,
50,
14,
11608,
16694,
5052,
16,
52,
845,
86,
60,
26,
823,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ruby and WS-Security
===
I'm having troubles finding good Ruby libraries that implement WS-Security. I've seen [wss4r][1] but have yet to use it (and the documentation is a bit light on it). What libraries do you use for this task, or is there a better alternative?
[1]: http://rubyforge.org/projects/wss4r/ | 0 | [
2,
10811,
17,
619,
18,
8,
17749,
800,
3726,
3726,
31,
22,
79,
452,
16615,
3007,
254,
10811,
8649,
30,
8713,
619,
18,
8,
17749,
9,
31,
22,
195,
541,
636,
10268,
18,
300,
139,
500,
2558,
165,
500,
47,
57,
768,
20,
275,
32,
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... |
Can I (re-) map commands in vim?
===
I love vim and the speed it gives me. But sometimes, my fingers are too speedy and I find myself typing ":WQ" instead of ":wq" (on a German keyboard, you have to press shift to get the colon). Vim will then complain that 'W' is not an editor command.
Is there some way to make W ... | 0 | [
2,
92,
31,
13,
5,
99,
8,
6,
2942,
14294,
19,
1790,
79,
60,
800,
3726,
3726,
31,
339,
1790,
79,
17,
14,
1362,
32,
2352,
55,
9,
47,
1030,
15,
51,
1243,
50,
266,
1362,
93,
17,
31,
477,
992,
25266,
13,
7,
45,
499,
1251,
7,
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... |
Python and GET or POST data
===
In PHP I simply write:
$bob = $_POST['bob'];
How do I do the same in Python?
And yes, I do normally check that it exists etc, I'm just stripping it down specifically to the functionality I am after.
<hr>
Edit: I am not using a framework | 0 | [
2,
20059,
17,
164,
54,
678,
1054,
800,
3726,
3726,
19,
13,
26120,
31,
1659,
2757,
45,
5579,
12570,
800,
5579,
1,
6962,
2558,
22,
12570,
22,
12660,
184,
107,
31,
107,
14,
205,
19,
20059,
60,
17,
1643,
15,
31,
107,
4147,
2631,
30,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
design by contract tests by assert or by exception?
===
When programming by contract a function or method first checks whether its preconditions are fulfilled, before starting to work on its responsibilities, right? The two most prominent ways to do these checks are by `assert` and by `exception`.
1. assert fails... | 0 | [
2,
704,
34,
1305,
4894,
34,
10908,
54,
34,
5391,
60,
800,
3726,
3726,
76,
3143,
34,
1305,
21,
1990,
54,
2109,
64,
16602,
1472,
82,
782,
22141,
18,
50,
18734,
15,
115,
1422,
20,
170,
27,
82,
13,
10525,
15,
193,
60,
14,
81,
127,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C#: Try-catch every line of code without individual try-catch blocks
===
I do not currently have this issue, but you never know, and thought experiments are always fun.
Ignoring the obvious problems that you would have to have with your architecture to even be attempting this, let's assume that you had some horribl... | 0 | [
2,
272,
5910,
45,
1131,
8,
18208,
352,
293,
16,
1797,
366,
1359,
1131,
8,
18208,
5198,
800,
3726,
3726,
31,
107,
52,
871,
57,
48,
1513,
15,
47,
42,
243,
143,
15,
17,
289,
7715,
50,
550,
2414,
9,
9321,
14,
4674,
1716,
30,
42,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Seam/JSF form submit firing button onclick event
===
I have a search form with a query builder. The builder is activated by a button. Something like this
<h:form id="search_form">
<h:outputLabel for="expression" value="Expression"/>
<h:inputText id="expression" required="true" value="#{searcher.ex... | 0 | [
2,
13927,
118,
728,
18,
410,
505,
12298,
7139,
5167,
27,
150,
10129,
807,
800,
3726,
3726,
31,
57,
21,
2122,
505,
29,
21,
25597,
14960,
9,
14,
14960,
25,
9654,
34,
21,
5167,
9,
301,
101,
48,
13,
1,
252,
45,
4190,
4924,
3726,
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... |
deleting subdomain cookies
===
If there is a cookie set for a subdomain, metric.foo.com, is there a way for me to delete the metric.foo.com cookie on a request to www.foo.com? The browser (at least Firefox) seems to ignore a Set-Cookie with a domain of metric.foo.com. | 0 | [
2,
121,
1336,
68,
972,
537,
6232,
19396,
800,
3726,
3726,
100,
80,
25,
21,
19980,
309,
26,
21,
972,
537,
6232,
15,
11544,
9,
4120,
111,
9,
960,
15,
25,
80,
21,
161,
26,
55,
20,
27448,
14,
11544,
9,
4120,
111,
9,
960,
19980,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best way to use SVN to version control a PHP site?
===
I've always just FTPed files down from sites, edited them and put them back up when creating sites, but feel it's worth learning to do things properly.
I've just commited everything to a SVN repo, and have tried sshing into the server and checking ou... | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
275,
13,
18,
16578,
20,
615,
569,
21,
13,
26120,
689,
60,
800,
3726,
3726,
31,
22,
195,
550,
114,
1187,
3631,
6488,
125,
37,
3259,
15,
4802,
105,
17,
442,
105,
97,
71,
76,
2936,
3259,
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... |
Manually inserting data in a table(s) with primary key populated with sequence
===
I have a number of tables that use the trigger/sequence column to simulate auto_increment on their primary keys which has worked great for some time.
In order to speed the time necessary to perform regression testing against software... | 0 | [
2,
23671,
14692,
68,
1054,
19,
21,
859,
5,
18,
6,
29,
1256,
1246,
11111,
29,
4030,
800,
3726,
3726,
31,
57,
21,
234,
16,
7484,
30,
275,
14,
7286,
118,
29413,
4698,
20,
24969,
3108,
1,
28461,
27,
66,
1256,
5534,
56,
63,
577,
37... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 decimal value when using the division operator in Python?
===
For example, the standard division symbol '/' rounds to zero:
>>> 4 / 100
0
However, I want it to return 0.04. What do I use?
| 0 | [
2,
184,
107,
31,
164,
21,
26380,
1923,
76,
568,
14,
460,
6022,
19,
20059,
60,
800,
3726,
3726,
26,
823,
15,
14,
1236,
460,
4678,
13,
22,
118,
22,
5839,
20,
4606,
45,
13,
1,
268,
13,
118,
808,
713,
207,
15,
31,
259,
32,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0... |
What is PostgreSQL explain telling me exactly?
===
MySQL's explain output is pretty straightforward. PostgreSQL's is a little more complicated. I haven't been able to find a good resource that explains it either.
Can you describe what exactly explain is saying or at least point me in the direction of a good resourc... | 0 | [
2,
98,
25,
678,
6879,
18,
22402,
3271,
2497,
55,
1890,
60,
800,
3726,
3726,
51,
18,
22402,
22,
18,
3271,
5196,
25,
1772,
22262,
9,
678,
6879,
18,
22402,
22,
18,
25,
21,
265,
91,
8343,
9,
31,
2933,
22,
38,
74,
777,
20,
477,
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... |
Use of 'const' for function parameters
===
How far do you go with const? Do you just make functions const when necessary or do you go the whole hog and use it everywhere? For example, imagine a simple mutator that takes a single boolean parameter:
`void SetValue(const boolen b) { my_val_ = b; }`
Is that const ... | 0 | [
2,
275,
16,
13,
22,
12124,
38,
22,
26,
1990,
12905,
800,
3726,
3726,
184,
463,
107,
42,
162,
29,
11608,
38,
60,
107,
42,
114,
233,
3719,
11608,
38,
76,
2378,
54,
107,
42,
162,
14,
979,
13716,
17,
275,
32,
6417,
60,
26,
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... |
How does including a SQL index hint affect query performance?
===
Say I have a table in a SQL 2005 database with 2,000,000+ records and a few indexes. What advantage is there to using index hints in my queries? Are there ever disadvantages to using index hints in queries? | 0 | [
2,
184,
630,
215,
21,
4444,
255,
4348,
6382,
6245,
25597,
956,
60,
800,
3726,
3726,
395,
31,
57,
21,
859,
19,
21,
4444,
255,
812,
6018,
29,
172,
11623,
2430,
742,
17,
21,
310,
4348,
160,
9,
98,
3314,
25,
80,
20,
568,
4348,
638... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
sharepoint 2007 - custom content type - filtered lookup column
===
I had defined a custom content type, and I am trying to define a filtered lookup column. I can select the list from where to pick up the column I need, but I can't find any example of the needed format of query string. I can filter the list manually by... | 0 | [
2,
1891,
3132,
624,
13,
8,
5816,
2331,
1001,
13,
8,
25090,
361,
576,
4698,
800,
3726,
3726,
31,
41,
2811,
21,
5816,
2331,
1001,
15,
17,
31,
589,
749,
20,
9267,
21,
25090,
361,
576,
4698,
9,
31,
92,
5407,
14,
968,
37,
113,
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... |
Specman macro to do set subtraction with int_range_list objects
===
I work with a bunch of sets in order to generate constrained random traffic, but I want to be able to call a Specman macro that computes the complement of a set with syntax like:
COMPLEMENT begin
domain=[0..10,24..30],
complmenting_set=[2.... | 0 | [
2,
12737,
177,
9069,
20,
107,
309,
27031,
872,
29,
19,
38,
1,
8366,
1,
5739,
3916,
800,
3726,
3726,
31,
170,
29,
21,
7653,
16,
3415,
19,
389,
20,
7920,
28751,
5477,
2227,
15,
47,
31,
259,
20,
44,
777,
20,
645,
21,
12737,
177,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 common blocks
===
I have two files (f1 and f2) containing some text (or binary data).<br>
How can I quickly find common blocks?
e.g.<br>
f1: ABC DEF<br>
f2: XXABC XEF
output:
common blocks:<br>
length 4: "ABC " in f1@0 and f2@2
length 2: "EF" in f1@5 and f2@8 | 0 | [
2,
3007,
757,
5198,
800,
3726,
3726,
31,
57,
81,
6488,
13,
5,
410,
165,
17,
398,
135,
6,
3503,
109,
1854,
13,
5,
248,
14171,
1054,
6,
9,
1,
5145,
1,
184,
92,
31,
976,
477,
757,
5198,
60,
13,
62,
9,
263,
9,
1,
5145,
1,
39... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 and Timers
===
Consider this code...
using System.Threading;
//...
Timer someWork = new Timer(
delegate(object state) {
//Do some work here...
},
null, 0, 60000);
HttpContext.Current.Application["SomeWorkItem"] = someWork;
Could this be dange... | 0 | [
2,
28,
306,
9,
2328,
17,
85,
1224,
800,
3726,
3726,
3563,
48,
1797,
9,
9,
9,
568,
329,
9,
96,
22883,
73,
12894,
9,
9,
9,
85,
139,
109,
3783,
800,
78,
85,
139,
5,
11300,
5,
23793,
146,
6,
13,
1,
12894,
537,
109,
170,
235,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 unshelve to a different branch in tfs 2008?
===
Let's assume that some developer in my team shelved his changes that he did in branch A. And I am working on branch B. Can I unshelve his changes into branch B? (By GUI or command prompt) | 0 | [
2,
92,
31,
367,
18,
9180,
195,
20,
21,
421,
1686,
19,
13,
11720,
18,
570,
60,
800,
3726,
3726,
408,
22,
18,
7158,
30,
109,
10058,
19,
51,
173,
29427,
33,
1693,
30,
24,
144,
19,
1686,
21,
9,
17,
31,
589,
638,
27,
1686,
334,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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++ timing, milliseconds since last whole second
===
I'm working on a C++ application that needs detailed timing information, down to the millisecond level.
We intend to gather the time to second accuracy using the standard time() function in <ctime>. We would like to additionally gather the milliseconds elapsed... | 0 | [
2,
272,
20512,
11812,
15,
13436,
5007,
18,
179,
236,
979,
153,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
272,
20512,
3010,
30,
2274,
6036,
11812,
676,
15,
125,
20,
14,
13436,
5007,
662,
9,
95,
13863,
20,
7442,
14,
85,
20,
153,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 SQL Server Management Studio and the Express version?
===
I'm using Express currently. What extra features do I get with the full version? | 0 | [
2,
98,
22,
18,
14,
2841,
128,
4444,
255,
8128,
1097,
1120,
17,
14,
2999,
615,
60,
800,
3726,
3726,
31,
22,
79,
568,
2999,
871,
9,
98,
2230,
967,
107,
31,
164,
29,
14,
503,
615,
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,
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... |
Optimize y = x*x in Galois field arithmetic
===
I have this C-code to do multiplications over GF(8):
int32_t GaloisMultiply (int32_t a, int32_t b)
{
int32_t i;
int32_t mask = 0x100;
int32_t y = 0;
for(i=0;i<8;i++)
{
if(b & mask)
{
y ^= ... | 0 | [
2,
22864,
13,
93,
800,
993,
2483,
396,
19,
5027,
7795,
575,
21211,
800,
3726,
3726,
31,
57,
48,
272,
8,
9375,
20,
107,
25432,
18,
84,
13,
16368,
5,
457,
6,
45,
19,
38,
3125,
1,
38,
5027,
7795,
21531,
306,
102,
13,
5,
6391,
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 is a solid, elegant, reusable piece of code for determining if an IEnumerable is empty, in .NET?
===
I'm trying to find the most reusable, yet elegant, piece of code possible for determining if an IEnumerable<T>. In the ideal, this should be a function I can call absolutely any time I need to tell if an IEnumera... | 0 | [
2,
98,
25,
21,
2941,
15,
11614,
15,
302,
267,
579,
1855,
16,
1797,
26,
13521,
100,
40,
13,
660,
6336,
106,
579,
25,
2424,
15,
19,
13,
9,
2328,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
477,
14,
127,
302,
267,
579,
15,
768,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 bind an event handler to an instance in JQuery
===
Say I have a "class" as follows:
function Car(owner) {
this.owner = owner;
}
Car.prototype = {
drive: function() {
alert("Driving "+this.owner+"s car!");
}
}
And an instance:
var myCar = new Car("Bob");... | 0 | [
2,
184,
10193,
40,
807,
24641,
20,
40,
4851,
19,
487,
8190,
93,
800,
3726,
3726,
395,
31,
57,
21,
13,
7,
1898,
7,
28,
2415,
45,
1990,
349,
5,
10705,
6,
13,
1,
48,
9,
10705,
800,
2410,
73,
13,
1,
349,
9,
2740,
262,
4474,
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... |
Can't download file in IE7 but there isn't any problem in Firefox, Chrome, etc..?
===
I have an script that receives an encrypted url and from that generates a download, the most critic par of the script is this:
$MimeType = new MimeType();
$mimetype = $MimeType->getType($filename);
$basename = basena... | 0 | [
2,
92,
22,
38,
7121,
3893,
19,
13,
660,
465,
47,
80,
2532,
22,
38,
186,
1448,
19,
535,
18219,
15,
13,
12985,
15,
2722,
9,
9,
60,
800,
3726,
3726,
31,
57,
40,
3884,
30,
8359,
40,
29403,
287,
6362,
17,
37,
30,
7920,
18,
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... |
ADSI will not connect to IIS from XP Workstation
===
I'm successfully using VBScript within WScript to remotely read and write IIS configurations from the server. When I attempt to run these same scripts from my desk box they fail, though. Example:
Dim vdir
Set vdir = GetObject("IIS://servername/w3svc/226/... | 0 | [
2,
16236,
49,
129,
52,
6379,
20,
595,
18,
37,
23045,
170,
10839,
800,
3726,
3726,
31,
22,
79,
3673,
568,
13,
20468,
8741,
363,
619,
8741,
20,
23288,
1302,
17,
2757,
595,
18,
8091,
18,
37,
14,
8128,
9,
76,
31,
1735,
20,
485,
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 checkout files under Perforce from within Emacs?
===
I use Perforce for source control at work and I want to 'open for edit' files that under source control from within Emacs.
How can that be done? What do I need to setup in Emacs? Is there a plug in? I also want to perform other p4 operations such as sub... | 0 | [
2,
184,
107,
31,
2631,
1320,
6488,
131,
416,
8774,
37,
363,
13,
62,
6893,
18,
60,
800,
3726,
3726,
31,
275,
416,
8774,
26,
1267,
569,
35,
170,
17,
31,
259,
20,
13,
22,
10157,
26,
9392,
22,
6488,
30,
131,
1267,
569,
37,
363,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 wrap UML Use Cases with code objects which represent steps in UI workflows?
===
I was writing some complicated UI for a business website. I decided to use Cockburn use cases with levels (as suggested by Martin Folwer in his book 'UML Distilled'). I wrapped the use cases in static C# objects so that I co... | 0 | [
2,
246,
161,
20,
8118,
13,
723,
255,
275,
1871,
29,
1797,
3916,
56,
3501,
2382,
19,
13,
5661,
170,
9990,
18,
60,
800,
3726,
3726,
31,
23,
1174,
109,
8343,
13,
5661,
26,
21,
508,
2271,
9,
31,
868,
20,
275,
5528,
4249,
275,
1871... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which php framework is closest to Ruby on Rails? Cakephp? CodeIgniter?
===
I'm going to be switching back and forth between Ruby on Rails projects and some as-of-yet undecided PHP MVC framework projects.
Which of the PHP MVC frameworks out there ([CakePHP][1], [Codeigniter][2]?, others?) is most similar to Ruby ... | 0 | [
2,
56,
13,
26120,
6596,
25,
6993,
20,
10811,
27,
2240,
18,
60,
8390,
26120,
60,
1797,
9693,
242,
106,
60,
800,
3726,
3726,
31,
22,
79,
228,
20,
44,
13027,
97,
17,
5882,
128,
10811,
27,
2240,
18,
2314,
17,
109,
28,
8,
1041,
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... |
Which configuration method do you prefer in .net? Why?
===
- You can use App.config; but it only supports key/value pairs.
- You can use .Net configuration, configuration sections; but it can be really complex.
- You can use Xml Serialization/Deserialization by yourself; your classes-your way.
- You can use... | 0 | [
2,
56,
8091,
2109,
107,
42,
6369,
19,
13,
9,
2328,
60,
483,
60,
800,
3726,
3726,
13,
8,
42,
92,
275,
4865,
9,
14093,
2816,
73,
47,
32,
104,
6747,
1246,
118,
15165,
7473,
9,
13,
8,
42,
92,
275,
13,
9,
2328,
8091,
15,
8091,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 branch an individual file in SVN?
===
The subversion concept of branching appears to be focused on creating an [un]stable fork of the entire repository on which to do development. Is there a mechanism for creating branches of individual files? For a use case, think of a common header (\*.h) file that has mult... | 0 | [
2,
184,
107,
31,
1686,
40,
1359,
3893,
19,
13,
18,
16578,
60,
800,
3726,
3726,
14,
972,
10898,
2420,
16,
1686,
68,
1780,
20,
44,
2604,
27,
2936,
40,
636,
1020,
500,
18,
5924,
8777,
16,
14,
1078,
24869,
27,
56,
20,
107,
522,
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... |
How can I resolve my drifting clock for my Virtual Machine?
===
My Virtual Machine's clock drifts pretty significantly. There's documentation out there about dealing with this, but nothing seems to be working very well.
Anyone have any suggestions, things that worked well for them, ...
Supposedly updating regul... | 0 | [
2,
184,
92,
31,
9854,
51,
17169,
4229,
26,
51,
6599,
1940,
60,
800,
3726,
3726,
51,
6599,
1940,
22,
18,
4229,
9865,
18,
1772,
5085,
9,
80,
22,
18,
13945,
70,
80,
88,
5746,
29,
48,
15,
47,
626,
2206,
20,
44,
638,
253,
134,
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... |
Best Way To Add Version Control To Existing Project
===
Hey guys, I am currently working on a project and it's grown to a decent size, but I am the only developer. We currently don't use any version control, but I definitely need to start. I wanted to use Subversion but I was wondering what would be the best way to tr... | 0 | [
2,
246,
161,
20,
3547,
615,
569,
20,
3149,
669,
800,
3726,
3726,
8409,
2776,
15,
31,
589,
871,
638,
27,
21,
669,
17,
32,
22,
18,
3651,
20,
21,
12238,
1072,
15,
47,
31,
589,
14,
104,
10058,
9,
95,
871,
221,
22,
38,
275,
186,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
taking large inputs in c++?
===
how to take large inputs in c++? i mean 10^100.. for algorithms i usually switch over to ruby .. n sometimes i use strings anyother method pls?!! | 0 | [
2,
741,
370,
6367,
18,
19,
272,
20512,
60,
800,
3726,
3726,
184,
20,
247,
370,
6367,
18,
19,
272,
20512,
60,
31,
884,
332,
1,
4031,
9,
9,
26,
15935,
31,
951,
5521,
84,
20,
10811,
13,
9,
9,
13,
103,
1030,
31,
275,
7887,
186,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Getting started using Linq, what do I need?
===
Basically what the title says. (Forgive me because I am a .NET newb)
In my department, we have a server running .net 3.5 and ever since I got into this section I have been using LINQ. However, I am starting a personal project on a different server (obviously), so 2 q... | 0 | [
2,
1017,
373,
568,
6294,
1251,
15,
98,
107,
31,
376,
60,
800,
3726,
3726,
11374,
98,
14,
581,
898,
9,
13,
5,
1106,
8448,
55,
185,
31,
589,
21,
13,
9,
2328,
78,
220,
6,
19,
51,
604,
15,
95,
57,
21,
8128,
946,
13,
9,
2328,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 use Terracotta to scale a RAM-intensive application?
===
I'm evaluating Terracotta to help me scale up an application which is currently RAM-bounded. It is a collaborative filter and stores about 2 kilobytes of data per-user. I want to use Amazon's EC2, which means I'm limited to 14GB of RAM, which gives me an e... | 0 | [
2,
92,
31,
275,
9195,
5987,
58,
20,
3464,
21,
2843,
8,
108,
8710,
1284,
3010,
60,
800,
3726,
3726,
31,
22,
79,
26764,
9195,
5987,
58,
20,
448,
55,
3464,
71,
40,
3010,
56,
25,
871,
2843,
8,
7410,
69,
9,
32,
25,
21,
12937,
119... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 prevent a buffer overflow in C# using an unsigned right shift?
===
I want alwaysPositive to be assigned a positive number with all possible values for lareValue1 and largeValue2 (these are at least 1).
The following statement causes a buffer overflow:
int alwaysPositive = largeValue1 + largeValue2 / 2;... | 0 | [
2,
92,
31,
2501,
21,
17497,
20285,
19,
272,
5910,
568,
40,
28839,
193,
4471,
60,
800,
3726,
3726,
31,
259,
550,
21299,
20,
44,
2467,
21,
2221,
234,
29,
65,
938,
4070,
26,
333,
99,
15165,
165,
17,
370,
15165,
135,
13,
5,
11836,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a dynamic site into a static site that can be demo'd from a CD?
===
I need to find a way to crawl one of our company's web applications and create a static site from it that can be burned to a cd and used by traveling sales people to demo the web site. The back end data store is spread across many, man... | 0 | [
2,
184,
107,
42,
805,
21,
7782,
689,
77,
21,
12038,
689,
30,
92,
44,
8376,
22,
43,
37,
21,
1745,
60,
800,
3726,
3726,
31,
376,
20,
477,
21,
161,
20,
12392,
53,
16,
318,
237,
22,
18,
2741,
3767,
17,
1600,
21,
12038,
689,
37,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
BAML Decompiler / Viewer
===
Could anyone recommend a good BAML Decompiler / Viewer besides BAML Viewer plugin for Reflector, which doesn't handle path geometry/data? | 0 | [
2,
11890,
255,
121,
11103,
49,
1252,
13,
118,
16812,
800,
3726,
3726,
110,
1276,
12360,
21,
254,
11890,
255,
121,
11103,
49,
1252,
13,
118,
16812,
3410,
11890,
255,
16812,
10922,
108,
26,
6907,
248,
15,
56,
1437,
22,
38,
3053,
2013,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Filtering out duplicate values at runtime in a sql database - set based
===
I have a database issue that i currently cannot wrap my head around with an easy solution. In my db I have a table that stores event values.. 0's and 1's with a timestamp. Issue being that it is possible for there to be the same event to occur... | 0 | [
2,
25272,
70,
19429,
4070,
35,
485,
891,
19,
21,
4444,
255,
6018,
13,
8,
309,
432,
800,
3726,
3726,
31,
57,
21,
6018,
1513,
30,
31,
871,
1967,
8118,
51,
157,
140,
29,
40,
2010,
4295,
9,
19,
51,
13,
9007,
31,
57,
21,
859,
30,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to sniff usb port under Windows?
===
From time to time I need to dump usb traffic under windows, mostly to support hardware under Linux, so my primary goal is to produce dump files for protocol analysis.
For USB traffic, it seems that [SniffUsb](http://www.pcausa.com/Utilities/UsbSnoop/default.htm) is the clear... | 0 | [
2,
184,
20,
15312,
182,
220,
1295,
131,
1936,
60,
800,
3726,
3726,
37,
85,
20,
85,
31,
376,
20,
11424,
182,
220,
2227,
131,
1936,
15,
1555,
20,
555,
7610,
131,
13024,
15,
86,
51,
1256,
1195,
25,
20,
2213,
11424,
6488,
26,
8494,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Name of the Python Module that Formats arbitrary Text to nicely looking HTML?
===
A while ago I came across a Python library that formats regular text to HTML similar to Markdown, reStructuredText and Textile, just that it had no syntax at all. It detected indentatations, quotes, links and newlines/paragra... | 0 | [
2,
98,
22,
18,
14,
204,
16,
14,
20059,
12613,
30,
13767,
17237,
1854,
20,
24050,
699,
13,
15895,
60,
800,
3726,
3726,
21,
133,
1464,
31,
281,
464,
21,
20059,
1248,
30,
13767,
1290,
1854,
20,
13,
15895,
835,
20,
943,
2968,
15,
30... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to update perl
===
At work I'm using perl 5.8.0 on Windows.
When I first put perl on, I went to CPAN, downloaded all the sources, made a few changes (in the .MAK file? to support threads, or things like that), and did nmake / nmake test / nmake install. Then, bit by bit, I've downloaded individual modules from ... | 0 | [
2,
184,
20,
11100,
416,
255,
800,
3726,
3726,
35,
170,
31,
22,
79,
568,
416,
255,
331,
9,
457,
9,
387,
27,
1936,
9,
76,
31,
64,
442,
416,
255,
27,
15,
31,
296,
20,
272,
3206,
15,
23887,
65,
14,
2662,
15,
117,
21,
310,
1693... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Versioning
===
Just a small SVN "problem" here.
I setup my own SVN server [http://www.codinghorror.com/blog/archives/001093.html][1]
Now I made a rep in which all my projects will go.
Now, I checked the rep out in a folder called "Projects".
Now If I make a project and check it in, that project is revi... | 0 | [
2,
13,
18,
16578,
615,
68,
800,
3726,
3726,
114,
21,
284,
13,
18,
16578,
13,
7,
2740,
2854,
79,
7,
235,
9,
31,
18161,
51,
258,
13,
18,
16578,
8128,
636,
21127,
6903,
6483,
9,
15458,
6778,
139,
248,
9,
960,
118,
220,
5567,
118,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I best create a SharePoint list view that shows only root folder contents?
===
I have a custom SharePoint list definition that is based on the Document content type. My library instance that I create from this contains many HTML documents, and each of those documents has some images saved into a subfolder ins... | 0 | [
2,
184,
92,
31,
246,
1600,
21,
1891,
3132,
968,
1418,
30,
1285,
104,
5900,
19294,
8478,
60,
800,
3726,
3726,
31,
57,
21,
5816,
1891,
3132,
968,
5465,
30,
25,
432,
27,
14,
4492,
2331,
1001,
9,
51,
1248,
4851,
30,
31,
1600,
37,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Naming Conventions / Layout
===
Does anyone have a good article or good advice for class naming for n-tier web applications? I'm used to the layout that LLBLGen gives when it generates objects based on a database structure, which might generate the following class files for a given "User" table in the database:... | 0 | [
2,
718,
10929,
15117,
13,
118,
9106,
800,
3726,
3726,
630,
1276,
57,
21,
254,
2002,
54,
254,
4978,
26,
718,
10929,
26,
13,
103,
8,
5259,
2741,
3767,
60,
31,
22,
79,
147,
20,
14,
9106,
30,
13,
211,
6287,
1863,
2352,
76,
32,
792... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 am I loosing data when using a vxWorks pipe?
===
I am using pipes to transfer information between two vxWorks tasks.
Here is an almost code sample:
<pre><code>
Init()
{
fd = open("/pipe/mydev", O_RDWR, 0777);
...
}
taskRx()
{
...
len = read(fd, rxbuf, MAX_RX_LEN);
...
}
taskTx()
{
... | 0 | [
2,
483,
589,
31,
13,
10165,
18,
68,
1054,
76,
568,
21,
566,
396,
7684,
7642,
60,
800,
3726,
3726,
31,
589,
568,
14104,
20,
2617,
676,
128,
81,
566,
396,
7684,
8674,
9,
235,
25,
40,
557,
1797,
5717,
45,
13,
1,
3515,
1,
9375,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Good alternative to GenuineChannels for .net remoting
===
We have been using GenuineChannels in our product for the last 4 years. GenuineChannels now appears to have become unsupported and the main developer guy Dmitri has I think joined Microsoft. I have the source as part of the product but not the networking / .net... | 0 | [
2,
254,
2676,
20,
10701,
10928,
18,
26,
13,
9,
2328,
302,
7662,
68,
800,
3726,
3726,
95,
57,
74,
568,
10701,
10928,
18,
19,
318,
2374,
26,
14,
236,
268,
122,
9,
10701,
10928,
18,
130,
1780,
20,
57,
533,
367,
24909,
17,
14,
407... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Create custom code snippet in Visual Studio 2008
===
Like the title says, how do you create custom code snippets in Visual Studio 2008? | 0 | [
2,
1600,
5816,
1797,
13,
29061,
19,
3458,
1120,
570,
800,
3726,
3726,
101,
14,
581,
898,
15,
184,
107,
42,
1600,
5816,
1797,
13,
29061,
18,
19,
3458,
1120,
570,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Joining other tables in oracle tree queries
===
Given a simple (id, description) table t1, such as
id description
-- -----------
1 Alice
2 Bob
3 Carol
4 David
5 Erica
6 Fred
And a parent-child relationship table t2, such as
parent child
------ --... | 0 | [
2,
3765,
89,
7484,
19,
15759,
1541,
9386,
2829,
800,
3726,
3726,
504,
21,
1935,
13,
5,
1340,
15,
5318,
6,
859,
13,
38,
165,
15,
145,
28,
4924,
5318,
13,
8,
8,
13,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
137,
4577,
172,
1909,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 use timezones with a datetime object in python?
===
How do I properly represent a different timezone in my timezone? The below example only works because I know that EDT is one hour ahead of me, so I can uncomment the subtraction of myTimeZone()
import datetime, re
from datetime import tzinfo
... | 0 | [
2,
184,
107,
31,
275,
85,
11661,
18,
29,
21,
1231,
891,
3095,
19,
20059,
60,
800,
3726,
3726,
184,
107,
31,
7428,
3501,
21,
421,
85,
11661,
19,
51,
85,
11661,
60,
14,
1021,
823,
104,
693,
185,
31,
143,
30,
13,
69,
38,
25,
53... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 clear the cache of Ruby Phusion Passenger in Ubuntu?
===
I've tried restarting apache and the cached pages still appear, so there must be a folder someplace. I don't have a /puglic/cache, so what other places should I look? Is there a URL flag that could trigger this effect as well? | 0 | [
2,
184,
107,
31,
1207,
14,
16522,
16,
10811,
18464,
5991,
3093,
19,
287,
12968,
2473,
60,
800,
3726,
3726,
31,
22,
195,
794,
22767,
68,
17140,
17,
14,
16522,
43,
4434,
174,
1893,
15,
86,
80,
491,
44,
21,
19294,
109,
5119,
9,
31,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
javascript: cancel all kinds of requests
===
My website makes a lot of requests. I often need to cancel all current requests, so that the browser is not blocking relevant new requests.
I have 3 kinds of requests:
- Ajax
- inserted script-tags (which do JSONP-Communication)
- inserted image-tags (which ca... | 0 | [
2,
8247,
8741,
45,
14815,
65,
8623,
16,
12279,
800,
3726,
3726,
51,
2271,
1364,
21,
865,
16,
12279,
9,
31,
478,
376,
20,
14815,
65,
866,
12279,
15,
86,
30,
14,
16495,
25,
52,
11828,
7480,
78,
12279,
9,
31,
57,
203,
8623,
16,
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... |
Inner join across multiple access db's
===
I am re-designing an application for a ASP.NET CMS that I really don't like. I have made som improvements in performance only to discover that not only does this CMS use MS SQL but some users "simply" use MS Access database.
The problem is that I have some tables which I i... | 0 | [
2,
3754,
1865,
464,
1886,
1381,
13,
9007,
22,
18,
800,
3726,
3726,
31,
589,
302,
8,
19862,
68,
40,
3010,
26,
21,
28,
306,
9,
2328,
2390,
18,
30,
31,
510,
221,
22,
38,
101,
9,
31,
57,
117,
86,
79,
7951,
19,
956,
104,
20,
62... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 approach for sortable table with a lot of data
===
On our web application, the search results are displayed in sortable tables. The user can click on any column and sort the result. The problem is some times, the user does a broad search and gets a lot of data returned. To make the sortable part work, you prob... | 0 | [
2,
246,
2141,
26,
2058,
579,
859,
29,
21,
865,
16,
1054,
800,
3726,
3726,
27,
318,
2741,
3010,
15,
14,
2122,
1736,
50,
6115,
19,
2058,
579,
7484,
9,
14,
4155,
92,
10840,
27,
186,
4698,
17,
2058,
14,
829,
9,
14,
1448,
25,
109,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Prefered way to make a JavaScript Object
===
There are two ways (that I know of) to create a JavaScript object. Which way do you prefer and why?
/* METHOD 1 */
function Foo() {
this.Bar = function() {
alert("FooBar");
}
}
/* METHOD 2 */
function Foo() {
... | 4 | [
2,
6369,
69,
161,
20,
233,
21,
8247,
8741,
3095,
800,
3726,
3726,
80,
50,
81,
2847,
13,
5,
887,
31,
143,
16,
6,
20,
1600,
21,
8247,
8741,
3095,
9,
56,
161,
107,
42,
6369,
17,
483,
60,
13,
118,
2483,
2109,
137,
1637,
118,
199... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
IIS CSS Caching
===
When we are developing new sites or testing changes in new ones that involve css after the new code is committed and someone goes to check the changes they always see a cached version of the old css. This is causing a lot of problems in testing because people never are sure if they have the latest ... | 0 | [
2,
595,
18,
272,
18,
18,
1658,
7192,
800,
3726,
3726,
76,
95,
50,
3561,
78,
3259,
54,
4431,
1693,
19,
78,
53,
18,
30,
8847,
272,
18,
18,
75,
14,
78,
1797,
25,
4164,
17,
737,
1852,
20,
2631,
14,
1693,
59,
550,
196,
21,
16522,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Services do under Windows?
===
Does anyone have a good guide to capabilities of Windows Services under XP? In particular, I am trying to find out what happens when a program being run as a service tries to open windows, but hasn't been given permission to interact with the desktop. Basically, I have a program... | 0 | [
2,
98,
92,
687,
107,
131,
1936,
60,
800,
3726,
3726,
630,
1276,
57,
21,
254,
3378,
20,
10209,
16,
1936,
687,
131,
23045,
60,
19,
1498,
15,
31,
589,
749,
20,
477,
70,
98,
5531,
76,
21,
625,
142,
485,
28,
21,
365,
3919,
20,
36... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Mercurial be integrated into VS2008?
===
Does anyone know of a tool to integrate Mercurial into Visual Studio?
Just curious. Mercurial is pretty nice, even with 'just' <a href="http://tortoisehg.sourceforge.net">TortoiseHG</a>, but integration with VS would be better. | 0 | [
2,
92,
9046,
3594,
192,
44,
5547,
77,
4611,
2753,
60,
800,
3726,
3726,
630,
1276,
143,
16,
21,
5607,
20,
18399,
9046,
3594,
192,
77,
3458,
1120,
60,
114,
7686,
9,
9046,
3594,
192,
25,
1772,
2210,
15,
166,
29,
13,
22,
2759,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Planning the flow of a program
===
I am already aware of UML but I want to look at all the options before I pick. Essentially I will need to have a way (preferably visual) to plan out the flow and actions of programs. They will all be web applications written in PHP or Python.
What (preferably free) ways are there ... | 0 | [
2,
2334,
14,
3312,
16,
21,
625,
800,
3726,
3726,
31,
589,
614,
3854,
16,
13,
723,
255,
47,
31,
259,
20,
361,
35,
65,
14,
6368,
115,
31,
2036,
9,
7398,
31,
129,
376,
20,
57,
21,
161,
13,
5,
3515,
2407,
4801,
3458,
6,
20,
94... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Delegates as parameters in VB.NET
===
Backstory: I'm using [log4net](http://logging.apache.org/log4net/index.html) to handle all logging for a project I'm working on. One particular method can be called under several different circumstances -- some that warrant the log messages to be errors and others that warrant th... | 0 | [
2,
10845,
28,
12905,
19,
13,
20468,
9,
2328,
800,
3726,
3726,
97,
4416,
45,
31,
22,
79,
568,
636,
5567,
300,
2328,
500,
5,
21127,
6903,
13919,
9,
7738,
2569,
9,
5583,
118,
5567,
300,
2328,
118,
25671,
9,
15895,
6,
20,
3053,
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... |
Install tool to create virtual directory on IIS
===
What install tool can I use to create Virtual Directory on IIS? OpenSource, free or to do in C#. | 0 | [
2,
16146,
5607,
20,
1600,
6599,
16755,
27,
595,
18,
800,
3726,
3726,
98,
16146,
5607,
92,
31,
275,
20,
1600,
6599,
16755,
27,
595,
18,
60,
368,
12097,
15,
551,
54,
20,
107,
19,
272,
5910,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Book recommendations to update from VS2003 to VS2005/2008
===
I'm stuck in the world of VS2005 and .net framework 1.1. I'm only really interested in Winforms so never felt the need to move on. I am however now interested in seeing what is available now (latest .net framework and VS) and what has changed. Any good book... | 0 | [
2,
360,
12121,
20,
11100,
37,
4611,
3325,
20,
4611,
2835,
118,
2753,
800,
3726,
3726,
31,
22,
79,
4549,
19,
14,
126,
16,
4611,
2835,
17,
13,
9,
2328,
6596,
137,
9,
165,
9,
31,
22,
79,
104,
510,
3158,
19,
628,
4190,
18,
86,
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... |
[C#/.NET] How can I create my custom Shell Context Handlers for Windows?
===
Problem
-------
Language: C# 2.0 or later
----------
I would like to register context handlers to create menues when the user right clicks certain files (in my case *.eic). What is the procedure to register, unregister (clean up) and ... | 0 | [
2,
636,
150,
5910,
118,
9,
2328,
500,
184,
92,
31,
1600,
51,
5816,
3593,
4141,
24641,
18,
26,
1936,
60,
800,
3726,
3726,
1448,
13,
8,
8,
8,
8,
8,
8,
8,
816,
45,
272,
5910,
172,
9,
387,
54,
138,
13,
8,
8,
8,
8,
8,
8,
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... |
jquery: fastest DOM insertion ?
===
I got this bad feeling about how I insert larger amounts of HTML.
Lets assume we got:
`var html="<table>..<a-lot-of-other-tags />..</table>"`
and I want to put this into
`$("#mydiv")`
previously I did something like
`var html_obj = $(html);`
`$("#mydiv").append(html... | 0 | [
2,
487,
8190,
93,
45,
7518,
11859,
24245,
13,
60,
800,
3726,
3726,
31,
330,
48,
896,
1249,
88,
184,
31,
14692,
1662,
8545,
16,
13,
15895,
9,
6884,
7158,
95,
330,
45,
13,
1,
3311,
13,
15895,
3726,
7,
1,
5924,
1,
9,
9,
1,
58,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Hyperlinking an image using CSS
===
I know this is probably the dumbest question ever, however I am a total beginner when it comes to CSS; how do you hyperlink an image on a webpage using an image which is sourced from CSS? I am trying to set the title image on my website linkable to the frontpage. Thanks!
**Edit:*... | 0 | [
2,
5443,
6258,
68,
40,
1961,
568,
272,
18,
18,
800,
3726,
3726,
31,
143,
48,
25,
910,
14,
9317,
1430,
1301,
462,
15,
207,
31,
589,
21,
600,
26931,
76,
32,
1624,
20,
272,
18,
18,
73,
184,
107,
42,
5443,
6258,
40,
1961,
27,
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... |
Wait until any of Future<T> is done or .wait() on few objects
===
I have few asynchronous tasks running and I need to wait until at least one of them is finished (in the future probably I'll need to wait util M out of N tasks are finished).
Currently they are presented as Future<T>, so I need something like
/*... | 0 | [
2,
1760,
163,
186,
16,
1022,
1,
38,
1,
25,
677,
54,
13,
9,
8195,
5,
6,
27,
310,
3916,
800,
3726,
3726,
31,
57,
310,
21,
16023,
1291,
8674,
946,
17,
31,
376,
20,
1760,
163,
35,
639,
53,
16,
105,
25,
842,
13,
5,
108,
14,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How would you display an array of integers as a set of ranges? (algorithm)
===
Given an array of integers, what is the simplest way to iterate over it and figure out all the ranges it covers? for example, for an array such as:
$numbers = array(1,3,4,5,6,8,11,12,14,15,16);
The ranges would be:
1,... | 0 | [
2,
184,
83,
42,
3042,
40,
7718,
16,
13820,
18,
28,
21,
309,
16,
9230,
60,
13,
5,
192,
6979,
242,
7015,
6,
800,
3726,
3726,
504,
40,
7718,
16,
13820,
18,
15,
98,
25,
14,
24384,
161,
20,
32,
106,
1373,
84,
32,
17,
1465,
70,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Any way to use Help.ShowHelp in Windows CE Core license build?
===
I am developing a Compact Framework 3.5 application for Windows CE 6.0. Help.ShowHelp() throws a NotSupportedException. At windowsembedded.com I found this statement:
"Help is not included in the Core run-time because it requires a browser."
Is... | 0 | [
2,
186,
161,
20,
275,
448,
9,
9303,
14593,
19,
1936,
4000,
2884,
3962,
1895,
60,
800,
3726,
3726,
31,
589,
3561,
21,
8285,
6596,
203,
9,
264,
3010,
26,
1936,
4000,
400,
9,
387,
9,
448,
9,
9303,
14593,
5,
6,
13566,
21,
52,
2490... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
nonvirtual interface idiom for more than two levels of inheritance?
===
The non-virtual interface idiom describes how the virtual methods are nonpublic customisation points, and public methods are nonvirtual to allow the base class to control at all times how the customisation points are called.
This is an elegant... | 0 | [
2,
538,
8145,
38,
6948,
6573,
28380,
26,
91,
119,
81,
2216,
16,
13852,
60,
800,
3726,
3726,
14,
538,
8,
8145,
38,
6948,
6573,
28380,
4359,
184,
14,
6599,
3195,
50,
538,
12259,
5816,
4330,
819,
15,
17,
317,
3195,
50,
538,
8145,
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... |
Considerations for a New Web Application
===
No matter what type of web application you are building, there is usually a generic template of features/modules that <b>always</b> need to be included.
Note: These are <b>high level</b> modules, the details will vary per implementation.
Here is my list, care to add t... | 0 | [
2,
20478,
26,
21,
78,
2741,
3010,
800,
3726,
3726,
90,
1161,
98,
1001,
16,
2741,
3010,
42,
50,
353,
15,
80,
25,
951,
21,
12733,
22894,
16,
967,
118,
19673,
160,
30,
13,
1,
220,
1,
21284,
1,
118,
220,
1,
376,
20,
44,
506,
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... |
Spring JTA TransactionManager config: Supporting both Tomcat and JBoss
===
I have a web application using JPA and JTA with Spring. I would like to support both JBoss and Tomcat. When running on JBoss, I'd like to use JBoss' own TransactionManager, and when running on Tomcat, I'd like to use JOTM.
I have both scenar... | 0 | [
2,
1573,
487,
536,
12799,
22256,
13,
14093,
2816,
45,
3134,
156,
2067,
5782,
17,
487,
10349,
18,
800,
3726,
3726,
31,
57,
21,
2741,
3010,
568,
487,
1060,
17,
487,
536,
29,
1573,
9,
31,
83,
101,
20,
555,
156,
487,
10349,
18,
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... |
Can you recommend a Windows based Network emulator?
===
I'm looking for a Windows network emulator that can emulate the packet-loss & latency characteristics of a 3G wireless network.
I used to use a tool from GIPs that has been end-of-life'd. I've also tried Shunra Virtual Enterprise but found it a bit too basic | 0 | [
2,
92,
42,
12360,
21,
1936,
432,
982,
3579,
14868,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
1936,
982,
3579,
14868,
30,
92,
23804,
14,
12795,
8,
4341,
18,
279,
456,
14386,
5626,
16,
21,
203,
263,
10149,
982,
9,
31,
147,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a faster way of getting a char* from a _variant_t than (const char*)(_bstr_t)
===
Here's the code I want to speed up. It's getting a value from an ADO recordset and converting it to a char*. But this is slow. Can I skip the creation of the _bstr_t?
_variant_t var = pRs->Fields->G... | 0 | [
2,
25,
80,
21,
4233,
161,
16,
1017,
21,
4892,
2483,
37,
21,
13,
1,
18445,
1,
38,
119,
13,
5,
12124,
38,
4892,
2483,
6,
5,
1,
220,
9729,
1,
38,
6,
800,
3726,
3726,
235,
22,
18,
14,
1797,
31,
259,
20,
1362,
71,
9,
32,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which browsers support page break manipulation using CSS and the page-break-inside element?
===
I'm trying to use the page-break-inside CSS directive, the class of which is to be attached to a div tag or a table tag (I think this may only work on block elements, in which case it would have to be the table).
I've tr... | 0 | [
2,
56,
16495,
18,
555,
2478,
1442,
17561,
568,
272,
18,
18,
17,
14,
2478,
8,
12008,
8,
108,
1416,
4520,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
275,
14,
2478,
8,
12008,
8,
108,
1416,
272,
18,
18,
15626,
15,
14,
718,
16,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Decipher database schema
===
I've recently inherited the job of maintaining a database that wasn't designed very well and the designers aren't available to ask any questions. And I have a couple more coming my way in the near future.
It's been tough trying to figure out the relationships between the tables without... | 0 | [
2,
25277,
6018,
23874,
800,
3726,
3726,
31,
22,
195,
1989,
7179,
14,
1205,
16,
8215,
21,
6018,
30,
526,
22,
38,
1006,
253,
134,
17,
14,
12760,
4847,
22,
38,
904,
20,
1349,
186,
2346,
9,
17,
31,
57,
21,
1335,
91,
880,
51,
161,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Loading an existing database into WWW SQL Designer?
===
I've used [WWW SQL Designer][1] several times to design databases for applications. I'm now in charge of working on an application with a lot of tables (100+ mysql tables) and I would love to be able to look at the relations between tables in a manner similar to ... | 0 | [
2,
12797,
40,
3149,
6018,
77,
13,
6483,
4444,
255,
4742,
60,
800,
3726,
3726,
31,
22,
195,
147,
636,
6483,
4444,
255,
4742,
500,
2558,
165,
500,
238,
436,
20,
704,
6018,
18,
26,
3767,
9,
31,
22,
79,
130,
19,
1906,
16,
638,
27,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best method for storing this pointer for use in WndProc
===
I'm interested to know the best / common way of storing a this pointer for use in the WndProc. I know of several approaches, but each as I understand it have their own drawbacks. My questions are:
What different ways are there of producing this kind of cod... | 0 | [
2,
246,
2109,
26,
25615,
48,
454,
106,
26,
275,
19,
619,
706,
15617,
800,
3726,
3726,
31,
22,
79,
3158,
20,
143,
14,
246,
13,
118,
757,
161,
16,
25615,
21,
48,
454,
106,
26,
275,
19,
14,
619,
706,
15617,
9,
31,
143,
16,
238,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Django AutoFields to start at a higher number
===
For our Django App, we'd like to get an AutoField to start at a number other than 1. There doesn't seem to be an obvious way to do this. Any ideas?
| 0 | [
2,
184,
20,
164,
3857,
14541,
3108,
1109,
18,
20,
799,
35,
21,
1184,
234,
800,
3726,
3726,
26,
318,
3857,
14541,
4865,
15,
95,
22,
43,
101,
20,
164,
40,
3108,
1109,
20,
799,
35,
21,
234,
89,
119,
137,
9,
80,
1437,
22,
38,
22... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... |
Upload files directly to Amazon S3 from ASP.NET application
===
My ASP.NET MVC application will take a lot of bandwidth and storage space. How can I setup an ASP.NET upload page so the file the user uploaded will go straight to Amazon S3 without using my web server's storage and bandwidth? | 0 | [
2,
71,
8294,
6488,
1703,
20,
8059,
13,
18,
240,
37,
28,
306,
9,
2328,
3010,
800,
3726,
3726,
51,
28,
306,
9,
2328,
307,
8990,
3010,
129,
247,
21,
865,
16,
23392,
17,
4326,
726,
9,
184,
92,
31,
18161,
40,
28,
306,
9,
2328,
71... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Alternate FizzBuzz Questions
===
Anybody have any good FizzBuzz type questions that are not *the* FizzBuzz problem?
I am interviewing someone and FB is relatively well known and not that hard to memorize, so my first stop in a search for ideas is my new addiction SO. | 4 | [
2,
4912,
398,
17470,
2345,
5092,
2346,
800,
3726,
3726,
11181,
57,
186,
254,
398,
17470,
2345,
5092,
1001,
2346,
30,
50,
52,
1637,
124,
2483,
398,
17470,
2345,
5092,
1448,
60,
31,
589,
2421,
68,
737,
17,
13,
13478,
25,
3109,
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... |
Converting string of 1's and 0's into binary value
===
I'm trying to convert an incoming sting of 1's and 0's from stdin into their respective binary values (where a string such as "11110111" would be converted to 0xF7). This seems pretty trivial but I don't want to reinvent the wheel so I'm wondering if there's anyth... | 0 | [
2,
19583,
3724,
16,
137,
22,
18,
17,
713,
22,
18,
77,
14171,
1923,
800,
3726,
3726,
31,
22,
79,
749,
20,
8406,
40,
17126,
8210,
16,
137,
22,
18,
17,
713,
22,
18,
37,
354,
3653,
77,
66,
7390,
14171,
4070,
13,
5,
2798,
21,
372... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 determine the current focused process name and version in C#
===
For example if I'm working on Visual Studio 2008, I want the values devenv and 2008 or 9.
The version number is very important... | 0 | [
2,
184,
92,
31,
3746,
14,
866,
2604,
953,
204,
17,
615,
19,
272,
5910,
800,
3726,
3726,
26,
823,
100,
31,
22,
79,
638,
27,
3458,
1120,
570,
15,
31,
259,
14,
4070,
121,
3124,
710,
17,
570,
54,
561,
9,
14,
615,
234,
25,
253,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
You have impaired physical mobility. How do you program and surf the Internet?
===
I'm curious what assistive technologies tech-savvy SO users recommend. What tools do you use to facilitate text entry and web navigation? I'm especially interested in solutions that don't require voice-commands, since programming req... | 0 | [
2,
42,
57,
22311,
1825,
14806,
9,
184,
107,
42,
625,
17,
12187,
14,
2620,
60,
800,
3726,
3726,
31,
22,
79,
7686,
98,
5404,
1284,
5740,
6145,
8,
18,
5214,
5903,
86,
3878,
12360,
9,
98,
4672,
107,
42,
275,
20,
9681,
1854,
2792,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Testing your code for speed?
===
I'm a total newbie, but I was writing a little program that worked on strings in C# and I noticed that if I did a few things differently, the code executed significantly faster.
So it had me wondering, how do you go about clocking your code's execution speed? Are there any utilities... | 0 | [
2,
4431,
154,
1797,
26,
1362,
60,
800,
3726,
3726,
31,
22,
79,
21,
600,
78,
5893,
15,
47,
31,
23,
1174,
21,
265,
625,
30,
577,
27,
7887,
19,
272,
5910,
17,
31,
2711,
30,
100,
31,
144,
21,
310,
564,
12670,
15,
14,
1797,
5557,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 ideas from other professions have you applied to software development?
===
The software development community is always open to new ideas to improve the way we develop software, and it seems to me that we innovate more than other engineering disciplines or professions.
However, it seems that it would be unfo... | 0 | [
2,
98,
3478,
37,
89,
7762,
18,
57,
42,
2435,
20,
2306,
522,
60,
800,
3726,
3726,
14,
2306,
522,
514,
25,
550,
368,
20,
78,
3478,
20,
3545,
14,
161,
95,
2803,
2306,
15,
17,
32,
2206,
20,
55,
30,
95,
19,
13413,
591,
91,
119,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 unload a externally loaded SWF file from a SWFLoader component in Adobe Flex?
===
I have an application that loads external SWF files and plays them inside a Adobe Flex / Air application. I have been trying to find a way to unload them from a button click event. I have Google'd far and wide and no one seems t... | 0 | [
2,
184,
107,
31,
367,
8294,
21,
4886,
102,
8572,
13,
18,
15263,
3893,
37,
21,
13,
18,
15263,
8294,
106,
5912,
19,
20299,
14409,
60,
800,
3726,
3726,
31,
57,
40,
3010,
30,
19069,
4886,
13,
18,
15263,
6488,
17,
1533,
105,
572,
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... |
Security settings for Office 2007 files stored on a website.
===
I have a website where people can upload documents, and view later at their convenience. I store the binary info along with the mime type in my db, and later just stream the binary content straight to the browser.
This works for just about every file ... | 0 | [
2,
1221,
12410,
26,
488,
624,
6488,
8214,
27,
21,
2271,
9,
800,
3726,
3726,
31,
57,
21,
2271,
113,
148,
92,
71,
8294,
4374,
15,
17,
1418,
138,
35,
66,
16517,
9,
31,
1718,
14,
14171,
15404,
303,
29,
14,
26193,
1001,
19,
51,
13,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to version control the build tools and libraries?
===
What are the recommendations for including your compiler, libraries, and other tools in your source control system itself?
In the past, I've run into issues where, although we had all the source code, building an old version of the product was an exercise in... | 0 | [
2,
184,
20,
615,
569,
14,
1895,
4672,
17,
8649,
60,
800,
3726,
3726,
98,
50,
14,
12121,
26,
215,
154,
21486,
15,
8649,
15,
17,
89,
4672,
19,
154,
1267,
569,
329,
1145,
60,
19,
14,
640,
15,
31,
22,
195,
485,
77,
1549,
113,
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... |
apache mod_rewrite one rule for any number of possibilities
===
I'm building a fairly large website and my .htaccess is starting to feel a bit bloated, is there a way of replacing my current system of - one rule for each of the possibile number of vars that could be passed, to one catch all expression that can account... | 0 | [
2,
17140,
7226,
1,
99,
23716,
53,
1828,
26,
186,
234,
16,
13086,
800,
3726,
3726,
31,
22,
79,
353,
21,
6647,
370,
2271,
17,
51,
13,
9,
9020,
20604,
25,
1422,
20,
583,
21,
1142,
13,
7091,
1669,
15,
25,
80,
21,
161,
16,
5496,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best practice for translating exceptions in C++/CLI wrapper class
===
I am writing a .NET wrapper class for an existing native class which throws exceptions. What are the best practices for translating between native C++ exceptions and Managed exceptions? Catch and re-throw on a one-to-one basis (e.g. std::invalid_arg... | 0 | [
2,
246,
1345,
26,
25237,
13392,
19,
272,
20512,
118,
150,
1210,
28051,
718,
800,
3726,
3726,
31,
589,
1174,
21,
13,
9,
2328,
28051,
718,
26,
40,
3149,
1275,
718,
56,
13566,
13392,
9,
98,
50,
14,
246,
5242,
26,
25237,
128,
1275,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Could Affect Values Returned By Serialport.Read()
===
I've written a simple app in C# 2.0 using the .Net Framework 2.0 Serialport class to communicate with a controller card via COM1.
A problem occurred recently were the bytes returned by the Read method are incorrect. It returned the right amount of bytes, o... | 0 | [
2,
98,
110,
6245,
4070,
587,
34,
5956,
1993,
9,
10647,
5,
6,
800,
3726,
3726,
31,
22,
195,
642,
21,
1935,
4865,
19,
272,
5910,
172,
9,
387,
568,
14,
13,
9,
2328,
6596,
172,
9,
387,
5956,
1993,
718,
20,
8709,
29,
21,
9919,
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... |
Transact-SQL - sub query or left-join?
===
I have two tables containing Tasks and Notes, and want to retrieve a list of tasks with the number of associated notes for each one. These two queries do the job:
<pre>select t.TaskId,
(select count(n.TaskNoteId) from TaskNote n where n.TaskId = t.TaskId) 'Notes'
... | 0 | [
2,
2982,
5183,
8,
18,
22402,
13,
8,
972,
25597,
54,
225,
8,
1636,
108,
60,
800,
3726,
3726,
31,
57,
81,
7484,
3503,
8674,
17,
2434,
15,
17,
259,
20,
11917,
21,
968,
16,
8674,
29,
14,
234,
16,
1598,
2434,
26,
206,
53,
9,
158,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SOAP or REST based Geotargetting service?
===
Is anyone aware of a (preferablly free) webservice that would accept a SOAP or REST request.
This request would contain an IP address, and the service would return an approximation of that IP's location.
| 0 | [
2,
6447,
54,
760,
432,
6389,
3958,
27380,
365,
60,
800,
3726,
3726,
25,
1276,
3854,
16,
21,
13,
5,
3515,
2407,
58,
6287,
102,
551,
6,
2741,
11449,
30,
83,
3440,
21,
6447,
54,
760,
3772,
9,
48,
3772,
83,
3717,
40,
15735,
3218,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to refactor in a branch without losing your mind?
===
I refactor my and other people's code **all the lot**.
When I work in a branch and not in Trunk, this sometimes results in some extremely painful merges, especially if I don't merge back to Trunk regularly (the code at the branch slowly shifts away from the Tr... | 0 | [
2,
184,
20,
302,
17455,
19,
21,
1686,
366,
2281,
154,
594,
60,
800,
3726,
3726,
31,
302,
17455,
51,
17,
89,
148,
22,
18,
1797,
13,
1409,
1233,
14,
865,
1409,
9,
76,
31,
170,
19,
21,
1686,
17,
52,
19,
6436,
15,
48,
1030,
1736... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
simplest/efficient way to find rows with time-interval overlaps in sql
===
i have two tables, both with start time and end time fields. i need to find, for each row in the first table, all of the rows in the second table where the time intervals intersect
for example:
<-----row 1 interval------->
... | 0 | [
2,
24384,
118,
23702,
161,
20,
477,
11295,
29,
85,
8,
6280,
3377,
15406,
18,
19,
4444,
255,
800,
3726,
3726,
31,
57,
81,
7484,
15,
156,
29,
799,
85,
17,
241,
85,
2861,
9,
31,
376,
20,
477,
15,
26,
206,
3131,
19,
14,
64,
859,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 connect online with other PDC attendees with similar interests before the conference so we can plan to get together
===
I would think that in this age of social software that it would be easier to network socially around a software conference. Here's the particular problem I'm trying to solve: In past PDCs I'... | 0 | [
2,
184,
107,
31,
6379,
2087,
29,
89,
351,
7201,
22816,
29,
835,
4408,
115,
14,
1199,
86,
95,
92,
944,
20,
164,
429,
800,
3726,
3726,
31,
83,
277,
30,
19,
48,
348,
16,
668,
2306,
30,
32,
83,
44,
4950,
20,
982,
16482,
140,
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 practices for withstanding launch day traffic burst
===
We are working on a website for a client that (for once) is expected to get a fair amount of traffic on day one. There are press releases, people are blogging about it, etc. I am a little concerned that we're going to fall flat on our face on day one. What a... | 0 | [
2,
246,
5242,
26,
29,
10465,
3394,
208,
2227,
4704,
800,
3726,
3726,
95,
50,
638,
27,
21,
2271,
26,
21,
6819,
30,
13,
5,
1106,
382,
6,
25,
1727,
20,
164,
21,
1768,
2006,
16,
2227,
27,
208,
53,
9,
80,
50,
901,
7073,
15,
148,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.