unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Most common examples of misuse of singleton class
===
When should you NOT use a singleton class although it might be very tempting to do so? It would be very nice if we had a list of most common instances of 'singletonitis' that whe should take care to avoid. | 0 | [
2,
127,
757,
3770,
16,
27519,
16,
345,
444,
718,
800,
3726,
3726,
76,
378,
42,
52,
275,
21,
345,
444,
718,
419,
32,
530,
44,
253,
25349,
20,
107,
86,
60,
32,
83,
44,
253,
2210,
100,
95,
41,
21,
968,
16,
127,
757,
13946,
16,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0... |
Classic asp - When to use Response.flush?
===
We have a painfully slow report.I added a Response.flush and it seems a great deal better. What are some of the caveats of using this method. | 0 | [
2,
2732,
28,
306,
13,
8,
76,
20,
275,
1627,
9,
12848,
1635,
60,
800,
3726,
3726,
95,
57,
21,
19840,
2276,
1330,
9,
49,
905,
21,
1627,
9,
12848,
1635,
17,
32,
2206,
21,
374,
1183,
574,
9,
98,
50,
109,
16,
14,
3542,
721,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Would performance suffer using autoload in php and searching for the class file?
===
I've always struggled with how to best include classes into my php code. Pathing is usually an issue but a few minutes ago i found [this question][1] which dramatically helps that. Now I'm reading about __autoload and thinking that it could make the process of developing my applications much easier. The problem is i like to maintain folder structure to separate areas of functionality as opposed to throwing everything into a general /lib folder. So if i override autoload to do a deep search of a class folder including all subfolders, what performance hits can i expect?
Obviously this will depend on scale, depth of the folder structure and number of classes but generally I'm asking on a medium scale project will it cause problems.
[1]: http://stackoverflow.com/questions/4369/how-to-include-php-files-that-require-an-absolute-path | 0 | [
2,
83,
956,
6586,
568,
3108,
8294,
19,
13,
26120,
17,
5792,
26,
14,
718,
3893,
60,
800,
3726,
3726,
31,
22,
195,
550,
6076,
29,
184,
20,
246,
468,
2684,
77,
51,
13,
26120,
1797,
9,
2013,
68,
25,
951,
40,
1513,
47,
21,
310,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I make a WPF data template fill the entire width of the listbox?
===
I have a listbox data template in WPF. I want one item to be tight against the left side of the listbox and another item to be tight against the right side, but I can't figure out how to do this.
So far I have a grid with three columns, the left and right ones have content and the center is a placeholder with it's width set to "*". Where am I going wrong? | 0 | [
2,
184,
107,
31,
233,
21,
619,
7721,
1054,
22894,
3509,
14,
1078,
9456,
16,
14,
968,
5309,
60,
800,
3726,
3726,
31,
57,
21,
968,
5309,
1054,
22894,
19,
619,
7721,
9,
31,
259,
53,
9101,
20,
44,
2618,
149,
14,
225,
270,
16,
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 can I build Slickedit tags on command line?
===
I want to be able to generate slickedit tags on the commmand line, as soon as I sync a project from revision control - so via a script. Any way to do this? | 0 | [
2,
184,
92,
31,
1895,
12544,
69,
242,
3383,
18,
27,
1202,
293,
60,
800,
3726,
3726,
31,
259,
20,
44,
777,
20,
7920,
12544,
69,
242,
3383,
18,
27,
14,
11951,
177,
43,
293,
15,
28,
651,
28,
31,
6063,
150,
21,
669,
37,
11323,
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,
0,
0,
0... |
What is the best reason for unit testing?
===
There's a lot of discussion about unit testing these days. Here's a poll for the best reason to do it.
ONLY ONE REASON PER ANSWER PLEASE! | 0 | [
2,
98,
25,
14,
246,
1215,
26,
1237,
4431,
60,
800,
3726,
3726,
80,
22,
18,
21,
865,
16,
5460,
88,
1237,
4431,
158,
509,
9,
235,
22,
18,
21,
4994,
26,
14,
246,
1215,
20,
107,
32,
9,
104,
53,
1215,
416,
1623,
2247,
187,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How can I design an ASP.NET website delaying the style/theme?
===
I need to build a prototype for an intranet website, and I want to focus on usability (layout, navigability, etc) and leave the theme for later (I have very bad taste, so this will probably be done by someone else)
I know about ASP.NET's capability of switching themes instantly, but how do I have to design the WebForms for it to be easy later?
- Should I create controls with a class attribute pointing to something that will exist in the future css?
- Do I simply create the controls without worrying about this and it'll be handled easily when we create the theme? | 0 | [
2,
184,
92,
31,
704,
40,
28,
306,
9,
2328,
2271,
7255,
68,
14,
1034,
118,
124,
790,
60,
800,
3726,
3726,
31,
376,
20,
1895,
21,
7063,
26,
40,
14369,
2328,
2271,
15,
17,
31,
259,
20,
1776,
27,
182,
4091,
13,
5,
4414,
1320,
15... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
GPL software in debug only closed source applications
===
Do the terms of the GPL apply to an application if the open-sourced code it incorperates only exists in ***debug*** (internal-use only) versions of the software?
For example, I take a GPL unit testing framework and build that into my closed source application. I conditionally include this code ONLY in a special build of the software used internally. For distributed binary versions, this code is ignored. (you know, #ifdef-ed away).
| 0 | [
2,
489,
5727,
2306,
19,
121,
16254,
104,
827,
1267,
3767,
800,
3726,
3726,
107,
14,
1663,
16,
14,
489,
5727,
5645,
20,
40,
3010,
100,
14,
368,
8,
12097,
43,
1797,
32,
19,
10365,
106,
7759,
104,
5636,
19,
8980,
546,
16254,
2483,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Rails and Flex
===
Any thoughts on using Flex to build an RIA for administering a complex rails app.
We are starting to find it difficult using ajax to keep our admin section intuitive and easy for users to work with.
Would welcome any advise or suggestions you all may have
Thanks
Dom | 0 | [
2,
2240,
18,
17,
14409,
800,
3726,
3726,
186,
3064,
27,
568,
14409,
20,
1895,
40,
13,
2548,
26,
14839,
68,
21,
1502,
2240,
18,
4865,
9,
95,
50,
1422,
20,
477,
32,
1956,
568,
20624,
20,
643,
318,
21,
43,
2160,
1050,
13,
24392,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 alternatives exist to UML to graphically represent software models
===
Excluding UML, What other formal methodologies exist to visually represent software models?
Do you know any tools that allow you to work with them? | 0 | [
2,
98,
2676,
18,
3182,
20,
13,
723,
255,
20,
21755,
102,
3501,
2306,
2761,
800,
3726,
3726,
13,
14938,
13,
723,
255,
15,
98,
89,
3337,
2109,
13331,
18,
3182,
20,
20747,
3501,
2306,
2761,
60,
107,
42,
143,
186,
4672,
30,
1655,
42... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Do you use a code profiler?
===
Do you use a code profiler? if so, Why? What's your favorite? If not, is there a particular reason you don't? | 0 | [
2,
107,
42,
275,
21,
1797,
5296,
139,
60,
800,
3726,
3726,
107,
42,
275,
21,
1797,
5296,
139,
60,
100,
86,
15,
483,
60,
98,
22,
18,
154,
3839,
60,
100,
52,
15,
25,
80,
21,
1498,
1215,
42,
221,
22,
38,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How do I use reflection to invoke a private method in C#?
===
There are a group of private methods in my class, and I need to call one dynamically based on an input value. Both the invoking code and the target methods are in the same instance. The code looks like this:
MethodInfo dynMethod = this.GetType().GetMethod("Draw_" + itemType);
dynMethod.Invoke(this, new object[] { methodParams });
In this case, `GetMethod()` will not return private methods. What `BindingFlags` do I need to supply to `GetMethod()` so that it can locate private methods? | 0 | [
2,
184,
107,
31,
275,
9138,
20,
28371,
21,
932,
2109,
19,
272,
5910,
60,
800,
3726,
3726,
80,
50,
21,
214,
16,
932,
3195,
19,
51,
718,
15,
17,
31,
376,
20,
645,
53,
7782,
1326,
432,
27,
40,
6367,
1923,
9,
156,
14,
19,
2625,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 check to see if an object has an attribute in Javascript?
===
So:
x = {'key': 1};
if x.hasOwnProperty('key') {
//do this
}
Is that the best way to do that?
| 0 | [
2,
184,
107,
31,
2631,
20,
196,
100,
40,
3095,
63,
40,
35,
14755,
19,
8247,
8741,
60,
800,
3726,
3726,
86,
45,
993,
800,
13,
1,
22,
4237,
22,
45,
137,
1,
73,
100,
993,
9,
6482,
16620,
10890,
106,
1084,
5,
22,
4237,
22,
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... |
Can I use a List<T> as a collection of method pointers? (C#)
===
I want to create a list of methods to execute. Each method has the same signature.
I thought about putting delegates in a generic collection, but I keep getting this error:
>'method' is a 'variable' but is used like a 'method'
In theory, here is what I would like to do:
List<object> methodsToExecute;
int Add(int x, int y)
{ return x+y; }
int Subtract(int x, int y)
{ return x-y; }
delegate int BinaryOp(int x, int y);
methodsToExecute.add(new BinaryOp(add));
methodsToExecute.add(new BinaryOp(subtract));
foreach(object method in methodsToExecute)
{
method(1,2);
}
Any ideas on how to accomplish this?
Thanks! | 0 | [
2,
92,
31,
275,
21,
968,
1,
38,
1,
28,
21,
1206,
16,
2109,
454,
445,
60,
13,
5,
150,
5910,
6,
800,
3726,
3726,
31,
259,
20,
1600,
21,
968,
16,
3195,
20,
15644,
9,
206,
2109,
63,
14,
205,
7810,
9,
31,
289,
88,
3873,
10845,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Will pthread_detach manage my memory for me?
===
Suppose I have the following code:
while(TRUE) {
pthread_t *thread = (pthread_t *) malloc(sizeof(pthread_t));
pthread_create(thread, NULL, someFunction, someArgument);
pthread_detach(*thread);
sleep(10);
}
Will the detached thread free the memory allocated by malloc, or is that something I now have to do? | 0 | [
2,
129,
351,
96,
10647,
1,
546,
38,
3211,
4705,
51,
1912,
26,
55,
60,
800,
3726,
3726,
5787,
31,
57,
14,
249,
1797,
45,
133,
5,
13398,
6,
13,
1,
351,
96,
10647,
1,
38,
1637,
96,
10647,
800,
13,
5,
306,
96,
10647,
1,
38,
16... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What happens when you try to free() already freed memory in c?
===
For example:
char * myString = malloc(sizeof(char)*STRING_BUFFER_SIZE);
free(myString);
free(myString);
Are there any adverse side effects of doing this? | 0 | [
2,
98,
5531,
76,
42,
1131,
20,
551,
5,
6,
614,
9292,
1912,
19,
272,
60,
800,
3726,
3726,
26,
823,
45,
4892,
1637,
51,
11130,
800,
3668,
2499,
5,
10454,
1041,
5,
5433,
6,
2483,
11130,
1,
2345,
6866,
1,
10454,
6,
73,
551,
5,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you measure the progress of a web service call?
===
I have an ASP.NET web service which does some heavy lifting, like say,some file operations, or generating Excel Sheets from a bunch of crystal reports. I don't want to be blocked by calling this web service, so i want to make the web service call asynchronous. Also, I want to call this web service from a web page, and want some mechanism which will allow me to keep polling the server so that i can i can show some indicator of progress on the screen, like say, the number of files that have been processed. Please note that i do not want a notification on completion of the web method call, rather, i want a live progress status. How do i go about it?
| 0 | [
2,
184,
107,
42,
4058,
14,
3455,
16,
21,
2741,
365,
645,
60,
800,
3726,
3726,
31,
57,
40,
28,
306,
9,
2328,
2741,
365,
56,
630,
109,
1278,
8855,
15,
101,
395,
15,
3220,
3893,
1311,
15,
54,
13500,
20700,
8801,
37,
21,
7653,
16,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Sharepoint: Deploy Custom Lists and New Columns in lists
===
I've created a custom list & also added a column in the Announcement List. Question is, how can I include those newly created items when I create a fresh Web Application (like a script, feature or something)?
TIA! | 0 | [
2,
1891,
3132,
45,
17617,
5816,
7227,
17,
78,
7498,
19,
7227,
800,
3726,
3726,
31,
22,
195,
679,
21,
5816,
968,
279,
67,
905,
21,
4698,
19,
14,
7435,
968,
9,
1301,
25,
15,
184,
92,
31,
468,
273,
2771,
679,
3755,
76,
31,
1600,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using WPF, what is the best method to update the background for a custom button control?
===
In WPF, we are creating custom controls that inherit from button with completely drawn-from-scratch xaml graphics. We have a border around the entire button xaml and we'd like to use that as the location for updating the background when MouseOver=True in a trigger. What we need to know is how do we update the background of the border in this button with a gradient when the mouse hovers over it?
| 0 | [
2,
568,
619,
7721,
15,
98,
25,
14,
246,
2109,
20,
11100,
14,
2395,
26,
21,
5816,
5167,
569,
60,
800,
3726,
3726,
19,
619,
7721,
15,
95,
50,
2936,
5816,
8671,
30,
17569,
37,
5167,
29,
1524,
3160,
8,
2665,
8,
18,
7519,
9744,
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... |
In Access 2003, problem with a memo field if and only if there is a filter on the PK and a sub query is joined.
===
I have a problem in a query in Acess 2003 (SP3).
I have a query that include some tables and a sub query. All the sub query and the tables are all joined to a main table. The query use somme aggregate function and there is an HAVING clause that filter the result on the primary key (PK).
In theses conditions, a memo field of the main table is not displayed properly. two garbages characters, never the sames, are displayed instead of the content of the field.
Now what is weird is that if I remove the HAVING clause or if I use it to filter on something else than the PK the field is displayed correctly. If I remove the sub query from the query the field is also displayed correctly even if there is still a filter (HAVING clause) on the PK.
Is this a bug in Access (I think it is)? If so, do someone know of a workaround for this bug? | 0 | [
2,
19,
1381,
973,
15,
1448,
29,
21,
22236,
575,
100,
17,
104,
100,
80,
25,
21,
11945,
27,
14,
13,
17244,
17,
21,
972,
25597,
25,
670,
9,
800,
3726,
3726,
31,
57,
21,
1448,
19,
21,
25597,
19,
21,
5052,
18,
973,
13,
5,
3401,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Will my index be used if all columns are not used?
===
I have an index on columns A, B, C, D of table T
I have a query that pulls from T with A, B, C in the WHERE clause.
Will the index be used or will a separate index be needed that only includes A, B, C? | 0 | [
2,
129,
51,
4348,
44,
147,
100,
65,
7498,
50,
52,
147,
60,
800,
3726,
3726,
31,
57,
40,
4348,
27,
7498,
21,
15,
334,
15,
272,
15,
13,
43,
16,
859,
13,
38,
31,
57,
21,
25597,
30,
8071,
37,
13,
38,
29,
21,
15,
334,
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... |
MS CRM Development Projects
===
The shop that I am working part time with is new to Microsoft CRM. I just want to survey what projects have developers done to the system to extend its capabilities. | 0 | [
2,
4235,
6186,
79,
522,
2314,
800,
3726,
3726,
14,
2546,
30,
31,
589,
638,
141,
85,
29,
25,
78,
20,
7099,
6186,
79,
9,
31,
114,
259,
20,
3431,
98,
2314,
57,
10168,
677,
20,
14,
329,
20,
7206,
82,
10209,
9,
3,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How would you easily validate a JSP option pick list?
===
I need to validate this simple pick list:
<select name="<%= key %>">
<option value="ETC" SELECTED>Select an option...</option>
<option value="ONE">Lorem ipsum</option>
<option value="TWO">dolor sit amet</option>
</select>
So the user would never submit the form with the, excuse the repetition, "Select an option..." option selected. In principle I'm not allowed to use JavaScript so the solution should be implemented in JSP. | 0 | [
2,
184,
83,
42,
2351,
7394,
1373,
21,
487,
3401,
4255,
2036,
968,
60,
800,
3726,
3726,
31,
376,
20,
7394,
1373,
48,
1935,
2036,
968,
45,
13,
1,
18,
16964,
204,
3726,
7,
1,
11881,
3726,
1246,
13,
11881,
1,
7,
1,
13,
1,
2594,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 benefits of OO programming? Will it help me write better code?
===
I'm a PHPer, and am not writing object orientated code.
What are the advantages of OO over procedural code, and where can I learn how to apply these ideas to PHP? | 4 | [
2,
98,
50,
14,
5800,
16,
13,
4328,
3143,
60,
129,
32,
448,
55,
2757,
574,
1797,
60,
800,
3726,
3726,
31,
22,
79,
21,
4145,
1432,
15,
17,
589,
52,
1174,
3095,
13,
9712,
1669,
1797,
9,
98,
50,
14,
14683,
16,
13,
4328,
84,
2642... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 place to Sort a List of Tasks
===
Im building a web application which is a process management app. Several different employee types will be shown a list of Tasks to do and as each one completes a task then it is moved on to the next employee to work on.
The Task hierarchy is Batch > Load > Assembly > Part > Task. There are currently 8 rules for determining which Task should be worked on first for each Employee type. These rules apply to size of part, and also how that parts completion will affect the Hierarchy e.g if part A is completed then it completes an entire Batch where as Part B will not as there are still other parts remaining in its Batch to be completed.
Anyway that's the elevator pitch of how the system works. What i am trying to figure out is an efficient, fast and maintainable way of doing this bearing in mind the rules might change and more rules may be added.
Initially I was intending to let the DB (sql 2005) do all the heavy lifting but i have a worry that the more complicated rules will be difficult to implement with a DB. So an alternative is to pull out a list of Tasks into a middle tier and create a Collection of objects and the apply each of the rules to the Collection. I have no doubt that each rule could be translated to T-SQL in isolation but ordering by up to 8 criteria depending on the task type feels like a lot of hassle.
One benefit i can see with the the middle tier approach is that i can create a more loosely restricted system where Task flow can be changed, that would be more difficult in the DB i think.
So what would you guys recommend? Is there a third alternative i haven't thought of ? | 0 | [
2,
246,
209,
20,
2058,
21,
968,
16,
8674,
800,
3726,
3726,
797,
353,
21,
2741,
3010,
56,
25,
21,
953,
1097,
4865,
9,
238,
421,
7362,
2551,
129,
44,
1721,
21,
968,
16,
8674,
20,
107,
17,
28,
206,
53,
1279,
18,
21,
3005,
94,
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... |
How can I repair "upgraded" subversion working directories?
===
It may sound stupid, but sometimes I run into version conflicts between two versions of subversion. I mount a directory on a development server with sshfs and then edit the code with my local Vim. For subversion stuff like updating, committing etc. I ssh on the server and do it there. However, sometimes I mix up my shells and accidently do an update or commit in my local shell in the mounted directory. Subversion exits with an error, which is fine. However, when I try to do the same thing on the development server in my ssh session, subversion says that the working directory/subversion has a wrong version. The subversion version on the server is older than the version on my notebook, so I guess my (newer) version somehow upgrades the working directories so they are incompatible with the old version on the development server. Sometimes deleting the .svn/lock files helps, but only if I do it right after I executed the subversion command on my notebook. When I execute the command on the development server afterwards, the lock files disappear and I don't see a way to rescue the checkout. This wouldn't be so bad if the repository wasn't that big. Especially when I made lots of changes and can't commit them.
The only solution I see at the moment is to copy the files I changed somewhere, remove the checkout, do a complete new checkout and copy the files back.
Is there a better solution to rescue a broken checkout and/or my changes? | 0 | [
2,
184,
92,
31,
5612,
13,
7,
576,
8031,
43,
7,
972,
10898,
638,
559,
1596,
60,
800,
3726,
3726,
32,
123,
646,
3553,
15,
47,
1030,
31,
485,
77,
615,
10344,
128,
81,
3281,
16,
972,
10898,
9,
31,
2149,
21,
16755,
27,
21,
522,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I interpret error codes from FrontPage Extensions?
===
I'm using front page extensions to interact with SharePoint Services 3.0 as described [here][1].
In most samples I have seen the client simply looks for particular English strings in the result and uses that to determine if an error has occurred. However, I am writing an application which may be widely deployed and put on non-English language SharePoint servers so I would like to use the returned error codes instead.
Unfortunately, the documentation for the error codes is [very poorly defined][2]. It contains such gems as:
> Although many RPC protocol methods have unique error messages, most rely on a standard error message format to relay information if a method fails to complete properly.
Hrm, what would be this "standard error message format"...
and
> The status is the error code from
> FrontPage Server Extensions for the
> condition encountered. osstatus is the
> error code from the operating system..
also sadly entertaining:
> In general, the codes are integer
> values and the messages are text
> strings that summarize the error.
but nowhere is a table which describes the possible content of these errors to be found.
It seems likely to me that the OS error code would be an HRESULT but I have no idea what to look for in terms of potential sources for SharePoint error codes. My only clue is that status=589826 seems to indicate that a file already exists.
[1]: http://msdn.microsoft.com/en-us/library/ms443099.aspx
[2]: http://msdn.microsoft.com/en-us/library/ms433540.aspx | 0 | [
2,
184,
107,
31,
11584,
7019,
11358,
37,
431,
6486,
17529,
60,
800,
3726,
3726,
31,
22,
79,
568,
431,
2478,
17529,
20,
10001,
29,
1891,
3132,
687,
203,
9,
387,
28,
745,
636,
6836,
500,
2558,
165,
500,
9,
19,
127,
7855,
31,
57,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to change settings for a Visual Studio 2005 Deployment Project
===
I have a project containing at least one DLL along with the executable output. I have added a Deployment Project to this solution, which asked me for a name and working directory upon creation like all projects.
I named this "MyProduc_Installer" and have been able to modify all aspects of the installation process except for changing the name of the installer itself. Throughout the install process, the user sees messages like "Welcome to the MyProduct_Installer Installer." Even in the Add/Remove Programs list, this is the application's ill conceived title.
How do I change this setting? I have tried right click/properties, as well as all the View options. I couldn't find anything in the assembly information for the executable project, or solution properties.
| 0 | [
2,
184,
20,
753,
12410,
26,
21,
3458,
1120,
812,
10475,
669,
800,
3726,
3726,
31,
57,
21,
669,
3503,
35,
639,
53,
13,
43,
211,
303,
29,
14,
1396,
17194,
5924,
5196,
9,
31,
57,
905,
21,
10475,
669,
20,
48,
4295,
15,
56,
411,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ho do you decide if a QA issue is a defect?
===
I've worked for several companies as a developer and have recently moved into QA automation at a new company. Each company is different and I have yet to see a way of handling this that I really like. All too often QA will say something is an issue and the response is either "well ya but it would be too hard and take too long to fix" or "it's not a bug, it's a feature!".<br>
Has anyone found a reasonable way to determine if something that QA says is a bug needs to be fixed or not? | 0 | [
2,
2189,
107,
42,
4073,
100,
21,
7234,
1513,
25,
21,
18929,
60,
800,
3726,
3726,
31,
22,
195,
577,
26,
238,
1532,
28,
21,
10058,
17,
57,
1989,
385,
77,
7234,
23217,
35,
21,
78,
237,
9,
206,
237,
25,
421,
17,
31,
57,
768,
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... |
Tips for budgeting QA hours
===
Sometimes for QA it gets difficult to budget and track the QA hours as a person can spend enormous amount of time retesting the defects and performing regression if any. We can take an example of web application with 50 use cases. | 0 | [
2,
11034,
26,
3391,
68,
7234,
974,
800,
3726,
3726,
1030,
26,
7234,
32,
3049,
1956,
20,
3391,
17,
792,
14,
7234,
974,
28,
21,
840,
92,
3256,
7135,
2006,
16,
85,
302,
10543,
68,
14,
21747,
17,
2955,
27369,
100,
186,
9,
95,
92,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0... |
How can I track the sales rank of an item on Amazon programatically?
===
I've seen several products that will track the sales rank of an item on Amazon. Does Amazon have any web-services published that I can use to get the sales rank of a particular item?
I've looked through the AWS and didn't see anything of that nature. | 0 | [
2,
184,
92,
31,
792,
14,
2598,
2839,
16,
40,
9101,
27,
8059,
625,
721,
8438,
60,
800,
3726,
3726,
31,
22,
195,
541,
238,
1985,
30,
129,
792,
14,
2598,
2839,
16,
40,
9101,
27,
8059,
9,
630,
8059,
57,
186,
2741,
8,
11449,
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... |
Reproducing the blocked exe "unblock" option in file properties in windows 2003.
===
When I download my program from my website to my windows 2003 machine, it has a block on it and you have to right click on the exe, then properties, then select the button "Unblock".
I would like to add detection in my installer for when the file is blocked and hence doesn't have enough permissions.
But I can't eaisly reproduce getting my exe in this state where it needs to be unblocked.
How can I get the unblock to appear on my exe so I can test this functionality? | 0 | [
2,
302,
22067,
14,
8388,
1396,
62,
13,
7,
1020,
12048,
7,
4255,
19,
3893,
3704,
19,
1936,
973,
9,
800,
3726,
3726,
76,
31,
7121,
51,
625,
37,
51,
2271,
20,
51,
1936,
973,
1940,
15,
32,
63,
21,
1921,
27,
32,
17,
42,
57,
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... |
I would like to develop an application with SproutCore. Other than the official documentation, is there anywhere else I can learn more?
===
The official documentation seems to be light on explanations of 'how to understand the sproutcore way' eg, why things are done the way they are, how to intuit what to do from where you're at... | 0 | [
2,
31,
83,
101,
20,
2803,
40,
3010,
29,
22461,
10375,
9,
89,
119,
14,
989,
13945,
15,
25,
80,
4922,
962,
31,
92,
2484,
91,
60,
800,
3726,
3726,
14,
989,
13945,
2206,
20,
44,
471,
27,
5764,
18,
16,
13,
22,
1544,
20,
1369,
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... |
What's the difference between a midlet and a corelet?
===
It's my understanding that a corelet is a Motorola-ism, but does anyone know what the difference is? Do corelets have certain abilities that midlets don't? | 0 | [
2,
98,
22,
18,
14,
2841,
128,
21,
907,
1336,
17,
21,
2884,
1336,
60,
800,
3726,
3726,
32,
22,
18,
51,
3260,
30,
21,
2884,
1336,
25,
21,
2586,
2268,
8,
756,
15,
47,
630,
1276,
143,
98,
14,
2841,
25,
60,
107,
2884,
11045,
57,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0... |
Are nonmember nonfriend functions really worth it?
===
In the (otherwise) excellent book [C++ Coding Standards][1], Item 44, titled **"Prefer writing nonmember nonfriend functions"**, Sutter and Alexandrescu recommend that only functions that really need access to the members of a class be themselves members of that class. All other operations which can be written by using only member functions should not be part of the class. They should be nonmembers and nonfriends. The arguments are that:
* It promotes encapsulation, because there is less code that needs access to the internals of a class.
* It makes writing function templates easier, because you don't have to guess each time whether some function is a member or not.
* It keeps the class small, which in turn makes it easier to test and maintain.
Although I see the value in these argument, I see a huge drawback: **my IDE can't help me find these functions!** Whenever I have an object of some kind, and I want to see what operations are available on it, I can't just type "`pMysteriousObject->`" and get a list of member functions anymore.
Keeping a clean design is in the end about making your programming life easier. But this would actually make mine much harder.
So I'm wondering if it's really worth the trouble. **How do you deal with that?**
[1]: http://www.gotw.ca/publications/c++cs.htm | 0 | [
2,
50,
538,
6990,
538,
12299,
3719,
510,
2715,
32,
60,
800,
3726,
3726,
19,
14,
13,
5,
9539,
10474,
6,
5977,
360,
636,
150,
20512,
13,
15458,
3364,
500,
2558,
165,
500,
15,
9101,
4576,
15,
3008,
13,
1409,
7,
3515,
2407,
1174,
53... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are some interesting, small Linux kernel projects to help learn the source?
===
What small projects would you suggest to a novice with the kernel, but someone who has plenty of systems and C experience? The aim is to develop a familiarity with the kernel source code, and a facility for experimentation with crazy ideas.
I'm trying to think of some manageable small tasks (for example, add a syscall), but what would you suggest? For a target audience think someone who has at least an undergraduate OS course under their belt. | 0 | [
2,
98,
50,
109,
4883,
15,
284,
13024,
17007,
2314,
20,
448,
2484,
14,
1267,
60,
800,
3726,
3726,
98,
284,
2314,
83,
42,
5601,
20,
21,
21999,
29,
14,
17007,
15,
47,
737,
72,
63,
7062,
16,
1242,
17,
272,
1496,
60,
14,
5226,
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... |
how to add a simple message to a php-gtk statusbar?
===
I have a simple GtkStatusBar created with glade,and want to add a simple message with the date of the last update of the database (just a simple and plain date).
I don't want to use the whole stacks, context and all the other things that gtk developers put on the statusbar code.
(I could simply use a label but I would like to keep the drag bar).
I'm using Gtk 2.0.1 with php 5.2.6; | 0 | [
2,
184,
20,
3547,
21,
1935,
2802,
20,
21,
13,
26120,
8,
263,
38,
197,
1782,
1850,
60,
800,
3726,
3726,
31,
57,
21,
1935,
9509,
197,
10631,
267,
1850,
679,
29,
3539,
62,
15,
290,
259,
20,
3547,
21,
1935,
2802,
29,
14,
1231,
16,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Learning Unit Testing
===
So I've put this off for a good long time and I think it's time to stop procrastinating. I need to learn how to do unit testing, but I don't know where to start! Does anyone have any good, preferably online, resources on the subject? | 0 | [
2,
2477,
1237,
4431,
800,
3726,
3726,
86,
31,
22,
195,
442,
48,
168,
26,
21,
254,
175,
85,
17,
31,
277,
32,
22,
18,
85,
20,
747,
895,
7519,
18,
2864,
1880,
9,
31,
376,
20,
2484,
184,
20,
107,
1237,
4431,
15,
47,
31,
221,
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... |
Differnce between drop table and truncate table?
===
I have some tables that I build as a part of my report rollup. I don't need them afterwards at all. Someone mentioned to truncate them as it would be faster. | 0 | [
2,
11394,
6175,
128,
2804,
859,
17,
22328,
62,
859,
60,
800,
3726,
3726,
31,
57,
109,
7484,
30,
31,
1895,
28,
21,
141,
16,
51,
1330,
3001,
576,
9,
31,
221,
22,
38,
376,
105,
4601,
35,
65,
9,
737,
2211,
20,
22328,
62,
105,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Tool to identify unused css definitions
===
Are there any good tools to help identify unused css definitions in project? A bunch of css files were pulled in and now I'm trying to clean things up a bit. | 0 | [
2,
5607,
20,
5808,
18927,
272,
18,
18,
18544,
800,
3726,
3726,
50,
80,
186,
254,
4672,
20,
448,
5808,
18927,
272,
18,
18,
18544,
19,
669,
60,
21,
7653,
16,
272,
18,
18,
6488,
46,
881,
19,
17,
130,
31,
22,
79,
749,
20,
2745,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Pros and Cons of Global.asax
===
Let's collect some tips for evaluating the appropriate use of global.asax.
(also, the [**global.asax tag**][1] is broken)
[1]: http://stackoverflow.com/questions/tagged/global.asax | 0 | [
2,
895,
18,
17,
11608,
16,
2062,
9,
8588,
396,
800,
3726,
3726,
408,
22,
18,
5543,
109,
11034,
26,
26764,
14,
4593,
275,
16,
2062,
9,
8588,
396,
9,
13,
5,
2573,
15,
14,
636,
1409,
26763,
9,
8588,
396,
3383,
1409,
500,
2558,
16... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How many bytes per element are there in a Python list (tuple)?
===
For example, how much memory is required to store a list of one million (32-bit) integers?
alist = range(1000000) # or list(range(1000000)) in Python 3.0 | 0 | [
2,
184,
151,
34,
3231,
416,
4520,
50,
80,
19,
21,
20059,
968,
13,
5,
2473,
5106,
6,
60,
800,
3726,
3726,
26,
823,
15,
184,
212,
1912,
25,
1390,
20,
1718,
21,
968,
16,
53,
507,
13,
5,
3125,
8,
3326,
6,
13820,
18,
60,
21,
57... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Structure of projects in version control - .NET specific
===
This post is similar to [this previously asked question.][1] I really want to set up my SVN repository in TTB format, but when creating a project in Visual Studio 2008 (ASP.NET/VB.NET), the structure created tends to be incompatible when considering the solution file, project files, folders for projects, multiple projects within solutions, etc. Does anyone have a script or procedure to take a newly created ASP.NET project and move it to a TTB format as painlessly as possible?
[1]: http://stackoverflow.com/questions/16829/structure-of-projects-in-version-control | 0 | [
2,
1411,
16,
2314,
19,
615,
569,
13,
8,
13,
9,
2328,
1903,
800,
3726,
3726,
48,
678,
25,
835,
20,
636,
1565,
1343,
411,
1301,
9,
500,
2558,
165,
500,
31,
510,
259,
20,
309,
71,
51,
13,
18,
16578,
24869,
19,
13,
38,
11872,
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... |
Setting environment variables in OS X?
===
What is the proper way to modify environment variables like PATH in OS X? I've looked on google a little bit and found 3 different files to edit:
* /etc/paths
* ~/.profile
* ~/.tcshrc
I don't even have some of these, and I'm pretty sure that .tcshrc is wrong, since osx uses bash now. Anybody have any idea where these variables, especially PATH, are defined?
Edit: I'm running OS X 10.5 | 0 | [
2,
2697,
2307,
12157,
19,
13,
759,
993,
60,
800,
3726,
3726,
98,
25,
14,
4119,
161,
20,
17579,
2307,
12157,
101,
2013,
19,
13,
759,
993,
60,
31,
22,
195,
292,
27,
8144,
21,
265,
1142,
17,
216,
203,
421,
6488,
20,
9392,
45,
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... |
Can you have too many stored procedures?
===
Is there such a thing as too many stored procedure. I know there is not a limit to the number you can have but is this any performance or architectural reason not to create hundreds, thousands?? | 0 | [
2,
92,
42,
57,
266,
151,
8214,
8876,
60,
800,
3726,
3726,
25,
80,
145,
21,
584,
28,
266,
151,
8214,
7004,
9,
31,
143,
80,
25,
52,
21,
4496,
20,
14,
234,
42,
92,
57,
47,
25,
48,
186,
956,
54,
5350,
1215,
52,
20,
1600,
4541,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What are the different types of indexes, what are the benefits of each?
===
What are the different types of indexes, what are the benefits of each?
I heard of covering and clustered indexes, are there more? Where would you use them? | 0 | [
2,
98,
50,
14,
421,
2551,
16,
4348,
160,
15,
98,
50,
14,
5800,
16,
206,
60,
800,
3726,
3726,
98,
50,
14,
421,
2551,
16,
4348,
160,
15,
98,
50,
14,
5800,
16,
206,
60,
31,
752,
16,
3846,
17,
7460,
69,
4348,
160,
15,
50,
80,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0... |
Page down and Page up in Emacs
===
I am trying to learn Emacs and trying to find best keyboard layout for me. One thing is really annoying me. I have added following lines to .emacs
(global-set-key "\C-y" 'scroll-up)
(global-set-key "\M-y" 'scroll-down)
And it works but, if I hold Control and press ‘y’ few time it will scroll page down every time bat if I hold Windows key (mapped as Meta) and press ‘y’ few times it will scroll up only first time and for every successive key presses I will get character ‘y’ in the buffer. Can the page up behave like page down ? I want to hold Meta and keep pressing ‘y’ to scroll multiple pages up.
I am using GNU Emacs 23.0.60.1 (i386-mingw-nt5.1.2600) of 2008-05-12 on LENNART-69DE564 (patched). It is Emacs with EmacsW32 patch. Is this problem with this Emacs ? Problem with Meta key ?
| 0 | [
2,
2478,
125,
17,
2478,
71,
19,
13,
62,
6893,
18,
800,
3726,
3726,
31,
589,
749,
20,
2484,
13,
62,
6893,
18,
17,
749,
20,
477,
246,
8896,
9106,
26,
55,
9,
53,
584,
25,
510,
17610,
55,
9,
31,
57,
905,
249,
1560,
20,
13,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WCF - How to accept long strings as parameters
===
I have a simple web service, it takes 2 parameters one is a simple xml security token, the other is usually a long xml string. It works with short strings but longer strings give a 400 error message. maxMessageLength did nothing to allow for longer strings. | 0 | [
2,
11801,
410,
13,
8,
184,
20,
3440,
175,
7887,
28,
12905,
800,
3726,
3726,
31,
57,
21,
1935,
2741,
365,
15,
32,
1384,
172,
12905,
53,
25,
21,
1935,
23504,
1221,
20,
2853,
15,
14,
89,
25,
951,
21,
175,
23504,
3724,
9,
32,
693,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to keep from duplicating path variable in csh
===
It is typical to have something like this in your cshrc file for setting the path:
set path = ( . $otherpath $path )
but, the path gets duplicated when you source your cshrc file multiple times, how do you prevent the duplication? | 0 | [
2,
184,
20,
643,
37,
1052,
25971,
1203,
2013,
7612,
19,
272,
1635,
800,
3726,
3726,
32,
25,
3874,
20,
57,
301,
101,
48,
19,
154,
272,
1635,
5453,
3893,
26,
2697,
14,
2013,
45,
309,
2013,
800,
13,
5,
13,
9,
5579,
9539,
8353,
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... |
Find the version of an installed Perl module
===
How do you find the version of an installed Perl module? | 0 | [
2,
477,
14,
615,
16,
40,
4066,
416,
255,
12613,
800,
3726,
3726,
184,
107,
42,
477,
14,
615,
16,
40,
4066,
416,
255,
12613,
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... |
Why Can't I Inherit IO.Directory?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!??!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!??!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!??!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!??!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!?!??!?!?!?!?!?!?!?!?!?!?!
===
how are you doing today? Me too.
I would like to know something. Why cant I create a class in VB.NET that inherits System.IO.Directory? According to Lutz Roeder, it is **not** declared as NotInheritable!
I want to create utility class that adds functionality to the Directory class. For instance, I want to add a Directory.Move function.
Please advise and I will send you a six pack. OK nevermind I'm not sending you anything but if you come to the bar tonight I will hook you up and then beat you in pool.
Thanks. | 0 | [
2,
483,
92,
22,
38,
31,
17569,
13,
1963,
9,
10197,
93,
60,
187,
60,
187,
60,
187,
60,
187,
60,
187,
60,
187,
60,
187,
60,
187,
60,
187,
60,
187,
60,
187,
60,
187,
60,
187,
60,
187,
60,
187,
60,
60,
187,
60,
187,
60,
187,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 2 and the MVP Pattern
===
Any ideas on how i get MVP working with Silverlight? How Do I get around the fact there is no load event raised?
This the view I have:
public partial class Person: IPersonView
{
public event RoutedEventHandler Loaded;
public Person()
{
new PersonPresenter(this);
InitializeComponent();
}
public Person Person
{
set { Person.ItemsSource = value; }
}
}
Any my presenter:
public class PersonPresenter
{
private readonly IPersonView _view;
private readonly ServiceContractClient _client;
public PersonPresenter(IPersonView view)
{
_client = new ServiceContractClient();
_view = view;
WireUpEvents();
}
private void WireUpEvents()
{
_view.Loaded += Load;
}
private void Load(object sender, EventArgs e)
{
_client.GetPersonCompleted += Client_GetPerson;
_client.GetPersonAsync();
}
private void Client_GetPerson(object sender, GetPersonCompletedEventArgs e)
{
_view.Person= e.Result;
}
}
No happen for be as the Loaded event dont seem to get called. | 0 | [
2,
1172,
3130,
172,
17,
14,
13552,
3732,
800,
3726,
3726,
186,
3478,
27,
184,
31,
164,
13552,
638,
29,
1172,
3130,
60,
184,
107,
31,
164,
140,
14,
837,
80,
25,
90,
6305,
807,
1127,
60,
48,
14,
1418,
31,
57,
45,
317,
7284,
718,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 place for NHibernate documentation?
===
I've been looking for good documentation for nhibernate, specifically version 2.0. I've recently returned to .NET development and for the life of me, I can't find the right sort of documentation (or even the most recent). Any suggestions would be greatly appreciated. | 4 | [
2,
246,
209,
26,
12109,
15191,
8820,
13945,
60,
800,
3726,
3726,
31,
22,
195,
74,
699,
26,
254,
13945,
26,
12109,
15191,
8820,
15,
3524,
615,
172,
9,
387,
9,
31,
22,
195,
1989,
587,
20,
13,
9,
2328,
522,
17,
26,
14,
201,
16,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
A StringToken Parser which gives Google Search style "Did you mean:" Suggestions
===
##Seeking a method to:
##Take whitespace separated tokens in a String; return a suggested Word
<br>
**ie:**
Google Search can take *"fonetic wrd nterpreterr"*,
and atop of the result page it shows *"Did you mean: phonetic word interpreter"*
*A solution in any of the C\* languages or Java would be preferred.*
<br>
**Are there any existing Open Libraries which perform such functionality?**
**Or is there a way to Utilise a Google API to request a suggested word?** | 0 | [
2,
21,
3724,
262,
2853,
2017,
4104,
56,
2352,
8144,
2122,
1034,
13,
7,
3052,
42,
884,
45,
7,
18389,
800,
3726,
3726,
6926,
5910,
1798,
1581,
21,
2109,
20,
45,
6926,
5910,
4386,
359,
5582,
4196,
20,
2853,
18,
19,
21,
3724,
73,
78... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Generic logging of function parameters in exception handling
===
A lot of my C# code follows this pattern:
void foo(string param1, string param2, string param3)
{
try
{
// do something...
}
catch(Exception ex)
{
LogError(String.Format("Error in foo(param1={0}, param2={1}, param3={2}), exception={3}", param1, param2, param3, ex.Message));
}
}
Is there a way in .NET to get a Key/Value list of the parameters to a function so that I can call another function to construct my error logging string?
OR
Do you have a more generic / better way of doing this? | 0 | [
2,
12733,
13,
13919,
16,
1990,
12905,
19,
5391,
7988,
800,
3726,
3726,
21,
865,
16,
51,
272,
5910,
1797,
2415,
48,
3732,
45,
11364,
4310,
111,
5,
11130,
2258,
79,
165,
15,
3724,
2258,
79,
135,
15,
3724,
2258,
79,
240,
6,
13,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
TDD. When you can move on?
===
When doing a TDD, how to tell "that's enough tests for this class / feature"?
I.e. when could you tell that you completed testing all edge cases?
| 0 | [
2,
15596,
43,
9,
76,
42,
92,
780,
27,
60,
800,
3726,
3726,
76,
845,
21,
15596,
43,
15,
184,
20,
494,
13,
7,
887,
22,
18,
511,
4894,
26,
48,
718,
13,
118,
1580,
7,
60,
31,
9,
62,
9,
76,
110,
42,
494,
30,
42,
1066,
4431,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Determining the port a Visual Studio Web App runs on
===
I've been using the macro from [this blog entry][1] for attaching the Visual Studio debugger to an already running instance of the Web Application I'm currently working on. However, if I have more than one instance of the Visual Studio web server running it's pot luck which one it'll attach to.
Is there a way to determine what port is configured in the Web project so I can modify the macro to filter its choice of process to taht one?
[1]: http://weblogs.asp.net/koenv/archive/2008/02/14/quick-attach-and-detach-debugger.aspx | 0 | [
2,
13521,
14,
1295,
21,
3458,
1120,
2741,
4865,
1461,
27,
800,
3726,
3726,
31,
22,
195,
74,
568,
14,
9069,
37,
636,
1565,
8146,
2792,
500,
2558,
165,
500,
26,
19514,
68,
14,
3458,
1120,
121,
2345,
11356,
20,
40,
614,
946,
4851,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to get a cookie by name in JavaScript?
===
I am using prototype and I can't find any built in extensions to set or retrieve cookies. After googling for a little bit, I see a few different ways to go about it. I was wondering what you think is the best approach for getting a cookie in JavaScript? | 0 | [
2,
98,
25,
14,
246,
161,
20,
164,
21,
19980,
34,
204,
19,
8247,
8741,
60,
800,
3726,
3726,
31,
589,
568,
7063,
17,
31,
92,
22,
38,
477,
186,
392,
19,
17529,
20,
309,
54,
11917,
19396,
9,
75,
162,
5598,
802,
26,
21,
265,
1142... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Put a process in a sandbox where it can do least harm
===
I'm looking for the concept to __spawn a process__ such that:
- it has only access to certain libraries/APIs
- it cannot acess the file system or only specific parts
- it can __do least harm should malicious code run in it__
This concept is known as sandbox or jail.
It is required to do this __for each major Operating system (Windows, MacOSX and Linux)__ and the question is conceptual (as in what to do, __which APIs to use and and what to observe__) rather then language specific (you may give examples in C).
One answer is desired that has the specifics for each operating system.
| 0 | [
2,
442,
21,
953,
19,
21,
1965,
5309,
113,
32,
92,
107,
639,
5182,
800,
3726,
3726,
31,
22,
79,
699,
26,
14,
2420,
20,
13,
1,
22860,
21,
953,
1,
145,
30,
45,
13,
8,
32,
63,
104,
1381,
20,
1200,
8649,
118,
58,
8954,
13,
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... |
For tabular data, what renders faster, CSS or <TABLE>?
===
Is there a benchmark out there that ignores the filesize comparison and solely measures rendering time for tables marked up either using tradition HTML or some kind of stylized DIV/SPAN/LI/whatever?
I use CSS for layout, but I'm skeptical of it being better suited for tabular data than something that was originally designed for tabular data.
I got suckered into using JSON a couple years ago only to discover it was (at the time) at least an order of magnitude slower to take JSON and create DOM elements from it than it was for a browser to use InnerHTML. I was hoping maybe the speed tests were already done for CSS vs. table tags...
Mostly I'm interested in Firefox, but it'd be good to compare with other renderers... | 4 | [
2,
26,
6523,
7451,
1054,
15,
98,
16535,
18,
4233,
15,
272,
18,
18,
54,
13,
1,
5924,
1,
60,
800,
3726,
3726,
25,
80,
21,
25324,
70,
80,
30,
7174,
18,
14,
6488,
2952,
6050,
17,
9748,
4699,
15307,
85,
26,
7484,
2739,
71,
694,
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... |
Application specific metadata in SOAP header
===
Do you think its a good idea to put our application specific metadata in the SOAP header?
E.g. In our organization, we want to track each message as it passes through various services, I want to track service path (just like TCP) to know which all services processed the message etc. For all this, currently we are defining our own message format (that has header and body) over SOAP message.
I want to get your opinion on whether this is a good idea or should I put my application metadata in the SOAP header itself.
Thanks
Manju | 0 | [
2,
3010,
1903,
28057,
19,
6447,
157,
106,
800,
3726,
3726,
107,
42,
277,
82,
21,
254,
882,
20,
442,
318,
3010,
1903,
28057,
19,
14,
6447,
157,
106,
60,
13,
62,
9,
263,
9,
19,
318,
1165,
15,
95,
259,
20,
792,
206,
2802,
28,
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... |
Python: SWIG vs ctypes
===
In python, under what circumstances is SWIG a better choice than ctypes for calling entry points in shared libraries? Let's assume you don't already have the SWIG interface file(s). <br><br>What are the performance metrics of the two? | 0 | [
2,
20059,
45,
13,
18,
12445,
4611,
272,
4474,
18,
800,
3726,
3726,
19,
20059,
15,
131,
98,
5072,
25,
13,
18,
12445,
21,
574,
1837,
119,
272,
4474,
18,
26,
2555,
2792,
819,
19,
2592,
8649,
60,
408,
22,
18,
7158,
42,
221,
22,
38... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Marking A Class Static in VB.NET
===
As just stated in a recent [question][1] and [answer][2], you can't inherit from a static class. How does one enforce that rule inside VB.NET? Since the framework is compatible between C# and VB it would make sense that there would be a way to mark a class static, but there doesn't seem to be a way.
[1]: http://stackoverflow.com/questions/135759/why-cant-i-inherit-iodirectory
[2]: http://stackoverflow.com/questions/135759/why-cant-i-inherit-iodirectory#135772 | 0 | [
2,
10644,
21,
718,
12038,
19,
13,
20468,
9,
2328,
800,
3726,
3726,
28,
114,
1240,
19,
21,
1764,
636,
24652,
500,
2558,
165,
500,
17,
636,
5950,
4662,
500,
2558,
135,
500,
15,
42,
92,
22,
38,
17569,
37,
21,
12038,
718,
9,
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,
1,
1,
1,
1,
1... |
Are booleans as method arguments unacceptable?
===
A colleague of mine states, that booleans as method arguments are not acceptable. They shall be replaced be enumerations. At first I did not see any benefit, but he gave me an example.
What's easier to understand?
file.writeData( data, true );
Or
enum WriteMode {
Append,
Overwrite
};
file.writeData( data, Append );
Now I got it! ;-)<br>
This is definitely an example where an enumeration as second parameter makes the code much more readable.
So, what's your opinion to this topic?
| 0 | [
2,
50,
9827,
413,
5950,
28,
2109,
10553,
24667,
60,
800,
3726,
3726,
21,
12321,
16,
1114,
202,
15,
30,
9827,
413,
5950,
28,
2109,
10553,
50,
52,
12513,
9,
59,
3004,
44,
1141,
44,
26940,
5757,
9,
35,
64,
31,
144,
52,
196,
186,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I serve a script with apache instead of running it?
===
I'm trying to host a python script using an apache web server, but the server tries to run the script instead of just offering it for download.
I do not have direct access to server, and adding the line
AddType text/plain .py
to .htaccess in the root folder does not appear to work, though I could be doing something wrong.
How do I get the server to just send the file as text instead of trying to run it? | 0 | [
2,
184,
107,
31,
1884,
21,
3884,
29,
17140,
700,
16,
946,
32,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
2015,
21,
20059,
3884,
568,
40,
17140,
2741,
8128,
15,
47,
14,
8128,
3919,
20,
485,
14,
3884,
700,
16,
114,
4090,
32,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Whiteboard Interview Questions
===
I teach a software engineering lab class for Seniors in Computer Science and Engineering (Bachelor's degree). I understand that many companies have interviewees solve simple programming problems on a whiteboard or piece of paper.
I would like to prepare my students for this as they do not normally have to stand in front of a judgmental audience and write programs on a whiteboard. Thus, I am looking for some good questions to ask them.
The question should be answerable in 15-30 minutes, on a whiteboard, by a solid CSE graduate. I am looking for programming questions, not puzzles. | 4 | [
2,
359,
2806,
2421,
2346,
800,
3726,
3726,
31,
5348,
21,
2306,
1552,
4343,
718,
26,
1101,
18,
19,
1428,
762,
17,
1552,
13,
5,
4522,
532,
248,
22,
18,
1168,
6,
9,
31,
1369,
30,
151,
1532,
57,
2421,
10102,
8402,
1935,
3143,
1716,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Programming future web apps
===
For now I'm looking into languages like Haskell and Erlang just for the fun of it, but if I were to take bets, what would you suggest be the language of choice for programming the future web and why? | 0 | [
2,
3143,
1022,
2741,
4865,
18,
800,
3726,
3726,
26,
130,
31,
22,
79,
699,
77,
2556,
101,
63,
16507,
17,
13,
106,
9949,
114,
26,
14,
2414,
16,
32,
15,
47,
100,
31,
46,
20,
247,
5676,
18,
15,
98,
83,
42,
5601,
44,
14,
816,
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,
0,
0,
0,
0,
0,
0... |
where can I find a description of *all* MIPS instructions,
===
Does anyone know of a web site where I can find a list of 32-bit MIPS instructions/opcodes, with the following features:
<ul>
<li>Clearly distinguishes between real opcodes and assembly-language macros</li>
<li>Describes the instruction behavior including differences depending on privilege level.
<li>Indicates in which instruction set revision the instruction was introduced/revised (e.g. MIPS I, MIPS II, MIPS32, etc.)</li>
<li>Includes privileged instructions such as <tt>syscall</tt>.</li>
</ul>
I am aware of numerous web sites which document "part of" the instruction set, mostly for teaching purposes. They tend to leave out or only partially describe floating-point and privileged instructions.
In case you're wondering, I'm looking at Verilog code for a MIPS processor subset, and trying to figure out exactly to what extent it complies with the instruction sets of any real MIPS processors! Thanks for any pointers. | 0 | [
2,
113,
92,
31,
477,
21,
5318,
16,
1637,
1233,
2483,
534,
1919,
7650,
15,
800,
3726,
3726,
630,
1276,
143,
16,
21,
2741,
689,
113,
31,
92,
477,
21,
968,
16,
2512,
8,
3326,
534,
1919,
7650,
118,
2594,
9375,
18,
15,
29,
14,
249,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you convert angle expressed in radians to degress and vice versa?
===
One of those things that pop up ever so often.
What's the formula to convert angles expressed in radians to degrees and back again?
And what's the most optimal standard C-implementation of that? | 0 | [
2,
184,
107,
42,
8406,
5334,
3741,
19,
4944,
4857,
20,
121,
13026,
17,
1821,
18596,
60,
800,
3726,
3726,
53,
16,
273,
564,
30,
1675,
71,
462,
86,
478,
9,
98,
22,
18,
14,
3729,
20,
8406,
13280,
3741,
19,
4944,
4857,
20,
4442,
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... |
java.net.SocketException: Software caused connection abort: recv failed
===
I haven't been able to find an adequate answer to what exactly the following error means:
`java.net.SocketException: Software caused connection abort: recv failed`
Notes:
- This error is infrequent and unpredictable; although getting this error means that all future requests for URIs will also fail.
- The only solution that works (also, only occasionally) is to reboot Tomcat and/or the actual machine (Windows in this case).
- The URI is definitely available (as confirmed by asking the browser to do the fetch).
Relevant code:
BufferedReader reader;
try {
URL url = new URL(URI);
reader = new BufferedReader(new InputStreamReader(url.openStream())));
} catch( MalformedURLException e ) {
throw new IOException("Expecting a well-formed URL: " + e);
}//end try: Have a stream
String buffer;
StringBuilder result = new StringBuilder();
while( null != (buffer = reader.readLine()) ) {
result.append(buffer);
}//end while: Got the contents.
reader.close(); | 0 | [
2,
8247,
9,
2328,
9,
18,
5668,
1198,
10066,
872,
45,
2306,
1497,
2760,
21557,
45,
6042,
710,
1702,
800,
3726,
3726,
31,
2933,
22,
38,
74,
777,
20,
477,
40,
12870,
1623,
20,
98,
1890,
14,
249,
7019,
1108,
45,
13,
1,
1004,
1385,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can you have an empty clause in your SQL if-statement?
===
I'd like to just put in a comment in my stored procedure, but I get an error when I try.
declare @ConstraintName varchar(255)
set @ConstraintName = 'PK_Whatever'
IF LEFT(@ConstraintName, 2) = 'PK'
BEGIN
--can't drop primary keys
--PRINT @ConstraintName
END
The error I get is:
Incorrect syntax near 'END'.
If I uncomment `--PRINT @ConstraintName`, it works fine.
| 0 | [
2,
92,
42,
57,
40,
2424,
9040,
19,
154,
4444,
255,
100,
8,
3859,
1130,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
114,
442,
19,
21,
6484,
19,
51,
8214,
7004,
15,
47,
31,
164,
40,
7019,
76,
31,
1131,
9,
10123,
13,
1,
12124,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Strategy for storing an string of unspecified length in Sql Server?
===
So a column will hold some text that beforehand I won't know how long the length of this string can be. Realistically 95% of the time, it will probably be between 100-500 chars, but there can be that one case where it will 10000 chars long. I have no control over the size of this string and never does the user. Besides varchar(max), what other strategy have you guys found useful? Also what are some cons of varchar(max)? | 0 | [
2,
4427,
26,
25615,
40,
3724,
16,
27005,
1476,
19,
4444,
255,
8128,
60,
800,
3726,
3726,
86,
21,
4698,
129,
1027,
109,
1854,
30,
115,
3203,
31,
230,
22,
38,
143,
184,
175,
14,
1476,
16,
48,
3724,
92,
44,
9,
12786,
1326,
13,
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 pInvoke the function SHCameraCapture (camera dialog) from Aygshell.dll from WinMO6
===
This is an involved question. Please read through the entire question before answering.
I need to show a camera capture dialog in a compact framework 3.7 application by pinvoking SHCameraCapture from the dll Aygshell.dll. I cannont use the managed object CameraCaptureDialog because of limitations with the technology I'm working with. Instead, I need to access it by Pinvoking it.
See http://msdn.microsoft.com/en-us/library/aa454995.aspx for documentation on the function. The function takes in a struct that defines the parameters of the dialog. e.g. where to save the file, what resolution to use.
I would imaging that I would have to define a copy of the struct in C# and decorate the sturct with the attribute StructLayout. I also imagine that the code would involve [DllImport("aygshell.dll")]. Any sample code of how to call this would be much appreciated.
| 0 | [
2,
184,
107,
31,
3459,
2625,
1048,
14,
1990,
5527,
24636,
4666,
6418,
13,
5,
24636,
28223,
6,
37,
21,
93,
263,
15984,
9,
43,
211,
37,
628,
1293,
379,
800,
3726,
3726,
48,
25,
40,
1013,
1301,
9,
2247,
1302,
120,
14,
1078,
1301,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Flash: Listen to all events of a type with one eventlistener
===
It's not a matter of life or death but I wonder if this could be possible:
I got a couple of events from one type of custom event (FormEvent) now I got a FormListener that listens to all those events and handles them according to the event type. Instead of adding one eventListener at the time I wish to add all events at once.
so now it looks like this:
private function addListeners():void {
addEventListener(FormEvent.SHOW_FORM, formListener);
addEventListener(FormEvent.SEND_FORM, formListener);
addEventListener(FormEvent.CANCEL_FORM, formListener);
}
private function formListener(event:formEvent):void {
switch(event.type){
case "show.form":
// handle show form stuff
break;
case "send.form":
// handle send form stuff
break;
case "cancel.form":
// handle cancel form stuff
break;
}
}
but instead of adding every event one at the time I would rather be doing something like
private function addListeners():void {
addEventListener(FormEvent.*, formListener);
}
I wonder if something like this is possible, i would love it. I work with loads of events :)
| 0 | [
2,
4433,
45,
3834,
20,
65,
963,
16,
21,
1001,
29,
53,
807,
13891,
106,
800,
3726,
3726,
32,
22,
18,
52,
21,
1161,
16,
201,
54,
372,
47,
31,
2666,
100,
48,
110,
44,
938,
45,
31,
330,
21,
1335,
16,
963,
37,
53,
1001,
16,
581... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Encrypting Source Code
===
I work on relatively sensitive code that we wouldn't want falling into the wrong hands. Up until now, all the code has been keep in house so it hasn't been an issue. I am moving to working from home a day or two a week and we want to secure the code on my laptop.
We have looked at a few alternatives, but Windows EFS and Bitlocker seem to be the most obvious. The laptop doesn't have TPM hardware, and I won't have access to Active Directory from home, so EFS looks to be the option.
Basically, does anyone else have any alternatives, or issues with using EFS to encrypt source code? | 0 | [
2,
1957,
11435,
68,
1267,
1797,
800,
3726,
3726,
31,
170,
27,
3109,
7830,
1797,
30,
95,
1265,
22,
38,
259,
3106,
77,
14,
1389,
473,
9,
71,
163,
130,
15,
65,
14,
1797,
63,
74,
643,
19,
191,
86,
32,
9979,
22,
38,
74,
40,
1513,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 PHP's mssql driver return SQL return codes?
===
Stored procs in SQL Server sometimes finish with a return code, as opposed to a recordset of data. I've seen ASP code that's able to get this return code, but I can't figure out how to get this code with PHP's mssql driver.
mssql_get_last_message() always returns nothing, and I'm thinking it's because it only returns the very last line that came from the server. When we run the proc in another application (outside PHP), there is blank line following the return code.
Has anyone figured out how to get return codes from SQL stored procs using PHP's mssql driver? | 0 | [
2,
92,
13,
26120,
22,
18,
4235,
18,
22402,
2425,
788,
4444,
255,
788,
11358,
60,
800,
3726,
3726,
8214,
13,
15617,
18,
19,
4444,
255,
8128,
1030,
2106,
29,
21,
788,
1797,
15,
28,
3499,
20,
21,
742,
1198,
16,
1054,
9,
31,
22,
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... |
i18n-able way to get number ordinal in C++/MFC on Windows? (1->1st, 2->2nd, etc.)
===
Is there an easy way to convert the number 1, 2, 3, ... to "1st", "2nd", "3rd", ..., and in such a way that I can give the function a language and have it return me the correct form for the language I'm targeting? Either standard C++ (stl or boost OK), MFC or ATL, win32 api or a small, single-purpose and free library that I can download from somewhere. Thanks. | 0 | [
2,
31,
1087,
103,
8,
579,
161,
20,
164,
234,
54,
3653,
192,
19,
272,
20512,
118,
79,
7061,
27,
1936,
60,
13,
5,
165,
8,
1,
165,
384,
15,
172,
8,
1,
135,
706,
15,
2722,
9,
6,
800,
3726,
3726,
25,
80,
40,
2010,
161,
20,
84... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 tool to discover if the same class exists in multiple jars in the classpath?
===
If you have two jars in your classpath that contain different versions of the same class, the classpath order becomes critical.
I am looking for a tool that can detect and flag such potential conflicts in a given classpath or set of folders.
Certainly a script that starts:
classes=`mktemp`
for i in `find . -name "*.jar"`
do
echo "File: $i" > $classes
jar tf $i > $classes
...
done
with some clever sort/uniq/diff/grep/awk later on has potential, but I was wondering if anyone knows of any existing solutions. | 0 | [
2,
25,
80,
21,
5607,
20,
6297,
100,
14,
205,
718,
5636,
19,
1886,
5112,
18,
19,
14,
718,
8353,
60,
800,
3726,
3726,
100,
42,
57,
81,
5112,
18,
19,
154,
718,
8353,
30,
3717,
421,
3281,
16,
14,
205,
718,
15,
14,
718,
8353,
389... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 good introductory tutorial for Yahoo! User Interface?
===
Does anyone know of a good tutorial for developers who are taking their first look at the Yahoo User Interface? The one on Yahoo's site is not very good, and I can't find a different one. | 0 | [
2,
25,
80,
21,
254,
26958,
29724,
26,
23553,
187,
4155,
6573,
60,
800,
3726,
3726,
630,
1276,
143,
16,
21,
254,
29724,
26,
10168,
72,
50,
741,
66,
64,
361,
35,
14,
23553,
4155,
6573,
60,
14,
53,
27,
23553,
22,
18,
689,
25,
52,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Is it possible to define a Ruby singleton method using a block?
===
So, I want to define a singleton method for an object, but I want to do it using a closure.
For example,
def define_say(obj, msg)
def obj.say
puts msg
end
end
o = Object.new
define_say o, "hello world!"
o.say
This doesn't work because defining a singleton method via "def" is not a closure, so I get an exception that "msg" is an undefined variable or method.
What I would like to do is something like using the "define_method" method in the Module class, but as far as I can tell, this can only be used to define a method on a class... but I want a Singleton Method...
So, I would love to write it something like this:
def define_say(obj, msg)
obj.define_singleton_method(:say) {
puts msg
}
end
Does anyone know how I can achieve this without having to create a method to store a Proc and then use the Proc within a singleton method? (basically, I want a clean, non-hacky way of doing this) | 0 | [
2,
25,
32,
938,
20,
9267,
21,
10811,
345,
444,
2109,
568,
21,
1921,
60,
800,
3726,
3726,
86,
15,
31,
259,
20,
9267,
21,
345,
444,
2109,
26,
40,
3095,
15,
47,
31,
259,
20,
107,
32,
568,
21,
7790,
9,
26,
823,
15,
6312,
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... |
Tool to optimize C# using statements?
===
Is there any tool out there that can identify name spaces in the Using statement that are not needed and eliminate them from the source? | 0 | [
2,
5607,
20,
22864,
272,
5910,
568,
9015,
60,
800,
3726,
3726,
25,
80,
186,
5607,
70,
80,
30,
92,
5808,
204,
7644,
19,
14,
568,
3331,
30,
50,
52,
851,
17,
10628,
105,
37,
14,
1267,
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,
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... |
Comet and jQuery
===
I've done some research into server push with javascript and have found the general consensus to be that what I'm looking for lies in the "Comet" design pattern. Are there any good implementations of this pattern built on top of jQuery? If not, are there any good implementations of this pattern at all? And regardless of the answer to those questions, is there any documentation on this pattern from an implementation stand-point? | 4 | [
2,
15625,
17,
487,
8190,
93,
800,
3726,
3726,
31,
22,
195,
677,
109,
527,
77,
8128,
3250,
29,
8247,
8741,
17,
57,
216,
14,
297,
11205,
20,
44,
30,
98,
31,
22,
79,
699,
26,
1966,
19,
14,
13,
7,
3967,
38,
7,
704,
3732,
9,
50... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Quickbooks 2005 Web Integration
===
A customer of ours has Quickbooks 2005 and is looking to have their web data (orders, customers, tax) sent as it is collected from the web in a format that can be imported into Quickbooks 2005 Pro.
Does anyone have any experience with this? If so, what was your experience, and what component/method would you recommend for importing this data into Quickbooks?
Thanks. | 0 | [
2,
2231,
13828,
812,
2741,
8078,
800,
3726,
3726,
21,
7705,
16,
318,
18,
63,
2231,
13828,
812,
17,
25,
699,
20,
57,
66,
2741,
1054,
13,
5,
7861,
18,
15,
5279,
15,
2225,
6,
795,
28,
32,
25,
3674,
37,
14,
2741,
19,
21,
2595,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Assembly.Load and Environment.CurrentDirectory
===
I realize there is a somewhat related thread on this here:
[http://stackoverflow.com/questions/22012/loading-assemblies-and-its-dependencies][1]
But I am modifying something and this doesn't exactly apply.
string path = Path.GetDirectoryName( pathOfAssembly );
Environment.CurrentDirectory = path;
Assembly.Load(Path.GetFileNameWithoutExtension(pastOfAssembly));
Is there any really reason you would do it like this? Wouldn't it make more sense to just use:
Assembly.LoadFile(pathOfAssembly);
Any insight would be greatly appreciated.
[1]: http://stackoverflow.com/questions/22012/loading-assemblies-and-its-dependencies | 0 | [
2,
1475,
9,
8294,
17,
2307,
9,
17657,
10197,
93,
800,
3726,
3726,
31,
4007,
80,
25,
21,
4131,
1597,
9322,
27,
48,
235,
45,
636,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
15718,
3212,
118,
16866,
8,
9790,
5024,
7712,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Love PHP's simple environment, hate the language. How best to do this in Perl?
===
I despise the PHP language, and I'm quite certain that I'm not alone. But the great thing about PHP is the way that mod_php takes the hides gory details of integrating with the apache runtime, and achieves CGI-like request isolation and decent performance.
What's the shortest-distance approach to getting the same simplicity, speed and isolation as PHP's runtime environment, with Perl semantics? I feel like raw mod_perl gives me too much rope to hang myself with: cross-request globals, messy config, too many template engines to choose from.
FastCGI? HTML::Mason? I'd like to do development In the Large in Perl, if only I had a framework that let me. | 0 | [
2,
339,
13,
26120,
22,
18,
1935,
2307,
15,
3223,
14,
816,
9,
184,
246,
20,
107,
48,
19,
416,
255,
60,
800,
3726,
3726,
31,
20558,
14,
13,
26120,
816,
15,
17,
31,
22,
79,
1450,
1200,
30,
31,
22,
79,
52,
1056,
9,
47,
14,
374... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Pass and return custom array object in ibatis and oracle in java
===
I've looked around for a good example of this, but I haven't run into one yet. I want to pass a custom string array from java to oracle and back, using the IBATIS framework. Does anyone have a good link to an example? I'm calling stored procs from IBATIS.
Thanks | 0 | [
2,
1477,
17,
788,
5816,
7718,
3095,
19,
13,
9747,
3409,
17,
15759,
19,
8247,
800,
3726,
3726,
31,
22,
195,
292,
140,
26,
21,
254,
823,
16,
48,
15,
47,
31,
2933,
22,
38,
485,
77,
53,
768,
9,
31,
259,
20,
1477,
21,
5816,
3724,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Catch multiple Exceptions at once?
===
It is discouraged to simply catch System.Exception, instead only the "known" Exceptions should be caught.
Now, this sometimes leads to unneccessary repetetive code, for example:
try
{
WebId = new Guid(queryString["web"]);
}
catch (FormatException)
{
WebId = Guid.Empty;
}
catch (OverflowException)
{
WebId = Guid.Empty;
}
I wonder: Is there a way to catch both Exceptions and only call the WebId = Guid.Empty call once? (This here is a somewhat trivial example, just imagine that this is a more complicated function that can not be easily refactored, but that also has multiple Exceptions which share exactly the same code)
| 0 | [
2,
2949,
1886,
13392,
35,
382,
60,
800,
3726,
3726,
32,
25,
24788,
20,
1659,
2949,
329,
9,
10066,
872,
15,
700,
104,
14,
13,
7,
2929,
7,
13392,
378,
44,
1383,
9,
130,
15,
48,
1030,
4259,
20,
367,
556,
3384,
15962,
622,
9411,
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... |
Prevent visual studio creating browse info (.ncb) files
===
Is there a way to prevent VS2008 creating browse info file files for C++ projects.
I rarely use the class browser and it isn't worth the time it takes to recreate it after every build, especially since it runs even if the build failed.
Is it used for anything else apart form the class browse pane?
| 0 | [
2,
2501,
3458,
1120,
2936,
10175,
62,
15404,
13,
5,
9,
103,
11849,
6,
6488,
800,
3726,
3726,
25,
80,
21,
161,
20,
2501,
4611,
2753,
2936,
10175,
62,
15404,
3893,
6488,
26,
272,
20512,
2314,
9,
31,
5664,
275,
14,
718,
16495,
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... |
How do I format a String so Outlook with print the line breaks?
===
I'm trying to send an email in Java but when I read the body of the email in Outlook, it's gotten rid of all my linebreaks. I'm putting \n at the ends of the lines but is there something special I need to do other than that? The receivers are always going to be using Outlook.
I found a page on microsoft.com that says there's a 'Remove line breaks' "feature" in Outlook so does this mean there's no solution to get around that other than un-checking that setting?
Thanks | 0 | [
2,
184,
107,
31,
2595,
21,
3724,
86,
19837,
29,
4793,
14,
293,
7947,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
2660,
40,
8517,
19,
8247,
47,
76,
31,
1302,
14,
358,
16,
14,
8517,
19,
19837,
15,
32,
22,
18,
4094,
6681,
16,
65,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
IDE or Text Editor?
===
Do you like to code using an IDE (like Eclipse or Visual Studio), or you prefer simply a text editor (like Vim) ?
I heard strong arguments against IDE's (specially from dynamic language programmers) but I really love Eclipse.
Which type do you prefer? Why? If it depends on the language please say so.
Thanks | 4 | [
2,
13,
3448,
54,
1854,
1835,
60,
800,
3726,
3726,
107,
42,
101,
20,
1797,
568,
40,
13,
3448,
13,
5,
1403,
11652,
54,
3458,
1120,
6,
15,
54,
42,
6369,
1659,
21,
1854,
1835,
13,
5,
1403,
1790,
79,
6,
13,
60,
31,
752,
966,
1055... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 check if a file has the win2003 "blocked" option on it.
===
How do I check from within my NSIS installer if my installer has the blocked option in preferences on it.
Even if you know of a way to check this without NSIS, please let me know so I can script it myself.
See this question to find out [more info about this blocked option][1].
[1]: http://stackoverflow.com/questions/135600/reproducing-the-blocked-exe-unblock-option-in-file-properties-in-windows-2003 | 0 | [
2,
184,
20,
2631,
100,
21,
3893,
63,
14,
628,
3325,
13,
7,
12048,
69,
7,
4255,
27,
32,
9,
800,
3726,
3726,
184,
107,
31,
2631,
37,
363,
51,
13,
103,
4557,
16146,
106,
100,
51,
16146,
106,
63,
14,
8388,
4255,
19,
9808,
18,
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... |
Profiling a Perl Web App
===
I am working on a web app that uses perl and I need to look into speeding up portions of the app.
I thought I'd start profiling the particular calls for the portion I wish to investigate. I've done some searching on profiling perl code, but unfortunately most of what I find says that I should run my perl code with -d:DProf myapp from the command line. That doesn't quite work for me since my code is within a web app. I did find a way to get the profiling to work with apache, but unfortunately, the "most used" modules that came back from the profiler were all cpan modules -- Class::xyz, etc etc etc. Not terribly helpful.
Does anyone know of a good way besides me injecting "timer" code into the methods I wish to profile to target just these methods? I've thought of writing a test script and profiling that but due to the nature of the code I'm working on that would require a bit more work than I'm hoping to have to do. | 0 | [
2,
8721,
49,
802,
21,
416,
255,
2741,
4865,
800,
3726,
3726,
31,
589,
638,
27,
21,
2741,
4865,
30,
2027,
416,
255,
17,
31,
376,
20,
361,
77,
1362,
68,
71,
9125,
16,
14,
4865,
9,
31,
289,
31,
22,
43,
799,
8721,
49,
802,
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... |
Python web development - with or without a framework
===
I am planning on porting a PHP application over to python. The application is mostly about data collection and processing. The main application runs as a stand alone command line application. There is a web interface to the application which is basically a very light weight reporting interface.
I did not use a framework in the PHP version, but being new to Python, I am wondering if it would be advantageous to use something like Django or at the very least Genshi. The caveat is I do not want my application distribution to be overwhelmed by the framework parts I would need to distribute with the application.
Is using only the cgi import in Python the best way to go in this circumstance? I would tend to thing a framework is too much overhead, but perhaps I'm not thinking in a very "python" way about them. What suggestions do you have in this scenario? | 0 | [
2,
20059,
2741,
522,
13,
8,
29,
54,
366,
21,
6596,
800,
3726,
3726,
31,
589,
2334,
27,
1295,
68,
21,
13,
26120,
3010,
84,
20,
20059,
9,
14,
3010,
25,
1555,
88,
1054,
1206,
17,
5511,
9,
14,
407,
3010,
1461,
28,
21,
1261,
1056,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 difference between @staticmethod and @classmethod in Python?
===
What is the difference between a function decorated with @staticmethod and one decorated with @classmethod?
| 0 | [
2,
98,
25,
14,
2841,
128,
13,
1,
18077,
5909,
1807,
43,
17,
13,
1,
1898,
5909,
1807,
43,
19,
20059,
60,
800,
3726,
3726,
98,
25,
14,
2841,
128,
21,
1990,
6933,
29,
13,
1,
18077,
5909,
1807,
43,
17,
53,
6933,
29,
13,
1,
1898,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Grails 1.0.3 console reports 'premature end of file'
===
Browsing to a dynamic web page built using Groovy on Grails version 1.0.3 the console log shows the following errors for each page request:
[Fatal Error] :-1:-1: Premature end of file.
| 0 | [
2,
489,
7301,
18,
137,
9,
387,
9,
240,
8650,
2813,
13,
22,
3515,
540,
6418,
241,
16,
3893,
22,
800,
3726,
3726,
10175,
68,
20,
21,
7782,
2741,
2478,
392,
568,
3452,
2026,
93,
27,
489,
7301,
18,
615,
137,
9,
387,
9,
240,
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... |
When is a feature considered "DONE"?
===
As software developers we create lots of... well... code. Much of the code we produce can go towards a new feature or an enhancement to an existing feature. When this is the case, how do we know when this feature is **done**?
What does *done* mean in the context of a feature? For example, to Company A this may mean many different things like,
1. Meets customer requirements (which is tricky in itself)
2. No known bugs
3. Documentation is written
4. etc.
5. etc.
To better help understand what *done* means to different developers and teams please list up to five (but no more than 10) items. This list would be something you as a developer, or your team, might go through and once all items are checked off, the feature is considered ***done***. | 0 | [
2,
76,
25,
21,
1580,
724,
13,
7,
43,
849,
7,
60,
800,
3726,
3726,
28,
2306,
10168,
95,
1600,
7503,
16,
9,
9,
9,
134,
9,
9,
9,
1797,
9,
212,
16,
14,
1797,
95,
2213,
92,
162,
1016,
21,
78,
1580,
54,
40,
19415,
20,
40,
3149... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 won't Visual Studio 2005 generate an Xml Serialization assembly?
===
Why isn't Visual Studio 2005 generating a serialization setting when I set the project setting "Generate Serialization Assembly" to "On"?
| 0 | [
2,
483,
230,
22,
38,
3458,
1120,
812,
7920,
40,
23504,
5956,
1829,
1475,
60,
800,
3726,
3726,
483,
2532,
22,
38,
3458,
1120,
812,
13500,
21,
5956,
1829,
2697,
76,
31,
309,
14,
669,
2697,
13,
7,
17083,
1373,
5956,
1829,
1475,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Windows Forms: How do you change the font color for a disabled label
===
I am trying to set the disabled font characteristics for a Label Control. I can set all of the Font characteristics (size, bold, etc), but the color is overridden by the default windows behavior which seems to be one of these two colors:
- If background color is transparent then ForeColor is same as TextBox disabled Color.
- If background color is set to anything else, ForeColor is a Dark Gray color.
The image below demonstrates the behavior -- Column 1 is Labels, Column 2 is TextBoxs, and Column 3 is ComboBoxes.
![alt text][1]
[1]: http://highplainstech.com/images/testForm.png | 0 | [
2,
1936,
1997,
45,
184,
107,
42,
753,
14,
9978,
1665,
26,
21,
10154,
1899,
800,
3726,
3726,
31,
589,
749,
20,
309,
14,
10154,
9978,
5626,
26,
21,
1899,
569,
9,
31,
92,
309,
65,
16,
14,
9978,
5626,
13,
5,
10454,
15,
5657,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Better Way of Manipulating RichText in C#?
===
I need to create and copy to the clipboard some RichText with standard "formatting" like bold/italics, indents and the like. The way I'm doing it now seems kind of inelegant... I'm creating a RichTextBox item and applying my formatting through that like so:
RichTextBox rtb = new RichTextBox();
Font boldfont = new Font("Times New Roman", 10, FontStyle.Bold);
rtb.Text = "sometext";
rtb.SelectAll()
rtb.SelectionFont = boldfont;
rtb.SelectionIndent = 12;
There has got to be a better way, but after a few hours of searching I was unable to come up with anything better. Any ideas? | 0 | [
2,
574,
161,
16,
27799,
2042,
11969,
19,
272,
5910,
60,
800,
3726,
3726,
31,
376,
20,
1600,
17,
4344,
20,
14,
12229,
2806,
109,
2042,
11969,
29,
1236,
13,
7,
23588,
1203,
7,
101,
5657,
118,
3188,
4663,
18,
15,
19,
817,
38,
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... |
ASP.NET Custom Controls - Rendering Image from a Pool of Images at Design Time
===
I have been working on a ImageRotator control and finished weeding out any oddities with it tonight, and it works great. However, there is one thing that is bugging me with it. **It doesn't display anything at design time** (I just get the image placeholder).
I have been Googling, and came across a good [article][1] from Rick Strahl (as always), and this works great **for single images, where the path is explicit.**
However, the `ImageRotator` will actually just take a path to a folder and scan that, and loop through those. Currently this doesnt work at design time because the image "pooling" doesn't work (I am thinking its because the designer doesn't give permission to the code to scan the filesystem).
**So, can this be done? Would it be possible to implement a custom designer for the control and elevate permissions (or something) there?**
[1]:http://www.west-wind.com/weblog/posts/193001.aspx | 0 | [
2,
28,
306,
9,
2328,
5816,
8671,
13,
8,
15307,
1961,
37,
21,
3067,
16,
3502,
35,
704,
85,
800,
3726,
3726,
31,
57,
74,
638,
27,
21,
1961,
11699,
3457,
569,
17,
842,
95,
69,
68,
70,
186,
4210,
3808,
29,
32,
2251,
15,
17,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.