unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Is there a way to implement algebraic types in Java?
===
Is it possible, in Java, to enforce that a class have a specific set of subclasses and no others? For example:
public abstract class A {}
public final class B extends A {}
public final class C extends A {}
public final class D extends A {}
Can I somehow enforce that no other subclasses of A can ever be created?
| 0 | [
2,
25,
80,
21,
161,
20,
8713,
18346,
2551,
19,
8247,
60,
800,
3726,
3726,
25,
32,
938,
15,
19,
8247,
15,
20,
16525,
30,
21,
718,
57,
21,
1903,
309,
16,
972,
1898,
160,
17,
90,
654,
60,
26,
823,
45,
317,
8502,
718,
21,
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... |
Persisting Printer Settings
===
What is the best way to persist/save printer settings in .Net?
There used to be a bug in .Net 1.1 in the serialization of the `PrinterSetting` object and there were some [workarounds][1] but I'm wondering if there isn't a better or easier way of doing this in the more recent versions of the framework.
The main use case is to allow a user to define, using the standard printer setting user interfaces, all print details (including printer-specific options) for a given printer and have these saved so they get restored the next time the user prints to that printer.
[1]: http://www.codeproject.com/KB/cs/printersettings.aspx | 0 | [
2,
22084,
68,
12925,
12410,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
22084,
118,
19863,
12925,
12410,
19,
13,
9,
2328,
60,
80,
147,
20,
44,
21,
6256,
19,
13,
9,
2328,
137,
9,
165,
19,
14,
5956,
1829,
16,
14,
13,
1,
10299,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are your required software development operation manuals?
===
After reading E-myth Revisited, I realize that I can do a better job at making my company less reliant upon me... I spend a tremendous amount of time answering silly questions (silly to me, but necessary for my developers to get the job done).
I need to write a set of operating manuals for what to do in certain situations...
####For instance:
* How to make a build
* How to write test cases
* How to report status
* How to fix a bug
* How to handle support question A, B, C, etc...
* What to do when you are stalled
* What to do when the power goes out (really, I need to do this)
* etc...
What are some useful, generic operating manuals that you can think of, for a software development company?And please, if you have some good, short, online versions that you know of, please post them. I would much rather use a starter manual and modify it for my needs, than start from scratch. | 0 | [
2,
98,
50,
154,
1390,
2306,
522,
1453,
5132,
18,
60,
800,
3726,
3726,
75,
1876,
13,
62,
8,
915,
96,
26932,
15,
31,
4007,
30,
31,
92,
107,
21,
574,
1205,
35,
544,
51,
237,
787,
13,
29501,
685,
55,
9,
9,
9,
31,
3256,
21,
146... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 toughest bug you ever found and fixed?
===
What made it hard to find? How did you track it down? | 4 | [
2,
98,
22,
18,
14,
6161,
1430,
6256,
42,
462,
216,
17,
3535,
60,
800,
3726,
3726,
98,
117,
32,
552,
20,
477,
60,
184,
144,
42,
792,
32,
125,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Where can I find the Flex source code?
===
I keep hearing that Flex is open source and I figured that a great way to learn about the inner workings would be to look at it. I can easily find the Flex SDK, but I'm wanting to look at the class definitions for the MXML core library (like NumericStepper). Have I misunderstood, or is this kind of thing available somewhere? | 0 | [
2,
113,
92,
31,
477,
14,
14409,
1267,
1797,
60,
800,
3726,
3726,
31,
643,
3229,
30,
14409,
25,
368,
1267,
17,
31,
5700,
30,
21,
374,
161,
20,
2484,
88,
14,
3754,
638,
18,
83,
44,
20,
361,
35,
32,
9,
31,
92,
2351,
477,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best word processing component for .NET
===
I'm looking for a word processing component for .NET that would act like an embedded MS Word in my WinForm/WPF .NET app. The main goal being for users to be able to create rich formatted text. I don't really want to have to write a highly custom RichTextBox component. Any suggestions? | 0 | [
2,
98,
22,
18,
14,
246,
833,
5511,
5912,
26,
13,
9,
2328,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
833,
5511,
5912,
26,
13,
9,
2328,
30,
83,
601,
101,
40,
12138,
4235,
833,
19,
51,
628,
4190,
118,
499,
7721,
13,
9,
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... |
How do I reference an object dynamically?
===
In Javascript, I have an object:
obj = { one: "foo", two: "bar" };
Now, I want do do this
var a = 'two';
if(confirm('Do you want One'))
{
a = 'one';
}
alert(obj.a);
But of course it doesn't work. What would be the correct way of referencing this object dynamically? | 0 | [
2,
184,
107,
31,
2801,
40,
3095,
7782,
1326,
60,
800,
3726,
3726,
19,
8247,
8741,
15,
31,
57,
40,
3095,
45,
5122,
728,
800,
13,
1,
53,
45,
13,
7,
4120,
111,
7,
15,
81,
45,
13,
7,
1850,
7,
13,
1,
73,
130,
15,
31,
259,
107... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best .NET comm component or protocol for very low bandwidth communication?
===
What's the best .NET communication component or protocol for very low bandwidth and intermittently connected communication (i.e.: < 10 kilobits/sec)? | 0 | [
2,
246,
13,
9,
2328,
11951,
5912,
54,
8494,
26,
253,
708,
23392,
3291,
60,
800,
3726,
3726,
98,
22,
18,
14,
246,
13,
9,
2328,
3291,
5912,
54,
8494,
26,
253,
708,
23392,
17,
19667,
102,
2587,
3291,
13,
5,
49,
9,
62,
9,
45,
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,
0,
0,
0,
0,
0,
0,
0... |
How do you get non-technical folks to appreciate a non-UI problem?
===
Suppose you're working on an enterprise project, where you have to get management signoff in order for you to develop a new feature set. Usually your management has no problem signing off on some bright shiney new UI feature but they have a hard time appreciating some behind-the-scenes issues that are crucial to the application's well-being such as transactions, data integrity, workflow routing, configurability, security, etc. Since they're non-technical, it's not obvious to them that this is crucial.
How have you convince them that these infrastructural issues have to be dealt with and that it is important to their business process? | 0 | [
2,
184,
107,
42,
164,
538,
8,
22307,
14563,
20,
8831,
21,
538,
8,
5661,
1448,
60,
800,
3726,
3726,
5787,
42,
22,
99,
638,
27,
40,
6002,
669,
15,
113,
42,
57,
20,
164,
1097,
1676,
1299,
19,
389,
26,
42,
20,
2803,
21,
78,
1580... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Not getting the correct count in SQL
===
I am totally new to SQL. I have a simple select query similar to this:
SELECT COUNT(col1) FROM table1
There are some 120 records in the table and shown on the GUI.
For some reason, this query always returns a number less than the actual count.
Can somebody please help me? | 0 | [
2,
52,
1017,
14,
4456,
2468,
19,
4444,
255,
800,
3726,
3726,
31,
589,
5139,
78,
20,
4444,
255,
9,
31,
57,
21,
1935,
5407,
25597,
835,
20,
48,
45,
5407,
2468,
5,
7771,
165,
6,
37,
859,
165,
80,
50,
109,
6029,
742,
19,
14,
859... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
2D animation in Python
===
I'm writing a simulator in Python, and am curious about options and opinions regarding basic 2D animations. By animation, I'm referring to rendering on the fly, not displaying prerendered images.
I'm currently using matplotlib (Wxagg backend), and it's possible that I'll be able to continue using it, but I suspect it won't be able to sufficiently scale in terms of performance or capabilities.
Requirements are:
- Cross-platform (Linux, MacOS X,
Windows)
- Low complexity overhead
- Plays well with wxpython (at least won't step on each other's toes unduly)
- Interactivity. Detect when objects are clicked on, moused over, etc.
Note that high performance isn't on the list, but the ability to handle ~100 bitmap objects on the screen would be good.
Your thoughts?
| 0 | [
2,
172,
43,
6236,
19,
20059,
800,
3726,
3726,
31,
22,
79,
1174,
21,
24565,
19,
20059,
15,
17,
589,
7686,
88,
6368,
17,
11900,
3467,
2125,
172,
43,
6236,
18,
9,
34,
6236,
15,
31,
22,
79,
7378,
20,
15307,
27,
14,
2855,
15,
52,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
As F# is to C# : <?> is to Java
===
I am looking into F# at the moment and I was wondering if there is or will be a Functional Language which does for the Java Community what F# does for the .NET Community? | 0 | [
2,
28,
398,
5910,
25,
20,
272,
5910,
13,
45,
13,
1,
60,
1,
25,
20,
8247,
800,
3726,
3726,
31,
589,
699,
77,
398,
5910,
35,
14,
688,
17,
31,
23,
5712,
100,
80,
25,
54,
129,
44,
21,
7652,
816,
56,
630,
26,
14,
8247,
514,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... |
Graph Problem: Help find the distance between the two most widely seperated nodes.
===
I'm working through previous years ACM Programming Competition problems trying to get better at solving Graph problems.
The one I'm working on now is I'm given an arbitrary number of undirected graph nodes, their neighbors and the distances for the edges connecting the nodes. What I NEED is the distance between the two farthest nodes from eachother (the weight distance, not by # of nodes away).
Now, I do have Dijkstra's algorithm in the form of:
// Dijkstra's Single-Source Algorithm
private int cheapest(double[] distances, boolean[] visited)
{
int best = -1;
for (int i = 0; i < size(); i++)
{
if (!visited[i] && ((best < 0) || (distances[i] < distances[best])))
{
best = i;
}
}
return best;
}
// Dijkstra's Continued
public double[] distancesFrom(int source)
{
double[] result = new double[size()];
java.util.Arrays.fill(result, Double.POSITIVE_INFINITY);
result[source] = 0; // zero distance from itself
boolean[] visited = new boolean[size()];
for (int i = 0; i < size(); i++)
{
int node = cheapest(result, visited);
visited[node] = true;
for (int j = 0; j < size(); j++)
{
result[j] = Math.min(result[j], result[node] + getCost(node, j));
}
}
return result;
}
With this implementation I can give it a particular node and it will give me a list of all the distances from that node. So, I could grab the largest distance in that list of distances but I can't be sure that any particular node is one of the two furthest ones at either end.
So the only solution I can think of is to run this Dijkstra's algorithm on every node, go through each returned list of distances and looking for the largest distance. After exhausting each node returning it's list of distances I should have the value of the largest distance between any two nodes (the "road" distance between the two most widely seperated villages). There has got to be an easier way to do this because this seems really computationally expensive. Or is this how I should do it?
Here is a sample input for the problem:
Total Nodes: 5
Edges:
Nodes 2 - Connect - Node 4. Distance/Weight 25
Nodes 2 - Connect - Node 5. Distance/Weight 26
Nodes 3 - Connect - Node 4. Distance/Weight 16
Nodes 1 - Connect - Node 4. Distance/Weight 14
The answer to this sample input is "67 miles". Which is the length of the road between the two most widely separated villages.
So should I do it how I described or is there a much simpler and much less computationally expensive way? | 0 | [
2,
7210,
1448,
45,
448,
477,
14,
1583,
128,
14,
81,
127,
2525,
10332,
106,
1669,
16272,
9,
800,
3726,
3726,
31,
22,
79,
638,
120,
1158,
122,
21,
9095,
3143,
1076,
1716,
749,
20,
164,
574,
35,
17533,
7210,
1716,
9,
14,
53,
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... |
Java - Common Gotchas
===
In the same spirit of other platforms, it seemed logical to follow up with this question: What are common non-obvious mistakes in Java? Things that seem like they ought to work, but don't.
I won't give guidelines as to how to structure answers, or what's "too easy" to be considered a gotcha, since that's what the voting is for.
See also:
- [Perl - Common gotchas][1]
- [.NET - Common gotchas][2]
[1]: http://stackoverflow.com/questions/166653/perl-common-gotchas
[2]: http://stackoverflow.com/questions/66117/aspnet-common-gotchas | 4 | [
2,
8247,
13,
8,
757,
330,
1651,
18,
800,
3726,
3726,
19,
14,
205,
2659,
16,
89,
6843,
15,
32,
890,
11545,
20,
1740,
71,
29,
48,
1301,
45,
98,
50,
757,
538,
8,
4995,
1755,
1291,
13623,
19,
8247,
60,
564,
30,
2260,
101,
59,
11... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 possible to query a tree structure table in MySQL in a single query, to any depth?
===
I'm thinking the answer is no, but I'd love it it anybody had any insight into how to crawl a tree structure to any depth in SQL (MySQL), but with a single query
More specifically, given a tree structured table (id, data, data, parent_id), and one row in the table, is it possible to get _all_ descendants (child/grandchild/etc), or for that matter all ancestors (parent/grandparent/etc) without knowing how far down or up it will go, using a single query?
Or is using some kind of recursion require, where I keep querying deeper until there are no new results?
Specifically, I'm using Ruby and Rails, but I'm guessing that's not very relevant.
Thanks in advance for any advice!! | 0 | [
2,
25,
32,
938,
20,
25597,
21,
1541,
1411,
859,
19,
51,
18,
22402,
19,
21,
345,
25597,
15,
20,
186,
5204,
60,
800,
3726,
3726,
31,
22,
79,
1440,
14,
1623,
25,
90,
15,
47,
31,
22,
43,
339,
32,
32,
11181,
41,
186,
9239,
77,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Object-relational mapping: What's the best way to implement getters?
===
##What should happen when I call `$user->get_email_address()`?
###Option 1: Pull the email address from the database on demand
public function get_email_address() {
if (!$this->email_address) {
$this->read_from_database('email_address');
}
return $this->email_address;
}
###Option 2: Pull the email address (and the other User attributes) from the database on object creation
public function __construct(..., $id = 0) {
if ($id) {
$this->load_all_data_from_db($id);
}
}
public function get_email_address() {
return $this->email_address;
}
My basic question is whether it's best to minimize the number of database queries, or whether it's best to minimize the amount of data that gets transferred from the database.
Another possibility is that it's best to load the attributes that you'll need the most / contain the least data at object creation and everything else on demand. | 0 | [
2,
3095,
8,
99,
10832,
192,
13305,
45,
98,
22,
18,
14,
246,
161,
20,
8713,
164,
6052,
60,
800,
3726,
3726,
6926,
5910,
608,
378,
2384,
76,
31,
645,
13,
1,
4403,
16704,
8,
1,
3060,
1,
62,
8079,
1,
27950,
5,
6,
1,
60,
6926,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the real benefits of Visual Studio Team System Database Edition?
===
Interested if anyone has used VSTS Database Edition extensively and, if so, which features did you find the most useful over the standard Visual Studio database projects?
What are the most compelling features as opposed to alternative schema management options or tools like RedGate's SqlCompare etc? | 0 | [
2,
98,
50,
14,
683,
5800,
16,
3458,
1120,
173,
329,
6018,
1322,
60,
800,
3726,
3726,
3158,
100,
1276,
63,
147,
566,
10044,
6018,
1322,
7802,
17,
15,
100,
86,
15,
56,
967,
144,
42,
477,
14,
127,
4811,
84,
14,
1236,
3458,
1120,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
INotifyPropertyChanging and validations: when do I raise PropertyChanging?
===
INotifyPropertyChanged is fairly self explanatory and I think I'm clear on when to raise that one (i.e. when I've finished updating the values).
If I implement INotifyPropertyChanging I'm tending to raise the event as soon as I enter the setter or other method that changes the objects state and then continue with any guards and validations that may occur.
So I'm treating the event as a notification that the property may change but hasn't yet been changed, and might not actually finish changing successfully.
If consumers of the object are using this property (like let's say LINQ to SQL using the event for change tracking) should I be holding off and only raising the event once I have validated that the the values I've been given are good and the state of the object is valid for the change?
What is the contract for this event and what side effects would there be in subscribers? | 0 | [
2,
19,
2779,
8612,
10890,
106,
1084,
22211,
17,
27999,
18,
45,
76,
107,
31,
3972,
1354,
22211,
60,
800,
3726,
3726,
19,
2779,
8612,
10890,
106,
1084,
16229,
43,
25,
6647,
1119,
1396,
9863,
7496,
17,
31,
277,
31,
22,
79,
1207,
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... |
How do I write content to another browser window using Javascript?
===
I've opened a new window with window.open() and I want to use the reference from the window.open() call to then write content to the new window. I've tried copying HTML from the old window to the new window by using myWindow.document.body.innerHTML = oldWindowDiv.innerHTML; but that's doesn't work. Any ideas? | 0 | [
2,
184,
107,
31,
2757,
2331,
20,
226,
16495,
1463,
568,
8247,
8741,
60,
800,
3726,
3726,
31,
22,
195,
520,
21,
78,
1463,
29,
1463,
9,
10157,
5,
6,
17,
31,
259,
20,
275,
14,
2801,
37,
14,
1463,
9,
10157,
5,
6,
645,
20,
94,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I implement the pop out functionality of chat windows in GMail?
===
I'm not looking for a full implementation, I'm more interested in how they do it. I know they use GWT, but I'd like a more low level answer. Naively, I would start by thinking when you click the popout link they simply open a new window and copy content into it. There are lots of reasons why that won't work out well, so I'm wondering if anyone knows or has ideas on how they do this or how it could be done. | 0 | [
2,
184,
92,
31,
8713,
14,
1675,
70,
18548,
16,
6615,
1936,
19,
489,
8079,
60,
800,
3726,
3726,
31,
22,
79,
52,
699,
26,
21,
503,
6123,
15,
31,
22,
79,
91,
3158,
19,
184,
59,
107,
32,
9,
31,
143,
59,
275,
14094,
38,
15,
47,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Export pictures in Microsoft Word to TIFF
===
How to export pictures in Microsoft Word to TIFF file using Visual Studio Tools for Office? I can obtain a reference to the pictures as InlineShape object collection, the hard part now is how to save them as TIFF images. | 0 | [
2,
7487,
3104,
19,
7099,
833,
20,
13,
38,
6021,
800,
3726,
3726,
184,
20,
7487,
3104,
19,
7099,
833,
20,
13,
38,
6021,
3893,
568,
3458,
1120,
4672,
26,
488,
60,
31,
92,
5545,
21,
2801,
20,
14,
3104,
28,
19,
1143,
25096,
3095,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Test cases, "when", "what", and "why"?
===
Being new to test based development, this question has been bugging me. How much is too much? What should be tested, how should it be tested, and why should it be tested? The examples given are in C# with NUnit, but I assume the question itself is language agnostic.
Here are two current examples of my own, tests on a generic list object (being tested with strings, the initialisation function adds three items `{"Foo", "Bar", "Baz"}`):
[Test]
public void CountChanging()
{
Assert.That(_list.Count, Is.EqualTo(3));
_list.Add("Qux");
Assert.That(_list.Count, Is.EqualTo(4));
_list[7] = "Quuuux";
Assert.That(_list.Count, Is.EqualTo(8));
_list.Remove("Quuuux");
Assert.That(_list.Count, Is.EqualTo(7));
}
[Test]
public void ContainsItem()
{
Assert.That(_list.Contains("Qux"), Is.EqualTo(false));
_list.Add("Qux");
Assert.That(_list.Contains("Qux"), Is.EqualTo(true));
_list.Remove("Qux");
Assert.That(_list.Contains("Qux"), Is.EqualTo(false));
}
The code is fairly self-commenting, so I won't go into what's happening, but is this sort of thing taking it too far? `Add()` and `Remove()` and tested seperately of course, so what level should I go to with these sorts of tests? Should I even have these sorts of tests? | 0 | [
2,
1289,
1871,
15,
13,
7,
3185,
7,
15,
13,
7,
608,
7,
15,
17,
13,
7,
2256,
7,
60,
800,
3726,
3726,
142,
78,
20,
1289,
432,
522,
15,
48,
1301,
63,
74,
6256,
2762,
55,
9,
184,
212,
25,
266,
212,
60,
98,
378,
44,
7631,
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... |
Rspec - problems with switching from plugins to gems
===
When dropping the use of rspec and rspec-rails plugins and switching to the gem versions instead, is there anything extra I have to change in spec_helper.rb or something to make the specs in my app see the change?
I can no longer get my specs to run successfully anymore after deleting the plugins and installing the gems (1.1.8).
Any help would be awesome, please forgive my noob-osity. | 0 | [
2,
13,
1224,
12610,
13,
8,
1716,
29,
13027,
37,
10922,
108,
18,
20,
8551,
18,
800,
3726,
3726,
76,
6780,
14,
275,
16,
13,
1224,
12610,
17,
13,
1224,
12610,
8,
7301,
18,
10922,
108,
18,
17,
13027,
20,
14,
8551,
3281,
700,
15,
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... |
What's the best process / app for automated deployment of PHP apps?
===
There's another post on SO relating to .NET -- not us. Pure PHP. Trying to find the best way/process to deploy stable version of our PHP app. I've seen an article on [Capistrano][1], but am curious what else is out there. Aside from the obvious reasons, I'm also looking to add some scripting so that the [SVN rev number gets added in there as well][2].
Much thanks.
[1]: http://www.simplisticcomplexity.com/2006/8/16/automated-php-deployment-with-capistrano/
[2]: http://stackoverflow.com/questions/111436/how-can-i-get-the-svn-revision-number-in-php | 0 | [
2,
98,
22,
18,
14,
246,
953,
13,
118,
4865,
26,
14904,
10475,
16,
13,
26120,
4865,
18,
60,
800,
3726,
3726,
80,
22,
18,
226,
678,
27,
86,
8456,
20,
13,
9,
2328,
13,
8,
8,
52,
182,
9,
4267,
13,
26120,
9,
749,
20,
477,
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 to pacakge Twisted program with py2exe?
===
I tried to package a Twisted program with py2exe, but once I run the exe file I built, I got a "No module named resource" error.
And I found the py2exe said:
> The following modules appear to be missing ['FCNTL', 'OpenSSL', 'email.Generator', 'email.Iterators', 'email.Utils', 'pkg_resources', 'pywintypes', 'resource', 'win32api', 'win32con', 'win32event', 'win32file', 'win32pipe', 'win32process', 'win32security']
So how to solve this problem?
Thanks.
| 0 | [
2,
184,
20,
9049,
1378,
834,
5308,
625,
29,
7103,
135,
1706,
62,
60,
800,
3726,
3726,
31,
794,
20,
6030,
21,
5308,
625,
29,
7103,
135,
1706,
62,
15,
47,
382,
31,
485,
14,
1396,
62,
3893,
31,
392,
15,
31,
330,
21,
13,
7,
251,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Projective transformation
===
Given two image buffers (assume it's an array of ints of size width * height, with each element a color value), how can I map an area defined by a quadrilateral from one image buffer into the other (always square) image buffer? I'm led to understand this is called "projective transformation".
I'm also looking for a general (not language- or library-specific) way of doing this, such that it could be reasonably applied in any language without relying on "magic function X that does all the work for me".
An example: I've written a short program in Java using the Processing library (processing.org) that captures video from a camera. During an initial "calibrating" step, the captured video is output directly into a window. The user then clicks on four points to define an area of the video that will be transformed, then mapped into the square window during subsequent operation of the program. If the user were to click on the four points defining the corners of a door visible at an angle in the camera's output, then this transformation would cause the subsequent video to map the transformed image of the door to the entire area of the window, albeit somewhat distorted.
| 0 | [
2,
669,
1284,
6978,
800,
3726,
3726,
504,
81,
1961,
17497,
18,
13,
5,
9755,
9472,
32,
22,
18,
40,
7718,
16,
19,
38,
18,
16,
1072,
9456,
1637,
2947,
15,
29,
206,
4520,
21,
1665,
1923,
6,
15,
184,
92,
31,
2942,
40,
217,
2811,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I listen on a port (using HttpListener or other .NET code) on Vista without requiring administrator priveleges?
===
I'm using HttpListener to allow a user to set up a proxy on a user-defined port. When I start the HttpListener, I get an exception if the application isn't running under administrator privileges in Vista.
From what I've read, [this is expected behavior][1] - administrator privileges are required to start listening on a port. But I'm sure there are ways around this, as I run plenty of programs (like Skype) which listen on a port without requiring elevation to administrator.
Is there a way to do this with HttpListener? If not, can I make other API calls in .NET code to set up the port?
[1]: https://connect.microsoft.com/VisualStudio/feedback/ViewFeedback.aspx?FeedbackID=93940 | 0 | [
2,
92,
31,
3834,
27,
21,
1295,
13,
5,
12655,
7775,
13891,
106,
54,
89,
13,
9,
2328,
1797,
6,
27,
13520,
366,
9052,
8890,
4566,
195,
6727,
160,
60,
800,
3726,
3726,
31,
22,
79,
568,
7775,
13891,
106,
20,
1655,
21,
4155,
20,
309... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 is the history of the 'run' dialogue saved on Windows XP?
===
I want to write a script which cleans the 'run' dialogue automatically every log off. Where is the history stored? | 0 | [
2,
113,
25,
14,
447,
16,
14,
13,
22,
3169,
22,
6402,
4377,
27,
1936,
23045,
60,
800,
3726,
3726,
31,
259,
20,
2757,
21,
3884,
56,
2745,
18,
14,
13,
22,
3169,
22,
6402,
7499,
352,
6738,
168,
9,
113,
25,
14,
447,
8214,
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... |
How do I base64 encode a string using Excel VBA?
===
I need to encode a string as base64 in VBA. Are there any built-in functions or COM objects available which will do this? | 0 | [
2,
184,
107,
31,
1000,
3470,
20523,
21,
3724,
568,
20700,
566,
969,
60,
800,
3726,
3726,
31,
376,
20,
20523,
21,
3724,
28,
1000,
3470,
19,
566,
969,
9,
50,
80,
186,
392,
8,
108,
3719,
54,
13,
960,
3916,
904,
56,
129,
107,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
View MS Access Report in .net ReportViewer control
===
Is it possible to view an MS Access report in the .Net ReportViewer control? | 0 | [
2,
1418,
4235,
1381,
1330,
19,
13,
9,
2328,
1330,
4725,
106,
569,
800,
3726,
3726,
25,
32,
938,
20,
1418,
40,
4235,
1381,
1330,
19,
14,
13,
9,
2328,
1330,
4725,
106,
569,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
how to do string conversions in objective c?
===
I want to convert a string into a double and after doing some math on it, convert it back to a string.
How do I do this in objective-c?
Is there a way to round a double to the nearest integer too?
Thanks! | 0 | [
2,
184,
20,
107,
3724,
6263,
18,
19,
7038,
272,
60,
800,
3726,
3726,
31,
259,
20,
8406,
21,
3724,
77,
21,
1494,
17,
75,
845,
109,
5057,
27,
32,
15,
8406,
32,
97,
20,
21,
3724,
9,
184,
107,
31,
107,
48,
19,
7038,
8,
150,
60... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where can I find some good information about how the new canvas HTML element works?
===
I keep reading about how great this new Canvas element for HTML5 is and I see amazing demos done with just javascript and no flash. Where can I find some good information on how to some of these things myself? | 0 | [
2,
113,
92,
31,
477,
109,
254,
676,
88,
184,
14,
78,
9696,
13,
15895,
4520,
693,
60,
800,
3726,
3726,
31,
643,
1876,
88,
184,
374,
48,
78,
9696,
4520,
26,
13,
15895,
264,
25,
17,
31,
196,
5289,
19494,
677,
29,
114,
8247,
8741,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JUnit Eclipse plugin source-code?
===
I'm looking into writing an Eclipse plugin for FlexUnit and was wondering where I could get the sources for the JUnit Eclipse plugin. I checked the JUnit sources at sourceforge but couldn't spot any code that looked like the plugin code.
Any idea where this code is available? | 0 | [
2,
7446,
242,
11652,
10922,
108,
1267,
8,
9375,
60,
800,
3726,
3726,
31,
22,
79,
699,
77,
1174,
40,
11652,
10922,
108,
26,
14409,
15464,
17,
23,
5712,
113,
31,
110,
164,
14,
2662,
26,
14,
7446,
242,
11652,
10922,
108,
9,
31,
650... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Any scrubyt command that clicks a link returns a 403 Forbidden Error
===
I'm trying to use Scrubyt to navigate around a website, but whenever I use it to click any links it gives me 403 Forbidden errors. The website doesn't require logins or anything so I don't understand this. Might it need some kind of session variable, or the right UserAgent string. Any idea how I might fix this? | 0 | [
2,
186,
13371,
93,
38,
1202,
30,
10840,
18,
21,
3508,
4815,
21,
13,
25821,
11369,
7019,
800,
3726,
3726,
31,
22,
79,
749,
20,
275,
13371,
93,
38,
20,
20782,
140,
21,
2271,
15,
47,
6634,
31,
275,
32,
20,
10840,
186,
6271,
32,
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... |
What is a reasonable size for an iPhone App?
===
I'm wondering what's a reasonable size for iPhone Apps. Right now I'm working on an iPhone game, and of course it loads fast into my device since I'm connected directly to it through a USB cable, but I've no idea how long it would actually take to download from the App Store.
In my case it's about 2mb in size, which is reasonable for a desktop or even a flash game, but I've no idea if this is reasonable size for the iPhone.
My other concern is what's the non-wifi download limit of the App Store? Occasionally there are Apps that won't download unless you've got a wifi connection. And personally I've never downloaded such apps, since it gives me a bad impression. So I'd definitely want to stay below that limit.
Also since I'm already asking about app sizes, it would be probably be useful to collect good sizes for other types of apps as well.
Thanks! | 0 | [
2,
98,
25,
21,
9954,
1072,
26,
40,
21024,
4865,
60,
800,
3726,
3726,
31,
22,
79,
5712,
98,
22,
18,
21,
9954,
1072,
26,
21024,
4865,
18,
9,
193,
130,
31,
22,
79,
638,
27,
40,
21024,
250,
15,
17,
16,
674,
32,
19069,
1512,
77,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you handle cookies with webrequest/response as in a proxy?
===
How do you handle cookies and with webrequest/response as in a proxy?
I'm not sure how to do this...or if i even can.
C#.Net3.5 | 0 | [
2,
184,
107,
42,
3053,
19396,
29,
2741,
99,
10351,
118,
99,
18,
8782,
870,
28,
19,
21,
27188,
60,
800,
3726,
3726,
184,
107,
42,
3053,
19396,
17,
29,
2741,
99,
10351,
118,
99,
18,
8782,
870,
28,
19,
21,
27188,
60,
31,
22,
79,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Choosing a new language
===
I've been programming now for 30 years, BASIC, various assemblers, FORTH, Pascal, C and C++ in that order. I haven't learnt a new language in over a decade because from a work perspective C++ does everything I need. However, from a technology perspective, I'd like to bring my skills up to date, particularly in the areas of web development and use of scripting languages that let you do alot without too much programming. The languages I'm considering are Python, Ruby, Java and Haskell. In my position which would you go for and why.
- One language per answer please, qualified with solid reasons rather than personal preferences.
- If you can add a small canonical code sample of something the language does much neater than C++ that would be great.
- Downsides of your chosen language would also be appreciated. | 0 | [
2,
10883,
21,
78,
816,
800,
3726,
3726,
31,
22,
195,
74,
3143,
130,
26,
712,
122,
15,
2125,
15,
617,
13,
13736,
1224,
15,
5882,
15,
18661,
15,
272,
17,
272,
20512,
19,
30,
389,
9,
31,
2933,
22,
38,
2484,
38,
21,
78,
816,
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... |
Using the .NET Framework security system
===
I was wondering - do any of you actually use the various classes in the System.Security.Permissions namespace? I mainly develop desktop/server-side components (i.e., no web) and the general assumption is that FullTrust is always available and no testing is performed on environments for which this is not the case. Apart from MS source code (EnterpriseLibrary and such), I have yet to see actual, in-use source code that makes use of said constructs.
Is this prevalent, or are we the exception? I know, of course, that not doing this kind of testing is a problem on our side... | 0 | [
2,
568,
14,
13,
9,
2328,
6596,
1221,
329,
800,
3726,
3726,
31,
23,
5712,
13,
8,
107,
186,
16,
42,
1121,
275,
14,
617,
2684,
19,
14,
329,
9,
17749,
9,
1432,
12385,
18,
204,
5582,
60,
31,
2011,
2803,
17404,
118,
10321,
106,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to prevent a script form running simultaneously?
===
I want to prevent my script running more than once at a time.
My current approach is
- create a semaphore file containing the pid of the running process
- read the file, if my process-id is not in it exit (you never know...)
- at the end of the processing, delete the file
In order to prevent the process from hanging, I set up a cron job to periodically check the file if its older then the maximum allowed running time and kills the process if it’s still running.
Is there a risk that I'm killing a wrong process?
Is there a better way to perform this as a whole?
-Thanks!
| 0 | [
2,
184,
20,
2501,
21,
3884,
505,
946,
6888,
60,
800,
3726,
3726,
31,
259,
20,
2501,
51,
3884,
946,
91,
119,
382,
35,
21,
85,
9,
51,
866,
2141,
25,
13,
8,
1600,
21,
13,
18,
5996,
11093,
62,
3893,
3503,
14,
13,
11031,
16,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When should I use a List vs a LinkedList
===
When is it better to use a List(Of T) vs a LinkedList(Of T)? | 0 | [
2,
76,
378,
31,
275,
21,
968,
4611,
21,
4727,
5739,
800,
3726,
3726,
76,
25,
32,
574,
20,
275,
21,
968,
5,
1041,
13,
38,
6,
4611,
21,
4727,
5739,
5,
1041,
13,
38,
6,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What to include in a beginner's programming book?
===
As a follow-up to my [previous question][1], what sort of information should I make sure to include in a tutorial book and what should I avoid? In other words, what would you have liked to have known when first starting with Python or wxPython?
Right now I am just planning on restructing the tutorials I have already created and other editing tasks. But I want to make sure that I cover topics that are important for a beginning programmer while eliminating fluff and "too advanced" topics. Space is not an issue since it will be an ebook.
[1]: http://stackoverflow.com/questions/166468/is-it-worthwile-to-write-a-programming-tutorial-book | 0 | [
2,
98,
20,
468,
19,
21,
26931,
22,
18,
3143,
360,
60,
800,
3726,
3726,
28,
21,
1740,
8,
576,
20,
51,
636,
3515,
1755,
1291,
1301,
500,
2558,
165,
500,
15,
98,
2058,
16,
676,
378,
31,
233,
562,
20,
468,
19,
21,
29724,
360,
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... |
Mock testing and PHP's magic __get method
===
I'm having problems when trying to mock objects with __get and __set methods (using [simpletest][1]).
Writing mock responses for __get doesn't smell right - the tests seem too tightly tied to implementation. Any recommendations for testing, or should I just avoid the magic methods completely ?
[1]: http://simpletest.org/ | 0 | [
2,
10506,
4431,
17,
13,
26120,
22,
18,
2154,
13,
1,
3060,
2109,
800,
3726,
3726,
31,
22,
79,
452,
1716,
76,
749,
20,
10506,
3916,
29,
13,
1,
3060,
17,
13,
1,
3554,
3195,
13,
5,
12655,
636,
24629,
10543,
500,
2558,
165,
500,
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... |
What is your experience with auditing features (Oracle)?
===
Did you ever use Oracle auditing features on a production db?
How did that impact on performances, and are there differences you noticed between different versions of Oracle?
| 0 | [
2,
98,
25,
154,
1496,
29,
13471,
68,
967,
13,
5,
6055,
5615,
6,
60,
800,
3726,
3726,
144,
42,
462,
275,
15759,
13471,
68,
967,
27,
21,
637,
13,
9007,
60,
184,
144,
30,
2261,
27,
3200,
15,
17,
50,
80,
4921,
42,
2711,
128,
421... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Can you load the FLVPlayback skin SWF in another directory?
===
Per this [Adobe KB tech note][1] is there any way around having to place the FLVPlayback skin SWF in same directory as HTML file the container SWF is loaded from? It pains me to have to put a SWF in my site's root directory.
I think loading the Flash video in an iframe would solve this problem, but is that a good practice? I generally shy away from using iframes because of padding, margin, and sizing issues between browsers. Maybe that's not an issue anymore with CSS.
[1]: http://kb.adobe.com/selfservice/viewContent.do?externalId=608abffd | 0 | [
2,
92,
42,
6305,
14,
398,
8916,
5438,
1958,
1188,
13,
18,
15263,
19,
226,
16755,
60,
800,
3726,
3726,
416,
48,
636,
5672,
863,
15251,
6145,
1945,
500,
2558,
165,
500,
25,
80,
186,
161,
140,
452,
20,
209,
14,
398,
8916,
5438,
195... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
FCKeditor vs TinyMCE and XHTML Compliance
===
I'm after (short) opinions on FCKeditor vs TinyMCE and whether either or both are XHTML compliant.
In the interest of keeping with the spirit of stackoverflow, if someone has already made your point, just upvote them.
Thanks in advance. | 0 | [
2,
2644,
197,
13401,
4611,
3228,
79,
1105,
17,
993,
15895,
14969,
800,
3726,
3726,
31,
22,
79,
75,
13,
5,
10849,
6,
11900,
27,
2644,
197,
13401,
4611,
3228,
79,
1105,
17,
1472,
694,
54,
156,
50,
993,
15895,
13,
25509,
9,
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... |
How to remove only the parent element and not its child elements in JavaScript?
===
Let's say:
<div>
some text
<div class="remove-just-this">
<p>foo</p>
<p>bar</p>
some text node here
</div>
some text
</div>
to this:
<div>
some text
<p>foo</p>
<p>bar</p>
some text node here
some text
</div>
I've been figuring out using Mootools, jQuery and even (raw) JavaScript, but couldn't get the idea how to do this. | 0 | [
2,
184,
20,
4681,
104,
14,
4766,
4520,
17,
52,
82,
850,
2065,
19,
8247,
8741,
60,
800,
3726,
3726,
408,
22,
18,
395,
45,
13,
1,
12916,
1,
109,
1854,
13,
1,
12916,
718,
3726,
7,
99,
16598,
8,
2759,
8,
1565,
7,
1,
13,
1,
306... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Please comment on this simple licensing schema
===
I was asked go implement a licensing schema for our product, they are very expensive products with few customers sparse around the world and basically every one of them has a design environment (a windows application installed on single windows machines, from 1 to 150 client machines for each customer) and a web server that hosts production environment (1 to 8 machines for each customer). Our product are licensed for server usage so customer can use any number of client, we've decided not to license the server part (because it's subjected to SLA agreements) but only the client, because, after some time without capability to use the client the system becomes basically useless.<br/>Basic assumption is that the customer is "honest enough" and only thing we would like to cover is stopping the client design environment if not properly licensed with a time expiration license.<br/><br/> I've evaluated different licensing product and they are or too expensive or too difficult to manage, so I've come up with this simple solution:
- The license will be a simple signed XML file, signed using the standard XML Signature feature of w3c, using a private key that will be given to the admin departmend on a USB key, if they loose of copy it then the licensing schema will fail but it will be their fault
- The client will open the license file on startup and check its validity using a public key embedded in the binaries
- If license XML is valid and the data in it (expiration date and product name) are correct than the designer work, if not appropriate message will be shown
Any idea about possible problems or how to improve the scenario?
| 0 | [
2,
2247,
6484,
27,
48,
1935,
15038,
23874,
800,
3726,
3726,
31,
23,
411,
162,
8713,
21,
15038,
23874,
26,
318,
2374,
15,
59,
50,
253,
5381,
1985,
29,
310,
5279,
23162,
140,
14,
126,
17,
11374,
352,
53,
16,
105,
63,
21,
704,
2307... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Your SCRUM definition of Done
===
While SCRUM is easy in theory and hard in practice, I wanted to hear your definition of Done; i.e. what are the gates (unit test, code coverage > 80%, code reviews, load tests, perf.test, functional tests, etc.) your product has to go through before you can label the product "Done" | 0 | [
2,
154,
26562,
5465,
16,
677,
800,
3726,
3726,
133,
26562,
25,
2010,
19,
1639,
17,
552,
19,
1345,
15,
31,
417,
20,
990,
154,
5465,
16,
677,
73,
31,
9,
62,
9,
98,
50,
14,
5596,
13,
5,
15464,
1289,
15,
1797,
5245,
13,
1,
15254... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In PHP will a session be created if a browser is not used
===
I have an API that is dependent on certain state information between requests. As an easy first version of the code, I am simply using PHP session's to store the state information instead of something more advanced (APC, memcache, DB). Throughout my initial testing in a web browser, everything worked perfectly. However, it seems that when clients try to connect through non-browser methods such as Curl or wget, the state information is not being preserved.
Will a PHP session only be created if a browser is requesting the page? I am explicitly starting the session with session_start() as well as naming it before hand with session_name(). | 0 | [
2,
19,
13,
26120,
129,
21,
3723,
44,
679,
100,
21,
16495,
25,
52,
147,
800,
3726,
3726,
31,
57,
40,
21,
2159,
30,
25,
9063,
27,
1200,
146,
676,
128,
12279,
9,
28,
40,
2010,
64,
615,
16,
14,
1797,
15,
31,
589,
1659,
568,
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... |
What factors that degrade the performance of a SQL Server 2000 Job?
===
We are currently running a SQL Job that archives data daily at every 10PM. However, the end users complains that from 10PM to 12, the page shows a time out error.
Here's the pseudocode of the job
while @jobArchive = 1 and @countProcecessedItem < @maxItem
exec ArchiveItems @countProcecessedItem out
if error occured
set @jobArchive = 0
The ArchiveItems stored procedure grabs the top 100 item that was created 30 days ago, process and archive them, and sets the @countProcecessedItem with the number of item processed. The ArchiveItems creates and deletes temporary tables.
**Note:** if the information I've provide is incomplete, reply and I'll gladly add more information if possible.
| 0 | [
2,
98,
4776,
30,
121,
8031,
14,
956,
16,
21,
4444,
255,
8128,
824,
1205,
60,
800,
3726,
3726,
95,
50,
871,
946,
21,
4444,
255,
1205,
30,
8111,
1054,
1954,
35,
352,
332,
5576,
9,
207,
15,
14,
241,
3878,
15310,
18,
30,
37,
332,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 would you simplfy Entering and Exiting a ReaderWriterLock?
===
This seems very noisy to me. Five lines of overhead is just too much.
m_Lock.EnterReadLock()
Try
Return m_List.Count
Finally
m_Lock.ExitReadLock()
End Try
So how would you simply this?
| 0 | [
2,
184,
83,
42,
22862,
9641,
93,
4604,
17,
24999,
21,
7765,
9657,
3966,
60,
800,
3726,
3726,
48,
2206,
253,
22729,
20,
55,
9,
355,
1560,
16,
8860,
25,
114,
266,
212,
9,
307,
1,
3966,
9,
13679,
10647,
3966,
5,
6,
1131,
788,
307... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Good inflection library for PHP?
===
I'm looking for a good inflection (or well, a library that can turn plural into singular and vice verse - which a kind of inflection) library for PHP, it could be a part of some current framework or a stand alone library the only requirement I have is that it's compatible with the MIT license. | 0 | [
2,
254,
19,
4372,
20842,
1248,
26,
13,
26120,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
254,
19,
4372,
20842,
13,
5,
248,
134,
15,
21,
1248,
30,
92,
805,
13981,
77,
12217,
17,
1821,
7573,
13,
8,
56,
21,
825,
16,
19,
4372... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Decent profiler for Windows?
===
Does windows have any decent sampling (eg. non-instrumenting) profilers available? Preferably something akin to Shark on MacOS, although i am willing to accept that i am going to have to pay for such a profiler on windows.
I've tried the profiler in VS Team Suite and was not overly impressed, and was wondering if there were any other good ones. | 0 | [
2,
12238,
5296,
139,
26,
1936,
60,
800,
3726,
3726,
630,
1936,
57,
186,
12238,
19030,
13,
5,
5431,
9,
538,
8,
108,
11602,
1130,
68,
6,
5296,
1224,
904,
60,
6369,
4801,
301,
21,
1767,
20,
11635,
27,
1572,
759,
15,
419,
31,
589,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ActiveX events between aparmetns
===
Environment: VS2008 (ATL), Borland Developer Studio 2006.
Hello all.
I have some troubles with ActiveX control events.
Here is a brief description of the my app architecture:
There is inproc COM server which contains STA ActiveX control (aka control) and MTA COM object (aka object). Here is IDL definition of the control and object interfaces:
[
object,
uuid(2338CCAF-BBAF-4E29-929B-A67285B1E772),
dual,
nonextensible,
pointer_default(unique)
]
interface IObject : IDispatch{
[id(1)] HRESULT DoWork(void);
};
[
object,
uuid(1A0A1DA2-E33B-4DF4-99A9-9EAEF2281E7D),
dual,
nonextensible,
pointer_default(unique)
]
interface IControl : IDispatch{
};
[
uuid(BC27FABD-2794-4F9C-B3BD-C0C0628741FA),
version(1.0),
helpstring("AVRep 1.0 Type Library")
]
library ActiveXLib
{
importlib("stdole2.tlb");
[
uuid(4B5575A7-E0FF-49B5-AE10-0D980CF49EB3)
]
dispinterface _IControlEvents
{
properties:
methods:
[id(1)] HRESULT SomeEvent([in] IObject* obj);
};
[
uuid(7C44F19E-6B71-434B-96F6-E29A3C66C794),
control
]
coclass Control
{
[default] interface IControl;
[default, source] dispinterface _IControlEvents;
};
[
uuid(17BDFAC0-DF21-4474-BCFF-846FE0075D68)
]
coclass Object
{
[default] interface IObject;
};
};
Client is a Delphi application with ActiveX control on the form which creates MTA object and calls its DoWork method
var
mta : IObject;
begin
mta := CreateOleObject('ActiveXLib.Object.1') as IObject;
mta.DoWork();
end;
This method directly calls Fire_SomeEvent method of ActiveX control coclass and passes 'this' as a parameter (pointer to IObject interface). Delphi code successfully receives event but when it tries to access any IObject method or property (not shown in idl for simplicity) then access violation occured in oleaut32.dll.
One important note - I use ATLCPImplMT class to implement event firing from different threads (see http://support.microsoft.com/kb/280512 for details). This implementation allows to switch apartments when event fires (from MTA apartment of the object to STA Delphi forms apartment). I suggest that this problem is related to incorrect event parameter marshaling because when standard ATLCPImpl class is used all works fine.
Is there any restrictions for crossapartments events? Maybe some special Delphi environment setup is requeired to work with activex objects correctly... | 0 | [
2,
1348,
396,
963,
128,
21,
3574,
5909,
2172,
800,
3726,
3726,
2307,
45,
4611,
2753,
13,
5,
721,
255,
6,
15,
3895,
618,
10058,
1120,
592,
9,
10975,
65,
9,
31,
57,
109,
16615,
29,
1348,
396,
569,
963,
9,
235,
25,
21,
2698,
5318... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 would you simply Monitor.TryEnter
===
This is even worse than the ReaderWriterLock in terms of noise.
If Threading.Monitor.TryEnter(syncRoot) Then
Try
'do something
Finally
Threading.Monitor.Exit(syncRoot)
End Try
Else
'do something else
End If
Both C# and VB solutions are welcome. | 0 | [
2,
184,
83,
42,
1659,
7626,
9,
5840,
13679,
800,
3726,
3726,
48,
25,
166,
3105,
119,
14,
7765,
9657,
3966,
19,
1663,
16,
3406,
9,
100,
9322,
68,
9,
2111,
242,
248,
9,
5840,
13679,
5,
9507,
150,
14032,
6,
94,
1131,
13,
22,
537,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Anyway to group RadioButtons generated from the ItemTemplate of an ItemsControl
===
<DataTemplate x:Key="Genre_DataTemplate">
<RadioButton GroupName="One" Content="{Binding...
</DataTemplate>
Above code is the ItemTemplate of my ItemsControl, I want all the Radiobuttons instantiated should behave as if it is in a group, I know the reason because the generated RadioButtons are not adjacent in the visualtree.
Any solution or workaround to group them together?. GroupName property also doesn't have any effect here. | 0 | [
2,
2774,
20,
214,
603,
811,
444,
18,
6756,
37,
14,
9101,
9577,
6554,
16,
40,
3755,
12898,
800,
3726,
3726,
13,
1,
18768,
9577,
6554,
993,
45,
4237,
3726,
7,
1863,
99,
1,
18768,
9577,
6554,
7,
1,
13,
1,
11129,
811,
444,
214,
72... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 utilities can provide database hits/duration per page?
===
SQL Server profiler is great for profiling SQL Server performance for web apps. However, when I'm testing my webapp I'd like a summary of database hits/duration **per page**.
Does anybody know of any utilities for giving you this kind of information? | 0 | [
2,
98,
19817,
92,
1181,
6018,
3858,
118,
10852,
857,
416,
2478,
60,
800,
3726,
3726,
4444,
255,
8128,
5296,
139,
25,
374,
26,
8721,
49,
802,
4444,
255,
8128,
956,
26,
2741,
4865,
18,
9,
207,
15,
76,
31,
22,
79,
4431,
51,
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... |
What are the differences between using the New keyword and calling CreateObject in Excel VBA?
===
What criteria should I use to decide whether I write VBA code like this:
Set xmlDocument = New MSXML2.DOMDocument
or like this:
Set xmlDocument = CreateObject("MSXML2.DOMDocument")
? | 0 | [
2,
98,
50,
14,
4921,
128,
568,
14,
78,
1246,
9587,
17,
2555,
1600,
23793,
19,
20700,
566,
969,
60,
800,
3726,
3726,
98,
9157,
378,
31,
275,
20,
4073,
1472,
31,
2757,
566,
969,
1797,
101,
48,
45,
309,
23504,
28132,
800,
78,
4235,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 create an X++ bacth job in Axapta 3.0?
===
I'd like to create a batch job in X++ for Microsoft Axapta 3.0 (Dynamics AX).
How can I create a job which executes an X++ function like this one?
static void ExternalDataRead(Args _args)
{
...
}
| 0 | [
2,
184,
20,
1600,
40,
993,
20512,
11099,
96,
1205,
19,
21,
6791,
21741,
203,
9,
387,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
1600,
21,
13064,
1205,
19,
993,
20512,
26,
7099,
21,
6791,
21741,
203,
9,
387,
13,
5,
20985,
18,
21... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Adding gdb to MinGW
===
I've gone to http://sourceforge.net/project/showfiles.php?group_id=2435, downloaded the Automated MinGW Installer for MinGW 5.1.4 and at the same time the GNU Source-Level Debugger Release Candidate: GDB 6.8-3. I've then installed MinGW base tools into C:\MinGW. No problem so far.
However when I come to install the gdb debugger it has a lot of files and folders with the same names as some already installed but the files are different to those already installed. e.g C:\MinGW\include\bfd.h is 171 KB but gdb-6.8-mingw-3\include\bfd.h is 184 KB.
How do I add gdb to MinGW without breaking what's already installed?
| 0 | [
2,
4721,
489,
9007,
20,
12069,
499,
800,
3726,
3726,
31,
22,
195,
1042,
20,
7775,
6903,
12097,
1106,
834,
9,
2328,
118,
21011,
118,
9303,
16877,
18,
9,
26120,
60,
8024,
1,
1340,
3726,
1996,
2599,
15,
23887,
14,
14904,
12069,
499,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 get other people to contribute to the project Wiki
===
We have a distributed team working on a midsized project, with me currently being the only technical person involved. At the beginning of the project we had a discussion on what to use for project documentation and we agreed on a wiki.
We are now a couple of months into this project and still nobody except me has put any actual content into the wiki. As usual Word documents are being sent around with some sometimes being uploaded or not even that.
When deploying new software I usually spearhead things by just using the new tool and basically 'eating my own dogfood' but in this case I am not the one that can contribute and I don't really want to sit down and convert other peoples Word docs into Wiki format.
How do you educate people about the use of the wiki and how do you get them to use it ? | 4 | [
2,
184,
107,
42,
164,
89,
148,
20,
8606,
20,
14,
669,
13,
17375,
800,
3726,
3726,
95,
57,
21,
4387,
173,
638,
27,
21,
907,
6560,
669,
15,
29,
55,
871,
142,
14,
104,
2447,
840,
1013,
9,
35,
14,
997,
16,
14,
669,
95,
41,
21,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What rare programming tools do you use?
===
What tools do you use that may be considered rare in that aspect that you have only seen a few people use it? It may be any tool that may be valuable for programmers.
I myself use UPX on occasions. | 0 | [
2,
98,
2890,
3143,
4672,
107,
42,
275,
60,
800,
3726,
3726,
98,
4672,
107,
42,
275,
30,
123,
44,
724,
2890,
19,
30,
7289,
30,
42,
57,
104,
541,
21,
310,
148,
275,
32,
60,
32,
123,
44,
186,
5607,
30,
123,
44,
5940,
26,
17968,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
what are strategies for shielding off web resources based on business logic
===
I have a scenario where I'm not really sure my approach is the best one, and I would appreciate feedback / suggestions.
scenario:
I have a bunch of flash based (swf) 'modules' which are hosted in my aspnet application. Each flash has it's own directory on the filesystem, which contains assets for the flash. Consider this simplified site structure:
*/webapp/index.aspx
/webapp/flash/flash1/flash.swf
/webapp/flash/flash1/someimage.jpg
/webapp/flash/flash1/someclip.mp3
/webapp/flash/flash2/flash.swf
/webapp/flash/flash2/someimage.jpg
/webapp/flash/flash2/someclip.mp3*
etcetera
where the naming convention is */webapp/flash/flash[ID]/*
I want to implement a security mechanism which checks whether the user should be allowed access* to the files in the subfolder '[ID]' and it's contents.
**insert business logic based on information stored in a SQL database here*
I was considering writing a HttpModule which does something like
ProcessRequest(){
if(Request.RawUrl.Contains("/webapp/flash") && !userHasValidLicenseForModule(1)){
Redirect("login.aspx");
}
}
But there's the drawback that HttpModule only works for file extension which are mapped to aspnet (in IIS6). That means I would have to map all possible extensions to that process (.mp3, .jpg etc) which is something I would rather avoid.
I was also considering to use a HttpHandler instead, but the flash file needs to be able to link to it's resources using relative URLs. (so a proxy-like pattern like /webapp/getprotectedstuff.ashx?file=flash1234/flash.swf is not prefered)
Perhaps it's wiser to store the flash files and assets outside of the web root completely. Perhaps there are other strategies I havent thought of.
Use aspnet security and write a custom membership provider?
Any thoughts? | 0 | [
2,
98,
50,
10272,
26,
4179,
68,
168,
2741,
2566,
432,
27,
508,
7085,
800,
3726,
3726,
31,
57,
21,
12705,
113,
31,
22,
79,
52,
510,
562,
51,
2141,
25,
14,
246,
53,
15,
17,
31,
83,
8831,
13111,
13,
118,
18389,
9,
12705,
45,
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... |
Benefits of using a Case statement over an If statement in a stored procedure?
===
Hi are there any pros / cons relating to the speed that a stored procedure executes when using an IF statement or choosing to use a CASE statement instead? | 0 | [
2,
5800,
16,
568,
21,
610,
3331,
84,
40,
100,
3331,
19,
21,
8214,
7004,
60,
800,
3726,
3726,
4148,
50,
80,
186,
895,
18,
13,
118,
11608,
8456,
20,
14,
1362,
30,
21,
8214,
7004,
15644,
18,
76,
568,
40,
100,
3331,
54,
10883,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
"How do I add the interactive user to a directory in a localized Windows"?
===
How do I add both the Swedish interactive user,
NT INSTANS\INTERAKTIV
and the English interactive user,
NT AUTHORITY\INTERACTIVE
and any other localised user group with **write** permissions to a program folder's ACL?
Is this question actually "How do I use **secureObject**"? I cannot use the **LockPermissions Table** because I undestand inheritance is removed. **secureObject** permissions seem to require **CreateDirectory** rather than **Directory**... | 0 | [
2,
13,
7,
1544,
107,
31,
3547,
14,
9194,
4155,
20,
21,
16755,
19,
21,
24821,
1936,
7,
60,
800,
3726,
3726,
184,
107,
31,
3547,
156,
14,
3061,
9194,
4155,
15,
13,
2877,
19,
6114,
18,
1,
6280,
25813,
710,
17,
14,
486,
9194,
4155... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 run a script with a custom action - simplest possible example?
===
Newbie WiX question: How do I
1. Copy a single-use shell script to temp along with the installer
e.g.
<Binary Id='permissions.cmd' src='permissions.cmd'/>
2. Find and run that script at the end of the install.
e.g.
<CustomAction Id='SetFolderPermissions' BinaryKey='permissions.cmd'
ExeCommand='permissions.cmd' Return='ignore'/>
<InstallExecuteSequence>
<Custom Action="SetFolderPermissions" Sequence='1'/>
</InstallExecuteSequence>
I think I have at least three problems:
* I can't find **permissions.cmd** to run it - do I need **[TEMPDIR]permissions.cmd** or something?
* My **Sequence** comes too soon, before the program is installed.
* I need **cmd /c permissions.cmd** somewhere in here, probably near **ExeCommand**?
In this example **permissions.cmd** uses **cacls.exe** to add the interactive user with write permissions to the **%ProgramFiles%\Vendor** ACL. I could also use **secureObject** - that question is **["How do I add the interactive user to a directory in a localized Windows"?][1]**
[1]: http://stackoverflow.com/questions/170140/how-do-i-add-the-interactive-user-to-a-directory-in-a-localized-windows | 0 | [
2,
184,
20,
485,
21,
3884,
29,
21,
5816,
1028,
13,
8,
24384,
938,
823,
60,
800,
3726,
3726,
78,
5893,
4807,
396,
1301,
45,
184,
107,
31,
137,
9,
4344,
21,
345,
8,
3699,
3593,
3884,
20,
13,
9577,
303,
29,
14,
16146,
106,
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... |
Prevent users from starting multiple accounts?
===
I know that in the end it, can't be done.
But, what are the options to:
a) limit the options for persons to create multiple accounts,
b) increase the chance of detecting multiple accounts / person
for a blog-like web service?
(people can sign up for their own blog)
| 0 | [
2,
2501,
3878,
37,
1422,
1886,
5310,
60,
800,
3726,
3726,
31,
143,
30,
19,
14,
241,
32,
15,
92,
22,
38,
44,
677,
9,
47,
15,
98,
50,
14,
6368,
20,
45,
279,
13502,
3401,
73,
21,
6,
4496,
14,
6368,
26,
4280,
20,
1600,
1886,
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... |
Debugging javascript in IE?
===
Is there a better way to debug JavaScript than MS Script Editor? Like FireBug, but not like FireBug Lite.
Thanks, | 0 | [
2,
121,
16254,
2762,
8247,
8741,
19,
13,
660,
60,
800,
3726,
3726,
25,
80,
21,
574,
161,
20,
121,
16254,
8247,
8741,
119,
4235,
3884,
1835,
60,
101,
535,
16254,
15,
47,
52,
101,
535,
16254,
13,
10601,
9,
3669,
15,
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... |
JQuery templating engines
===
I am looking for a template engine to use client side. I have been trying a few like jsRepeater and jQuery Templates. While they seem to work OK in FireFox they all seem to break down in IE7 when it comes down to rendering HTML tables.
I also took a look at MicrosoftAjaxTemplates.js (from http://www.codeplex.com/aspnet/Release/ProjectReleases.aspx?ReleaseId=16766) but turns ou that has the same problem.
Any advice on other templating engines to use? | 0 | [
2,
487,
8190,
93,
13,
9577,
255,
1880,
4016,
800,
3726,
3726,
31,
589,
699,
26,
21,
22894,
1406,
20,
275,
6819,
270,
9,
31,
57,
74,
749,
21,
310,
101,
487,
18,
99,
306,
9834,
17,
487,
8190,
93,
22894,
18,
9,
133,
59,
2260,
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... |
Looping over elements in jQuery
===
I want to loop over the elements of an HTML form, and store the values of the <input> fields in an object. The following code doesn't work, though:
function config() {
$("#frmMain").children().map(function() {
var child = $("this");
if (child.is(":checkbox"))
this[child.attr("name")] = child.attr("checked");
if (child.is(":radio, checked"))
this[child.attr("name")] = child.val();
if (child.is(":text"))
this[child.attr("name")] = child.val();
return null;
});
Any hints on how to do this correctly? | 0 | [
2,
5293,
68,
84,
2065,
19,
487,
8190,
93,
800,
3726,
3726,
31,
259,
20,
5293,
84,
14,
2065,
16,
40,
13,
15895,
505,
15,
17,
1718,
14,
4070,
16,
14,
279,
255,
38,
73,
108,
4881,
1569,
263,
38,
73,
2861,
19,
40,
3095,
9,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Set a database value to null with a SqlCommand + parameters
===
I was previously taught today how to set parameters in a SQL query in .NET in this answer ([click][1]).
Using parameters with values are fine, but when I try to set a field in the database to null I'm unsuccessful. Either the method thinks I am not setting a valid parameter or not specifying a parameter.
e.g.
Dim dc As New SqlCommand("UPDATE Activities SET [Limit] = @Limit WHERE [Activity] = @Activity", cn)
If actLimit.ToLower() = "unlimited" Then
' It's not nulling :(
dc.Parameters.Add(New SqlParameter("Limit", Nothing))
Else
dc.Parameters.Add(New SqlParameter("Limit", ProtectAgainstXSS(actLimit)))
End If
Is there something I'm missing? Am I doing it wrong?
[1]: http://stackoverflow.com/questions/169359/improving-code-readability-for-sql-commands#169369 | 0 | [
2,
309,
21,
6018,
1923,
20,
16203,
29,
21,
4444,
255,
16239,
2754,
12905,
800,
3726,
3726,
31,
23,
1343,
2359,
786,
184,
20,
309,
12905,
19,
21,
4444,
255,
25597,
19,
13,
9,
2328,
19,
48,
1623,
13,
5,
2558,
150,
10129,
500,
2558... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you make Flash not render an object on the Stage?
===
This discussion started [over here][1] but I thought it would be nice to have a definitive answer...
So let's say you have MovieClip on the Stage (or a UIComponent for the Flex audience) - what do you have to do to not make it so that the user can't see the object but also so that the AVM2 doesn't even factor it in when rendering the stage for the user?
I always thought the answer was to set `visible = false` but there is an argument out there that the object has to placed outside the boundaries of the Stage (like `x = 2000` which seems like a hack IMO). Does anyone know the real answer?
[1]: http://stackoverflow.com/questions/155084/flash-rendering-optimisation-tips-and-tricks | 0 | [
2,
184,
107,
42,
233,
4433,
52,
16535,
40,
3095,
27,
14,
876,
60,
800,
3726,
3726,
48,
5460,
373,
636,
2549,
235,
500,
2558,
165,
500,
47,
31,
289,
32,
83,
44,
2210,
20,
57,
21,
15676,
1623,
9,
9,
9,
86,
408,
22,
18,
395,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Forward Thinking Systems Design
===
Have you ever worked on a long term project which is designed for hardware; which under currently cost prohibitive, yet is projected to be cost effective in say five years? | 0 | [
2,
917,
1440,
1242,
704,
800,
3726,
3726,
57,
42,
462,
577,
27,
21,
175,
981,
669,
56,
25,
1006,
26,
7610,
73,
56,
131,
871,
1516,
895,
8630,
49,
6142,
15,
768,
25,
12454,
20,
44,
1516,
3140,
19,
395,
355,
122,
60,
3,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to improve garbage collection performance?
===
What kind of optimization patterns can be used to improve the performance of the garbage collector?
My reason for asking is that I do a lot of embedded software in Compact Framework. On slow devices the garbage collection can become a problem, and I would like to reduce the times the garbage collector kicks in, and when it does, I want it to finish quicker. I can also see that working with the garbage collector instead of against it could help improve any .NET or Java application, especially heavy duty web applications.
Here are some of my thoughts, but I haven’t done any benchmark.
* resuing temporary classes/arrays (keep down allocation count)
* keeping the amount of live objects to a minimum (faster collections)
* try to use structs instead of classes
| 0 | [
2,
184,
20,
3545,
15024,
1206,
956,
60,
800,
3726,
3726,
98,
825,
16,
21597,
6282,
92,
44,
147,
20,
3545,
14,
956,
16,
14,
15024,
10836,
60,
51,
1215,
26,
3379,
25,
30,
31,
107,
21,
865,
16,
12138,
2306,
19,
8285,
6596,
9,
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... |
Hashes of Hashes Idiom in Ruby?
===
I frequently want to create hashes of hashes in Ruby so that I can do two dimensional lookups more easily. However, upon inserting I don't always want to first check if the first index already exists in the hash. For example:
h = Hash.new
h['x'] = Hash.new if not h.key?('x')
h['x']['y'] = value_to_insert
I would rather just be able to do the following and have the creation of the new Hash be taken care of automatically:
h = Hash.new
h['x']['y'] = value_to_insert
Similarly, when I'm looking up a value, and the first index doesn't already exist, I would like nil to be returned automatically rather than receiving an undefined method for '[]' error.
looked_up_value = h['w']['z']
I realize that I could create my own Hash wrapper class that has this behavior, but I am wondering if a Ruby idiom for this already exists. | 0 | [
2,
63,
438,
18,
16,
63,
438,
18,
28380,
19,
10811,
60,
800,
3726,
3726,
31,
3086,
259,
20,
1600,
63,
438,
18,
16,
63,
438,
18,
19,
10811,
86,
30,
31,
92,
107,
81,
13,
7865,
361,
15699,
91,
2351,
9,
207,
15,
685,
14692,
68,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 is coding so slow?
===
Is it only me, or is coding getting slower and slower, until a product("a project") is finished?
This question came to me as I saw the ["Write a program in 30 minutes"][1]:
I thought it is impossible to write a *descent* piece of code which runs smoothly.
As I am getting older I see on all projects, even simple ones a lot of additional work, to get them into a state where everybody can use them. So you need a lot of error-catching, UI-Design, even texts, so your app can communicate with endusers.
Back in the old days(around 1985) it was possible to build something usable in some weeks, maybe months. Today You will spend at least a **man-year** for developing an robust application which performs a nontrivial task.
Of course, the complexity has increased, but I am just worried about **the scaling of application complexity regarding to development time**.
[1]: http://stackoverflow.com/questions/157319/do-you-have-a-hobby-development-project | 0 | [
2,
483,
25,
13,
15458,
86,
2276,
60,
800,
3726,
3726,
25,
32,
104,
55,
15,
54,
25,
13,
15458,
1017,
14085,
17,
14085,
15,
163,
21,
2374,
5,
7,
58,
669,
7,
6,
25,
842,
60,
48,
1301,
281,
20,
55,
28,
31,
441,
14,
636,
7,
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... |
Should Programmers be Able to Write Clearly?
===
I read Richard P. Gabriel's book "Patterns of Software" ([pdf][1]) which contains an essay called "Writing Broadside" in which he contends that programmers should develop their ability to write clearly. I have found that his suggestions have definitely improved my ability to write tech. spec's and design documents.
One of his suggestions is to develop writing workshops at work. That this will help improve your ability to express yourself clearly when documenting your designs.
We already have a system where, one a week, a team member gives a [Pecha Kucha][2] talk on any topic to help improve our ability to give presentations.
So I'm thinking of suggesting the writing workshops as well.
Does anyone have writing workshops at their place of work?
> "A man who has the knowledge but lacks the power clearly to express it is no better off than if he never had any ideas at all." - [Thucydides][3]
[1]: http://www.dreamsongs.com/Files/PatternsOfSoftware.pdf
[2]: http://en.wikipedia.org/wiki/Pecha_Kucha
[3]: http://en.wikipedia.org/wiki/Thucydides | 0 | [
2,
378,
17968,
18,
44,
777,
20,
2757,
2885,
60,
800,
3726,
3726,
31,
1302,
1098,
351,
9,
4337,
22,
18,
360,
13,
7,
5972,
8766,
18,
16,
2306,
7,
13,
5,
2558,
11124,
500,
2558,
165,
500,
6,
56,
1588,
40,
8474,
227,
13,
7,
1264... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Errors when trying to update ruby gems from 2.0.1
===
I am trying to set myself up on a mac to learn Ruby on Rails, however I seem to be having some problems. If I try to run commands such as ./script/server, i get this:
Rails requires RubyGems >= 0.9.4 (you have 0.9.2). Please `gem update --system` and try again.
When I run "gem update.." I get this:
Updating RubyGems...
Attempting remote update of rubygems-update
ERROR: While executing gem ... (Errno::EACCES)
Permission denied - /opt/local/lib/ruby/gems/1.8/cache/rubygems-update-1.3.0.gem
Any ideas how I can solve this? | 0 | [
2,
11908,
76,
749,
20,
11100,
10811,
8551,
18,
37,
172,
9,
387,
9,
165,
800,
3726,
3726,
31,
589,
749,
20,
309,
992,
71,
27,
21,
1572,
20,
2484,
10811,
27,
2240,
18,
15,
207,
31,
2260,
20,
44,
452,
109,
1716,
9,
100,
31,
113... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 features of Perl6 are you the most excited about?
===
Perl6 has really shaped up in terms of which features we can expect to see implemented in the final language, when it comes. Some of them are already available through **Perl6** modules for Perl5 from CPAN. So which featurs are most compelling, exciting, nifty, eagerly awaited, etc.?
Please try to limit yourself to one feature per answer. | 4 | [
2,
98,
967,
16,
416,
255,
379,
50,
42,
14,
127,
7178,
88,
60,
800,
3726,
3726,
416,
255,
379,
63,
510,
9733,
71,
19,
1663,
16,
56,
967,
95,
92,
4186,
20,
196,
6807,
19,
14,
426,
816,
15,
76,
32,
1624,
9,
109,
16,
105,
50,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# Generic Class with "specialized" constructor
===
I have a class like the following:
public class DropDownControl<T, Key, Value> : BaseControl
where Key: IComparable
{
private IEnumerable<T> mEnumerator;
private Func<T, Key> mGetKey;
private Func<T, Value> mGetValue;
private Func<Key, bool> mIsKeyInCollection;
public DropDownControl(string name, IEnumerable<T> enumerator, Func<T, Key> getKey, Func<T, Value> getValue, Func<Key, bool> isKeyInCollection)
: base(name)
{
mEnumerator = enumerator;
mGetKey = getKey;
mGetValue = getValue;
mIsKeyInCollection = isKeyInCollection;
}
And I want to add an convenience function for Dictionaries (because they support all operations efficiently on there own).
But the problem is that such a constructor would only specify Key and Value but not T directly, but T is just KeyValuePair<Key, Value>. Is there a way to tell the compiler for this constructor T is KeyValuePair<Key, Value>, like:
public DropDownControl<KeyValuePair<Key, Value>>(string name, IDictionary<Key, Value> dict) { ... }
Currently i use a static Create function as workaround, but I would like a direct constructor better.
public static DropDownControl<KeyValuePair<DKey, DValue>, DKey, DValue> Create<DKey, DValue>(string name, IDictionary<DKey, DValue> dictionary)
where DKey: IComparable
{
return new DropDownControl<KeyValuePair<DKey, DValue>, DKey, DValue>(name, dictionary, kvp => kvp.Key, kvp => kvp.Value, key => dictionary.ContainsKey(key));
}
| 0 | [
2,
272,
5910,
12733,
718,
29,
13,
7,
11118,
1333,
7,
6960,
248,
800,
3726,
3726,
31,
57,
21,
718,
101,
14,
249,
45,
317,
718,
2804,
2968,
12898,
1,
38,
15,
1246,
15,
1923,
1,
13,
45,
1000,
12898,
113,
1246,
45,
31,
960,
3574,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
USB Driver Development on a Mac using Python
===
I would like to write a driver to talk to my Suunto t3 watch in Python on a Mac. My day job is doing basic web work in C# so my familiarity with Python and developing on a Mac is limited.
Can you suggest how one would start doing driver development in general and then more specifically on a Mac. I.e. how to easily see what data is being transmitted to the device? I have Python 2.5 (MacPorts) up and running. | 0 | [
2,
182,
220,
2425,
522,
27,
21,
1572,
568,
20059,
800,
3726,
3726,
31,
83,
101,
20,
2757,
21,
2425,
20,
930,
20,
51,
2538,
1020,
262,
13,
38,
240,
1455,
19,
20059,
27,
21,
1572,
9,
51,
208,
1205,
25,
845,
2125,
2741,
170,
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... |
Change Sound (or other) System Preferences in Mac OS X
===
I'd like to be able to switch the sound output source in Mac OS X without any GUI interaction.
There are tools to do control the sound output, such as [SoundSource][1] and an [applescript to open the preferences dialog][2].
What I am looking for is something that switches the preference instantly, like [SoundSource][3] but it has to be scriptable. The goal is to switch between my digital and analog output with one keystroke. I have a [helper application][4] that will launch a program or applescript on one keypress. All I need now is the applescript or application that switches the sound source quickly without any user interaction.
I'm willing to write some Objective-C if that is what it takes, but I'm pretty much a newbie at Cocoa development.
Do you have a one-click solution or can point me to a good tutorial on controlling sound system preferences from a Cocoa App or command line?
[1]: http://rogueamoeba.com/freebies/
[2]: http://www.macosxhints.com/article.php?story=20050614171126634
[3]: http://rogueamoeba.com/freebies/
[4]: http://www.blacktree.com/?quicksilver | 0 | [
2,
753,
646,
13,
5,
248,
89,
6,
329,
9808,
18,
19,
1572,
13,
759,
993,
800,
3726,
3726,
31,
22,
43,
101,
20,
44,
777,
20,
5521,
14,
646,
5196,
1267,
19,
1572,
13,
759,
993,
366,
186,
9457,
7754,
9,
80,
50,
4672,
20,
107,
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... |
"Code covered" vs. "Code tested"?
===
Converting my current code project to TDD, I've noticed something.
class Foo {
public event EventHandler Test;
public void SomeFunction() {
//snip...
Test(this, new EventArgs());
}
}
There are two dangers I can see when testing this code and relying on a code coverage tool to determine if you have enough tests.
- You should be testing if the `Test` event gets fired. Code coverage tools alone won't tell you if you forget this.
- I'll get to the other in a second.
To this end, I added an event handler to my startup function so that it looked like this:
Foo test;
int eventCount;
[Startup] public void Init() {
test = new Foo();
// snip...
eventCount = 0;
test.Test += MyHandler;
}
void MyHandler(object sender, EventArgs e) { eventCount++; }
Now I can simply check `eventCount` to see how many times my event was called, if it was called. Pretty neat. Only now we've let through an insidious little bug that will never be caught by any test: namely, `SomeFunction()` doesn't check if the event has any handlers before trying to call it. This will cause a null dereference, which will never be caught by any of our tests because they all have an event handler attached by default. But again, a code coverage tool will still report full coverage.
This is just my "real world example" at hand, but it occurs to me that plenty more of these sorts of errors can slip through, even with 100% 'coverage' of your code, this still doesn't translate to 100% tested. Should we take the coverage reported by such a tool with a grain of salt when writing tests? Are there other sorts of tools that would catch these holes? | 0 | [
2,
13,
7,
9375,
1363,
7,
4611,
9,
13,
7,
9375,
7631,
7,
60,
800,
3726,
3726,
19583,
51,
866,
1797,
669,
20,
15596,
43,
15,
31,
22,
195,
2711,
301,
9,
718,
4310,
111,
13,
1,
317,
807,
807,
3203,
1252,
1289,
73,
317,
11364,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Seeing project dependancies from MSBuild
===
Is there a mode, some switch or a programmatic way that I can ask MSBuild to display or output it's calculated dependencies for a given build file?
**Some background** -
I have a large project that requires splitting up to speed up the build time and want to remove the slow changing infrastructure code into it's own release area. Not all of the information is contained in the build file itself, as some sub-projects are referenced by their vcproj or csproj files.
I'd really like to see what MSBuild thinks needs doing (either worse-case [rebuild all] and perhaps for a make) without actually doing the rebuild. | 0 | [
2,
2078,
669,
12547,
210,
10807,
37,
4235,
29361,
800,
3726,
3726,
25,
80,
21,
3740,
15,
109,
5521,
54,
21,
625,
6732,
161,
30,
31,
92,
1349,
4235,
29361,
20,
3042,
54,
5196,
32,
22,
18,
10785,
29411,
26,
21,
504,
1895,
3893,
60... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Executing a stored procedure within a stored procedure
===
I would like to execute a stored procedure within a stored procedure eg
EXEC SP1
BEGIN
EXEC SP2
END
But I only want SP1 to finish after SP2 has finished running so I need to find a way for SP1 to wait for SP2 to finish before SP1 ends.
Thanks | 0 | [
2,
25836,
21,
8214,
7004,
363,
21,
8214,
7004,
800,
3726,
3726,
31,
83,
101,
20,
15644,
21,
8214,
7004,
363,
21,
8214,
7004,
12369,
1396,
3319,
3782,
165,
2348,
1396,
3319,
3782,
135,
241,
47,
31,
104,
259,
3782,
165,
20,
2106,
75... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Django signals vs. overriding save method
===
I'm having trouble wrapping my head around this. Right now I have some models that looks kind of like this:
def Score(models.Model)
review = models.ManyToManyField(Review)
question = models.TextField()
grade = models.IntegerField()
def Review(models.Model)
...fields...
overall_score = models.FloatField(blank=True)
A Review is has several "scores", the overall_score is the average of the scores. When a review or a score is saved, I need to recalculate the overall_score average. Right now I'm using a overridden save method. Would there be any benefits to using Django's signal dispatcher? | 0 | [
2,
3857,
14541,
7616,
4611,
9,
84,
5175,
68,
2079,
2109,
800,
3726,
3726,
31,
22,
79,
452,
2572,
13437,
51,
157,
140,
48,
9,
193,
130,
31,
57,
109,
2761,
30,
1879,
825,
16,
101,
48,
45,
6312,
1618,
5,
13998,
18,
9,
13998,
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... |
What are the performance improvement of Sequential Guid over standard Guid?
===
Has someone ever measured performance of Sequential Guid vs. Standard Guid when used as Primary Keys inside a database?
| 0 | [
2,
98,
50,
14,
956,
6984,
16,
1353,
5495,
10107,
9457,
43,
84,
1236,
9457,
43,
60,
800,
3726,
3726,
63,
737,
462,
7160,
956,
16,
1353,
5495,
10107,
9457,
43,
4611,
9,
1236,
9457,
43,
76,
147,
28,
1256,
5534,
572,
21,
6018,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
confluence experiences?
===
We're considering moving from trac to [Atlassian Confluence](http://www.atlassian.com/software/confluence/) as our knowledge base solution. ("We" are a growing IT consulting company, so most users are somewhat technical.)
There are many reasons we're looking for an alternative to trac: ACL, better wiki refactoring tools (Move/rename, Delete (retaining history), What links here, Attachments, easier way to track changes, etc.), "templates"/"macros", WYSIWYG/Word integration.
Confluence looks to be very nice from the feature list POV. But toying with it for a little I had the impression that its interface may seem somewhat confusing to the new users (and I recently saw [a comment to that effect on SO](http://stackoverflow.com/questions/170101/how-do-you-get-other-people-to-contribute-to-the-project-wiki#170133)). I hope that can be fixed by installing/creating a simpler skin, though.
If you've used Confluence, what are your thoughts on it?
* Do you agree it's not as easy to use as other software, can anything be done about it?
* What are its other shortcomings?
* Would you choose a different wiki if you had another chance?
| 4 | [
2,
15238,
5513,
60,
800,
3726,
3726,
95,
22,
99,
5154,
1219,
37,
13,
38,
5797,
20,
636,
721,
4830,
10760,
15238,
500,
5,
21127,
6903,
6483,
9,
721,
4830,
10760,
9,
960,
118,
12980,
5011,
118,
1126,
12848,
2940,
118,
6,
28,
318,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 write to a log from mod_python under apache?
===
I seem to only be able to write to the Apache error log via stderr. Anyone know of a more structured logging architecture that I could use from my python web project, like commons? | 0 | [
2,
184,
107,
31,
2757,
20,
21,
6738,
37,
7226,
1,
6448,
11570,
131,
17140,
60,
800,
3726,
3726,
31,
2260,
20,
104,
44,
777,
20,
2757,
20,
14,
17140,
7019,
6738,
1197,
354,
1157,
139,
9,
1276,
143,
16,
21,
91,
17784,
13,
13919,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Excel detect inactivity
===
I want to take an action in an Excel workbook macro after a period of inactivity (hide/protect some worksheets). What is the best/simplest way to achieve this?
| 0 | [
2,
20700,
9092,
19,
19348,
800,
3726,
3726,
31,
259,
20,
247,
40,
1028,
19,
40,
20700,
170,
5199,
9069,
75,
21,
620,
16,
19,
19348,
13,
5,
19522,
118,
16265,
109,
170,
17627,
18,
6,
9,
98,
25,
14,
246,
118,
24629,
384,
161,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How Do You Get Time to Document Existing Systems?
===
We have a large system that processes logs from a very large web site. By large I mean a site that has more than 300,000 updates per day. Yes. Per day!
I've just finished an update to this system to correct a bug. Part of the problem doing the work was a lack of documentation for the system. Most questions were met with "Ask Andre, he'll know." or "Andre will know that." That is, our [truck number][1] is dangerously low, i.e. one!
This leads to such pointy-haired discussions as:
> PHB: Why did the stats work take so long?
> Me: Because there's hardly any documentation.
> PHB: What are you doing now?
> Me: Updating our TWiki to document the parts of stats system that I worked on.
> PHB: There's no time for that. Start working on the code for the new SLA measurements.
> Me: But, but.
I'm sure others have been in such an infinite loop.
I want to convince the "powers that be" of the good business logic of spending some time documenting the system?
Any suggestions as to what I should highlight? Especially while the "bits that I know about" are still fresh in my mind.
cheers,
Rob
[1]: http://everything2.com/index.pl?node_id=1543370 | 0 | [
2,
184,
107,
42,
164,
85,
20,
4492,
3149,
1242,
60,
800,
3726,
3726,
95,
57,
21,
370,
329,
30,
5102,
18893,
37,
21,
253,
370,
2741,
689,
9,
34,
370,
31,
884,
21,
689,
30,
63,
91,
119,
3565,
15,
3993,
16779,
416,
208,
9,
1643... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 tomcat 5.5 treat .jsp and .jspx files in the same way?
===
I'm working on a java web-application, trying to be xml-friendly and writing my jsp files using the jspx/xml syntax. It took me hours of dissecting examples and configuration files to find out that with tomcat 5.5 files using the new syntax should end in .jspx, or tomcat won't translate tag libraries and stuff.
Both file extensions map to the same servlet in tomcat's configuration file, so I thought everything was fine with my .jsp files. Am I missing something? | 0 | [
2,
630,
2067,
5782,
331,
9,
264,
5752,
13,
9,
728,
3401,
17,
13,
9,
728,
3401,
396,
6488,
19,
14,
205,
161,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
8247,
2741,
8,
2552,
20669,
15,
749,
20,
44,
23504,
8,
15950,
17,
1174... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 thread functions need to be declared as '__cdecl'?
===
Sample code that shows how to create threads using MFC declares the thread function as both static and `__cdecl`. Why is the latter required? Boost threads don't bother with this convention, so is it just an anachronism?
For example (MFC):
static __cdecl UINT MyFunc(LPVOID pParam)
{
...
}
CWinThread* pThread = AfxBeginThread(MyFunc, ...);
Whereas Boost:
static void func()
{
...
}
boost::thread t;
t.create(&func);
(the code samples might not be 100% correct as I am nowhere near an IDE).
What is the point of __cdecl? How does it help when creating threads? | 0 | [
2,
483,
107,
9322,
3719,
376,
20,
44,
2482,
28,
13,
22,
1,
150,
546,
5316,
22,
60,
800,
3726,
3726,
5717,
1797,
30,
1285,
184,
20,
1600,
20396,
568,
307,
7061,
10123,
18,
14,
9322,
1990,
28,
156,
12038,
17,
13,
1,
150,
546,
53... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Fast fourier transform in c#
===
Where can I find a free, very quick, and reliable implementation of FFT in C#?
Can be used in a product? or are there any restrictions? | 0 | [
2,
1512,
222,
1944,
8007,
19,
272,
5910,
800,
3726,
3726,
113,
92,
31,
477,
21,
551,
15,
253,
2231,
15,
17,
11398,
6123,
16,
13,
2460,
38,
19,
272,
5910,
60,
92,
44,
147,
19,
21,
2374,
60,
54,
50,
80,
186,
9245,
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,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Maven: Missing: org.apache.maven.wagon:wagon-ftp:jar:1.0-rc1-SNAPSHOT
===
I'm new to Maven so I may be missing something obvious, but
I've got a maven project and when I try to "mvn package" this project it fails with
ERROR BUILD ERROR INFO
------------------------------------------------------------------------ [INFO] Failed to resolve artifact.
Missing:
---------- 1) org.apache.maven.wagon:wagon-ftp:jar:1.0-rc1-SNAPSHOT
Try downloading the file manually from the project website.
Then, install it using the command:
mvn install:install-file -DgroupId=org.apache.maven.wagon -DartifactId=wagon-ftp -Dversion=1.0-rc1-SNAPSHOT -Dpackaging=ja r -Dfile=/path/to/file
Alternatively, if you host your own repository you can deploy the file there:
mvn deploy:deploy-file -DgroupId=org.apache.maven.wagon -DartifactId=wagon-ftp -Dversion=1.0-rc1-SNAPSHOT -Dpackaging=jar
-Dfile=/path/to/file -Durl=[url] -DrepositoryId=[id]
Path to dependency:
1) com.cgs:domain:jar:1.0-SNAPSHOT
2) org.apache.maven.wagon:wagon-ftp:jar:1.0-rc1-SNAPSHOT
----------
1 required artifact is missing.
for artifact: com.cgs:domain:jar:1.0-SNAPSHOT
from the specified remote repositories: ibiblio.org (http://mirrors.ibiblio.org/pub/mirrors/maven2)
The first thing I don't understand is the version it requires 1.0-rc1-SNAPSHOT. [The projects' site](http://maven.apache.org/wagon/wagon-providers/wagon-ftp/project-info.html) says the current version is 1.0-*beta*-5. And I suppose [beta goes *before* RC](http://en.wikipedia.org/wiki/Software_release_life_cycle).
Anyway, I've tried to download the latest wagon-ftp JAR (1.0 beta 6 jar) and deploy it according to the instructions in the error message.
But guess what, this gave me the same error. | 0 | [
2,
1216,
3124,
45,
2863,
45,
13,
5583,
9,
7738,
2569,
9,
540,
3124,
9,
14609,
218,
45,
14609,
218,
8,
3072,
306,
45,
6300,
45,
165,
9,
387,
8,
5453,
165,
8,
18,
325,
306,
7868,
800,
3726,
3726,
31,
22,
79,
78,
20,
1216,
3124... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Scrubyt gives 404 Error when clicking link using _details method
===
This might be a similar problem to my earlier two questions - see [here][1] and [here][2] but I'm trying to use the _detail command to automatically click the link so I can scrape the details page for each individual event.
The code I'm using is:
require 'rubygems'
require 'scrubyt'
nuffield_data = Scrubyt::Extractor.define do
fetch 'http://www.nuffieldtheatre.co.uk/cn/events/event_listings.php'
event do
title 'The Coast of Mayo'
link_url
event_detail do
dates "1-4 October"
times "7:30pm"
end
end
next_page "Next Page", :limit => 20
end
nuffield_data.to_xml.write($stdout,1)
Is there any way to print out the URL that using the event_detail is trying to access? The error doesn't seem to give me the URL that gave the 404.
[1]: http://stackoverflow.com/questions/169934/any-scrubyt-command-that-clicks-a-link-returns-a-403-forbidden-error
[2]: http://stackoverflow.com/questions/168868/how-to-get-next-page-link-with-scrubyt | 0 | [
2,
13371,
93,
38,
2352,
13,
23397,
7019,
76,
25590,
3508,
568,
13,
1,
546,
8682,
18,
2109,
800,
3726,
3726,
48,
530,
44,
21,
835,
1448,
20,
51,
1201,
81,
2346,
13,
8,
196,
636,
6836,
500,
2558,
165,
500,
17,
636,
6836,
500,
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... |
Do you know what may cause memory leaks in JavaScript?
===
Do you know what may cause memory leaks in JavaScript? | 0 | [
2,
107,
42,
143,
98,
123,
1679,
1912,
11724,
18,
19,
8247,
8741,
60,
800,
3726,
3726,
107,
42,
143,
98,
123,
1679,
1912,
11724,
18,
19,
8247,
8741,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
HowTO: Parse the UnistallString reg entry
===
In `HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\` is the list of installed programs in my machine (at least most of them).
There, there's a String Value called UninstallString which has what you need to run in order to uninstall the program.
The thing is not every installer writes the same kind of info, yet Windows knows how to parse that string to run the uninstaller.
My questions are: does anybody know how to parse that string?, meaning what are the possible values it might get? and if not, where can I find that kind of info? I googled around with no luck, I guess I'm not looking for the right terms. | 0 | [
2,
184,
262,
45,
2017,
870,
14,
9911,
21300,
11130,
7953,
2792,
800,
3726,
3726,
19,
13,
1,
252,
4237,
1,
15580,
1,
20442,
1,
12980,
5011,
1,
22019,
12980,
1,
27508,
18,
1,
17657,
10898,
1,
1020,
108,
21300,
1,
25,
14,
968,
16,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Python 3 performance?
===
No doubt most people have read all about the various incompatible changes that are going into Python 3, so on a question of just performance, how does python 3 compare to python 2.x? | 0 | [
2,
20059,
203,
956,
60,
800,
3726,
3726,
90,
3063,
127,
148,
57,
1302,
65,
88,
14,
617,
19,
20049,
1693,
30,
50,
228,
77,
20059,
203,
15,
86,
27,
21,
1301,
16,
114,
956,
15,
184,
630,
20059,
203,
11590,
20,
20059,
172,
9,
396,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Stored procedure not being executed within another stored procedure
===
I have found that SP2 doesn't execute from within SP1 when SP1 is executed.
Below is the structure of SP1:
ALTER PROCEDURE SP1 AS BEGIN
Declare c1 cursor....
open c1 fetch next from c1 ...
while @@fetch_status = 0 Begin
...
Fetch Next from c1 end
close c1
deallocate c1
exec sp2
end | 0 | [
2,
8214,
7004,
52,
142,
5557,
363,
226,
8214,
7004,
800,
3726,
3726,
31,
57,
216,
30,
3782,
135,
1437,
22,
38,
15644,
37,
363,
3782,
165,
76,
3782,
165,
25,
5557,
9,
1021,
25,
14,
1411,
16,
3782,
165,
45,
7835,
7004,
3782,
165,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.