unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
can I refactor my mySql queries into one based on number of results?
===
I have a table `y` Which has two columns `a` and `b`
Entries are
a b
1 2
1 3
1 4
0 5
0 2
0 4
I want to get 2,3,4 if I search column `a` for 1, and 5,2,4 if I search column `a`.
So, if I search A for something that is in A, (1) I get those rows, and if there are no entries A for given value, give me the 'Defaults' (`a` = '0')
Here is how I would know how to do it.
$r = mysql_query('SELECT `b` FROM `y` WHERE `a` = \'1\';');
//This gives desired results, 3 rows
$r = mysql_query('SELECT `b` FROM `y` WHERE `a` = \'2\';');
//This does not give desired results yet.
//Get the number of rows, and then get the 'defaults'
if(mysql_num_rows($r) === 0) $r = mysql_query('SELECT `b` FROM `y` WHERE `a` = 0;');
So, now that it's sufficiently explained, how do I do that in one query, and what about performance concerns? The most used portion would be the third query, because there would only be values in `a` for a number IF you stray from the defaults.
| 0 | [
2,
92,
31,
302,
17455,
51,
51,
18,
22402,
9386,
2829,
77,
53,
432,
27,
234,
16,
1736,
60,
800,
3726,
3726,
31,
57,
21,
859,
13,
1,
93,
1,
56,
63,
81,
7498,
13,
1,
58,
1,
17,
13,
1,
220,
1,
11399,
50,
21,
334,
137,
172,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 send clean email messages from your application?
===
When developing an application that sends out notification email messages, what are the best practices for
1. not getting flagged as a spammer by your hosting company. (Cover any of:)
- best technique for not flooding a mail server
- best mail server products, if you were to set up your own
- sending messages as if from a specific user but still clearly from your application (to ensure complaints, etc come back to you) without breaking good email etiquette
- any other lessons learned
1. not getting flagged as spam by the receiver's client? (Cover any of:)
- configuring and using sender-id, domain-keys, SPF, reverse-dns, etc to make sure your emails are properly identified
- best SMTP header techniques to avoid getting flagged as spam when sending emails for users (for example, using Sender and From headers together)
- any other lessons learned
An additional requirement: this application would be sending a single message to a single recipient based upon an event. So, techniques for sending the same messages to multiple recipients will not apply.
| 0 | [
2,
184,
20,
2660,
2745,
8517,
7561,
37,
154,
3010,
60,
800,
3726,
3726,
76,
3561,
40,
3010,
30,
11350,
70,
52,
4634,
8517,
7561,
15,
98,
50,
14,
246,
5242,
26,
137,
9,
52,
1017,
13,
29694,
28,
21,
6954,
11531,
34,
154,
10637,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
GWT or DOJO or something else?
===
I come from the Microsoft world (and I come in peace). I want to rapidly prototype a web app and if it works out, take it live - and I don't want to use ASP.Net.
I am not sure which web application toolkit to use though. Should I use GWT, DOJO...other recommendations? I am open to any server-side language but am looking at RoR, Php or even Java (J2EE to be precise). I am not much of a Javascript/CSS guy so a toolkit that might make it relatively easy on me on those fronts would be preferable.
Also, I am a mac user at home. What IDEs go along with the framework you would recommend?
Any recommendations guys?
| 0 | [
2,
14094,
38,
54,
107,
1636,
54,
301,
962,
60,
800,
3726,
3726,
31,
340,
37,
14,
7099,
126,
13,
5,
290,
31,
340,
19,
1728,
6,
9,
31,
259,
20,
4805,
7063,
21,
2741,
4865,
17,
100,
32,
693,
70,
15,
247,
32,
515,
13,
8,
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... |
Is "do not load this page directly" really necessary in PHP?
===
I was going to ask what the best way to do this is, but then decided I should ask whether or not it is even necessary. I have never seen it done in JSP development, but it appears to be common practice in PHP. What is the reasoning behind this, and if I do not protect against this, what else should I be taking into consideration? | 0 | [
2,
25,
13,
7,
537,
52,
6305,
48,
2478,
1703,
7,
510,
2378,
19,
13,
26120,
60,
800,
3726,
3726,
31,
23,
228,
20,
1349,
98,
14,
246,
161,
20,
107,
48,
25,
15,
47,
94,
868,
31,
378,
1349,
1472,
54,
52,
32,
25,
166,
2378,
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's the simplest way to test whether a number is a power of 2 in C++
===
I need a function like this:
<pre>
// return true iff 'n' is a power of 2, e.g.
// is_power_of_2(2) => true is_power_of_2(3) => false
bool is_power_of_2(int n);
</pre>
Can anyone suggest how I could write this? Can you tell me a good web site where this sort of algorithm can be found? | 0 | [
2,
98,
22,
18,
14,
24384,
161,
20,
1289,
1472,
21,
234,
25,
21,
414,
16,
172,
19,
272,
20512,
800,
3726,
3726,
31,
376,
21,
1990,
101,
48,
45,
13,
1,
3515,
1,
12894,
788,
1151,
13,
6021,
13,
22,
103,
22,
25,
21,
414,
16,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Code behind in ASP.NET MVC
===
What is the purpose of the code behind view file in ASP.NET MVC besides setting of the generic parameter for ViewData? | 0 | [
2,
1797,
439,
19,
28,
306,
9,
2328,
307,
8990,
800,
3726,
3726,
98,
25,
14,
2131,
16,
14,
1797,
439,
1418,
3893,
19,
28,
306,
9,
2328,
307,
8990,
3410,
2697,
16,
14,
12733,
18906,
26,
1418,
18768,
60,
3,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What Fortran compilers are there?
===
What Fortran compilers are there in this day and age, and which would you recommend? Please list the version of Fortran it supports, the platform it works on (e.g. *nix / Windows), and whether it cost money.
(Standard OS one per answer etc.) | 0 | [
2,
98,
26,
17685,
21486,
18,
50,
80,
60,
800,
3726,
3726,
98,
26,
17685,
21486,
18,
50,
80,
19,
48,
208,
17,
348,
15,
17,
56,
83,
42,
12360,
60,
2247,
968,
14,
615,
16,
26,
17685,
32,
6747,
15,
14,
2452,
32,
693,
27,
13,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Checking for external dependances in vb.net
===
Something i've never really done before, but what is the best way to make sure that any external assemblies/dll's that my application uses are available, and possibly the correct version.
I wrote an app that relies on the System.Data.SQLite.dll, i went to test it on a machine where that dll was missing, and my app just threw up a runtime exception because the dll was missing. How can i trap this error? | 0 | [
2,
9886,
26,
4886,
12547,
2416,
18,
19,
13,
20468,
9,
2328,
800,
3726,
3726,
301,
31,
22,
195,
243,
510,
677,
115,
15,
47,
98,
25,
14,
246,
161,
20,
233,
562,
30,
186,
4886,
21066,
118,
43,
211,
22,
18,
30,
51,
3010,
2027,
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... |
What Agile methodology?
===
What agile methodology would you recommend for a web-site shop?
We have a variety of small projects and a few large ones, teams are cross-project and they multitask. We are really interested in Scrum, but it seems that it would not apply to small projects (less than 2 weeks), which currently make up a lot of our time.
What alternatives are out there to implement agile principles in our situation? | 0 | [
2,
98,
27475,
18653,
60,
800,
3726,
3726,
98,
27475,
18653,
83,
42,
12360,
26,
21,
2741,
8,
9097,
2546,
60,
95,
57,
21,
1747,
16,
284,
2314,
17,
21,
310,
370,
53,
18,
15,
952,
50,
919,
8,
21011,
17,
59,
1889,
38,
20310,
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... |
Project technology choices
===
If you were given a web project from your manager to implement and you were given free choice as to what technologies to use?
I know alot of companies have their standard technologies that they use and are very against trying out new things
| 0 | [
2,
669,
1099,
10978,
800,
3726,
3726,
100,
42,
46,
504,
21,
2741,
669,
37,
154,
1382,
20,
8713,
17,
42,
46,
504,
551,
1837,
28,
20,
98,
5740,
20,
275,
60,
31,
143,
21,
5639,
16,
1532,
57,
66,
1236,
5740,
30,
59,
275,
17,
50,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
best way to get started in setting up Mono for ASP.NET on Mac
===
I have recently gained access to a Mac. I am wondering if anyone has any tips/advice for setting up [Mono][1] on a mac for development and execution of ASP.NET? Most resources point to Linux implementations which tend to differ a lot from the way Mac's do things. Any tips or advice would be helpful
[1]: http://www.mono-project.com/Main_Page | 0 | [
2,
246,
161,
20,
164,
373,
19,
2697,
71,
4129,
26,
28,
306,
9,
2328,
27,
1572,
800,
3726,
3726,
31,
57,
1989,
2528,
1381,
20,
21,
1572,
9,
31,
589,
5712,
100,
1276,
63,
186,
11034,
118,
1283,
18507,
26,
2697,
71,
636,
20027,
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... |
Apache and IIS side by side (both listening on port 80) on windows2003
===
What are some good ways to do this? Is it even possible to do cleanly?
Ideally I'd like to use packet headers to decide which server should handle requests. However, if there is an easier/better way let me know. | 0 | [
2,
17140,
17,
595,
18,
270,
34,
270,
13,
5,
8110,
4948,
27,
1295,
2972,
6,
27,
1936,
3325,
800,
3726,
3726,
98,
50,
109,
254,
2847,
20,
107,
48,
60,
25,
32,
166,
938,
20,
107,
2745,
102,
60,
5628,
102,
31,
22,
43,
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... |
Is it a good (correct) way to encapsulate a collection?
===
class MyContainedClass {
};
class MyClass {
public:
MyContainedClass * getElement() {
// ...
std::list<MyContainedClass>::iterator it = ... // retrieve somehow
return &(*it);
}
// other methods
private:
std::list<MyContainedClass> m_contained;
};
Though msdn says std::list should not perform relocations of elements on deletion or insertion, is it a good and common way to return pointer to a list element?
PS: I know that I can use collection of pointers (and will have to delete elements in destructor), collection of shared pointers (which I don't like), etc. | 0 | [
2,
25,
32,
21,
254,
13,
5,
25345,
6,
161,
20,
1957,
4666,
18,
12383,
21,
1206,
60,
800,
3726,
3726,
718,
51,
28578,
1898,
13,
1,
13,
1,
73,
718,
51,
1898,
13,
1,
317,
45,
51,
28578,
1898,
1637,
164,
27567,
5,
6,
13,
1,
128... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Fluent NHibernate Many-to-Many
===
I am using Fluent NHibernate and having some issues getting a many to many relationship setup with one of my classes. It's probably a stupid mistake but I've been stuck for a little bit trying to get it working. Anyways, I have a couple classes that have Many-Many relationships.
public class Person
{
public Person()
{
GroupsOwned = new List<Groups>();
}
public virtual IList<Groups> GroupsOwned { get; set; }
}
public class Groups
{
public Groups()
{
Admins= new List<Person>();
}
public virtual IList<Person> Admins{ get; set; }
}
With the mapping looking like this
Person: ...
HasManyToMany<Groups>(x => x.GroupsOwned)
.WithTableName("GroupAdministrators")
.WithParentKeyColumn("PersonID")
.WithChildKeyColumn("GroupID")
.Cascade.SaveUpdate();
Groups: ...
HasManyToMany<Person>(x => x.Admins)
.WithTableName("GroupAdministrators")
.WithParentKeyColumn("GroupID")
.WithChildKeyColumn("PersonID")
.Cascade.SaveUpdate();
When I run my integration test, basically I'm creating a new person and group. Adding the Group to the Person.GroupsOwned. If I get the Person Object back from the repository, the GroupsOwned is equal to the initial group, however, when I get the group back if I check count on Group.Admins, the count is 0. The Join table has the GroupID and the PersonID saved in it.
Thanks for any advice you may have. | 0 | [
2,
19252,
12109,
15191,
8820,
151,
8,
262,
8,
14842,
800,
3726,
3726,
31,
589,
568,
19252,
12109,
15191,
8820,
17,
452,
109,
1549,
1017,
21,
151,
20,
151,
1429,
18161,
29,
53,
16,
51,
2684,
9,
32,
22,
18,
910,
21,
3553,
5643,
47... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What embedded database with Isolated Storage support can you recommend?
===
I'm looking for embedded database engine supporting [isolating storage][1]. Currently I'm aware of VistaDB. What else you can recommend?
Requirements are pretty simple:
* xcopy deployment
* support for isolated storage
* preferably free
[1]: http://msdn.microsoft.com/en-us/library/3ak841sy(VS.80).aspx | 0 | [
2,
98,
12138,
6018,
29,
6331,
4326,
555,
92,
42,
12360,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
12138,
6018,
1406,
3134,
636,
49,
5594,
1880,
4326,
500,
2558,
165,
500,
9,
871,
31,
22,
79,
3854,
16,
13520,
9007,
9,
98,
962,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Solutions for INSERT OR UPDATE on SQL Server
===
Assume a table structure of MyTable(KEY, datafield1, datafield2...)
Often I want to either update an existing record, or insert a new record if it doesn't exist.
essentially
if (key exists)
Run Update command
ELSE
run insert command
What's the best performing way to write this? | 0 | [
2,
6776,
26,
14692,
54,
11100,
27,
4444,
255,
8128,
800,
3726,
3726,
7158,
21,
859,
1411,
16,
51,
5924,
5,
4237,
15,
1054,
1109,
165,
15,
1054,
1109,
135,
9,
9,
9,
6,
478,
31,
259,
20,
694,
11100,
40,
3149,
571,
15,
54,
14692,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I compile Asp.Net Aspx Pages before loading them with a webserver?
===
It's really annoying that visual studio hides typos in aspx pages (not the code be hind).
If the compiler would compile them, I would get a compile error. | 0 | [
2,
184,
92,
31,
26561,
28,
306,
9,
2328,
28,
306,
396,
4434,
115,
12797,
105,
29,
21,
2741,
10321,
106,
60,
800,
3726,
3726,
32,
22,
18,
510,
17610,
30,
3458,
1120,
3077,
18,
22550,
18,
19,
28,
306,
396,
4434,
13,
5,
1270,
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... |
Does anyone knows of a good MAML editor
===
At work we use Sandcastle for creation of help files. I have been using SandCastleGUI for some time and I'm looking for a way to create additional pages in the help file.
These pages are written in XML format called MAML.
The only problem is that I couldn't find any decent editor for these file format.
Does anyone knows of a good WYSIWYG editor? | 0 | [
2,
630,
1276,
3620,
16,
21,
254,
9659,
255,
1835,
800,
3726,
3726,
35,
170,
95,
275,
1965,
16736,
26,
2502,
16,
448,
6488,
9,
31,
57,
74,
568,
1965,
16736,
7215,
26,
109,
85,
17,
31,
22,
79,
699,
26,
21,
161,
20,
1600,
1351,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 IIS7 be installed on XP?
===
I'm pretty sure I know the answer to this, but short of a virtual Vista installation, is there a way to install II7 on XP?
| 0 | [
2,
92,
595,
18,
465,
44,
4066,
27,
23045,
60,
800,
3726,
3726,
31,
22,
79,
1772,
562,
31,
143,
14,
1623,
20,
48,
15,
47,
502,
16,
21,
6599,
13520,
7758,
15,
25,
80,
21,
161,
20,
16146,
595,
465,
27,
23045,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Persistent Binary Tree / Hash table in .Net
===
I need a pure .Net based solution similar to berkeley-db Java edition.
Functionally it should opperate in a similar maner to a DHT such memcached and velocity etc but it doesn't have to be distributed. In essence I am looking for a persistent hashtable.
Does anyone have any ideas or suggestions?
Paul | 0 | [
2,
15348,
14171,
1541,
13,
118,
19170,
859,
19,
13,
9,
2328,
800,
3726,
3726,
31,
376,
21,
4267,
13,
9,
2328,
432,
4295,
835,
20,
8039,
8,
9007,
8247,
1322,
9,
7652,
102,
32,
378,
3088,
1432,
1373,
19,
21,
835,
169,
106,
20,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get the result of a command in a variable in windows?
===
I'm looking to get the result of a command as a variable in a Windows batch script (see [how to get the result of a command in bash](http://stackoverflow.com/questions/58207/using-the-result-of-a-command-as-an-argument-in-bash#58214) for the bash scripting equivalent). A solution that will work in a .bat file is preferred, but other common windows scripting solutions are also welcome. | 0 | [
2,
184,
107,
31,
164,
14,
829,
16,
21,
1202,
19,
21,
7612,
19,
1936,
60,
800,
3726,
3726,
31,
22,
79,
699,
20,
164,
14,
829,
16,
21,
1202,
28,
21,
7612,
19,
21,
1936,
13064,
3884,
13,
5,
1798,
636,
1544,
20,
164,
14,
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... |
The ideal LAMP environment
===
There's alot of information out there on setting up LAMP stacks on a single box, or perhaps moving MySQL onto it's own box, but growing beyond that doesn't seem to be very well documented.
My current web environment is having capacity issues, and so I'm looking for **best-practices** regarding **configuration tuning**, determining **bottlenecks**, **security**, etc.
I presently host around 450 sites, with a fair need for redundany and security, and so I've grown beyond the single-box solution - but am not at the level of a full ISP or dedicated web-hosting company.
Can anyone point me in the direction of some good **expertise on setting up a great apache web-farm** with a view to security and future expansion?
My web environment consists of 2 redundant MySQL servers, 2 redundant web-content servers, 2 load balancing front-end apache servers that mount the content via nfs and share apache config and sessions directories between them, and a single "developer's" server which also mounts the web-content via nfs, and contains all the developer accounts. It presently hosts some 400 or so separate sites
I'm pretty happy with alot of this setup, but it seems to be choking on the load prematurely.
Thanks!!
| 0 | [
2,
14,
5628,
6792,
2307,
800,
3726,
3726,
80,
22,
18,
21,
5639,
16,
676,
70,
80,
27,
2697,
71,
6792,
7566,
18,
27,
21,
345,
1649,
15,
54,
1774,
1219,
51,
18,
22402,
1204,
32,
22,
18,
258,
1649,
15,
47,
1991,
1701,
30,
1437,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
data structure for assembly code, interesting problem.
===
I'm planning to create a data structure optimized to hold assembly code. That way I can be totally responsible for the optimization algorithms that will be working on this structure. If I can compile while running. It will be kind of dynamic execution. Is this possible? Have any one seen something like this?
Should I use structs to link the structure into a program flow. Are objects better?
struct asm_code {
int type;
int value;
int optimized;
} asm_imp;
| 0 | [
2,
1054,
1411,
26,
1475,
1797,
15,
4883,
1448,
9,
800,
3726,
3726,
31,
22,
79,
2334,
20,
1600,
21,
1054,
1411,
22864,
43,
20,
1027,
1475,
1797,
9,
30,
161,
31,
92,
44,
5139,
1864,
26,
14,
21597,
15935,
30,
129,
44,
638,
27,
48... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Will having multiple filegroups help speed up my database?
===
Currently, I am developing a product that does fairly intensive calculations using MS SQL Server 2005. At a high level, the architecture of my product is based on the concept of "runs" where each time I do some analytics it gets stored in a series of run tables (~100 tables per run).
The problem I'm having is that when the number of runs grows to be about 1,000 or so after a few months, performance on the database really seems to drop off, and specifically simple queries like checking for the existence of tables or creating views can take up to a second to two.
I've heard that using multiple filegroups, which I'm not currently doing, could help. Is this true, and if so, why/how would that help? Also, if there are other suggestions, even ones like, use fewer tables, I'm open to them. I just want to speed the database up and hopefully get it in a state where it will scale. | 0 | [
2,
129,
452,
1886,
3893,
8024,
18,
448,
1362,
71,
51,
6018,
60,
800,
3726,
3726,
871,
15,
31,
589,
3561,
21,
2374,
30,
630,
6647,
13633,
19186,
568,
4235,
4444,
255,
8128,
812,
9,
35,
21,
183,
662,
15,
14,
2607,
16,
51,
2374,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Multi-Format File Viewer for .Net Development
===
Is anyone aware of a multi-format file viewer, capable of displaying common image formats, as well as MS Office document formats (at least Word and Excel), and PDFs? I've seen several image viewers available, but none besides Outside In from Oracle.
I'm looking for viewer technology that can be imbedded in a .net application - a mixture of vb and c#
| 0 | [
2,
1889,
8,
23588,
3893,
16812,
26,
13,
9,
2328,
522,
800,
3726,
3726,
25,
1276,
3854,
16,
21,
1889,
8,
23588,
3893,
16812,
15,
3868,
16,
17418,
757,
1961,
13767,
15,
28,
134,
28,
4235,
488,
4492,
13767,
13,
5,
721,
639,
833,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I pop up an image in a seperate div on the mouseover of a div using only CSS?
===
I have a small gallery of thumbnails. When I place my mousepointer over a thumbnail image I'd like to have a full size image pop up in a div in the top right of the screen. I've seen this done using just CSS and I'd like to go down that route rather than use javascript if possible. | 0 | [
2,
184,
107,
31,
1675,
71,
40,
1961,
19,
21,
10332,
106,
1373,
13,
12916,
27,
14,
7567,
2549,
16,
21,
13,
12916,
568,
104,
272,
18,
18,
60,
800,
3726,
3726,
31,
57,
21,
284,
2246,
16,
5078,
325,
947,
18,
9,
76,
31,
209,
51,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the best tools for reverse engineering z80 machine code?
===
A particular assembler/disassembler or something else entirely? | 0 | [
2,
98,
50,
14,
246,
4672,
26,
7006,
1552,
2052,
2887,
1940,
1797,
60,
800,
3726,
3726,
21,
1498,
13,
13736,
139,
118,
2906,
13736,
139,
54,
301,
962,
2894,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Can I check if a SOAP web service supports a certain WebMethod?
===
Our web services are distributed across different servers for various reasons (such as decreasing latency to the client), and they're not always all up-to-date. Rather than throwing an exception when a method *doesn't* exist because the particular web service is too old, it would be nicer if we could have the client check if the service responds to a given method before calling it, and otherwise disable the feature (or work around it).
Is there a way to do that? | 0 | [
2,
92,
31,
2631,
100,
21,
6447,
2741,
365,
6747,
21,
1200,
2741,
5909,
1807,
43,
60,
800,
3726,
3726,
318,
2741,
687,
50,
4387,
464,
421,
17595,
26,
617,
2932,
13,
5,
4289,
28,
19581,
456,
14386,
20,
14,
6819,
6,
15,
17,
59,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
mySQL: Advisable number of rows
===
Considering an indexed mySQL table with 7 columns, being constantly queried and written to, what is the advisable number of rows that this table should be allowed to contain before the performance would be improved by splitting the data off into other tables? | 0 | [
2,
51,
18,
22402,
45,
21,
43,
3762,
579,
234,
16,
11295,
800,
3726,
3726,
5154,
40,
4348,
69,
51,
18,
22402,
859,
29,
453,
7498,
15,
142,
7545,
9386,
11942,
17,
642,
20,
15,
98,
25,
14,
21,
43,
3762,
579,
234,
16,
11295,
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... |
DataGridViewCell Bordercolor
===
Does anyone know how to change the Bordercolor for a Datagridviewcell in c#?
Here's a picture of what I mean:
![Datagridviewstyle][1]
[Picture][2]
Backgroundcolor, Textcolor and [Images][3] are no Problem, but I don't know how to realise the Borders.
Another problem is the cross in the second Row, but that's for later...
[1]: http://www.zivillian.de/datagridview.png
[2]: http://www.zivillian.de/datagridview.png
[3]: http://forums.microsoft.com/MSDN/ShowPost.aspx?PostID=233320&SiteID=1 | 0 | [
2,
1054,
16375,
4725,
9725,
1862,
11282,
800,
3726,
3726,
630,
1276,
143,
184,
20,
753,
14,
1862,
11282,
26,
21,
1054,
16375,
4725,
9725,
19,
272,
5910,
60,
235,
22,
18,
21,
2151,
16,
98,
31,
884,
45,
13,
187,
2558,
18768,
16375,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best way of spell checking an entire web site in one go?
===
Preferably server-side (Linux) or client-side (Windows) tools rather than web-based tools. Although, come to think of it, web tools would be interesting too.
And there must be an easy mechanism of adding domain-specific terminology. | 0 | [
2,
98,
22,
18,
14,
246,
161,
16,
4762,
9886,
40,
1078,
2741,
689,
19,
53,
162,
60,
800,
3726,
3726,
6369,
4801,
8128,
8,
1416,
13,
5,
1226,
7147,
6,
54,
6819,
8,
1416,
13,
5,
27508,
18,
6,
4672,
864,
119,
2741,
8,
1281,
4672... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
RSA encryption library for c++
===
Hello I am developing a win32 application and I would like to use an RSA encryption library. **What Library would you reccomend?** | 0 | [
2,
13,
22038,
24420,
1248,
26,
272,
20512,
800,
3726,
3726,
10975,
31,
589,
3561,
21,
628,
3125,
3010,
17,
31,
83,
101,
20,
275,
40,
13,
22038,
24420,
1248,
9,
13,
1409,
608,
1248,
83,
42,
6042,
960,
2451,
60,
1409,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Sun Certified Web Component Developer exams
===
I was just wondering does anyone know if there any massive differences in the SCWCD 1.4 exams and the 1.5 exams?
Also does anyone know of any good urls or pdf's that can be used to study for this exam | 0 | [
2,
939,
6935,
2741,
5912,
10058,
15954,
800,
3726,
3726,
31,
23,
114,
5712,
630,
1276,
143,
100,
80,
186,
3787,
4921,
19,
14,
4729,
12354,
43,
137,
9,
300,
15954,
17,
14,
137,
9,
264,
15954,
60,
67,
630,
1276,
143,
16,
186,
254,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Sharepoint calculated field's formula for created by
===
i have a sharepoint list
with 2 users for examole (user A and user B)
i need a calculated field in the list items such that if user "A" created the item the field vaule will be "X" and if user "B" created the item fields value would be "Y"
but i couldnt use [created by] in the furmiula of the calculated field !! why is that ?!! and is there another way to do what i need to do ?! | 0 | [
2,
1891,
3132,
10785,
575,
22,
18,
3729,
26,
679,
34,
800,
3726,
3726,
31,
57,
21,
1891,
3132,
968,
29,
172,
3878,
26,
11796,
6069,
13,
5,
16704,
21,
17,
4155,
334,
6,
31,
376,
21,
10785,
575,
19,
14,
968,
3755,
145,
30,
100,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How should I best emulate and/or avoid enum's in Python?
===
I've been using a small class to emulate Enums in some Pyhton projects. Is there a better way or does this make the most sense for some situations?
Class code here:
class Enum(object):
'''Simple Enum Class
Example Usage:
>>> codes = Enum('FOO BAR BAZ') # codes.BAZ will be 2 and so on ...'''
def __init__(self, names):
for number, name in enumerate(names.split()):
setattr(self, name, number) | 0 | [
2,
184,
378,
31,
246,
23804,
17,
118,
248,
2658,
1957,
723,
22,
18,
19,
20059,
60,
800,
3726,
3726,
31,
22,
195,
74,
568,
21,
284,
718,
20,
23804,
1957,
723,
18,
19,
109,
7103,
252,
444,
2314,
9,
25,
80,
21,
574,
161,
54,
63... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the main differences between CLTL2 and ANSI CL?
===
Any online links / resources? | 0 | [
2,
98,
50,
14,
407,
4921,
128,
10842,
7786,
135,
17,
40,
18,
49,
10842,
60,
800,
3726,
3726,
186,
2087,
6271,
13,
118,
2566,
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... | [
1,
1,
1,
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... |
Cookies and subdomains
===
Can a cookie be shared between two sites on the same top level domain? Say www.example.com and secure.example.com ?
We are looking into implementing a cache for non-secure content, and need to segregate secure content to another domain.
What parameters does the cookie need? I'm using asp.net
| 0 | [
2,
19396,
17,
972,
537,
6232,
18,
800,
3726,
3726,
92,
21,
19980,
44,
2592,
128,
81,
3259,
27,
14,
205,
371,
662,
4603,
60,
395,
13,
6483,
9,
29041,
9,
960,
17,
4315,
9,
29041,
9,
960,
13,
60,
95,
50,
699,
77,
17333,
21,
165... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subversion: Moving Directories with History
===
I have a SVN structure like this:
/Projects
/Project1
/Project2
/someFolder
/Project3
/Project4
Now, i would like to move all the projects into the /Projects folder, which means I want to move Projects 3 and 4 from /someFolder into the /projects folder.
The caveat: I'd like to keep the full history. I assume that every client would have to check out the stuff from the new location again, which is fine, but I still wonder what the best approach is to move directories without completely destroying the History?
Subversion 1.5 if that matters. | 0 | [
2,
972,
10898,
45,
1219,
559,
1596,
29,
447,
800,
3726,
3726,
31,
57,
21,
13,
18,
16578,
1411,
101,
48,
45,
13,
118,
21011,
18,
13,
118,
21011,
165,
13,
118,
21011,
135,
13,
118,
3220,
8814,
106,
13,
118,
21011,
240,
13,
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... |
Topological sort, recursive, using generators.
===
Data: a dependency list, already verified to be acyclic. So here, 'a' depends on 'b','c','d' (c depends on d), etc...
A = { 'a' : dict(b=1, c=1),
'c' : dict(d=1),
'd' : dict(e=1,f=1,g=1),
'h' : dict(j=1)
}
I'd like to have a top-down, recursive solution to let's say, find the chain starting at
'a': a, c, d, e, g, f, b
So, right now (a printing solution):
def get_all(D,k):
print k
for ii in D.get(k,[]):
get_all(D, ii)
Obviously, this is pretty weak :) I've been banging my head about how to how to get yields inside there, and I'd appreciate any py-foo y'all can bring to this.
| 0 | [
2,
24341,
2058,
15,
302,
24244,
15,
568,
20495,
9,
800,
3726,
3726,
1054,
45,
21,
26835,
968,
15,
614,
23334,
20,
44,
21,
15888,
9,
86,
235,
15,
13,
22,
58,
22,
9597,
27,
13,
22,
220,
22,
15,
22,
150,
22,
15,
22,
43,
22,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Entity Framework: how to return a base type from L2E
===
Considering the following architecture:
- a base object 'Entity'
- a derived object 'Entry:Base'
- and a further derived object 'CancelledEntry:Entry'
In EntitySQL I can write the following:
[...] where it is of (only MyEntities.Entry) [...]
to return only objects of type Entry and no Entity or CancelledEntry.
In linq to sql, the following command will return objects of type Entry and CancelledEntry.
EntityContext.EntitySet.OfType<Entry>()
What is the syntax/function to use to return only objects of type Entry?
| 0 | [
2,
9252,
6596,
45,
184,
20,
788,
21,
1000,
1001,
37,
644,
135,
62,
800,
3726,
3726,
5154,
14,
249,
2607,
45,
13,
8,
21,
1000,
3095,
13,
22,
2291,
856,
22,
13,
8,
21,
3981,
3095,
13,
22,
18195,
45,
8436,
22,
13,
8,
17,
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... |
What is the most important factor, that determents the cost of a project.
===
If you have $100 in your hand right now. And have to bet on one of these options. That would you bet it on? The question is:
What is the most important factor, that determents the cost of a project.
1. Typing speed of the programmers.
1. The total amount of characters typed while programming.
1. The 'wc *.c' command. The end size of the c files.
1. The abstractions used while solving the problem.
| 0 | [
2,
98,
25,
14,
127,
681,
3932,
15,
30,
15190,
6601,
14,
1516,
16,
21,
669,
9,
800,
3726,
3726,
100,
42,
57,
18162,
19,
154,
224,
193,
130,
9,
17,
57,
20,
5676,
27,
53,
16,
158,
6368,
9,
30,
83,
42,
5676,
32,
27,
60,
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... |
Script.aculo.us Autocompleter problem in IE
===
I'm struggleing with a problem with the Script.aculo.us Autocompleter control in IE (I've tried it in IE6 & 7). The suggestions fail to appear for the first character is entered into the text box after the page has been loaded. After that initial failure, the control works as it should.
I've verified that the suggestions data is returned from the server correctly; the problem appears to have something to do with the positioning of the suggestions element, as other relatively positioned elements on the page move out of position at the moment that you'd expect the suggestions to appear.
Has anyone heard of such a problem or have any suggestions on how to fix it? | 0 | [
2,
3884,
9,
1738,
12415,
9,
267,
3108,
15990,
139,
1448,
19,
13,
660,
800,
3726,
3726,
31,
22,
79,
4697,
68,
29,
21,
1448,
29,
14,
3884,
9,
1738,
12415,
9,
267,
3108,
15990,
139,
569,
19,
13,
660,
13,
5,
49,
22,
195,
794,
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... |
What is the reasoning behind the recommended layout for Subversion repositories?
===
[*Version Control with Subversion*][1] recommends the following layout for (single-project) repositories (complemented by [*this question*][2]):
/trunk
/tags
/rel.1 (approximately)
...
/branches
/rel1fixes
What are the relative merits of this arrangement when compared with a (perhaps) more process-oriented one?:
/development
/current
/stable
/qa (maybe)
...
/production
/stable
/Prod.2
/Prod.1
/vendor
/Rel.5.1
/Rel.5.2
Please note that I'm thinking of in-house deployment, rather than building a product.
Disclaimer: although I'm a Subversion user, I've never had to deploy with it in a real live environment.
[1]: http://svnbook.red-bean.com/nightly/en/svn.tour.importing.html#svn.tour.importing.layout
[2]: http://stackoverflow.com/questions/49356/what-is-a-good-repository-layout-for-releases-and-projects-in-subversion
| 0 | [
2,
98,
25,
14,
15543,
439,
14,
5773,
9106,
26,
972,
10898,
302,
14882,
262,
2829,
60,
800,
3726,
3726,
636,
2483,
10898,
569,
29,
972,
10898,
2483,
500,
2558,
165,
500,
12360,
18,
14,
249,
9106,
26,
13,
5,
14031,
8,
21011,
6,
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... |
Issues creating a box using CSS
===
I want to create a box shape and I am having trouble.
I want the box to have a background color, and then different color inside the box.
The box will then have a list of items using ul and li, and each list item will have a background of white, and the list item's background color is too stretch the entire distance of the inner box.
Also, the list items should have a 1 px spacing between each one, so that the background color of the inside box color is visible.
Here is a rough sketch of what I am trying to do:
<img src="http://i38.tinypic.com/2nalnrl.png"> | 0 | [
2,
1549,
2936,
21,
1649,
568,
272,
18,
18,
800,
3726,
3726,
31,
259,
20,
1600,
21,
1649,
2539,
17,
31,
589,
452,
2572,
9,
31,
259,
14,
1649,
20,
57,
21,
2395,
1665,
15,
17,
94,
421,
1665,
572,
14,
1649,
9,
14,
1649,
129,
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... |
Custom Text Wrapping in WPF
===
Is there a way of wrapping text in a non-rectangular container in WPF?
[Here is how it is done in photoshop][1]
[1]: http://www.photoshopessentials.com/photoshop-text/text-effects/text-wrap/page-3.php | 0 | [
2,
5816,
1854,
13437,
19,
619,
7721,
800,
3726,
3726,
25,
80,
21,
161,
16,
13437,
1854,
19,
21,
538,
8,
14673,
12113,
7451,
12147,
19,
619,
7721,
60,
636,
6836,
25,
184,
32,
25,
677,
19,
7064,
5347,
500,
2558,
165,
500,
636,
165... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do you use TestLink and are you happy with it ?
===
In our project, we use this software for test management. What is your experience with this software ? Does it scale correctly with thousands of tests ? | 0 | [
2,
107,
42,
275,
1289,
6258,
17,
50,
42,
1700,
29,
32,
13,
60,
800,
3726,
3726,
19,
318,
669,
15,
95,
275,
48,
2306,
26,
1289,
1097,
9,
98,
25,
154,
1496,
29,
48,
2306,
13,
60,
630,
32,
3464,
12044,
29,
3805,
16,
4894,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is there a Java unit-test framework that auto-tests getters and setters?
===
There is a well-known debate in Java (and other communities, I'm sure) whether or not trivial getter/setter methods should be tested. Usually, this is with respect to code coverage. Let's agree that this is an open debate, and not try to answer it here.
There have been several blog posts on using Java reflection to auto-test such methods.
Does any framework (e.g. jUnit) provide such a feature? e.g. An annotation that says "this test T should auto-test all the getters/setters on class C, because I assert that they are standard".
It seems to me that it would add value, and if it were configurable, the 'debate' would be left as an option to the user.
| 0 | [
2,
25,
80,
21,
8247,
1237,
8,
10543,
6596,
30,
3108,
8,
10543,
18,
164,
6052,
17,
309,
6052,
60,
800,
3726,
3726,
80,
25,
21,
134,
8,
2929,
4503,
19,
8247,
13,
5,
290,
89,
2584,
15,
31,
22,
79,
562,
6,
1472,
54,
52,
13,
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... |
Good PHP ORM Library?
===
Does anyone know of a good object-relational-mapping library for PHP? I know of PDO/ADO, but they seem to only provide abstraction of differences between database vendors not an actual mapping between the domain model and the relational model. I'm looking for a PHP library that functions similarly to the way Hibernate does for Java/.Net. | 0 | [
2,
254,
13,
26120,
54,
79,
1248,
60,
800,
3726,
3726,
630,
1276,
143,
16,
21,
254,
3095,
8,
99,
10832,
192,
8,
540,
5574,
1248,
26,
13,
26120,
60,
31,
143,
16,
351,
537,
118,
5672,
15,
47,
59,
2260,
20,
104,
1181,
23907,
16,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What types of requirements add the most value?
===
I am looking for input on where developers find value in requirements.
I understand there are times and situations where requirements [make a mess][1], but let's presume the person writing the requirements understands the business and what they need. Maybe requirements are needed for governance, or testing, or even because none of the coders understand the business. The question is, if you don't understand the need as well as the "writer," what will help you build a better mousetrap?
Presuming you work on enterprise applications in a corporation and the life-cycle is closer to Waterfall than it is to Agile, please include details about not only what adds value, but why.
If you like UML, which part? Do you like use cases diagrams, but not the textual information that comes with it? What about data flow diagrams? Process flows? "System shall" statements? Business rule charts?
Help me understand so I can write better stuff for you to use. *Heck*, even feedback on what you hate and why would be helpful.
[1]: http://steve-yegge.blogspot.com/2008/08/business-requirements-are-bullshit.html | 0 | [
2,
98,
2551,
16,
4786,
3547,
14,
127,
1923,
60,
800,
3726,
3726,
31,
589,
699,
26,
6367,
27,
113,
10168,
477,
1923,
19,
4786,
9,
31,
1369,
80,
50,
436,
17,
8329,
113,
4786,
636,
11115,
21,
3957,
500,
2558,
165,
500,
15,
47,
40... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Suggestions for implemetation of a commnd line application interface.
===
I am redesigning a command line application and am looking for a way to make its use more intuitive. Are there any conventions for the format of parameters passed into a command line application? Or any other method that people have found useful? | 0 | [
2,
18389,
26,
5420,
413,
5909,
857,
16,
21,
11951,
706,
293,
3010,
6573,
9,
800,
3726,
3726,
31,
589,
23903,
68,
21,
1202,
293,
3010,
17,
589,
699,
26,
21,
161,
20,
233,
82,
275,
91,
13,
24392,
9,
50,
80,
186,
15117,
26,
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... |
Needless pointer-casts in C
===
I got a comment to my answer on this thread:
[http://stackoverflow.com/questions/105477][1]
In short I had code like this:
int * somefunc (void)
{
int * temp = (int*) malloc (sizeof (int));
temp[0] = 0;
return temp;
}
I got this comment:
> Can I just say, please don't cast the
> return value of malloc? It is not
> required and can hide errors.
I agree that the cast is not required in C. It is mandatory in C++, so I usually add them just in case I have to port the code in C++ one day.
However, I wonder how casts like this can hide errors. Any ideas?
[1]: http://stackoverflow.com/questions/105477 | 0 | [
2,
17023,
18,
454,
106,
8,
6146,
18,
19,
272,
800,
3726,
3726,
31,
330,
21,
6484,
20,
51,
1623,
27,
48,
9322,
45,
636,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
1036,
3963,
4536,
500,
2558,
165,
500,
19,
502,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
DatagridView virtual model with comboboxColumn
===
is it possible to have different items in different rows within a comboboxcolumn in a datagridview. This would be using virtual mode. Code samples would be great. | 0 | [
2,
1054,
16375,
4725,
6599,
1061,
29,
22621,
5309,
716,
4404,
103,
800,
3726,
3726,
25,
32,
938,
20,
57,
421,
3755,
19,
421,
11295,
363,
21,
22621,
5309,
716,
4404,
103,
19,
21,
1054,
16375,
4725,
9,
48,
83,
44,
568,
6599,
3740,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Are EJB still alive ?
===
Do you still use session or entity EJB in your project ? Why ? | 0 | [
2,
50,
13,
10022,
220,
174,
2481,
13,
60,
800,
3726,
3726,
107,
42,
174,
275,
3723,
54,
9252,
13,
10022,
220,
19,
154,
669,
13,
60,
483,
13,
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... | [
1,
1,
1,
1,
1,
1,
1,
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... |
Generally define the process of testing
===
How would you define testing? In the interest of full disclosure, I'm posting this because I already have some answers I like. | 0 | [
2,
1469,
9267,
14,
953,
16,
4431,
800,
3726,
3726,
184,
83,
42,
9267,
4431,
60,
19,
14,
1163,
16,
503,
21449,
15,
31,
22,
79,
15669,
48,
185,
31,
614,
57,
109,
6709,
31,
101,
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,
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... |
Adoption of the Ribbon UI
===
Understandably the Ribbon UI doesn't suit every application, or even most of them, however I'm suprised so few developers have chosen to adopt it. Any ideas why?
How much work would be involved for a fairly major application to get the new UI? | 0 | [
2,
10004,
16,
14,
9162,
13,
5661,
800,
3726,
3726,
1369,
4801,
14,
9162,
13,
5661,
1437,
22,
38,
2961,
352,
3010,
15,
54,
166,
127,
16,
105,
15,
207,
31,
22,
79,
11128,
2777,
69,
86,
310,
10168,
57,
2519,
20,
9512,
32,
9,
186,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
404 Http error handler in Asp.Net MVC (RC 5)
===
How can I Handler 404 erros without framewoks throw Execption 500 error code | 0 | [
2,
13,
23397,
7775,
7019,
24641,
19,
28,
306,
9,
2328,
307,
8990,
13,
5,
5453,
331,
6,
800,
3726,
3726,
184,
92,
31,
24641,
13,
23397,
13,
106,
3171,
366,
3523,
6374,
4020,
3814,
1396,
62,
7439,
3309,
3033,
7019,
1797,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Best way to randomize a string array in C#
===
I was just wondering what is the best way to randomize an array of strings in C#. My array contains about 500 strings and I'd like to create a new Array with the same strings but in a random order.
Any suggestions? | 0 | [
2,
246,
161,
20,
5477,
2952,
21,
3724,
7718,
19,
272,
5910,
800,
3726,
3726,
31,
23,
114,
5712,
98,
25,
14,
246,
161,
20,
5477,
2952,
40,
7718,
16,
7887,
19,
272,
5910,
9,
51,
7718,
1588,
88,
3033,
7887,
17,
31,
22,
43,
101,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Delete all data for a kind in Google App Engine
===
I would like to wipe out all data for a specific kind in Google App Engine. What is the
best way to do this?
I wrote a delete script (hack), but since there is so much data is
timeout's out after a few hundred records. | 0 | [
2,
27448,
65,
1054,
26,
21,
825,
19,
8144,
4865,
1406,
800,
3726,
3726,
31,
83,
101,
20,
11500,
70,
65,
1054,
26,
21,
1903,
825,
19,
8144,
4865,
1406,
9,
98,
25,
14,
246,
161,
20,
107,
48,
60,
31,
738,
21,
27448,
3884,
13,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How Do You Clone A VM Using VMware Fusion?
===
Is it possible to clone a virtual machine using VMware Fusion on Mac OS X? I'm trying the 30 day evaluation version but there doesn't appear to be a clone feature. I tried using the Finder to copy a VM's package structure but it didn't appear in the Virtual Machine Library. | 0 | [
2,
184,
107,
42,
13871,
21,
13,
20147,
568,
13,
20147,
5011,
11117,
60,
800,
3726,
3726,
25,
32,
938,
20,
13871,
21,
6599,
1940,
568,
13,
20147,
5011,
11117,
27,
1572,
13,
759,
993,
60,
31,
22,
79,
749,
14,
712,
208,
8670,
615,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Running code in the context of a java WAR from the command line
===
How would I go about writing some code to allow access to a Java class in my webapp from the command line.
E.g. I have a java class with command line interface, that can runs code in the context of the webapp, with access to the DB etc. I want to log on the machine hosting my WARred app in tomcat and be able to interact with it
Where should i start looking ?
Thanks | 0 | [
2,
946,
1797,
19,
14,
4141,
16,
21,
8247,
176,
37,
14,
1202,
293,
800,
3726,
3726,
184,
83,
31,
162,
88,
1174,
109,
1797,
20,
1655,
1381,
20,
21,
8247,
718,
19,
51,
2741,
7753,
37,
14,
1202,
293,
9,
13,
62,
9,
263,
9,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Python Music Library?
===
I'm looking at writing a little drum machine in Python for fun. I've googled some and found the python pages on [music](http://wiki.python.org/moin/PythonInMusic) and [basic audio](http://wiki.python.org/moin/Audio/) as well as a StackOverflow question on [generating audio files](http://stackoverflow.com/questions/45385/good-python-library-for-generating-audio-files), but **_what I'm looking for is a decent library for music creation_**. Has anyone on here tried to do something like this before? If so, what was your solution? What, either of the ones I've found, or something I haven't found, would be a decent library for audio manipulation?
Minimally, I'd like to be able to do something similar to [Audacity's](http://audacity.sourceforge.net/) scope within python, but if anyone knows of a library that can do more... I'm all ears. | 0 | [
2,
20059,
232,
1248,
60,
800,
3726,
3726,
31,
22,
79,
699,
35,
1174,
21,
265,
4898,
1940,
19,
20059,
26,
2414,
9,
31,
22,
195,
8144,
43,
109,
17,
216,
14,
20059,
4434,
27,
636,
7692,
500,
5,
21127,
6903,
17375,
9,
6448,
11570,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Relative urls for Javascript files
===
I have some code in a javascript file that needs to send queries back to the server. The question is, how do I find the url for the script that I am in, so I can build a proper request url for ajax.
Ie. the same script is included on /, /help /whatever and so on, while it will always need to request from /data.json. Additionally, the same site is run on different servers, where the / folder might be placed differently. I have means to resolve the relative url where I include the Javascript (ez-publish template), but not within the javascript file itself.
Are there small scripts that will work on all browsers made for this? | 0 | [
2,
4543,
13,
911,
7532,
26,
8247,
8741,
6488,
800,
3726,
3726,
31,
57,
109,
1797,
19,
21,
8247,
8741,
3893,
30,
2274,
20,
2660,
9386,
2829,
97,
20,
14,
8128,
9,
14,
1301,
25,
15,
184,
107,
31,
477,
14,
287,
6362,
26,
14,
3884,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 memset() that accepts integers larger than char?
===
Is there a version of memset() which sets a value that is larger than 1 byte (char)? For example, let's say we have a memset32() function, so using it we can do the following:
int32_t array[10];
memset32(array, 0xDEADBEEF, sizeof(array));
This will set the value 0xDEADBEEF in all the elements of array. Currently it seems to me this can only be done with a loop.
Specifically, I am interested in a 64 bit version of memset(). Know anything like that? | 0 | [
2,
25,
80,
55,
79,
3554,
5,
6,
30,
16548,
13820,
18,
1662,
119,
4892,
60,
800,
3726,
3726,
25,
80,
21,
615,
16,
55,
79,
3554,
5,
6,
56,
3415,
21,
1923,
30,
25,
1662,
119,
137,
34,
591,
13,
5,
5433,
6,
60,
26,
823,
15,
40... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Objectively, what are the pros and cons of Cairngorm over PureMVC?
===
There are so many reasons why using an MVC framework in Flex rocks, but picking the right one seems tricky. I am interested in what you all think from your experiences of implementing either of these (or another).
Sam | 0 | [
2,
7038,
102,
15,
98,
50,
14,
895,
18,
17,
11608,
16,
18199,
6979,
79,
84,
4267,
79,
8990,
60,
800,
3726,
3726,
80,
50,
86,
151,
2932,
483,
568,
40,
307,
8990,
6596,
19,
14409,
4860,
15,
47,
7833,
14,
193,
53,
2206,
5514,
93,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there something like 'autotest' for Python unittests?
===
Basically, growl notifications (or other callbacks) when tests break or pass. **Does anything like this exist?**
If not, it should be pretty easy to write.. Easiest way would be to..
1. run `python-autotest myfile1.py myfile2.py etc.py`
- Check if files-to-be-monitored have been modified (possibly just if they've been saved).
- Run any tests in those files.
- If a test fails, but in the previous run it passed, generate a growl alert. Same with tests that fail then pass.
- Wait, and repeat steps 2-5.
The problem I can see there is if the tests are in a different file. The simple solution would be to run all the tests after each save.. but with slower tests, this might take longer than the time between saves, and/or could use a lot of CPU power etc..
The best way to do it would be to actually see what bits of code have changed, if function abc() has changed, only run tests that interact with this.. While this would be great, I think it'd be extremely complex to implement?
To summarise:
- Is there anything like the Ruby tool `autotest` (part of the [ZenTest package](http://www.zenspider.com/ZSS/Products/ZenTest/)), but for Python code?
- How do you check which functions have changed between two revisions of a script?
- Is it possible to determine which functions a command will call? (Somewhat like a reverse traceback) | 0 | [
2,
25,
80,
301,
101,
13,
22,
18042,
10543,
22,
26,
20059,
1237,
10543,
18,
60,
800,
3726,
3726,
11374,
15,
11739,
52,
4634,
18,
13,
5,
248,
89,
645,
1958,
18,
6,
76,
4894,
1442,
54,
1477,
9,
13,
1409,
10739,
602,
101,
48,
3182... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Programmatically updating FILEVERSION in a MFC app w/SVN revision number
===
How do I go about programmatically updating the FILEVERSION string in an MFC app? I have a build process that I use to generate a header file which contains the SVN rev for a given release. I'm using SvnRev from http://www.compuphase.com/svnrev.htm to update a header file which I use to set the caption bar of my MFC app. Now I want to use this #define for my FILEVERION info.
What's the best way to proceed? | 0 | [
2,
625,
6732,
1326,
71,
43,
1880,
3893,
10898,
19,
21,
307,
7061,
4865,
619,
118,
18,
16578,
11323,
234,
800,
3726,
3726,
184,
107,
31,
162,
88,
625,
6732,
1326,
71,
43,
1880,
14,
3893,
10898,
3724,
19,
40,
307,
7061,
4865,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where can I find good tutorials on FO (Formating/ed Objects), the stuff one feeds to fop and get PDF's ?
===
On a company that I've worked, me and my colleagues, implemented a tailored document distribution system on top of FO.
My task was to get the script to deliver the documents and configure the CUPS print server and the Fax server, so I never had the time to get my hands dirty on FO.
I'm thinking of implementing something in the region that was made there but I'll need some templates to work with while testing.
Where can I find some good tutorials on FO, since the fop process I've mastered already? | 0 | [
2,
113,
92,
31,
477,
254,
29724,
18,
27,
4310,
13,
5,
23588,
68,
118,
69,
3916,
6,
15,
14,
3217,
53,
17058,
20,
398,
2594,
17,
164,
13,
11124,
22,
18,
13,
60,
800,
3726,
3726,
27,
21,
237,
30,
31,
22,
195,
577,
15,
55,
17,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What CS class has helped you over and over?
===
The converse of my earlier question. Despite all signs at the time, Theory of Compuation and a Compilers class have been the classes where I have used techniques learned there again and again. Designing state machines as well as writing tokenizers and parsers have been key skills that have proven their worth.
What have you found invaluable? | 4 | [
2,
98,
272,
18,
718,
63,
1456,
42,
84,
17,
84,
60,
800,
3726,
3726,
14,
24052,
16,
51,
1201,
1301,
9,
869,
65,
4832,
35,
14,
85,
15,
1639,
16,
6479,
291,
857,
17,
21,
21486,
18,
718,
57,
74,
14,
2684,
113,
31,
57,
147,
421... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Application Context in Rails
===
Rails comes with a handy session hash into which we can cram stuff to our heart's content. I would, however, like something like ASP's application context, which instead of sharing data only within a single session, will share it with all sessions in the same application. I'm writing a simple dashboard app, and would like to pull data every 5 minutes, rather than every 5 minutes for each session.
I could, of course, store the cache update times in a database, but so far haven't needed to set up a database for this app, and would love to avoid that dependency if possible.
So, is there any way to get (or simulate) this sort of thing? If there's no way to do it without a database, is there any kind of "fake" database engine that comes with Rails, runs in memory, but doesn't bother persisting data between restarts? | 0 | [
2,
3010,
4141,
19,
2240,
18,
800,
3726,
3726,
2240,
18,
1624,
29,
21,
20277,
3723,
19170,
77,
56,
95,
92,
6803,
79,
3217,
20,
318,
582,
22,
18,
2331,
9,
31,
83,
15,
207,
15,
101,
301,
101,
28,
306,
22,
18,
3010,
4141,
15,
56... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I use (require :PACKAGE) in clisp under Ubuntu Hardy?
===
I am trying to evaluate the answer [provided here][1], and am getting the error: <code>"A file with name ASDF-INSTALL does not exist"</code> when using clisp:
dsm@localhost:~$ clisp -q
[1]> (require :asdf-install)
*** - LOAD: A file with name ASDF-INSTALL does not exist
The following restarts are available:
ABORT :R1 ABORT
Break 1 [2]> :r1
[3]> (quit)
dsm@localhost:~$
cmucl throws a similar error:
dsm@localhost:~$ cmucl -q
Warning: #<Command Line Switch "q"> is an illegal switch
CMU Common Lisp CVS release-19a 19a-release-20040728 + minimal debian patches, running on crap-pile
With core: /usr/lib/cmucl/lisp.core
Dumped on: Sat, 2008-09-20 20:11:54+02:00 on localhost
For support see http://www.cons.org/cmucl/support.html Send bug reports to the debian BTS.
or to pvaneynd@debian.org
type (help) for help, (quit) to exit, and (demo) to see the demos
Loaded subsystems:
Python 1.1, target Intel x86
CLOS based on Gerd's PCL 2004/04/14 03:32:47
* (require :asdf-install)
Error in function REQUIRE: Don't know how to load ASDF-INSTALL
[Condition of type SIMPLE-ERROR]
Restarts:
0: [ABORT] Return to Top-Level.
Debug (type H for help)
(REQUIRE :ASDF-INSTALL NIL)
Source:
; File: target:code/module.lisp
(ERROR "Don't know how to load ~A" MODULE-NAME)
0] (quit)
dsm@localhost:~$
But sbcl works perfectly:
dsm@localhost:~$ sbcl -q
This is SBCL 1.0.11.debian, an implementation of ANSI Common Lisp.
More information about SBCL is available at <http://www.sbcl.org/>.
SBCL is free software, provided as is, with absolutely no warranty.
It is mostly in the public domain; some portions are provided under
BSD-style licenses. See the CREDITS and COPYING files in the
distribution for more information.
* (require :asdf-install)
; loading system definition from
; /usr/lib/sbcl/sb-bsd-sockets/sb-bsd-sockets.asd into #<PACKAGE "ASDF0">
; registering #<SYSTEM SB-BSD-SOCKETS {AB01A89}> as SB-BSD-SOCKETS
; registering #<SYSTEM SB-BSD-SOCKETS-TESTS {AC67181}> as SB-BSD-SOCKETS-TESTS
("SB-BSD-SOCKETS" "ASDF-INSTALL")
* (quit)
Any ideas on how to fix this? I found [this post][2] on the internet, but using that didn't work either.
[1]: http://stackoverflow.com/questions/108081/are-there-any-high-level-easy-to-install-gui-libraries-for-common-lisp
[2]: https://bugs.launchpad.net/ubuntu/+source/common-lisp-controller/+bug/37208 | 0 | [
2,
184,
107,
31,
275,
13,
5,
99,
3003,
99,
13,
45,
8573,
1303,
6,
19,
19391,
3401,
131,
287,
12968,
2473,
9764,
60,
800,
3726,
3726,
31,
589,
749,
20,
13,
15599,
14,
1623,
636,
26735,
43,
235,
500,
2558,
165,
500,
15,
17,
589,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 verbose should validation output be?
===
I have an application that reads a database and outputs alerts to any dependencies that are not being met. My thinking on this issue is "Give the minimum information that points the user to the issue." I have been told by a co-worker that I should be as verbose as possible, printing out the values of the database fields for each field I mention verses giving the minimum message that "field one needs to be less then field two".
I know that there must be some convention or standard for this issue as it reminds me of compiler errors and warnings. Does anyone know how a compiler messages are are chosen?
What suggestion does the community have for this issue? | 0 | [
2,
184,
9504,
6641,
378,
27999,
5196,
44,
60,
800,
3726,
3726,
31,
57,
40,
3010,
30,
11137,
21,
6018,
17,
5196,
18,
7863,
18,
20,
186,
29411,
30,
50,
52,
142,
798,
9,
51,
1440,
27,
48,
1513,
25,
13,
7,
8448,
14,
5187,
676,
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... |
Using Side-by-Side assemblies to load the x64 or x32 version of a DLL
===
We have two versions of a managed C++ assembly, one for x86 and one for x64. This assembly is called by a .net application complied for AnyCPU. We are deploying our code via a file copy install, and would like to continue to do so.
Is it possible to use a Side-by-Side assembly manifest to loading a x86 or x64 assembly respectively when an application is dynamically selecting it's processor architecture? Or is there another way to get this done in a file copy deployment (e.g. not using the GAC)?
| 0 | [
2,
568,
270,
8,
779,
8,
1416,
21066,
20,
6305,
14,
993,
3470,
54,
993,
3125,
615,
16,
21,
13,
43,
211,
800,
3726,
3726,
95,
57,
81,
3281,
16,
21,
1471,
272,
20512,
1475,
15,
53,
26,
993,
3274,
17,
53,
26,
993,
3470,
9,
48,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 important is early exposure to computers for a SW developer?
===
looking at the question about "What was your first computer?" I realized that most of us have a very long history of computer usage long before formal training set in (academic or vocational). This reminds me of tennis professionals who often have a history of playing tennis from very early on in their life.
So my question to you is: How much does early exposure to computers help a software developer in his adult professional life? Is it something that sets us apart from those that have been introduced to computers later? Do you think the children these days have a comparable "career path" ahead of them now that computers don't have to be programmed like the good old C64 or Amiga?
Greetings from Germany,
Thorsten
| 0 | [
2,
184,
681,
25,
274,
6587,
20,
7774,
26,
21,
8783,
10058,
60,
800,
3726,
3726,
699,
35,
14,
1301,
88,
13,
7,
608,
23,
154,
64,
1428,
60,
7,
31,
1896,
30,
127,
16,
182,
57,
21,
253,
175,
447,
16,
1428,
7514,
175,
115,
3337,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 simulate memory allocation errors
===
My C application uses 3rd libraries, which do their own memory management.
In order to be robust, my application has code to deal with failures of library functions due to lack of free memory.
I would like to test this code, and for this, I need to simulate failures due to lack of memory.
What tool/s are recommended for this?
My environment is Linux/gcc. | 0 | [
2,
184,
20,
24969,
1912,
16840,
11908,
800,
3726,
3726,
51,
272,
3010,
2027,
203,
897,
8649,
15,
56,
107,
66,
258,
1912,
1097,
9,
19,
389,
20,
44,
15313,
15,
51,
3010,
63,
1797,
20,
1183,
29,
2990,
18,
16,
1248,
3719,
397,
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... |
Best algorithm to count the number of set bits in a 32-bit integer?
===
int NumOfSetBits(int i);
Assert.AreEqual(0, NumOfSetBits(0));
Assert.AreEqual(1, NumOfSetBits(1));
Assert.AreEqual(1, NumOfSetBits(2));
Assert.AreEqual(2, NumOfSetBits(3)); | 0 | [
2,
246,
9083,
20,
2468,
14,
234,
16,
309,
10181,
19,
21,
2512,
8,
3326,
13820,
60,
800,
3726,
3726,
19,
38,
13,
6336,
1041,
3554,
3326,
18,
5,
6391,
31,
6,
73,
10908,
9,
1509,
62,
14512,
5,
387,
15,
13,
6336,
1041,
3554,
3326,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Wich is the best wat yo paginate results in php
===
I need to display many pages of news in a site.<br>
Should i do the pagination in the db query using limit or do it in my php script after getting all the results? | 0 | [
2,
13,
13583,
25,
14,
246,
15553,
3727,
19006,
17939,
1736,
19,
13,
26120,
800,
3726,
3726,
31,
376,
20,
3042,
151,
4434,
16,
996,
19,
21,
689,
9,
1,
5145,
1,
378,
31,
107,
14,
19006,
108,
857,
19,
14,
13,
9007,
25597,
568,
44... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0... |
How to get FGLRX on Fedora while Livna migrates to RPMFusion?
===
So it appears that Livna isn't releasing any drivers for 2.6.26+.* while they become part of RPMFusion, which is now an issue as I can't seem to get previous versions of the kernel after Fedora changed their signing keys - specifically 2.6.25.14-69 which yum tries to bump me up to:
[root@twoodles ~]# yum install kmod-fglrx-2.6.25.6-27*
Setting up Install Process
Parsing package install arguments
Resolving Dependencies
--> Running transaction check
---> Package kmod-fglrx-2.6.25.6-27.fc8.x86_64 0:8.501-2.8.06.lvn8 set to be updated
--> Processing Dependency: fglrx-kmod-common >= 8.501 for package: kmod-fglrx-2.6.25.6-27.fc8
--> Processing Dependency: kmod-fglrx >= 8.501-2.8.06.lvn8 for package: kmod-fglrx-2.6.25.6-27.fc8
--> Running transaction check
---> Package xorg-x11-drv-fglrx.x86_64 0:8.522-2.8.08.lvn8 set to be updated
--> Processing Dependency: xorg-x11-drv-fglrx-libs = 8.522-2.8.08.lvn8 for package: xorg-x11-drv-fglrx
--> Processing Dependency: /usr/lib64/fglrx/libGL.so.1.2 for package: xorg-x11-drv-fglrx
Importing additional filelist information
--> Processing Dependency: libfglrx_gamma.so.1()(64bit) for package: xorg-x11-drv-fglrx
---> Package kmod-fglrx.x86_64 0:8.522-2.8.08.lvn8 set to be updated
--> Processing Dependency: kmod-fglrx-2.6.25.14-69.fc8 = 8.522-2.8.08.lvn8 for package: kmod-fglrx
--> Running transaction check
---> Package xorg-x11-drv-fglrx-libs.x86_64 0:8.522-2.8.08.lvn8 set to be updated
---> Package kmod-fglrx-2.6.25.14-69.fc8.x86_64 0:8.522-2.8.08.lvn8 set to be updated
--> Processing Dependency: kernel-x86_64 = 2.6.25.14-69.fc8 for package: kmod-fglrx-2.6.25.14-69.fc8
--> Finished Dependency Resolution
kmod-fglrx-2.6.25.14-69.fc8-8.522-2.8.08.lvn8.x86_64 from livna has depsolving problems
--> Missing Dependency: kernel-x86_64 = 2.6.25.14-69.fc8 is needed by package kmod-fglrx-2.6.25.14-69.fc8-8.522-2.8.08.lvn8.x86_64 (livna)
Error: Missing Dependency: kernel-x86_64 = 2.6.25.14-69.fc8 is needed by package kmod-fglrx-2.6.25.14-69.fc8-8.522-2.8.08.lvn8.x86_64 (livna)
I'd like a yum-friendly answer if possible, as I'd like to avoid compiling my own kernel or running the ATI supplied binary blob as not to run into further dependency issues down the line. Has anyone come across this, and found a solution?
| 2 | [
2,
184,
20,
164,
398,
8430,
21141,
27,
26726,
58,
133,
8828,
325,
22985,
18,
20,
12936,
9818,
60,
800,
3726,
3726,
86,
32,
1780,
30,
8828,
325,
2532,
22,
38,
8054,
186,
5783,
26,
172,
9,
379,
9,
2409,
2430,
9,
2483,
133,
59,
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... |
ASP.NET MVC: Making routes IIS6 and IIS7-friendly
===
I have an ASP.NET MVC-application which I want deployable on both IIS6 and IIS7 and as we all know, IIS6 needs the ".mvc"-naming in the URL.
Will this code work to make sure it works on all IIS-versions? Without having to make special adjustments in code, global.asax or config-files for the different IIS-versions.
bool usingIntegratedPipeline = HttpRuntime.UsingIntegratedPipeline;
routes.MapRoute(
"Default",
usingIntegratedPipeline ?
"{controller}/{action}/{id}" : "{controller}.mvc/{action}/{id}",
new { controller = "Home", action = "Index", id = "" }
);
| 0 | [
2,
28,
306,
9,
2328,
307,
8990,
45,
544,
5050,
595,
18,
379,
17,
595,
18,
465,
8,
15950,
800,
3726,
3726,
31,
57,
40,
28,
306,
9,
2328,
307,
8990,
8,
2552,
20669,
56,
31,
259,
17617,
579,
27,
156,
595,
18,
379,
17,
595,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Countdown timer on ASP.NET page
===
Could you recommend me a way to place a coundown timer on ASP.NET page?
Now I use this code:
**Default.aspx**
<asp:ScriptManager ID="ScriptManager1" runat="server">
</asp:ScriptManager>
<asp:UpdatePanel ID="UpdatePanel1" runat="server">
<ContentTemplate>
<asp:Label ID="Label1" runat="server">60</asp:Label>
<asp:Timer ID="Timer1" runat="server" Interval="1000"
ontick="Timer1_Tick">
</asp:Timer>
</ContentTemplate>
</asp:UpdatePanel>
**Default.aspx.cs**
protected void Timer1_Tick(object sender, EventArgs e)
{
int seconds = int.Parse(Label1.Text);
if (seconds > 0)
Label1.Text = (seconds - 1).ToString();
else
Timer1.Enabled = false;
}
But it is traffic expensive. I would prefer pure client-side method. Is it possible in ASP.NET? | 0 | [
2,
22566,
85,
139,
27,
28,
306,
9,
2328,
2478,
800,
3726,
3726,
110,
42,
12360,
55,
21,
161,
20,
209,
21,
326,
1020,
2968,
85,
139,
27,
28,
306,
9,
2328,
2478,
60,
130,
31,
275,
48,
1797,
45,
13,
1409,
13862,
9708,
9,
472,
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... |
Using FlashVars with ActionScript 3.0
===
I found this guide for using the flash parameters, thought it might be useful to post here, since Flash CS3 lacks a usage example for reading these parameters.
See answers for the link | 0 | [
2,
568,
4433,
3311,
18,
29,
1028,
8741,
203,
9,
387,
800,
3726,
3726,
31,
216,
48,
3378,
26,
568,
14,
4433,
12905,
15,
289,
32,
530,
44,
4811,
20,
678,
235,
15,
179,
4433,
272,
18,
240,
1792,
18,
21,
7514,
823,
26,
1876,
158,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is there a .NET OS abstraction layer to make OS calls work cross-platform?
===
I really want to write .NET apps that run on any platform (PC, Linux and Mac). I am not really concerned about UI capabilities because these are mostly background services. I have heard of MONO and that it allows you to write .NET apps that run on Mac and Linux, but I want to be able to write a single app that when compiled for Windows will run as a Service, and when compiled for Linux will run as whatever the UNIX equivalent is. I also would like to be able to store things in the registry and have that work. Is there any way to write truly OS agnostic code like this? ...and DON'T say I should make it run on the web! :) | 0 | [
2,
25,
80,
21,
13,
9,
2328,
13,
759,
23907,
5385,
20,
233,
13,
759,
3029,
170,
919,
8,
27035,
60,
800,
3726,
3726,
31,
510,
259,
20,
2757,
13,
9,
2328,
4865,
18,
30,
485,
27,
186,
2452,
13,
5,
5779,
15,
13024,
17,
1572,
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... |
Testing all classes which implement an interface in Java
===
Is there anything out there (for Java specifically) that allow you to automatically test the behavior of an interface? As an example, let's say I have a bunch of tests for the Comparable interface, that should apply to anything that implements Comparable. What I'd like is to be able to include "ComparableTests" automatically in the test fixtures for any of my classes which implement Comparable. Bonus points if this would work with generic interfaces.
I know the .NET framework [mbUnit](http://weblogs.asp.net/astopford/archive/2008/08/25/mbunit-typefixture.aspx) has something similar, and when you're using something like TestNG's generator functions you could set up a test fixture for Comparable and have the generator create an instance of each of your classes that implement Comparable. But I'd rather have it be automatic, and located at the test fixture for each of my classes (since I'll already have them around for testing other parts of that class). | 0 | [
2,
4431,
65,
2684,
56,
8713,
40,
6573,
19,
8247,
800,
3726,
3726,
25,
80,
602,
70,
80,
13,
5,
1106,
8247,
3524,
6,
30,
1655,
42,
20,
7499,
1289,
14,
3257,
16,
40,
6573,
60,
28,
40,
823,
15,
408,
22,
18,
395,
31,
57,
21,
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... |
Anyone have experience using WCF to expose a SOAP interface for non .NET clients?
===
Anyone have experience using WCF to expose a SOAP interface for non .NET clients? | 0 | [
2,
1276,
57,
1496,
568,
11801,
410,
20,
13833,
21,
6447,
6573,
26,
538,
13,
9,
2328,
7421,
60,
800,
3726,
3726,
1276,
57,
1496,
568,
11801,
410,
20,
13833,
21,
6447,
6573,
26,
538,
13,
9,
2328,
7421,
60,
3,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Stop setInterval call in javascript
===
I am using `setInterval(fname, 10000);` to call a function every 10 secs in javascript. Is it possible to stop calling the calling on some event?
I want the user to be able to stop the repeated refresh of data. | 0 | [
2,
747,
309,
6280,
3377,
645,
19,
8247,
8741,
800,
3726,
3726,
31,
589,
568,
13,
1,
3554,
6280,
3377,
5,
410,
7259,
15,
332,
3993,
6,
73,
1,
20,
645,
21,
1990,
352,
332,
9265,
18,
19,
8247,
8741,
9,
25,
32,
938,
20,
747,
255... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Python - Get Class Variables
===
Is there a built-in method in Python to get an array of all a class' class variables? For example, if I have this code:
class hi:
def __init__(self):
self.ii = "foo"
self.kk = "bar"
Is there a way for me to do this:
>>> mystery_method(hi)
["ii", "kk"]
Thanks guys! | 0 | [
2,
20059,
13,
8,
164,
718,
12157,
800,
3726,
3726,
25,
80,
21,
392,
8,
108,
2109,
19,
20059,
20,
164,
40,
7718,
16,
65,
21,
718,
22,
718,
12157,
60,
26,
823,
15,
100,
31,
57,
48,
1797,
45,
718,
4148,
45,
6312,
13,
1,
108,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Run external process from perl, capture stderr, stdout AND the process exit code
===
Is it possible to run an external process from perl, capture stderr, stdout AND the process exit code?
I seem to be able to do combinations of these, e.g. use backticks to get stdout, IPC::Open3 to capture outputs, and system() to get exit codes.
How do you capture stderr, stdout, and the exit code all at once? | 0 | [
2,
485,
4886,
953,
37,
416,
255,
15,
3683,
354,
1157,
139,
15,
354,
43,
1320,
17,
14,
953,
4350,
1797,
800,
3726,
3726,
25,
32,
938,
20,
485,
40,
4886,
953,
37,
416,
255,
15,
3683,
354,
1157,
139,
15,
354,
43,
1320,
17,
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... |
Dinamically created operators
===
I created a program using dev-cpp and wxwidgets wich solves a puzzle.<br>
The user must fill the operations blocks and the results blocks, and the program will solve it.<br>
Im solving it using bruteforce, i generate all non repeated 9 lenght number combinations using a recursive algorithm. It does it pretty fast.<br>
Up to here all is great!<br>
But the problem is when my program operates depending the character on the blocks. Its extremely slow (it never gets the answer), because of the chars comparation against +, -, *, etc. Im doing a CASE.<br>
Is there some way or some programming language wich allows dinamic creation of operators? So i can define the operator ROW1COL2 to be a +, and the same way to all other operations.<br>
I leave a screenshot of the app, so its easier to understand how the puzzle works.<br>
http://www.imageshare.web.id/images/9gg5cev8vyokp8rhlot9.png<br>
<a href="http://www.imageshare.web.id/"><img src="http://www.imageshare.web.id/images/9gg5cev8vyokp8rhlot9.png" border="0" alt="Online Free Image Share Hosting" /></a>
<br><br>PD: The algorithm works, i tryed it with a trivial puzzle, and solved it in a second. | 0 | [
2,
926,
6865,
8438,
679,
9475,
800,
3726,
3726,
31,
679,
21,
625,
568,
9664,
8,
150,
3421,
17,
619,
396,
3976,
43,
3060,
18,
13,
13583,
8402,
18,
21,
9164,
9,
1,
5145,
1,
14,
4155,
491,
3509,
14,
1311,
5198,
17,
14,
1736,
5198... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 change the style of a div programatically
===
How do I change the style (color) of a div such as the following?
"<div id=foo class="ed" style="display: <%= ((foo.isTrue) ? string.Empty : "none") %>">
<%= ((foo.isTrue) ? foo.Name: "false foo") %>"`
| 0 | [
2,
184,
107,
42,
753,
14,
1034,
16,
21,
13,
12916,
625,
721,
8438,
800,
3726,
3726,
184,
107,
31,
753,
14,
1034,
13,
5,
11282,
6,
16,
21,
13,
12916,
145,
28,
14,
249,
60,
13,
7,
1,
12916,
4924,
3726,
4120,
111,
718,
3726,
7,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you manage a large product backlog?
===
We have a large backlog of things we should do in our software, in a lot of different categories, for example:
- New problem areas for our products to solve
- New functionality supporting existing problem areas
- New functionality requested by our existing users
- Usability and "look" enhancements
- Architectural upgrades to the back-end
- Bug fixes
Managing all of these in a sensible fashion is a job that falls to Product Management, but it is tricky for a lot of reasons. Firstly, we have a number of different systems that hold the different things (market requirements document in files, bugs in a bug database, customer requirements in our help desk system, enginering's wish-list on our intranet, etc). And secondly, many of the items are of wildly different size, scope, complexity and of course value, which means that choosing isn't as simple as just ordering a list by priority.
Because we now are fairly large, have a complex product and lots of customers, the basic solutions (a spreadsheet, a google doc, a basecamp to-do list) just isn't sufficient to deal with this. We need a way to group things together in various ways, prioritise them on an ongoing basis, make it clear what we're doing and what is coming - without it requiring all of someone's time to just manage some tool.
How do you manage this in a way that allows the business to always do what is most valuable to existing customers, helps get new ones, and keeps the software innards sane?
Note that this is different from the development-side, which I think we have down pretty well. We develop everything in an iterative, agile fashion, and once something has been chosen for design and implementation, we can do that. It's the part where we need to figure out what to do next that's hardest !
Have you found a method or a tool that works? If so, please share! | 0 | [
2,
184,
107,
42,
4705,
21,
370,
2374,
97,
5567,
60,
800,
3726,
3726,
95,
57,
21,
370,
97,
5567,
16,
564,
95,
378,
107,
19,
318,
2306,
15,
19,
21,
865,
16,
421,
6422,
15,
26,
823,
45,
13,
8,
78,
1448,
924,
26,
318,
1985,
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... |
What is the best way to handle overly agreesive reviewers during a code review?
===
Everyone that has ever had to perform any form of code review has probably been here. Your a member of a code review team, and during the code review you come to an issue where a member of the team is overly aggressive about their viewpoint of a solution, whether it is right or wrong. How would you handle such a situation, especially if the solution presented *is* wrong? | 4 | [
2,
98,
25,
14,
246,
161,
20,
3053,
18234,
11043,
1284,
18864,
112,
21,
1797,
1487,
60,
800,
3726,
3726,
1266,
30,
63,
462,
41,
20,
2985,
186,
505,
16,
1797,
1487,
63,
910,
74,
235,
9,
154,
21,
322,
16,
21,
1797,
1487,
173,
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... |
.NET Reporting Tutorial
===
Does anyone know a Turorial for the Reporting in c# .NET.
I mean not the Crystal Reports.
Thanks in Advance | 0 | [
2,
13,
9,
2328,
6670,
29724,
800,
3726,
3726,
630,
1276,
143,
21,
6205,
248,
2815,
26,
14,
6670,
19,
272,
5910,
13,
9,
2328,
9,
31,
884,
52,
14,
4282,
2813,
9,
3669,
19,
3612,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Strict vs NonStrict NHibernate cache concurrency strategies
===
This question is about the difference between ReadWrite and NonStrictReadWrite cache concurrency strategies for NHibernate's second level cache.
As I understand it, the difference between these two strategies is relevant when you have a distributed *replicated* cache - nonstrict won't guarantee that one cache has the exact same value as another cache, while strict read/write should - assuming the cache provider does the appropriate distributed locking.
The part I don't understand is how the strict vs nonstrict distinction is relevant when you have a single cache, or a distributed *partitioned* (non replicated) cache. Can it be relevant? It seems to me that in non replicated scenarios, the timestamps cache will ensure that stale results are not served. If it can be relevant, I would like to see an example.
| 0 | [
2,
8170,
4611,
538,
27245,
12109,
15191,
8820,
16522,
25547,
10272,
800,
3726,
3726,
48,
1301,
25,
88,
14,
2841,
128,
1302,
23716,
17,
538,
27245,
10647,
23716,
16522,
25547,
10272,
26,
12109,
15191,
8820,
22,
18,
153,
662,
16522,
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... |
Bypass invalid SSL certificate errors when calling web services in .Net
===
We are setting up a new SharePoint for which we don't have a valid SSL certificate yet. I would like to call the Lists web service on it to retrieve some meta data about the setup. However, when I try to do this, I get the exception:
> The underlying connection was closed: Could not establish trust relationship for the SSL/TLS secure channel.
The nested exception contains the error message:
> The remote certificate is invalid according to the validation procedure.
This is correct since we are using a temporary certificate.
My question is: how can I tell the .Net web service client (*SoapHttpClientProtocol*) to ignore these errors? | 0 | [
2,
8900,
16671,
13,
18,
18,
255,
6259,
11908,
76,
2555,
2741,
687,
19,
13,
9,
2328,
800,
3726,
3726,
95,
50,
2697,
71,
21,
78,
1891,
3132,
26,
56,
95,
221,
22,
38,
57,
21,
7394,
13,
18,
18,
255,
6259,
768,
9,
31,
83,
101,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Php Is a directory writable
===
Does anyone know a good way to check to see if a directory is writable?
The function 'is_writable' doesn't work for folders. | 0 | [
2,
13,
26120,
25,
21,
16755,
20127,
579,
800,
3726,
3726,
630,
1276,
143,
21,
254,
161,
20,
2631,
20,
196,
100,
21,
16755,
25,
20127,
579,
60,
14,
1990,
13,
22,
403,
1,
7127,
242,
579,
22,
1437,
22,
38,
170,
26,
19294,
18,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Deploying a site from VSS
===
In answer to [this question](http://stackoverflow.com/questions/102833/how-do-i-use-aspnet-with-visual-studio-2008) Joel Coehoorn said
>Finally, only after the site's gone through a suitable QA process, the production server is updated from source control, not from within visual studio.
Does VSS Explorer have tools for deploying sites (via FTP, I would assume)? I noticed for the first time a Web/Deploy menu option, but it's grayed out. How does this work? | 0 | [
2,
17617,
68,
21,
689,
37,
4611,
18,
800,
3726,
3726,
19,
1623,
20,
636,
1565,
1301,
500,
5,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
1036,
24867,
9280,
1544,
8,
537,
8,
49,
8,
3699,
8,
472,
306,
2328,
8,
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... |
PHP GD, imagecreatefromstring( ); how to get the image dimensions?
===
Normally I used imagecreatefromjpeg and then getimagesize(), but with firefox 3 I need to go round this different. So now im using imagecreatefromstring( ), but how do I retreive the images dimesions now ? | 0 | [
2,
13,
26120,
489,
43,
15,
1961,
6037,
1373,
2665,
11130,
5,
13,
6,
73,
184,
20,
164,
14,
1961,
9913,
60,
800,
3726,
3726,
4147,
31,
147,
1961,
6037,
1373,
2665,
728,
20427,
17,
94,
164,
22039,
10454,
5,
6,
15,
47,
29,
535,
18... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What bad habits did you learn from your first language?
===
I suspect that many of us didn't initially learn programming from a class, but picked it up on our own. What are some bad habits you picked up from your first language? | 0 | [
2,
98,
896,
16760,
144,
42,
2484,
37,
154,
64,
816,
60,
800,
3726,
3726,
31,
7551,
30,
151,
16,
182,
223,
22,
38,
1537,
2484,
3143,
37,
21,
718,
15,
47,
2114,
32,
71,
27,
318,
258,
9,
98,
50,
109,
896,
16760,
42,
2114,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is the best online book service for software development references?
===
I'm a member of ACM, and I have limited access to both Books 24x7 and Safari Books Online, however if I was interested in moving up to a full account for greater access to other books what online book service would you recommend? | 4 | [
2,
98,
25,
14,
246,
2087,
360,
365,
26,
2306,
522,
7231,
60,
800,
3726,
3726,
31,
22,
79,
21,
322,
16,
21,
9095,
15,
17,
31,
57,
1317,
1381,
20,
156,
964,
937,
396,
465,
17,
25055,
964,
2087,
15,
207,
100,
31,
23,
3158,
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... |
What is the best way to paginate results in MS SQLServer
===
What is the best way (performance wise) to paginate results in SQL Server 2000, 2005, 2008 if you also want to get the total number of results (before paginating)? | 0 | [
2,
98,
25,
14,
246,
161,
20,
19006,
17939,
1736,
19,
4235,
4444,
255,
10321,
106,
800,
3726,
3726,
98,
25,
14,
246,
161,
13,
5,
22528,
6714,
6,
20,
19006,
17939,
1736,
19,
4444,
255,
8128,
824,
15,
812,
15,
570,
100,
42,
67,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0... |
Why isn't there a standard memswap function.
===
Why doesn't have the c standard a memswap function, which would probably look like:
int memswap(void *ptr1, void *ptr2, size_t nbytes)?
I know it'd be easy to write, but i think the libc could do some awesome tricks to speed it up like some implementations do it for memcpy. | 0 | [
2,
483,
2532,
22,
38,
80,
21,
1236,
55,
79,
18,
1608,
306,
1990,
9,
800,
3726,
3726,
483,
1437,
22,
38,
57,
14,
272,
1236,
21,
55,
79,
18,
1608,
306,
1990,
15,
56,
83,
910,
361,
101,
45,
19,
38,
55,
79,
18,
1608,
306,
5,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.