unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
What makes a pthread defunct ?
===
i'm working with a multi-threaded program (using pthreads) that currently create a background thread (PTHREAD\_DETACHED) and then invokes pthread_exit(0). My problem is that the process is then listed as "defunct" and curiously do not seems to "really exists" in /proc (which defeats my debugging strategies)
What would be the proper way to meet the following requirements :
- the program should run function A in a loop and function B once
- given the PID of the program /proc/$pid/exe, /proc/$pid/maps and /proc/$pid/fd must be accessible (when the process is defunct, they are all empty or invalid links)
- it must be possible to suspend/interrupt the program with CTRL+C and CTRL+Z as usual
| 0 | [
2,
98,
1364,
21,
351,
96,
10647,
16250,
13,
60,
800,
3726,
3726,
31,
22,
79,
638,
29,
21,
1889,
8,
96,
10647,
69,
625,
13,
5,
12655,
351,
96,
10647,
18,
6,
30,
871,
1600,
21,
2395,
9322,
13,
5,
306,
96,
10647,
1,
43,
5735,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it worth investing time in learning Visual Studio Macro System(usage-creation)?
===
I have used visual studio for a long time, but one feature I have never used is the Macro system. I saw a post where someone mentioned he used macros (no elaboration) so
I was wondering is it really worth the time investing in learning how to create macros?
If so what kind of stuff do you make?
There was similar post(s), but i am trying to lean this question more towards is it worth learning. I tend to rather know how something works than just using it if its possible and/or worth it. | 0 | [
2,
25,
32,
2715,
22999,
85,
19,
2477,
3458,
1120,
9069,
329,
5,
267,
1303,
8,
6037,
857,
6,
60,
800,
3726,
3726,
31,
57,
147,
3458,
1120,
26,
21,
175,
85,
15,
47,
53,
1580,
31,
57,
243,
147,
25,
14,
9069,
329,
9,
31,
441,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 hosting provider with build capabilities and source control
===
Can you suggest me an asp.net 3.5 hosting provider with continuous integration (cctray – nant builds) and source control facilities (svn)?
My requirement would be something like this:
I checkin to a svn branch (say trunk) on the hosting provider space. CruiseControl.NET on the server fires of a build. I see success/failure on my cctray. On success my peers go to the website (say http://trunk.mywebsite.com) and see changes
| 0 | [
2,
28,
306,
9,
2328,
10637,
11747,
29,
1895,
10209,
17,
1267,
569,
800,
3726,
3726,
92,
42,
5601,
55,
40,
28,
306,
9,
2328,
203,
9,
264,
10637,
11747,
29,
6357,
8078,
13,
5,
3384,
38,
2787,
13,
10,
13,
11028,
1895,
18,
6,
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... |
Loop termination conditions
===
These `for`-loops are among the first basic examples of formal correctness proofs of algorithms. They have different but equivalent termination conditions:
1 for ( int i = 0; i != N; ++i )
2 for ( int i = 0; i < N; ++i )
The difference becomes clear in the postconditions:
* The first one gives the strong guarantee that `i == N` after the loop terminates.
* The second one only gives the weak guarantee that `i >= N` after the loop terminates, but you will be tempted to assume that `i == N`.
If for any reason the increment `++i` is ever changed to something like `i += 2`, or if `i` gets modified inside the loop, or if `N` is negative, the program can fail:
* The first one may get stuck in an infinite loop. It fails early, in the loop that has the error. Debugging is easy.
* The second loop will terminate, and at some later time the program may fail because of your incorrect assumption of `i == N`. It can fail far away from the loop that caused the bug, making it hard to trace back. Or it can silently continue doing something unexpected, which is even worse.
Which termination condition do you prefer, and why? Are there other considerations? Why do many programmers who know this, refuse to apply it? | 0 | [
2,
5293,
21343,
2039,
800,
3726,
3726,
158,
13,
1,
1106,
1,
8,
18786,
18,
50,
497,
14,
64,
2125,
3770,
16,
3337,
4456,
720,
6070,
18,
16,
15935,
9,
59,
57,
421,
47,
4602,
21343,
2039,
45,
137,
26,
13,
5,
19,
38,
31,
800,
713... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Vista Serial programmatically
===
How do I obtain the serial number of the installed Vista system?
Also is there a tool that does the same thing so I can verify MY results? | 0 | [
2,
13520,
5956,
625,
6732,
1326,
800,
3726,
3726,
184,
107,
31,
5545,
14,
5956,
234,
16,
14,
4066,
13520,
329,
60,
67,
25,
80,
21,
5607,
30,
630,
14,
205,
584,
86,
31,
92,
21012,
51,
1736,
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... |
How to (with SimpleTest) write an AssertTags test with regex?
===
I wish to test a function that will generate lorem ipsum text, but it does so within html tags. So I cant know in advance the textual content, but i know the html structure. That is what I want to test. And maybe that the length of the texts are within certain limits.
So what I am wondering is if the assertTags can do this in a way paraphrased bellow:
Result = "<p>Some text</p>";
Expected = array(
'<p' ,
'regex',
'/p'
);
assertTags(resutl, expected)
I am using SimpleTest with cakephp, but i think it should be a general question. | 0 | [
2,
184,
20,
13,
5,
1410,
1935,
10543,
6,
2757,
40,
10908,
8628,
18,
1289,
29,
7953,
1706,
60,
800,
3726,
3726,
31,
2536,
20,
1289,
21,
1990,
30,
129,
7920,
12977,
79,
31,
1919,
723,
1854,
15,
47,
32,
630,
86,
363,
13,
15895,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PHP: Storing 'objects' inside the $_SESSION.
===
I just figured out that I can actually **store objects in the $_SESSION** and I find it quite cool because when I jump to another page I still have my object. Now before I start using this approach I would like to find out if it is really such a good idea or if there are **potential pitfalls** involved.
I know that if I had a single point of entry I wouldn't need to do that but I'm not there yet so I don't have a single point of entry and I would really like to keep my object because I don't lose my state like that. (Now I've also read that I should program stateless sites but I don't understand that concept yet.)
So **in short**: Is it ok to store objects in the session, are there any problems with it? | 0 | [
2,
13,
26120,
45,
25615,
13,
22,
23793,
18,
22,
572,
14,
5579,
1,
7202,
5991,
9,
800,
3726,
3726,
31,
114,
5700,
70,
30,
31,
92,
1121,
13,
1409,
16828,
3916,
19,
14,
5579,
1,
7202,
5991,
1409,
17,
31,
477,
32,
1450,
2700,
185,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Server Operating System
===
What would you suggest would be the best operating system for a web server? If possible please enumerate the advantages and disadvantages if there are any... | 0 | [
2,
8128,
2455,
329,
800,
3726,
3726,
98,
83,
42,
5601,
83,
44,
14,
246,
2455,
329,
26,
21,
2741,
8128,
60,
100,
938,
2247,
26940,
62,
14,
14683,
17,
13387,
18,
100,
80,
50,
186,
9,
9,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Distributed Processing: C++ equivalent of JTA
===
I'm developing a mission-critical solution where data integrity is paramount and performance a close second. If data gets stuffed up, it's gonna be cata$trophic.
So, I'm looking for the C/C++ version of JTA (Java Transaction API). Does anyone know of any C or C++ libraries that supports distributed transactions? And yes, I've googled it ... unsuccessfully.
I'd hate to be told that there isn't one and I'd need to implement the protocol specified by [Distributed TP: The XA Specification][1].
Please help!
[1]: http://www.opengroup.org/pubs/catalog/c193.htm | 0 | [
2,
4387,
5511,
45,
272,
20512,
4602,
16,
487,
536,
800,
3726,
3726,
31,
22,
79,
3561,
21,
1408,
8,
21522,
4295,
113,
1054,
11961,
25,
13195,
17,
956,
21,
543,
153,
9,
100,
1054,
3049,
13089,
71,
15,
32,
22,
18,
5172,
44,
13,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What .net CMS with forum, eCommerce and multilanguage support would you reccomend
===
I am considering to use a cms for my website. As I am a .net developer, I think the best ideea would be to chose a .net cms tool, but I am not sure which one to pick. I've heard sitefinity from telerik is quite good but unfortunately is quite expensive, DNN it's a pain. Umbraco seems preety good, but it lacks the e-Commerce module. What about mojo portal, have you used it?
Which one would you recommend? | 0 | [
2,
98,
13,
9,
2328,
2390,
18,
29,
5691,
15,
13,
62,
26470,
17,
1889,
7020,
555,
83,
42,
6042,
960,
2451,
800,
3726,
3726,
31,
589,
5154,
20,
275,
21,
2390,
18,
26,
51,
2271,
9,
28,
31,
589,
21,
13,
9,
2328,
10058,
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... |
Dealing with command line arguments and Spring
===
When I'm writing a Spring command line application which parses command line arguments, how do I pass them to Spring? Would I want to have my main() structured so that it first parses the command line args and then inits Spring? Even so, how would it pass the object holding the parsed args to Spring? | 0 | [
2,
5746,
29,
1202,
293,
10553,
17,
1573,
800,
3726,
3726,
76,
31,
22,
79,
1174,
21,
1573,
1202,
293,
3010,
56,
2017,
7202,
1202,
293,
10553,
15,
184,
107,
31,
1477,
105,
20,
1573,
60,
83,
31,
259,
20,
57,
51,
407,
5,
6,
17784,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 to use for XML parsing / reading in PHP4
===
Unfortunatly I have to work in a older web application on a PHP4 server;
It now needs to parse a lot of XML for calling webservices (custom protocol, no SOAP/REST);
Under PHP5 I would use SimpleXML but that isn't available;
There is Dom XML in PHP4, but it isn't default any more in PHP5.
What are the other options?
I'm looking for a solution that still works on PHP5 once they migrate. | 0 | [
2,
98,
20,
275,
26,
23504,
2017,
18,
68,
13,
118,
1876,
19,
13,
26120,
300,
800,
3726,
3726,
367,
6469,
4140,
38,
102,
31,
57,
20,
170,
19,
21,
1234,
2741,
3010,
27,
21,
13,
26120,
300,
8128,
73,
32,
130,
2274,
20,
2017,
870,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Hidden features of C
===
I know there is a standard behind all C compiler implementations, so there should be no hidden features. Despite that, I am sure all C developers have hidden/secret tricks they use all the time. | 0 | [
2,
3689,
967,
16,
272,
800,
3726,
3726,
31,
143,
80,
25,
21,
1236,
439,
65,
272,
21486,
6123,
18,
15,
86,
80,
378,
44,
90,
3689,
967,
9,
869,
30,
15,
31,
589,
562,
65,
272,
10168,
57,
3689,
118,
17902,
13747,
59,
275,
65,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Does a memory leak at unload of a DLL cause a leak in the host process?
===
Consider this case:
dll = LoadDLL()
dll->do()
...
void do() {
char *a = malloc(1024);
}
...
UnloadDLL(dll);
At this point, will the 1k allocated in the call to malloc() be available to the host process again?
The DLL is statically linking to the CRT.
| 0 | [
2,
630,
21,
1912,
11724,
35,
367,
8294,
16,
21,
13,
43,
211,
1679,
21,
11724,
19,
14,
2015,
953,
60,
800,
3726,
3726,
3563,
48,
610,
45,
13,
43,
211,
800,
6305,
43,
211,
5,
6,
13,
43,
211,
8,
1,
537,
5,
6,
13,
9,
9,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there any way to use an extension method in an object initializer block in C#
===
The simple demo below captures what I am trying to do. In the real program, I have to use the object initialiser block since it is reading a list in a LINQ to SQl select expression, and there is a value that that I want to read off the database and store on the object, but the object doesn't have a simple property that I can set for that value. Instead it has an XML data store.
It looks like I can't call an extension method in the object initialiser block, and that I can't attach a property using extension methods.
So am I out of luck with this approach? The only alternative seems to be to persuade the owner of the base class to modify it for this scenario.
public class BaseDataObject
{
// internal data store
private Dictionary<string, object> attachedData = new Dictionary<string, object>();
public void SetData(string key, object value)
{
attachedData[key] = value;
}
public object GetData(string key)
{
return attachedData[key];
}
public int SomeValue { get; set; }
public int SomeOtherValue { get; set; }
}
public static class Extensions
{
public static void SetBarValue(this BaseDataObject dataObject, int barValue)
{
/// Cannot attach a property to BaseDataObject?
dataObject.SetData("bar", barValue);
}
}
public class TestDemo
{
public void CreateTest()
{
// this works
BaseDataObject test1 = new BaseDataObject
{ SomeValue = 3, SomeOtherValue = 4 };
// this does not work - it does not compile
// cannot use extension method in the initialiser block
// cannot make an exension property
BaseDataObject test2 = new BaseDataObject
{ SomeValue = 3, SomeOtherValue = 4, SetBarValue(5) };
}
}
| 0 | [
2,
25,
80,
186,
161,
20,
275,
40,
3896,
2109,
19,
40,
3095,
2104,
11907,
1921,
19,
272,
5910,
800,
3726,
3726,
14,
1935,
8376,
1021,
3683,
18,
98,
31,
589,
749,
20,
107,
9,
19,
14,
683,
625,
15,
31,
57,
20,
275,
14,
3095,
21... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WPF animation of items between layouts?
===
I have two different ways of displaying items within a WPF application. The first uses a I have two different ways of displaying items in a WPF application. The first uses a WrapPanel and the second a vertical StackPanel. I can switch between the two ways of displaying my items by switching the host panel between the two types. This does work but you get an instance change in layout.
Instead I want the child items to animate between the two layouts to give a nice smooth effect to the user. Any ideas how I could go about achieving that? Do I need to a Canvas instead and work out the positioning of children manually? That would be a real pain!
| 0 | [
2,
619,
7721,
6236,
16,
3755,
128,
9106,
18,
60,
800,
3726,
3726,
31,
57,
81,
421,
2847,
16,
17418,
3755,
363,
21,
619,
7721,
3010,
9,
14,
64,
2027,
21,
31,
57,
81,
421,
2847,
16,
17418,
3755,
19,
21,
619,
7721,
3010,
9,
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... |
better eclipse browser?
===
does anybody know a free web browser plugin for eclipse that is better than the built-in browser? searched but coulnd't find anything.
i know tasktop has one but it's not free...
| 0 | [
2,
574,
11652,
16495,
60,
800,
3726,
3726,
630,
11181,
143,
21,
551,
2741,
16495,
10922,
108,
26,
11652,
30,
25,
574,
119,
14,
392,
8,
108,
16495,
60,
9036,
47,
19595,
706,
22,
38,
477,
602,
9,
31,
143,
3005,
3880,
63,
53,
47,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Active Directory: Retrieve User information
===
I've got a web application that is running against Windows Authentication using our Active Directory. I've got a new requirement to pull some personal information through from the Active Directory entry. What would be the easiest way to get access to this information? | 0 | [
2,
1348,
16755,
45,
11917,
4155,
676,
800,
3726,
3726,
31,
22,
195,
330,
21,
2741,
3010,
30,
25,
946,
149,
1936,
27963,
568,
318,
1348,
16755,
9,
31,
22,
195,
330,
21,
78,
8981,
20,
2201,
109,
1319,
676,
120,
37,
14,
1348,
16755... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Are there any tips/tricks about using Subsonic with Asp.Net MVC Framework?
===
Is there anyone using Subsonic with asp.net mvc framework? If so, can you tell us something about your experience. Are there tips and tricks that can be shared? | 0 | [
2,
50,
80,
186,
11034,
118,
15294,
18,
88,
568,
972,
17766,
29,
28,
306,
9,
2328,
307,
8990,
6596,
60,
800,
3726,
3726,
25,
80,
1276,
568,
972,
17766,
29,
28,
306,
9,
2328,
307,
8990,
6596,
60,
100,
86,
15,
92,
42,
494,
182,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
SVNkit cannot create SVNRepoitory
===
I am trying to run a diff on two svn urls using SVNkit. The problem is that I get the error when `diff.doDiff` is called.
org.tmatesoft.svn.core.SVNException: svn: Unable to create SVNRepository object for 'http://svn.codehaus.org/jruby/trunk/jruby/src/org/jruby/Finalizable.java'
at org.tmatesoft.svn.core.internal.wc.SVNErrorManager.error(SVNErrorManager.java:55)
at org.tmatesoft.svn.core.internal.wc.SVNErrorManager.error(SVNErrorManager.java:40)
at org.tmatesoft.svn.core.io.SVNRepositoryFactory.create(SVNRepositoryFactory.java:199)
at org.tmatesoft.svn.core.wc.DefaultSVNRepositoryPool.createRepository(DefaultSVNRepositoryPool.java:213)
at org.tmatesoft.svn.core.wc.SVNClientManager.createRepository(SVNClientManager.java:242)
at org.tmatesoft.svn.core.wc.SVNBasicClient.createRepository(SVNBasicClient.java:231)
at org.tmatesoft.svn.core.wc.SVNDiffClient.doDiffURLURL(SVNDiffClient.java:769)
at org.tmatesoft.svn.core.wc.SVNDiffClient.doDiff(SVNDiffClient.java:310)
at SVNTest.main(SVNTest.java:30)
I have double checked the URLs (I can open them in TortoiseSVN client). Can anybody help me know what is going on? I have posted the code I am running below.
SVNClientManager manager = SVNClientManager.newInstance(SVNWCUtil.createDefaultOptions(false), user, pass);
SVNDiffClient diff = manager.getDiffClient();
//ISVNDiffStatusHandler diffStatus = new ISVNDiffStatusHandler();
try {
SVNURL oldURL = SVNURL.parseURIDecoded(url);
diff.doDiff(SVNURL.parseURIDecoded(url), SVNRevision.create(oldVersion), SVNURL.parseURIDecoded(url), SVNRevision.HEAD, false, false, System.out);
} catch (SVNException e) {
// TODO Auto-generated catch block
e.printStackTrace();
} | 0 | [
2,
13,
18,
16578,
13703,
1967,
1600,
13,
18,
16578,
99,
1638,
49,
14599,
800,
3726,
3726,
31,
589,
749,
20,
485,
21,
20811,
27,
81,
13,
18,
16578,
13,
911,
7532,
568,
13,
18,
16578,
13703,
9,
14,
1448,
25,
30,
31,
164,
14,
701... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Last Resource Optimization
===
I'm writing a Resource Adaptor which does not support two phase commit.
I know there is an optimization technique called: "Last Resource Optimization".
On JBoss your XAResource class should implement LastResource in order to have the optimization.
My question is: how this can be done in WebLogic, WebSpehre, Glassfish, etc... | 0 | [
2,
236,
6577,
21597,
800,
3726,
3726,
31,
22,
79,
1174,
21,
6577,
9924,
248,
56,
630,
52,
555,
81,
2702,
9686,
9,
31,
143,
80,
25,
40,
21597,
4873,
227,
45,
13,
7,
8558,
6577,
21597,
7,
9,
27,
487,
10349,
18,
154,
993,
1509,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there an easy way, to Port a Win32 App in Delphi 2009 to .NET ?
===
We want migrate from Delphi 7.0 to Delphi 2009, to stay up with a modern IDE and current technology. Our target platform is .NET. What is best way, to achieve this goal? | 0 | [
2,
25,
80,
40,
2010,
161,
15,
20,
1295,
21,
628,
3125,
4865,
19,
23030,
588,
20,
13,
9,
2328,
13,
60,
800,
3726,
3726,
95,
259,
22985,
37,
23030,
453,
9,
387,
20,
23030,
588,
15,
20,
1179,
71,
29,
21,
773,
13,
3448,
17,
866,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Linked Server Performance and options
===
So at work we have two servers one is running an application a lot of people use which has an sql 2000 back end. I have been free to query this for a long time but can't add anything to it such as stored procedures or extra tables. This has lead to us having a second sql server linked to the first one and me building up a library of stored procedures that query data from both sides using linked server. Some of these queries are taking longer than what I would like. <br>
<br>
Can someone point me to some good articles about using linked servers, I am particularly interested in finding out what data is being transferred between the two as usually the majority of the sql statement could be performed remotely but I have the feeling it may be transferring the full tables, it is usually just a join to a small final table locally.
<br><br>
Also what do the linked server options do I currently have:<br>
Collation Compatible True<br>
Data Access True<br>
Rpc True<br>
Rpc Out True<br>
Use Remote Collation False<br>
Collation Name (Blank)<br>
Connection Timeout 0<br>
Query Timeout 0<br>
| 0 | [
2,
4727,
8128,
956,
17,
6368,
800,
3726,
3726,
86,
35,
170,
95,
57,
81,
17595,
53,
25,
946,
40,
3010,
21,
865,
16,
148,
275,
56,
63,
40,
4444,
255,
824,
97,
241,
9,
31,
57,
74,
551,
20,
25597,
48,
26,
21,
175,
85,
47,
92,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why do you like Python?
===
I have to make a presentation at work to convince everyone why they should try coding in Python. So, I thought of taking a poll here...
What is it about Python (features, etc) over other languages that you love?
The reason I usually give is that in Python you forget about the complexities and frills of programming languages and can just focus on producing code that works... What do you think? | 4 | [
2,
483,
107,
42,
101,
20059,
60,
800,
3726,
3726,
31,
57,
20,
233,
21,
6364,
35,
170,
20,
6218,
1266,
483,
59,
378,
1131,
13,
15458,
19,
20059,
9,
86,
15,
31,
289,
16,
741,
21,
4994,
235,
9,
9,
9,
98,
25,
32,
88,
20059,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I correct the character encoding of a file?
===
I have an ANSI encoded text file that should not have been encoded as ANSI as there were accented
characters that ANSI does not support. I would rather work with UTF-8.
Can the data be decoded correctly or is it lost in transcoding?
What tools could I use? | 0 | [
2,
184,
107,
31,
4456,
14,
925,
19608,
16,
21,
3893,
60,
800,
3726,
3726,
31,
57,
40,
40,
18,
49,
13665,
1854,
3893,
30,
378,
52,
57,
74,
13665,
28,
40,
18,
49,
28,
80,
46,
7980,
69,
1766,
30,
40,
18,
49,
630,
52,
555,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Storing objects for locating by x,y coordinates
===
I'm trying to determine a fast way of storing a set of objects, each of which have an x and y coordinate value, such that I can quickly retrieve all objects within a certain rectangle or circle.
For small sets of objects (~100) the naive approach of simply storing them in a list, and iterating through it, is relatively quick. However, for much larger groups, that is expectedly slow.
I've tried storing them in a pair of TreeMaps as well, one sorted on the x coordinate, and one sorted on the y coordinate, using this code:
xSubset = objectsByX.subSet( minX, maxX );
ySubset = objectsByY.subSet( minY, maxY );
result.addAll( xSubset );
result.retainAll( ySubset );
This also works, and is faster for larger sets of objects, but is still slower than I would like.
Part of the problem is also that these objects move around, and need to be inserted back into this storage, which means removing them from and re-adding them to the trees/lists.
I can't help but think there must be better solutions out there.
I'm implementing this in Java, if it makes any difference, though I expect any solution will be more in the form of a useful pattern/algorithm. | 0 | [
2,
25615,
3916,
26,
27917,
34,
993,
15,
93,
13714,
800,
3726,
3726,
31,
22,
79,
749,
20,
3746,
21,
1512,
161,
16,
25615,
21,
309,
16,
3916,
15,
206,
16,
56,
57,
40,
993,
17,
13,
93,
15154,
1923,
15,
145,
30,
31,
92,
976,
119... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to obtain an index into a vector when using Iterators to loop over it.
===
When iterating over elements of a vector it is preferred to use iterators instead of an index (see [Why use iterators instead of array indices?][1]).
std::vector<T> vec;
std::vector<T>::iterator it;
for ( it = vec.begin(); it != vec.end(); ++it )
{
// do work
}
However, it can be necessary to use the index in the body of the loop. Which of the following would be preferable in that case, considering performance and flexibility/extensibility?
1. Revert to the indexed loop
<pre>
std::vector<T> vec;
size_t i;
for ( i = 0; i < vec.size(); ++i )
{
// use i
}
</pre>
2. Calculate offset
<pre>
std::vector<T> vec;
std::vector<T>::iterator it;
for ( it = vec.begin(); it != vec.end(); ++it )
{
size_t i = it - vec.begin();
// use i
}
</pre>
3. Use std::distance
<pre>
std::vector<T> vec;
std::vector<T>::iterator it;
for ( it = vec.begin(); it != vec.end(); ++it )
{
size_t i = std::distance( vec.begin(), it );
// use i
}
</pre>
[1]: http://stackoverflow.com/questions/131241/why-use-iterators-instead-of-array-indices
| 0 | [
2,
98,
25,
14,
246,
161,
20,
5545,
40,
4348,
77,
21,
7497,
76,
568,
32,
106,
9922,
20,
5293,
84,
32,
9,
800,
3726,
3726,
76,
32,
106,
1880,
84,
2065,
16,
21,
7497,
32,
25,
5981,
20,
275,
32,
106,
9922,
700,
16,
40,
4348,
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... |
Full text search engine example in F#?
===
Are there any good examples (websites or books) around of how to build a full text search engine in F#? | 0 | [
2,
503,
1854,
2122,
1406,
823,
19,
398,
5910,
60,
800,
3726,
3726,
50,
80,
186,
254,
3770,
13,
5,
14113,
18,
6359,
54,
964,
6,
140,
16,
184,
20,
1895,
21,
503,
1854,
2122,
1406,
19,
398,
5910,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Testing form inputs in PHPUnit
===
What's the best way to test `$_GET` and `$_POST` inputs in PHPUnit?
I have a class that sanitises input and want to check that it works correctly when processing bogus data. Is there an easy way to set up the form variables in PHPUnit or should I just pass off the validation to a secondary class/functions that are fed the form variables so test them indirectly? | 0 | [
2,
4431,
505,
6367,
18,
19,
13,
26120,
15464,
800,
3726,
3726,
98,
22,
18,
14,
246,
161,
20,
1289,
13,
1,
4403,
1,
3060,
1,
17,
13,
1,
4403,
1,
6962,
1,
6367,
18,
19,
13,
26120,
15464,
60,
31,
57,
21,
718,
30,
523,
7798,
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... |
Double generic constraint on class in Java: extends ConcreteClass & I
===
Is there a way to define a generic constraint in Java which would be analogous to the following C# generic constratint ?
class Class1<I,T> where I : Interface1, Class2 : I
I'm trying to do it like this:
class Class1<I extends Interface1, T extands I & Class2>
But the compiler complains about the "Class2" part: Type parameter cannot be followed by other bounds. | 0 | [
2,
1494,
12733,
28804,
27,
718,
19,
8247,
45,
9073,
4105,
1898,
279,
31,
800,
3726,
3726,
25,
80,
21,
161,
20,
9267,
21,
12733,
28804,
19,
8247,
56,
83,
44,
21837,
20,
14,
249,
272,
5910,
12733,
1065,
5253,
2864,
38,
13,
60,
718... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to read file content into istringstream?
===
In order to improve performance reading from a file, I'm trying to read the entire content of a big (several MB) file into memory and then use a istringstream to access the information.
My question is, which is the best way to read this information and "import it" into the string stream? A problem with this approach (see bellow) is that when creating the string stream the buffers gets copied, and memory usage doubles.
#include <fstream>
#include <sstream>
using namespace std;
int main() {
ifstream is;
is.open (sFilename.c_str(), ios::binary );
// get length of file:
is.seekg (0, std::ios::end);
long length = is.tellg();
is.seekg (0, std::ios::beg);
// allocate memory:
char *buffer = new char [length];
// read data as a block:
is.read (buffer,length);
// create string stream of memory contents
// NOTE: this ends up copying the buffer!!!
istringstream iss( string( buffer ) );
// delete temporary buffer
delete [] buffer;
// close filestream
is.close();
/* ==================================
* Use iss to access data
*/
} | 0 | [
2,
184,
20,
1302,
3893,
2331,
77,
31,
11130,
11260,
60,
800,
3726,
3726,
19,
389,
20,
3545,
956,
1876,
37,
21,
3893,
15,
31,
22,
79,
749,
20,
1302,
14,
1078,
2331,
16,
21,
580,
13,
5,
29807,
14023,
6,
3893,
77,
1912,
17,
94,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How is Google so fast?
===
What are the technologies and programming decisions that make Google able to serve a query so fast? Every time I search something (one of the several times per day) it always amazes me how they serve the results in near or less than 1 second time. What sort of configuration and algorithms could they have in place that accomplishes this?
**Side note:** It is kinda overwhelming thinking that even if I was to put a desktop application and use it on my machine probably would not be half as fast as Google. Keep on learning I say. | 0 | [
2,
184,
25,
8144,
86,
1512,
60,
800,
3726,
3726,
98,
50,
14,
5740,
17,
3143,
6003,
30,
233,
8144,
777,
20,
1884,
21,
25597,
86,
1512,
60,
352,
85,
31,
2122,
301,
13,
5,
849,
16,
14,
238,
436,
416,
208,
6,
32,
550,
21,
10708,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Invert Regex Matches
===
How would I invert .NET regex matches? I want to extract only the matched text, e.g. I want to extract all IMG tags from an HTML file, but only the image tags. | 0 | [
2,
19,
8122,
7953,
1706,
1717,
800,
3726,
3726,
184,
83,
31,
19,
8122,
13,
9,
2328,
7953,
1706,
1717,
60,
31,
259,
20,
10962,
104,
14,
11265,
1854,
15,
13,
62,
9,
263,
9,
31,
259,
20,
10962,
65,
797,
263,
3383,
18,
37,
40,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0... |
How to gain SSL load balancing!!!
===
I have to deploy my ASP.NET application into two seperated IIS servers. My application works over HTTPS/TLS. My ASP code has to handle client SSL certificate and it means I can't use simple forward load balancers, because I will never get such certificate from nginx or Apache Load Balancer.
As I understand there is no common (open-source or free) solution for load balancing in Microsoft world and especially for SSL.
I heard about simple DNS balancing, where my domain name would be bound to several ISS servers, and every new client (session) would get IP of one server,and such way I would get simple balancing and SSL support.
Now, I am just at the begging of deployment and it is really interesting to know your opinion of such balancing, or may be to get some recommendations.
Thanks! | 0 | [
2,
184,
20,
3288,
13,
18,
18,
255,
6305,
16416,
6302,
28116,
800,
3726,
3726,
31,
57,
20,
17617,
51,
28,
306,
9,
2328,
3010,
77,
81,
10332,
106,
1669,
595,
18,
17595,
9,
51,
3010,
693,
84,
7775,
18,
118,
7786,
18,
9,
51,
28,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
php - proc_open
===
I need to do some command lines through a browser.
What I need to do in a command-line would be:
$login
<login name>
<password>
$passwd
<old password>
<new password>
<retype new password>
So, how can I do this using the [proc_open][1] function?
Thanks
[1]: http://www.php.net/manual/en/function.proc-open.php | 0 | [
2,
13,
26120,
13,
8,
13,
15617,
1,
10157,
800,
3726,
3726,
31,
376,
20,
107,
109,
1202,
1560,
120,
21,
16495,
9,
98,
31,
376,
20,
107,
19,
21,
1202,
8,
1143,
83,
44,
45,
5579,
5567,
108,
13,
1,
5567,
108,
204,
1,
13,
1,
62... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Get back the output of os.execute in Lua
===
When I do an "os.execute" in Lua, a console quickly pops up, executes the command, then closes down. But is there some way of getting back the console output only using the standard Lua libraries? | 0 | [
2,
164,
97,
14,
5196,
16,
13,
759,
9,
1706,
17194,
591,
19,
1612,
58,
800,
3726,
3726,
76,
31,
107,
40,
13,
7,
759,
9,
1706,
17194,
591,
7,
19,
1612,
58,
15,
21,
8650,
976,
1675,
18,
71,
15,
15644,
18,
14,
1202,
15,
94,
54... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which language should I pick up: VB.Net or C#
===
I'm looking to pick up either C# or VB.Net. I'd done a fair bit of VB6 programming in the past.
I'm looking at getting [Visual Basic .NET or C#, Which to Choose?][1] but I'm hoping that someone has read it, or used both languages and can offer advice.
Should I just RTFB?
[1]: http://www.amazon.com/exec/obidos/ASIN/B0006AB0N0/wwwdesawareco-20 | 0 | [
2,
56,
816,
378,
31,
2036,
71,
45,
13,
20468,
9,
2328,
54,
272,
5910,
800,
3726,
3726,
31,
22,
79,
699,
20,
2036,
71,
694,
272,
5910,
54,
13,
20468,
9,
2328,
9,
31,
22,
43,
677,
21,
1768,
1142,
16,
13,
20468,
379,
3143,
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... |
Free alternative to RegxBuddy
===
Are there any good alternatives that support writing regexps in different flavours and allow to test them? | 0 | [
2,
551,
2676,
20,
7953,
396,
220,
28085,
800,
3726,
3726,
50,
80,
186,
254,
2676,
18,
30,
555,
1174,
7953,
6899,
18,
19,
421,
22408,
18,
17,
1655,
20,
1289,
105,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Java utility to validate string against NMTOKEN
===
I have some application code which generates XML documents, which are then validated against an XML Schema. The schema makes use of NMTOKEN types, and occasionally, the generated XML contains string values which are illegal NMTOKENs (e.g. they contain spaces or weird punctuation). The Xerces schema validation catches it OK, of course, but I'd like to catch it earlier, in my own code, and handle it more gracefully.
I was going to write my own isValidNMTOKEN method, and check that each charcter is valid according to the schema spec, but I was hoping there was an existing utility out there that would do this for me.
Sort of like a commons-lang for XML. Nothing useful in xml.apache.org/commons, sadly. | 0 | [
2,
8247,
10082,
20,
7394,
1373,
3724,
149,
9384,
262,
2853,
800,
3726,
3726,
31,
57,
109,
3010,
1797,
56,
7920,
18,
23504,
4374,
15,
56,
50,
94,
7394,
1669,
149,
40,
23504,
23874,
9,
14,
23874,
1364,
275,
16,
9384,
262,
2853,
2551... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get user informations from a session id in ASP.NET ?
===
In an asp.net application, i would like to use a webservice to return the username associated with the session id passed as a parameter. We're currently using InProc session store.
Is it possible to do this ?
Thanks,
Mathieu G. | 0 | [
2,
184,
107,
31,
164,
4155,
676,
18,
37,
21,
3723,
4924,
19,
28,
306,
9,
2328,
13,
60,
800,
3726,
3726,
19,
40,
28,
306,
9,
2328,
3010,
15,
31,
83,
101,
20,
275,
21,
2741,
11449,
20,
788,
14,
4155,
7259,
1598,
29,
14,
3723,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Java the best language for Mobile App Devlopment?
===
I was wondering what are the benefits of using anything else but Java for Mobile Application Development. | 0 | [
2,
25,
8247,
14,
246,
816,
26,
3241,
4865,
9664,
11362,
1130,
60,
800,
3726,
3726,
31,
23,
5712,
98,
50,
14,
5800,
16,
568,
602,
962,
47,
8247,
26,
3241,
3010,
522,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Workaround for Spring/Hibernate due to non-standard behaviour of UNIQUE constraint in MS SQL
===
There is a UNIQUE database constraint on a table which doesn't allow more than one record having identical columns.
There is a piece of code, managed by Hibernate (v2.1.8), doing two DAO <BR>
`getHibernateTemplate().save( theObject ) `<BR>
calls which results two records entered into the table mentioned above.
If this code is executed without transactions, it results INSERT, UPDATE, then another INSERT and another UPDATE SQL statements and works fine. Apparently, the sequence is to insert the record containing DB NULL first, and then update it with the proper data.
If this code is executed under Spring (v2.0.5) wrapped in a single Spring transaction, it results two INSERTS, followed by immediate exception due to UNIQUE constraint mentioned above.
This problem only manifests itself on [MS SQL][1] due to its incompatibility with ANSI SQL. It works fine on MySQL and Oracle. Unfortunately, our solution is cross-platform and must support all databases.
Having this stack of technologies, what would be your preferred workaround for given problem?
[1]: http://connect.microsoft.com/SQLServer/feedback/ViewFeedback.aspx?FeedbackID=299229 | 0 | [
2,
170,
10037,
26,
1573,
118,
8630,
106,
8820,
397,
20,
538,
8,
15566,
7727,
16,
2619,
28804,
19,
4235,
4444,
255,
800,
3726,
3726,
80,
25,
21,
2619,
6018,
28804,
27,
21,
859,
56,
1437,
22,
38,
1655,
91,
119,
53,
571,
452,
6323,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Direct casting vs 'as' operator?
===
Consider the following code:
void Handler(object o, EventArgs e)
{
// I swear o is a string
string s = (string)o; // 1
//-OR-
string s = o as string; // 2
// -OR-
string s = o.ToString(); // 3
}
What is the difference between the three types of casting(okay, 3rd one is not a casting, but you get the intent... ), and which one should be preferred? | 0 | [
2,
1744,
9087,
4611,
13,
22,
472,
22,
6022,
60,
800,
3726,
3726,
3563,
14,
249,
1797,
45,
11364,
24641,
5,
23793,
635,
15,
807,
10663,
18,
13,
62,
6,
13,
1,
12894,
31,
6688,
635,
25,
21,
3724,
3724,
13,
18,
800,
13,
5,
11130,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Problem with ar_mailer
===
I'm running a strange problem sending emails. Basicly I'm getting this exception:
ArgumentError (wrong number of arguments (1 for 0)):
/usr/lib/ruby/gems/1.8/gems/activerecord-2.1.1/lib/active_record/base.rb:642:in `initialize'
/usr/lib/ruby/gems/1.8/gems/activerecord-2.1.1/lib/active_record/base.rb:642:in `new'
/usr/lib/ruby/gems/1.8/gems/activerecord-2.1.1/lib/active_record/base.rb:642:in `create'
/usr/lib/ruby/gems/1.8/gems/ar_mailer-1.3.1/lib/action_mailer/ar_mailer.rb:92:in `perform_delivery_activerecord'
/usr/lib/ruby/gems/1.8/gems/ar_mailer-1.3.1/lib/action_mailer/ar_mailer.rb:91:in `each'
/usr/lib/ruby/gems/1.8/gems/ar_mailer-1.3.1/lib/action_mailer/ar_mailer.rb:91:in `perform_delivery_activerecord'
/usr/lib/ruby/gems/1.8/gems/actionmailer-2.1.1/lib/action_mailer/base.rb:508:in `__send__'
/usr/lib/ruby/gems/1.8/gems/actionmailer-2.1.1/lib/action_mailer/base.rb:508:in `deliver!'
/usr/lib/ruby/gems/1.8/gems/actionmailer-2.1.1/lib/action_mailer/base.rb:383:in `method_missing'
/app/controllers/web_reservations_controller.rb:29:in `test_email'
In my web_reservations_controller I have a simply method calling
TestMailer.deliver_send_email
And my TesMailer is something like:
class TestMailer < ActionMailer::ARMailer
def send_email
@recipients = "roberto.druetto@gmail.com"
@from = "roberto.druetto@gmail.com"
@subject ="TEST MAIL SUBJECT"
@body = "<br>TEST MAIL MESSAGE"
@content_type = "text/html"
end
end
Do you have any idea?
Thanks!
Roberto
| 0 | [
2,
1448,
29,
13,
512,
1,
8079,
106,
800,
3726,
3726,
31,
22,
79,
946,
21,
2578,
1448,
4907,
8517,
18,
9,
2125,
102,
31,
22,
79,
1017,
48,
5391,
45,
5476,
29992,
13,
5,
499,
14271,
234,
16,
10553,
13,
5,
165,
26,
713,
6,
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... |
Keyword highlighting on selection in Visual Studio 2008
===
A little while ago I managed to get Visual Studio 2008 (C++) into a state where, if I would select a keyword (or any symbol for that matter), by either double clicking on it or highlighting it, all other instances of that symbol within the current file would become highlighted too.
This was a really useful feature.
Since then it's gone away, and I don't know how to get it back.
Please help. | 0 | [
2,
1246,
9587,
23102,
27,
3155,
19,
3458,
1120,
570,
800,
3726,
3726,
21,
265,
133,
1464,
31,
1471,
20,
164,
3458,
1120,
570,
13,
5,
150,
20512,
6,
77,
21,
146,
113,
15,
100,
31,
83,
5407,
21,
1246,
9587,
13,
5,
248,
186,
4678... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
selecting folders in ASP.NET
===
The file upload control in asp.net does not allow me to select a folder and enables me to select only the files. Is there any way in which I can select a folder (obviously without using the file upload control).
Why I want to select the folder is basically to store its entire path in a database table. | 0 | [
2,
20764,
19294,
18,
19,
28,
306,
9,
2328,
800,
3726,
3726,
14,
3893,
71,
8294,
569,
19,
28,
306,
9,
2328,
630,
52,
1655,
55,
20,
5407,
21,
19294,
17,
14645,
55,
20,
5407,
104,
14,
6488,
9,
25,
80,
186,
161,
19,
56,
31,
92,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to perform string Diffs in Java?
===
I would need to perform Diffs between Java strings. I would like to be able to rebuild a string from the original string and diff versions. Does anyone has done this in Java? What library do you use?
String a1; // This can be a long text
String a2; // ej. above text with spelling corrections
String a3; // ej. above text with spelling corrections and an additional sentence
Diff diff = new Diff();
String differences_a1_a2 = Diff.getDifferences(a,changed_a);
String differences_a2_a3 = Diff.getDifferences(a,changed_a);
String[] diffs = new String[]{a,differences_a1_a2,differences_a2_a3};
String new_a3 = Diff.build(diffs);
a3.equals(new_a3); // this is true
| 0 | [
2,
184,
20,
2985,
3724,
20811,
18,
19,
8247,
60,
800,
3726,
3726,
31,
83,
376,
20,
2985,
20811,
18,
128,
8247,
7887,
9,
31,
83,
101,
20,
44,
777,
20,
16128,
21,
3724,
37,
14,
501,
3724,
17,
20811,
3281,
9,
630,
1276,
63,
677,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Regex to remove conditional comments
===
I want a regex which can match conditional comments in a HTML source page so I can remove only those. I want to preserve the regular comments.
I would also like to avoid using the .*? notation if possible.
The text is
foo
<!--[if IE]>
<style type="text/css">
ul.menu ul li{
font-size: 10px;
font-weight:normal;
padding-top:0px;
}
</style>
<![endif]-->
bar
and I want to remove everything in `<!--[if IE]>` and `<![endif]-->`
| 0 | [
2,
7953,
1706,
20,
4681,
21206,
7534,
800,
3726,
3726,
31,
259,
21,
7953,
1706,
56,
92,
730,
21206,
7534,
19,
21,
13,
15895,
1267,
2478,
86,
31,
92,
4681,
104,
273,
9,
31,
259,
20,
6224,
14,
1290,
7534,
9,
31,
83,
67,
101,
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... |
Designing for change
===
I'm pretty sure most of us are familiar with the concept of a project's requirements changing after it starts, this becomes more and more of an issue the less the client knows about how things work and the closer you work with them.
How then can I design a system (specifically a website but general advice will probably be best here) so that smallish changes can be made, are there any programming strategies that deal with this issue? | 0 | [
2,
15026,
26,
753,
800,
3726,
3726,
31,
22,
79,
1772,
562,
127,
16,
182,
50,
3694,
29,
14,
2420,
16,
21,
669,
22,
18,
4786,
4226,
75,
32,
3244,
15,
48,
2633,
91,
17,
91,
16,
40,
1513,
14,
787,
14,
6819,
3620,
88,
184,
564,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best Practice: Potentially huge Winform grid?
===
I am writing an application in VB.NET 2008 that manages software deployment and I want to display a "deployment overview" grid.
The grid will be populated with the names of each application (top row) and the name of each workstation (1st column). The remaining cells will be populated according to whether the corresponding software title has been installed correctly, install failed OR not deployed.
What would be the best way to present this information to the end-user? Could the application 'cope' with maybe a thousand check boxes or would it be better to 'owner-draw' a grid in some way?
I may also require the ability to click on any of these cells to view and/or set other properties.
Many thanks for your help.
John | 0 | [
2,
246,
1345,
45,
9465,
2329,
628,
4190,
7354,
60,
800,
3726,
3726,
31,
589,
1174,
40,
3010,
19,
13,
20468,
9,
2328,
570,
30,
9118,
2306,
10475,
17,
31,
259,
20,
3042,
21,
13,
7,
17309,
10892,
1130,
21598,
7,
7354,
9,
14,
7354,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Webservices client and ssl
===
I have a Java client that calls a web service at the moment using the Http protocol.
When i try to use the Https protocol i keep getting this error
java.io.IOException: DerInputStream.getLength(): lengthTag=127, too big.
Any ideas what could be up?
Thanks
Damien | 0 | [
2,
2741,
11449,
18,
6819,
17,
13,
18,
18,
255,
800,
3726,
3726,
31,
57,
21,
8247,
6819,
30,
3029,
21,
2741,
365,
35,
14,
688,
568,
14,
7775,
8494,
9,
76,
31,
1131,
20,
275,
14,
7775,
18,
8494,
31,
643,
1017,
48,
7019,
8247,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Sort list of values using only one variable?
===
How to sort list of values using only one variable? | 0 | [
2,
2058,
968,
16,
4070,
568,
104,
53,
7612,
60,
800,
3726,
3726,
184,
20,
2058,
968,
16,
4070,
568,
104,
53,
7612,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 to reformat multi-line comments in Eclipse PDT?
===
In Eclipse PDT, Ctrl-Shift-F reformats code. However, it doesn't modify comments at all. Is there some way to reformat ragged multi-line comments to 80 characters per line (or whatever)?
i.e. convert
// We took a breezy excursion and
// gathered Jonquils from the river slopes. Sweet Marjoram grew
// in luxuriant
// profusion by the window that overlooked the Aztec city.
to
// We took a breezy excursion and gathered Jonquils
// from the river slopes. Sweet Marjoram grew in
// luxuriant profusion by the window that overlooked
// the Aztec city.
(I think this applies to regular Eclipse as well.) | 0 | [
2,
184,
20,
3202,
721,
1889,
8,
1143,
7534,
19,
11652,
13,
9251,
38,
60,
800,
3726,
3726,
19,
11652,
13,
9251,
38,
15,
13,
4812,
6362,
8,
14157,
8,
410,
3202,
721,
18,
1797,
9,
207,
15,
32,
1437,
22,
38,
17579,
7534,
35,
65,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Given a date range (start and end dates), how can I count the days, excluding specified days of the week?
===
I'm creating a UI that allows the user the select a date range, and tick or un-tick the days of the week that apply within the date range.
The date range controls are `DateTimePickers`, and the Days of the Week are `CheckBoxes`
Here's a mock-up of the UI:
`From Date: (dtpDateFrom)`<br/>
`To Date: (dtpDateTo)`
`[y] Monday, [n] Tuesday, [y] Wednesday, (etc)`
What's the best way to show a total count the number of days, based not only on the date range, but the ticked (or selected) days of the week?
Is looping through the date range my only option?
| 0 | [
2,
504,
21,
1231,
978,
13,
5,
13680,
17,
241,
4076,
6,
15,
184,
92,
31,
2468,
14,
509,
15,
13,
14938,
9931,
509,
16,
14,
877,
60,
800,
3726,
3726,
31,
22,
79,
2936,
21,
13,
5661,
30,
2965,
14,
4155,
14,
5407,
21,
1231,
978,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Configuration (app.config/web.config/settings.settings)
===
I have a .NET application which has different config files for Debug and Release builds eg. the debug app.config points to a development SQL Server which has debugging enabled and the release target points to the live SQL Server. There are also other settings, some of which are different in debug/release.
I currently use two seperate config files (debug.app.config and release.app.config). I have a build event on the project which says if this is a release build then copy the release.app.config to app.config, else copy debug.app.config to app.config.
The problem with that the application seems to get it's settings from the settings.settings file, so I have to open settings.settings in visual studio which then prompts me that the settings have changed so I accept the changes, save settings.settings and have to rebuild to make it use the correct settings.
Is there a better/recommended/preferred method for achieving a similar effect? Or equally, have I approached this completely wrong and is there a better approach? | 0 | [
2,
13,
9,
2328,
8091,
13,
5,
7753,
9,
14093,
2816,
118,
14113,
9,
14093,
2816,
118,
19831,
18,
9,
19831,
18,
6,
800,
3726,
3726,
31,
57,
21,
13,
9,
2328,
3010,
56,
63,
421,
13,
14093,
2816,
6488,
26,
121,
16254,
17,
830,
1895,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the difference between an element and a node in XML?
===
I'm working in Java with XML and I'm wondering; what's the difference between an element and a node? | 0 | [
2,
98,
22,
18,
14,
2841,
128,
40,
4520,
17,
21,
15421,
19,
23504,
60,
800,
3726,
3726,
31,
22,
79,
638,
19,
8247,
29,
23504,
17,
31,
22,
79,
5712,
73,
98,
22,
18,
14,
2841,
128,
40,
4520,
17,
21,
15421,
60,
3,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
"Son of Suckerfish" CSS Menu - sub menus not closing in IE7
===
Despite my most convincing cries to the contrary, I was recently forced to implement a horizontal drop-down navigation system, so I opted for the friendliest one I could find - [Son of Suckerfish][1].
I tested in various browsers on my machine and all appeared to be fine. However, some (but not all!) IE7 users are experiencing an issue where sub menus do not close after they have been hovered over. The most annoying thing is that the affected users are using the exact version of IE7 that I am (7.0.5730.13), with the same privacy and security settings (I even had them send screenshots of the tabs in Internet Options) on the same OS (XP). I cannot verify if Vista is affected or not.
Obviously trying to debug this issue is a nightmare since I cannot replicate it, so I am wondering if anyone here can and might know how to solve it. I have set up an example page here:
> [http://x01.co.uk/menu_test/][2]
Additionally, there's an annoying flicker on rollover of the sub items which I have also tried to solve with no success, so any help with that would also be appreciated. Thanks in advance!
[1]: http://www.htmldog.com/articles/suckerfish/dropdowns/
[2]: http://x01.co.uk/menu_test/ | 0 | [
2,
13,
7,
528,
16,
25061,
4934,
7,
272,
18,
18,
11379,
13,
8,
972,
11379,
18,
52,
4239,
19,
13,
660,
465,
800,
3726,
3726,
869,
51,
127,
13650,
13882,
20,
14,
10635,
15,
31,
23,
1989,
1292,
20,
8713,
21,
10095,
2804,
8,
2968,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Installing mysql problem
===
Running OS X Leopard an MacBook Pro from Jan. 2008.
I used to run mysql server from a package but then rails started putting a warning that I should install mysql from gem: gem install mysql
It did not work, I got the following error message:
Building native extensions. This could take a while...
ERROR: Error installing mysql:
ERROR: Failed to build gem native extension.
/System/Library/Frameworks/Ruby.framework/Versions/1.8/usr/bin/ruby extconf.rb install mysql
checking for mysql_query() in -lmysqlclient... no
checking for main() in -lm... yes
checking for mysql_query() in -lmysqlclient... no
checking for main() in -lz... yes
... snip ...
Gem files will remain installed in /Library/Ruby/Gems/1.8/gems/mysql-2.7 for inspection.
Results logged to /Library/Ruby/Gems/1.8/gems/mysql-2.7/gem_make.out
-----------------------------------
Then I tried a different way, upon a friend's advice and tried to follow the excellent instructions at http://hivelogic.com/articles/2007/11/installing-mysql-on-mac-os-x
but now ran into a new problem when trying to run 'mysql -u root'
The message I get is:
ERROR 2002 (HY000): Can't connect to local MySQL server through socket '/tmp/mysql.sock' (2)
-----------------------------------
I have googled my heart out trying to fix either problem and feel stuck. Thanks for reading and helping
| 0 | [
2,
25429,
51,
18,
22402,
1448,
800,
3726,
3726,
946,
13,
759,
993,
15446,
40,
1572,
5199,
895,
37,
2262,
9,
570,
9,
31,
147,
20,
485,
51,
18,
22402,
8128,
37,
21,
6030,
47,
94,
2240,
18,
373,
3873,
21,
3590,
30,
31,
378,
16146... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
The best CSS tutorial/site/blog/book.
===
What would you recommend in this topic. I know basics of CSS but I need to expand my knowledge of CSS. It's always good to use good source. | 0 | [
2,
14,
246,
272,
18,
18,
29724,
118,
9097,
118,
220,
5567,
118,
5199,
9,
800,
3726,
3726,
98,
83,
42,
12360,
19,
48,
8303,
9,
31,
143,
2125,
18,
16,
272,
18,
18,
47,
31,
376,
20,
6073,
51,
1918,
16,
272,
18,
18,
9,
32,
22,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0... |
IE6 + IE7 on a clean XP install
===
We need to test a website in both IE6 and IE7. We've had bugs appear running on actual windows machines that aren't visible under vmware (?!), so we have an actual windows laptop to do this - but only one. Is it possible to install IE6 and IE7 side-by-side in such a way that they absolutely, positively, behave exactly like they would if there was only one of them? How? | 0 | [
2,
13,
660,
379,
2754,
13,
660,
465,
27,
21,
2745,
23045,
16146,
800,
3726,
3726,
95,
376,
20,
1289,
21,
2271,
19,
156,
13,
660,
379,
17,
13,
660,
465,
9,
95,
22,
195,
41,
13925,
1893,
946,
27,
3463,
1936,
6035,
30,
4847,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I A Web Service That Returns A Stream?
===
I've been writing a little application that will let people upload & download files to me. I've added a web service to this applciation to provide the upload/download functionality that way but I'm not too sure on how well my implementation is going to cope with large files.
At the moment the definitions of the upload & download methods look like this (written using Apache CXF):
boolean uploadFile(@WebParam(name = "username") String username,
@WebParam(name = "password") String password,
@WebParam(name = "filename") String filename,
@WebParam(name = "fileContents") byte[] fileContents)
throws UploadException, LoginException;
byte[] downloadFile(@WebParam(name = "username") String username,
@WebParam(name = "password") String password,
@WebParam(name = "filename") String filename) throws DownloadException,
LoginException;
So the file gets uploaded and downloaded as a byte array. But if I have a file of some stupid size (e.g. 1GB) surely this will try and put all that information into memory and crash my service.
So my question is - is it possible to return some kind of stream instead? I would imagine this isn't going to be terribly OS independent though. Although I know the theory behind web services, the practical side is something that I still need to pick up a bit of information on.
Cheers for any input,
Lee | 0 | [
2,
92,
31,
21,
2741,
365,
30,
4815,
21,
3766,
60,
800,
3726,
3726,
31,
22,
195,
74,
1174,
21,
265,
3010,
30,
129,
408,
148,
71,
8294,
279,
7121,
6488,
20,
55,
9,
31,
22,
195,
905,
21,
2741,
365,
20,
48,
4865,
6109,
49,
857,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Maven dependancy exclusion for War file, but inclusion for tests
===
I have a maven POM file for a web service. For one of the dependencies I have to specify several exclusions for jar files that are already kept at a higher-level in the web-application server (accessible to all web-applications, not just this particular one). One example of such exclusion is the JAR containing my JDBC driver.
Example (with fictional details):
<dependency>
<groupId>mygroup</groupId>
<artifactId>myartifact</artifactId>
<version>1.0.0</version>
<exclusions>
<!--The jdbc driver causes hot-deployment issues-->
<exclusion>
<groupId>db.drivers</groupId>
<artifactId>jdbc</artifactId>
</exclusion>
</exclusions>
</dependency>
The problem I am encountering is that I need the JDBC driver for my tests. My tests currently fail since they cannot load the JDBC driver.
How can I configure the POM so that it is accessible to my tests, but does not get included into my WAR file?
| 0 | [
2,
1216,
3124,
12547,
10821,
16232,
26,
176,
3893,
15,
47,
10660,
26,
4894,
800,
3726,
3726,
31,
57,
21,
1216,
3124,
16214,
3893,
26,
21,
2741,
365,
9,
26,
53,
16,
14,
29411,
31,
57,
20,
19077,
238,
16232,
18,
26,
5112,
6488,
30... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Exception handling using an HttpModule
===
We're reviewing one of the company's system's exception handling and found a couple of interesting things.
Most of the code blocks (if not all of them) are inside a try/catch block, and inside the catch block a new BaseApplicationException is being thrown - which seems to be coming from the Enterprise Libraries.
I'm in a bit of a trouble here as I don't see the benefits off doing this. (throwing another exception anytime one occurs)
One of the developers who's been using the system for a while said it's because that class's in charge of publishing the exception (sending emails and stuff like that) but he wasn't too sure about it.
After spending some time going through the code I'm quite confident to say, that's all it does is collecting information about the environment and than publishing it.
My question is:
- Is it reasonable to wrap all the code inside try { } catch { } blocks and than throw a new exception? And if it is, why? What's the benefit?
My personal opinion is that it would be much easier to use an HttpModule, sign up for the Error event of the Application event, and do what's necessary inside the module. If we'd go down this road, would we miss something? Any drawbacks?
Your opinion's much appreciated. | 0 | [
2,
5391,
7988,
568,
40,
7775,
19673,
62,
800,
3726,
3726,
95,
22,
99,
18046,
53,
16,
14,
237,
22,
18,
329,
22,
18,
5391,
7988,
17,
216,
21,
1335,
16,
4883,
564,
9,
127,
16,
14,
1797,
5198,
13,
5,
821,
52,
65,
16,
105,
6,
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... |
Show a ContextMenuStrip without it showing in the taskbar
===
I have found that when execute the show() method for a contextmenustrip (a right click menu), if the position is outside that of the form it belongs to, it shows up on the taskbar also.
I am trying to create a right click menu for when clicking on the notifyicon, but as the menu hovers above the system tray and not inside the form (as the form can be minimised when right clicking) it shows up on the task bar for some odd reason
Here is my code currently:
private: System::Void notifyIcon1_MouseClick(System::Object^ sender, System::Windows::Forms::MouseEventArgs^ e) {
if(e->Button == System::Windows::Forms::MouseButtons::Right) {
this->sysTrayMenu->Show(Cursor->Position);
}
}
What other options do I need to set so it doesn't show up a blank process on the task bar. | 0 | [
2,
298,
21,
4141,
755,
267,
17851,
366,
32,
3187,
19,
14,
3005,
1850,
800,
3726,
3726,
31,
57,
216,
30,
76,
15644,
14,
298,
5,
6,
2109,
26,
21,
4141,
755,
267,
17851,
13,
5,
58,
193,
10840,
11379,
6,
15,
100,
14,
649,
25,
71... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you retrieve a list of logged-in/connected users in C#?
===
Here's the scenario:
You have a Windows server that users remotely connect to via RDP. You want your program (which runs as a service) to know who is currently connected. This may or may not include an interactive console session.
Please note that this is the **not** the same as just retrieving the current interactive user.
I'm guessing that there is some sort of API access to Terminal Services to get this info? | 0 | [
2,
184,
107,
42,
11917,
21,
968,
16,
13,
19287,
8,
108,
118,
23520,
3878,
19,
272,
5910,
60,
800,
3726,
3726,
235,
22,
18,
14,
12705,
45,
42,
57,
21,
1936,
8128,
30,
3878,
23288,
6379,
20,
1197,
13,
897,
306,
9,
42,
259,
154,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Adding ListItems to a DropDownList from a generic list
===
I have a this aspx-code: (sample)
<asp:DropDownList runat="server" ID="ddList1"></asp:DropDownList>
With this codebehind:
List<System.Web.UI.WebControls.ListItem> colors = new List<System.Web.UI.WebControls.ListItem>();
colors.Add(new ListItem("Select Value", "0"));
colors.Add(new ListItem("Red", "1"));
colors.Add(new ListItem("Green", "2"));
colors.Add(new ListItem("Blue", "3"));
ddList1.DataSource = colors;
ddList1.DataBind();
The output looks like this:
<select name="ddList1" id="ddList1">
<option value="Select Value">Select Value</option>
<option value="Red">Red</option>
<option value="Green">Green</option>
<option value="Blue">Blue</option>
</select>
My question is: Why did my values (numbers) disappear and the text used as the value AND the text? I know that it works if I use the `ddList1.Items.Add(New ListItem("text", "value"))` method, but I need to use a generic list as the datasource for other reasons. | 0 | [
2,
4721,
968,
2119,
79,
18,
20,
21,
2804,
2968,
5739,
37,
21,
12733,
968,
800,
3726,
3726,
31,
57,
21,
48,
28,
306,
396,
8,
9375,
45,
13,
5,
6101,
5106,
6,
13,
1,
472,
306,
45,
12361,
2968,
5739,
485,
721,
3726,
7,
10321,
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... |
Different between Overflow:hidden and display:none
===
Different between Overflow:hidden and display:none | 0 | [
2,
421,
128,
20285,
45,
1822,
43,
817,
17,
3042,
45,
15746,
800,
3726,
3726,
421,
128,
20285,
45,
1822,
43,
817,
17,
3042,
45,
15746,
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... | [
1,
1,
1,
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... |
How to disable #pragma warnings?
===
While developing a C++ application, I had to use a 3rd party library which produced a huge amount of warnings related with a harmless #pragma directive being used.
../File.hpp:1: warning: ignoring #pragma ident
Is it possible to disable this kind of warnings, when using the GNU C++ compiler? | 0 | [
2,
184,
20,
1460,
579,
6926,
7310,
14336,
3590,
18,
60,
800,
3726,
3726,
133,
3561,
21,
272,
20512,
3010,
15,
31,
41,
20,
275,
21,
203,
897,
346,
1248,
56,
671,
21,
2329,
2006,
16,
3590,
18,
1597,
29,
21,
21346,
6926,
7310,
1433... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which ORM for .net would you recommend?
===
I haven't worked on a .net project for a while (more than a year). Before I've never used an ORM for a .net app. What are some of your takes on this? Does using one make sense? Which ones should I consider trying? | 4 | [
2,
56,
54,
79,
26,
13,
9,
2328,
83,
42,
12360,
60,
800,
3726,
3726,
31,
2933,
22,
38,
577,
27,
21,
13,
9,
2328,
669,
26,
21,
133,
13,
5,
1995,
119,
21,
159,
6,
9,
115,
31,
22,
195,
243,
147,
40,
54,
79,
26,
21,
13,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Font size in CSS - % or em?
===
When setting the size of fonts in CSS, should I be using a percent value or em? Can you explain the advantage? | 0 | [
2,
9978,
1072,
19,
272,
18,
18,
13,
8,
13,
11881,
54,
3579,
60,
800,
3726,
3726,
76,
2697,
14,
1072,
16,
9978,
18,
19,
272,
18,
18,
15,
378,
31,
44,
568,
21,
2091,
1923,
54,
3579,
60,
92,
42,
3271,
14,
3314,
60,
3,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Can "classic" ASP.NET pages and Microsoft MVC coexist in the same web application?
===
I'm thinking about trying out MVC later today for a new app we're starting up, but I'm curious if it's an all or nothing thing or if I can still party like it's 2006 with viewstate and other crutches at the same time... | 0 | [
2,
92,
13,
7,
19824,
7,
28,
306,
9,
2328,
4434,
17,
7099,
307,
8990,
326,
1706,
702,
19,
14,
205,
2741,
3010,
60,
800,
3726,
3726,
31,
22,
79,
1440,
88,
749,
70,
307,
8990,
138,
786,
26,
21,
78,
4865,
95,
22,
99,
1422,
71,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In Visual Studio how to give relative path of a .lib file in project properties
===
I am building a project using Visual Studio. The project has a dependency on a lib file generated by another project. This project is there is the parent directory of the actual project I am building.
To be more clear,
I have a "ParentDir" which has two subDirectories Project1 and Project2 under it.
Now Project1 depends on lib generated by Project2.
In the properties of Project1, I am trying to give a relative path using
$(SolutionDir)/../ParentDir/Project2/Debug
But this does not seem to work.
Can you tell me where i am going wrong, or suggest the correct way of achieving this. | 0 | [
2,
19,
3458,
1120,
184,
20,
590,
4543,
2013,
16,
21,
13,
9,
8326,
3893,
19,
669,
3704,
800,
3726,
3726,
31,
589,
353,
21,
669,
568,
3458,
1120,
9,
14,
669,
63,
21,
26835,
27,
21,
13,
8326,
3893,
6756,
34,
226,
669,
9,
48,
66... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PDB files in VisualStudio bin\debug folders
===
I have a VS (2008) solution consisting of several projects, not all in the same namespace. When I build the solution, all the dlls used by the top level project **TopProject** are copied into the *TopProject\bin\debug* folder. However, the corresponding .pdb files are only copied for some of the other projects. This is a pain, for example when using [NDepend][1].
How does VS decide which .pdb files to copy into higher level bin\debug folders? How can I get VS to copy the others too?
[1]: http://www.ndepend.com/ | 0 | [
2,
351,
9007,
6488,
19,
3458,
21026,
4511,
1,
546,
16254,
19294,
18,
800,
3726,
3726,
31,
57,
21,
4611,
13,
5,
2753,
6,
4295,
4160,
16,
238,
2314,
15,
52,
65,
19,
14,
205,
204,
5582,
9,
76,
31,
1895,
14,
4295,
15,
65,
14,
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... |
Method 'XYZ' cannot be reflected
===
We have consumed a third party web service and are trying to invoke it from an ASP.NET web application.
However when I instantiate the web service the following System.InvalidOperationException exception is thrown:
> Method 'ABC.XYZ' can not be reflected.
> System.InvalidOperationException:
> Method 'ABC.XYZ' can not be reflected.
> ---> System.InvalidOperationException: The XML element 'MyDoc' from namespace
> 'http://mysoftware.com/ns' references
> a method and a type. Change the
> method's message name using
> WebMethodAttribute or change the
> type's root element using the
> XmlRootAttribute.
From what I can gather there appears to be some ambiguity between a method and a type in the web service.
Can anyone clarify the probably cause of this exception and is there anything I can do to rectify this or should I just go to the web service owners to rectify? | 0 | [
2,
2109,
13,
22,
15161,
380,
22,
1967,
44,
7037,
800,
3726,
3726,
95,
57,
10936,
21,
422,
346,
2741,
365,
17,
50,
749,
20,
28371,
32,
37,
40,
28,
306,
9,
2328,
2741,
3010,
9,
207,
76,
31,
6322,
15882,
14,
2741,
365,
14,
249,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Sprint Cumulative Flow Diagram
===
Can anyone give me some tips about how to read a Cumulative Flow Diagram. I'm not sure what kind of things its telling me. | 0 | [
2,
6672,
25224,
3312,
14161,
800,
3726,
3726,
92,
1276,
590,
55,
109,
11034,
88,
184,
20,
1302,
21,
25224,
3312,
14161,
9,
31,
22,
79,
52,
562,
98,
825,
16,
564,
82,
2497,
55,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Are delphi variables initialized with a value by default?
===
I'm new to Delphi, and I've been running some tests to see what object variables and stack variables are initialized to by default:
TInstanceVariables = class
fBoolean: boolean; // always starts off as false
fInteger: integer; // always starts off as zero
fObject: TObject; // always starts off as nil
end;
This is the behaviour I'm used to from other languages, but I'm wondering if it's safe to rely on it in Delphi? For example, I'm wondering if it might depend on a compiler setting, or perhaps work differently on different machines. Is it normal to rely on default initialized values for objects, or do you explicitly set all instance variables in the constructor?
As for stack (procedure-level) variables, my tests are showing that unitialized booleans are true, unitialized integers are 2129993264, and uninialized objects are just invalid pointers (i.e. not nil). I'm guessing the norm is to always set procedure-level variables before accessing them? | 0 | [
2,
50,
23030,
12157,
2104,
1333,
29,
21,
1923,
34,
12838,
60,
800,
3726,
3726,
31,
22,
79,
78,
20,
23030,
15,
17,
31,
22,
195,
74,
946,
109,
4894,
20,
196,
98,
3095,
12157,
17,
7566,
12157,
50,
2104,
1333,
20,
34,
12838,
45,
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... |
Presentations on switching from Perl to Python
===
Short story:
I'm looking for presentations/good articles on switching from Perl to Python.
Longer story:
I'm a programmer / embedded hardware engineer in a hardware design group. A few years ago I've convinced my co-workers to use Perl for scripting (instead of a weird mixture of batch files, Excel, Matlab and TCL). Since then, I myself have switched from Perl to Python and am very happy about the change. I want to somehow convince my coworkers to follow my path, but I need good points to convince them. These can't be heavy programmer voodoo like better reflection facilities (unlike myself, most people here are EE graduates and not programmers).
Any ideas ? Good articles / presentations on the topic ? Perhaps someone has already done it and can share tips.
Note:
[This thread][1] is somewhat on the same topic, but not quite fits my requirements.
[1]: http://stackoverflow.com/questions/132310/why-do-you-like-python | 0 | [
2,
6364,
18,
27,
13027,
37,
416,
255,
20,
20059,
800,
3726,
3726,
502,
609,
45,
31,
22,
79,
699,
26,
6364,
18,
118,
3264,
3376,
27,
13027,
37,
416,
255,
20,
20059,
9,
1045,
609,
45,
31,
22,
79,
21,
17968,
13,
118,
12138,
7610,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why should I ever use inline code?
===
I'm a C/C++ developer, and here are a couple of questions that always baffled me.
<ul>
<li>Is there a big difference between "regular" code and inline code?</li>
<li>Which is the main difference?</li>
<li>Is inline code simply a "form" of macros?</li>
<li>What kind of tradeoff must be done when choosing to inline your code?</li>
</ul>
Thanks | 0 | [
2,
483,
378,
31,
462,
275,
19,
1143,
1797,
60,
800,
3726,
3726,
31,
22,
79,
21,
272,
118,
150,
20512,
10058,
15,
17,
235,
50,
21,
1335,
16,
2346,
30,
550,
29027,
55,
9,
13,
1,
1287,
1,
13,
1,
1210,
1,
403,
80,
21,
580,
284... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
jQuery - running a function on a new image
===
I'm a jQuery novice, so the answer to this may be quite simple:
I have an image, and I would like to do several things with it.
When a user clicks on a 'Zoom' icon, I'm running the 'imagetool' plugin (http://code.google.com/p/jquery-imagetool/) to load a larger version of the image. The plugin creates a new div around the image and allows the user to pan around.
When a user clicks on an alternative image, I'm removing the old one and loading in the new one.
The problem comes when a user clicks an alternative image, and then clicks on the zoom button - the imagetool plugin creates the new div, but the image appears after it...
The code is as follows:
// Product Zoom (jQuery)
$(document).ready(function(){
$("#productZoom").click(function() {
// Set new image src
var imageSrc = $("#productZoom").attr("href");
$("#productImage").attr('src', imageSrc);
// Run the imagetool plugin on the image
$(function() {
$("#productImage").imagetool({
viewportWidth: 300,
viewportHeight: 300,
topX: 150,
topY: 150,
bottomX: 450,
bottomY: 450
});
});
return false;
});
});
// Alternative product photos (jQuery)
$(document).ready(function(){
$(".altPhoto").click(function() {
$('#productImageDiv div.viewport').remove();
$('#productImage').remove();
// Set new image src
var altImageSrc = $(this).attr("href");
$("#productZoom").attr('href', altImageSrc);
var img = new Image();
$(img).load(function () {
$(this).hide();
$('#productImageDiv').append(this);
$(this).fadeIn();
}).error(function () {
// notify the user that the image could not be loaded
}).attr({
src: altImageSrc,
id: "productImage"
});
return false;
});
});
It seems to me, that the imagetool plugin can no longer see the #productImage image once it has been replaced with a new image... So I think this has something to do with binding? As in because the new image is added to the dom after the page has loaded, the iamgetool plugin can no longer use it correctly... is this right?
If so, any ideas how to deal with it? | 0 | [
2,
487,
8190,
93,
13,
8,
946,
21,
1990,
27,
21,
78,
1961,
800,
3726,
3726,
31,
22,
79,
21,
487,
8190,
93,
21999,
15,
86,
14,
1623,
20,
48,
123,
44,
1450,
1935,
45,
31,
57,
40,
1961,
15,
17,
31,
83,
101,
20,
107,
238,
564,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Different layouts in JSP application
===
I have a bunch of JSP files and backend in Tomcat. I have 3 different versions of JSP with same logic inside but with different layouts. So if I change some logic I have three JSP file to fix.
What is the proper soution for such a scenario? I thought of some XML and XSLT stack: backend gives only data in XML and than for each layout I have XSLT that does some magic.
Could you point me into some direction? | 0 | [
2,
421,
9106,
18,
19,
487,
3401,
3010,
800,
3726,
3726,
31,
57,
21,
7653,
16,
487,
3401,
6488,
17,
97,
2451,
19,
2067,
5782,
9,
31,
57,
203,
421,
3281,
16,
487,
3401,
29,
205,
7085,
572,
47,
29,
421,
9106,
18,
9,
86,
100,
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... |
How do I - in ASP.NET save the info from a page when a user leaves the page?
===
In our CMS, we have a page in which we enable users to play around with their site hierarchy - move pages around, add and remove pages, etc.
We would like to let the users play around as much as they want, and only when they leave the page - to save their changes.
Is there a way to do that? We thought of making the user click a "publish" button when they're ready to commit their changes, but we're afraid users won't remember to do that, and then all their changes will be lost. Another problem with the button is that it's inconsistent with the behavior of the rest of the site (all other edits and changes are saved automatically)
So how can we automatically save user changes on leaving the page? | 0 | [
2,
184,
107,
31,
13,
8,
19,
28,
306,
9,
2328,
2079,
14,
15404,
37,
21,
2478,
76,
21,
4155,
2084,
14,
2478,
60,
800,
3726,
3726,
19,
318,
2390,
18,
15,
95,
57,
21,
2478,
19,
56,
95,
9240,
3878,
20,
418,
140,
29,
66,
689,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can you echo a newline in batch files?
===
How can you you insert a newline from your batch file output.
I want to do something like:
echo hello\nworld
or
echo line1\nline2\nline3 | 0 | [
2,
184,
92,
42,
8117,
21,
78,
1143,
19,
13064,
6488,
60,
800,
3726,
3726,
184,
92,
42,
42,
14692,
21,
78,
1143,
37,
154,
13064,
3893,
5196,
9,
31,
259,
20,
107,
301,
101,
45,
8117,
10975,
1,
103,
4423,
54,
8117,
293,
165,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
The permissions granted to user ' are insufficient for performing this operation. (rsAccessDenied)"}
===
created a report model using SSRS (2005) and then published local server. But when i tried to run report for the model i published using report builder i do get the following error.
Report execution error:The permissions granted to user are insufficient for performing this operation. (rsAccessDenied) | 0 | [
2,
14,
5572,
18,
2743,
20,
4155,
13,
22,
50,
14748,
26,
2955,
48,
1453,
9,
13,
5,
1224,
20604,
817,
49,
69,
6,
7,
1,
800,
3726,
3726,
679,
21,
1330,
1061,
568,
22118,
18,
13,
5,
2835,
6,
17,
94,
467,
375,
8128,
9,
47,
76,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Deterministic dispose of ThreadStatic objects
===
The [ThreadStatic attribute][1] declares a static variable as unique-per-thread.
Do you know an easy pattern to correctly dispose such variables?
What we used before ThreadStatic is a ThreadContextManager. Every thread was allocated a ThreadContext which retained all thread-specific information. We spawned some threads and let them work. Then, when they all finished, we disposed of the ThreadContentManager, which in turn disposed all the contexts if they were IDisposable.
I don't see an immediate way to translate this pattern to ThreadStatic objects. The objects will be disposed of eventualy, because the threads die, and so nothing reference them. However, we prefer deterministic dispose whenever possible.
[1]: http://stackoverflow.com/questions/9033?#13932 | 0 | [
2,
15190,
2160,
3771,
17913,
16,
9322,
18077,
3916,
800,
3726,
3726,
14,
636,
96,
10647,
18077,
35,
14755,
500,
2558,
165,
500,
10123,
18,
21,
12038,
7612,
28,
2619,
8,
1432,
8,
96,
10647,
9,
107,
42,
143,
40,
2010,
3732,
20,
1204... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Test automation using batch files:
===
I have the following layout for my test suite:
TestSuite1.cmd:
1. Run my program
2. Check it's return result
3. If the return result is not 0, convert the error to textual output and abort the script
In my single .cmd file, I call my program about 10 times with different input.
The problem is that the program that I run 10 times takes several hours to run each time.
Is there a way for me to parallelize all of these 10 runnings of my program while still somehow checking the return result and providing a proper output file and while still using a **single** .cmd file?
| 0 | [
2,
1289,
23217,
568,
13064,
6488,
45,
800,
3726,
3726,
31,
57,
14,
249,
9106,
26,
51,
1289,
6160,
45,
1289,
12352,
62,
165,
9,
9095,
43,
45,
137,
9,
485,
51,
625,
172,
9,
2631,
32,
22,
18,
788,
829,
203,
9,
100,
14,
788,
829... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 add an action to visio (2003)
===
In a visio shapesheet one can add actions. I want to create an action that updates the value of another cell (the position of a control). How can one do that. Does it need a separate macro, or can it be specified directly? And how? | 0 | [
2,
184,
107,
31,
3547,
40,
1028,
20,
9060,
1963,
13,
5,
3325,
6,
800,
3726,
3726,
19,
21,
9060,
1963,
2539,
17627,
53,
92,
3547,
3078,
9,
31,
259,
20,
1600,
40,
1028,
30,
16779,
14,
1923,
16,
226,
1667,
13,
5,
124,
649,
16,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
I have a gem installed but require 'gemname' does not work. Why?
===
The question I'm really asking is why require does not take the name of the gem. Also, In the case that it doesn't, what's the easiest way to find the secret incantation to require the damn thing!?
As an example if I have `memcache-client` installed then I have to require it using
require 'rubygems'
require 'memcache'
| 0 | [
2,
31,
57,
21,
8551,
4066,
47,
4077,
13,
22,
20231,
7259,
22,
630,
52,
170,
9,
483,
60,
800,
3726,
3726,
14,
1301,
31,
22,
79,
510,
3379,
25,
483,
4077,
630,
52,
247,
14,
204,
16,
14,
8551,
9,
67,
15,
19,
14,
610,
30,
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... |
The Joel Test in Action - Improving your company
===
[Joel Test][1] is a good and famous list checking some requisites every software company should concern about.
They are:
1. Do you use source control?
2. Can you make a build in one step?
3. Do you make daily builds?
4. Do you have a bug database?
5. Do you fix bugs before writing new code?
6. Do you have an up-to-date schedule?
7. Do you have a spec?
8. Do programmers have quiet working conditions?
9. Do you use the best tools money can buy?
10. Do you have testers?
11. Do new candidates write code during their interview?
12. Do you do hallway usability testing?
My current company hits 0 (I said ZERO) points when I arrive there some month ago. Now we 'proudly' hits 3 - source control, one step build and daily builds. But I'm trying to do more (bug database, wiki, quiet conditions, better interviews...)!
What about your company? How many hits? List what you will do to achive more!
[1]: http://www.joelonsoftware.com/articles/fog0000000043.html | 4 | [
2,
14,
8873,
1289,
19,
1028,
13,
8,
9273,
154,
237,
800,
3726,
3726,
636,
1636,
532,
1289,
500,
2558,
165,
500,
25,
21,
254,
17,
1561,
968,
9886,
109,
302,
16756,
6359,
352,
2306,
237,
378,
3630,
88,
9,
59,
50,
45,
137,
9,
107... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way to switch configuration between Development/UAT/Prod environments in ASP.NET?
===
I need to switch among 3 different environments when developing my web app - Development, UAT, and Prod. I have different database connections in my configuration files for all 3. I have seen switching these settings done manually by changing all references and then rebuilding the solution, and also done with preprocessor directives. Is there an easy way to do this based on some variable so that the configuration doesn't have to be revised when deploying to a new environment every time? | 0 | [
2,
246,
161,
20,
5521,
8091,
128,
522,
118,
3786,
38,
118,
2740,
43,
11246,
19,
28,
306,
9,
2328,
60,
800,
3726,
3726,
31,
376,
20,
5521,
497,
203,
421,
11246,
76,
3561,
51,
2741,
4865,
13,
8,
522,
15,
287,
721,
15,
17,
895,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 generate XML Binding Code from a DTD?
===
Most Java-XML binding frameworks and code generators need XML Schema Defintions. Can you suggest the best way to generate binding code from DTD.
I know that the XJC in JAXB 2 supports DTD but it is considered experimental.
In the spirit of Stack Overflow, one suggestion per answer please - to be voted up or down instead of duplicated | 0 | [
2,
98,
25,
14,
246,
161,
20,
7920,
23504,
8728,
1797,
37,
21,
13,
43,
38,
43,
60,
800,
3726,
3726,
127,
8247,
8,
396,
8184,
8728,
6596,
18,
17,
1797,
20495,
376,
23504,
23874,
121,
5617,
3309,
18,
9,
92,
42,
5601,
14,
246,
161... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I split the output from mysqldump into smaller files?
===
I need to move entire tables from one MySQL database to another. I don't have full access to the second one, only phpMyAdmin access. I can only upload (compressed) sql files smaller than 2MB. But the compressed output from a mysqldump of the first database's tables is larger than 10MB.
Is there a way to split the output from mysqldump into smaller files? I cannot use split(1) since I cannot cat(1) the files back on the remote server.
Or is there another solution I have missed? | 0 | [
2,
184,
107,
31,
2132,
14,
5196,
37,
51,
18,
22402,
43,
11134,
77,
2012,
6488,
60,
800,
3726,
3726,
31,
376,
20,
780,
1078,
7484,
37,
53,
51,
18,
22402,
6018,
20,
226,
9,
31,
221,
22,
38,
57,
503,
1381,
20,
14,
153,
53,
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... |
Force Https in Websphere 6.1
===
I was wondering how i can force a user who has requested a page using Http to use the secure https version?
I am using Websphere 6.1 as my application server and Rad 7 as my development environment
Thanks
Damien | 0 | [
2,
558,
7775,
18,
19,
2741,
14079,
400,
9,
165,
800,
3726,
3726,
31,
23,
5712,
184,
31,
92,
558,
21,
4155,
72,
63,
6602,
21,
2478,
568,
7775,
20,
275,
14,
4315,
7775,
18,
615,
60,
31,
589,
568,
2741,
14079,
400,
9,
165,
28,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0... |
Why does Castle Windsor hold onto transient objects?
===
Recently I noticed my application appears to be eating memory that never gets released. After profiling with CLRProfiler I've found that the Castle Windsor container I'm using is holding onto objects. These objects are declared with the lifestyle="transient" attribute in the config xml.
I've found if I put an explicit call to IWindsorContainer.Release(hangingObject), that it will drop its references.
This is causing a problem though, I wasn't expecting that with a transient lifestyle object CastleWindsor would keep a reference and effectively create a leak. It's going to be a rather mundane and error prone task going around inserting explicit Release calls in all the appropriate places.
Have you seen this problem, and do you have any suggestions for how to get around it? | 0 | [
2,
483,
630,
1339,
10784,
1027,
1204,
26008,
3916,
60,
800,
3726,
3726,
1989,
31,
2711,
51,
3010,
1780,
20,
44,
5320,
1912,
30,
243,
3049,
261,
9,
75,
8721,
49,
802,
29,
10842,
139,
14503,
139,
31,
22,
195,
216,
30,
14,
1339,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I set a task to run every so often?
===
How do I have a script run every, say 30 minutes? I assume there are different ways for different OSs. I'm using OS X. | 0 | [
2,
184,
107,
31,
309,
21,
3005,
20,
485,
352,
86,
478,
60,
800,
3726,
3726,
184,
107,
31,
57,
21,
3884,
485,
352,
15,
395,
712,
902,
60,
31,
7158,
80,
50,
421,
2847,
26,
421,
19504,
9,
31,
22,
79,
568,
13,
759,
993,
9,
3,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is the Windows version of cron?
===
A [Google search][1] turned up software that performs the same functions as cron, but nothing built into Windows.
I'm running Windows XP Professional, but advice for any version of Windows would be potentially helpful to someone.
EDIT: Is there also a way to invoke this feature (which based on answers is called the Task Scheduler) programatically or via the command line?
[1]: http://www.google.com/search?ie=UTF-8&oe=UTF-8&sourceid=navclient&gfns=1&q=windows+cron | 0 | [
2,
98,
25,
14,
1936,
615,
16,
13,
19587,
60,
800,
3726,
3726,
21,
636,
16111,
4875,
2122,
500,
2558,
165,
500,
412,
71,
2306,
30,
11563,
14,
205,
3719,
28,
13,
19587,
15,
47,
626,
392,
77,
1936,
9,
31,
22,
79,
946,
1936,
23045... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 force a maven MOJO to be executed only once at the end of a build?
===
I have a MOJO I would like executed once, and once only after the test phase of the last project in the reactor to run.
Using:
if (!getProject().isExecutionRoot()) {
return ;
}
at the start of the execute() method means my mojo gets executed once, however at the very beginning of the build - before all other child modules.
| 0 | [
2,
184,
107,
42,
558,
21,
1216,
3124,
27316,
20,
44,
5557,
104,
382,
35,
14,
241,
16,
21,
1895,
60,
800,
3726,
3726,
31,
57,
21,
27316,
31,
83,
101,
5557,
382,
15,
17,
382,
104,
75,
14,
1289,
2702,
16,
14,
236,
669,
19,
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... |
Is there a difference between `==` and `is` in python?
===
My Google-fu has failed me.
In Python, are these:
n = 5
# Test one.
if n == 5:
print 'Yay!'
# Test two.
if n is 5:
print 'Yay!'
two tests for equality equivalent (ha!)? Does this hold true for objects where you would be comparing instances (a `list` say)?
Okay, so this kind of answers my question:
l = list()
l.append(1)
if l == [1]:
print 'Yay!'
# Holds true, but...
if l is [1]:
print 'Yay!'
# Doesn't.
So `==` tests value where `is` tests to see if they are the same object?
| 0 | [
2,
25,
80,
21,
2841,
128,
13,
1,
3726,
3726,
1,
17,
13,
1,
403,
1,
19,
20059,
60,
800,
3726,
3726,
51,
8144,
8,
4096,
63,
1702,
55,
9,
19,
20059,
15,
50,
158,
45,
13,
103,
800,
331,
6926,
1289,
53,
9,
100,
13,
103,
800,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Flex HttpService : appending to destination
===
I am using Flex to connect to a Rest service. To access order #32, for instance, I can call the URL http://[service]/orders/32.
The URL *must* be configured as a destination - since the client will connect to different instances of the service. All of this is using the Blaze Proxy, since it involves GET, PUT, DELETE and POST calls.
The problem is:- how do I append the "32" to the end of a destination when using HttpService? All I do is set the destination, and at some point this is converted into a URL. I have traced the code, but I don't know where this is done, so can't replace it.
Options are:
1. Resolve the destination to a URL within the Flex client, and then set the URL (with the appended data) as the URL.
2. Write my own java Flex Adapter that overrides the standard Proxy, and map parameters to the url like the following: http://[service]/order/{id}?id=32 to http://[service]/order/32
Has anyone come across this problem before, and are there any simple ways to resolve this? | 0 | [
2,
14409,
7775,
11449,
13,
45,
4865,
7601,
20,
6970,
800,
3726,
3726,
31,
589,
568,
14409,
20,
6379,
20,
21,
760,
365,
9,
20,
1381,
389,
11489,
135,
15,
26,
4851,
15,
31,
92,
645,
14,
287,
6362,
7775,
6903,
2558,
11449,
500,
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... |
What is Big O notation? Do you use it?
===
What is Big O notation? Do you use it?
I missed this university class I guess :D
Does anyone use it and give some real life examples of where they used it? | 0 | [
2,
98,
25,
580,
635,
15591,
60,
107,
42,
275,
32,
60,
800,
3726,
3726,
98,
25,
580,
635,
15591,
60,
107,
42,
275,
32,
60,
31,
3238,
48,
155,
718,
31,
2321,
13,
45,
43,
630,
1276,
275,
32,
17,
590,
109,
683,
201,
3770,
16,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to check if column exists in SQL Server table
===
I need to add the specific column if it does not exist.
To be more specific I have something like this:
IF EXISTS( SELECT * FROM INFORMATION_SCHEMA.COLUMNS WHERE TABLE_NAME = 'myTableName' AND AND COLUMN_NAME = 'myColumnName')
but it always returns false. | 0 | [
2,
184,
20,
2631,
100,
4698,
5636,
19,
4444,
255,
8128,
859,
800,
3726,
3726,
31,
376,
20,
3547,
14,
1903,
4698,
100,
32,
630,
52,
3182,
9,
20,
44,
91,
1903,
31,
57,
301,
101,
48,
45,
100,
5636,
5,
5407,
1637,
37,
676,
1,
75... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.