unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Combo Box Item comparison and compiler warnings
===
In VisualStudio (Pro 2008), I have just noticed some inconsistent behaviour and wondered if there was any logical reasoning behind it
In a WinForms project, if I use the line
if(myComboBox.Items[i] == myObject)
I get a compiler warning that I might get 'Possible unintended references' as I am comparing type object to type MyObject. Fair enough.
However, if I instead use an interface to compare against:
if(myComboBox.Items[i] == iMyInterface)
the compile warning goes away.
Can anyone think if there is any logical reason why this should happen, or just an artifact of the compiler not to check interfaces for comparison warnings. Any thoughts?
| 0 | [
2,
22621,
1649,
9101,
6050,
17,
21486,
3590,
18,
800,
3726,
3726,
19,
3458,
21026,
13,
5,
2740,
570,
6,
15,
31,
57,
114,
2711,
109,
22380,
7727,
17,
3519,
100,
80,
23,
186,
11545,
15543,
439,
32,
19,
21,
628,
4190,
18,
669,
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... |
Is there any way to change the .NET JIT compiler to favor performance over compile time?
===
I was wondering if there's any way to change the behavior of the .NET JIT compiler, by specifying a preference for more in-depth optimizations. Failing that, it would be nice if it could do some kind of profile-guided optimization, if it doesn't already. | 0 | [
2,
25,
80,
186,
161,
20,
753,
14,
13,
9,
2328,
13,
13803,
21486,
20,
3654,
956,
84,
26561,
85,
60,
800,
3726,
3726,
31,
23,
5712,
100,
80,
22,
18,
186,
161,
20,
753,
14,
3257,
16,
14,
13,
9,
2328,
13,
13803,
21486,
15,
34,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
2d game physics?
===
Can anyone point me to a library for 2D game physics, etc for programming gravity, jumping actions, etc for a 2d platform/sidescrolling game ?
Or could you suggest some algorithms for side scroller like mario, sonic etc? | 0 | [
2,
172,
43,
250,
4339,
60,
800,
3726,
3726,
92,
1276,
454,
55,
20,
21,
1248,
26,
172,
43,
250,
4339,
15,
2722,
26,
3143,
8849,
15,
8759,
3078,
15,
2722,
26,
21,
172,
43,
2452,
118,
1416,
28166,
250,
13,
60,
54,
110,
42,
5601,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Benefits of learning scheme?
===
Ive just started one of my courses, as classes just begin 2 weeks ago, and we are learning scheme right now in 1 for i assume some reason later on, but so far from what he is teaching is basically how to write in scheme. As i sit there trying to stay awake im just trying to grasp why the fuck i wanna know this and why anyone uses scheme. Like what exactly does it excel at? Next week i plan to ask him, whats the goal to learn here other than just how to write stuff in scheme. | 0 | [
2,
5800,
16,
2477,
4276,
60,
800,
3726,
3726,
5568,
114,
373,
53,
16,
51,
4392,
15,
28,
2684,
114,
2348,
172,
1342,
1464,
15,
17,
95,
50,
2477,
4276,
193,
130,
19,
137,
26,
31,
7158,
109,
1215,
138,
27,
15,
47,
86,
463,
37,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way to detect collision?
===
Whats the best way to detect collisions in a 2d game? | 0 | [
2,
246,
161,
20,
9092,
11319,
60,
800,
3726,
3726,
98,
18,
14,
246,
161,
20,
9092,
11319,
18,
19,
21,
172,
43,
250,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
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,
0... |
What is the strict aliasing rule?
===
When asking about [common undefined behavior in C][1], souls more enlightened than I referred to the strict aliasing rule.
What are they talking about?
[1]: http://stackoverflow.com/questions/98340/what-are-the-common-undefinedunspecified-behavior-for-c-that-you-run-into | 0 | [
2,
98,
25,
14,
8170,
15794,
68,
1828,
60,
800,
3726,
3726,
76,
3379,
88,
636,
17130,
367,
13439,
3257,
19,
272,
500,
2558,
165,
500,
15,
9874,
91,
13,
29487,
119,
31,
1870,
20,
14,
8170,
15794,
68,
1828,
9,
98,
50,
59,
1582,
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... |
From small to large projects
===
I've been quite used to working on small projects which I coded with 1,000 lines or less (pong, tetris, simple 3d games, etc). However as my abilities in programming are increasing, my organization isn't. I seem to be making everything dependent on one one another, so it's very hard for me to change the implementation of something.
Any ideas for keeping my code organized and being able to tackle large projects? | 0 | [
2,
37,
284,
20,
370,
2314,
800,
3726,
3726,
31,
22,
195,
74,
1450,
147,
20,
638,
27,
284,
2314,
56,
31,
13,
22254,
29,
5925,
1560,
54,
787,
13,
5,
14572,
15,
2392,
14383,
15,
1935,
203,
43,
466,
15,
2722,
6,
9,
207,
28,
51,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Scriptaculous not working with the latest Prototype.
===
This is a really weird problem that I have been having. When I download Scriptaculous from the official web site, [script.aculo.us][1], bundled in the ZIP is prototype.js version 1.6.0.1. This works perfectly fine, I can follow along the wiki examples and begin learning. However, when I upgrade to prototype 1.6.0.2 (the latest version) from [prototypejs.org][2] everything breaks. I have read the documentation, named the new file prototype.js and nothing works. Any help is greatly appreciated!
[1]: http://script.aculo.us "script.aculo.us"
[2]: http://www.prototypejs.org/ "Prototype JS" | 0 | [
2,
3884,
1738,
22717,
52,
638,
29,
14,
5736,
7063,
9,
800,
3726,
3726,
48,
25,
21,
510,
5455,
1448,
30,
31,
57,
74,
452,
9,
76,
31,
7121,
3884,
1738,
22717,
37,
14,
989,
2741,
689,
15,
636,
8741,
9,
1738,
12415,
9,
267,
500,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 solution for database connection pooling in python?
===
I have developed some custom DAO-like classes to meet some very specialized requirements for my project that is a server-side process that does not run inside any kind of framework.
The solution works great except that every time a new request is made, I open a new connection via MySQLdb.connect.
What is the best "drop in" solution to switch this over to using connection pooling in python? I am imagining something like the commons DBCP solution for Java.
The process is long running and has many threads that need to make requests, but not all at the same time... specifically they do quite a lot of work before brief bursts of writing out a chunk of their results. | 0 | [
2,
98,
25,
14,
246,
4295,
26,
6018,
2760,
3067,
68,
19,
20059,
60,
800,
3726,
3726,
31,
57,
885,
109,
5816,
13,
17104,
8,
1403,
2684,
20,
1255,
109,
253,
7119,
4786,
26,
51,
669,
30,
25,
21,
8128,
8,
1416,
953,
30,
630,
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,
1,
1,
1,
1... |
I need a binary comparison tool for Win/Linux
===
First of all, I don't need a textual comparison so Beyond Compare doesn't do what I need.
I'm looking for a util that can report on the differences between two files, at the byte level. Bare minimum is the need to see the percentage change in the file, or a report on affected bytes/sectors.
Is there anything available to save me the trouble of doing this myself? | 0 | [
2,
31,
376,
21,
14171,
6050,
5607,
26,
628,
118,
1226,
7147,
800,
3726,
3726,
64,
16,
65,
15,
31,
221,
22,
38,
376,
21,
1854,
6948,
6050,
86,
1701,
11590,
1437,
22,
38,
107,
98,
31,
376,
9,
31,
22,
79,
699,
26,
21,
13,
14255... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Design Principles
===
What principles do you generally follow when doing class design? | 0 | [
2,
704,
5624,
800,
3726,
3726,
98,
5624,
107,
42,
1469,
1740,
76,
845,
718,
704,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
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,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What are the semantics of a const member function?
===
I understand that the function is not allowed to change the state of the object, but I thought I read somewhere that the compiler was allowed to assume that if the function was called with the same arguments, it would return the same value and thus could reuse a cached value if it was available. e.g.
class object
{
int get_value(int n) const
{
...
}
...
object x;
int a = x.get_value(1);
...
int b = x.get_value(1);
then the compiler could optimize the second call away and either use the value in a register or simply do `b = a;`
Is this true? | 0 | [
2,
98,
50,
14,
17220,
18,
16,
21,
11608,
38,
322,
1990,
60,
800,
3726,
3726,
31,
1369,
30,
14,
1990,
25,
52,
1159,
20,
753,
14,
146,
16,
14,
3095,
15,
47,
31,
289,
31,
1302,
3493,
30,
14,
21486,
23,
1159,
20,
7158,
30,
100,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Suggestions on how to add the functionality to import Finale music files on an application?
===
I'm working on a music writing application and would like to add the functionality to import Finale music files. Right now, the only thing I know is that they are enigma binary files.
Does anyone have any suggestions on where I could start so that I could be able to parse through these types of files? | 0 | [
2,
18389,
27,
184,
20,
3547,
14,
18548,
20,
9010,
10278,
232,
6488,
27,
40,
3010,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
232,
1174,
3010,
17,
83,
101,
20,
3547,
14,
18548,
20,
9010,
10278,
232,
6488,
9,
193,
130,
15,
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... |
FinalBuilder Enumeration of files and folders
===
What's the best way to enumerate a set of files and folders using FinalBuilder?
The context of my question is, I want to compare a source folder with a destination folder, and replace any matching files in the destination folder that are older than the source folder.
Any suggestions? | 0 | [
2,
426,
20904,
26940,
872,
16,
6488,
17,
19294,
18,
800,
3726,
3726,
98,
22,
18,
14,
246,
161,
20,
26940,
62,
21,
309,
16,
6488,
17,
19294,
18,
568,
426,
20904,
60,
14,
4141,
16,
51,
1301,
25,
15,
31,
259,
20,
11590,
21,
1267,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Separation of Concerns
===
What is separation of concerns? What's a concern? | 0 | [
2,
8312,
16,
4823,
800,
3726,
3726,
98,
25,
8312,
16,
4823,
60,
98,
22,
18,
21,
3630,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
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,
0,
0,
0,
0,
0,
0,
0... |
Entities With or Without Behavior
===
Should entities have behavior? or no?
Why or why not? | 0 | [
2,
12549,
29,
54,
366,
3257,
800,
3726,
3726,
378,
12549,
57,
3257,
60,
54,
90,
60,
483,
54,
483,
52,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
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,
0,
0,
0,
0... |
Best Hosted Calendar?
===
Can anyone suggest or recommend a great calendar system that is, hopefully, free, but if not then less than $10 per month? Anything other than Google? | 0 | [
2,
246,
2812,
7036,
60,
800,
3726,
3726,
92,
1276,
5601,
54,
12360,
21,
374,
7036,
329,
30,
25,
15,
13416,
15,
551,
15,
47,
100,
52,
94,
787,
119,
14737,
416,
1617,
60,
602,
89,
119,
8144,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What is the best online resource for learning WPF?
===
I'm considering WPF for a project, but I need to get up to speed with it ASAP. What was the best online resource you used to get you started with WPF? | 0 | [
2,
98,
25,
14,
246,
2087,
6577,
26,
2477,
619,
7721,
60,
800,
3726,
3726,
31,
22,
79,
5154,
619,
7721,
26,
21,
669,
15,
47,
31,
376,
20,
164,
71,
20,
1362,
29,
32,
28,
2552,
9,
98,
23,
14,
246,
2087,
6577,
42,
147,
20,
164... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Should I impose a maximum length on passwords?
===
I can understand that imposing a minimum length on passwords makes a lot of sense (to save users from themselves), but my **bank** has a requirement that passwords are between 6 and 8 characters long, and I started wondering...
- Wouldn't this just make it easier for brute force attacks? (Bad)
- Does this imply that my password is being stored unencrypted? (Bad)
If someone with (hopefully) some good IT security professionals working for them are imposing a max password length, should I think about doing similar? What are the pros/cons of this? | 0 | [
2,
378,
31,
18009,
21,
2979,
1476,
27,
20884,
18,
60,
800,
3726,
3726,
31,
92,
1369,
30,
18831,
21,
5187,
1476,
27,
20884,
18,
1364,
21,
865,
16,
1259,
13,
5,
262,
2079,
3878,
37,
1366,
6,
15,
47,
51,
13,
1409,
5366,
1409,
63,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to Naturally/Numerically Sort a DataView?
===
I am wondering how to naturally sort a DataView... I really need help on this. I found articles out there that can do lists with IComparable, but I need to sort the numbers in my dataview.
They are currently alpha sorted because they are numbers with 'commas' in them. Please help me out.
I would like to find something instead of spending the time to create it my self.
P.S. expression and sortdirection work, but they of course Alpha sort. Please help. | 0 | [
2,
184,
20,
8000,
118,
6336,
106,
8438,
2058,
21,
1054,
4725,
60,
800,
3726,
3726,
31,
589,
5712,
184,
20,
8000,
2058,
21,
1054,
4725,
9,
9,
9,
31,
510,
376,
448,
27,
48,
9,
31,
216,
3376,
70,
80,
30,
92,
107,
7227,
29,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Preallocating file space in C#?
===
I am creating a downloading application and I wish to preallocate room on the harddrive for the files before they are actually downloaded as they could potentially be rather large, and noone likes to see "This drive is full, please delete some files and try again." So, in that light, I wrote this.
// Quick, and very dirty
System.IO.File.WriteAllBytes(filename, new byte[f.Length]);
It works, atleast until you download a file that is several hundred MB's, or potentially even GB's and you throw Windows into a thrashing frenzy if not totally wipe out the pagefile and kill your systems memory altogether. Oops.
So, with a little more enlightenment, I set out with the following algorithm.
using (FileStream outFile = System.IO.File.Create(filename))
{
// 4194304 = 4MB; loops from 1 block in so that we leave the loop one
// block short
byte[] buff = new byte[4194304];
for (int i = buff.Length; i < f.Length; i += buff.Length)
{
outFile.Write(buff, 0, buff.Length);
}
outFile.Write(buff, 0, f.Length % buff.Length);
}
This works, well even, and doesn't suffer the crippling memory problem of the last solution. It's still slow though, especially on older hardware since it writes out (potentially GB's worth of) data out to the disk.
The question is this: Is there a better way of accomplishing the same thing? Is there a way of telling Windows to create a file of x size and simply allocate the space on the filesystem rather than actually write out a tonne of data. I don't care about initialising the data in the file at all (the protocol I'm using - bittorrent - provides hashes for the files it sends, hence worst case for random uninitialised data is I get a lucky coincidence and part of the file is correct). | 0 | [
2,
782,
192,
10799,
1880,
3893,
726,
19,
272,
5910,
60,
800,
3726,
3726,
31,
589,
2936,
21,
7121,
68,
3010,
17,
31,
2536,
20,
782,
19452,
9530,
337,
27,
14,
552,
14573,
26,
14,
6488,
115,
59,
50,
1121,
23887,
28,
59,
110,
9465,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Executing a script file from a Windows Installer Custom Action
===
I need to execute a batch file as part of the un-install process in a Windows installer project (standard OOTB VS 2008 installer project-vdproj). One cannot execute a bat file directly from the Custom Actions in the installer project, so I wrote a quick vbs script to call the required bat file.
vbs code:
Set WshShell = WScript.CreateObject( "WScript.Shell" )
command = "uninstall-windows-serivce.bat"
msgbox command
WshShell.Run ("cmd /C " & """" & command & """")
Set WshShell = Nothing
When this script is run independent of the uninstall, it works perfectly. However, when run as part of the uninstall, it does not execute the bat file (but the message box is shown, so I know the vbs file is called). No errors reported (at least that I can tell). Why doesn't this script work as part of the "Uninstall Custom Action"
| 0 | [
2,
25836,
21,
3884,
3893,
37,
21,
1936,
16146,
106,
5816,
1028,
800,
3726,
3726,
31,
376,
20,
15644,
21,
13064,
3893,
28,
141,
16,
14,
367,
8,
108,
21300,
953,
19,
21,
1936,
16146,
106,
669,
13,
5,
15566,
13,
4328,
11872,
4611,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should I inject things into my entities?
===
When using an IoC container, is it considered good design to inject other classes into them? i.e. a persistence class | 0 | [
2,
378,
31,
20316,
564,
77,
51,
12549,
60,
800,
3726,
3726,
76,
568,
40,
31,
2499,
12147,
15,
25,
32,
724,
254,
704,
20,
20316,
89,
2684,
77,
105,
60,
31,
9,
62,
9,
21,
28584,
718,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Something wrong in the datatime format.
===
When i compile the application in my laptop it runs fine but when i run the same application in the server something is wrong with the date format. But when i checked the system date time format wit my laptop and server it the same format. Can anyone tell me what is wrong. | 0 | [
2,
301,
1389,
19,
14,
1054,
891,
2595,
9,
800,
3726,
3726,
76,
31,
26561,
14,
3010,
19,
51,
12294,
32,
1461,
1123,
47,
76,
31,
485,
14,
205,
3010,
19,
14,
8128,
301,
25,
1389,
29,
14,
1231,
2595,
9,
47,
76,
31,
6505,
14,
329... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Assign variables with a regular expression
===
I'm looking for a method to assign variables with patterns in regular expressions with C++ .NET
something like
String^ speed;
String^ size;
"command SPEED=[speed] SIZE=[size]"
Right now I'm using IndexOf() and Substring() but it is quite ugly | 0 | [
2,
13952,
12157,
29,
21,
1290,
1803,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
2109,
20,
13952,
12157,
29,
6282,
19,
1290,
13832,
29,
272,
20512,
13,
9,
2328,
301,
101,
3724,
1,
1362,
73,
3724,
1,
1072,
73,
13,
7,
16239,
1362,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Modularity of Classes
===
Are there any tips or tricks to make my classes and application designs more modular? | 0 | [
2,
20802,
856,
16,
2684,
800,
3726,
3726,
50,
80,
186,
11034,
54,
13747,
20,
233,
51,
2684,
17,
3010,
4748,
91,
20802,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
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,
0,
0... |
wysiwyg Text Editor (for webpage)
===
I am looking for a lightweight simple wysiwyg editor for a site I am working on. I have seen a couple but not really be too impressed with them. Which ones would you guys recommend?
btw I need it to work on php4 and on ie6(there went half of em).
The one here on stack overflow is really nice. I noticed it was using jQuery, which is a plus become some of the other features on my site are using jquery. Is the source for it available(without me going in a just copying it? or maybe the original editor that this one was made from? | 0 | [
2,
5809,
18,
49,
7913,
263,
1854,
1835,
13,
5,
1106,
2741,
6486,
6,
800,
3726,
3726,
31,
589,
699,
26,
21,
13613,
1935,
5809,
18,
49,
7913,
263,
1835,
26,
21,
689,
31,
589,
638,
27,
9,
31,
57,
541,
21,
1335,
47,
52,
510,
44,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 the NetBeans code formatter be made to format javadoc comments?
===
The NetBeans 6.1 editor doesn't seem to like to wrap comments, and the code formatter seems to ignore them. For JavaDoc comments, this behaviour seems inappropriate, as you can end up spending a lot of wasted time manually reflowing paragraphs.
I was wondering if there's some magic setting to get the builtin code formatter, or the editor to wrap/reflow javadoc comments? | 0 | [
2,
92,
14,
4275,
863,
5950,
1797,
26,
24700,
44,
117,
20,
2595,
8247,
13799,
7534,
60,
800,
3726,
3726,
14,
4275,
863,
5950,
400,
9,
165,
1835,
1437,
22,
38,
2260,
20,
101,
20,
8118,
7534,
15,
17,
14,
1797,
26,
24700,
2206,
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... |
Information Hiding and Properties
===
Does Information Hiding mean I should minimize the number of properties my classes have? Is that right? Do you tend to make your classes private fields with methods? | 0 | [
2,
676,
5314,
17,
3704,
800,
3726,
3726,
630,
676,
5314,
884,
31,
378,
16713,
14,
234,
16,
3704,
51,
2684,
57,
60,
25,
30,
193,
60,
107,
42,
5480,
20,
233,
154,
2684,
932,
2861,
29,
3195,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Interfaces
===
In c#, we have interfaces. Where did these come from? They didn't exist in c++. | 0 | [
2,
6573,
18,
800,
3726,
3726,
19,
272,
5910,
15,
95,
57,
6573,
18,
9,
113,
144,
158,
340,
37,
60,
59,
223,
22,
38,
3182,
19,
272,
20512,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
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... |
How does one elaborate design using CRC cards?
===
I've always been wondering how people use CRC (class responsiblity collaboration) cards. I've read about them in books, found vague information on the internet, but never grasped it really. I think someone ought to make a youtube video showing a session with CRC cards, since one of my books described it as being very hard to formulate in text, that it should be "taught by someone who already masters it". Sadly, I know noone around here who uses CRC cards and I'd like to learn more.
| 0 | [
2,
184,
630,
53,
7541,
704,
568,
6186,
150,
4092,
60,
800,
3726,
3726,
31,
22,
195,
550,
74,
5712,
184,
148,
275,
6186,
150,
13,
5,
1898,
10719,
8782,
18,
49,
6287,
856,
4004,
6,
4092,
9,
31,
22,
195,
1302,
88,
105,
19,
964,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
DllRegisterServer entry point was not found
===
I'm having problems refreshing .Net 2.0 with IIS 6.
I have been able to successfully execute "aspnet\_regiss.exe -i", but when I try to register the aspnet\_isapi.dll:
regsvr32 “C:\WINDOWS\Microsoft.NET\Framework\v2.0.50727\aspnet_isapi.dll"
I get the error
C:\Windows\..\aspnet_isapi.dll was loaded, but the
DllRegisterServer entry point was not found.
The file cannot be registered.
Does anyone know how to resolve this? Google hasn't been very helpful. | 0 | [
2,
13,
43,
211,
12463,
9959,
10321,
106,
2792,
454,
23,
52,
216,
800,
3726,
3726,
31,
22,
79,
452,
1716,
27134,
13,
9,
2328,
172,
9,
387,
29,
595,
18,
400,
9,
31,
57,
74,
777,
20,
3673,
15644,
13,
7,
472,
306,
2328,
1,
99,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Windows XP - Create Shortcuts on Desktop and controll their placement
===
In any language really, im looking for a simple (very simple) way to control the position of a shortcut on the users desktop. I already make the assumption that Auto Arrange and Align to Grid are unchecked.
Ex: The program creates the shortcut to the desktop than places it at position (450,302) on the desktop.
I know how to create shortcuts, but i dont know how to control their placement on the desktop. | 0 | [
2,
1936,
23045,
13,
8,
1600,
502,
4118,
18,
27,
17404,
17,
569,
255,
66,
10774,
800,
3726,
3726,
19,
186,
816,
510,
15,
797,
699,
26,
21,
1935,
13,
5,
7864,
1935,
6,
161,
20,
569,
14,
649,
16,
21,
502,
4118,
27,
14,
3878,
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... |
What is the point of the Lowered* columns in asp.net membership tables?
===
What is the architectural reason for the column names prefixed with "Lowered" in the SQL schema for ASP.Net membership and friends? Some examples of the columns in question are below:
- aspnet_Applications.LoweredApplicationName
- aspnet_users.LoweredUserName
- aspnet_membership.LowerEmail
I see that the lowered columns are indexed, but it seems to me that you could just index the associated non-lowered column and leave out the apparent duplication.
I'm sure there is a good reason for them to exist, but I can't figure it out.
| 0 | [
2,
98,
25,
14,
454,
16,
14,
5817,
2483,
7498,
19,
28,
306,
9,
2328,
4363,
7484,
60,
800,
3726,
3726,
98,
25,
14,
5350,
1215,
26,
14,
4698,
1817,
14315,
69,
29,
13,
7,
17591,
69,
7,
19,
14,
4444,
255,
23874,
26,
28,
306,
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... |
Is anyone familiar with Jaxer? I'm looking for pros and cons.
===
I realize that this question has been [asked before][1], but it has been a month with no decent responses... I'm looking at [Aptana's Jaxer][2] and I find the concept to be very exciting.
Here is a quick overview for those who are not familiar with it:
Jaxer is, in their words, "the world's first true AJAX server". It is based on the Mozilla engine so scripts are written with javascript and you have complete access to the DOM on the server-side.
Scripts are placed on your pages with `<script>` tags and you can specify a `runat` attribute (ala ASP.NET) to mark scripts for execution on the client, server, both, or as a "server-proxy" which makes the functions available on the client, but they execute on the server via AJAX. This also means that you can use your favorite client-side libraries (jQuery, Prototype) on the server as well as the client.
It also can be used to process documents that are generated in another language (e.g. php, ruby) which I imagine is not practical except to help in transitioning existing applications to use Jaxer.
- What are the pros and cons?
- How mature/stable is it the API?
- How good is performance compared to
other server-side html
preprocessors?
- Has anyone used Jaxer with another
technology (php, pearl, ruby, etc.)
and what were your experiences?
[1]: http://stackoverflow.com/questions/10293/has-anyone-used-jaxer-in-production
[2]: http://www.aptana.com/jaxer | 0 | [
2,
25,
1276,
3694,
29,
11712,
106,
60,
31,
22,
79,
699,
26,
895,
18,
17,
11608,
9,
800,
3726,
3726,
31,
4007,
30,
48,
1301,
63,
74,
636,
20310,
69,
115,
500,
2558,
165,
500,
15,
47,
32,
63,
74,
21,
1617,
29,
90,
12238,
13231... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
programmatically find number of hosts in a Netmask
===
How do you programmatically find the number of hosts that a netmask supports.
Eg, If you have a /30 , how do you find how many IP's are in it without using a lookup table?
Preferably would be able to work with the "/" notation, rather than 255.xxx.xxx.xxx notation.
| 0 | [
2,
625,
6732,
1326,
477,
234,
16,
5397,
19,
21,
4275,
23265,
800,
3726,
3726,
184,
107,
42,
625,
6732,
1326,
477,
14,
234,
16,
5397,
30,
21,
4275,
23265,
6747,
9,
12369,
15,
100,
42,
57,
21,
13,
118,
1762,
13,
15,
184,
107,
42... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Managing the patch level of multiple windows systems
===
In an environment with multiple windows servers what is the best way to ensure patch compliance accross all systems?
Is there a simple tool (some sort of client/server app?) that allows reports to be generated showing the status of all the systems so any that aren't automatically patching themselves can be fixed without having to manually check each systemevery time an audit is needed?
| 0 | [
2,
5616,
14,
7331,
662,
16,
1886,
1936,
1242,
800,
3726,
3726,
19,
40,
2307,
29,
1886,
1936,
17595,
98,
25,
14,
246,
161,
20,
4062,
7331,
14969,
21,
150,
7703,
65,
1242,
60,
25,
80,
21,
1935,
5607,
13,
5,
3220,
2058,
16,
6819,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
wxWidgets: Detecting click event on custom controls
===
How to add a click event listener to my custom control made with wxWidgets? The custom control uses wxWindow as the base. On the event list I see
wxEVT_LEFT_DOWN
wxEVT_LEFT_UP
wxEVT_LEFT_DCLICK
wxEVT_MIDDLE_DOWN
wxEVT_MIDDLE_UP
wxEVT_MIDDLE_DCLICK
wxEVT_RIGHT_DOWN
wxEVT_RIGHT_UP
wxEVT_RIGHT_DCLICK
wxEVT_MOTION
wxEVT_ENTER_WINDOW
wxEVT_LEAVE_WINDOW
wxEVT_MOUSEWHEEL
But there is no `wxEVT_LEFT_CLICK` or similar. | 0 | [
2,
619,
396,
3976,
43,
3060,
18,
45,
9092,
68,
10840,
807,
27,
5816,
8671,
800,
3726,
3726,
184,
20,
3547,
21,
10840,
807,
21772,
20,
51,
5816,
569,
117,
29,
619,
396,
3976,
43,
3060,
18,
60,
14,
5816,
569,
2027,
619,
396,
27508... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 generate a newline in a cpp macro ?
===
How do I write a cpp macro which expands to include newlines?
| 0 | [
2,
184,
20,
7920,
21,
78,
1143,
19,
21,
272,
3421,
9069,
13,
60,
800,
3726,
3726,
184,
107,
31,
2757,
21,
272,
3421,
9069,
56,
6073,
18,
20,
468,
78,
7939,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Django views-calling data from models.py and showing it
===
I'm trying to show what I have in models.py on the page postlogin.html but even if there's data in the database, the page doesn't show anything. I think I'm having trouble calling the data with the part(posts = NewRecipePost.objects.all().order_by("-post_date")) in views.py. the code below is only part of the code and everything is correctly imported and correctly indented.
I'd appreciate your advice. Thanks
models.py
from django.db import models
class NewRecipePost(models.Model):
title = models.CharField('title', blank=False, max_length=50 )
post_date = models.DateField(auto_now_add=True)
ingredients = models.TextField('ingredients', max_length=1000)
content = models.TextField('content', max_length=1000)
def __unicode__(self):
return self.title
forms.py
from recipeapp.models import NewRecipePost
class NewRecipeForm(forms.ModelForm):
class Meta:
model = NewRecipePost
views.py
def my_view(request,username):
posts = NewRecipePost.objects.all().order_by("-post_date")
if request.method == 'POST':
form = NewRecipeForm(request.POST)
if form.is_valid():
form.save()
else:
form = NewRecipeForm()
variables = RequestContext(request, {'form':form,'username':username, 'posts':posts})
return render_to_response('postlogin.html',variables)
postlogin.html
<ul>
{% for post in posts.object_list %}
<div>{{post.title}}</div>
<div>{{post.post_date}}</div>
<ul>
<div>{{post.ingredients}}</div>
<div>{{post.content}}</div>
</ul>
{% endfor %}
</ul> | 0 | [
2,
3857,
14541,
4146,
8,
9200,
68,
1054,
37,
2761,
9,
6448,
17,
3187,
32,
800,
3726,
3726,
31,
22,
79,
749,
20,
298,
98,
31,
57,
19,
2761,
9,
6448,
27,
14,
2478,
678,
5567,
108,
9,
15895,
47,
166,
100,
80,
22,
18,
1054,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tab bar item third touch for a table view not scrolling to the top
===
I have a tab bar item which is connected navigation controller with a UIViewController as the root view controller. The first touch on the tab bar item switches to that view. The second touch pops to the root view controller. The third touch does **not** scroll to the top.
I've seen this scroll-to-top behavior in other apps, but after searching the webs, I cannot find out anything about it.
Is this default behavior for scroll views or table views attached to tab bar items, or is it something I need to implement myself? | 0 | [
2,
6523,
748,
9101,
422,
1723,
26,
21,
859,
1418,
52,
13,
28166,
20,
14,
371,
800,
3726,
3726,
31,
57,
21,
6523,
748,
9101,
56,
25,
2587,
8368,
9919,
29,
21,
13,
5661,
4725,
12898,
1252,
28,
14,
5900,
1418,
9919,
9,
14,
64,
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... |
Using ZSH as my shell and rspec "guard" doesn't have syntax highlighting
===
I can't figure out why ZSH won't apply the proper highlighting when I run guard. It stays the default terminal color. Everything else highlights appropriately and I'm using this exact same theme "daveverwer" on my other machine and guard highlights everything fine.
Any suggestions? | 0 | [
2,
568,
2052,
1635,
28,
51,
3593,
17,
13,
1224,
12610,
13,
7,
9499,
7,
1437,
22,
38,
57,
22649,
23102,
800,
3726,
3726,
31,
92,
22,
38,
1465,
70,
483,
2052,
1635,
230,
22,
38,
5645,
14,
4119,
23102,
76,
31,
485,
1611,
9,
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... |
Java to exe with referenced selenium libraries
===
Ive done some research on this but can not seem to figure out how to make a program work if it has referenced libraries. I have a java program with dependencies on the selenium 2.12 libraries and I require making the program into an exe because I will have to run this program across several computers that do not have java installed. I have looked into JSmooth which everyone seems to recommend. Has anyone had experience with this that can help me out in setting this up? | 0 | [
2,
8247,
20,
1396,
62,
29,
17571,
23027,
14311,
8649,
800,
3726,
3726,
5568,
677,
109,
527,
27,
48,
47,
92,
52,
2260,
20,
1465,
70,
184,
20,
233,
21,
625,
170,
100,
32,
63,
17571,
8649,
9,
31,
57,
21,
8247,
625,
29,
29411,
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... |
custom membership provider asp.net
===
I have a website that is already built using the default aspnet membership provider. I am looking to expand it in order to slightly modify the functions.
From my understanding, I would want to create a custom membership provider inheriting from the membership class, and then overload the functions. I got that far, but I was unable to figure out how to call the original validate user.
My goal was to change the validate user to something like...
public override bool ValidateUser(string userName, string password)
{
if(base.ValidateUser(userName, password))
{
\\Write to database that User logged in
return true;
}
return false;
}
However, when I tried that, base.ValidateUser(x,y) threw errors. How would I go about achieving what I want to? | 0 | [
2,
5816,
4363,
11747,
28,
306,
9,
2328,
800,
3726,
3726,
31,
57,
21,
2271,
30,
25,
614,
392,
568,
14,
12838,
28,
306,
2328,
4363,
11747,
9,
31,
589,
699,
20,
6073,
32,
19,
389,
20,
1847,
17579,
14,
3719,
9,
37,
51,
3260,
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... |
Ellipsize is not working
===
I have a TextView which i set the text using setText(). In properties, I have set:
Ellipsize = END
Lines = 1
Gravity = Left
Scroll Horizontal = False
But this clips extra text (clips text since where last space is found). But do not include dots ("...") at the end.
Example:
-------------------------------
| |
Hi how are you ? And where are you now ?
| |
| |
After clipping:
-------------------------------
| |
Hi how are you ? And where
| |
| |
What I want:
-------------------------------
| |
Hi how are you ? And where...
| |
| |
I am using Android 1.6. Plz help. | 0 | [
2,
931,
6013,
10454,
25,
52,
638,
800,
3726,
3726,
31,
57,
21,
1854,
4725,
56,
31,
309,
14,
1854,
568,
309,
11969,
5,
6,
9,
19,
3704,
15,
31,
57,
309,
45,
931,
6013,
10454,
800,
241,
1560,
800,
137,
8849,
800,
225,
12159,
1009... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# overwriting xml file
===
I'm trying to edit an xml and then save it with the same name.
I have the following code:
public int ModifyFile(string xmlpath, string option, int returnCode)
{
XmlDocument xmlDoc = new XmlDocument();
xmlDoc.Load(path);
XmlNode parentNode = xmlDoc.DocumentElement;
if (option.Equals("delete"))
{
returnCode = DeleteTag(parentNode, "identity", returnCode);
}
xmlDoc.Save(path);
return returnCode;
}
public int DeleteTag(XmlNode root, string deleteName, int returnCode)
{
foreach (XmlNode node in root.ChildNodes)
{
if (node.Name == deleteName)
{
root.RemoveChild(node);
returnCode = 1;
}
else
{
returnCode = DeleteTag(node, deleteName, returnCode);
}
}
return returnCode;
}
I'm getting "The process cannot access the file 'c:\\temp\\testfile.xml' because it is being used by another process" when it executes xmlDoc.Save(path).
How would I be able to save testfile.xml with the changes made? I need to keep the path and name the same.
Thanks in advance for any guidance. | 0 | [
2,
272,
5910,
84,
12646,
23504,
3893,
800,
3726,
3726,
31,
22,
79,
749,
20,
9392,
40,
23504,
17,
94,
2079,
32,
29,
14,
205,
204,
9,
31,
57,
14,
249,
1797,
45,
317,
19,
38,
17579,
16877,
5,
11130,
23504,
8353,
15,
3724,
4255,
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... |
Would a regular expression help this search string? IN: "abc d efg" OUT: ["%abc%","%efg%"]
===
Could this code be optimised with a regex?
search = search.split.delete_if{|s|s.length==1}.map{|s|s="%#{s}%"}
It takes a string, splits it into an array and removes any elements with a length of 1 and wraps each string in percent symbols ready for SQL.
IN: `"abc d efg"` OUT: `["%abc%","%efg%"]`
| 0 | [
2,
83,
21,
1290,
1803,
448,
48,
2122,
3724,
60,
19,
45,
13,
7,
21880,
13,
43,
11599,
263,
7,
70,
45,
636,
7,
11881,
21880,
11881,
7,
15,
7,
11881,
62,
19109,
11881,
7,
500,
800,
3726,
3726,
110,
48,
1797,
44,
19259,
2541,
29,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
iTunes Store RSS feed by Artist Id?
===
I'm having trouble configuring the URL to load an RSS feed of a particular artist's music into my app.
I'm using itunes XMLPerformace test Xcode project available on dev.apple. I simply want to change:
[NSURL URLWithString:@"http://ax.phobos.apple.com.edgesuite.net/WebObjects/MZStore.woa/wpa/MRSS/newreleases/limit=300/rss.xml"];
into something that will load an artist's songs into the table view instead of the newreleases.
This resource seems to suggest additional feed generator options are availble, just not readily.
http://www.apple.com/itunes/affiliates/resources/blog/introduction---rss-feed-generator.html
Has anyone come across this? | 0 | [
2,
12952,
1718,
13,
1224,
18,
4063,
34,
1169,
4924,
60,
800,
3726,
3726,
31,
22,
79,
452,
2572,
1065,
13549,
68,
14,
287,
6362,
20,
6305,
40,
13,
1224,
18,
4063,
16,
21,
1498,
1169,
22,
18,
232,
77,
51,
4865,
9,
31,
22,
79,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.NET Compress video stream on the fly?
===
I'm wondering if is it possible to compress the video stream while streaming using .NET (C#).
I mean, if I have a video on the web server and a client wants to stream it, I want to compress that stream while sending it to the client's app. The client's app will decompress that stream and then show the video. | 1 | [
2,
13,
9,
2328,
26060,
763,
3766,
27,
14,
2855,
60,
800,
3726,
3726,
31,
22,
79,
5712,
100,
25,
32,
938,
20,
26060,
14,
763,
3766,
133,
11920,
568,
13,
9,
2328,
13,
5,
150,
5910,
6,
9,
31,
884,
15,
100,
31,
57,
21,
763,
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... |
save a file in java
===
i am trying to save a file in java in this way
PrintWriter output = null;
int x=5, y = 6;
try {
saveFile = new FileOutputStream("myFile.txt");
save = new ObjectOutputStream(saveFile);
save.writeObject(x + y);
save.close();
} catch (FileNotFoundException e)
{
e.printStackTrace();
} catch (IOException e)
{
e.printStackTrace();
}
and it is working but how can i save an object from another class because it is giving me an error when i try to do it.
| 0 | [
2,
2079,
21,
3893,
19,
8247,
800,
3726,
3726,
31,
589,
749,
20,
2079,
21,
3893,
19,
8247,
19,
48,
161,
4793,
9657,
5196,
800,
16203,
73,
19,
38,
993,
3726,
264,
15,
13,
93,
800,
400,
73,
1131,
13,
1,
2079,
16877,
800,
78,
3893... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
iphone - What consumes less battery? StartmonitoringLocationsChanges or startmonitoringforregion?
===
I would like you to give me your feedback on which method consumes less battery.
My app will run in the background and will wake up with location changes, so I would like to use the method that consumes less battery.
Any ideas on which one it is?
Thanks | 0 | [
2,
21024,
13,
8,
98,
16447,
18,
787,
5044,
60,
799,
2111,
7478,
2090,
19032,
18,
16229,
18,
54,
799,
2111,
7478,
2090,
1106,
18790,
60,
800,
3726,
3726,
31,
83,
101,
42,
20,
590,
55,
154,
13111,
27,
56,
2109,
16447,
18,
787,
504... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Sencha Touch 1.1 nested list associations
===
I have the following problem, I can not fetch the data from the sublist, I am doing wrong?
yo estoy usando sencha y generando el archivo a txt en formato json
thanks for the reply.
my code:
//file lstCabDet.txt
{"root":[
{
"NumeroPedido":"0000000001",
"CodigoCliente":"100000",
"NombreCliente":"hskjdnd",
"NIF":"43065236",
"Detalle":[{
"DocumentoVenta":"0000000001",
"Posicion":"000010",
"CodigoMaterial":"000000000010000002",
"Material":"Prueba material 1"}]},
{
"NumeroPedido":"0000000002",
"CodigoCliente":"100000",
"NombreCliente":"hskdsnb",
"NIF":"43065236",
"Detalle":[{
"DocumentoVenta":"0000000002",
"Posicion":"000010",
"CodigoMaterial":"000000000010000002",
"Material":"Prueba material 1"}]
}]}
//Model
Ext.regModel('listaDocumentosModel', {
fields: [
{name: 'NumeroPedido', type: 'string'},
{name: 'CodigoCliente', type: 'string'},
{name: 'NombreCliente', type: 'string'},
{name: 'NIF', type: 'string'}
],
associations:[
{type: 'hasMany',
model: 'listaDocumentoDetalleModel', name: 'listaDocumentoDetalleModel'}
]
});
Ext.regModel('listaDocumentoDetalleModel',
{
fields:[
{name: 'DocumentoVenta', type: 'string'},
{name: 'Posicion', type: 'string'},
{name: 'CodigoMaterial', type: 'string'},
{name: 'Material', type: 'string'}
],
associations:[
{type: 'belongsTo', model: 'listaDocumentosModel'}
]
});
//Store
var listaDocumentosStore = new Ext.data.Store (
{
autoLoad: true,
model: 'listaDocumentosModel',
proxy:
{
id: 'listaDoc',
type: 'rest',
url: 'data/lstCabDet.txt',
reader:
{
type: 'json',
root : 'root'
}
}
});
//View Detail
var disDetDoc =
'<div>'+
'<div>'+
'<div>{NumeroPedido}</div>'+
'<div>{Posicion}</div>'+
'<div>{CodigoMaterial}</div>'+
'<div>{Material}</div>'
'</div>'+
'</div>';
detalleDocumento = Ext.extend(Ext.Panel,
{
layout: 'card',
initComponent: function()
{
this.dockedItems = [
{
xtype: 'toolbar',
dock: 'top',
title: 'Detalle documento',
items: [
{
ui: 'back',
text: 'Volver',
scope: this,
handler: function()
{
this.ownerCt.setActiveItem(this.prevCard,
{
type: 'slide',
reverse: true,
scope: this,
after: function()
{
this.destroy();
}
});
}
}]
}];
this.detalleDocPanel = new Ext.Panel(
{
layout: 'fit',
items: [
{
scroll: 'vertical',
data: this.record.data,
tpl: disDetDoc
}]
});
this.items = this.detalleDocPanel;
detalleDocumento.superclass.initComponent.call(this);
}
});
Ext.reg('detalleDocumento', detalleDocumento);
//View Master
var listDoc =
'<div class="materialItem">'+
'<div class="list-codigo">'+
'{NumeroPedido}'+
'{CodigoCliente}'+
'{NIF}'+
'{NombreCliente}'+
'</div>'
'</div>';
var lblRef = [{
xtype: 'fieldset',
defaults:
{
labelAlign: 'left',
labelWidth: '30%'
},
items: [
{
xtype: 'textfield',
label: 'Referencia',
useClearIcon: true
}]
}];
var buttonVolver = [{
ui: 'back',
text: 'Volver',
handler: function()
{
window.open("consultaDoc.html","_self");
}
},
{
xtype: 'spacer'
}
]
var dockedItems = [{
xtype: 'toolbar',
title: 'Lista de documentos',
dock: 'top',
ui: 'dark',
items: buttonVolver
}]
listaDocumentoView = Ext.extend(Ext.Panel,
{
fullscreen: true,
layout: 'card',
initComponent: function()
{
this.lDoc = new Ext.List({
id: 'listaDoc',
grouped: false,
itemTpl: listDoc,
loadingText: false,
store: listaDocumentosStore
});
this.lDoc.on('selectionchange', this.onSelect, this);
this.listaDocumentosPanel = new Ext.Panel(
{
layout: 'fit',
dockedItems: dockedItems,
items: this.lDoc,
listeners:
{
activate:
{
fn: function()
{
this.lDoc.getSelectionModel().deselectAll();
Ext.repaint();
},
scope: this
}
}
});
this.items = this.listaDocumentosPanel;
listaDocumentoView.superclass.initComponent.call(this);
},
onSelect: function(selectionmodel, records)
{
if (records[0] !== undefined)
{
var detalleDocCard = new detalleDocumento(
{
prevCard: this.listaDocumentosPanel,
record: records[0]
});
this.setActiveItem(detalleDocCard, 'slide');
}
}
});
Ext.reg('listaDocumentoView', listaDocumentoView); | 0 | [
2,
8252,
1651,
1723,
137,
9,
165,
5618,
69,
968,
10642,
800,
3726,
3726,
31,
57,
14,
249,
1448,
15,
31,
92,
52,
18312,
14,
1054,
37,
14,
972,
5739,
15,
31,
589,
845,
1389,
60,
3727,
11186,
7452,
182,
13869,
8252,
1651,
13,
93,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 convert facebook event start_time to local time ?
===
I need to show when event occurs in local time. <br>
1. What is time zone of start_time in [event][1] table ? <br>
2. How convert this time to local time. For example gmt+2
FQL:
fql?q={"eventmembers": 'select eid from event_member where uid = me()', 'events': 'select eid, name, tagline, pic_big, host, event_type, event_subtype, start_time, creator, location, venue from event where eid in (select eid from #eventmembers) and start_time > 1332337956'}
[1]: https://developers.facebook.com/docs/reference/fql/event/ | 0 | [
2,
184,
92,
31,
8406,
9090,
807,
799,
1,
891,
20,
375,
85,
13,
60,
800,
3726,
3726,
31,
376,
20,
298,
76,
807,
3690,
19,
375,
85,
9,
13,
1,
5145,
1,
137,
9,
98,
25,
85,
2464,
16,
799,
1,
891,
19,
636,
4943,
38,
500,
2558... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 there any large-scale commercial projects that use Squeak Smalltalk?
===
I've been learning Squeak Smalltalk & have noticed that it's got a really faithful community and is used in some large academic and open-source projects, but I haven't found any examples of it being used commercially in any significant way. I'm curious about how this environment is doing in the world commercially. Maybe taking over older Smalltalk projects? Does anyone know? | 0 | [
2,
50,
80,
186,
370,
8,
5093,
1439,
2314,
30,
275,
16604,
284,
9718,
60,
800,
3726,
3726,
31,
22,
195,
74,
2477,
16604,
284,
9718,
279,
57,
2711,
30,
32,
22,
18,
330,
21,
510,
10763,
514,
17,
25,
147,
19,
109,
370,
1810,
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... |
WCF netTCPBinding - Is transport encryption enough?
===
I've got a WCF service which handles some sensitive data. I'd like to make sure I keep that data from being exposed and so I'm looking at netTCPBinding... primarily because I can control the network it runs across and performance is a high priority.
I recognize that there are two areas that can be encrypted: transport level and message level. I intend to use certificates to encrypt at the transport level, which I understand uses TLS over TCP.
The calling clients are also mine and so I control the transport level. Since I anticipate no change in the transport layer, do I need to bother with message level encryption? It seems unnecessary unless I want the flexibility of changing the transport. | 0 | [
2,
11801,
410,
13,
11874,
7439,
22260,
13,
8,
25,
1739,
24420,
511,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
11801,
410,
365,
56,
3053,
18,
109,
7830,
1054,
9,
31,
22,
43,
101,
20,
233,
562,
31,
643,
30,
1054,
37,
142,
5043,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 obtain a list of site resources when writing a Maven2 site plugin?
===
When creating a plugin that executes in the default life-cycle, it's easy to obtain a reference to the project and its resources, but I'm getting a null instead of a MavenProject object when creating plugins that execute in the site life-cycle.
Any hints, tips or suggestions? | 0 | [
2,
98,
25,
14,
246,
161,
20,
5545,
21,
968,
16,
689,
2566,
76,
1174,
21,
1216,
3124,
135,
689,
10922,
108,
60,
800,
3726,
3726,
76,
2936,
21,
10922,
108,
30,
15644,
18,
19,
14,
12838,
201,
8,
12467,
15,
32,
22,
18,
2010,
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... |
SSRS Report designinng
===
It is possible to use stored procedure for designing Reports in Report builder. | 0 | [
2,
22118,
18,
1330,
704,
108,
2723,
800,
3726,
3726,
32,
25,
938,
20,
275,
8214,
7004,
26,
15026,
2813,
19,
1330,
14960,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
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,
0,
0... |
Handling browser pop-up windows with Selenium
===
We are running Selenium regression tests against our existing code base, and certain screens in our web app use pop-ups for intermediate steps.
Currently we use the commands in the test:
// force new window to open at this point - so we can select it later
selenium().getEval("this.browserbot.getCurrentWindow().open('', 'enquiryPopup')");
selenium().click("//input[@value='Submit']");
selenium().waitForPopUp("enquiryPopup", getWaitTime());
selenium().selectWindow("enquiryPopup");
...which works _most of the time_. Occasionally the test will fail on the `waitForPopUp()` line with
com.thoughtworks.selenium.SeleniumException: Permission denied
Can anyone suggest a better, more *reliable* method?
Also, we primarily run these tests on IE6 and 7
| 0 | [
2,
7988,
16495,
1675,
8,
576,
1936,
29,
23027,
14311,
800,
3726,
3726,
95,
50,
946,
23027,
14311,
27369,
4894,
149,
318,
3149,
1797,
1000,
15,
17,
1200,
14236,
19,
318,
2741,
4865,
275,
1675,
8,
15699,
26,
6889,
2382,
9,
871,
95,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does having a foreign data center affect company culture?
===
There are clear benefits to having foreign data centers- lower energy cost, lower human costs, less chance of a natural disaster wiping out the whole infrastructure, etc. Some countries even advertise to large companies.
Still, I've always wondered how something like this would fragment a corporate culture- how does a manager maintain a uniform feel when people are oceans apart? My company is considering a setup like this and I'm wondering what those with a similar setup think. | 0 | [
2,
184,
630,
452,
21,
1228,
1054,
459,
6245,
237,
1365,
60,
800,
3726,
3726,
80,
50,
1207,
5800,
20,
452,
1228,
1054,
6301,
8,
987,
1122,
1516,
15,
987,
585,
4227,
15,
787,
1504,
16,
21,
1112,
5302,
16740,
70,
14,
979,
5282,
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... |
Having trouble achieving 1Gbit UDP throughput
===
For UDP packets with a payload less then 1470, is it possible to achieve 1Gbit throughput? Due to the small packet size, there should be some bottlenecks in achieving such throughput (I/O, OS, network, etc.). I imagine drivers and hardware might have to be tuned to small packet/high throughput. Has anybody attempted successfully achieved 1Gbit throughput with small UDP packets? | 0 | [
2,
452,
2572,
11784,
137,
263,
3326,
287,
7431,
120,
4881,
800,
3726,
3726,
26,
287,
7431,
12795,
18,
29,
21,
18348,
787,
94,
513,
3318,
15,
25,
32,
938,
20,
4689,
137,
263,
3326,
120,
4881,
60,
397,
20,
14,
284,
12795,
1072,
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... |
ASP.NET webforms + ASP.NET Ajax versus ASP.NET MVC and Ajax framework freedom
===
If given the choice, which path would you take?
1. asp.net webforms + asp.net ajax
or
2. asp.net mvc + ajax framework of your choice (jquery, yui, prototype, etc).
<b>Focus point: Are their any limitations to #1, or hurdles since it is less 'free/open'</b>
| 0 | [
2,
28,
306,
9,
2328,
2741,
4190,
18,
2754,
28,
306,
9,
2328,
20624,
5706,
28,
306,
9,
2328,
307,
8990,
17,
20624,
6596,
2326,
800,
3726,
3726,
100,
504,
14,
1837,
15,
56,
2013,
83,
42,
247,
60,
137,
9,
28,
306,
9,
2328,
2741,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Getting BPL Versions at program start.
===
Is it possible to check what version of BPL (ie Rtl70.BPL, Indy70.bpl etc) are installed on a clients computer when the program starts?
I have had some programs crash because the BPL on there computer is different to the ones on the build machine.
If i have to add each BPL used into the installer on each update, i think it will defeat one of the points on using them.
Delphi 7, if it makes a differnt
| 0 | [
2,
1017,
334,
5727,
3281,
35,
625,
799,
9,
800,
3726,
3726,
25,
32,
938,
20,
2631,
98,
615,
16,
334,
5727,
13,
5,
660,
761,
7786,
3318,
9,
220,
5727,
15,
19,
1851,
3318,
9,
220,
5727,
2722,
6,
50,
4066,
27,
21,
7421,
1428,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
copying data from production to test server without erasing schema
===
Using sql server 2000, I would like to take my production data and put it in my test database, but I don't want to overwrite the schema of the test database as there are fields in it that I haven't added to production yet. Can this be done? | 0 | [
2,
4344,
68,
1054,
37,
637,
20,
1289,
8128,
366,
2047,
18,
68,
23874,
800,
3726,
3726,
568,
4444,
255,
8128,
824,
15,
31,
83,
101,
20,
247,
51,
637,
1054,
17,
442,
32,
19,
51,
1289,
6018,
15,
47,
31,
221,
22,
38,
259,
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... |
Non-Compete Clauses
===
Do you agree with / have you ever signed a non-compete clause? What advice do you have, if I wanted to hire someone, about Non Competes? Not non-disclosures, mind you. Non-Competes.. | 2 | [
2,
538,
8,
11103,
11258,
9040,
18,
800,
3726,
3726,
107,
42,
4524,
29,
13,
118,
57,
42,
462,
908,
21,
538,
8,
11103,
11258,
9040,
60,
98,
4978,
107,
42,
57,
15,
100,
31,
417,
20,
10039,
737,
15,
88,
538,
16864,
60,
52,
538,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Would it be useful to have method return values for null objects?
===
Would it be useful to be able to provide method return value for null objects?
For a List the null return values might be:
<pre>
get(int) : null
size() : 0
iterator() : empty iterator
</pre>
That would allow the following code that has less null checks.
<pre>
List items = null;
if(something) {
items = ...
}
for(int index = 0; index < items.size(); index++) {
Object obj = items.get(index);
}
</pre>
This would only be used if the class or interface defined it and a null check would still work. Sometimes you don't want to do null checks so it seems like it could be beneficial to have this as an option.
From: [http://jamesjava.blogspot.com/2007/05/method-return-values-for-null-objects.html][1]
[1]: http://jamesjava.blogspot.com/2007/05/method-return-values-for-null-objects.html | 0 | [
2,
83,
32,
44,
4811,
20,
57,
2109,
788,
4070,
26,
16203,
3916,
60,
800,
3726,
3726,
83,
32,
44,
4811,
20,
44,
777,
20,
1181,
2109,
788,
1923,
26,
16203,
3916,
60,
26,
21,
968,
14,
16203,
788,
4070,
530,
44,
45,
13,
1,
3515,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Generate a current datestamp in Java
===
What is the best way to generate a current datestamp in Java when not using a database?
YYYY-MM-DD:hh-mm-ss | 0 | [
2,
7920,
21,
866,
4076,
38,
10158,
19,
8247,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
7920,
21,
866,
4076,
38,
10158,
19,
8247,
76,
52,
568,
21,
6018,
60,
13,
93,
93,
93,
93,
8,
3363,
8,
8096,
45,
10681,
8,
3363,
8,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Mips - Is it important?
===
My question: Is the mips programming language that benificial to know?
I'm a CS student and am taking a assembly class which focuses on Mips. I'm very comfortable writing in high level languages, but Mips has me a little bit down.
Is Mips something that I should really focus on and try to completely grasp it? Will it help me in the future? | 0 | [
2,
534,
1919,
13,
8,
25,
32,
681,
60,
800,
3726,
3726,
51,
1301,
45,
25,
14,
534,
1919,
3143,
816,
30,
1519,
821,
49,
19034,
20,
143,
60,
31,
22,
79,
21,
272,
18,
1209,
17,
589,
741,
21,
1475,
718,
56,
7155,
27,
534,
1919,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Would Automatic Casts be useful?
===
Is there any downside or problem potential to change the Java compiler to automatically cast? In the example below the result of list.get(0) would automatically be casted to the type of the variable hi.
List list = new ArrayList();
list.add("hi");
String hi = list.get(0);
I know that generics allow you to reduce casting but they do so at the expense of making declaration more difficult. To me, the benefit of generics is that they allow you to have the complier enforce more rules -- not they they reduce casting (but I haven't used them much so I am somewhat uninformed). This proposal would only reduce the amount of code to type, not move it to another place.
Also there are instances where generics can't be used because a collection can have different objectis.
If that "looks too surprising" based on current usage maybe there could be a syntax tweak to use it.
From: [http://jamesjava.blogspot.com/2007/01/automatic-casting.html][1]
[1]: http://jamesjava.blogspot.com/2007/01/automatic-casting.html | 0 | [
2,
83,
6715,
1325,
18,
44,
4811,
60,
800,
3726,
3726,
25,
80,
186,
125,
1416,
54,
1448,
2222,
20,
753,
14,
8247,
21486,
20,
7499,
1325,
60,
19,
14,
823,
1021,
14,
829,
16,
968,
9,
3060,
5,
387,
6,
83,
7499,
44,
1325,
69,
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 you make vim unhighlight what you searched for?
===
I search for "nurple" in a file. I found it, great. But now, every occurrence of "nurple" is rendered in sick black on yellow. Forever.
Forever, that is, until I search for something I know won't be found, such as "asdhfalsdflajdflakjdf" simply so it clears the previous search highlighting.
Can't I just hit a magic key to kill the highlights when I'm done searching? | 0 | [
2,
184,
107,
42,
233,
1790,
79,
367,
4542,
3130,
98,
42,
9036,
26,
60,
800,
3726,
3726,
31,
2122,
26,
13,
7,
18662,
5106,
7,
19,
21,
3893,
9,
31,
216,
32,
15,
374,
9,
47,
130,
15,
352,
12933,
16,
13,
7,
18662,
5106,
7,
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... |
Iterate with for loop or while loop?
===
I often see code like:
Iterator i = list.iterator();
while(i.hasNext()) {
...
}
but I write that (when Java 1.5 isn't available or for in can't be used) as:
for(Iterator i = list.iterator(); i.hasNext(); ) {
...
}
because
- It is shorter
- It keeps i in a smaller scope
- It reduces the chance of confusion. (Is i used outside the
while? Where is i declared?)
I think code should be as simple to understand as possible so that I only have to make complex code to do complex things. What do you think? Which is better?
From: [http://jamesjava.blogspot.com/2006/04/iterating.html][1]
[1]: http://jamesjava.blogspot.com/2006/04/iterating.html | 0 | [
2,
32,
106,
1373,
29,
26,
5293,
54,
133,
5293,
60,
800,
3726,
3726,
31,
478,
196,
1797,
101,
45,
32,
106,
3457,
31,
800,
968,
9,
242,
106,
3457,
5,
6,
73,
133,
5,
49,
9,
6482,
20021,
5,
6,
6,
13,
1,
13,
9,
9,
9,
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... |
Should selecting by first letter show as many as possible that start with that letter?
===
When I am in a list and I press a letter to jump to the first entry that starts with that letter why does it leave that entry on the bottom of the visible entries? It should make the entry the top visable entry so that many entries that start with that letter can be seen.
In more concrete terms if I am selecting a state from a drop-down list and press "w" it should make "Washington" visible at the top instead of the bottom so that I can see Wisconsin without scrolling.
Agreed? Are there good reasons to keep it the current way?
From: [http://jamesjava.blogspot.com/2005/05/gui-designers-take-note-selecting-by.html][1]
[1]: http://jamesjava.blogspot.com/2005/05/gui-designers-take-note-selecting-by.html | 0 | [
2,
378,
20764,
34,
64,
1748,
298,
28,
151,
28,
938,
30,
799,
29,
30,
1748,
60,
800,
3726,
3726,
76,
31,
589,
19,
21,
968,
17,
31,
901,
21,
1748,
20,
3936,
20,
14,
64,
2792,
30,
3244,
29,
30,
1748,
483,
630,
32,
767,
30,
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... |
Is there any way to get access to the DOM from Objective-C when using UIWebView?
===
UIWebView is fine for displaying HTML, but I'd like to modify the loaded DOM from my Objective-C program. Does anybody know how to do that? This is a third party page, so I can't really include any custom JS to do so...unless I can modify the DOM somehow. | 0 | [
2,
25,
80,
186,
161,
20,
164,
1381,
20,
14,
11859,
37,
7038,
8,
150,
76,
568,
13,
5661,
14113,
4725,
60,
800,
3726,
3726,
13,
5661,
14113,
4725,
25,
1123,
26,
17418,
13,
15895,
15,
47,
31,
22,
43,
101,
20,
17579,
14,
8572,
118... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
RMI server: rmiregistry or LocateRegistry.createRegistry
===
For RMI on server-side, do we need to start `rmiregistry` program, or just call `LocateRegistry.createRegistry`?
If both are possible, what are the advantages and disadvantages? | 0 | [
2,
761,
1435,
8128,
45,
761,
20503,
12469,
5840,
54,
12717,
12463,
702,
622,
9,
14946,
815,
15287,
18,
5840,
800,
3726,
3726,
26,
761,
1435,
27,
8128,
8,
1416,
15,
107,
95,
376,
20,
799,
13,
1,
139,
20503,
12469,
5840,
1,
625,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the most common feature that demands the use of Visual Studio Professional over Standard?
===
I'm afraid my trial of VS 2008 is running out soon, and unless a client pays for it, I might be shelling out some cash for it. I've been looking through the [comparison chart][1] to compare VS Professional to Standard, and so far I think I'm safe. I wanted to hear from you on what the most important features are that I would be missing.
Of course, you don't know all the details of my situation - but please just answer based off of what you perceive as most important.
[1]: http://msdn.microsoft.com/en-us/vs2008/products/cc149003.aspx | 0 | [
2,
98,
25,
14,
127,
757,
1580,
30,
7311,
14,
275,
16,
3458,
1120,
736,
84,
1236,
60,
800,
3726,
3726,
31,
22,
79,
2910,
51,
2178,
16,
4611,
570,
25,
946,
70,
651,
15,
17,
4003,
21,
6819,
16058,
26,
32,
15,
31,
530,
44,
3593,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# COM Office Automation - RPC_E_SYS_CALL_FAILED
===
I'm writing a C# program that acts as a PowerPoint 2007 plugin. On some machines, some calls to the PowerPoint object model throws a COMException with the message RPC_E_SYS_CALL_FAILED. I couldn't find any specific advice on what to do regarding this error, or how to avoid it. From Googling it looks like something to do with the message queue or Single-Threaded Apartments. Or am I way off?
Example of the error message is:
System call failed. (Exception from HRESULT: 0x80010100 (RPC_E_SYS_CALL_FAILED))
at Microsoft.Office.Interop.PowerPoint._Presentation.get_FullName()
Unfortunately, the problem is occurring on a client's machine, so I have no easy way to debug it! Should I just retry the calls whenever I get this error?
Any advice to help me resolve this problem would be greatly appreciated! | 0 | [
2,
272,
5910,
13,
960,
488,
23217,
13,
8,
761,
5779,
1,
62,
1,
4980,
18,
1,
9200,
1,
24910,
69,
800,
3726,
3726,
31,
22,
79,
1174,
21,
272,
5910,
625,
30,
3167,
28,
21,
414,
3132,
624,
10922,
108,
9,
27,
109,
6035,
15,
109,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Would it be useful to add extra info to stack traces?
===
Would it be useful to be able to mark objects where the value ofString.valueOf() would included in any stack trace. In my example below I used "trace". Variables that aren't declared at the point of the stack trace would just be ingored.
It would make debugging much easier and make it much easier to write programs that are easy to debug.
Example stack trace for the code below:
<pre>java.lang.NullPointerException:
at Test.main(Test.java:7) index=0, sum=3, obj=null
</pre>
<pre>
public class Test {
Object obj;
public void main(String[] args) trace obj {
trace int sum = 0;
for(trace int index = 0; index < args.length; index++) {
sum += Integer.parseInt(args[index]);
sum += obj.hashCode();//Will cause NullPointerException
}
}
}
</pre>
From: [http://jamesjava.blogspot.com/2005/04/extra-info-in-stack-traces.html][1]
[1]: http://jamesjava.blogspot.com/2005/04/extra-info-in-stack-traces.html | 0 | [
2,
83,
32,
44,
4811,
20,
3547,
2230,
15404,
20,
7566,
10738,
60,
800,
3726,
3726,
83,
32,
44,
4811,
20,
44,
777,
20,
943,
3916,
113,
14,
1923,
16,
11130,
9,
15165,
1041,
5,
6,
83,
506,
19,
186,
7566,
5565,
9,
19,
51,
823,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
At as deep of a level as possible, how are virtual functions implemented?
===
We all know what virtual functions are in C++, but how are they implemented at a deep level? | 0 | [
2,
35,
28,
855,
16,
21,
662,
28,
938,
15,
184,
50,
6599,
3719,
6807,
60,
800,
3726,
3726,
95,
65,
143,
98,
6599,
3719,
50,
19,
272,
20512,
15,
47,
184,
50,
59,
6807,
35,
21,
855,
662,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Is there any downside to redundant qualifiers? Any benefit?
===
For example, referencing something as System.Data.Datagrid as opposed to just Datagrid. Please provide examples and explanation. Thanks. | 0 | [
2,
25,
80,
186,
125,
1416,
20,
24295,
8939,
18,
60,
186,
4234,
60,
800,
3726,
3726,
26,
823,
15,
13,
29254,
301,
28,
329,
9,
18768,
9,
18768,
16375,
28,
3499,
20,
114,
1054,
16375,
9,
2247,
1181,
3770,
17,
5764,
9,
3669,
9,
3,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Would it be useful to include the class name and variable name in any NullPointerException message?
===
Would it be useful to include the class name and variable name in any NullPointerException message? I know that it might not always be possible because of changes made by a JIT but is seems like the info should be available often (class members, etc).
From: [http://jamesjava.blogspot.com/2005/04/what-was-null.html][1]
[1]: http://jamesjava.blogspot.com/2005/04/what-was-null.html | 0 | [
2,
83,
32,
44,
4811,
20,
468,
14,
718,
204,
17,
7612,
204,
19,
186,
16203,
3132,
106,
10066,
872,
2802,
60,
800,
3726,
3726,
83,
32,
44,
4811,
20,
468,
14,
718,
204,
17,
7612,
204,
19,
186,
16203,
3132,
106,
10066,
872,
2802,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Would it be useful to change java to support both static and dynamic types?
===
What if a Java allow both static and dynamic types. That might allow the best of both worlds. i.e.:
String str = "Hello";
var temp = str;
temp = 10;
1. Would that be possible?
2. Would that be beneficial?
3. Do any languages currently support that and how well does it work out? | 0 | [
2,
83,
32,
44,
4811,
20,
753,
8247,
20,
555,
156,
12038,
17,
7782,
2551,
60,
800,
3726,
3726,
98,
100,
21,
8247,
1655,
156,
12038,
17,
7782,
2551,
9,
30,
530,
1655,
14,
246,
16,
156,
126,
18,
9,
31,
9,
62,
9,
45,
3724,
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... |
Grab a ProgressEvent from a POST upload in as3
===
Is there any way to track the status of a posted upload in AS3? There is a ProgressEvent, but it gives data back about the response, not the actual POST upload. I'm posting binary data for an image, so it's usually in the 50-100kb range.
The image data was generated inside Flash itself, so I can't use the upload method - at least as far as I know.
Thanks! | 0 | [
2,
4931,
21,
3455,
4943,
38,
37,
21,
678,
71,
8294,
19,
28,
240,
800,
3726,
3726,
25,
80,
186,
161,
20,
792,
14,
1782,
16,
21,
6054,
71,
8294,
19,
28,
240,
60,
80,
25,
21,
3455,
4943,
38,
15,
47,
32,
2352,
1054,
97,
88,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I change the colors displayed in cygwin rxvt?
===
When I use "\[\e[34m\]sometext" i get sometext in blue, but can I specify the shade of blue somewhere? | 0 | [
2,
184,
107,
31,
753,
14,
5268,
6115,
19,
6728,
263,
4181,
13,
21141,
710,
38,
60,
800,
3726,
3726,
76,
31,
275,
13,
7,
1,
2558,
1,
62,
2558,
3965,
79,
1,
500,
3220,
11969,
7,
31,
164,
109,
11969,
19,
705,
15,
47,
92,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
PHP Associative arrays to and from XML
===
Is there an easy way to marshal a PHP associative array to and from XML? For example, if I have the following array:
$items = array("1", "2",
array(
"item3.1" => "3.1",
"item3.2" => "3.2"
"isawesome" => true
)
);
How would I turn it into something similar to the following XML in as few lines as possible, then back again:
<items>
<item>1</item>
<item>2</item>
<item>
<item3_1>3.1</item3_1>
<item3_2>3.2</item3_2>
<isawesome>true</isawesome>
</item>
</items>
I don't really care if I have to change the array structure a bit or if the XML that comes out is different to the above example. I've been trying to work with PHP's [XMLReader][1] and [XMLWriter][2], but the documentation is so poor and the code I've produced as a consequence looks nothing like what I feel it should look like:
$xml = SomeXMLWriter::writeArrayToXml($items);
$array = SomeXMLWriter::writeXmlToArray($xml);
Does it really have to be any harder than that to get a basic, raw XML dump of a PHP array without writing my own custom class?
[1]: http://au.php.net/manual/en/book.xmlreader.php
[2]: http://au.php.net/manual/en/book.xmlwriter.php | 0 | [
2,
13,
26120,
28,
18,
16325,
3366,
7718,
18,
20,
17,
37,
23504,
800,
3726,
3726,
25,
80,
40,
2010,
161,
20,
7583,
21,
13,
26120,
28,
18,
16325,
3366,
7718,
20,
17,
37,
23504,
60,
26,
823,
15,
100,
31,
57,
14,
249,
7718,
45,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to test if a line segment intersects an axis-aligned rectange in 2D?
===
How to test if a line segment intersects an axis-aligned rectange in 2D? The segment is defined with its two ends: p1, p2. The rectangle is defined with top-left and bottom-right points. | 0 | [
2,
184,
20,
1289,
100,
21,
293,
5631,
20207,
40,
8577,
8,
12740,
6042,
12113,
62,
19,
172,
43,
60,
800,
3726,
3726,
184,
20,
1289,
100,
21,
293,
5631,
20207,
40,
8577,
8,
12740,
6042,
12113,
62,
19,
172,
43,
60,
14,
5631,
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... |
Anyone know of a good Ruby on Rails 2.1 Tutorial?
===
I'm new to Ruby on Rails, but not to MVC web development, having cut my teeth on Turbogears, Django, etc.
I'm having trouble finding a piece of good intro documentation to Ruby on Rails -- either the tutorial is for RoR 1.x, or the tutorial is for RoR 2.1.x, but assumes that you already know how RoR works.
Does anyone know of a tutorial that covers RoR 2.1, from the perspective of a newcomer? | 0 | [
2,
1276,
143,
16,
21,
254,
10811,
27,
2240,
18,
172,
9,
165,
29724,
60,
800,
3726,
3726,
31,
22,
79,
78,
20,
10811,
27,
2240,
18,
15,
47,
52,
20,
307,
8990,
2741,
522,
15,
452,
1077,
51,
2355,
27,
12036,
834,
5446,
15,
3857,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 reference on how java executes bytecode?
===
I'm interested in how java organizes memory and executes code (like what gets put in the stack or the heap), from the start of main, to assigning variables, calling functions, passing parameters, returning values, instantiating objects, etc. Has anyone found a good, beginner-friendly article/reference on it? Preferably online, of course, but any suggestions or answers will be greatly appreciated. Thanks. | 0 | [
2,
25,
80,
21,
254,
2801,
27,
184,
8247,
15644,
18,
34,
591,
9375,
60,
800,
3726,
3726,
31,
22,
79,
3158,
19,
184,
8247,
9213,
18,
1912,
17,
15644,
18,
1797,
13,
5,
1403,
98,
3049,
442,
19,
14,
7566,
54,
14,
15414,
6,
15,
37... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I fix this Subversion MKCOL error?
===
When I commit I get this error from Subversion:
bash-2.05b$ svn commit -m "testing subversion, still"
Adding baz
svn: Commit failed (details follow):
svn: MKCOL of '/viper/!svn/wrk/6b9bcd38-b2fe-0310-95ff-9d1a44098866/sandboxes/ohammersmith/trunk/baz': 405 Method Not Allowed (http://svn.example.com)
| 0 | [
2,
184,
107,
31,
6098,
48,
972,
10898,
10804,
7771,
7019,
60,
800,
3726,
3726,
76,
31,
9686,
31,
164,
48,
7019,
37,
972,
10898,
45,
13158,
8,
135,
9,
4071,
220,
4403,
13,
18,
16578,
9686,
13,
8,
79,
13,
7,
10543,
68,
972,
1089... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 folder exists in objc?
===
How to check if a folder exists in objective-c?
| 0 | [
2,
184,
20,
2631,
100,
21,
19294,
5636,
19,
5122,
15864,
60,
800,
3726,
3726,
184,
20,
2631,
100,
21,
19294,
5636,
19,
7038,
8,
150,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is the easiest stand-alone FLV player to use?
===
I have video that I've converted to FLV format. I'd rather host it on my own site than use a service like YouTube. What is the easiest player to use? I'd like to just put the .swf file of the player somewhere on my server, and give it the video as a parameter. | 4 | [
2,
98,
25,
14,
27237,
1261,
8,
17979,
398,
8916,
517,
20,
275,
60,
800,
3726,
3726,
31,
57,
763,
30,
31,
22,
195,
3494,
20,
398,
8916,
2595,
9,
31,
22,
43,
864,
2015,
32,
27,
51,
258,
689,
119,
275,
21,
365,
101,
7330,
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 define a polygot programmer?
===
What is your definition of a polygot programmer? | 0 | [
2,
184,
107,
42,
9267,
21,
3446,
7597,
17968,
60,
800,
3726,
3726,
98,
25,
154,
5465,
16,
21,
3446,
7597,
17968,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
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,
0,
0,
0... |
Best way to strengthen teamwork between development and QA departments?
===
I work as the Sysadmin for both the development and QA departments of a software development company. I support both teams equally. Recently I was asked for some ideas on how to improve inter-team communication.
First, what are some ways to improve the relationship between a development and QA team, from the developer's point of view?
Second, what are some things you look for from a System Administrator as far as interaction? Leave you alone? Email? IM? Personal office-time? How can I improve my relationship with developers? | 0 | [
2,
246,
161,
20,
13772,
173,
3783,
128,
522,
17,
7234,
8627,
60,
800,
3726,
3726,
31,
170,
28,
14,
10315,
18,
1283,
2160,
26,
156,
14,
522,
17,
7234,
8627,
16,
21,
2306,
522,
237,
9,
31,
555,
156,
952,
7634,
9,
1989,
31,
23,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does writing and speaking on software make you a better programmer?
===
Do you think that writing about software (i.e. having a blog) and speaking on software (and concepts) make you a better programmer?
| 0 | [
2,
630,
1174,
17,
3324,
27,
2306,
233,
42,
21,
574,
17968,
60,
800,
3726,
3726,
107,
42,
277,
30,
1174,
88,
2306,
13,
5,
49,
9,
62,
9,
452,
21,
8146,
6,
17,
3324,
27,
2306,
13,
5,
290,
8700,
6,
233,
42,
21,
574,
17968,
60,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Retrieving multiple rows into a listview control from an ODBC source works well for simple SELECTs with a statement attribute of SQL_SCROLLABLE. How do I do this with a UNION query?
===
I am retrieving multiple rows into a listview control from an ODBC source. For simple SELECTs it seems to work well with a statement attribute of SQL_SCROLLABLE. How do I do this with a UNION query (with two selects)?
The most likely server will be MS SQL Server (probably 2005). The code is 'c' for the Win32 API.
This code sets (what I think is) a server side cursor which feeds data into the ODBC driver that roughly corresponds with the positional fetches of SQLFetchScroll, which is turn feeds the cache for the listview. (Sometimes using SQL_FETCH_FIRST or SQL_FETCH_LAST as well as):
<pre>
SQLSetStmtAttr(hstmt1Fetch,
SQL_ATTR_CURSOR_SCROLLABLE,
(SQLPOINTER)SQL_SCROLLABLE,
SQL_IS_INTEGER);
SQLSetStmtAttr(hstmt1Fetch,
SQL_ATTR_CURSOR_SENSITIVITY,
(SQLPOINTER)SQL_INSENSITIVE,
SQL_IS_INTEGER);
...
retcode = SQLGetStmtAttr( hstmt1Fetch,
SQL_ATTR_ROW_NUMBER,
&CurrentRowNumber,
SQL_IS_UINTEGER,
NULL);
...
retcode = SQLFetchScroll(hstmt1Fetch, SQL_FETCH_ABSOLUTE, Postion);
</pre>
(The above is is a fragment from working code for a single SELECT).
Is this the best way to do it? Given that I need to retrieve the last row to get the number of rows and populate the end buffer is there a better way of doing it? (Can I use forward only scrolling?)
Assuming yes to the above, how do I achieve the same result with a UNION query?
| 0 | [
2,
13,
6239,
3272,
8397,
1886,
11295,
77,
21,
968,
4725,
569,
37,
40,
12340,
7229,
1267,
693,
134,
26,
1935,
5407,
18,
29,
21,
3331,
35,
14755,
16,
4444,
255,
1,
3862,
8694,
579,
9,
184,
107,
31,
107,
48,
29,
21,
667,
25597,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
how to handle code that is deemed dangerous to change, but stable?
===
What is the best way to handle a big team that has access to a stable but no so pretty code, that is easy to introduce bugs into?
I'm looking for something along the lines of SVN locking the file(s). | 0 | [
2,
184,
20,
3053,
1797,
30,
25,
7997,
3342,
20,
753,
15,
47,
4521,
60,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
3053,
21,
580,
173,
30,
63,
1381,
20,
21,
4521,
47,
90,
86,
1772,
1797,
15,
30,
25,
2010,
20,
8500,
13925,
77,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Visual C++/Studio: Application configuration incorrect?
===
My C(++) program, written and compiled using Visual C(++)/Visual Studio, runs fine on my own machine, but refuses to run on another machine. The error message I get is "This application has failed to start because the application configuration is incorrect. Reinstalling the application may fix this problem." | 0 | [
2,
3458,
272,
20512,
118,
21026,
45,
3010,
8091,
18867,
60,
800,
3726,
3726,
51,
272,
5,
20512,
6,
625,
15,
642,
17,
9316,
568,
3458,
272,
5,
20512,
6,
118,
20893,
1120,
15,
1461,
1123,
27,
51,
258,
1940,
15,
47,
10864,
20,
485,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is your favorite (insert language here) conference?
===
I am curious to know what people consider the best conference to go to for each realm of development languages.
For instance, in the .NET world, there is DevConnections and Alt.NET. The DevConnections conferences are pretty good, but I learn so much more from Alt.NET and Continuous Improvement conferences. | 4 | [
2,
98,
25,
154,
3839,
13,
5,
108,
18,
6767,
816,
235,
6,
1199,
60,
800,
3726,
3726,
31,
589,
7686,
20,
143,
98,
148,
3563,
14,
246,
1199,
20,
162,
20,
26,
206,
6640,
16,
522,
2556,
9,
26,
4851,
15,
19,
14,
13,
9,
2328,
126... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I change the colors of an arbitrary widget in GTK+?
===
If I'm writing an application that wants to communicate some information through the use of color, how can I change the background and foreground colors of a given widget? I would like to know how to do this in glade if it's possible, as well as programmatically (to a computed color).
I want to know how to do this to a complex widget as well, for example, an `HBox` that contains a `VBox` that contains some `Labels`.
Ideally this would also include a solution solution that allows me to *tint* the widget's existing colors, and identify the average colors of any images in use by the theme, so that I can programmatically compensate for any color choices which might make text unreadable or otherwise clashing - but I would be happy if I could just turn a button red. | 0 | [
2,
184,
107,
31,
753,
14,
5268,
16,
40,
17237,
4807,
43,
3060,
19,
9509,
197,
2430,
60,
800,
3726,
3726,
100,
31,
22,
79,
1174,
40,
3010,
30,
2846,
20,
8709,
109,
676,
120,
14,
275,
16,
1665,
15,
184,
92,
31,
753,
14,
2395,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 different ways of implementing a plugin system?
===
I'm not looking so much for language-specific answers, just general models for implementing a plugin system (if you want to know, I'm using Python). I have my own idea (register callbacks, and that's about it), but I know others exist. What's normally used, and what else is reasonable? | 0 | [
2,
98,
50,
109,
421,
2847,
16,
17333,
21,
10922,
108,
329,
60,
800,
3726,
3726,
31,
22,
79,
52,
699,
86,
212,
26,
816,
8,
9219,
6709,
15,
114,
297,
2761,
26,
17333,
21,
10922,
108,
329,
13,
5,
821,
42,
259,
20,
143,
15,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does several levels of base classes slow down a class/struct in c++?
===
Does having several levels of base classes slow down a class? A derives B derives C derives D derives F derives G, ...
Does multiple inheritance slow down a class? | 0 | [
2,
630,
238,
2216,
16,
1000,
2684,
2276,
125,
21,
718,
118,
10346,
19,
272,
20512,
60,
800,
3726,
3726,
630,
452,
238,
2216,
16,
1000,
2684,
2276,
125,
21,
718,
60,
21,
13049,
334,
13049,
272,
13049,
13,
43,
13049,
398,
13049,
489... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Is it possible to get Code Coverage Analysis on an Interop Assembly?
===
The basic problem here as I see it is that an interop assembly doesn't actually contain any IL that can be instrumented (except for maybe a few delegates). So, although I can put together a test project that exercises the interop layer, I can't get a sense for *how many* of those methods and properties I'm actually calling.
Plan B is to go and write a code generator that creates a library of RCWWs (Runtime Callable Wrapper Wrappers), and instrument that for the purposes of code coverage. | 0 | [
2,
25,
32,
938,
20,
164,
1797,
5245,
2495,
27,
40,
1480,
2594,
1475,
60,
800,
3726,
3726,
14,
2125,
1448,
235,
28,
31,
196,
32,
25,
30,
40,
1480,
2594,
1475,
1437,
22,
38,
1121,
3717,
186,
6317,
30,
92,
44,
5529,
69,
13,
5,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.