unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
What is a good PHP library to handle file uploads?
===
I am looking to use a PHP library for uploading pictures to a web server so that I can use something that has been tested and hopefully not have to design one myself. Does anyone know of such a library? | 0 | [
2,
98,
25,
21,
254,
13,
26120,
1248,
20,
3053,
3893,
71,
8294,
18,
60,
800,
3726,
3726,
31,
589,
699,
20,
275,
21,
13,
26120,
1248,
26,
71,
16866,
3104,
20,
21,
2741,
8128,
86,
30,
31,
92,
275,
301,
30,
63,
74,
7631,
17,
134... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What tools do you use for Automated Builds / Automated Deployments? Why?
===
What tools do you use for Automated Builds / Automated Deployments? Why?
What tools do you recommend? | 4 | [
2,
98,
4672,
107,
42,
275,
26,
14904,
1895,
18,
13,
118,
14904,
10475,
18,
60,
483,
60,
800,
3726,
3726,
98,
4672,
107,
42,
275,
26,
14904,
1895,
18,
13,
118,
14904,
10475,
18,
60,
483,
60,
98,
4672,
107,
42,
12360,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Point-Triangle Collision Detection in 3D
===
How do I correct for floating point error in the following physical simulation:
- Original point (x, y, z),
- Desired point (x', y', z') after forces are applied.
- Two triangles (A, B, C) and (B, C, D), who share edge BC
I am using this method for collision detection:
For each Triangle
If the original point is in front of the current triangle, and the desired point is behind the desired triangle:
Calculate the intersection point of the ray (original-desired) and the plane (triangle's normal).
If the intersection point is inside the triangle edges (!)
Respond to the collision.
End If
End If
Next Triangle
The problem I am having is that sometimes the point falls into the grey area of floating point math where it is so close to the line BC that it fails to collide with either triangle, even though technically it should always collide with one or the other since they share an edge. When this happens the point passes right between the two edge sharing triangles. I have marked one line of the code with **(!)** because I believe that's where I should be making a change.
One idea that works in very limited situations is to skip the edge testing. Effectively turning the triangles into planes. This only works when my meshes are convex hulls, but I plan to create convex shapes.
I am specifically using the dot product and triangle normals for all of my front-back testing. | 0 | [
2,
454,
8,
3367,
15427,
11319,
11643,
19,
203,
43,
800,
3726,
3726,
184,
107,
31,
4456,
26,
8319,
454,
7019,
19,
14,
249,
1825,
10926,
45,
13,
8,
501,
454,
13,
5,
396,
15,
13,
93,
15,
2052,
6,
15,
13,
8,
9264,
454,
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 can I grab single key hit in D Programming Language + Tango?
===
I read this [article][1] and try to do the exercise in D Programming Language, but encounter a problem in the first exercise.
> (1) Display series of numbers
> (1,2,3,4, 5....etc) in an infinite
> loop. The program should quit if
> someone hits a specific key (Say
> ESCAPE key).
Of course the infinite loop is not a big problem, but the rest is. How could I grab a key hit in D/Tango? In tango FAQ it says use C function kbhit() or get(), but as I know, these are not in C standard library, and does not exist in glibc which come with my Linux machine which I use to programming.
I know I can use some 3rd party library like [ncurses][2], but it has same problem just like kbhit() or get(), it is not standard library in C or D and not pre-installed on Windows. What I hope is that I could done this exercise use just D/Tango and could run it on both Linux and Windows machine.
How could I do it?
[1]: http://smartprogrammer.blogspot.com/2006/04/15-exercises-for-learning-new.html
[2]: http://www.gnu.org/software/ncurses/ | 0 | [
2,
184,
92,
31,
4931,
345,
1246,
770,
19,
13,
43,
3143,
816,
2754,
19434,
60,
800,
3726,
3726,
31,
1302,
48,
636,
20360,
500,
2558,
165,
500,
17,
1131,
20,
107,
14,
5935,
19,
13,
43,
3143,
816,
15,
47,
7007,
21,
1448,
19,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Has anybody compared WCF and ZeroC ICE?
===
ZeroC's ICE (www.zeroc.com) looks interesting and I am interested in looking at it and comparing it to our existing software that uses WCF. In particular, our WCF app uses server callbacks (via HTTP).
Anybody who's compared them? How did it go? I'm particularly interested in the performance aspect, since interoperability isn't much of a concern for us right now. Thanks! | 0 | [
2,
63,
11181,
2428,
11801,
410,
17,
4606,
150,
1392,
60,
800,
3726,
3726,
4606,
150,
22,
18,
1392,
13,
5,
6483,
9,
15938,
150,
9,
960,
6,
1879,
4883,
17,
31,
589,
3158,
19,
699,
35,
32,
17,
15047,
32,
20,
318,
3149,
2306,
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... |
Where do "pure virtual function call" crashes come from?
===
I sometimes notice programs that crash on my computer with the error: "pure virtual function call".
How do these programs even compile when an object cannot be created of an abstract class? | 0 | [
2,
113,
107,
13,
7,
21059,
6599,
1990,
645,
7,
21563,
340,
37,
60,
800,
3726,
3726,
31,
1030,
3551,
1726,
30,
4597,
27,
51,
1428,
29,
14,
7019,
45,
13,
7,
21059,
6599,
1990,
645,
7,
9,
184,
107,
158,
1726,
166,
26561,
76,
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,
0,
0,
0,
0,
0,
0,
0,
0... |
Can you Distribute a Ruby on Rails Application without Source?
===
I'm wondering if it's possible to distribute a RoR app for production use without source code? I've seen [this post on SO][1], but my situation is a little different. This would be an app administered by people with some clue, so I'm cool with still requiring an Apache/Mongrel/MySQL setup on the customer end. All I really want is for the source to be protected. Encoding seems a popular way to go for distributing PHP apps (eg: [Helpspot][2]).
I've found these potential solutions:
- [Zenobfuscate][3] - not all types of Ruby code is supported however, so that counts that out
- [Ruby Encoder][4] - may be the best option, as their PHP encoder looks alright (I haven't tried it however) but it's not available yet. I've used IONcube for PHP before and it worked well, but [it doesn't seem that IONcube is interested yet][5].
- [Slingshot][6] - it was mentioned in the other SO post, but it solves a different problem to mine and the source is still visible.
- [RubyScript2Exe][7] - from the doco, it's not production ready, so that counts that out.
I've heard that potentially using JRuby and distributing bytecode might be a way to achieve this, but I've never used JRuby so I'm not sure what's involved.
Can anyone offer any ideas and/or known examples? Ideally I'd love to have some kind of automated build scenario as well.
[1]: http://stackoverflow.com/questions/55711/options-for-distribution-of-an-offline-ruby-on-rails-application
[2]: http://www.userscape.com/
[3]: http://blog.zenspider.com/zenobfuscate/
[4]: http://www.rubyencoder.com/
[5]: http://forum.ioncube.com/viewtopic.php?t=839
[6]: http://joyent.com/developers/slingshot/
[7]: http://www.erikveen.dds.nl/distributingrubyapplications/rails.html | 0 | [
2,
92,
42,
14751,
21,
10811,
27,
2240,
18,
3010,
366,
1267,
60,
800,
3726,
3726,
31,
22,
79,
5712,
100,
32,
22,
18,
938,
20,
14751,
21,
761,
248,
4865,
26,
637,
275,
366,
1267,
1797,
60,
31,
22,
195,
541,
636,
1565,
678,
27,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does Ajax detoriates performance?
===
I was just wondering if excess use of Ajax affects performance? In context of big size web-applications how to handle ajax request to control asynchronous requests | 0 | [
2,
630,
20624,
121,
15000,
3231,
956,
60,
800,
3726,
3726,
31,
23,
114,
5712,
100,
9521,
275,
16,
20624,
15476,
956,
60,
19,
4141,
16,
580,
1072,
2741,
8,
2552,
20669,
18,
184,
20,
3053,
20624,
3772,
20,
569,
21,
16023,
1291,
1227... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
When is it appropriate to use Time#utc in Rails 2.1?
===
I am working on a Rails application that needs to handle dates and times in users' time zones. We have recently migrated it to Rails 2.1 and added time zone support, but there are numerous situations in which we use Time#utc and then compare against that time. Wouldn't that be the same as comparing against the original Time object?
When is it appropriate to use Time#utc in Rails 2.1? When is it inappropriate? | 0 | [
2,
76,
25,
32,
4593,
20,
275,
85,
5910,
11440,
19,
2240,
18,
172,
9,
165,
60,
800,
3726,
3726,
31,
589,
638,
27,
21,
2240,
18,
3010,
30,
2274,
20,
3053,
4076,
17,
436,
19,
3878,
22,
85,
11225,
9,
95,
57,
1989,
14204,
32,
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's the definitive Java Swing starter guide and referencte
===
Obviously the [Java API][1] reference, but what else is there that you all use?
I've been doing web development my entire career. Lately I've been messing around a lot with [Groovy][2] and I've decided to do a small application in [Griffon][3] just to experiment more with Groovy and also break some ground in desktop development. The only thing is I'm totally green when it comes to desktop apps.
So, world, where's a good place to start?
[1]: http://java.sun.com/j2se/1.5.0/docs/api/
[2]: http://groovy.codehaus.org
[3]: http://groovy.codehaus.org/griffon | 0 | [
2,
98,
22,
18,
14,
15676,
8247,
5587,
11744,
3378,
17,
5017,
219,
22447,
800,
3726,
3726,
4409,
14,
636,
1004,
1385,
21,
2159,
500,
2558,
165,
500,
2801,
15,
47,
98,
962,
25,
80,
30,
42,
65,
275,
60,
31,
22,
195,
74,
845,
2741... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I create a Netflix-style iframe overlay without a huge javascript library?
===
I'm trying to use a link to open an overlay instead of in a separate popup window. This overlay should consist of a semi-transparent div layer that blocks the whole screen from being clicked on. I also aim to disable scrolling at this point. Not matter where you are on the main page, when the link is clicked, the overlay should be in the center of the screen's X and Y origins. Inside of this overlay div, should be an iframe configured such that 3 sizes of content can be loaded. | 0 | [
2,
184,
92,
31,
1600,
21,
23233,
8,
4381,
31,
8361,
84,
4414,
366,
21,
2329,
8247,
8741,
1248,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
275,
21,
3508,
20,
368,
40,
84,
4414,
700,
16,
19,
21,
1725,
1675,
576,
1463,
9,
48,
84... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ResourceManager and Unit Testing
===
I was curious if anyone had any problems creating unit tests around using the ResourceManager. I am using Visual Studio test edition and it appears that the satellite assemblies don't get loaded during the test. When I try to get a resource for another culture, the test always fails and the resource manager always falls back to the default culture. The exact same code runs fine within the normal application. | 0 | [
2,
6577,
22256,
17,
1237,
4431,
800,
3726,
3726,
31,
23,
7686,
100,
1276,
41,
186,
1716,
2936,
1237,
4894,
140,
568,
14,
6577,
22256,
9,
31,
589,
568,
3458,
1120,
1289,
1322,
17,
32,
1780,
30,
14,
4958,
21066,
221,
22,
38,
164,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CSS Reset, default styles for common elements
===
After applying a CSS reset, I want to get back to 'normal' behavior for html elements like: p, h1..h6, strong, ul and li.
Now when I say normal I mean e.g. the p element adds spacing or a carriage return like result when used, or the size of the font and boldness for a h1 tag, along with the spacing.
I realize it is totally up to me how I want to set the style, but I want to get back to normal behavior for some of the more commen elements (at least as a starting point that I can tweak later on). | 0 | [
2,
272,
18,
18,
23422,
15,
12838,
6443,
26,
757,
2065,
800,
3726,
3726,
75,
11989,
21,
272,
18,
18,
23422,
15,
31,
259,
20,
164,
97,
20,
13,
22,
17462,
22,
3257,
26,
13,
15895,
2065,
101,
45,
351,
15,
746,
165,
9,
9,
252,
37... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Scalable socket event queue processing
===
My C# class must be able to process a high volume of events received via a tcp stream style socket connection. The volume of event messages received from the tcp server by the class's socket is completely variable. For instance, sometimes it will only receive one event message in a period of ten seconds and at other times it will receive a sixty event messages within a second.
I am using Socket.ReceiveAsync to receive messages. ReceiveAsync returns true if the receive operation is pending or false if there is already data on the wire and the receive operation completed synchronously. If the operation is pending, the Socket will call my callback on an IO completion thread, otherwise I call my own callback in the current (IOC) thread. Furthermore, mixed in with event messages I also receive responses to commands that were sent to this tcp server. Response messages are processed right away; individually, by firing off a threadpool worker.
However, I would like to queue event messages until I have "enough" (N) of them OR until there are no more on the wire...and then fire off a threadpool worker to process a batch of event messages. Also, I want all events to be processed sequentially so I only want one threadpool worker to be working on this at a time.
The processor of event messages need only copy the message buffer into an object, raise an event and then release the message buffer back into the ring-buffer pool. So my question is...what do you think is the best strategy to accomplish this?
Do you need more info? Let me know. Thanks!! | 0 | [
2,
18957,
579,
18482,
807,
22521,
5511,
800,
3726,
3726,
51,
272,
5910,
718,
491,
44,
777,
20,
953,
21,
183,
2310,
16,
963,
420,
1197,
21,
13,
38,
7439,
3766,
1034,
18482,
2760,
9,
14,
2310,
16,
807,
7561,
420,
37,
14,
13,
38,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Associating a ListView with a collection of objects
===
How can you use a ListView to show the user a collection of objects, and to manage those objects? | 0 | [
2,
28,
18,
16325,
1880,
21,
968,
4725,
29,
21,
1206,
16,
3916,
800,
3726,
3726,
184,
92,
42,
275,
21,
968,
4725,
20,
298,
14,
4155,
21,
1206,
16,
3916,
15,
17,
20,
4705,
273,
3916,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Best way to run unit tests after each commit ? - svn - branch per feature
===
What is the best way to run your suite of unit tests after each commit?
I'm particularly interested in the case that you do all of your features/changes in branches and keep your trunk stable.
My source control is SVN and I use tortoise SVN as my client.
Is there an SVN event or something along those lines that I can call a .cmd/.bat file?
If the answer is cruisecontrol, how do you check all branches with cruise control? | 0 | [
2,
246,
161,
20,
485,
1237,
4894,
75,
206,
9686,
13,
60,
13,
8,
13,
18,
16578,
13,
8,
1686,
416,
1580,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
485,
154,
6160,
16,
1237,
4894,
75,
206,
9686,
60,
31,
22,
79,
1653,
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... |
Why won't Tcl die?
===
I've been forced to code in Tcl a number of times, and just can't wrap my head around this language.
It's not just that it is syntactically different than c-like languages: Lisp is different but genius, prolog is different with a valid cause. Tcl is different because it was a bad idea taken to its fullest possible extension.
"Lets make a language where the operator is on the left, just like a shell. When that runs out of gas we'll extend it a hair by letting you have sub-commands in square brackets. And when people notice that it is odd that there are no binary operators we'll extended it by nailing a different language onto it." (The `expr` syntax is not tcl, it is c-like.)
*Yet it survives*, especially in the embedded space. Perhaps because it has a small footprint. But there must be a dozen languages with a small footprint that are easier to code in. Is there some magic goodness I have just missed?
Here is a small Tcl example to refresh you on Tcl. Notice for instance the need for a `$` before a variable when reading from it but not writing to it. How did every single other language manage to work that out without needing a hint from the programmer!? Recall that it would be a syntax error to omit the space between the `while` and the `{` because the parser itself is written in four lines of Tcl and can't deal with crazy stuff like that. Notice that an idea as simple as `p--` takes a whole 8 tokens.
proc power {base p} {
set result 1
while {$p > 0} {
set result [expr $result * $base]
set p [expr $p - 1]
}
return $result
}
| 4 | [
2,
483,
230,
22,
38,
13,
38,
5316,
1327,
60,
800,
3726,
3726,
31,
22,
195,
74,
1292,
20,
1797,
19,
13,
38,
5316,
21,
234,
16,
436,
15,
17,
114,
92,
22,
38,
8118,
51,
157,
140,
48,
816,
9,
32,
22,
18,
52,
114,
30,
32,
25,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Multi-purpose 3d Artificial Life Engine?
===
Studying emergence, it's quite useful to have a development framework to build upon to quickly test out new ideas. 3d with physics collision would be nice, and open-source would be a big plus. For this purpose 'breve' looks quite promising, but I was wondering if anyone had used it or knows of any other suitable engines? | 0 | [
2,
1889,
8,
12060,
203,
43,
6809,
201,
1406,
60,
800,
3726,
3726,
4493,
16545,
15,
32,
22,
18,
1450,
4811,
20,
57,
21,
522,
6596,
20,
1895,
685,
20,
976,
1289,
70,
78,
3478,
9,
203,
43,
29,
4339,
11319,
83,
44,
2210,
15,
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... |
Which, and why, do you prefer Exceptions or Return codes?
===
My question is what do most developers prefer for error handling, Exceptions or Error Return Codes. Please be language(or language family) specific and why you prefer one over the other.
I'm asking this out of curiosity. Personally I prefer Error Return Codes since they are less explosive and don't force user code to pay the exception performance penalty if they don't want to.
| 0 | [
2,
56,
15,
17,
483,
15,
107,
42,
6369,
13392,
54,
788,
11358,
60,
800,
3726,
3726,
51,
1301,
25,
98,
107,
127,
10168,
6369,
26,
7019,
7988,
15,
13392,
54,
7019,
788,
11358,
9,
2247,
44,
816,
5,
248,
816,
190,
6,
1903,
17,
483,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Message passing between objects - How to refer to the target object?
===
The most basic task in an object oriented environment is executing a method on an object. To do this, you have to have a reference to the object on which you are invoking the method. Is the proper way to establish this reference to pass the object as a parameter to the constructor (or initializer method) of the calling object?
If object <code> foo </code> calls into object <code> bar</code>, is it correct to say (in pseudo-code):
bar = new barClass()
foo = new fooClass(bar)
What happens if you need to pass messages back and forth? Do you need a method for registering the target object?
foo = new fooClass()
bar = new barClass()
foo.register(bar)
bar.register(foo)
Is there a pattern that addresses this? | 0 | [
2,
2802,
2848,
128,
3916,
13,
8,
184,
20,
5017,
20,
14,
2935,
3095,
60,
800,
3726,
3726,
14,
127,
2125,
3005,
19,
40,
3095,
13,
6800,
2307,
25,
25836,
21,
2109,
27,
40,
3095,
9,
20,
107,
48,
15,
42,
57,
20,
57,
21,
2801,
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... |
Why do C# and VB have Generics? What benefit do they provide? Generics, FTW
===
From [Wikipedia][1]:
> Generic programming is a style of
> computer programming in which
> algorithms are written in terms of
> to-be-specified-later types that are
> then instantiated when needed for
> specific types provided as parameters
> and was pioneered by Ada which
> appeared in 1983. This approach
> permits writing common functions or
> types that differ only in the set of
> types on which they operate when used,
> thus reducing duplication.
Generics provide the ability to define types that are specified later. You don't have to cast items to a type to use them because they are already typed.
Why does C# and VB have Generics? What benefit do they provide? What benefits do you find using them?
What other languages also have generics?
[1]: http://en.wikipedia.org/wiki/Generic_programming | 0 | [
2,
483,
107,
272,
5910,
17,
13,
20468,
57,
12733,
18,
60,
98,
4234,
107,
59,
1181,
60,
12733,
18,
15,
1187,
499,
800,
3726,
3726,
37,
636,
17375,
26132,
500,
2558,
165,
500,
45,
13,
1,
12733,
3143,
25,
21,
1034,
16,
13,
1,
142... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Private vs. Public members in practice (how important is encapsulation?)
===
One of the biggest advantages of object-oriented programming is encapsulation, and one of the "truths" we've (or, at least, I've) been taught is that members should always be made private and made available via accessor and mutator methods, thus ensuring the ability to verify and validate the changes.
I'm curious, though, how important this really is in practice. In particular, if you've got a more complicated member (such as a collection), it can be very tempting to just make it public rather than make a bunch of methods to get the collection's keys, add/remove items from the collection, etc.
Do you follow the rule in general? Does your answer change depending on whether it's code written for yourself vs. to be used by others? Are there more subtle reasons I'm missing for this obfuscation? | 0 | [
2,
932,
4611,
9,
317,
443,
19,
1345,
13,
5,
1544,
681,
25,
1957,
4666,
18,
11123,
60,
6,
800,
3726,
3726,
53,
16,
14,
3835,
14683,
16,
3095,
8,
6800,
3143,
25,
1957,
4666,
18,
11123,
15,
17,
53,
16,
14,
13,
7,
23266,
18,
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... |
What's the best way to do a code review with Subversion (SVN)?
===
I want to be able to do a peer code review with Subversion, but what's the easiest way to do this without installing a server application or paying for an online service? | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
107,
21,
1797,
1487,
29,
972,
10898,
13,
5,
18,
16578,
6,
60,
800,
3726,
3726,
31,
259,
20,
44,
777,
20,
107,
21,
7617,
1797,
1487,
29,
972,
10898,
15,
47,
98,
22,
18,
14,
27237,
161,
20,
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,
0,
0... |
Maintaining Automated Browser UI Testing
===
What's the best way to manage a slew of browser UI tests? I'm looking for an approach that may have worked for you in the past when dealing with numerous automated browser tests. Obvious answers such as "they should be refactored into lower-level UI tests" aren't what I'm looking for. Ultimately these tests are incredibly time consuming to both run and maintain. I'm looking for the best ways to minimize this problem.
I must also mention that I'm confined to free software that's particularly focused on .NET (WatiN, CC.net, Fitnesse, etc.). | 0 | [
2,
8215,
14904,
16495,
13,
5661,
4431,
800,
3726,
3726,
98,
22,
18,
14,
246,
161,
20,
4705,
21,
28340,
16,
16495,
13,
5661,
4894,
60,
31,
22,
79,
699,
26,
40,
2141,
30,
123,
57,
577,
26,
42,
19,
14,
640,
76,
5746,
29,
1548,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the difference between, IsAssignableFrom and GetInterface?
===
Using reflection in .Net, what is the differnce between:
if (foo.IsAssignableFrom(IBar))
And
if (foo.GetInterface(typeof(IBar).FullName))
Which is more appropriate, why?<br>
When could one or the other fail? | 0 | [
2,
98,
25,
14,
2841,
128,
15,
25,
472,
11255,
579,
2665,
17,
164,
6280,
6413,
60,
800,
3726,
3726,
568,
9138,
19,
13,
9,
2328,
15,
98,
25,
14,
11394,
6175,
128,
45,
100,
13,
5,
4120,
111,
9,
8164,
18,
11255,
579,
2665,
5,
49... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 do you think Progressive Enhancement is?
===
[Progressive Enhancement][1] is a web development methodology that not only allows greater portability and accessibility but in my opinion, makes the development process easier.
What I want is to know what the rest of the community think of this approach.
In particular: What do you believe is the minimum set of technologies that a web application should support?
[1]: http://en.wikipedia.org/wiki/Progressive_enhancement | 4 | [
2,
184,
681,
107,
42,
277,
5546,
19415,
25,
60,
800,
3726,
3726,
636,
2740,
13026,
1284,
19415,
500,
2558,
165,
500,
25,
21,
2741,
522,
18653,
30,
52,
104,
2965,
1894,
1295,
4091,
17,
25737,
47,
19,
51,
4052,
15,
1364,
14,
522,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 create a directory listing of a subversion repository.
===
I have a client that is asking me to give them a listing of every file and folder in the source code (and then a brief explanation of the source tree). Is there an easy way to create some sort of decently formatted list like this from a subversion repository? | 0 | [
2,
184,
92,
31,
1600,
21,
16755,
9554,
16,
21,
972,
10898,
24869,
9,
800,
3726,
3726,
31,
57,
21,
6819,
30,
25,
3379,
55,
20,
590,
105,
21,
9554,
16,
352,
3893,
17,
19294,
19,
14,
1267,
1797,
13,
5,
290,
94,
21,
2698,
5764,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 JavaScript Repository should I use?
===
Many languages have standard repositories where people donate useful libraries that they want others to have access to. For instance Perl has CPAN, PHP has PEAR, Ruby has RubyGems, and so on. What is the best option for JavaScript?
I ask because a few months ago I ported [Statistics::Distributions][1] from Perl to JavaScript. (When I say ported I mean, "Ran text substitutions, fixed a few things by hand." I did _not_ rewrite it.) Since I've used this module a number of times in Perl, I figure that [statistics-distributions.js][2] is likely to be useful to someone. So I've put it under the same open source license as the original (your choice of the GPL or the Artistic License). But I have no idea where to put it so that people who might want it are likely to find it.
It doesn't fit into any sort of framework. It is just a standalone library that gives you the ability to calculate a number of useful statistics distributions to 5 digits of accuracy. In JavaScript.
[1]: http://search.cpan.org/~mikek/Statistics-Distributions-1.02/Distributions.pm
[2]: http://elem.com/~btilly/effective-ab-testing/statistics-distributions.js | 0 | [
2,
98,
8247,
8741,
24869,
378,
31,
275,
60,
800,
3726,
3726,
151,
2556,
57,
1236,
302,
14882,
262,
2829,
113,
148,
18377,
4811,
8649,
30,
59,
259,
654,
20,
57,
1381,
20,
9,
26,
4851,
416,
255,
63,
272,
3206,
15,
13,
26120,
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... |
Is it safe to add delegates to events with keyword new?
===
One thing I am concerned with is that I discovered two ways of registering delegates to events.
1. OnStuff += this.Handle;
2. OnStuff += new StuffEventHandler(this.Handle);
The first one is clean, and it makes sense doing "OnStuff -= this.Handle;" to unregister from the event... But with the latter case, should I do "OnStuff -= new StuffEventHandler(this.Handle);"? It feels like I am not removing anything at all, since I'm throwing in another StuffEventHandler reference. Does the event compare the delegate by reference? I am concerned I could start a nasty memory pool here. Get me? I don't have the reference to the "new StuffEventHandler" I previously registered.
What is the downside of doing #1?
What is benefit of doing #2? | 0 | [
2,
25,
32,
1834,
20,
3547,
10845,
20,
963,
29,
1246,
9587,
78,
60,
800,
3726,
3726,
53,
584,
31,
589,
3518,
29,
25,
30,
31,
1848,
81,
2847,
16,
2243,
68,
10845,
20,
963,
9,
137,
9,
27,
384,
5386,
2754,
3726,
48,
9,
3203,
413... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Visual Studio color settings for better eye
===
Which Visual Studio color settings is more comfortable to reduce eye strain? Whether dark setting or default (black text on white background) is best for eyes? | 4 | [
2,
3458,
1120,
1665,
12410,
26,
574,
1356,
800,
3726,
3726,
56,
3458,
1120,
1665,
12410,
25,
91,
5733,
20,
4136,
1356,
8302,
60,
1472,
659,
2697,
54,
12838,
13,
5,
5485,
1854,
27,
359,
2395,
6,
25,
246,
26,
194,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What problems do you encounter with VFP apps in a 64 bit environment?
===
I know that there are issues with the VFP OLEDB provider on 64 bit machines. ... but what issues do you encounter while actually running a VFP application - on a 64 bit machine? Has anyone had any experience in this area?
My first thought was that it would just run as a 32bit app, without making use of the 64 bit power. However, I ran into difficulties with a FoxPro application connecting to a SQL Server database (probably an OLEDB issue as well). Are there other issues as well? | 0 | [
2,
98,
1716,
107,
42,
7007,
29,
566,
12087,
4865,
18,
19,
21,
4384,
1142,
2307,
60,
800,
3726,
3726,
31,
143,
30,
80,
50,
1549,
29,
14,
566,
12087,
12116,
9007,
11747,
27,
4384,
1142,
6035,
9,
13,
9,
9,
9,
47,
98,
1549,
107,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When to use Binary Space Partitioning, Quadtree, Octree?
===
I have recently learned about binary space partitioning trees and their application to 3d graphics and collision detection. I have also briefly perused material relating to quadtrees and octrees. When would you use quadtrees over bsp trees, or vice versa? Are they interchangeable? I would be satisfied if I had enough information to fill out a table like this:
| BSP | Quadtree | Octree
------------+----------------+-------
Situation A | X | |
Situation B | | X |
Situation C | | | X
What are A, B, and C? | 0 | [
2,
76,
20,
275,
14171,
726,
10711,
68,
15,
13559,
8101,
15,
9543,
9495,
60,
800,
3726,
3726,
31,
57,
1989,
2691,
88,
14171,
726,
10711,
68,
1913,
17,
66,
3010,
20,
203,
43,
8351,
17,
11319,
11643,
9,
31,
57,
67,
3224,
416,
8795,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Useful Textmate Shortcuts
===
Macs are renowned (or bemoaned) for having an extensive number of shortcuts. However, OS X itself pales in comparison to the shortcut lists in Textmate and its bundles.
What are some useful keyboard shortcuts you use? | 4 | [
2,
4811,
1854,
5281,
502,
4118,
18,
800,
3726,
3726,
1572,
18,
50,
8218,
13,
5,
248,
44,
1293,
210,
69,
6,
26,
452,
40,
3386,
234,
16,
502,
4118,
18,
9,
207,
15,
13,
759,
993,
1145,
2908,
18,
19,
6050,
20,
14,
502,
4118,
722... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Attaching an ID/Label to LINQ to SQL generated code?
===
I'm interested in tracing database calls made by LINQ to SQL back to the .NET code that generated the call. For instance, a DBA might have a concern that a particular cached execution plan is doing poorly. If for example a DBA were to tell a developer to address the following code...
exec sp_executesql N'SELECT [t0].[CustomerID]
FROM [dbo].[Customers] AS [t0]
WHERE [t0].[ContactName] LIKE @p0
ORDER BY [t0].[CompanyName]',
'N'@p0 nvarchar(2)',@p0=N'c%'
...it's not immediately obvious which LINQ statement produced the call. Sure you could search through the "Customers" class in the auto-generated data context, but that'd just be a start. With a large application this could quickly become unmanageable.
Is there a way to attach an ID or label to SQL code generated and executed by LINQ to SQL? Thinking out loud, here's an extension function called "TagWith" that illustrates conceptually what I'm interested in doing.
var customers = from c in context.Customers
where c.CompanyName.StartsWith("c")
orderby c.CompanyName
select c.CustomerID;
foreach (var CustomerID in customers.TagWith("CustomerList4"))
{
Console.WriteLine(CustomerID);
}
If the "CustomerList4" ID/label ends up in the automatically-generated SQL, I'd be set. Thanks. | 0 | [
2,
19514,
68,
40,
4924,
118,
21018,
20,
6294,
1251,
20,
4444,
255,
6756,
1797,
60,
800,
3726,
3726,
31,
22,
79,
3158,
19,
20005,
6018,
3029,
117,
34,
6294,
1251,
20,
4444,
255,
97,
20,
14,
13,
9,
2328,
1797,
30,
6756,
14,
645,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Eclipse text comparison order
===
I'm using Eclipse 3.4 (on Mac) and I've got an annoyance with the text comparison having the files I'm comparing in a specific order which is not what I want.
When I compare two files it always seems to put the first file (alphabetically) on the left, and the latter one on the right, but I want to be able to change this on a comparison by comparison basis.
IE comparing 'file-a' and 'file-b' will always have 'file-a' on the left, but that isn't always what I want. I seem to recall in earlier versions of Eclipse that changing the file that was right-clicked when choosing Compare With -> Each Other changed the order, but that isn't working for me in 3.4.
An example of why I care:
I've just performed a subversion merge and had a conflict, so I now have the following files:
*file
file.merge-left
file.merge-right
file.working*
I've made changes to *file* and now want to compare *file* to *file.merge-right* and *file.working* to *file.merge-left* and split the editors so I can have the working/left changes sitting above the file/right changes, and then just page through the compare editors and make sure the differences between this file and the file that the merge comes from have been preserved, but *file* is on the left while *file.working* is on the right, and hence the differences need to be compared diagonally rather than just comparing top and bottom. | 0 | [
2,
11652,
1854,
6050,
389,
800,
3726,
3726,
31,
22,
79,
568,
11652,
203,
9,
300,
13,
5,
218,
1572,
6,
17,
31,
22,
195,
330,
40,
20106,
29,
14,
1854,
6050,
452,
14,
6488,
31,
22,
79,
15047,
19,
21,
1903,
389,
56,
25,
52,
98,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How many of you prefer full screen?
===
How many of you prefer full screen for your applications?
What are the advantages and disadvantages of doing this? | 4 | [
2,
184,
151,
16,
42,
6369,
503,
2324,
60,
800,
3726,
3726,
184,
151,
16,
42,
6369,
503,
2324,
26,
154,
3767,
60,
98,
50,
14,
14683,
17,
13387,
18,
16,
845,
48,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Standardizing an IT environment
===
What useful tips and solutions do people have for taking an office full of various systems (ranging from ancient XP boxes to modern Vista laptops, and a mac thrown in for good measure) with no central facilities or servers and fixing it up as much as possible to reduce maintainence effors from the IT support?
Having a complete, rigerously enforced Standard Operating Environment would require replacing nearly all systems so a compromise has to be struck somewhere between 100% conformity and the random chaos that they currently have.
How have other admins approached this sort of problem in the past? | 0 | [
2,
1236,
3335,
40,
32,
2307,
800,
3726,
3726,
98,
4811,
11034,
17,
6776,
107,
148,
57,
26,
741,
40,
488,
503,
16,
617,
1242,
13,
5,
24225,
37,
1593,
23045,
8120,
20,
773,
13520,
12294,
18,
15,
17,
21,
1572,
6027,
19,
26,
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,
1... |
Biggest GWT Pitfalls?
===
I'm at the beginning/middle of a project that we chose to implement using GWT. Has anyone encountered any major pitfalls in using GWT (and GWT-EXT) that were unable to be overcome? How about from a performance perspective?
A couple things that we've seen/heard already include:
- Google not being able to index content
- CSS and styling in general seems to be a bit flaky
Looking for any additional feedback on these items as well. Thanks! | 0 | [
2,
3835,
14094,
38,
4175,
5660,
18,
60,
800,
3726,
3726,
31,
22,
79,
35,
14,
997,
118,
17927,
16,
21,
669,
30,
95,
3305,
20,
8713,
568,
14094,
38,
9,
63,
1276,
8208,
186,
394,
4175,
5660,
18,
19,
568,
14094,
38,
13,
5,
290,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a good f/oss GDI+ (System.Drawing) based graphing and charting component for .NET?
===
I want to create basic line, bar, pie and area charts for .NET 3.5 WinForms and I'm interested in finding a free, mature, open-source .NET (preferably C# based) project to help me accomplish that. I would consider a WPF based project, however I'm more comfortable in GDI+ so I'd rather it used System.Drawing and/or GDI interop as its base technology.
Thanks!
Richard | 0 | [
2,
98,
22,
18,
21,
254,
398,
118,
759,
18,
489,
1115,
2430,
13,
5,
10724,
9,
3030,
3546,
6,
432,
7210,
68,
17,
22544,
5912,
26,
13,
9,
2328,
60,
800,
3726,
3726,
31,
259,
20,
1600,
2125,
293,
15,
748,
15,
5470,
17,
217,
5158... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Selenium Critique
===
I just wanted some opinions from people that have run Selenium (http://selenium.openqa.org) I have had a lot of experience with WaTiN and even wrote a recording suite for it. I had it producing some well structured code but being only maintained by me it seems my company all but abandoned it. If you have run selenium have you had a lot of success? I will being using .NET 3.5, does Selenium work well with it? Is the code produced clean or simply a list of all the interaction? (http://blogs.conchango.com/richardgriffin/archive/2006/11/14/Testing-Design-Pattern-for-using-WATiR_2F00_N.aspx) How well does the distributed testing suite fair?
Any other gripes or compliments on the system would be greatly appreciated! | 0 | [
2,
23027,
14311,
14791,
800,
3726,
3726,
31,
114,
417,
109,
11900,
37,
148,
30,
57,
485,
23027,
14311,
13,
5,
21127,
6903,
18,
20110,
2187,
9,
10157,
8681,
9,
5583,
6,
31,
57,
41,
21,
865,
16,
1496,
29,
15553,
108,
17,
166,
738,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Generating a unique machine id
===
I need to write a function that generates an id that is unique for a given machine running a Windows OS.
Currently, I'm using WMI to query various hardware parameters and concatenate them together and hash them to derive the unique id. My question is, what are the suggested parameters I should use?
Currently, I'm using a combination of bios\cpu\disk data to generate the unique id. And am using the first result if multiple results are there for each metric.
However, I ran into an issue where a machine that dual boots into 2 different Windows OS generates different site codes on each OS, which should ideally not happen.
For reference, these are the metrics I'm currently using:
Win32_Processor:UniqueID,ProcessorID,Name,Manufacturer,MaxClockSpeed
Win32_BIOS:Manufacturer
Win32_BIOS:SMBIOSBIOSVersion,IdentificationCode,SerialNumber,ReleaseDate,Version
Win32_DiskDrive:Model, Manufacturer, Signature, TotalHeads
Win32_BaseBoard:Model, Manufacturer, Name, SerialNumber
Win32_VideoController:DriverVersion, Name
And if multiple values are there for each
| 0 | [
2,
13500,
21,
2619,
1940,
4924,
800,
3726,
3726,
31,
376,
20,
2757,
21,
1990,
30,
7920,
18,
40,
4924,
30,
25,
2619,
26,
21,
504,
1940,
946,
21,
1936,
13,
759,
9,
871,
15,
31,
22,
79,
568,
619,
1435,
20,
25597,
617,
7610,
12905... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Reading a COBOL DAT file
===
I have been given a set of COBOL DAT, IDX and KEY files and I need to read the data in them and export it into Access, XLS, CSV, etc. I do not know the version, vendor of the COBOL code as I only have the windows executable that created the files.
I have tried Easysoft and Parkway ODBC drivers but I have not been successful in reading the data from the files.
I do not have access to the source code as the company that was distributing this product shut down. | 0 | [
2,
1876,
21,
326,
6966,
1331,
38,
3893,
800,
3726,
3726,
31,
57,
74,
504,
21,
309,
16,
326,
6966,
1331,
38,
15,
4924,
396,
17,
1246,
6488,
17,
31,
376,
20,
1302,
14,
1054,
19,
105,
17,
7487,
32,
77,
1381,
15,
993,
7532,
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... |
Count image similarity on GPU [OpenGL/OcclusionQuery]
===
OpenGL. Let's say I've drawn one image and then the second one using XOR. Now I've got black buffer with non-black pixels somewhere, I've read that I can use shaders to count black [ rgb(0,0,0) ] pixels ON GPU?
I've also read that it has to do something with OcclusionQuery.
http://oss.sgi.com/projects/ogl-sample/registry/ARB/occlusion_query.txt
Is it possible and how? [any programming language]
If you've got other idea on how to find similarity via OpenGL/GPU - that would be great too.
Thanks | 0 | [
2,
2468,
1961,
17204,
27,
489,
4201,
636,
10157,
8430,
118,
2499,
10301,
5991,
8190,
93,
500,
800,
3726,
3726,
368,
8430,
9,
408,
22,
18,
395,
31,
22,
195,
3160,
53,
1961,
17,
94,
14,
153,
53,
568,
993,
248,
9,
130,
31,
22,
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... |
Minimal latency objects pooling technique in multithread application
===
1. In the application we have something about 30 types of objects that are created repeatedly.
2. Some of them have long life (hours) some have short (miliseconds).
3. Objects could be created in one thread and destroyed in another.
Does anybody have any clue what could be good pooling technique in the sense of minimal creation/destruction latency, low lock contention and reasonable memory utilization? | 0 | [
2,
8663,
456,
14386,
3916,
3067,
68,
4873,
19,
1889,
96,
10647,
3010,
800,
3726,
3726,
137,
9,
19,
14,
3010,
95,
57,
301,
88,
712,
2551,
16,
3916,
30,
50,
679,
8081,
9,
172,
9,
109,
16,
105,
57,
175,
201,
13,
5,
4754,
18,
6,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I chain my own JavaScript into the client side without losing PostBack functionality
===
So I was reading these Asp.Net [interview questions][1] at Scott Hanselman's blog and I came across this question. Can anyone shed some light of what he's talking about.
[1]: http://www.hanselman.com/blog/ASPNETInterviewQuestions.aspx | 0 | [
2,
184,
107,
31,
2858,
51,
258,
8247,
8741,
77,
14,
6819,
270,
366,
2281,
678,
1958,
18548,
800,
3726,
3726,
86,
31,
23,
1876,
158,
28,
306,
9,
2328,
636,
6280,
4725,
2346,
500,
2558,
165,
500,
35,
1824,
4800,
19965,
22,
18,
814... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
OO Javascript : Definitive explanation of variable scope
===
Can someone provide an explanation of variable scope in JS as it applies to objects, functions and closures?
| 0 | [
2,
13,
4328,
8247,
8741,
13,
45,
15676,
5764,
16,
7612,
9914,
800,
3726,
3726,
92,
737,
1181,
40,
5764,
16,
7612,
9914,
19,
487,
18,
28,
32,
13169,
20,
3916,
15,
3719,
17,
7790,
18,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
General Binary Data Viewer for Windows Vista
===
I'm looking for recommendations for a good program for 32-bit Windows Vista that will load any arbitrary binary file and display textual information or graphical visualization relevant to identifying what actual data the bits are supposed to represent. Is ther anything better than a [hex editor](http://stackoverflow.com/questions/10426/what-is-a-good-windows-hex-editor-viewer#10431) for this kind of thing?
One thing I'd like to do is say, look at the non-visible data in a [Spore](http://www.spore.com) PNG file to get a clue as to what's actually being stored in there. Right now I'm using WordPad and all I get is something that looks like this:
>‰PNG
>
>IHDR ¢
>/Qã!$D4"Ž‚îvÚ°‰ÅØà ïjÃÞÉ_{!…‡ú 9¥Ý´îÁ6 ‰ms ^
| 0 | [
2,
297,
14171,
1054,
16812,
26,
1936,
13520,
800,
3726,
3726,
31,
22,
79,
699,
26,
12121,
26,
21,
254,
625,
26,
2512,
8,
3326,
1936,
13520,
30,
129,
6305,
186,
17237,
14171,
3893,
17,
3042,
1854,
6948,
676,
54,
21755,
28873,
7480,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 pronounce RAII?
===
RAII (=resource acquisition is initialization) is used heavily in C++.
I'm not a native speaker. So, how do you pronounce it? | 0 | [
2,
184,
107,
42,
25059,
6623,
49,
60,
800,
3726,
3726,
6623,
49,
13,
5,
3726,
99,
12097,
5860,
25,
2104,
1829,
6,
25,
147,
2991,
19,
272,
20512,
9,
31,
22,
79,
52,
21,
1275,
4687,
9,
86,
15,
184,
107,
42,
25059,
32,
60,
3,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What tools do you use to implement SOA/Messaging?
===
[NServiceBus][1] and [MassTransit][2] are two tools that can be used to implement messaging with MSMQ and other message queues.
I find that once you start using messaging to have applications talk to each other, you don't really want to go back to the old RPC style.
My question is, what other tools are out there? What tools do you use?
[1]: http://www.nservicebus.com/
[2]: http://code.google.com/p/masstransit/ | 0 | [
2,
98,
4672,
107,
42,
275,
20,
8713,
86,
58,
118,
3845,
18,
7426,
60,
800,
3726,
3726,
636,
103,
11449,
3822,
500,
2558,
165,
500,
17,
636,
11749,
7028,
242,
500,
2558,
135,
500,
50,
81,
4672,
30,
92,
44,
147,
20,
8713,
26437,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Self validating binaries?
===
My question is pretty straightforward: You are an executable file that outputs "Access granted" or "Access denied" and evil persons try to understand your algorithm or patch your innards in order to make you say "Access granted" all the time.
After this introduction, you might be heavily wondering what I am doing. Is he going to crack Diablo3 once it is out? I can pacify your worries, I am not one of those crackers. My goal are crackmes.
Crackmes can be found on - for example - <a>www.crackmes.de</a>. A Crackme is a little executable that (most of the time) contains a little algorithm to verify a serial and output "Access granted" or "Access denied" depending on the serial. The goal is to make this executable output "Access granted" all the time. The methods you are allowed to use might be restricted by the author - no patching, no disassembling - or involve anything you can do with a binary, objdump and a hex editor. Cracking crackmes is one part of the fun, definately, however, as a programmer, I am wondering how you can create crackmes that are difficult.
Basically, I think the crackme consists of two major parts: a certain serial verification and the surrounding code.
Making the serial verification hard to track just using assembly is very possible, for example, I have the idea to take the serial as an input for a simulated microprocessor that must end up in a certain state in order to get the serial accepted. On the other hand, one might grow cheap and learn more about cryptographically strong ways to secure this part. Thus, making this hard enough to make the attacker try to patch the executable should not be tha
t hard.
However, the more difficult part is securing the binary. Let us assume a perfectly secure serial verification that cannot be reversed somehow (of course I know it can be reversed, in doubt, you rip parts out of the binary you try to crack and throw random serials at it until it accepts). How can we prevent an attacker from just overriding jumps in the binary in order to make our binary accept anything?
I have been searching on this topic a bit, but most results on binary security, self verifying binaries and such things end up in articles that try to prevent attacks on an operating system using compromised binaries. by signing certain binaries and validate those signatures with the kernel.
My thoughts currently consist of:
* checking explicit locations in the binary to be jumps.
* checksumming parts of the binary and compare checksums computed at runtime with those.
* have positive and negative runtime-checks for your functions in the code. With side-effects on the serial verification. :)
Are you able to think of more ways to annoy a possible attacker longer? (of course, you cannot keep him away forever, somewhen, all checks will be broken, unless you managed to break a checksum-generator by being able to embed the correct checksum for a program in the program itself, hehe)
| 0 | [
2,
1119,
7394,
1880,
4511,
11301,
60,
800,
3726,
3726,
51,
1301,
25,
1772,
22262,
45,
42,
50,
40,
1396,
17194,
5924,
3893,
30,
5196,
18,
13,
7,
20604,
2743,
7,
54,
13,
7,
20604,
5265,
7,
17,
3215,
4280,
1131,
20,
1369,
154,
9083... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MVC or event-driven component-oriented web frameworks?
===
This question intends to be technology-agnostic. Which kind of web framework do you prefer, and when: *Pure MVC or event-driven component-oriented?*
Just to make the point in "technology-agnosticism", here I name a few MVC vs. component web frameworks, in diverse technologies / languages:
- Struts **vs.** Java Server Faces / Tapestry
- The new ASP.NET MVC **vs.** "classic" ASP.NET
- Cake PHP **vs.** PRADO | 0 | [
2,
307,
8990,
54,
807,
8,
14489,
5912,
8,
6800,
2741,
6596,
18,
60,
800,
3726,
3726,
48,
1301,
21526,
20,
44,
1099,
8,
58,
21944,
9,
56,
825,
16,
2741,
6596,
107,
42,
6369,
15,
17,
76,
45,
1637,
21059,
307,
8990,
54,
807,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is a metaclass in Python ?
===
I´ve mastered almost all the Python concepts (well, let´s say there are just OO concepts :-)) but this one is tricky.
I know it has something to do with introspection but it´s still unclear to me.
So what are metaclasses ? What do you use them for ?
Concrete examples, including snippets, much appreciated ! | 0 | [
2,
98,
25,
21,
7618,
1898,
19,
20059,
13,
60,
800,
3726,
3726,
31,
13,
195,
18716,
557,
65,
14,
20059,
8700,
13,
5,
854,
15,
408,
13,
18,
395,
80,
50,
114,
13,
4328,
8700,
13,
45,
8,
6,
6,
47,
48,
53,
25,
5514,
93,
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... |
Logging Application Block - Logging the caller
===
When logging with Log4Net it's very easy to put class that called the log into the log file. I've found in the past that this makes it very easy to trace through the code and see the flow through the classes. In Log4Net I use the %logger property in the conversion pattern like so:
<conversionPattern value="%date [%thread] %-5level %logger [%property{NDC}] - %message%newline" />
And this gives me the output I want:
2008-09-19 15:40:26,906 [3132] ERROR <b>Log4NetTechDemo.Tester</b> [(null)] - Failed method
You can see from the output that the class that has called the log is Log4NetTechDemo.Tester, so I can trace the error back to that class quite easily.
In the Logging Applicaton Block I cannot figure out how to do this with a simple log call. Does anyone know how it can be done? If so, an example or steps to do so would be very helpful.
Thanks!
Daniel | 0 | [
2,
13,
13919,
3010,
1921,
13,
8,
13,
13919,
14,
21326,
800,
3726,
3726,
76,
13,
13919,
29,
6738,
300,
2328,
32,
22,
18,
253,
2010,
20,
442,
718,
30,
227,
14,
6738,
77,
14,
6738,
3893,
9,
31,
22,
195,
216,
19,
14,
640,
30,
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... |
Facebook RSS application
===
How can I make a Facebook RSS application that autoupdates from the provided RSS feeds.
Of course doing this is trivial for canvas applications, but I need this for showing on the Facebook Page. All the RSS apps I've taken a look at either dont update or dont work on Facebook Pages.
Especially now that infinite session keys are deprecated (and maybe even forbidden). | 0 | [
2,
9090,
13,
1224,
18,
3010,
800,
3726,
3726,
184,
92,
31,
233,
21,
9090,
13,
1224,
18,
3010,
30,
3108,
576,
8209,
18,
37,
14,
1173,
13,
1224,
18,
17058,
9,
16,
674,
845,
48,
25,
13,
19712,
26,
9696,
3767,
15,
47,
31,
376,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Regular expressions in C# for file name validation
===
Hey does anyone have a good regular expression they'd like to share that can validate a text string to make sure it is a valid Windows filename (aka not have \/:*?"<>| characters).
I'd like to use it like the following:
// Return true if string is invalid
if (Regex.IsMatch(szFileName, "<your regex string>"))
{
// Tell user to reformat their filename
}
Many thanks!
-Jay | 0 | [
2,
1290,
13832,
19,
272,
5910,
26,
3893,
204,
27999,
800,
3726,
3726,
8409,
630,
1276,
57,
21,
254,
1290,
1803,
59,
22,
43,
101,
20,
1891,
30,
92,
7394,
1373,
21,
1854,
3724,
20,
233,
562,
32,
25,
21,
7394,
1936,
3893,
7259,
13,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
I need to join two lists, sort them and remove duplicates. Is there a better way to do this?
===
I have two unsorted lists and I need to produce another list which is sorted and where all the elements are unique.
The elements can occur multiple times in both lists and they are originally unsorted.
My function looks like this:
(defun merge-lists (list-a list-b sort-fn)
"Merges two lists of (x, y) coordinates sorting them and removing dupes"
(let ((prev nil))
(remove-if
(lambda (point)
(let ((ret-val (equal point prev)))
(setf prev point)
ret-val))
(sort
(merge 'list list-a list-b sort-fn) ;'
sort-fn))))
Is there a better way to achieve the same?
Sample call:
[CL]> (merge-lists '(9 8 4 8 9 7 2) '(1 7 3 9 2 6) #'>)
==> (9 8 7 6 4 3 2 1) | 0 | [
2,
31,
376,
20,
1865,
81,
7227,
15,
2058,
105,
17,
4681,
19429,
18,
9,
25,
80,
21,
574,
161,
20,
107,
48,
60,
800,
3726,
3726,
31,
57,
81,
367,
22843,
69,
7227,
17,
31,
376,
20,
2213,
226,
968,
56,
25,
22554,
17,
113,
65,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WCF - Overhead of throwing FaultExceptions within your service
===
I posted a [question][1] about using Messages versus Fault Exceptions to communicate business rules between services.
I was under the impression it carried overhead to throw this exception over the wire, but considering it's just a message that get serialized and deserialized, they were in fact one and the same.
But this got me thinking about throwing exceptions in general or more specifically throwing FaultExceptions.
Now within my service, if i use
throw new FaultException
to communicate a simple business rule like "Your account has not been activated",
What overhead does this now carry?
Is it the same overhead as throwing regular exceptions in .NET? or does WCF service handle these more efficiently with the use of Fault Contracts.
So in my user example, which is the optimal/preferred way to write my service method
option a
public void AuthenticateUser()
{
throw new FaultException("Your account has not been activated");
}
option b
public AutheticateDto AutheticateUser()
{
return new AutheticateDto() {
Success = false,
Message = "Your account has not been activated"};
}
[1]: http://stackoverflow.com/questions/81306/wcf-faults-exceptions-versus-messages | 0 | [
2,
11801,
410,
13,
8,
8860,
16,
6033,
4173,
10066,
5757,
363,
154,
365,
800,
3726,
3726,
31,
6054,
21,
636,
24652,
500,
2558,
165,
500,
88,
568,
7561,
5706,
4173,
13392,
20,
8709,
508,
1761,
128,
687,
9,
31,
23,
131,
14,
6394,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you test your web UI to see if it renders uniformly across different browsers?
===
Tools like Selenium are good for testing user interactions on the web UI. However, I was curious what are people approaches for strictly testing and verifying that web pages are rendered correctly across a set of browsers?
Is this even possible? | 0 | [
2,
184,
107,
42,
1289,
154,
2741,
13,
5661,
20,
196,
100,
32,
16535,
18,
4347,
102,
464,
421,
16495,
18,
60,
800,
3726,
3726,
4672,
101,
23027,
14311,
50,
254,
26,
4431,
4155,
11224,
27,
14,
2741,
13,
5661,
9,
207,
15,
31,
23,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
LINQ to SQL insert-if-non-existent
===
I was wondering if there's an easier way to write a method that inserts a record if it doesn't already exist in a table. I'm still trying to build my LINQ to SQL skills.
Here's what I've got, but it seems like there should be an easier way (i.e. less arguments).
public static TEntity InsertIfNotExists<TEntity>
(
DataContext db,
Table<TEntity> table,
Func<TEntity,bool> where,
TEntity record
)
where TEntity : class
{
TEntity existing = table.SingleOrDefault<TEntity>(where);
if (existing != null)
{
return existing;
}
else
{
table.InsertOnSubmit(record);
// Can't use table.Context.SubmitChanges()
// 'cause it's read-only
db.SubmitChanges();
}
return record;
}
| 0 | [
2,
6294,
1251,
20,
4444,
255,
14692,
8,
821,
8,
3951,
8,
20788,
800,
3726,
3726,
31,
23,
5712,
100,
80,
22,
18,
40,
4950,
161,
20,
2757,
21,
2109,
30,
14692,
18,
21,
571,
100,
32,
1437,
22,
38,
614,
3182,
19,
21,
859,
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... |
Why can't I delete a file in %ProgramFiles% from a Unit Test via Resharper's Test Runner Unit Test?
===
I am trying to write a test which, in it's fixtures Setup, it backs up a file and deletes the original, runs the test without the original present, then in the teardown, restores the original from the backup. The file is located in my %ProgramFiles% folder. I get an UnauthorizedAccessException on the fileInfo.Delete() statement. I have no problem deleting this file from another test project on the same machine that is not running from the Resharper Test Runner. | 0 | [
2,
483,
92,
22,
38,
31,
27448,
21,
3893,
19,
13,
11881,
19746,
16877,
18,
11881,
37,
21,
1237,
1289,
1197,
302,
23646,
106,
22,
18,
1289,
4510,
1237,
1289,
60,
800,
3726,
3726,
31,
589,
749,
20,
2757,
21,
1289,
56,
15,
19,
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's a good singleton template pattern in C#
===
I have the following C# singleton pattern, is there any way of improving it?
public class Singleton<T> where T : new()
{
private static object _syncobj = new object();
private static T _instance = null;
public static T Instance
{
get
{
if (_instance == null)
{
lock (_syncobj)
{
if (_instance == null)
{
_instance = new T();
}
}
}
return _instance;
}
}
protected Singleton()
{ }
} | 0 | [
2,
98,
22,
18,
21,
254,
345,
444,
22894,
3732,
19,
272,
5910,
800,
3726,
3726,
31,
57,
14,
249,
272,
5910,
345,
444,
3732,
15,
25,
80,
186,
161,
16,
9273,
32,
60,
317,
718,
345,
444,
1,
38,
1,
113,
13,
38,
13,
45,
78,
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 is a good GUI text editor for the Mac?
===
I'm relatively new to programming on the Mac, and I need a good text editor. I'm looking for something: free, gui-based, non-VIM, non-Emacs.
As a reference, my editors of choice on Windows are SciTe and Visual Studio's editor. | 0 | [
2,
98,
25,
21,
254,
9457,
1854,
1835,
26,
14,
1572,
60,
800,
3726,
3726,
31,
22,
79,
3109,
78,
20,
3143,
27,
14,
1572,
15,
17,
31,
376,
21,
254,
1854,
1835,
9,
31,
22,
79,
699,
26,
301,
45,
551,
15,
9457,
8,
1281,
15,
538,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What do you consider the best CMS in Java
===
Which CMS are you using in Java and what is your experience with it (in terms of extensibility, usage comfort, framework API, memory usage, performance etc.). I am looking for suggestions. | 4 | [
2,
98,
107,
42,
3563,
14,
246,
2390,
18,
19,
8247,
800,
3726,
3726,
56,
2390,
18,
50,
42,
568,
19,
8247,
17,
98,
25,
154,
1496,
29,
32,
13,
5,
108,
1663,
16,
1396,
8710,
14264,
15,
7514,
5295,
15,
6596,
21,
2159,
15,
1912,
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,
0,
0,
0,
0... |
How to have silverlight get its data from MySQL
===
I've written a small hello world test app in Silverlight which i want to host on a Linux/Apache2 server. I want the data to come from MySQL (or some other linux compatible db) so that I can databind to things in the db.
I've managed to get it working by using the [MySQL Connector/.NET][1]:
MySqlConnection conn = new MySqlConnection("Server=the.server.com;Database=theDb;User=myUser;Password=myPassword;");
conn.Open();
MySqlCommand command = new MySqlCommand("SELECT * FROM test;", conn);
using (MySqlDataReader reader = command.ExecuteReader())
{
StringBuilder sb = new StringBuilder();
while (reader.Read())
{
sb.AppendLine(reader.GetString("myColumn"));
}
this.txtResults.Text = sb.ToString();
}
This works fine if I give the published ClickOnce app full trust (or at least SocketPermission) and **run it locally**.
I want this to run on the server and I can't get it to work, always ending up with permission exception (SocketPermission is not allowed).
The database is hosted on the same server as the silverlight app if that makes any difference.
[1]: http://www.mysql.com/products/connector/net/ | 0 | [
2,
184,
20,
57,
1172,
3130,
164,
82,
1054,
37,
51,
18,
22402,
800,
3726,
3726,
31,
22,
195,
642,
21,
284,
10975,
126,
1289,
4865,
19,
1172,
3130,
56,
31,
259,
20,
2015,
27,
21,
13024,
118,
7738,
2569,
135,
8128,
9,
31,
259,
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... |
Obfuscation Puzzle: What does this function do?
===
sub foo {[$#{$_[!$||$|]}*@{$_[!!$_^!$_]}?@{$_[!$..!!$.]}[$_[@--@+]%
@{$_[$==~/(?=)//!$`]}..$#{$_[$??!!$?:!$?]},($)?!$):!!$))..$_[$--$-]%@{
$_[$]/$]]}-(!!$++!$+)]:@{$_[!!$^^^!$^^]}]}
| 4 | [
2,
5122,
13735,
16893,
9164,
45,
98,
630,
48,
1990,
107,
60,
800,
3726,
3726,
972,
4310,
111,
13,
1,
2558,
4403,
5910,
1,
4403,
1,
2558,
187,
4403,
1,
4403,
1,
500,
1,
2483,
1,
4403,
1,
2558,
19015,
4403,
1,
187,
4403,
1,
500,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Reasons of getting a java.lang.VerifyError
===
I'm investigating the following java.lang.VerifyError
java.lang.VerifyError: (class: be/post/ehr/wfm/application/serviceorganization/report/DisplayReportServlet, method: getMonthData signature: (IILjava/util/Collection;Ljava/util/Collection;Ljava/util/HashMap;Ljava/util/Collection;Ljava/util/Locale;Lorg/apache/struts/util/MessageRe˜̴Mt̴MÚw€mçw€mp:”MŒŒ
at java.lang.Class.getDeclaredConstructors0(Native Method)
at java.lang.Class.privateGetDeclaredConstructors(Class.java:2357)
at java.lang.Class.getConstructor0(Class.java:2671)
It occurs when the jboss server in which the servlet is deployed is started.
It is compiled with jdk-1.5.0_11 and I tried to recompile it with jdk-1.5.0_15 without succes. That is the compilation runs fine but when deployed, the java.lang.VerifyError occurs.
When I changed the methodname and got the following error:
java.lang.VerifyError: (class: be/post/ehr/wfm/application/serviceorganization/r eport/DisplayReportServlet, method: getMD signature: (IILjava/util/Collection;Lj ava/util/Collection;Ljava/util/HashMap;Ljava/util/Collection;Ljava/util/Locale;L org/apache/struts/util/MessageResources ØÅN|ØÅNÚw€mçw€mX#ÖM|XÔM
at java.lang.Class.getDeclaredConstructors0(Native Method)
at java.lang.Class.privateGetDeclaredConstructors(Class.java:2357
at java.lang.Class.getConstructor0(Class.java:2671)
at java.lang.Class.newInstance0(Class.java:321)
at java.lang.Class.newInstance(Class.java:303)
You can see that more of the method signature is shown.
The actual method signature is
private PgasePdfTable getMonthData(int month, int year, Collection dayTypes,
Collection calendarDays,
HashMap bcSpecialDays,
Collection activityPeriods,
Locale locale, MessageResources resources) throws Exception {
I already tried looking to it with javap and that gives the method signature as it should be.
When my other colleagues check out the code, compile it and deploy it, they have the same problem. When the build server picks up the code and deploys it on development or testing environments (HPUX), the same error occurs. Also an automated testing machine running ubuntu shows the same error during server startup.
The rest of the application runs ok, only that one servlet is out of order.
Any ideas where to look would be helpful.
| 0 | [
2,
2932,
16,
1017,
21,
8247,
9,
9949,
9,
2304,
8612,
29992,
800,
3726,
3726,
31,
22,
79,
12490,
14,
249,
8247,
9,
9949,
9,
2304,
8612,
29992,
8247,
9,
9949,
9,
2304,
8612,
29992,
45,
13,
5,
1898,
45,
44,
118,
6962,
118,
15430,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 wide keyboard shortcut - Java Swing
===
I would like to create an application wide keyboard shortcut for a Java Swing application.
Looping over all components and adding the shortcut on each has focus related side effects and looks like a brute force solution.
Anyone has a cleaner solution ?
Regards,
Louis | 0 | [
2,
3010,
1051,
8896,
502,
4118,
13,
8,
8247,
5587,
800,
3726,
3726,
31,
83,
101,
20,
1600,
40,
3010,
1051,
8896,
502,
4118,
26,
21,
8247,
5587,
3010,
9,
5293,
68,
84,
65,
5090,
17,
4721,
14,
502,
4118,
27,
206,
63,
1776,
1597,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 tool you use to index C/C++ code?
===
I am working with a very large code in C/C++. Indexing and referencing is a must in this environment. What tools would you recommend for viewing/browsing the code? Preferably open source. I tried CDT for indexing but it is useless. Other tools I've tried is cscope, but it does not work well with C++... | 0 | [
2,
98,
5607,
42,
275,
20,
4348,
272,
118,
150,
20512,
1797,
60,
800,
3726,
3726,
31,
589,
638,
29,
21,
253,
370,
1797,
19,
272,
118,
150,
20512,
9,
4348,
68,
17,
13,
29254,
25,
21,
491,
19,
48,
2307,
9,
98,
4672,
83,
42,
123... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Eclipse 3.4 (Ganymede) memory usage significantly higher than 3.2?
===
I was happily using Eclipse 3.2 (or as happy as one can be using Eclipse) when for a forgotten reason I decided to upgrade to 3.4. I'm primarily using PyDev, Aptana, and Subclipse, very little Java development.
I've noticed 3.4 tends to really give my laptop a hernia compared to 3.2 (vista, core2duo, 2G). Is memory usage on 3.4 actually higher than on 3.2, and if so is there a way to reduce it? | 0 | [
2,
25,
11652,
203,
9,
300,
13,
5,
2342,
93,
4688,
62,
6,
1912,
7514,
5085,
1184,
119,
203,
9,
135,
60,
800,
3726,
3726,
31,
23,
12356,
568,
11652,
203,
9,
135,
13,
5,
248,
28,
1700,
28,
53,
92,
44,
568,
11652,
6,
76,
26,
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... |
Is there a way to check if there are symbolic links pointing to a directory?
===
I have a folder on my server to which I had a number of symbolic links pointing. I've since created a new folder and I want to change all those symbolic links to point to the new folder. I'd considered replacing the original folder with a symlink to the new folder, but it seems that if I continued with that practice it could get very messy very fast.
What I've been doing is manually changing the symlinks to point to the new folder, but I may have missed a couple. **Is there a way to check if there are any symlinks pointing to a particular folder?** | 0 | [
2,
25,
80,
21,
161,
20,
2631,
100,
80,
50,
12882,
6271,
6832,
20,
21,
16755,
60,
800,
3726,
3726,
31,
57,
21,
19294,
27,
51,
8128,
20,
56,
31,
41,
21,
234,
16,
12882,
6271,
6832,
9,
31,
22,
195,
179,
679,
21,
78,
19294,
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 tool/format do you use for writting your specifications?
===
I would like to know what kind of tool you use for writing your specifications. I think it's essential to use a tool that supports some kind of plain text format so that one can control the specification with a source control system like SVN. For the specification as for the code as well, it's important to have a history of all changes.
At present we write our specification in a XML format. TeX would also be an alternative, but it's hard for people who have never been working with it.
So let me know, what kind of tools or formats you use for specifications. | 0 | [
2,
98,
5607,
118,
23588,
107,
42,
275,
26,
20127,
1203,
154,
17971,
60,
800,
3726,
3726,
31,
83,
101,
20,
143,
98,
825,
16,
5607,
42,
275,
26,
1174,
154,
17971,
9,
31,
277,
32,
22,
18,
5832,
20,
275,
21,
5607,
30,
6747,
109,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Adding a classic ASP webapplication to VS 2008
===
is there a way to add an existing classic ASP webapp into a solution in VS? The application is around 4000 files large and currently maintained outisde Visual Studio.
Thanks in advance!
Matthias | 0 | [
2,
4721,
21,
2732,
28,
306,
2741,
2552,
20669,
20,
4611,
570,
800,
3726,
3726,
25,
80,
21,
161,
20,
3547,
40,
3149,
2732,
28,
306,
2741,
7753,
77,
21,
4295,
19,
4611,
60,
14,
3010,
25,
140,
24762,
6488,
370,
17,
871,
3926,
70,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
.NET List<T> Concat vs AddRange
===
What is the difference between the AddRange and Concat functions on a generic List? Is one recommended over the other? | 0 | [
2,
13,
9,
2328,
968,
1,
38,
1,
1065,
5782,
4611,
3547,
8366,
800,
3726,
3726,
98,
25,
14,
2841,
128,
14,
3547,
8366,
17,
1065,
5782,
3719,
27,
21,
12733,
968,
60,
25,
53,
5773,
84,
14,
89,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How can I do offline reasoning with Pellet?
===
I have an OWL ontology and I am using Pellet to do reasoning over it. Like most ontologies it starts by including various standard ontologies:
<rdf:RDF
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#"
xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
xmlns:owl="http://www.w3.org/2002/07/owl#">
I know that some reasoners have these standard ontologies 'built-in', but Pellet doesn't. Is there any way I can continue to use Pellet when I am offline & can't access them? (Or if their URL goes offline, like dublincore.org did last week for routine maintenance) | 0 | [
2,
184,
92,
31,
107,
168,
1143,
15543,
29,
13,
14343,
38,
60,
800,
3726,
3726,
31,
57,
40,
11170,
27,
17810,
17,
31,
589,
568,
13,
14343,
38,
20,
107,
15543,
84,
32,
9,
101,
127,
27,
38,
13331,
18,
32,
3244,
34,
215,
617,
12... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Python - easy way to add N seconds to a datetime.time?
===
Given a `datetime.time` value in Python, is there a standard way to add an integer number of seconds to it, so that `11:34:59` + 3 = `11:35:02`, for example?
These obvious ideas don't work:
>>> datetime.time(11, 34, 59) + 3
TypeError: unsupported operand type(s) for +: 'datetime.time' and 'int'
>>> datetime.time(11, 34, 59) + datetime.timedelta(0, 3)
TypeError: unsupported operand type(s) for +: 'datetime.time' and 'datetime.timedelta'
>>> datetime.time(11, 34, 59) + datetime.time(0, 0, 3)
TypeError: unsupported operand type(s) for +: 'datetime.time' and 'datetime.time'
In the end I have written functions like this:
def add_secs_to_time(timeval, secs_to_add):
secs = timeval.hour * 3600 + timeval.minute * 60 + timeval.second
secs += secs_to_add
return datetime.time(secs // 3600, (secs % 3600) // 60, secs % 60)
I can't help thinking that I'm missing an easier way to do this though.
| 0 | [
2,
20059,
13,
8,
2010,
161,
20,
3547,
13,
103,
2582,
20,
21,
1231,
891,
9,
891,
60,
800,
3726,
3726,
504,
21,
13,
1,
8209,
891,
9,
891,
1,
1923,
19,
20059,
15,
25,
80,
21,
1236,
161,
20,
3547,
40,
13820,
234,
16,
2582,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to retrieve params from GET HTTP method using javax.ws.rs.* and Glassfish?
===
I just installed Glassfish V2 on my local machine just to play around with it.
I was wondering if there is a way to retrieve a param passed in by the GET HTTP method.
For instance,
http://localhost:8080/HelloWorld/resources/helloWorld?name=ABC
How do I retrieve the "name" param in my Java code? | 0 | [
2,
184,
20,
11917,
2258,
79,
18,
37,
164,
7775,
2109,
568,
8247,
396,
9,
10268,
9,
1224,
9,
2483,
17,
1350,
4934,
60,
800,
3726,
3726,
31,
114,
4066,
1350,
4934,
566,
135,
27,
51,
375,
1940,
114,
20,
418,
140,
29,
32,
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... |
Start seleniumRC from Fitnesse
===
I'm trying to integrate running Fitnesse tests from MSBuild im my nightly build on TFS.
In an attempt to make it self contained I would like to start the seleniumRC server only when it's needed from fitness.
I've seen that there is a "Command Line Fixture" but it's written in java can I use that?
| 0 | [
2,
799,
23027,
14311,
5453,
37,
11331,
62,
800,
3726,
3726,
31,
22,
79,
749,
20,
18399,
946,
11331,
62,
4894,
37,
4235,
29361,
797,
51,
343,
102,
1895,
27,
13,
11720,
18,
9,
19,
40,
1735,
20,
233,
32,
1119,
3437,
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... |
Tools for finding unused function declarations?
===
Whilst refactoring some old code I realised that a particular header file was full of function declarations for functions long since removed from the .cpp file. Does anyone know of a tool that could find (and strip) these automatically? | 0 | [
2,
4672,
26,
3007,
18927,
1990,
7098,
18,
60,
800,
3726,
3726,
4575,
302,
17455,
68,
109,
315,
1797,
31,
12514,
30,
21,
1498,
157,
106,
3893,
23,
503,
16,
1990,
7098,
18,
26,
3719,
175,
179,
1974,
37,
14,
13,
9,
150,
3421,
3893,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Looking for a simple standalone persistant dictionary implementation in C#
===
For an open source project I am looking for a good, simple implementation of a Dictionary that is backed by a file. Meaning, if an application crashes or restarts the dictionary will keep its state. I would like it to update the underlying file every time the dictionary is touched. (Add a value or remove a value). A FileWatcher is not required but it could be useful.
class PersistantDictionary<T,V> : Dictionary<T,V>
{
public PersistantDictionary(string filename)
{
}
}
Requirements:
* Open Source, with no dependency on native code (no sqlite)
* Ideally a very short and simple implementation
* When setting or clearing a value it should not re-write the entire underlying file, instead it should seek to the position in the file and update the value. | 0 | [
2,
699,
26,
21,
1935,
26986,
22084,
1830,
9186,
6123,
19,
272,
5910,
800,
3726,
3726,
26,
40,
368,
1267,
669,
31,
589,
699,
26,
21,
254,
15,
1935,
6123,
16,
21,
9186,
30,
25,
6334,
34,
21,
3893,
9,
1813,
15,
100,
40,
3010,
215... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# String ASCII representation
===
How can I insert ASCII special characters (e.g. with the ASCII value 0x01) into a string?
I ask because I am using the following:
str.Replace( "<TAG1>", Convert.ToChar(0x01).ToString() );
and I feel that there must be a better way than this. Any Ideas?
Update:
Also If I use this methodology, do I need to worry about unicode & ASCII clashing? | 0 | [
2,
272,
5910,
3724,
28,
1892,
49,
5442,
800,
3726,
3726,
184,
92,
31,
14692,
28,
1892,
49,
621,
1766,
13,
5,
62,
9,
263,
9,
29,
14,
28,
1892,
49,
1923,
713,
396,
3026,
6,
77,
21,
3724,
60,
31,
1349,
185,
31,
589,
568,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I create a "select folder OR file dialog window"?
===
You can use
SelectFolder() to get a folder
or
GetOpenFolderitem(filter as string) to get files
but can you select either a folder or file? ( or for that matter selecting multiple files )
| 0 | [
2,
184,
107,
31,
1600,
21,
13,
7,
18,
16964,
19294,
54,
3893,
28223,
1463,
7,
60,
800,
3726,
3726,
42,
92,
275,
5407,
8814,
106,
5,
6,
20,
164,
21,
19294,
54,
164,
10157,
8814,
106,
2119,
79,
5,
11924,
815,
28,
3724,
6,
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... |
Java Frameworks War: Spring and Hibernate
===
My developers are waging a civil war. In one camp, they've embraced Hibernate and Spring. In the other camp, they've denounced frameworks - they're considering Hibernate though.
The question is: Are there any nasty surprises, weaknesses or pit-falls that newbie Hibernate-Spring converts are likely to stumble on? | 0 | [
2,
8247,
6596,
18,
176,
45,
1573,
17,
4148,
2102,
8820,
800,
3726,
3726,
51,
10168,
50,
619,
7426,
21,
1038,
176,
9,
19,
53,
1232,
15,
59,
22,
195,
15843,
4148,
2102,
8820,
17,
1573,
9,
19,
14,
89,
1232,
15,
59,
22,
195,
20522... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Test planning/documentation/management tools
===
I'm looking for a good, preferably free, test planning and documentation tool. Ideally something that will keep track of which tests have been run against which software version, with reporting ability. There's a whole bunch of tools listed [here][1] but are there any others, and which ones have you had the best experience with? (You do run tests, right?)
[1]: http://www.opensourcetesting.org/testmgt.php | 0 | [
2,
1289,
2334,
118,
28132,
857,
118,
23502,
4672,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
254,
15,
6369,
4801,
551,
15,
1289,
2334,
17,
13945,
5607,
9,
5628,
102,
301,
30,
129,
643,
792,
16,
56,
4894,
57,
74,
485,
149,
56,
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... |
Reading a PNG image file in .Net 2.0
===
I'm using C# in .Net 2.0, and I want to read in a PNG image file and check for the first row and first column that has non-transparent pixels.
What assembly and/or class should I use? | 0 | [
2,
1876,
21,
351,
2723,
1961,
3893,
19,
13,
9,
2328,
172,
9,
387,
800,
3726,
3726,
31,
22,
79,
568,
272,
5910,
19,
13,
9,
2328,
172,
9,
387,
15,
17,
31,
259,
20,
1302,
19,
21,
351,
2723,
1961,
3893,
17,
2631,
26,
14,
64,
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... |
Where can I get good answers to my Perl related questions?
===
AFAIK one of the objectives of Stack Overflow is to make sure anyone can come here and find <b>good</b> answers to her Perl related questions. Certainly beginners would ask what is the <a href="http://stackoverflow.com/questions/70573/best-online-
source-to-learn-perl">best online source to learn Perl</a> but others might just want to ask a question.
Probably the friendliest place is the <a href="http://perlmonks.org/">Monastery of Perl Monks</a>. It is a web site with a rating system similar to but more simple than Stack Overflow. You can find lots of good answers there and if you don't find an answer you can always ask.
The other big resource would be the mailing list of your local <a href="http://www.pm.org/">Perl Mongers</a> group.
Where do <b>you</b> go when you are looking for an answer to a Perl related question?
| 0 | [
2,
113,
92,
31,
164,
254,
6709,
20,
51,
416,
255,
1597,
2346,
60,
800,
3726,
3726,
21,
1473,
2883,
53,
16,
14,
12471,
16,
7566,
20285,
25,
20,
233,
562,
1276,
92,
340,
235,
17,
477,
13,
1,
220,
1,
3264,
1,
118,
220,
1,
6709,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 ther an OpenFile||FolderDialog object in .NET?
===
Is it possible to use the [`OpenFileDialog`][1] class select a file OR folder? It appears only to allow the selection of a file, if you select a folder and then choose open it will navigate to that folder.
If the `OpenFileDialog` can not be used for this is there another object I should be using?
**EDIT**: The scenario is that I have a tool that can upload one...many files or folders. I need to be able to provide a dialog like the `OpenFileDialog` that allows a user to select a file, folder, or a combination of. I know about the `FolderBrowseDialog` and tha is not the answer in this case.
[1]: https://login.live.com/login.srf?wa=wsignin1.0&rpsnv=10&ct=1221809452&rver=5.5.4177.0&wp=MCLBI&wlcxt=msdn%24msdn%24msdn&wreply=http:%2F%2Fmsdn.microsoft.com%2Fen-us%2Flibrary%2Fsystem.windows.forms.openfiledialog.aspx&id=254354&lc=1033 | 0 | [
2,
25,
14,
139,
40,
368,
16877,
1,
8814,
106,
4286,
5567,
3095,
19,
13,
9,
2328,
60,
800,
3726,
3726,
25,
32,
938,
20,
275,
14,
636,
1,
10157,
16877,
4286,
5567,
1,
500,
2558,
165,
500,
718,
5407,
21,
3893,
54,
19294,
60,
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... |
Connecting to IMDB
===
Has any one done this before? It would seem to me that there should be a webservice but i can't find one. I am writing an application for personal use that would just show basic info from IMDB. | 0 | [
2,
6440,
20,
797,
9007,
800,
3726,
3726,
63,
186,
53,
677,
48,
115,
60,
32,
83,
2260,
20,
55,
30,
80,
378,
44,
21,
2741,
11449,
47,
31,
92,
22,
38,
477,
53,
9,
31,
589,
1174,
40,
3010,
26,
1319,
275,
30,
83,
114,
298,
2125... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How do I check if the scanner is plugged in (C#, .NET TWAIN)
===
I use .NET TWAIN from [http://www.codeproject.com/KB/dotnet/twaindotnet.aspx?msg=1007385#xx1007385xx][1] in my application.
When i try to scan image when scanner is not plugged in, application freeze.
How to check is any device plugged in from TWAIN driver?
Thanks.
[1]: http://www.codeproject.com/KB/dotnet/twaindotnet.aspx?msg=1007385#xx1007385xx | 0 | [
2,
184,
107,
31,
2631,
100,
14,
23195,
25,
29039,
19,
13,
5,
150,
5910,
15,
13,
9,
2328,
25682,
6,
800,
3726,
3726,
31,
275,
13,
9,
2328,
25682,
37,
636,
21127,
6903,
6483,
9,
9375,
21011,
9,
960,
118,
18167,
118,
12527,
2328,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Mashups and SharePoint
===
Can somebody in SO please provide me with a list of resources about Enterprise Mashups and technologies related to SharePoint platform? | 0 | [
2,
13333,
15699,
17,
1891,
3132,
800,
3726,
3726,
92,
8861,
19,
86,
2247,
1181,
55,
29,
21,
968,
16,
2566,
88,
6002,
13333,
15699,
17,
5740,
1597,
20,
1891,
3132,
2452,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Speed up loop using multithreading in C# (Question).
===
Imagine I have an function which goes through one million/billion strings and checks smth in them.
f.ex:
foreach (String item in ListOfStrings)
{
result.add(CalculateSmth(item));
}
it consumes lot's of time, because CalculateSmth is very time consuming function.
I want to ask: how to integrate multithreading in this kinda process?
f.ex: I want to fire-up 5 threads and each of them returns some results, and thats goes-on till the list has items.
Maybe anyone can show some examples or articles..
| 0 | [
2,
1362,
71,
5293,
568,
1889,
96,
22883,
19,
272,
5910,
13,
5,
24652,
6,
9,
800,
3726,
3726,
4382,
31,
57,
40,
1990,
56,
1852,
120,
53,
507,
118,
9580,
872,
7887,
17,
16602,
7613,
96,
19,
105,
9,
398,
9,
1706,
45,
26,
14322,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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's the ActionScript2 -> ActionScript3 learning curve?
===
I knew ActionScript and ActionScript2 inside out, but I've been away from Flash for a couple years. What's the magnitude of becoming fluent in ActionScript3 and the new Flash functionality? From Colin Moock's blog, I heard that some of the fundamental movieclip methods have changed... | 0 | [
2,
184,
22,
18,
14,
1028,
8741,
135,
13,
8,
1,
1028,
8741,
240,
2477,
7101,
60,
800,
3726,
3726,
31,
404,
1028,
8741,
17,
1028,
8741,
135,
572,
70,
15,
47,
31,
22,
195,
74,
229,
37,
4433,
26,
21,
1335,
122,
9,
98,
22,
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... |
Code Analysis In Python
===
What tools are good to use for code analysis in python?
I have a large source repository split across multiple projects, and I would like to be able to run tools across the directories to see details like Cyclomatic Complexity, and perhaps be able to spot errors using static analysis.
Ideally, I would like to be able to produce a report about the health of the source code, so we can spot problem areas that need to be addressed. | 0 | [
2,
1797,
2495,
19,
20059,
800,
3726,
3726,
98,
4672,
50,
254,
20,
275,
26,
1797,
2495,
19,
20059,
60,
31,
57,
21,
370,
1267,
24869,
2132,
464,
1886,
2314,
15,
17,
31,
83,
101,
20,
44,
777,
20,
485,
4672,
464,
14,
559,
1596,
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 can be the reason for BeginPaint() always generate a WM_NCPAINT?
===
I'm facing a problem on Win32 API. I have a program that when it handles WM_PAINT messages it calls BeginPaint to clip the region and validate the update region, but the BeginPaint is always generating a WM_NCPAINT message with the same updata region even if the touched part that need repaint it's only inside the client region. Do anyone has any clue? It's on child windows with WS_CHILD. | 0 | [
2,
98,
92,
44,
14,
1215,
26,
2348,
20578,
5,
6,
550,
7920,
21,
19312,
1,
6897,
20578,
60,
800,
3726,
3726,
31,
22,
79,
4325,
21,
1448,
27,
628,
3125,
21,
2159,
9,
31,
57,
21,
625,
30,
76,
32,
3053,
18,
19312,
1,
20578,
7561,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XSL code coverage tool
===
Are there any tools that can tell me what percentage of a XSL document get actually executed during tests? | 0 | [
2,
993,
18,
255,
1797,
5245,
5607,
800,
3726,
3726,
50,
80,
186,
4672,
30,
92,
494,
55,
98,
5780,
16,
21,
993,
18,
255,
4492,
164,
1121,
5557,
112,
4894,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Groovy: Correct Syntax for XMLSlurper to find elements with a given attribute
===
Given a HTML file with the structure html->body->a bunch of divs what is the correct groovy statement to find all of the divs with a non blank tags attribute?
The following is not working:
def nodes = html.body.div.findAll {it.@tags != null}
because it finds all the nodes. | 0 | [
2,
3452,
2026,
93,
45,
4456,
22649,
26,
23504,
18,
14130,
1432,
20,
477,
2065,
29,
21,
504,
35,
14755,
800,
3726,
3726,
504,
21,
13,
15895,
3893,
29,
14,
1411,
13,
15895,
8,
1,
9760,
8,
1,
58,
7653,
16,
13,
12916,
18,
98,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Automatically creating a VMWare image
===
I want to be able to create a VMWare image, by specifying the components that should go into it, preferably in a script, and then get VMWare, or some third process, to build the machine from the specs.
So I want to be able to say eg.
OS - Windows 2003, Apps - Visual Studio etc, and then it builds the machine automatically from the description.
I know that you can create a template from an existing machine, and use that, this is going one step higher, and building the template from a set of specifications.
Any ideas? | 0 | [
2,
7499,
2936,
21,
13,
20147,
5011,
1961,
800,
3726,
3726,
31,
259,
20,
44,
777,
20,
1600,
21,
13,
20147,
5011,
1961,
15,
34,
19077,
68,
14,
5090,
30,
378,
162,
77,
32,
15,
6369,
4801,
19,
21,
3884,
15,
17,
94,
164,
13,
20147,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way to store event times in (My)SQL database
===
I'm trying to decide on the best way to store event times in a MySQL database. These should be as flexible as possible and be able to represent "single events" (starts at a certain time, does not necessarily need an end time), "all day" and "multi day" events, repeating events, repeating all day events, possibly "3rd Saturday of the month" type events etc.
Please suggest some tried and proven database schemes. | 0 | [
2,
246,
161,
20,
1718,
807,
436,
19,
13,
5,
915,
6,
18,
22402,
6018,
800,
3726,
3726,
31,
22,
79,
749,
20,
4073,
27,
14,
246,
161,
20,
1718,
807,
436,
19,
21,
51,
18,
22402,
6018,
9,
158,
378,
44,
28,
13568,
28,
938,
17,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Per-process CPU usage on Win95 / 98 / ME
===
How can you programmatically measure per-process (or better, per-thread) CPU usage under windows 95, windows 98 and windows ME?
If it requires the DDK, where can you obtain that? | 0 | [
2,
416,
8,
16835,
17578,
7514,
27,
628,
3836,
13,
118,
8737,
13,
118,
55,
800,
3726,
3726,
184,
92,
42,
625,
6732,
1326,
4058,
416,
8,
16835,
13,
5,
248,
574,
15,
416,
8,
96,
10647,
6,
17578,
7514,
131,
1936,
7969,
15,
1936,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why are we still using compiler command lines?
===
I've been designing a compiler framework (targeting .NET) for a while now and I've been thinking more and more about deprecating the command line interface. A lot of my compiler's flexibility comes from the ability to define custom pipeline elements (to handle DSLs, macros (which have their own DSL to define), etc) and the command line ends up very verbose and tedious. This also makes it more difficult to design a NAnt task that will expose all of the functionality in a simple way.
The alternative I've been toying around with is actually making the NAnt task load the compiler module and call it directly, so the command line is a nonissue. This will remove the overhead of invoking the compiler -- a non-negligible amount of time when you're doing a lot of compilation, as it has to initialize for each and every compilation -- and allow you to more easily define custom pipelines.
My question is this: Why hasn't this been done before? It seems a natural progression to more tightly integrate the compiler with the build system. Assuming you keep the command line interface around, there are few downsides and a lot of benefits. For that matter, <b>has</b> anyone done this already?
Edit: To clarify, I'm not proposing the complete abolition of the compiler command line interface, just treating it as the legacy interface. | 0 | [
2,
483,
50,
95,
174,
568,
21486,
1202,
1560,
60,
800,
3726,
3726,
31,
22,
195,
74,
15026,
21,
21486,
6596,
13,
5,
3958,
3060,
68,
13,
9,
2328,
6,
26,
21,
133,
130,
17,
31,
22,
195,
74,
1440,
91,
17,
91,
88,
121,
3515,
150,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Disable Cakephp's Auto Model "feature"
===
In cake 1.2 there is a feature that allows the developer to no have to create models, but rather have cake do the detective work at run time and create the model for you. This process happens each time and is neat but in my case very hazardous. I read about this somewhere and now I'm experiencing the bad side of this.
I've created a plugin with all the files and everything appeared to be just great. That is until i tried to use some of the model's associations and functions. Then cake claims that this model i've created doesn't exist. **I've narrowed it down to cake using this auto model feature instead of throwing and error**! So i have no idea what's wrong!
Does anybody know how to disable this auto model feature? It's a good thought, but I can't seem to find where i've gone wrong with my plugin and an error would be very helpful! | 0 | [
2,
1460,
579,
8390,
26120,
22,
18,
3108,
1061,
13,
7,
26956,
7,
800,
3726,
3726,
19,
8390,
137,
9,
135,
80,
25,
21,
1580,
30,
2965,
14,
10058,
20,
90,
57,
20,
1600,
2761,
15,
47,
864,
57,
8390,
107,
14,
4485,
170,
35,
485,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.