unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
How to mock object construction?
===
Is there a way to mock object construction using JMock in Java?
For example, if I have a method as such:
<pre>
public Object createObject(String objectType) {
if(objectType.equals("Integer") {
return new Integer();
} else if (objectType.equals("String") {
return new String();
}
}
</pre>
...is there a way to mock out the expectation of the object construction in a test method?
I'd like to be able to place expectations that certain constructors are being called, rather than having an extra bit of code to check the type (as it won't always be as convoluted and simple as my example).
So instead of:
<pre>
assertTrue(a.createObject() instanceof Integer);
</pre>
I could have an expectation of the certain constructor being called. Just to make it a bit cleaner, and express what is actually being tested in a more readable way.
Please excuse the simple example, the actual problem I'm working on is a bit more complicated, but having the expectation would simplify it. | 0 | [
2,
184,
20,
10506,
3095,
900,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
10506,
3095,
900,
568,
487,
79,
5668,
19,
8247,
60,
26,
823,
15,
100,
31,
57,
21,
2109,
28,
145,
45,
13,
1,
3515,
1,
317,
3095,
1600,
23793,
5,
11130,
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... |
Text message receiving API - UK and USA
===
Looking for a cheap way of receiving text messages by HTTP POST or other easy way. I want it to be standard rate dedicated number (no keyword).
I've looked at http://totext.net/ and it looks good for a UK number. Any other recommendations?
Also, any recommendations for a US number? | 0 | [
2,
1854,
2802,
3396,
21,
2159,
13,
8,
1063,
17,
2563,
800,
3726,
3726,
699,
26,
21,
9148,
161,
16,
3396,
1854,
7561,
34,
7775,
678,
54,
89,
2010,
161,
9,
31,
259,
32,
20,
44,
1236,
1684,
2360,
234,
13,
5,
251,
1246,
9587,
6,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do i hotkey directly to File Search tab in eclipse
===
When i use ctrl+h I end on the Java Search tab. I would very much like a shortcut to go directly to filesearch instead. Is that possible? | 0 | [
2,
184,
107,
31,
1047,
4237,
1703,
20,
3893,
2122,
6523,
19,
11652,
800,
3726,
3726,
76,
31,
275,
13,
4812,
6362,
2430,
252,
31,
241,
27,
14,
8247,
2122,
6523,
9,
31,
83,
253,
212,
101,
21,
502,
4118,
20,
162,
1703,
20,
3893,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
LINQ to SQL: How to write a 'Like' select?
===
I've got the following SQL:
select * from transaction_log where stoptime like '%2008%'
How do I write this in LINQ to SQL syntax? | 0 | [
2,
6294,
1251,
20,
4444,
255,
45,
184,
20,
2757,
21,
13,
22,
1403,
22,
5407,
60,
800,
3726,
3726,
31,
22,
195,
330,
14,
249,
4444,
255,
45,
5407,
1637,
37,
12799,
1,
5567,
113,
747,
891,
101,
13,
22,
11881,
4621,
2768,
22,
184... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0... |
relational operator expression order
===
This is probably a silly question, but curiosity has gotten the better of me. I've been seeing code lately that seems to "reverse" the order of expressions for relational operators e.g.:
if (0 == someVariable)
As opposed to what I normally see/write:
if (someVariable == 0)
To me, the second method seems more readable and intuitive, so I'm wondering if there's some reason I'm seeing the first method? Logically, both statements evaluate to the same result, so is it just a matter of personal preference how they're written? | 0 | [
2,
5827,
192,
6022,
1803,
389,
800,
3726,
3726,
48,
25,
910,
21,
10752,
1301,
15,
47,
11581,
63,
4094,
14,
574,
16,
55,
9,
31,
22,
195,
74,
2078,
1797,
10434,
30,
2206,
20,
13,
7,
99,
9453,
7,
14,
389,
16,
13832,
26,
5827,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's this obsession with pointers?
===
Having only really used modern, object oriented languages like ActionScript, Java and C#, I don't really understand the importance of pointers and what you use them for. What am I missing out on here? | 0 | [
2,
98,
22,
18,
48,
19548,
29,
454,
445,
60,
800,
3726,
3726,
452,
104,
510,
147,
773,
15,
3095,
13,
6800,
2556,
101,
1028,
8741,
15,
8247,
17,
272,
5910,
15,
31,
221,
22,
38,
510,
1369,
14,
3728,
16,
454,
445,
17,
98,
42,
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,
0,
0,
0,
0,
0... |
Programmatically Make Bound Column Invisible
===
I'm trying to make a data bound column invisible after data binding, because it won't exist before data binding. However, the DataGrid.Columns collection indicates a count of 0, making it seem as if the automatically generated columns don't belong to the collection.
How can I make a column that is automatically generated during binding invisible? | 0 | [
2,
625,
6732,
1326,
233,
4138,
4698,
8874,
800,
3726,
3726,
31,
22,
79,
749,
20,
233,
21,
1054,
4138,
4698,
8874,
75,
1054,
8728,
15,
185,
32,
230,
22,
38,
3182,
115,
1054,
8728,
9,
207,
15,
14,
1054,
16375,
9,
716,
4404,
2172,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 determine if a random string sounds like English?
===
I have an algorithm that generates strings based on a list of input words. How do I separate only the strings that sounds like English words? ie. discard **RDLO** while keeping **LORD**.
| 0 | [
2,
184,
107,
31,
3746,
100,
21,
5477,
3724,
2795,
101,
486,
60,
800,
3726,
3726,
31,
57,
40,
9083,
30,
7920,
18,
7887,
432,
27,
21,
968,
16,
6367,
715,
9,
184,
107,
31,
1725,
104,
14,
7887,
30,
2795,
101,
486,
715,
60,
13,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0... |
Programmatically setting the record pointer in a C# DataGridView
===
How do I programmatically set the record pointer in a C# DataGridView?
I've tried "DataGridView.Rows[DesiredRowIndex].Selected=true;", and that does not work. All it does is highlight that row within the grid; it doesn not move the record pointer to that row. | 0 | [
2,
625,
6732,
1326,
2697,
14,
571,
454,
106,
19,
21,
272,
5910,
1054,
16375,
4725,
800,
3726,
3726,
184,
107,
31,
625,
6732,
1326,
309,
14,
571,
454,
106,
19,
21,
272,
5910,
1054,
16375,
4725,
60,
31,
22,
195,
794,
13,
7,
18768,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 display only one validation error message with a <tr:panelLabelAndMessage> with MyFaces Trinidad?
===
For a registration form I have something simple like:
<tr:panelLabelAndMessage
label="Zip/City"
showRequired="true">
<tr:inputText
id="zip"
value="#{data['registration'].zipCode}"
contentStyle="width:36px"
simple="true"
required="true" />
<tr:inputText
id="city"
value="#{data['registration'].city}"
contentStyle="width:133px"
simple="true"
required="true" />
</tr:panelLabelAndMessage>
<tr:message for="zip" />
<tr:message for="city" />
When including the last two lines, I get two messages on validation error. When ommiting last to lines, a javascript alert shows up, which is not what I want.
Is there a solution to show only one validation failed message somehow?
Thanks a lot! | 0 | [
2,
184,
20,
3042,
104,
53,
27999,
7019,
2802,
29,
21,
13,
1,
6384,
45,
3206,
2120,
863,
618,
3845,
18,
1303,
1,
29,
51,
6413,
18,
12517,
60,
800,
3726,
3726,
26,
21,
8587,
505,
31,
57,
301,
1935,
101,
45,
13,
1,
6384,
45,
32... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.NET UML generation from code?
===
Is there anything out there that for .NET that can generate UML diagrams from code. Preferably an addin for Visual Studio. Starting work on a mature project that has little architectural documentation can be painful at first. Eventually you get the ins and outs of the code but helping to see how the code all fits together from the get go would be wonderful. | 0 | [
2,
13,
9,
2328,
13,
723,
255,
2782,
37,
1797,
60,
800,
3726,
3726,
25,
80,
602,
70,
80,
30,
26,
13,
9,
2328,
30,
92,
7920,
13,
723,
255,
14161,
18,
37,
1797,
9,
6369,
4801,
40,
3547,
108,
26,
3458,
1120,
9,
1422,
170,
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... |
Set selected item on a DataGridViewComboboxColumn
===
I have a datagridview with a DataGridViewComboboxColumn column with 3 values:
"Small", "Medium", "Large"
I get back the users default which in this case is "Medium"
I want to show a dropdown cell in the datagridview but default the value to "Medium". i would do this in a regular combobox by doing selected index or just stting the Text property of a combo box.
| 0 | [
2,
309,
1704,
9101,
27,
21,
1054,
16375,
4725,
960,
1192,
5309,
716,
4404,
103,
800,
3726,
3726,
31,
57,
21,
1054,
16375,
4725,
29,
21,
1054,
16375,
4725,
960,
1192,
5309,
716,
4404,
103,
4698,
29,
203,
4070,
45,
13,
7,
15988,
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... |
Is there a simple tool to convert mysql to postgresql syntax?
===
I've tried the tools listed [here][1], some with more success than others, but none gave me valid postgres syntax I could use (tinyint errors etc.)
[1]: http://wiki.postgresql.org/wiki/Converting_from_other_Databases_to_PostgreSQL | 0 | [
2,
25,
80,
21,
1935,
5607,
20,
8406,
51,
18,
22402,
20,
678,
6879,
18,
22402,
22649,
60,
800,
3726,
3726,
31,
22,
195,
794,
14,
4672,
1510,
636,
6836,
500,
2558,
165,
500,
15,
109,
29,
91,
1280,
119,
654,
15,
47,
2369,
492,
55... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
session variable mixup in ASP.NET?
===
Is it possible for ASP.NET to mix up which user is associated with which session variable on the server? Are session variables immutably tied to the original user that created them across time, space & dimension? | 0 | [
2,
3723,
7612,
2917,
576,
19,
28,
306,
9,
2328,
60,
800,
3726,
3726,
25,
32,
938,
26,
28,
306,
9,
2328,
20,
2917,
71,
56,
4155,
25,
1598,
29,
56,
3723,
7612,
27,
14,
8128,
60,
50,
3723,
12157,
797,
7903,
4801,
3802,
20,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0... |
GUI Testing
===
I'm working on the issue of testing my GUI and I'm not entirely sure of the best approach here. My GUI is built using a traditional MVC framework so I am easily able to test the logic parts of the GUI without bringing up the GUI itself. However, when it comes to testing the functionality of the GUI, I'm not really sure if I should worry about individually testing GUI components or if I should mainly just focus on functional testing the system. It's a pretty complex system in which testing the GUI frequently involves sending a message to the server and then observing the response on the GUI. My initial thoughts are that functional testing is the way to go here since I need a whole system running to really test the UI. Comments on this issue would be appreciated.
Thanks,
Jeff | 0 | [
2,
9457,
4431,
800,
3726,
3726,
31,
22,
79,
638,
27,
14,
1513,
16,
4431,
51,
9457,
17,
31,
22,
79,
52,
2894,
562,
16,
14,
246,
2141,
235,
9,
51,
9457,
25,
392,
568,
21,
1361,
307,
8990,
6596,
86,
31,
589,
2351,
777,
20,
1289... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Smallest Unicode encodings for different languages?
===
What are the typical average bytes-per-character rates for different unicode encodings in different languages?
E.g. if I wanted the smallest number of bytes to encode some english text, then on average UTF-8 would be 1-byte per character and UTF-16 would be 2 so I'd pick UTF-8.
If I wanted some Korean text, then UTF-16 might average about 2 per character but UTF-8 might average about 3 (I don't know, I'm just making up some illustrative numbers here).
Which encodings yield the smallest storage requirements for different languages and character sets? | 0 | [
2,
11056,
28010,
19608,
18,
26,
421,
2556,
60,
800,
3726,
3726,
98,
50,
14,
3874,
862,
34,
3231,
8,
1432,
8,
24589,
5332,
26,
421,
28010,
19608,
18,
19,
421,
2556,
60,
13,
62,
9,
263,
9,
100,
31,
417,
14,
11056,
234,
16,
34,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to use node-set function in a platform-independent way?
===
I'm writing some xlst file which I want to use under linux and Windows.
In this file I use node-set function which declared in different namespaces for MSXML and xsltproc ("urn:schemas-microsoft-com:xslt" and "http://exslt.org/common" respectively). Is there any platform independent way of using node-set?
| 0 | [
2,
184,
20,
275,
15421,
8,
3554,
1990,
19,
21,
2452,
8,
17390,
161,
60,
800,
3726,
3726,
31,
22,
79,
1174,
109,
993,
24239,
3893,
56,
31,
259,
20,
275,
131,
13024,
17,
1936,
9,
19,
48,
3893,
31,
275,
15421,
8,
3554,
1990,
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... |
Borland C++ Builder 6 compiler problem
===
Why BCB 6 always compile all files. I make come changes on one file but BCB 6 compile all files when i start app.
Any idea?
I use WinXP SP2. | 0 | [
2,
3895,
618,
272,
20512,
14960,
400,
21486,
1448,
800,
3726,
3726,
483,
2726,
220,
400,
550,
26561,
65,
6488,
9,
31,
233,
340,
1693,
27,
53,
3893,
47,
2726,
220,
400,
26561,
65,
6488,
76,
31,
799,
4865,
9,
186,
882,
60,
31,
275... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Add column to existing table in MSSQL
===
How do you add a column, with a default value, to an existing table in MSSQL 2000/2005? | 0 | [
2,
3547,
4698,
20,
3149,
859,
19,
4235,
18,
22402,
800,
3726,
3726,
184,
107,
42,
3547,
21,
4698,
15,
29,
21,
12838,
1923,
15,
20,
40,
3149,
859,
19,
4235,
18,
22402,
824,
118,
2835,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Removing leading zeroes from a field in a SQL statement
===
I am working on a SQL query that reads from a SQLServer database to produce an extract file. One of the requirements to remove the leading zeroes from a particular field, which is a simple VARCHAR(10) field. So, for example, if the field contains '00001A', the SELECT statement needs to return the data as '1A'.
Is there a way in SQL to easily remove the leading zeroes in this way? I know there is an RTRIM function, but this seems only to remove spaces. | 0 | [
2,
9096,
1005,
4606,
160,
37,
21,
575,
19,
21,
4444,
255,
3331,
800,
3726,
3726,
31,
589,
638,
27,
21,
4444,
255,
25597,
30,
11137,
37,
21,
4444,
255,
10321,
106,
6018,
20,
2213,
40,
10962,
3893,
9,
53,
16,
14,
4786,
20,
4681,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to set code behind a resource dictionary in WPF for event handling?
===
Is it possible to set code behind a resource dictionary in WPF. For example in a usercontrol for a button you declare it in XAML. The event handling code for the button click is done in the code file behind the control. If I was to create a data template with a button how can I write the event handler code for it's button click within the resource dictionary. | 0 | [
2,
25,
32,
938,
20,
309,
1797,
439,
21,
6577,
9186,
19,
619,
7721,
26,
807,
7988,
60,
800,
3726,
3726,
25,
32,
938,
20,
309,
1797,
439,
21,
6577,
9186,
19,
619,
7721,
9,
26,
823,
19,
21,
4155,
12898,
26,
21,
5167,
42,
10123,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MySQL slow query log - how slow is slow?
===
What do you find is the optimal setting for mysql slow query log parameter, and why? | 0 | [
2,
51,
18,
22402,
2276,
25597,
6738,
13,
8,
184,
2276,
25,
2276,
60,
800,
3726,
3726,
98,
107,
42,
477,
25,
14,
17586,
2697,
26,
51,
18,
22402,
2276,
25597,
6738,
18906,
15,
17,
483,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How do you get through the inevitable motivational "slump" near the end of projects?
===
When working on a project, after the interesting parts are coded, my motivation is severely diminished. What do you do to get over this problem? | 4 | [
2,
184,
107,
42,
164,
120,
14,
15113,
11933,
192,
13,
7,
18,
4404,
306,
7,
424,
14,
241,
16,
2314,
60,
800,
3726,
3726,
76,
638,
27,
21,
669,
15,
75,
14,
4883,
1341,
50,
13,
22254,
15,
51,
11933,
25,
8953,
17942,
9,
98,
107,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0... |
How can I copy a large file on Windows without CopyFile or CopyFileEx?
===
There is a limitation on Windows Server 2003 that prevents you from copying extremely large files, in proportion to the amount of RAM you have. The limitation is in the CopyFile and CopyFileEx functions, which are used by xcopy, Explorer, Robocopy, and the .NET FileInfo class.
Here is the error that you get:
> Cannot copy [filename]: Insufficient system resources exist to complete the requested service.
The is a [knowledge base article][1] on the subject, but it pertains to NT4 and 2000.
There is also a suggestion to [use ESEUTIL][2] from an Exchange installation, but I haven't had any luck getting that to work.
Does anybody know of a quick, easy way to handle this? I'm talking about >50Gb on a machine with 2Gb of RAM. I plan to fire up Visual Studio and just write something to do it for me, but it would be nice to have something that was already out there, stable and well-tested.
[1]: http://support.microsoft.com/default.aspx/kb/259837
[2]: http://blogs.technet.com/askperf/archive/2007/05/08/slow-large-file-copy-issues.aspx | 0 | [
2,
184,
92,
31,
4344,
21,
370,
3893,
27,
1936,
366,
4344,
16877,
54,
4344,
16877,
1706,
60,
800,
3726,
3726,
80,
25,
21,
24943,
27,
1936,
8128,
973,
30,
2501,
18,
42,
37,
4344,
68,
3898,
370,
6488,
15,
19,
7814,
20,
14,
2006,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 cairngorm "Comparator"
===
Can anyone explain this in easy to understand terms? | 0 | [
2,
98,
25,
21,
18199,
6979,
79,
13,
7,
960,
3574,
3457,
7,
800,
3726,
3726,
92,
1276,
3271,
48,
19,
2010,
20,
1369,
1663,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What are the best resources for design patterns and their uses?
===
When it comes to the use of design patterns, I am guessing there are three types of shops. Those who wouldn't know a pattern if it hit them in the face - these usually prefer the Ctrl-C / Ctrl-V approach to code-reuse. Those who spend hours a day searching their legacy code in hopes of implementing one more great pattern - these usually spend more time refactoring the code of simple programs than would ever be spent in a hundred years of maintenance. And finally, those who walk the middle path using patterns when they make sense, and coding whatever comes first for minimally exposed code.
I'm wondering if anyone has locked down a good approach to a balanced incorporation of pattern use in the software development life cycle. Also, what are some good resources on the Web for patterns, their motivating factors, and their proper use?
Thanks. | 0 | [
2,
98,
50,
14,
246,
2566,
26,
704,
6282,
17,
66,
2027,
60,
800,
3726,
3726,
76,
32,
1624,
20,
14,
275,
16,
704,
6282,
15,
31,
589,
19523,
80,
50,
132,
2551,
16,
7014,
9,
273,
72,
1265,
22,
38,
143,
21,
3732,
100,
32,
770,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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, beyond the basics
===
I've gotten to grips with the basics of Python and I've got a small holiday which I want to use some of to learn a little more Python. The problem is that I have no idea what to learn or where to start. I'm primarily web development but in this case I don't know how much difference it will make. | 0 | [
2,
20059,
15,
1701,
14,
2125,
18,
800,
3726,
3726,
31,
22,
195,
4094,
20,
4466,
18,
29,
14,
2125,
18,
16,
20059,
17,
31,
22,
195,
330,
21,
284,
5114,
56,
31,
259,
20,
275,
109,
16,
20,
2484,
21,
265,
91,
20059,
9,
14,
1448,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 CSS truly override the order of HTML elements on a page?
===
If you have several DIVs on a page, you can use CSS to size and float them, and move them round a little...but I can't see a way to get past the fact that the first DIV will show near the top of the page, and the last DIV will be near the bottom! I cannot completely override the order of the elements as they come from the source HTML.....can you?
I must be missing something, because people say, "we can change the look of the whole website by just editing one CSS file." But that would depend on you still wanting the DIVs in the same order!
(P.S. I am sure no-one uses "position:absolute" on every element on a page.) | 0 | [
2,
92,
272,
18,
18,
4574,
84,
11891,
14,
389,
16,
13,
15895,
2065,
27,
21,
2478,
60,
800,
3726,
3726,
100,
42,
57,
238,
13,
12916,
18,
27,
21,
2478,
15,
42,
92,
275,
272,
18,
18,
20,
1072,
17,
11510,
105,
15,
17,
780,
105,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why does mvn release:prepare fail while tagging?
===
With my multiproject pom I get an error while running release:prepare. There is nothing fancy about the project setup and every release-step before runs fine.
The error I get is:
<pre>
[INFO] ------------------------------------------------------------------------
[ERROR] BUILD FAILURE
[INFO] ------------------------------------------------------------------------
[INFO] Unable to tag SCM
Provider message:
The svn tag command failed.
Command output:
svn: Commit failed (details follow):
svn: File '/repos/june/tags/foo-1.0.2/foo.bar.org/pom.xml' already exists
</pre>
Any idea where it comes from and how to get around it?
(sorry for duplicate post - first was closed because I didn't formulate it as a question that can be answered. I hope it's ok now.) | 0 | [
2,
483,
630,
17967,
103,
830,
45,
3515,
1060,
99,
7476,
133,
3383,
2762,
60,
800,
3726,
3726,
29,
51,
1889,
21011,
16214,
31,
164,
40,
7019,
133,
946,
830,
45,
3515,
1060,
99,
9,
80,
25,
626,
12251,
88,
14,
669,
18161,
17,
352,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I enable/disable Cut/Copy/Paste menu and toolbar items in a generic way?
===
I have a windows forms application with controls like textbox, combobox, datagridview etc.
These controls allow a user to use the clipboad, i.e. cut/copy and paste text. It is also possible to delete text (which is not related to the clipboard).
My application has a menubar with an Edit item containing Cut/Copy/Paste/Delete items, and a toolbar with these items as well. How can I enable/disable these items properly depending in the state of the control having the focus?
I am looking for a generic way, i.e. I look for an implementation I do once, and can reuse for the future independent of the controls my application will use. | 0 | [
2,
184,
107,
31,
9240,
118,
2906,
579,
1077,
118,
19625,
118,
19802,
62,
11379,
17,
5607,
1850,
3755,
19,
21,
12733,
161,
60,
800,
3726,
3726,
31,
57,
21,
1936,
1997,
3010,
29,
8671,
101,
1854,
5309,
15,
22621,
5309,
15,
1054,
163... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to make visualstudio .net work with VB6 and service pack 6
===
I have VB application that requires visual service pack 6 to run , now when I install visualstudio.net (any version of .net) Its debugger doesn't work properly ,I am able to create windows/web application in visualstudio.net but not able to debug anything , so I have to keep 2 computers , one for VB and one for .net , does anybody have any idea what is the cause for this and is there any fix for this ? | 0 | [
2,
184,
20,
233,
3458,
21026,
13,
9,
2328,
170,
29,
13,
20468,
379,
17,
365,
3607,
400,
800,
3726,
3726,
31,
57,
13,
20468,
3010,
30,
4781,
3458,
365,
3607,
400,
20,
485,
13,
15,
130,
76,
31,
16146,
3458,
21026,
9,
2328,
13,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Silverlight interaction with DataSet web services
===
My colleague has found himself in an "interesting" situation. He is working on a Silverlight (2.0) prototype that needs to call existing web services in the enterprise and bind the returned data to data-display controls. The thing is, the web services return .NET DataSets (they are not about to change existing implementations) and Silverlight does not natively support DataSets.
What would a good workaround be? I was thinking an adapter pattern but do not know if middle-man web services to carry out transformations would be a very good idea. Could be tedious if there are many existing web services. | 0 | [
2,
1172,
3130,
7754,
29,
1054,
3554,
2741,
687,
800,
3726,
3726,
51,
12321,
63,
216,
425,
19,
40,
13,
7,
16208,
68,
7,
1858,
9,
24,
25,
638,
27,
21,
1172,
3130,
13,
5,
135,
9,
387,
6,
7063,
30,
2274,
20,
645,
3149,
2741,
687... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 access the ListViewItems of a WPF ListView?
===
Within an event, I'd like to put the focus on a specific TextBox within the ListViewItem's template. The XAML looks like this:
<ListView x:Name="myList">
<ListView.View>
<GridView>
<GridViewColumn>
<GridViewColumn.CellTemplate>
<DataTemplate>
<!-- Focus this! -->
<TextBox x:Name="myBox"/>
I've tried the following in the code behind:
(myList.FindName("myBox") as TextBox).Focus();
but I seem to have misunderstood the <code>FindName()</code> docs, because it returns <code>null</code>.
Also the <code>ListView.Items</code> doesn't help, because that (of course) contains my bound business objects and no ListViewItems.
| 0 | [
2,
184,
92,
31,
1381,
14,
968,
4725,
2119,
79,
18,
16,
21,
619,
7721,
968,
4725,
60,
800,
3726,
3726,
363,
40,
807,
15,
31,
22,
43,
101,
20,
442,
14,
1776,
27,
21,
1903,
1854,
5309,
363,
14,
968,
4725,
2119,
79,
22,
18,
2289... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Clean builds in continuous integration
===
We use a CruiseControl.Net/NAnt/Subversion stack for CI. Doing a fresh checkout for every build is way too time-consuming, so currently we just do an update on a working copy. However, this leaves the possibility that orphaned files may remain in the working copy, after being deleted in source control. We have tried using the NAnt delete task just to remove all code source files before an update, but this can corrupt the working copy. Does anyone know a fast way to run a build on a clean and up-to-date working copy? | 0 | [
2,
2745,
1895,
18,
19,
6357,
8078,
800,
3726,
3726,
95,
275,
21,
6581,
12898,
9,
2328,
118,
11028,
118,
7563,
10898,
7566,
26,
5486,
9,
845,
21,
3180,
2631,
1320,
26,
352,
1895,
25,
161,
266,
85,
8,
17601,
15,
86,
871,
95,
114,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
"Greedy" <Delete> and <Backspace> in Visual Studio
===
Is there the way to apply "greedy" behavior to <Delete> and <Backspace> keys in Visual Studio? By "greedy" I mean such behavior when all whitespace between cursor position and next word bound can be deleted using one keystroke. | 0 | [
2,
13,
7,
6879,
69,
93,
7,
13,
1,
24249,
591,
1,
17,
13,
1,
1958,
5582,
1,
19,
3458,
1120,
800,
3726,
3726,
25,
80,
14,
161,
20,
5645,
13,
7,
6879,
69,
93,
7,
3257,
20,
13,
1,
24249,
591,
1,
17,
13,
1,
1958,
5582,
1,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Has anyone found a way to run C# Selenium RC tests in parallel?
===
**Has anyone found a way to run Selenium RC / Selenium Grid tests, written in C# in parallel?**
I've currently got a sizable test suite written using Selenium RC's C# driver. Running the entire test suite takes a little over an hour to complete. I normally don't have to run the entire suite so it hasn't been a concern up to now, but it's something that I'd like to be able to do more regularly (ie, as part of an automated build)
I've been spending some time recently poking around with the Selenium Grid project whose purpose essentially is to allow those tests to run in parallel. Unfortunately, it seems that the TestDriven.net plugin that I'm using runs the tests serially (ie, one after another). I'm assuming that NUnit would execute the tests in a similar fashion, although I haven't actually tested this out.
I've noticed that the NUnit 2.5 betas are starting to talk about running tests in parallel with pNUnit, but I haven't really familiarized myself enough with the project to know for sure whether this would work.
Another option I'm considering is separating my test suite into different libraries which would let me run a test from each library concurrently, but I'd like to avoid that if possible since I'm not convinced this is a valid reason for splitting up the test suite. | 0 | [
2,
63,
1276,
216,
21,
161,
20,
485,
272,
5910,
23027,
14311,
16462,
4894,
19,
3821,
60,
800,
3726,
3726,
13,
1409,
6482,
1276,
216,
21,
161,
20,
485,
23027,
14311,
16462,
13,
118,
23027,
14311,
7354,
4894,
15,
642,
19,
272,
5910,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Maven plugins for javascript
===
Javascript code can be tough to maintain.<br>
I am looking for tools that will help me ensure a reasonable quality level.<br>
So far I have found [JsUNit][1], a very nice unit test framework for javascript. Tests can be run automatically from ant on any browser available.<br>
I have not found yet some javascript equivalent of PMD, checkstyle, Findbug...<br>
Do you know any static code analysis tool for javascript ?
[1]: http://www.jsunit.net/ | 0 | [
2,
1216,
3124,
10922,
108,
18,
26,
8247,
8741,
800,
3726,
3726,
8247,
8741,
1797,
92,
44,
6161,
20,
4027,
9,
1,
5145,
1,
31,
589,
699,
26,
4672,
30,
129,
448,
55,
4062,
21,
9954,
2190,
662,
9,
1,
5145,
1,
86,
463,
31,
57,
21... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why can't variables be declared in a switch statement?
===
I've always wondered this - why can't you declare variables after a case label in a switch statement? In C++ you can declare variables pretty much anywhere (and declaring them close to first use is obviously a good thing) but the following still won't work:
switch (val)
{
case VAL:
// This won't work
int newVal = 42;
break;
case ANOTHER_VAL:
...
break;
}
The above gives me the following error (MSC):
> initialization of 'newVal' is skipped by 'case' label
This seems to be a limitation in other languages too. Why is this such a problem?
| 0 | [
2,
483,
92,
22,
38,
12157,
44,
2482,
19,
21,
5521,
3331,
60,
800,
3726,
3726,
31,
22,
195,
550,
3519,
48,
13,
8,
483,
92,
22,
38,
42,
10123,
12157,
75,
21,
610,
1899,
19,
21,
5521,
3331,
60,
19,
272,
20512,
42,
92,
10123,
12... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Global vs Universal Active Directory Group access for a web app
===
I have a SQL Server 2000, C# & ASP.net web app. We want to control access to it by using Active Directory groups. I can get authentication to work if the group I put in is a 'Global' but not if the group is 'Universal'.
How can I make this work with 'Universal' groups an well?
Here's my authorization block:
<authorization>
<allow roles="domain\Group Name Here"/>
<allow roles="domain\Group Name Here2"/>
<allow roles="domain\Group Name Here3"/>
<deny users="*"/>
</authorization> | 0 | [
2,
2062,
4611,
4172,
1348,
16755,
214,
1381,
26,
21,
2741,
4865,
800,
3726,
3726,
31,
57,
21,
4444,
255,
8128,
824,
15,
272,
5910,
279,
28,
306,
9,
2328,
2741,
4865,
9,
95,
259,
20,
569,
1381,
20,
32,
34,
568,
1348,
16755,
1170,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Apply inline CSS to an ASP.NET server control
===
Based on a simple test I ran, I don't think it's possible to put an inline <style> tag into an ASP.NET server control. The style did not end up rendering to the output HTML. Even if it was possible, I'm sure it is bad practice to do this.
Is it possible to do this? I can see it being useful for quick prototypes that just have 1 or 2 CSS classes to apply. | 0 | [
2,
5645,
19,
1143,
272,
18,
18,
20,
40,
28,
306,
9,
2328,
8128,
569,
800,
3726,
3726,
432,
27,
21,
1935,
1289,
31,
717,
15,
31,
221,
22,
38,
277,
32,
22,
18,
938,
20,
442,
40,
19,
1143,
279,
255,
38,
73,
4381,
1569,
263,
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... |
Exception getting past Application.ThreadException and AppDomain.CurrentDomain.UnhandledException
===
I'm having a problem with an application hanging and giving me the default "Please tell Microsoft about this problem" popup, instead of the "unhandled exception" dialog in the application.
In the application code, the Application.ThreadException and AppDomain.CurrentDomain.UnhandledException are both redirected to a method which writes an error log to disk, saves a screenshot to disk, and shows a friendly dialog box.
But when this error occurs, none of those three things happen. All I get is this in the event viewer:
*EventType clr20e3, P1 myapp.exe, P2 4.0.0.0, P3 47d794d4, P4 mscorlib, P5 2.0.0.0, P6 471ebc5b, P7 15e5, P8 27, P9 system.argumentoutofrange, P10 NIL*
Given that the error only seems to happen after the application has been running for several hours, I wonder if it may be a memory-leak problem. I've searched a bit for "clr20e3" but only managed to find ASP.Net stuff, whereas my application is just plain exe. I guess that it could also be an error in the error handling method?
Any help solving this problem would be much appreciated - whether it is solutions, or suggestions in how to find out what the root cause of the problem is.
| 0 | [
2,
5391,
1017,
640,
3010,
9,
96,
10647,
10066,
872,
17,
4865,
537,
6232,
9,
17657,
537,
6232,
9,
1020,
3203,
1294,
10066,
872,
800,
3726,
3726,
31,
22,
79,
452,
21,
1448,
29,
40,
3010,
4505,
17,
1438,
55,
14,
12838,
13,
7,
6744,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Stripping non printable characters from a string in python
===
I use to run
$s =~ s/[^[:print:]]//g;
on Perl to get rid of non printable characters.
In Python there's no POSIX regex classes, and I can't write [:print:] having it mean what I want. I know of no way in Python to detect if a character is printable or not.
What would you do?
| 0 | [
2,
25105,
538,
4793,
579,
1766,
37,
21,
3724,
19,
20059,
800,
3726,
3726,
31,
275,
20,
485,
5579,
18,
800,
1,
13,
18,
118,
2558,
1,
2558,
45,
10299,
45,
500,
500,
118,
118,
263,
73,
27,
416,
255,
20,
164,
6681,
16,
538,
4793,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 write a lock free structure?
===
In my multithreaded application and I see heavy lock contention in it, preventing good scalability across multiple cores. I have decided to use lock free programming to solve this.
How can I write a lock free structure? | 0 | [
2,
184,
92,
31,
2757,
21,
3991,
551,
1411,
60,
800,
3726,
3726,
19,
51,
1889,
96,
10647,
69,
3010,
17,
31,
196,
1278,
3991,
21662,
19,
32,
15,
11520,
254,
18957,
4091,
464,
1886,
2884,
18,
9,
31,
57,
868,
20,
275,
3991,
551,
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,
0,
0,
0,
0... |
Using openssl encryption with Java
===
I have a legacy C++ module that offers encryption/decryption using the openssl library (DES encryption). I'm trying to translate that code into java, and I don't want to rely on a DLL, JNI, etc...
C++ code looks like:
...
des_string_to_key(reinterpret_cast<const char *>(key1), &initkey);
des_string_to_key(reinterpret_cast<const char *>(key2), &key);
key_sched(&key, ks);
...
des_ncbc_encrypt(reinterpret_cast<const unsigned char *>(tmp.c_str()),
reinterpret_cast< unsigned char *>(encrypted_buffer),
tmp.length(), ks, &initkey, DES_ENCRYPT);
return base64(reinterpret_cast<const unsigned char *>(encrypted_buffer),
strlen(encrypted_buffer));
Java code looks like:
Cipher ecipher;
try {
ecipher = Cipher.getInstance("DES");
SecretKeySpec keySpec = new SecretKeySpec(key, "DES");
ecipher.init(Cipher.ENCRYPT_MODE, keySpec);
byte[] utf8 = password.getBytes("UTF8");
byte[] enc = ecipher.doFinal(utf8);
return new sun.misc.BASE64Encoder().encode(enc);
}
catch
...
So I can do DES encryption in Java pretty easily, but how can I get the same result as with the above code with methods that are completely different?
Thanks
Jerome
| 0 | [
2,
568,
8965,
18,
255,
24420,
29,
8247,
800,
3726,
3726,
31,
57,
21,
7780,
272,
20512,
12613,
30,
2486,
24420,
118,
546,
11435,
872,
568,
14,
8965,
18,
255,
1248,
13,
5,
3196,
24420,
6,
9,
31,
22,
79,
749,
20,
20628,
30,
1797,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Perl::Critic: Life after Moose?
===
I've started a conversion of a project to Moose and the first thing I noticed was that my critic/tidy tests go to hell. Moose, Tidy and Critic don't seem to like each each other as much as they used to.
Are there docs anywhere on how to make critic/tidy be more appreciative if the Moose dialect? What to most Moose users do? Relax/ditch critic for the more heavy Moose modules? Custom policies? | 0 | [
2,
416,
255,
45,
45,
16063,
596,
45,
201,
75,
20024,
60,
800,
3726,
3726,
31,
22,
195,
373,
21,
6263,
16,
21,
669,
20,
20024,
17,
14,
64,
584,
31,
2711,
23,
30,
51,
4654,
118,
13647,
93,
4894,
162,
20,
1094,
9,
20024,
15,
28... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What should be done to make TFS send e-mails for events?
===
Our Tfs server (Tfs2008) has smtp server installed. But we could not make Tfs send e-mails after events to the subscribers (we are using [EventSubscriptionTool](http://www.codeplex.com/tfseventsubscription)).
Our appsettings includes these lines:
<add key="emailNotificationFromAddress" value="tfs@mail.com" />
<add key="smtpServer" value="localhost" />
Is there any other tricks for this task...? | 0 | [
2,
98,
378,
44,
677,
20,
233,
13,
11720,
18,
2660,
13,
62,
8,
8079,
18,
26,
963,
60,
800,
3726,
3726,
318,
13,
11720,
18,
8128,
13,
5,
11720,
18,
2753,
6,
63,
7613,
13726,
8128,
4066,
9,
47,
95,
110,
52,
233,
13,
11720,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to call an Objective-C method from Javascript in a Cocoa/WebKit app?
===
I have a Cocoa app that uses a WebView to display an HTML interface. How would I go about calling an Objective-C method from a Javascript function within the HTML interface? | 0 | [
2,
184,
20,
645,
40,
7038,
8,
150,
2109,
37,
8247,
8741,
19,
21,
24507,
118,
14113,
13703,
4865,
60,
800,
3726,
3726,
31,
57,
21,
24507,
4865,
30,
2027,
21,
2741,
4725,
20,
3042,
40,
13,
15895,
6573,
9,
184,
83,
31,
162,
88,
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,
0... |
Running JIRA on a VM
===
Anyone have any success or failure running Jira on a VM?
I am setting up a new source control and defect tracking server. My server room is near full and my services group suggested a VM. I saw that a bunch of people are running SVN on VM (including NCSA). The VM would also free me from hardware problems and give me high availability. Finally, it frees me from some red tape and it can be implemented faster.
So, does anyone know of any reason why I shouldn't put Jira on a VM?
Thanks | 0 | [
2,
946,
487,
3517,
27,
21,
13,
20147,
800,
3726,
3726,
1276,
57,
186,
1280,
54,
2990,
946,
487,
3517,
27,
21,
13,
20147,
60,
31,
589,
2697,
71,
21,
78,
1267,
569,
17,
18929,
10353,
8128,
9,
51,
8128,
337,
25,
424,
503,
17,
51,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Strong SSL with Tomcat 6
===
I'm trying to create a self signed certificate for use with Apache Tomcat 6. Every certificate I can make always results in the browser connecting with AES-128. The customer would like me to demonstrate that I can create a connection at AES-256.
I've tried java's keytool and openssl. I've tried with a variety of parameters, but can't seem to specify anything about the keysize, just the signature size.
How can I get the browser-tomcat connection to use AES-256 with a self signed certificate? | 0 | [
2,
966,
13,
18,
18,
255,
29,
2067,
5782,
400,
800,
3726,
3726,
31,
22,
79,
749,
20,
1600,
21,
1119,
908,
6259,
26,
275,
29,
17140,
2067,
5782,
400,
9,
352,
6259,
31,
92,
233,
550,
1736,
19,
14,
16495,
6440,
29,
21,
160,
8,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to programmatically configure an ODBC Datasource using C#
===
Is there any way to create a ODBC DSN with C#?
Maybe a P/invoke? | 0 | [
2,
184,
20,
625,
6732,
1326,
1065,
15951,
40,
12340,
7229,
1054,
12097,
568,
272,
5910,
800,
3726,
3726,
25,
80,
186,
161,
20,
1600,
21,
12340,
7229,
13,
43,
18,
103,
29,
272,
5910,
60,
913,
21,
351,
118,
108,
2625,
1048,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
behaviour of datetime in json on different systems (win xp, server 2003)
===
My Web Application is split up in a WebGui and an WebService. The WebService is responsible for Business Logic and Database handling.
From Javascript in the Browser I request data depending on a date and time that is an input from the Browser. This request gous to an .asmx Url in the WebGui and inside this function the webservice is called.
On my development system (windows xp) I get the right data, but when I install it on the test system I have to add the local time zone difference to get the right data.
Why is the behaviour on the two systems different and what should I do to get on both systems the same behaviour?
| 0 | [
2,
7727,
16,
1231,
891,
19,
487,
528,
27,
421,
1242,
13,
5,
4181,
23045,
15,
8128,
973,
6,
800,
3726,
3726,
51,
2741,
3010,
25,
2132,
71,
19,
21,
2741,
7215,
17,
40,
2741,
11449,
9,
14,
2741,
11449,
25,
1864,
26,
508,
7085,
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... |
HTTP GET in VB.NET
===
What is the best way to issue a http get in VB.net? I want to get the result of a request like http://api.hostip.info/?ip=68.180.206.184 | 0 | [
2,
7775,
164,
19,
13,
20468,
9,
2328,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
1513,
21,
7775,
164,
19,
13,
20468,
9,
2328,
60,
31,
259,
20,
164,
14,
829,
16,
21,
3772,
101,
7775,
6903,
2552,
49,
9,
11694,
4307,
9,
108,
41... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Python module functions used in exepcted ways
===
Based on ["Split a string by spaces in Python"][1], which uses *shlex.split* to split a string with quotes smartly, I would be interested in hearing about other common tasks solved by non-obvious standard library functions.
If this turns into [Module of The Week][2], that's fine too.
[1]: http://stackoverflow.com/questions/6209/split-a-string-ignoring-quoted-sections#6243
[2]: http://www.doughellmann.com/projects/PyMOTW/ | 0 | [
2,
20059,
12613,
3719,
147,
19,
1396,
62,
5779,
1427,
2847,
800,
3726,
3726,
432,
27,
636,
7,
25603,
21,
3724,
34,
7644,
19,
20059,
7,
500,
2558,
165,
500,
15,
56,
2027,
1637,
1635,
20718,
9,
25603,
2483,
20,
2132,
21,
3724,
29,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Abstract Syntax Tree
===
I have an AST derived from the ANTLR Parser Generator for Java. What I want to do is somehow construct a control flow graph of the source code, where each statement or expression is a unique Node. I understand there must be some recursiveness to this identification, I was wondering what you would suggest as the best option and if ANTLR has a toolset I can use for this job.
Cheers,
Chris | 0 | [
2,
8502,
22649,
1541,
800,
3726,
3726,
31,
57,
40,
28,
38,
3981,
37,
14,
40,
38,
12988,
2017,
4104,
15286,
26,
8247,
9,
98,
31,
259,
20,
107,
25,
3625,
6960,
21,
569,
3312,
7210,
16,
14,
1267,
1797,
15,
113,
206,
3331,
54,
180... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
IQueriable<T> with better performance?
===
Having tried myList.AsQueriable() doing many lookups on a list of 30,000 seems to take a while (I'm joining it with another source).
Is there an implementation of IQueriable that indexes objects? I've had a look at http://www.codeplex.com/i4o/ which is really quite close, but seems to rely on using extension methods on IndexedCollection rather than making IndexedColleciton implement IQueriable. I'm keen to keep my interface returning IQueriable as I don't want anyone to know whether they are hitting a cache or hitting the db.
Are there any other IQueriable implementaions out there for objects? | 0 | [
2,
13,
5312,
928,
579,
1,
38,
1,
29,
574,
956,
60,
800,
3726,
3726,
452,
794,
51,
5739,
9,
472,
8190,
49,
579,
5,
6,
845,
151,
361,
15699,
27,
21,
968,
16,
13576,
2206,
20,
247,
21,
133,
13,
5,
49,
22,
79,
3765,
32,
29,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does NUnit work with .NET 3.5?
===
I'm just getting started with learning about Unit testing (and TDD in general). My question is does the latest version of NUnit support working in VS2008 with .NET 3.5? I've looked at the documentation pages at NUnit and they don't mention it.
If anyone has worked with it in 3.5 are there any limitations or features that don't work/need workarounds?
Thanks<br>
-J | 0 | [
2,
630,
10210,
242,
170,
29,
13,
9,
2328,
203,
9,
264,
60,
800,
3726,
3726,
31,
22,
79,
114,
1017,
373,
29,
2477,
88,
1237,
4431,
13,
5,
290,
15596,
43,
19,
297,
6,
9,
51,
1301,
25,
630,
14,
5736,
615,
16,
10210,
242,
555,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Variable declarations in header files - static or not?
===
When refactoring away some #defines I came across declarations similar to the following in a C++ header file:
static const unsigned int VAL = 42;
const unsigned int ANOTHER_VAL = 37;
The question is, what difference, if any, will the static make? Note that multiple inclusion of the headers isn't possible due to the classic #ifndef HEADER #define HEADER #endif trick (if that matters).
Does the static mean only one copy of VAL is created, in case the header is included by more than one source file?
| 0 | [
2,
7612,
7098,
18,
19,
157,
106,
6488,
13,
8,
12038,
54,
52,
60,
800,
3726,
3726,
76,
302,
17455,
68,
229,
109,
6926,
13862,
10652,
31,
281,
464,
7098,
18,
835,
20,
14,
249,
19,
21,
272,
20512,
157,
106,
3893,
45,
12038,
11608,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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) Should I reject URLS longer than N?
===
I am trying to write an application that uses pretty URLS or REST (still learning what this entails). Anyway my urls look like www.foo.net/some_url/some_parameter/some_keyword. I can be sure a url will never exceed N characters. Should I validate the url length with every request in order to protect against buffer overflow/injection attacks? I am going to guess this is an obvious yes but I am no security expert so perhaps I am missing something. | 0 | [
2,
13,
5,
17749,
6,
378,
31,
12170,
13,
911,
7532,
1045,
119,
13,
103,
60,
800,
3726,
3726,
31,
589,
749,
20,
2757,
40,
3010,
30,
2027,
1772,
13,
911,
7532,
54,
760,
13,
5,
8073,
2477,
98,
48,
21113,
18,
6,
9,
2774,
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 can I highlight text in Scintilla?
===
I am writing an editor using <a href="http://www.scintilla.org/">Scintilla</a>.
I am already using a lexer to do automatic syntax highlighting but now I'd like to mark search results. If I want to mark only one hit I can set the selection there but I'd like to mark (e.g. with yellow background) all the hits.
I writing this in Perl but if you have suggestions in other languages that would be cool as well. | 0 | [
2,
184,
92,
31,
14373,
1854,
19,
9569,
2877,
3247,
60,
800,
3726,
3726,
31,
589,
1174,
40,
1835,
568,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
6483,
9,
18,
4484,
38,
3247,
9,
5583,
118,
7,
1,
18,
4484,
38,
3247,
1,
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... |
Learning C# in Mono
===
How solid is Mono for C# development on Linux and OS X? I've been thinking about learning C# on the side, and was wondering if learning using Mono would suffice. | 0 | [
2,
2477,
272,
5910,
19,
4129,
800,
3726,
3726,
184,
2941,
25,
4129,
26,
272,
5910,
522,
27,
13024,
17,
13,
759,
993,
60,
31,
22,
195,
74,
1440,
88,
2477,
272,
5910,
27,
14,
270,
15,
17,
23,
5712,
100,
2477,
568,
4129,
83,
2881... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
SQL Compact Edition 3.5 SP 1 - LockTimeOutException - how to debug?
===
Intermittently in our app, we encounter LockTimeoutExceptions being throw from SQL CE. We've recently upgraded to 3.5 SP 1, and a number of them seem to have gone away, but we still do see them occasionally. I'm certain it's a bug in our code (which is multi-threaded) but I haven't been able to pin it down precisely. Does anyone have any good techniques for debugging this problem? The exceptions log like this (there's never a stack trace for these exceptions):
>SQL Server Compact timed out waiting for a lock. The default lock time is 2000ms for devices and 5000ms for desktops. The default lock timeout can be increased in the connection string using the ssce: default lock timeout property. [ Session id = 6,Thread id = 7856,Process id = 10116,Table name = Product,Conflict type = s lock (x blocks),Resource = DDL ]
Our database is read-heavy, but does seldom writes, and I _think_ I've got everything protected where it needs to be. | 0 | [
2,
4444,
255,
8285,
1322,
203,
9,
264,
3782,
137,
13,
8,
3991,
891,
1320,
10066,
872,
13,
8,
184,
20,
121,
16254,
60,
800,
3726,
3726,
19667,
102,
19,
318,
4865,
15,
95,
7007,
3991,
891,
1320,
10066,
5757,
142,
3814,
37,
4444,
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... |
Best Resources for Learning AS3
===
Let me star off by saying I am by NO means a designer. I'm interested in learning AS3, and was wondering what some of the best books/resources there are out there for an absolute beginner. | 4 | [
2,
246,
2566,
26,
2477,
28,
240,
800,
3726,
3726,
408,
55,
778,
168,
34,
1148,
31,
589,
34,
90,
1108,
21,
4742,
9,
31,
22,
79,
3158,
19,
2477,
28,
240,
15,
17,
23,
5712,
98,
109,
16,
14,
246,
964,
118,
99,
12097,
18,
80,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0... |
What can cause MASM to display "junk"?
===
I have some code which is supposed to display a short message. Here's the pertinent code:
DATA SEGMENT 'DATA'
MSG DB 0AH, 0DH, 'Hello, Adam', '$'
CHAR DB 00H
DATA ENDS
CODE SEGMENT 'CODE'
PRINT_MSG:
MOV AH, 09H ;Command to print string of characters
MOV DX, OFFSET MSG ;Mov address of message into DX
INT 21H ;DOS Interrupt
JMP WAITING ;Loop back to waiting state
CODE ENDS
And the output is:
E:\ece323\software\lab2>MAIN.EXE
?F ^?¶ ? N? ? -!-
Hello, Adam-
What is going on here? | 0 | [
2,
98,
92,
1679,
4885,
79,
20,
3042,
13,
7,
8753,
197,
7,
60,
800,
3726,
3726,
31,
57,
109,
1797,
56,
25,
2293,
20,
3042,
21,
502,
2802,
9,
235,
22,
18,
14,
416,
2864,
2291,
1797,
45,
1054,
5631,
13,
22,
18768,
22,
4235,
263... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Many to Many Relationship in MS Dynamics CRM 4.0 - How to?
===
I'm working on a MS CRM server for a project at my university.
What I'm trying to do is to let the user of the CRM to tag some contacts, I thought of creating an entity to archive the tags an to create an N:N relationship between the tag entity and the contact one.
I've created and published the new entity and the relationship, but I don't know how to add a lookup field to the contact form, so that the user can see the tags related to one contact and add a new one.
Can anyone help me?
If you couldn't understand what I'm trying to do tell me, I'll reformulate.
Thanks
| 0 | [
2,
151,
20,
151,
1429,
19,
4235,
12289,
6186,
79,
268,
9,
387,
13,
8,
184,
20,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
4235,
6186,
79,
8128,
26,
21,
669,
35,
51,
155,
9,
98,
31,
22,
79,
749,
20,
107,
25,
20,
408,
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... |
Python sockets suddenly timing out?
===
I came back today to an old script I had for logging into Gmail via SSL. The script worked fine last time I ran it (several months ago) but now it dies immediately with:
<urlopen error The read operation timed out>
If I set the timeout (no matter how long), it dies even more immediately with:
<urlopen error The connect operation timed out>
The latter is reproducible with:
import socket
socket.setdefaulttimeout(30000)
sock = socket.socket()
sock.connect(('www.google.com', 443))
ssl = socket.ssl(sock)
returning:
socket.sslerror: The connect operation timed out
but I can't seem to reproduce the former and, after much stepping thru the code, I have no clue what's causing any of this. | 0 | [
2,
20059,
18482,
18,
1605,
11812,
70,
60,
800,
3726,
3726,
31,
281,
97,
786,
20,
40,
315,
3884,
31,
41,
26,
13,
13919,
77,
489,
8079,
1197,
13,
18,
18,
255,
9,
14,
3884,
577,
1123,
236,
85,
31,
717,
32,
13,
5,
29807,
818,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Self-owning web services, or services that can survive the death of the inventor
===
I noticed a new web service today called a [Dead man's switch](http://www.deadmansswitch.net/), which dispatches email in the event that you don't respond to periodic "pings" that prove you're still alive. But it occurred to me that I might outlive the person or organization that pays the bills for the service, making the service useless.
There are other kinds of services that we could be reluctant to use simply because the value is so high we don't trust it to an inventor who could lose interest, or an organization that could go insolvent. Like data repositories that could be used in many different programs and devices, but that would break them all if someone forgot to pay the hosting bill.
But say the service "owned itself", and paid its own hosting bills? Like this:
* The host is Amazon EC2 or similar
* The bill is paid by debiting a bank account
* The bank account is replenished by interest returns and advertising revenue
* The bank account is in the name of the service itself, and once seeded is never touched for anything else again
* The creator declares the service "finished" and moves onto the next project
To me, this is an engineering problem similar to those of building Mars rovers, bury-n-forget power generators, The Millenium Clock, and other artifacts that have their own homeostasis mechanisms and can be abandoned by their creators without ceasing to function.
The question is: what are the gotchas? Must the bank account be in a real person's name? Can you prevent the govt. from considering the account "unclaimed" after n years? How could it recover from crashes? Is there an API for opening new hosting accounts at other companies so it could automatically scale itself and protect itself against the insolvency of any one host? | 0 | [
2,
1119,
8,
16620,
68,
2741,
687,
15,
54,
687,
30,
92,
4563,
14,
372,
16,
14,
10981,
800,
3726,
3726,
31,
2711,
21,
78,
2741,
365,
786,
227,
21,
636,
14260,
169,
22,
18,
5521,
500,
5,
21127,
6903,
6483,
9,
14260,
177,
18,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What do you do to keep your coding skills in shape, and how often?
===
What would you say are your best kept secrets to keep yourself in top programming shape? | 4 | [
2,
98,
107,
42,
107,
20,
643,
154,
13,
15458,
3207,
19,
2539,
15,
17,
184,
478,
60,
800,
3726,
3726,
98,
83,
42,
395,
50,
154,
246,
1025,
7818,
20,
643,
2834,
19,
371,
3143,
2539,
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... |
Tips on walking through unfamiliar code or info on tools that help the process?
===
I would love tips on how to walk unfamiliar code with many objects. Before OOP this was still a difficult thing and I would do it with listings and have tabs and 8 fingers holding my place. With multiple monitors I have advanced my techniques so it's easier but still difficult. Eclipse does a pretty good job with letting you jump to where something is defined and letting you go back.
With objects and constructors I have found it increasingly difficult to figure out what someone else's code is doing especially when multiple constructors are interfacing with 3rd party API's (seems like a cascading shotgun).
I don't know if there are any tools out there that will map out code using a treeview in the order that the code is executed or not. I'm getting by with Eclipse, but it seems like there should be something that helps make it easier.
I'm mainly having to go through Java code at the moment, but I have the same issues with .NET stuff. | 0 | [
2,
11034,
27,
2094,
120,
17819,
1797,
54,
15404,
27,
4672,
30,
448,
14,
953,
60,
800,
3726,
3726,
31,
83,
339,
11034,
27,
184,
20,
1466,
17819,
1797,
29,
151,
3916,
9,
115,
13,
21709,
48,
23,
174,
21,
1956,
584,
17,
31,
83,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I reserve caret position in CEdit control?
===
I'm programming an application in MFC (don't ask) and I have a CEdit box that holds a number. When that number is edited, I would like to act on the change, and then replace the caret where it was before I acted on the change - if the user was just before the "." in "35.40", I would like it to still be placed before the dot if they change it to "345.40". I'm currently catching the CHANGE message, but that can be switched to something else (UPDATE?). How can I accomplish this?
| 0 | [
2,
184,
107,
31,
2126,
781,
38,
649,
19,
13,
11014,
242,
569,
60,
800,
3726,
3726,
31,
22,
79,
3143,
40,
3010,
19,
307,
7061,
13,
5,
804,
22,
38,
1349,
6,
17,
31,
57,
21,
13,
11014,
242,
1649,
30,
2763,
21,
234,
9,
76,
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... |
Tidy Converting <Span Style="Font-Style:Bold"> to <Class="C1">.
===
I am using the PHP 5 Tidy class to format html.
Everything is fine except when it gets passed a style attribute, when it changes it into a class attribute. As I am only formatting the body of a document, not the head, there is no class defined in the head for the attribute to read.
I have looked through all the Tidy options but can't work out how to stop this behaviour.
Thanks | 0 | [
2,
28028,
19583,
13,
1,
18,
3206,
1034,
3726,
7,
21931,
8,
4381,
45,
18698,
7,
1,
20,
13,
1,
1898,
3726,
7,
150,
165,
7,
1,
9,
800,
3726,
3726,
31,
589,
568,
14,
13,
26120,
331,
28028,
718,
20,
2595,
13,
15895,
9,
796,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which is the best tool for automatic GUI performance testing?
===
We are currently testing a Java Swing application for it's performance. I wonder if there is a good tool to automate this? | 0 | [
2,
56,
25,
14,
246,
5607,
26,
6715,
9457,
956,
4431,
60,
800,
3726,
3726,
95,
50,
871,
4431,
21,
8247,
5587,
3010,
26,
32,
22,
18,
956,
9,
31,
2666,
100,
80,
25,
21,
254,
5607,
20,
3108,
5281,
48,
60,
3,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to define listview templates in code
===
I am writing a Composite control, which contains a listview to display a table of items. Normally when using a ListView in Asp.NET I would define the templates in the code-forward.
<asp:ListView runat="server" ID="ArticleList">
<LayoutTemplate>
<div class="ContentContainer">
<div runat="server" id="itemPlaceholder" />
</div>
</LayoutTemplate>
<ItemTemplate>
<div>
<div><%# Eval("Content") %></div>
</div>
</ItemTemplate>
</asp:ListView>
I assume it's something like:
ListView view = new ListView();
view.LayoutTemplate = .....
view.ItemTemplate = .....
// when do I call these?
view.DataSource = myDataSource;
view.DataBind();
| 0 | [
2,
184,
20,
9267,
968,
4725,
22894,
18,
19,
1797,
800,
3726,
3726,
31,
589,
1174,
21,
12639,
569,
15,
56,
1588,
21,
968,
4725,
20,
3042,
21,
859,
16,
3755,
9,
4147,
76,
568,
21,
968,
4725,
19,
28,
306,
9,
2328,
31,
83,
9267,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
e-commerce widget for GraffitiCMS
===
Does anyone know of a e-commerce widget for GraffitiCMS?
| 0 | [
2,
13,
62,
8,
26470,
4807,
43,
3060,
26,
20566,
9095,
18,
800,
3726,
3726,
630,
1276,
143,
16,
21,
13,
62,
8,
26470,
4807,
43,
3060,
26,
20566,
9095,
18,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How can you get database specific performance metrics for things like CPU/Memory/etc. in SQL Server 2005?
===
I have a couple databases on a shared SQL Server 2005 cluster instance, that I would like performance metrics on. I have some processes that run for a very long time and suspect that code inefficiencies, rather than insufficient hardware are to blame.
I would like some way to get these performance metrics so that I can rule out the database hardware as the culprit. | 0 | [
2,
184,
92,
42,
164,
6018,
1903,
956,
11544,
18,
26,
564,
101,
17578,
118,
790,
5171,
93,
118,
1198,
150,
9,
19,
4444,
255,
8128,
812,
60,
800,
3726,
3726,
31,
57,
21,
1335,
6018,
18,
27,
21,
2592,
4444,
255,
8128,
812,
7460,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Combine rows in Access 2007
===
I'm looking for an Access 2007 equivalent to SQL Server's COALESCE function.
In SQL Server you could do something like:
---Person---
John
Steve
Richard
DECLARE @PersonList nvarchar(1024)
SELECT @PersonList = COALESCE(@PersonList + ',','') + Person
FROM PersonTable
PRINT @PersonList
Which produces: John, Steve, Richard
I want to do the same but in Access 2007.
Does anyone know how to combine rows like this in Access 2007?
| 0 | [
2,
12287,
11295,
19,
1381,
624,
800,
3726,
3726,
31,
22,
79,
699,
26,
40,
1381,
624,
4602,
20,
4444,
255,
8128,
22,
18,
3507,
160,
1105,
1990,
9,
19,
4444,
255,
8128,
42,
110,
107,
301,
101,
45,
13,
8,
8,
8,
7276,
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... |
Non-iterative / Non-looping Way To Calculate Effective Date?
===
I have a table called OffDays, where weekends and holiday dates are kept. I have a table called LeadTime where amount of time (in days) for a product to be manufactured is stored. Finally I have a table called Order where a product and the order date is kept.
Is it possible to query when a product will be finished manufacturing without using stored procedures or loops?
For example:
- OffDays has 2008-01-10, 2008-01-11, 2008-01-14.
- LeadTime has 5 for product 9.
- Order has 2008-01-09 for product 9.
The calculation I'm looking for is this:
- 2008-01-09 1
- 2008-01-10 x
- 2008-01-11 x
- 2008-01-12 2
- 2008-01-13 3
- 2008-01-14 x
- 2008-01-15 4
- 2008-01-16 5
I'm wondering if it's possible to have a query return 2008-01-16 without having to use a stored procedure, or calculate it in my application code.
| 0 | [
2,
538,
8,
242,
106,
3366,
13,
118,
538,
8,
18786,
68,
161,
20,
18469,
3140,
1231,
60,
800,
3726,
3726,
31,
57,
21,
859,
227,
168,
1185,
18,
15,
113,
16303,
17,
5114,
4076,
50,
1025,
9,
31,
57,
21,
859,
227,
672,
891,
113,
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... |
jQuery to replace broken images
===
I have a web page that includes a bunch of images.
Sometimes the image isn't available so a broken image is displayed in the clients browser.
I want to use jQuery to get the set of images, filter it to broken images then replace the src.
| 0 | [
2,
487,
8190,
93,
20,
3934,
2023,
3502,
800,
3726,
3726,
31,
57,
21,
2741,
2478,
30,
1103,
21,
7653,
16,
3502,
9,
1030,
14,
1961,
2532,
22,
38,
904,
86,
21,
2023,
1961,
25,
6115,
19,
14,
7421,
16495,
9,
31,
259,
20,
275,
487,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 large ASP.NET VB.NET project to C# - incrementally?
===
Was looking for some approaches to incrementally converting an large existing ASP.NET VB.NET project to C# while still being able to deploy it as a single web application (currently deployed on a weekly basis).
My thoughts were to just create a new C# ASP.NET project and slowly move pages over, but I've never attempted to do this and somehow merge it with another ASP.NET project during deployment.
Any thoughts? | 0 | [
2,
19583,
370,
28,
306,
9,
2328,
13,
20468,
9,
2328,
669,
20,
272,
5910,
13,
8,
29977,
102,
60,
800,
3726,
3726,
23,
699,
26,
109,
7501,
20,
29977,
102,
19583,
40,
370,
3149,
28,
306,
9,
2328,
13,
20468,
9,
2328,
669,
20,
272,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
unintentional pitch change using MS SAPI TTS
===
Has anyone else experienced (and possibly solved) unintentional pitch changes using MS SAPI TTS voices?
I'm using the SpVoice automation interface with SAPI 5.1.
Right now, my application (VB6 app) can get into a state where the TTS (Microsoft Anna) starts to sound like a chipmunk (proper rate, but high pitch) and even a reboot of Vista does not correct the issue.
I'm passing in XML to the Voice.Speak() function. I've tried sending < pitch absmiddle="0" /> before all other XML and it still does not correct the pitch issue. When I try the TTS voice preview in the Speech control panel, the voice has a normal pitch.
The issue has occurred for me in XP in the past, however a reboot seemed to correct it. | 0 | [
2,
367,
108,
1316,
3309,
192,
5678,
753,
568,
4235,
7508,
49,
13,
38,
38,
18,
800,
3726,
3726,
63,
1276,
962,
3882,
13,
5,
290,
2879,
15091,
6,
367,
108,
1316,
3309,
192,
5678,
1693,
568,
4235,
7508,
49,
13,
38,
38,
18,
5333,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Automated user research, what are good strategies?
===
I am producing an online system to integrate a number of other systems using sharepoint as a portal. I would like good logging built in so I can actually see what my users are doing (without invading their privacy!)
I would like to produce heat map overlays to see which links are being made, and intuitive reports of which pages are being used etc.
I suppose that Google analytics does this kind of thing, but are there other tools I could be using?
I perhaps can know a bit more about my users as they will all be authenticated against Active Directory to access the site. Does that change what I can or should use? | 0 | [
2,
14904,
4155,
527,
15,
98,
50,
254,
10272,
60,
800,
3726,
3726,
31,
589,
4081,
40,
2087,
329,
20,
18399,
21,
234,
16,
89,
1242,
568,
1891,
3132,
28,
21,
8281,
9,
31,
83,
101,
254,
13,
13919,
392,
19,
86,
31,
92,
1121,
196,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Switching an OSS project license from GPL to L-GPL on Sourceforge
===
Is that possible to switch an Open Source Project license from [GPL][1] to [LGPL v3][2] if I am the project originator/administrator ?
[1]: http://opensource.org/licenses/gpl-2.0.php
[2]: http://opensource.org/licenses/lgpl-3.0.html | 0 | [
2,
13027,
40,
19504,
669,
3962,
37,
489,
5727,
20,
644,
8,
263,
5727,
27,
1267,
1106,
834,
800,
3726,
3726,
25,
30,
938,
20,
5521,
40,
368,
1267,
669,
3962,
37,
636,
263,
5727,
500,
2558,
165,
500,
20,
636,
10641,
5727,
566,
240... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 CTRL-LEFTCLICK navigation on Ruby to work in IntelliJ 7?
===
In IntelliJ when editing Java files, this works for me. e.g. CTRL-LEFTCLICK on an identifier takes me to where that identifier is defined. For some reason it doesn't work when editing Ruby code. Any ideas? | 0 | [
2,
184,
107,
31,
164,
13,
4812,
6362,
8,
9742,
150,
10129,
8368,
27,
10811,
20,
170,
19,
19,
4213,
9999,
453,
60,
800,
3726,
3726,
19,
19,
4213,
9999,
76,
9510,
8247,
6488,
15,
48,
693,
26,
55,
9,
13,
62,
9,
263,
9,
13,
4812... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Stop SubText/FCKEditor messing up the HTML
===
I'm trying to put together a blog, and have gone with SubText and I've just installed SyntaxHighlighter but it doesn't seem to work properly. SubText or FCKEditor seems to tamper with the HTMl, inlineing everything in the pre tags and placing line-breaks at the end of each line.
Bad times!
Anyone know how to stop this? | 0 | [
2,
747,
972,
11969,
118,
410,
2601,
13401,
3957,
68,
71,
14,
13,
15895,
800,
3726,
3726,
31,
22,
79,
749,
20,
442,
429,
21,
8146,
15,
17,
57,
1042,
29,
972,
11969,
17,
31,
22,
195,
114,
4066,
22649,
4542,
3130,
106,
47,
32,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I present text vertically in a JLabel ? (Java 1.6)
===
I'm looking to have text display vertically, first letter at the bottom, last letter at the top, within a JLabel. Is this possible? | 0 | [
2,
184,
107,
31,
734,
1854,
23300,
19,
21,
487,
21018,
13,
60,
13,
5,
1004,
1385,
137,
9,
379,
6,
800,
3726,
3726,
31,
22,
79,
699,
20,
57,
1854,
3042,
23300,
15,
64,
1748,
35,
14,
2129,
15,
236,
1748,
35,
14,
371,
15,
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,
0,
0,
0,
0,
0,
0,
0,
0... |
What would be the best place to start learning AJAX (I have Perl as a backend)
===
I am currently developing a website using basic cgi to turn out pages. I would like the website to be changed to have a better (read dynamic) interface.
What techniques (if not AJAX) and/or tutorials would you recommend to get me started? | 0 | [
2,
98,
83,
44,
14,
246,
209,
20,
799,
2477,
20624,
13,
5,
49,
57,
416,
255,
28,
21,
97,
2451,
6,
800,
3726,
3726,
31,
589,
871,
3561,
21,
2271,
568,
2125,
272,
2234,
20,
805,
70,
4434,
9,
31,
83,
101,
14,
2271,
20,
44,
101... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WebDAV doesn't include BCC headers when retrieving mail
===
This seems to be intended behaviour as stated [here](http://blogs.msdn.com/webdav_101/archive/2008/04/24/why-can-t-webdav-read-bcc.aspx), but I can't believe the only method of getting the BCCs is to parse Outlook Web Access' HTML code.
Has anybody encountered the same limitation and found a workaround? I'd also be fine with getting the BCCs from somewhere via WebDAV and adding the header fields myself. | 0 | [
2,
2741,
43,
5214,
1437,
22,
38,
468,
2726,
150,
157,
445,
76,
13,
6239,
3272,
8397,
4216,
800,
3726,
3726,
48,
2206,
20,
44,
2081,
7727,
28,
1240,
636,
6836,
500,
5,
21127,
6903,
7091,
5447,
9,
79,
18,
43,
103,
9,
960,
118,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the linux equivalent to DOS pause?
===
I have a bash shell script in which I would like to pause execution until the user presses a key. In DOS, this is easily accomplished with the "pause" command. Is there a linux equivalent I can use in my script? | 0 | [
2,
98,
25,
14,
13024,
4602,
20,
107,
18,
6911,
60,
800,
3726,
3726,
31,
57,
21,
13158,
3593,
3884,
19,
56,
31,
83,
101,
20,
6911,
5769,
163,
14,
4155,
16527,
21,
1246,
9,
19,
107,
18,
15,
48,
25,
2351,
8812,
29,
14,
13,
7,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Effective Methods to Manage Digital Distraction
===
With the plethora of communication methods available to co-workers, how do you manage to keep distractions at bay for a large enough block of time to accomplish some focused programming?
Do you quit or close all communications, have you informed people that an away message really means you are a way, or something else? | 0 | [
2,
3140,
3195,
20,
4705,
1888,
14408,
800,
3726,
3726,
29,
14,
11375,
38,
13278,
16,
3291,
3195,
904,
20,
326,
8,
16355,
15,
184,
107,
42,
4705,
20,
643,
14408,
18,
35,
899,
26,
21,
370,
511,
1921,
16,
85,
20,
14570,
109,
2604,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Reverse Engineering for Database Diagramming in Visio with SQL Server 2008
===
I need to reverse engineer a **Microsoft SQL Server 2008** in order to create a **Microsoft Visio 2007 Database Model Diagram**. So I choose **Reverse Engineer** from the Database menu to connect to the DB.
I configured the Microsoft SQL Server Visio driver so that is uses SQL Server Native Client 10.0 as the ODBC driver. Afterwards I created a User DSN which connects to my DB. This DSN works (at least the provided test is successful). After clicking next in the Reverse Engineer Wizard, Visio kindly asks for my credentials which I properly provide, but after clicking OK I receive the following message:
> The currently selected Visio driver is not compatible with the data source.
I tried using the old SQL Server ODBC driver, by also reconfiguring the Visio driver of course. It does not work too. Any help would be cool!
Kind regards
Matthias | 0 | [
2,
7006,
1552,
26,
6018,
14161,
3863,
19,
9060,
1963,
29,
4444,
255,
8128,
570,
800,
3726,
3726,
31,
376,
20,
7006,
2335,
21,
13,
1409,
22019,
12980,
4444,
255,
8128,
570,
1409,
19,
389,
20,
1600,
21,
13,
1409,
22019,
12980,
9060,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Casting array of objects (which implement interface IFoo) to IFoo[] in C#
===
class A : IFoo
{
}
...
A[] arrayOfA = new A[10];
if(arrayOfA is IFoo[])
{
// this is not called
}
Q1: Why is arrayOfA not an array of IFoos?
Q2: Why can't I cast arrayOfA to IFoo[]
| 0 | [
2,
9087,
7718,
16,
3916,
13,
5,
2140,
8713,
6573,
100,
4328,
6,
20,
100,
4328,
2558,
500,
19,
272,
5910,
800,
3726,
3726,
718,
21,
13,
45,
100,
4328,
13,
1,
13,
1,
13,
9,
9,
9,
21,
2558,
500,
7718,
1041,
58,
800,
78,
21,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP .NET Deployment Model for a Live Site
===
I have recently inherited a brownfield application that is currently live. Through response, or a response with a link, how and what is the best method to make changes to a site and deploy them to a live ASP .NET website. | 0 | [
2,
28,
306,
13,
9,
2328,
10475,
1061,
26,
21,
515,
689,
800,
3726,
3726,
31,
57,
1989,
7179,
21,
886,
1109,
3010,
30,
25,
871,
515,
9,
120,
1627,
15,
54,
21,
1627,
29,
21,
3508,
15,
184,
17,
98,
25,
14,
246,
2109,
20,
233,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a list from a different site in SharePoint 3.0?
===
I have an announcements list on one site. I want to add it as a web part to the top of each subsite. How can I do this on wss 3.0? | 0 | [
2,
184,
107,
31,
275,
21,
968,
37,
21,
421,
689,
19,
1891,
3132,
203,
9,
387,
60,
800,
3726,
3726,
31,
57,
40,
7435,
18,
968,
27,
53,
689,
9,
31,
259,
20,
3547,
32,
28,
21,
2741,
141,
20,
14,
371,
16,
206,
972,
9097,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0... |
Is there a .NET function to validate a class name?
===
I am generating dynamic code based on user values. One of those values controls what the name of the class I'm generating is. I know I could sterilize the name based on language rules about valid class names using regular expressions, but I'd like to know if there is a specific method built into the framework to validate and/or sterilize a class name. | 0 | [
2,
25,
80,
21,
13,
9,
2328,
1990,
20,
7394,
1373,
21,
718,
204,
60,
800,
3726,
3726,
31,
589,
13500,
7782,
1797,
432,
27,
4155,
4070,
9,
53,
16,
273,
4070,
8671,
98,
14,
204,
16,
14,
718,
31,
22,
79,
13500,
25,
9,
31,
143,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Table Layout To Div
===
I'm implementing a comment control that uses an ASP.Repeater to display each comment. The comment itself is currently displayed using a table to divide up some images to display the comment in a bubble.
I know that tables are supposed to be the epitome of evil for design layout, and really expensive to display for the browser, but I'm not exactly sure how to put my rounded corners in the correct location and make sure everything lines up.
Does anyone have any suggestions, examples, hacks for the HTML/CSS required, or should I just stick with tables and hope for the best? | 0 | [
2,
19583,
859,
9106,
20,
13,
12916,
800,
3726,
3726,
31,
22,
79,
17333,
21,
6484,
569,
30,
2027,
40,
28,
306,
9,
99,
306,
9834,
20,
3042,
206,
6484,
9,
14,
6484,
1145,
25,
871,
6115,
568,
21,
859,
20,
8918,
71,
109,
3502,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I shrink an array in perl?
===
How do I make an array shorter in perl? I read some webpages indicating that I can assign:
$#ARRAY = 42;
I read that the use of $# is deprecated. I need a solution that will work for an array of arrays, too. This didn't work:
$#$ARRAY[$i] = 42; | 0 | [
2,
184,
107,
31,
16269,
40,
7718,
19,
416,
255,
60,
800,
3726,
3726,
184,
107,
31,
233,
40,
7718,
7622,
19,
416,
255,
60,
31,
1302,
109,
2741,
6486,
18,
7950,
30,
31,
92,
13952,
45,
5579,
5910,
8576,
93,
800,
4162,
73,
31,
130... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the differences between struct and class in C++
===
This question was [already asked in the context of C#/.Net][1].
Now I'd like to learn the differences between a struct and a class in (unmanaged) C++. Please discuss the technical differences as well as reasons for choosing one or the other in OO design.
I'll start with an obvious difference:
* If you don't specify `public:` or `private:`, members of a struct are public by default; members of a class are private by default.
I'm sure there are other differences to be found in the obscure corners of the C++ specification.
[1]: http://stackoverflow.com/questions/13049 | 0 | [
2,
98,
50,
14,
4921,
128,
13,
10346,
17,
718,
19,
272,
20512,
800,
3726,
3726,
48,
1301,
23,
636,
192,
15193,
411,
19,
14,
4141,
16,
272,
5910,
118,
9,
2328,
500,
2558,
165,
500,
9,
130,
31,
22,
43,
101,
20,
2484,
14,
4921,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Eventhandling in ascx usercontrols
===
What is best practises for communicating events from a usercontrol to parent control/page i want to do something similar to this:
MyPage.aspx:
<asp:Content ID="Content1" ContentPlaceHolderID="MainContentPlaceholder" runat="server">
<uc1:MyUserControl ID="MyUserControl1" runat="server"
OnSomeEvent="MyUserControl_OnSomeEvent" />
MyUserControl.ascx.cs:
public partial class MyUserControl: UserControl
{
public EventHandler SomeEvent;
....
private void OnSomething()
{
if (SomeEvent!= null)
SomeEvent(this, EventArgs.Empty);
}
Question is what is best practise?
| 0 | [
2,
807,
3203,
802,
19,
28,
150,
396,
4155,
12898,
18,
800,
3726,
3726,
98,
25,
246,
27954,
18,
26,
23284,
963,
37,
21,
4155,
12898,
20,
4766,
569,
118,
6486,
31,
259,
20,
107,
301,
835,
20,
48,
45,
51,
6486,
9,
472,
306,
396,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why Does Ruby Only Permit Certain Operator Overloading
===
In Ruby, like in many other OO programming languages, operators are overloadable. However, only certain character operators can be overloaded.
This list may be incomplete but, here are some of the operators that cannot be overloaded:
!, not, &&, and, ||, or
| 0 | [
2,
483,
630,
10811,
104,
8992,
1200,
6022,
84,
16866,
800,
3726,
3726,
19,
10811,
15,
101,
19,
151,
89,
13,
4328,
3143,
2556,
15,
9475,
50,
84,
8294,
579,
9,
207,
15,
104,
1200,
925,
9475,
92,
44,
84,
22546,
9,
48,
968,
123,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
NUnit vs Visual Studio 2008's Test Projects for Unit Testing?
===
I am going to be starting up a new project at work and want to get into unit testing. We will be using VS 2008, C#, and the ASP.NET MVC stuff. I am looking at using either NUnit or the built in test projects that VS2008 has, but I am open to researching other suggestions. Is one system better than the other or perhaps easier to use/understand than the other? I am looking to get this project set up as kind of the "best practice" for our development efforts going forward.
Thanks for any help and suggestions!! | 0 | [
2,
10210,
242,
4611,
3458,
1120,
570,
22,
18,
1289,
2314,
26,
1237,
4431,
60,
800,
3726,
3726,
31,
589,
228,
20,
44,
1422,
71,
21,
78,
669,
35,
170,
17,
259,
20,
164,
77,
1237,
4431,
9,
95,
129,
44,
568,
4611,
570,
15,
272,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What did you do to develop good code designing practices
===
I've been programming c++ for four years and java for two, I feel that I have a strong grasp of the languages them selves, although I'm no wizard in either. It seems that once I hit the 75% completion mark my code seems to be a god awful ball of spaghetti mess, sometimes to the point of unreadability. What have you done to produce good readable code? | 0 | [
2,
98,
144,
42,
107,
20,
2803,
254,
1797,
15026,
5242,
800,
3726,
3726,
31,
22,
195,
74,
3143,
272,
20512,
26,
222,
122,
17,
8247,
26,
81,
15,
31,
583,
30,
31,
57,
21,
966,
10677,
16,
14,
2556,
105,
6254,
195,
18,
15,
419,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.