unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Why override operator() ??
===
In the Boost Signals library they are overloading the () operator.
Is this a convention in c++? For callbacks etc?
I have seen this in code of a co-worker (who happens to be a big Boost fan). Of all the boost goodness out there this has only led to confusion for me.
Any insight ... | 0 | [
2,
483,
84,
11891,
6022,
5,
6,
13,
60,
60,
800,
3726,
3726,
19,
14,
10419,
7616,
1248,
59,
50,
84,
16866,
14,
13,
5,
6,
6022,
9,
25,
48,
21,
3087,
19,
272,
20512,
60,
26,
645,
1958,
18,
2722,
60,
31,
57,
541,
48,
19,
1797,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there C# look-alike for Linux?
===
Is there C# look-alike for Linux? | 0 | [
2,
25,
80,
272,
5910,
361,
8,
58,
1403,
26,
13024,
60,
800,
3726,
3726,
25,
80,
272,
5910,
361,
8,
58,
1403,
26,
13024,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Some help understanding "yield"
===
In my everlasting quest to suck less I keep bumping into the "yield" statement.
I have tried to wrap my head around it a few times now, but I'm stumped every time with the same error.
It goes a little something like this:
> The body of [someMethod] cannot be an iterator bl... | 0 | [
2,
109,
448,
3260,
13,
7,
93,
8487,
43,
7,
800,
3726,
3726,
19,
51,
462,
8558,
68,
7769,
20,
8466,
787,
31,
643,
9797,
68,
77,
14,
13,
7,
93,
8487,
43,
7,
3331,
9,
31,
57,
794,
20,
8118,
51,
157,
140,
32,
21,
310,
436,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to resize a container div to the total height of its children?
===
I have a container element of varying height and which I need to resize as it's contents change. At the moment I am doing the following but I'd be please to find a less laborious alternative:
<div id="container">
<div id="main">vari... | 0 | [
2,
184,
20,
302,
10454,
21,
12147,
13,
12916,
20,
14,
600,
2947,
16,
82,
391,
60,
800,
3726,
3726,
31,
57,
21,
12147,
4520,
16,
9852,
2947,
17,
56,
31,
376,
20,
302,
10454,
28,
32,
22,
18,
8478,
753,
9,
35,
14,
688,
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... |
What does your team do to stand out?
===
Where I work, we have small teams of 2 - 5 people. As a dev lead, what are some things that you've implemented which makes your team stand out from the others? Meaning, it makes the others teams say, "that's cool" or "why didn't we think of that". Just some thinking out of t... | 0 | [
2,
98,
630,
154,
173,
107,
20,
1261,
70,
60,
800,
3726,
3726,
113,
31,
170,
15,
95,
57,
284,
952,
16,
172,
13,
8,
331,
148,
9,
28,
21,
9664,
672,
15,
98,
50,
109,
564,
30,
42,
22,
195,
6807,
56,
1364,
154,
173,
1261,
70,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why does setting a property on a C# enumeration not "keeping"
===
I know a lot about C# but this one is stumping me and Google isn't helping.
I have an IEnumerable range of objects. I want to set a property on the first one. I do so, but when I enumerate over the range of objects after the modification, I don't s... | 0 | [
2,
483,
630,
2697,
21,
1354,
27,
21,
272,
5910,
26940,
872,
52,
13,
7,
15880,
7,
800,
3726,
3726,
31,
143,
21,
865,
88,
272,
5910,
47,
48,
53,
25,
15781,
68,
55,
17,
8144,
2532,
22,
38,
3713,
9,
31,
57,
40,
13,
660,
6336,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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: packing an ip address as a ctype.c_ulong() for use with DLL
===
given the following code:
import ctypes
ip="192.168.1.1"
thisdll = ctypes.cdll['aDLL']
thisdll.functionThatExpectsAnIP(ip)
how can I correctly pack this for a DLL that expects it as a c_ulong datatype?
I've tried u... | 0 | [
2,
20059,
45,
16683,
40,
15735,
3218,
28,
21,
272,
4474,
9,
150,
1,
291,
2701,
5,
6,
26,
275,
29,
13,
43,
211,
800,
3726,
3726,
504,
14,
249,
1797,
45,
9010,
272,
4474,
18,
15735,
3726,
7,
19532,
9,
13434,
9,
165,
9,
165,
7,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Creating web forms from a database schema
===
I'm wondering if there are any applications, preferably freeware, that can take a database configuration, and, with as little hassle as possible, create web forms for inserting data easily.
I'm finding it hard to express exactly what it is I'm after. Maybe I can talk a... | 0 | [
2,
2936,
2741,
1997,
37,
21,
6018,
23874,
800,
3726,
3726,
31,
22,
79,
5712,
100,
80,
50,
186,
3767,
15,
6369,
4801,
551,
5011,
15,
30,
92,
247,
21,
6018,
8091,
15,
17,
15,
29,
28,
265,
63,
18,
413,
28,
938,
15,
1600,
2741,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
how to watch FS for change
===
I'm doing a project in a course at my university on distributed systems. I'm planning on creating something similar to Dropbox ( getdropbox.com ), but with some sort of non-centralized peer-to-peer twist to it. For this i need some method of detecting change in a directory structure. How... | 0 | [
2,
184,
20,
1455,
398,
18,
26,
753,
800,
3726,
3726,
31,
22,
79,
845,
21,
669,
19,
21,
674,
35,
51,
155,
27,
4387,
1242,
9,
31,
22,
79,
2334,
27,
2936,
301,
835,
20,
2804,
5309,
13,
5,
164,
12361,
5309,
9,
960,
13,
6,
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... |
Oracle - Select where field has lowercase characters
===
I have a table, users, in an Oracle 9.2.0.6 database. Two of the fields are varchar - last_name and first_name.
When rows are inserted into this table, the first name and last name fields are supposed to be in all upper case, but somehow some values in these... | 0 | [
2,
15759,
13,
8,
5407,
113,
575,
63,
987,
10325,
1766,
800,
3726,
3726,
31,
57,
21,
859,
15,
3878,
15,
19,
40,
15759,
561,
9,
135,
9,
387,
9,
379,
6018,
9,
81,
16,
14,
2861,
50,
4033,
5433,
13,
8,
236,
1,
7259,
17,
64,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Looking for network link speed determination algorithm
===
I'm looking for the best way to interpret the standard (well, standardish) Ethernet PHY registers, to determine the speed that an Ethernet link is actually running at. (e.g. 10/100/1000 and full/half-duplex)
I daresay that this is to be found in the sour... | 0 | [
2,
699,
26,
982,
3508,
1362,
9821,
9083,
800,
3726,
3726,
31,
22,
79,
699,
26,
14,
246,
161,
20,
11584,
14,
1236,
13,
5,
854,
15,
1236,
1595,
6,
27820,
13,
8174,
2243,
18,
15,
20,
3746,
14,
1362,
30,
40,
27820,
3508,
25,
1121,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CSS navigation
===
The navigation on the left menu in the below site uses CSS for mouseover links.<br />[PVH][1]
When I take the code of the navigation and make it separate page. Then the mouseover links are not working. What could be the reason? Please let me know.<br />
[Test][2]
[1]: http://www.pvh.com/
... | 0 | [
2,
272,
18,
18,
8368,
800,
3726,
3726,
14,
8368,
27,
14,
225,
11379,
19,
14,
1021,
689,
2027,
272,
18,
18,
26,
7567,
2549,
6271,
9,
1,
5145,
13,
118,
1,
2558,
10166,
252,
500,
2558,
165,
500,
76,
31,
247,
14,
1797,
16,
14,
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 do you iterate through custom keys in web.config?
===
is it possible to create my own custom keys in the asp.net web.config file and iterate through them with C#? How do you do both (where do I put the key? what format?)? I have an application for an intranet that does certain things based upon the IP address o... | 0 | [
2,
184,
107,
42,
32,
106,
1373,
120,
5816,
5534,
19,
2741,
9,
14093,
2816,
60,
800,
3726,
3726,
25,
32,
938,
20,
1600,
51,
258,
5816,
5534,
19,
14,
28,
306,
9,
2328,
2741,
9,
14093,
2816,
3893,
17,
32,
106,
1373,
120,
105,
29,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Javascript access to spell checker on browsers
===
Is it possible to get access to the spell checker that is incorporated in browsers for text areas from Javascript? I would like to be able to control spell checking from withing my code. Most browsers (apart from IE) seem to have some kind of a spell checker built in ... | 0 | [
2,
8247,
8741,
1381,
20,
4762,
2631,
106,
27,
16495,
18,
800,
3726,
3726,
25,
32,
938,
20,
164,
1381,
20,
14,
4762,
2631,
106,
30,
25,
3678,
19,
16495,
18,
26,
1854,
924,
37,
8247,
8741,
60,
31,
83,
101,
20,
44,
777,
20,
569,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best format to use when creating a mail list for use in a Word 2007?
===
I'm writing a web app (Java) which allows users to select contacts. The contacts details can be downloaded (currently in CSV format) and used to perform a mail merge in Word 2007.
I would like to use a format which is a bit more 'r... | 0 | [
2,
98,
25,
14,
246,
2595,
20,
275,
76,
2936,
21,
4216,
968,
26,
275,
19,
21,
833,
624,
60,
800,
3726,
3726,
31,
22,
79,
1174,
21,
2741,
4865,
13,
5,
1004,
1385,
6,
56,
2965,
3878,
20,
5407,
11894,
9,
14,
11894,
3289,
92,
44,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to do a WHERE...IN... clause in LinqToSql?
===
Bear with me, I'm beginning: How can I select multiple elements using a WHERE...IN... type of clause as in
select * from orders where orderid in (1, 4, 5)
in LinqToSql? I'd prefer not to have a lambda expression since they scare me. Thanks in advance! | 0 | [
2,
184,
20,
107,
21,
113,
9,
9,
9,
108,
9,
9,
9,
9040,
19,
6294,
1251,
262,
18,
22402,
60,
800,
3726,
3726,
2746,
29,
55,
15,
31,
22,
79,
997,
45,
184,
92,
31,
5407,
1886,
2065,
568,
21,
113,
9,
9,
9,
108,
9,
9,
9,
100... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP.NET MVC return a different view.
===
I have a view which contains a form, the form posts and the data gets processed etc, then I want to return the view Index, so return view("Index");
however this will then complain about my ViewData not existing, I get the feeling that the controller code under Index() isn't ... | 0 | [
2,
28,
306,
9,
2328,
307,
8990,
788,
21,
421,
1418,
9,
800,
3726,
3726,
31,
57,
21,
1418,
56,
1588,
21,
505,
15,
14,
505,
9868,
17,
14,
1054,
3049,
16697,
2722,
15,
94,
31,
259,
20,
788,
14,
1418,
4348,
15,
86,
788,
1418,
5,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What Are The Implications of Dropping Windows 98 Support?
===
Up to now in my application, I've been supporting all flavors of Windows from Windows 98 to Windows NT/2000 to XP to Vista.
But because of adding Unicode in my next version, support of Windows 98 would still be possible, but very difficult.
I know the... | 0 | [
2,
98,
50,
14,
14747,
16,
6780,
1936,
8737,
555,
60,
800,
3726,
3726,
71,
20,
130,
19,
51,
3010,
15,
31,
22,
195,
74,
3134,
65,
11974,
18,
16,
1936,
37,
1936,
8737,
20,
1936,
13,
2877,
118,
3050,
20,
23045,
20,
13520,
9,
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... |
Is yield useful outside of LINQ?
===
When ever I think I can use the yield keyword, I take a step back and look at how it will impact my project. I always end up returning a collection instead of yeilding because I feel the overhead of maintaining the state of the yeilding method doesn't buy me much. In almost all cas... | 0 | [
2,
25,
11537,
4811,
719,
16,
6294,
1251,
60,
800,
3726,
3726,
76,
462,
31,
277,
31,
92,
275,
14,
11537,
1246,
9587,
15,
31,
247,
21,
1424,
97,
17,
361,
35,
184,
32,
129,
2261,
51,
669,
9,
31,
550,
241,
71,
2485,
21,
1206,
70... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
VB.NET Controls inside of a DataGridView Row on a Windows Form
===
I have a ComboBox inside of a cell of a DataGridView Row on a Windows form. I need the following to happen:
1. click on the ComboBox
2. pick a value
3. recalculate a total & display inside of a lable that is sitting
outside of the D... | 0 | [
2,
13,
20468,
9,
2328,
8671,
572,
16,
21,
1054,
16375,
4725,
3131,
27,
21,
1936,
505,
800,
3726,
3726,
31,
57,
21,
22621,
5309,
572,
16,
21,
1667,
16,
21,
1054,
16375,
4725,
3131,
27,
21,
1936,
505,
9,
31,
376,
14,
249,
20,
23... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Most efficient algorithm for mesh-level, optimal occlusion culling?
===
I am new to culling. On a first glance, it seems that most occlusion culling algorithms are object-level, not examining single meshes, which would be practical for game rendering.
What I am looking for is an algorithm that culls all meshes wi... | 0 | [
2,
127,
8243,
9083,
26,
55,
1635,
8,
3906,
15,
17586,
13,
2499,
10301,
5991,
19075,
68,
60,
800,
3726,
3726,
31,
589,
78,
20,
19075,
68,
9,
27,
21,
64,
4828,
15,
32,
2206,
30,
127,
13,
2499,
10301,
5991,
19075,
68,
15935,
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... |
phpmyadmin - save file to disk
===
when i point my browser to http://localhost/phpmyadmin, instead of showing me its front page, it comes up with save as dialog.
I'm running:
Apache/2.2.3 (Debian) PHP/5.2.0-8+etch13 Server
I've reinstalled both apache2 and php5. | 0 | [
2,
13,
26120,
915,
1283,
2160,
13,
8,
2079,
3893,
20,
8582,
800,
3726,
3726,
76,
31,
454,
51,
16495,
20,
7775,
6903,
15580,
11694,
118,
26120,
915,
1283,
2160,
15,
700,
16,
3187,
55,
82,
431,
2478,
15,
32,
1624,
71,
29,
2079,
28... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to centralize and secure connection strings?
===
What is the best way to centralize and secure the connections strings used by applications? In my environment we have many internal applications. Each application requires one or more connection strings in order to access the database. We have a ... | 0 | [
2,
98,
25,
14,
246,
161,
20,
521,
2952,
17,
4315,
2760,
7887,
60,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
521,
2952,
17,
4315,
14,
6760,
7887,
147,
34,
3767,
60,
19,
51,
2307,
95,
57,
151,
3117,
3767,
9,
206,
3010,
4781,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Silverlight: is there a way to allow a user to open a file from isolated storage?
===
I'd like to allow a user to open files in their own client applications via Silverlight. I'd like this to work similarly to WebDAV, in the sense that they could read/write the file back into Silverlight's isolated storage...
Is it... | 0 | [
2,
1172,
3130,
45,
25,
80,
21,
161,
20,
1655,
21,
4155,
20,
368,
21,
3893,
37,
6331,
4326,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
1655,
21,
4155,
20,
368,
6488,
19,
66,
258,
6819,
3767,
1197,
1172,
3130,
9,
31,
22,
43,
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... |
Using the EstimatedSize value inside a program uninstall key to correctly display the program size in the Add/Remove Programs list.
===
I've attempted to use the EstimatedSize value during creation of an uninstaller registry key for an app I've developed, unfortunately the value I specify does not appear in the Add/Re... | 0 | [
2,
568,
14,
2744,
10454,
1923,
572,
21,
625,
367,
108,
21300,
1246,
20,
12044,
3042,
14,
625,
1072,
19,
14,
3547,
118,
99,
16598,
1726,
968,
9,
800,
3726,
3726,
31,
22,
195,
3066,
20,
275,
14,
2744,
10454,
1923,
112,
2502,
16,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Custom Controls with Blend
===
I'm building custom control for my Silverlight 2 app. It's in one SL class project, and it contains two files:
* MyControl class, inherited from Control, with few DepedencyProperties
* themes/generic.xaml, with visual elements (ControlTemplate), states for VSM and transitions
... | 0 | [
2,
5816,
8671,
29,
11138,
800,
3726,
3726,
31,
22,
79,
353,
5816,
569,
26,
51,
1172,
3130,
172,
4865,
9,
32,
22,
18,
19,
53,
13718,
718,
669,
15,
17,
32,
1588,
81,
6488,
45,
1637,
51,
12898,
718,
15,
7179,
37,
569,
15,
29,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to make svn diff produce file that patch would apply, when svn cp or svn mv was used?
===
The scenario is:
1. svn cp or mv some file
2. modify that file
3. svn diff > mypatch
On other machine (same working copy, but no changes):
4. Try to apply mypatch.
5. Fail -> tries to modify unexistant file.
... | 0 | [
2,
184,
20,
233,
13,
18,
16578,
20811,
2213,
3893,
30,
7331,
83,
5645,
15,
76,
13,
18,
16578,
9750,
54,
13,
18,
16578,
17967,
23,
147,
60,
800,
3726,
3726,
14,
12705,
25,
45,
137,
9,
13,
18,
16578,
9750,
54,
17967,
109,
3893,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C#: Ask User for a Password which is then stored in a SecureString
===
In the small application that I'm currently developing for a customer I need to ask the user for his windows login username, password and domain and then use those with **System.Diagnostics.Process.Start** to start an application.
I have a textb... | 0 | [
2,
272,
5910,
45,
1349,
4155,
26,
21,
20884,
56,
25,
94,
8214,
19,
21,
4315,
11130,
800,
3726,
3726,
19,
14,
284,
3010,
30,
31,
22,
79,
871,
3561,
26,
21,
7705,
31,
376,
20,
1349,
14,
4155,
26,
33,
1936,
6738,
108,
4155,
7259,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
jQuery Cross-Browser Performance Issues
===
I am wrapping up a project in which I used jQuery for the first time. I loved working with the library, and thought I understood one of the benefits was cross-browser compatibility. I had an unpleasant surprise waiting for me when I began testing the site in IE6 and IE7 beca... | 0 | [
2,
487,
8190,
93,
919,
8,
25699,
4104,
956,
1549,
800,
3726,
3726,
31,
589,
13437,
71,
21,
669,
19,
56,
31,
147,
487,
8190,
93,
26,
14,
64,
85,
9,
31,
2199,
638,
29,
14,
1248,
15,
17,
289,
31,
4014,
53,
16,
14,
5800,
23,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why does Visual Studios go off into LaLa land while debugging.
===
Sometimes, while I am debugging a c# application, I will hit a break point and when I try to continue, step or step into, it just does nothing. The yellow line highlighting the current line goes away, but it never reaches the next line. The app is st... | 0 | [
2,
483,
630,
3458,
3504,
162,
168,
77,
13,
25152,
476,
133,
121,
16254,
2762,
9,
800,
3726,
3726,
1030,
15,
133,
31,
589,
121,
16254,
2762,
21,
272,
5910,
3010,
15,
31,
129,
770,
21,
1442,
454,
17,
76,
31,
1131,
20,
1816,
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... |
Java: Code Refactoring/Optimization
===
Please enlighten me:
Which one do you prefer? Why? [Readability? Memory concern? Some other issues?]
**1.**
String strSomething1 = someObject.getSomeProperties1();
strSomething1 = doSomeValidation(strSomething1);
String strSomething2 = someObject.getSome... | 0 | [
2,
8247,
45,
1797,
302,
17455,
68,
118,
25458,
79,
1829,
800,
3726,
3726,
2247,
1957,
3130,
219,
55,
45,
56,
53,
107,
42,
6369,
60,
483,
60,
636,
10647,
4091,
60,
1912,
3630,
60,
109,
89,
1549,
60,
500,
13,
1409,
165,
9,
1409,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Determining the results count of ViewData
===
Hi I have a view with several User Controls and I pass ViewData to all of them, I would like to know how you would determine the element count by specifying the string key.
I understand that you cannot use comparison to an integer because ViewData is an object but I have ... | 0 | [
2,
13521,
14,
1736,
2468,
16,
1418,
18768,
800,
3726,
3726,
4148,
31,
57,
21,
1418,
29,
238,
4155,
8671,
17,
31,
1477,
1418,
18768,
20,
65,
16,
105,
15,
31,
83,
101,
20,
143,
184,
42,
83,
3746,
14,
4520,
2468,
34,
19077,
68,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
inject property value into Spring bean
===
I have a bunch of Spring beans which are picked up from the classpath via annotations, e.g.
@Repository("personDao")
public class PersonDaoImpl extends AbstractDaoImpl implements PersonDao {
// Implementation omitted
}
In the Spring XML file, ther... | 0 | [
2,
20316,
1354,
1923,
77,
1573,
15322,
800,
3726,
3726,
31,
57,
21,
7653,
16,
1573,
14685,
56,
50,
2114,
71,
37,
14,
718,
8353,
1197,
40,
1270,
7504,
15,
13,
62,
9,
263,
9,
13,
1,
99,
14882,
14599,
5,
7,
7276,
17104,
7,
6,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get position of element using xslt.
===
How can I retrieve the position of the current Para?
<xsl:template match="Para">
<xsl:variable name="PositionInDocument" select="What do I do here?" />
</xsl:template>
This is the xml document:
<QuestionStem>Question </QuestionStem>
<Para>This is m... | 0 | [
2,
184,
20,
164,
649,
16,
4520,
568,
993,
18,
255,
38,
9,
800,
3726,
3726,
184,
92,
31,
11917,
14,
649,
16,
14,
866,
2258,
60,
13,
1,
396,
18,
255,
45,
9577,
6554,
730,
3726,
7,
6351,
7,
1,
13,
1,
396,
18,
255,
45,
8220,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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++ Namespace question
===
I am working on some code written by a co-worker who no longer works with the company, and I have found the following code: (which I have cut down below)
namespace NsA { namespace NsB { namespace NsC {
namespace {
class A { /*etc*/ };
class B { /*etc*/ };
... | 0 | [
2,
272,
20512,
204,
5582,
1301,
800,
3726,
3726,
31,
589,
638,
27,
109,
1797,
642,
34,
21,
326,
8,
22560,
72,
90,
1045,
693,
29,
14,
237,
15,
17,
31,
57,
216,
14,
249,
1797,
45,
13,
5,
2140,
31,
57,
1077,
125,
1021,
6,
204,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a dynamic sql stored procedure a bad thing for lots of records?
===
I have a table with almost 800,000 records and I am currently using dynamic sql to generate the query on the back end. The front end is a search page which takes about 20 parameters and depending on if a parameter was chosen, it adds an " AND ..."... | 0 | [
2,
25,
21,
7782,
4444,
255,
8214,
7004,
21,
896,
584,
26,
7503,
16,
742,
60,
800,
3726,
3726,
31,
57,
21,
859,
29,
557,
13,
27082,
742,
17,
31,
589,
871,
568,
7782,
4444,
255,
20,
7920,
14,
25597,
27,
14,
97,
241,
9,
14,
431... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CUDA vs FPGA?
===
I am developing a product with heavy 3D graphics computations, **to a large extent closest point and range searches**. Some hardware optimization would be useful. While I know little about this, my boss (who has no software experience) advocates FPGA (because it can be tailored), while my junior de... | 0 | [
2,
272,
5729,
4611,
13,
12087,
1136,
60,
800,
3726,
3726,
31,
589,
3561,
21,
2374,
29,
1278,
203,
43,
8351,
21683,
18,
15,
13,
1409,
262,
21,
370,
5674,
6993,
454,
17,
978,
19994,
1409,
9,
109,
7610,
21597,
83,
44,
4811,
9,
133,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
trying to capture javac output in bash shell
===
I'm trying to redirect the java compiler output to a file.
I thought it's supposed to be:
javac file.java > log.txt
or something. Instead, I see all the output on the terminal and nothing in log.txt!
Also, if I want to log errors too, do I do
javac... | 0 | [
2,
749,
20,
3683,
8247,
150,
5196,
19,
13158,
3593,
800,
3726,
3726,
31,
22,
79,
749,
20,
302,
14706,
14,
8247,
21486,
5196,
20,
21,
3893,
9,
31,
289,
32,
22,
18,
2293,
20,
44,
45,
8247,
150,
3893,
9,
1004,
1385,
13,
1,
6738,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Use Label or DrawString in UserControl
===
I am writing my own control that will contain a panel with text, images and other media. What is the best way to render the text and images. The control may contain long texts and many images.
Should I add the text as labels and images as PictureBox or should I use the Dra... | 0 | [
2,
275,
1899,
54,
2003,
11130,
19,
4155,
12898,
800,
3726,
3726,
31,
589,
1174,
51,
258,
569,
30,
129,
3717,
21,
4113,
29,
1854,
15,
3502,
17,
89,
941,
9,
98,
25,
14,
246,
161,
20,
16535,
14,
1854,
17,
3502,
9,
14,
569,
123,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
prolog recursively find largest node
===
Just a simple binary tree and i want to find the the largest node.
<br>example tree: t(t(t(nil,1,nil),2,t(nil,3,nil)),4,t(t(t(nil,8,nil),5,nil),6,t(nil,7,nil)))
int L(t,max) {
if(t=null) return max;
if(max<t.root) max = t.root;
LN(t,max);
RN(t,max);
... | 0 | [
2,
895,
5567,
302,
24244,
102,
477,
1075,
15421,
800,
3726,
3726,
114,
21,
1935,
14171,
1541,
17,
31,
259,
20,
477,
14,
14,
1075,
15421,
9,
13,
1,
5145,
1,
29041,
1541,
45,
13,
38,
5,
38,
5,
38,
5,
103,
947,
15,
165,
15,
103... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 select the position of a following sibling.
===
I need to select the position of a following sibling via XSL.
This is not working:
<xsl:variable name="nextAnswerListItemPos" select="following-sibling::*[local-name() = 'AnswerListItem'][position()]" />
| 0 | [
2,
184,
107,
31,
5407,
14,
649,
16,
21,
249,
24792,
9,
800,
3726,
3726,
31,
376,
20,
5407,
14,
649,
16,
21,
249,
24792,
1197,
993,
18,
255,
9,
48,
25,
52,
638,
45,
13,
1,
396,
18,
255,
45,
8220,
579,
204,
3726,
7,
20021,
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... |
Passing master page form data to toher webform
===
I have a master page with one form on it. It is a search form which must always be visible. When the button of that form is clicked i want the form data to be sent to search.aspx. The problem is, i don't know how. I cannot set the form action to search.aspx, because a... | 0 | [
2,
2848,
1129,
2478,
505,
1054,
20,
20,
1694,
2741,
4190,
800,
3726,
3726,
31,
57,
21,
1129,
2478,
29,
53,
505,
27,
32,
9,
32,
25,
21,
2122,
505,
56,
491,
550,
44,
4560,
9,
76,
14,
5167,
16,
30,
505,
25,
15802,
31,
259,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why is the indexer on my .NET component not always accessible from VBScript?
===
I have a .NET assembly which I am accessing from VBScript (classic ASP) via COM interop. One class has an indexer (a.k.a. default property) which I got working from VBScript by adding the following attribute to the indexer: `[DispId(0)]`.... | 0 | [
2,
483,
25,
14,
4348,
106,
27,
51,
13,
9,
2328,
5912,
52,
550,
7342,
37,
13,
20468,
8741,
60,
800,
3726,
3726,
31,
57,
21,
13,
9,
2328,
1475,
56,
31,
589,
1381,
68,
37,
13,
20468,
8741,
13,
5,
19824,
28,
306,
6,
1197,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get Url Hash (#) from server side
===
I know on client side (javascript) you can use windows.location.hash but could not find anyway to access from the server side. | 0 | [
2,
184,
20,
164,
287,
6362,
19170,
13,
5,
5910,
6,
37,
8128,
270,
800,
3726,
3726,
31,
143,
27,
6819,
270,
13,
5,
1004,
1385,
8741,
6,
42,
92,
275,
1936,
9,
19032,
9,
25436,
47,
110,
52,
477,
2774,
20,
1381,
37,
14,
8128,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is a cvs new-born file?
===
I get this error during checkout:
cvs checkout: warning: new-born file.java has disappeared
cvs [checkout aborted]: cannot make directory : No such file or directory
cvs status: cannot rewrite CVS/Entries.Backup: Permission denied
my checkout command is:
cvs ... | 0 | [
2,
98,
25,
21,
13,
12732,
18,
78,
8,
381,
3893,
60,
800,
3726,
3726,
31,
164,
48,
7019,
112,
2631,
1320,
45,
13,
12732,
18,
2631,
1320,
45,
3590,
45,
78,
8,
381,
3893,
9,
1004,
1385,
63,
4115,
13,
12732,
18,
636,
12542,
1320,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Would it be reasonable to self-study the dragon book?
===
I've been out of school for about 2 years and didn't take a compilers course as an undergrad. At this point, it's something I'm interested in and am wondering if it would be reasonable for me to get a copy of the dragon book and self study? what other resourc... | 0 | [
2,
83,
32,
44,
9954,
20,
1119,
8,
26244,
14,
3339,
360,
60,
800,
3726,
3726,
31,
22,
195,
74,
70,
16,
116,
26,
88,
172,
122,
17,
223,
22,
38,
247,
21,
21486,
18,
674,
28,
40,
131,
7691,
9,
35,
48,
454,
15,
32,
22,
18,
30... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Synchronisable CRM System
===
I need to develop a CRM system which will allow users to have a local copy of the DB which can then be synched with the main server system. The idea is that a sales team can travel to non-internet enabled areas and still operate with relatively up to date information and then synch up whe... | 0 | [
2,
13,
16023,
403,
579,
6186,
79,
329,
800,
3726,
3726,
31,
376,
20,
2803,
21,
6186,
79,
329,
56,
129,
1655,
3878,
20,
57,
21,
375,
4344,
16,
14,
13,
9007,
56,
92,
94,
44,
6063,
6261,
29,
14,
407,
8128,
329,
9,
14,
882,
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... |
SubSonic Problem Stored Procedures
===
In the last two days I refactored a lot of Stored Procedures. Today I ran SubSonic and tried the application and I get this error that's driving me crazy:
Could not locate entry in sysdatabases for database 'sp'. No entry found with that name. Make sure that the name is en... | 0 | [
2,
972,
17766,
1448,
8214,
8876,
800,
3726,
3726,
19,
14,
236,
81,
509,
31,
302,
17455,
69,
21,
865,
16,
8214,
8876,
9,
786,
31,
717,
972,
17766,
17,
794,
14,
3010,
17,
31,
164,
48,
7019,
30,
22,
18,
2891,
55,
3328,
45,
110,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 SSL really worth it?
===
I'm wondering if I should add an SSL layer between my server and client. I'm not handling any confidential data, but there is a very small chance someone might want to hack transmissions in order to gain intelligence (this is a game by the way). Now the ammounts of data to be processed is c... | 0 | [
2,
25,
13,
18,
18,
255,
510,
2715,
32,
60,
800,
3726,
3726,
31,
22,
79,
5712,
100,
31,
378,
3547,
40,
13,
18,
18,
255,
5385,
128,
51,
8128,
17,
6819,
9,
31,
22,
79,
52,
7988,
186,
16941,
1054,
15,
47,
80,
25,
21,
253,
284,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Reg-Free COM not working for me.
===
I am trying to see if Reg-Free COM is something we can use in our web application to ease deployment of legacy COM components. However, before I get onto looking into things like using it for Interop situations, I can't get a simple test to work. Here's what I have done :-
1) Cr... | 0 | [
2,
7953,
8,
4639,
13,
960,
52,
638,
26,
55,
9,
800,
3726,
3726,
31,
589,
749,
20,
196,
100,
7953,
8,
4639,
13,
960,
25,
301,
95,
92,
275,
19,
318,
2741,
3010,
20,
6378,
10475,
16,
7780,
13,
960,
5090,
9,
207,
15,
115,
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... |
Win32: Write to file without buffering ?
===
I need to create a new file handle so that any write operations to that handle get written to disk immediately.
Extra info: The handle will be the inherited STDOUT of a child process, so I need any output from that process to immediately be written to disk.
Studying ... | 0 | [
2,
628,
3125,
45,
2757,
20,
3893,
366,
17497,
68,
13,
60,
800,
3726,
3726,
31,
376,
20,
1600,
21,
78,
3893,
3053,
86,
30,
186,
2757,
1311,
20,
30,
3053,
164,
642,
20,
8582,
1375,
9,
2230,
15404,
45,
14,
3053,
129,
44,
14,
7179... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP.NET Session/Cache + multi-core processor server
===
I have a multi-core server hosting my asp.net solution. In the past with dual-core, etc. you had to modify your app to NOT use in-proc session state, etc. Is this still the case if its a dual core?
Also, does server cache play a part in this? I have had no i... | 0 | [
2,
28,
306,
9,
2328,
3723,
118,
793,
2569,
2754,
1889,
8,
10375,
14762,
8128,
800,
3726,
3726,
31,
57,
21,
1889,
8,
10375,
8128,
10637,
51,
28,
306,
9,
2328,
4295,
9,
19,
14,
640,
29,
5747,
8,
10375,
15,
2722,
9,
42,
41,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the longest time you spent debugging a problem
===
What is the long time you have spent debugging a particular problem?
Was the solution trivial in hindsight?
| 0 | [
2,
98,
25,
14,
5646,
85,
42,
1111,
121,
16254,
2762,
21,
1448,
800,
3726,
3726,
98,
25,
14,
175,
85,
42,
57,
1111,
121,
16254,
2762,
21,
1498,
1448,
60,
23,
14,
4295,
13,
19712,
19,
8065,
18,
6872,
38,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Why are there no byte or short literals in Java?
===
I can create a literal long by appending an L to the value; why can't I create a literal short or byte in some similar way? Why do I need to use an int literal with a cast?
And if the answer is "Because there was no short literal in C", then why are there no shor... | 0 | [
2,
483,
50,
80,
90,
34,
591,
54,
502,
20665,
18,
19,
8247,
60,
800,
3726,
3726,
31,
92,
1600,
21,
20665,
175,
34,
4865,
7601,
40,
644,
20,
14,
1923,
73,
483,
92,
22,
38,
31,
1600,
21,
20665,
502,
54,
34,
591,
19,
109,
835,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Type Conversion in C#
===
I'm trying to make a generic method for type conversions which gets an object and the type of object to be cast.
By using `Convert.ChangeType()` I can do what I want, but it takes too much time on run time. What is the best method to make a generic class like I want.
My old code looks ... | 0 | [
2,
1001,
6263,
19,
272,
5910,
800,
3726,
3726,
31,
22,
79,
749,
20,
233,
21,
12733,
2109,
26,
1001,
6263,
18,
56,
3049,
40,
3095,
17,
14,
1001,
16,
3095,
20,
44,
1325,
9,
34,
568,
13,
1,
1126,
8122,
9,
16229,
4474,
5,
6,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I tell if a variable in xslt is greater than another.
===
Each of these variables has an integer value. But this syntax is not valid for some reason:
<xsl:when test="$nextAnswerListItemPos < $nextQuestionStemPos" > | 0 | [
2,
184,
107,
31,
494,
100,
21,
7612,
19,
993,
18,
255,
38,
25,
1894,
119,
226,
9,
800,
3726,
3726,
206,
16,
158,
12157,
63,
40,
13820,
1923,
9,
47,
48,
22649,
25,
52,
7394,
26,
109,
1215,
45,
13,
1,
396,
18,
255,
45,
3185,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Php equivlent of friend or internal
===
Is there some equivalent of "friend" or "internal" in php? If not, is there any pattern to follow to achieve this behavior? | 0 | [
2,
13,
26120,
13,
9629,
710,
13465,
16,
860,
54,
3117,
800,
3726,
3726,
25,
80,
109,
4602,
16,
13,
7,
12299,
7,
54,
13,
7,
6280,
5025,
7,
19,
13,
26120,
60,
100,
52,
15,
25,
80,
186,
3732,
20,
1740,
20,
4689,
48,
3257,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
For Monitoring JVMs with JMX is it better to use build your own tool or use something like JConsol
===
I am currently tasked with developing a tool to use JMX to monitor JVMs for things like, but not limited too, memory usage, heap size, thread count. The desired tool is one that can display many graphs for each jvm ... | 0 | [
2,
26,
8984,
487,
20147,
18,
29,
487,
79,
396,
25,
32,
574,
20,
275,
1895,
154,
258,
5607,
54,
275,
301,
101,
487,
1126,
5594,
800,
3726,
3726,
31,
589,
871,
14605,
29,
3561,
21,
5607,
20,
275,
487,
79,
396,
20,
7626,
487,
201... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Easiest way or Best tools to convert word text to clean (X)HTML
===
This might have been asked in another way. I am not doing it on the fly however. Once in a while we get pieces of content in word files that have em dashes, bold, italic text and block quotes. Is there a good tool to convert this into a clean html cod... | 0 | [
2,
27237,
161,
54,
246,
4672,
20,
8406,
833,
1854,
20,
2745,
13,
5,
396,
6,
15895,
800,
3726,
3726,
48,
530,
57,
74,
411,
19,
226,
161,
9,
31,
589,
52,
845,
32,
27,
14,
2855,
207,
9,
382,
19,
21,
133,
95,
164,
2491,
16,
23... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get users to your Open Source project
===
I'm one of the developers an founders of [Ra-Ajax][1] which is Open Source and Free of Charge (LGPL licensed, hosted at Google Code) and I have a lot of reasons to do what I do, which is to spend most of my time maintaining an Open Source project which I earn close to *... | 2 | [
2,
184,
20,
164,
3878,
20,
154,
368,
1267,
669,
800,
3726,
3726,
31,
22,
79,
53,
16,
14,
10168,
40,
9562,
16,
636,
525,
8,
6881,
7522,
500,
2558,
165,
500,
56,
25,
368,
1267,
17,
551,
16,
1906,
13,
5,
10641,
5727,
6392,
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... |
How do I open a Finder sidebar folder via AppleScript?
===
I have a bash script which will be run on a Mac via ssh. The script requires a particular network drive to already be mounted. On the Mac, I mount this drive by opening a folder "JPLemme" on that drive in Finder. This mounts the drive until the Mac goes to sle... | 0 | [
2,
184,
107,
31,
368,
21,
13,
18639,
270,
1850,
19294,
1197,
4037,
8741,
60,
800,
3726,
3726,
31,
57,
21,
13158,
3884,
56,
129,
44,
485,
27,
21,
1572,
1197,
13,
18,
1635,
9,
14,
3884,
4781,
21,
1498,
982,
1493,
20,
614,
44,
48... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Collection type for representing a hierarchial structure in .Net 3.5
===
I been experimenting with the different methods for representing a hierarchical structures in memory that would allow for simple and efficient transversal both up and down to discover ancestor and descendant relationships. Does anyone have any s... | 0 | [
2,
1206,
1001,
26,
3793,
21,
21376,
2815,
1411,
19,
13,
9,
2328,
203,
9,
264,
800,
3726,
3726,
31,
74,
5737,
68,
29,
14,
421,
3195,
26,
3793,
21,
21376,
4272,
3815,
19,
1912,
30,
83,
1655,
26,
1935,
17,
8243,
2982,
5498,
192,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Polymorphic factory / getInstance() in Java
===
I'm aiming to create a set of objects, each of which has a unique identifier. If an object already exists with that identifier, I want to use the existing object. Otherwise I want to create a new one. I'm trying not to use the word Singleton, because I know it's a dirty ... | 0 | [
2,
3446,
12498,
596,
3129,
13,
118,
164,
108,
384,
2416,
5,
6,
19,
8247,
800,
3726,
3726,
31,
22,
79,
15442,
20,
1600,
21,
309,
16,
3916,
15,
206,
16,
56,
63,
21,
2619,
25570,
9,
100,
40,
3095,
614,
5636,
29,
30,
25570,
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... |
Existing LINQ extension method similar to Parallel.For?
===
The linq extension methods for ienumerable are very handy ... but not that useful if all you want to do is apply some computation to each item in the enumeration without returning anything. So I was wondering if perhaps I was just missing the right method, o... | 0 | [
2,
3149,
6294,
1251,
3896,
2109,
835,
20,
3821,
9,
1106,
60,
800,
3726,
3726,
14,
6294,
1251,
3896,
3195,
26,
13,
660,
6336,
106,
579,
50,
253,
20277,
13,
9,
9,
9,
47,
52,
30,
4811,
100,
65,
42,
259,
20,
107,
25,
5645,
109,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Crontab revision control?
===
I've got a few dozen Linux machines running `cron` and I'd like to put the crontabs in some sort of revision control system. For source control I use Mercurial (`hg`), so that'd be ideal, but if there's some other system that is better suited to this task I'd consider it.
One aspect w... | 0 | [
2,
13,
19587,
15783,
11323,
569,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
310,
5550,
13024,
6035,
946,
13,
1,
19587,
1,
17,
31,
22,
43,
101,
20,
442,
14,
13,
19587,
15783,
18,
19,
109,
2058,
16,
11323,
569,
329,
9,
26,
1267,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Authentication Error when connecting accessing Sharepoint list via web service
===
I wrote a windows service a few months ago that would ping a Sharepoint list using _vti_bin/lists.asmx function GetListItemChanges. It was working fine until a few weeks ago when my company upgraded our Sharepoint instance to SP1.
N... | 0 | [
2,
27963,
7019,
76,
6440,
1381,
68,
1891,
3132,
968,
1197,
2741,
365,
800,
3726,
3726,
31,
738,
21,
1936,
365,
21,
310,
818,
1464,
30,
83,
13,
3181,
21,
1891,
3132,
968,
568,
13,
1,
710,
1388,
1,
4772,
118,
5739,
18,
9,
472,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why does global.asax change sql connection?
===
In asp.net 3.5, I have a problem that if I upload my global.asax to the remote web server, the app starts looking for my local sql server and eventually times out. I use a different config file for the local and remote because of the sql server login. Local is windows... | 0 | [
2,
483,
630,
2062,
9,
8588,
396,
753,
4444,
255,
2760,
60,
800,
3726,
3726,
19,
28,
306,
9,
2328,
203,
9,
264,
15,
31,
57,
21,
1448,
30,
100,
31,
71,
8294,
51,
2062,
9,
8588,
396,
20,
14,
5388,
2741,
8128,
15,
14,
4865,
3244... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
LINQtoSQL Error: Sequence operators not supported for type 'System.String'
===
For some reason my code won't work.
from tan in TANS
where tan.ID.ToString().Count() != 1
select tan
I want to select all IDs that are duplicates in a table so I am using the count != 1 and I get this error.
... | 0 | [
2,
6294,
1251,
262,
18,
22402,
7019,
45,
4030,
9475,
52,
1827,
26,
1001,
13,
22,
10724,
9,
11130,
22,
800,
3726,
3726,
26,
109,
1215,
51,
1797,
230,
22,
38,
170,
9,
37,
3461,
19,
3461,
18,
113,
3461,
9,
1340,
9,
262,
11130,
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... |
SSCLI for .Net Framework 3.5
===
Is there a SSCLI equivalent for .Net Framework 3.5?
Something that can be debugged and stepped through.
Kind regards.
| 0 | [
2,
13,
18,
3862,
1210,
26,
13,
9,
2328,
6596,
203,
9,
264,
800,
3726,
3726,
25,
80,
21,
13,
18,
3862,
1210,
4602,
26,
13,
9,
2328,
6596,
203,
9,
264,
60,
301,
30,
92,
44,
121,
2345,
15186,
17,
1973,
120,
9,
825,
14179,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Should I use HtmlHelper or roll my own controls?
===
I'm just beginning to learn ASP.NET MVC and I've run into a question. I'm trying to determine whether I should use HtmlHelper to create client controls or if I should just roll my own. My gut wants to lean towards just rolling my own because it gives me total contr... | 0 | [
2,
378,
31,
275,
13,
15895,
14593,
106,
54,
3001,
51,
258,
8671,
60,
800,
3726,
3726,
31,
22,
79,
114,
997,
20,
2484,
28,
306,
9,
2328,
307,
8990,
17,
31,
22,
195,
485,
77,
21,
1301,
9,
31,
22,
79,
749,
20,
3746,
1472,
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... |
The route addition failed: Cannot create a file when that file already exists.
===
I get this error when using c:>route add <route\_and\_interface_here>
This happens on a RRAS server that has a PPTP site-to-site VPN setup with demand-dialing static route. This route shows in RRAS routing table but does not sh... | 0 | [
2,
14,
858,
848,
1702,
45,
1967,
1600,
21,
3893,
76,
30,
3893,
614,
5636,
9,
800,
3726,
3726,
31,
164,
48,
7019,
76,
568,
272,
45,
1,
20179,
3547,
279,
255,
38,
73,
20179,
1,
290,
1,
6280,
6413,
1,
6836,
1569,
263,
38,
73,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tools to search for strings inside files without indexing
===
I have to change some connection strings in an incredibly old legacy application, and the programmers who made it thought it would be a great idea to plaster the entire app with connection strings all over the place.
VS "current project" search is INCRED... | 0 | [
2,
4672,
20,
2122,
26,
7887,
572,
6488,
366,
4348,
68,
800,
3726,
3726,
31,
57,
20,
753,
109,
2760,
7887,
19,
40,
13003,
315,
7780,
3010,
15,
17,
14,
17968,
18,
72,
117,
32,
289,
32,
83,
44,
21,
374,
882,
20,
15842,
14,
1078,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 am I supposed to use Tortoise SVN Merge
===
How am I supposed to use merge with the latest version of Tortoise SVN? I'm an old clearcase guy, and I've never understood it. When I merge a branch back into the trunk, I just select range of revisions and then leave the version numbers blank and it starts spitting out... | 0 | [
2,
184,
589,
31,
2293,
20,
275,
25691,
13,
18,
16578,
12666,
800,
3726,
3726,
184,
589,
31,
2293,
20,
275,
12666,
29,
14,
5736,
615,
16,
25691,
13,
18,
16578,
60,
31,
22,
79,
40,
315,
1207,
10325,
1244,
15,
17,
31,
22,
195,
24... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Loading Data Files on iPhone?
===
What is the best way to load static data files containing game level maps on the iPhone? I have seen some use XML files, but that seems like overkill in my situation as the data files merely determine the layout of the game's level, ie where obstructions will go. Also, what project ... | 0 | [
2,
12797,
1054,
6488,
27,
21024,
60,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
6305,
12038,
1054,
6488,
3503,
250,
662,
6867,
27,
14,
21024,
60,
31,
57,
541,
109,
275,
23504,
6488,
15,
47,
30,
2206,
101,
84,
7577,
19,
51,
1858,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Standard C or Python libraries to compute standard deviation of normal distribution.
===
Say we have normal distribution n(x): mean=0 and \int_{-a}^{a} n(x) = P.
What is the easiest way to compute standard deviation of such distribution? May be there are standard libraries for python or C, that are suitable for tha... | 0 | [
2,
1236,
272,
54,
20059,
8649,
20,
23909,
1236,
22325,
16,
1826,
2523,
9,
800,
3726,
3726,
395,
95,
57,
1826,
2523,
13,
103,
5,
396,
6,
45,
884,
3726,
387,
17,
13,
1,
6391,
1,
8,
58,
1,
58,
1,
13,
103,
5,
396,
6,
800,
351,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 ENCODE() and DECODE() the "best" way to handle an application password field in MySQL?
===
I am developing on a LAMP(erl) stack and know of several ways to store obscured passwords. I'd like to hear from those who feel they have a best practice, given MySQL 4.1.1 and Perl 5.8, and the reasons why it's the best.
... | 0 | [
2,
25,
20523,
5,
6,
17,
121,
9375,
5,
6,
14,
13,
7,
4936,
7,
161,
20,
3053,
40,
3010,
20884,
575,
19,
51,
18,
22402,
60,
800,
3726,
3726,
31,
589,
3561,
27,
21,
6792,
5,
106,
255,
6,
7566,
17,
143,
16,
238,
2847,
20,
1718,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WPF DependencyProperties
===
i have just realised ive been coercing binding/dependency properties and not really fundamentally understanding the concept.
Heres the dependency property:
<code>
public string Problem
{
get { return (string)GetValue(ProblemProperty); }
set { SetValue(ProblemProperty, val... | 0 | [
2,
619,
7721,
26835,
10890,
106,
3915,
800,
3726,
3726,
31,
57,
114,
12514,
5568,
74,
326,
106,
6302,
8728,
118,
19038,
8883,
3704,
17,
52,
510,
26420,
3260,
14,
2420,
9,
235,
18,
14,
26835,
1354,
45,
13,
1,
9375,
1,
317,
3724,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Castle Windsor locate files in a subdirectory?
===
I have a rich client application that uses Castle Windsor. At the moment all the assemblies including the application exe are in the one folder but it all looks rather untidy. I would like to put my dlls inside a subfolder such as "bin" but this prevents Castle fr... | 0 | [
2,
92,
1339,
10784,
12717,
6488,
19,
21,
972,
10197,
93,
60,
800,
3726,
3726,
31,
57,
21,
2042,
6819,
3010,
30,
2027,
1339,
10784,
9,
35,
14,
688,
65,
14,
21066,
215,
14,
3010,
1396,
62,
50,
19,
14,
53,
19294,
47,
32,
65,
1879... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 much time should you spend on a feature?
===
I'm currently working on a asp.net web form project by myself. How much time should i spend per feature, UI or backend...etc.? Currently i feel like i spend way too much time on little detail. Should i focus on the overall and just build the whole app and come back to t... | 0 | [
2,
184,
212,
85,
378,
42,
3256,
27,
21,
1580,
60,
800,
3726,
3726,
31,
22,
79,
871,
638,
27,
21,
28,
306,
9,
2328,
2741,
505,
669,
34,
992,
9,
184,
212,
85,
378,
31,
3256,
416,
1580,
15,
13,
5661,
54,
97,
2451,
9,
9,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
RoR: Best way to build 'dashboard' type page?
===
In the admin section of a website i am building i would like to put together a dashboard page, or 'quick look' type page where the most recent changes/additions/etc in several different areas can be viewed.
I was thinking the best way to do this would be to use part... | 0 | [
2,
761,
248,
45,
246,
161,
20,
1895,
13,
22,
43,
6031,
2806,
22,
1001,
2478,
60,
800,
3726,
3726,
19,
14,
21,
43,
2160,
1050,
16,
21,
2271,
31,
589,
353,
31,
83,
101,
20,
442,
429,
21,
26478,
2478,
15,
54,
13,
22,
25865,
361... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 would Visual Studio/CLR produce a "bad" executable?
===
This is a weird problem I have started having recently. My team is developing a COTS application and we have a few people with their hands in the code. A few weeks ago, I received an error message when trying to debug (and run the compiled EXE):
> "Windows... | 0 | [
2,
483,
83,
3458,
1120,
118,
5316,
139,
2213,
21,
13,
7,
5989,
7,
1396,
17194,
5924,
60,
800,
3726,
3726,
48,
25,
21,
5455,
1448,
31,
57,
373,
452,
1989,
9,
51,
173,
25,
3561,
21,
13,
9546,
18,
3010,
17,
95,
57,
21,
310,
148... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Copying Xml docs for implemented intefaces
===
When you use a tool like Resharper to implement an interface, you can choose to copy the Xml documentation markup. Of course there are times when the comments are going to be different for the concrete classes - but in the cases where they are identical, we now have a cle... | 0 | [
2,
4344,
68,
23504,
9765,
18,
26,
6807,
19,
591,
6413,
18,
800,
3726,
3726,
76,
42,
275,
21,
5607,
101,
302,
23646,
106,
20,
8713,
40,
6573,
15,
42,
92,
3538,
20,
4344,
14,
23504,
13945,
943,
576,
9,
16,
674,
80,
50,
436,
76,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I securly pass user credentials from a server to a client?
===
My goal is to launch an installation with admin credentials(user with install rights), In order to do this I need to pass these user credentials from a webservice. So the question is What is the most secure way I could pass this data. Keeping in m... | 0 | [
2,
184,
107,
31,
1353,
4734,
102,
1477,
4155,
5059,
43,
10107,
18,
37,
21,
8128,
20,
21,
6819,
60,
800,
3726,
3726,
51,
1195,
25,
20,
3394,
40,
7758,
29,
21,
43,
2160,
5059,
43,
10107,
18,
5,
16704,
29,
16146,
1096,
6,
15,
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... |
How do you declare an interface in c++
===
How do i setup a class that represents an interface? Is this just an abstract base class? | 0 | [
2,
184,
107,
42,
10123,
40,
6573,
19,
272,
20512,
800,
3726,
3726,
184,
107,
31,
18161,
21,
718,
30,
4719,
40,
6573,
60,
25,
48,
114,
40,
8502,
1000,
718,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Ambiguous column name error
===
When executing the following SQL statement:
SELECT
DISTINCT A.ARTIFACTTYPE, A.ARTIFACTTNS, A.ARTIFACTNAME
FROM
(SELECT
DISTINCT ARTIFACTTYPE, ARTIFACTTNS, ARTIFACTNAME FROM {PROPERTIES_TABLE_NAME} WHERE PNAME = 'AcmeSystemName' AND PVALUE = 'MyRuleGroup' UN... | 0 | [
2,
22154,
4698,
204,
7019,
800,
3726,
3726,
76,
25836,
14,
249,
4444,
255,
3331,
45,
5407,
4421,
21,
9,
2900,
49,
16839,
4474,
15,
21,
9,
2900,
49,
16839,
38,
2172,
15,
21,
9,
2900,
49,
16839,
7259,
37,
13,
5,
18,
16964,
4421,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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: converting strings for use with ctypes.c_void_p()
===
given a string:
msg="hello world"
**How can I define this as a `ctypes.c_void_p()` data type?**
the following code yields a "cannot be converted to pointer" exception:
data=ctypes.c_void_p(msg)
`data` is required to be a `void*` typ... | 0 | [
2,
20059,
45,
19583,
7887,
26,
275,
29,
272,
4474,
18,
9,
150,
1,
2625,
1340,
1,
306,
5,
6,
800,
3726,
3726,
504,
21,
3724,
45,
4235,
263,
3726,
7,
11515,
126,
7,
13,
1409,
1544,
92,
31,
9267,
48,
28,
21,
13,
1,
150,
4474,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Security implications of Request.ServerVariables("REMOTE_ADDR") vs Request.ServerVariables("HTTP_X_FORWARDED_FOR")
===
Let's say we're tracking the end-user IP for a web service:
ip = Request.ServerVariables("HTTP_X_FORWARDED_FOR")
If ip = "" Then
ip = Request.ServerVariables("REMOTE_ADDR")
E... | 0 | [
2,
1221,
14747,
16,
3772,
9,
10321,
106,
8220,
579,
18,
5,
7,
99,
20209,
1,
14854,
139,
7,
6,
4611,
3772,
9,
10321,
106,
8220,
579,
18,
5,
7,
21127,
1,
396,
1,
21216,
69,
1,
1106,
7,
6,
800,
3726,
3726,
408,
22,
18,
395,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to read ".NET Data Provider for SqlServer" performance counters from MS Test?
===
How do I read from the performance counter "NumberOfActiveConnections" of the category ".NET Data Provider for SqlServer" from a unit test in MS Test?
I'm trying the following but it seems like I get the instance name wrong. The [... | 0 | [
2,
184,
20,
1302,
13,
7,
9,
2328,
1054,
11747,
26,
4444,
255,
10321,
106,
7,
956,
2105,
18,
37,
4235,
1289,
60,
800,
3726,
3726,
184,
107,
31,
1302,
37,
14,
956,
2105,
13,
7,
16299,
1041,
7889,
25996,
5757,
7,
16,
14,
3230,
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... |
Fluent NHibernate, joined-subclass mapping
===
I'm trying to map a joined-subclass scenario using Fluent NHibernate.
I have a class Entity defined in the namespace Core, and a class
SubClass : Entity in the namespace SomeModule
Now I obviously don't want class Entity to know about its derived
types, the SomeModu... | 0 | [
2,
19252,
12109,
15191,
8820,
15,
670,
8,
7563,
1898,
13305,
800,
3726,
3726,
31,
22,
79,
749,
20,
2942,
21,
670,
8,
7563,
1898,
12705,
568,
19252,
12109,
15191,
8820,
9,
31,
57,
21,
718,
9252,
2811,
19,
14,
204,
5582,
2884,
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... |
How do I reference a scalar in a hash reference in Perl?
===
Simple question:
How do I do this on one line:
my $foo = $bar->{baz};
fizz(\$foo);
I've tried \$bar->{baz}, \${$bar->{baz}}, and numerous others. Is this even possible?
-fREW | 0 | [
2,
184,
107,
31,
2801,
21,
28960,
19,
21,
19170,
2801,
19,
416,
255,
60,
800,
3726,
3726,
1935,
1301,
45,
184,
107,
31,
107,
48,
27,
53,
293,
45,
51,
5579,
4120,
111,
800,
5579,
1850,
8,
1,
969,
380,
1,
73,
398,
17470,
5,
1,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Strange Error in .net Application. - RijndaelManaged..
===
During a recent load test, I've been getting some strange "Index Out of Range Exception"
Stack trace:
at System.Security.Cryptography.RijndaelManagedTransform.DecryptData(Byte[] inputBuffer, Int32 inputOffset, Int32 inputCount, Byte[]& outputB... | 0 | [
2,
2578,
7019,
19,
13,
9,
2328,
3010,
9,
13,
8,
13,
16504,
8245,
19965,
8030,
9,
9,
800,
3726,
3726,
112,
21,
1764,
6305,
1289,
15,
31,
22,
195,
74,
1017,
109,
2578,
13,
7,
25671,
70,
16,
978,
5391,
7,
7566,
5565,
45,
35,
32... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you sort a generic list in C# and allow NULL items to appear first in the list?
===
I have a generic list of objects in C#, for example sake, here's what the object might be.
public class Thing {
public string Name { get; set; }
public DateTime EditDate { get; set; }
}
v... | 0 | [
2,
184,
107,
42,
2058,
21,
12733,
968,
19,
272,
5910,
17,
1655,
16203,
3755,
20,
1893,
64,
19,
14,
968,
60,
800,
3726,
3726,
31,
57,
21,
12733,
968,
16,
3916,
19,
272,
5910,
15,
26,
823,
8132,
15,
235,
22,
18,
98,
14,
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,
1... |
Nassi-Shneiderman Diagram Editor
===
I have to do some work for college and my professor likes to torture us with Nassi-Shneiderman diagrams.
Has anyone a good editor/graphcial tool to draw these? Requirements:
- cross platform (or able to run within wine)
- open source (or a least free to for privat use) | 0 | [
2,
13,
103,
11464,
8,
18,
5905,
14138,
12931,
14161,
1835,
800,
3726,
3726,
31,
57,
20,
107,
109,
170,
26,
314,
17,
51,
1032,
101,
18,
20,
7897,
182,
29,
13,
103,
11464,
8,
18,
5905,
14138,
12931,
14161,
18,
9,
63,
1276,
21,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I remove / clear items out of a list control in Flex?
===
Title says it all, I have a list control in Flex that has been data bound to an e4x xml object from an HTTPService.
I would now like to have a button that clears the list, how can I do this?
I have tried:
<pre>
<code>
list.dataProvider = nul... | 0 | [
2,
184,
92,
31,
4681,
13,
118,
1207,
3755,
70,
16,
21,
968,
569,
19,
14409,
60,
800,
3726,
3726,
581,
898,
32,
65,
15,
31,
57,
21,
968,
569,
19,
14409,
30,
63,
74,
1054,
4138,
20,
40,
13,
62,
300,
396,
23504,
3095,
37,
40,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Functional alternative?
===
As I continue my quest of learning functional programming, I've come
to wonder if there may be alternatives to my default "procedural" way
of thinking. To be more specific, I'm looking at a function I
wrote. Here is what it does:
Swap two elements of an unordered list of numbers, ... | 0 | [
2,
7652,
2676,
60,
800,
3726,
3726,
28,
31,
1816,
51,
7769,
16,
2477,
7652,
3143,
15,
31,
22,
195,
340,
20,
2666,
100,
80,
123,
44,
2676,
18,
20,
51,
12838,
13,
7,
15617,
69,
10018,
7,
161,
16,
1440,
9,
20,
44,
91,
1903,
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... |
Javascript on scroll to end
===
Sometimes software installers force you to scroll to the end of the EULA before the “I agree” box is enabled. How can I produce the same effect on a web page? | 0 | [
2,
8247,
8741,
27,
12159,
20,
241,
800,
3726,
3726,
1030,
2306,
16146,
445,
558,
42,
20,
12159,
20,
14,
241,
16,
14,
2898,
531,
115,
14,
13,
1,
49,
4524,
1,
1649,
25,
9338,
9,
184,
92,
31,
2213,
14,
205,
1590,
27,
21,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is the difference between include and require in Ruby?
===
My question is similar to [this one over here][1] about include and extend.
What's the difference between `require` and `include` in Ruby? If I just want to use the methods from a module in my class, should I `require` it or `include` it?
[1]: ... | 0 | [
2,
98,
25,
14,
2841,
128,
468,
17,
4077,
19,
10811,
60,
800,
3726,
3726,
51,
1301,
25,
835,
20,
636,
1565,
53,
84,
235,
500,
2558,
165,
500,
88,
468,
17,
7206,
9,
98,
22,
18,
14,
2841,
128,
13,
1,
99,
3003,
99,
1,
17,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I generate a Findbugs report using ANT?
===
How do I setup an Ant task to generate a Findbugs report? | 0 | [
2,
184,
107,
31,
7920,
21,
477,
16254,
18,
1330,
568,
40,
38,
60,
800,
3726,
3726,
184,
107,
31,
18161,
40,
40,
38,
3005,
20,
7920,
21,
477,
16254,
18,
1330,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What current tutorials exist for c/c++ for antrl 3.1?
===
I have written a parser in boost:spirit and now I wish to write the same stuff in antlr 3.1.1 to see if there are any performance gains or if it might be a better way to go about it as it also exports to many other languages besides c++ (The current 3.x branch ... | 0 | [
2,
98,
866,
29724,
18,
3182,
26,
272,
118,
150,
20512,
26,
40,
38,
6362,
203,
9,
165,
60,
800,
3726,
3726,
31,
57,
642,
21,
2017,
4104,
19,
10419,
45,
23886,
17,
130,
31,
2536,
20,
2757,
14,
205,
3217,
19,
40,
38,
12988,
203,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
GDI handles . . .
===
what is the based way to track and lower GDI windows handles . . | 0 | [
2,
489,
1115,
3053,
18,
13,
9,
13,
9,
13,
9,
800,
3726,
3726,
98,
25,
14,
432,
161,
20,
792,
17,
987,
489,
1115,
1936,
3053,
18,
13,
9,
13,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.