unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Writing a 'technical work plan'
===
I'm applying for grant to fund part of the development of a web app, one question I'm stuck on says to describe the:
**Tasks and full technical details and risks relating to your project, including detailed technical work plan**
Any guidance on what specific topics should be... | 0 | [
2,
1174,
21,
13,
22,
22307,
170,
944,
22,
800,
3726,
3726,
31,
22,
79,
11989,
26,
2048,
20,
2780,
141,
16,
14,
522,
16,
21,
2741,
4865,
15,
53,
1301,
31,
22,
79,
4549,
27,
898,
20,
4996,
14,
45,
13,
1409,
6922,
4020,
17,
503... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Parsing a Date Range in C# - ASP.NET
===
Given say 11/13/2008 - 12/11/2008 as the value posted back in TextBox, what would be the best way to parse out the start and end date using C#?
I know I could use:
DateTime startDate = Convert.ToDateTime(TextBoxDateRange.Text.Substring(0, 10));
DateTime endDate =... | 0 | [
2,
2017,
18,
68,
21,
1231,
978,
19,
272,
5910,
13,
8,
28,
306,
9,
2328,
800,
3726,
3726,
504,
395,
547,
11698,
9280,
2753,
13,
8,
390,
11698,
8197,
2753,
28,
14,
1923,
6054,
97,
19,
1854,
5309,
15,
98,
83,
44,
14,
246,
161,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to indent Python list-comprehensions?
===
List comprehensions can be useful in certain situations, but they can also be rather horrible to read.. As a slightly exaggerated example, how would you indent the following?
allUuids = [x.id for x in self.db.query(schema.allPostsUuid).execute(timeout = 20) if x.typ... | 0 | [
2,
184,
20,
19,
817,
38,
20059,
968,
8,
11103,
99,
6077,
18,
5757,
60,
800,
3726,
3726,
968,
27300,
18,
92,
44,
4811,
19,
1200,
8329,
15,
47,
59,
92,
67,
44,
864,
9244,
20,
1302,
9,
9,
28,
21,
1847,
19200,
823,
15,
184,
83,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Gotchas: Upgrading from single servers to web farms.
===
Our company currently runs two Windows 2003 servers (a web server & a MSSQL 8 database server). We're planning to add another couple of servers for redundancy / availability purposes in a web farm setup. Our web sites are predominately ASP.NET, we do have a few ... | 0 | [
2,
330,
1651,
18,
45,
26939,
37,
345,
17595,
20,
2741,
9003,
9,
800,
3726,
3726,
318,
237,
871,
1461,
81,
1936,
973,
17595,
13,
5,
58,
2741,
8128,
279,
21,
4235,
18,
22402,
469,
6018,
8128,
6,
9,
95,
22,
99,
2334,
20,
3547,
22... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to use generics in a world of mixed Java versions?
===
I like generics a lot and use them whereever I can. Every now and then I need to use one of my classes in another project which has to run on an old JVM (before 5.0), needs to run on JavaME (where generics are not allowed neither) or in Microsoft J# (which has... | 0 | [
2,
184,
20,
275,
12733,
18,
19,
21,
126,
16,
2198,
8247,
3281,
60,
800,
3726,
3726,
31,
101,
12733,
18,
21,
865,
17,
275,
105,
113,
5221,
31,
92,
9,
352,
130,
17,
94,
31,
376,
20,
275,
53,
16,
51,
2684,
19,
226,
669,
56,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
python as a "batch" script (i.e. run commands from python)
===
I'm working in a windows environment (my laptop!) and I need a couple of scripts that run other programs, pretty much like a windows batch file.
how can I run a command from python such that the program when run, will replace the script? The program is ... | 0 | [
2,
20059,
28,
21,
13,
7,
4900,
673,
7,
3884,
13,
5,
49,
9,
62,
9,
485,
14294,
37,
20059,
6,
800,
3726,
3726,
31,
22,
79,
638,
19,
21,
1936,
2307,
13,
5,
915,
12294,
187,
6,
17,
31,
376,
21,
1335,
16,
17505,
30,
485,
89,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 XML as (read only) human readable datasource for survey questions
===
Scientific or market research questionnaires mainly consist of questions in the following form:
*INTRO:* Indicate how much you agree with the following statements...
*OPTIONS:* very much - rather - so-so - rather not - not at all
*ITE... | 0 | [
2,
568,
23504,
28,
13,
5,
10647,
104,
6,
585,
1302,
579,
1054,
12097,
26,
3431,
2346,
800,
3726,
3726,
2272,
54,
1135,
527,
29499,
18,
2011,
7929,
16,
2346,
19,
14,
249,
505,
45,
1637,
23979,
45,
2483,
4342,
184,
212,
42,
4524,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 constitutes a rich domain model in a POJO/POCO?
===
What is the difference between
* A simple *fields-accesors-mutators* class
* A rich-modeled class
What constitutes rich modeling in business-domain classes? | 0 | [
2,
98,
20362,
21,
2042,
4603,
1061,
19,
21,
2353,
1636,
118,
1638,
716,
60,
800,
3726,
3726,
98,
25,
14,
2841,
128,
1637,
21,
1935,
1637,
1109,
18,
8,
1738,
5052,
248,
18,
8,
7903,
9922,
2483,
718,
1637,
21,
2042,
8,
13998,
69,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Accidental overwrite of OSX Python system framework
===
I got ahead of myself and downloaded and installed the OSX Python 2.6 package from www.python.org/download/ on my OSX 10.5.5 Intel Mac and installed the full package contents. Only after this did I come across http://wiki.python.org/moin/MacPython/Leopard stating... | 0 | [
2,
20210,
84,
23716,
16,
13,
759,
396,
20059,
329,
6596,
800,
3726,
3726,
31,
330,
2173,
16,
992,
17,
23887,
17,
4066,
14,
13,
759,
396,
20059,
172,
9,
379,
6030,
37,
13,
6483,
9,
6448,
11570,
9,
5583,
118,
2968,
8294,
118,
27,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to update created and modified fields using the repository design pattern?
===
I am currently working on my **first** asp.net mvc application. I am trying to drink the kool-aid of all the the sample projects I see and trying to use the **repository design pattern**.
I have a interface called IUserRepository th... | 0 | [
2,
184,
20,
11100,
679,
17,
5372,
2861,
568,
14,
24869,
704,
3732,
60,
800,
3726,
3726,
31,
589,
871,
638,
27,
51,
13,
1409,
3552,
1409,
28,
306,
9,
2328,
307,
8990,
3010,
9,
31,
589,
749,
20,
2610,
14,
13,
24984,
8,
8830,
16,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Duck type as syntactic sugar for reflection: Good or bad idea?
===
I've been thinking lately, would it be a good form of syntactic sugar in languages like Java and C#, to include a "duck" type as a method parameter type? This would look as follows:
void myFunction(duck foo) {
foo.doStuff();
}
... | 0 | [
2,
7026,
1001,
28,
6063,
6981,
1786,
4200,
26,
9138,
45,
254,
54,
896,
882,
60,
800,
3726,
3726,
31,
22,
195,
74,
1440,
10434,
15,
83,
32,
44,
21,
254,
505,
16,
6063,
6981,
1786,
4200,
19,
2556,
101,
8247,
17,
272,
5910,
15,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
python datetime help needed
===
I'm only just starting out with python so I'm still pretty clueless.
What I'm trying to do is to get the date from the pc and adding it to a list.
This is my code:
import datetime
today = datetime.date.today()
print today
This prints: 2008-11-22 which is exactly what I want BU... | 0 | [
2,
20059,
1231,
891,
448,
851,
800,
3726,
3726,
31,
22,
79,
104,
114,
1422,
70,
29,
20059,
86,
31,
22,
79,
174,
1772,
8906,
923,
9,
98,
31,
22,
79,
749,
20,
107,
25,
20,
164,
14,
1231,
37,
14,
5168,
17,
4721,
32,
20,
21,
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 deal with a Many-To-Many Relation in my API
===
I have two entities Foo and Bar with a Many to Many relationship between them.
Let's say there is no semantic argument for why Foo might be "responsible" for the many to many relationship, but we arbitrarily decide that Foo is responsible for the relation (I.e.... | 0 | [
2,
184,
20,
1183,
29,
21,
151,
8,
262,
8,
14842,
5827,
19,
51,
21,
2159,
800,
3726,
3726,
31,
57,
81,
12549,
4310,
111,
17,
748,
29,
21,
151,
20,
151,
1429,
128,
105,
9,
408,
22,
18,
395,
80,
25,
90,
17220,
5476,
26,
483,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JQuery - replace one string for another in .load-ed html?
===
I'm loading an html snippet using
$("#TemplateDump").load("Themes/default.template", function() { processTemplate() })
The html i am loading contains
<div>
`hello ##name##, your age is ##age##.
your page is <a href="##website##"... | 0 | [
2,
487,
8190,
93,
13,
8,
3934,
53,
3724,
26,
226,
19,
13,
9,
8294,
8,
69,
13,
15895,
60,
800,
3726,
3726,
31,
22,
79,
12797,
40,
13,
15895,
13,
29061,
568,
5579,
5,
7,
5910,
9577,
6554,
43,
11134,
7,
6,
9,
8294,
5,
7,
124,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Public free web services for testing soap client
===
Are there any publicly available [SOAP 1.2][1]/[WSDL 2.0][2] compliant free web services for testing a Python based soap client library (e.g. [Zolera SOAP Infrastructure][3])?
So far, it appears to me that [Google Web API][4] is the only option.
Otherwise, ho... | 0 | [
2,
317,
551,
2741,
687,
26,
4431,
6447,
6819,
800,
3726,
3726,
50,
80,
186,
6713,
904,
636,
656,
2552,
137,
9,
135,
500,
2558,
165,
500,
118,
2558,
10268,
8643,
172,
9,
387,
500,
2558,
135,
500,
13,
25509,
551,
2741,
687,
26,
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 learn work effectively with Unix CLI
===
Do you know any resources that tech to good habits of working in UNIX command line?
| 0 | [
2,
184,
20,
2484,
170,
5463,
29,
22540,
19391,
800,
3726,
3726,
107,
42,
143,
186,
2566,
30,
6145,
20,
254,
16760,
16,
638,
19,
22540,
1202,
293,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
MySql – how do you find the time down to the Millisecond
===
Is there any way to get the time down to the Millisecond in MySql
| 0 | [
2,
51,
18,
22402,
13,
10,
184,
107,
42,
477,
14,
85,
125,
20,
14,
13436,
5007,
800,
3726,
3726,
25,
80,
186,
161,
20,
164,
14,
85,
125,
20,
14,
13436,
5007,
19,
51,
18,
22402,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
C# work around for XmlSerializer.Deserialize pitfall?
===
I was just wondering if there are any good work-arounds for Deserializing private fields/properties using XmlSerializer.Deserialize() ?
Currently, I Deserialize my XML to a simple disposable type with all public properties, then I load the complex type that ... | 0 | [
2,
272,
5910,
170,
140,
26,
23504,
4104,
2815,
11907,
9,
3196,
106,
2815,
2952,
4175,
5660,
60,
800,
3726,
3726,
31,
23,
114,
5712,
100,
80,
50,
186,
254,
170,
8,
10037,
18,
26,
1746,
106,
2815,
3335,
932,
2861,
118,
10890,
106,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 put (parts of) a large object graph in Rails.cache?
===
I have a class in which looking up an instance is expensive, so instances are cached:
class Foo
def self.find(id)
Rails.cache.fetch("Foo.#{id}") do
// some expensive lookup, like an HTTParty request, or a long SQL query... | 0 | [
2,
184,
92,
31,
442,
13,
5,
3091,
18,
16,
6,
21,
370,
3095,
7210,
19,
2240,
18,
9,
793,
2569,
60,
800,
3726,
3726,
31,
57,
21,
718,
19,
56,
699,
71,
40,
4851,
25,
5381,
15,
86,
13946,
50,
16522,
43,
45,
718,
4310,
111,
631... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
TDbComboBox doesn't change the first time it's changed.
===
I'm using D2009, and I have a TDbComboBox on my form, and if I click on it, then click an option from the menu, the first time I do so it doesn't change. The OnChange event handler fires, but ItemIndex remains at 0 (where it started at) instead of being upda... | 0 | [
2,
13,
38,
9007,
960,
1192,
5309,
1437,
22,
38,
753,
14,
64,
85,
32,
22,
18,
1015,
9,
800,
3726,
3726,
31,
22,
79,
568,
13,
43,
2849,
15,
17,
31,
57,
21,
13,
38,
9007,
960,
1192,
5309,
27,
51,
505,
15,
17,
100,
31,
10840,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Importing a SQLite3 dump back into the database
===
I feel like this is a stupid question because it seems like common sense . . . but no google search I can put together seems to be able to give me the answer!
I know how to get data OUT of a sqlite3 database using the .dump command. But now that I have this ASCII... | 0 | [
2,
9010,
68,
21,
4444,
10601,
240,
11424,
97,
77,
14,
6018,
800,
3726,
3726,
31,
583,
101,
48,
25,
21,
3553,
1301,
185,
32,
2206,
101,
757,
1259,
13,
9,
13,
9,
13,
9,
47,
90,
8144,
2122,
31,
92,
442,
429,
2206,
20,
44,
777,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Scripting.FileSystemObject.FileExists always returns false
===
I'm attempting to check that a file exists before including it with Server.Execute in Classic ASP. While FileExists() returns False, Server.Execute successfully executes the file. Both calls use the exact same file path.
Why does this happen and how can... | 0 | [
2,
3884,
68,
9,
16877,
10724,
23793,
9,
16877,
1706,
3163,
550,
4815,
4997,
800,
3726,
3726,
31,
22,
79,
6314,
20,
2631,
30,
21,
3893,
5636,
115,
215,
32,
29,
8128,
9,
1706,
17194,
591,
19,
2732,
28,
306,
9,
133,
3893,
1706,
316... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Algorithm for sampling without replacement?
===
I am trying to test the likelihood that a particular clustering of data has occurred by chance. A robust way to do this is Monte Carlo simulation, in which the associations between data and groups are randomly reassigned a large number of times (e.g. 10,000), and a metr... | 0 | [
2,
9083,
26,
19030,
366,
4610,
60,
800,
3726,
3726,
31,
589,
749,
20,
1289,
14,
19096,
30,
21,
1498,
7460,
68,
16,
1054,
63,
2437,
34,
1504,
9,
21,
15313,
161,
20,
107,
48,
25,
5468,
9365,
10926,
15,
19,
56,
14,
10642,
128,
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... |
Performance Optimization For Highly Interactive Websites
===
I have recently completed development of a mid-traficked(?) website (peak 60k hits/hour), however, the site only needs to be updated once a minute - and achieving the required performance can be summed up by a single word: "caching".
For a site like SO wh... | 0 | [
2,
956,
21597,
26,
2157,
9194,
13931,
800,
3726,
3726,
31,
57,
1989,
1066,
522,
16,
21,
907,
8,
1939,
15261,
4616,
5,
60,
6,
2271,
13,
5,
7081,
197,
2083,
197,
3858,
118,
4754,
6,
15,
207,
15,
14,
689,
104,
2274,
20,
44,
6372,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 sum a list<> of arrays
===
I have a List<int[]> myList, where I know that all the int[] arrays are the same length - for the sake of argument, let us say I have 500 arrays, each is 2048 elements long. I'd like to sum all 500 of these arrays, to give me a single array, 2048 elements long, where each element... | 0 | [
2,
184,
107,
31,
3907,
21,
968,
1,
16,
7718,
18,
800,
3726,
3726,
31,
57,
21,
968,
1,
6391,
2558,
500,
1,
51,
5739,
15,
113,
31,
143,
30,
65,
14,
19,
38,
2558,
500,
7718,
18,
50,
14,
205,
1476,
13,
8,
26,
14,
8132,
16,
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... |
Simple tips to reduce coupling
===
I have a large .NET web application. The system has projects for different intentions (e.g. CMS, Forum, eCommerce), and I have noticed a (naive) pattern of calling on another project's class. For example, the ecommerce module needs functionality to generate a file on the fly for prod... | 0 | [
2,
1935,
11034,
20,
4136,
20920,
800,
3726,
3726,
31,
57,
21,
370,
13,
9,
2328,
2741,
3010,
9,
14,
329,
63,
2314,
26,
421,
12075,
13,
5,
62,
9,
263,
9,
2390,
18,
15,
5691,
15,
13,
62,
26470,
6,
15,
17,
31,
57,
2711,
21,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL query to return rows sorted by key plus empty rows for missing keys
===
I have a table that has, in essence, this structure:
<pre> key value
------ ------
2 val1
3 val2
5 val3</pre>
The keys are sequential integers from 1 up to (currently) 1 million, increasing by ... | 0 | [
2,
4444,
255,
25597,
20,
788,
11295,
22554,
34,
1246,
3123,
2424,
11295,
26,
2863,
5534,
800,
3726,
3726,
31,
57,
21,
859,
30,
63,
15,
19,
11887,
15,
48,
1411,
45,
13,
1,
3515,
1,
1246,
1923,
13,
8,
8,
8,
8,
8,
8,
13,
8,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What language would people recomend as simple gui that can be used as input to a script runing on cygwin.
===
I need a simple window three input boxes and three labels (login name, password, and server node) and a button to execute the script. I do not want any third party programs that need to be installed on windows... | 0 | [
2,
98,
816,
83,
148,
302,
960,
2451,
28,
1935,
9457,
30,
92,
44,
147,
28,
6367,
20,
21,
3884,
485,
68,
27,
6728,
263,
4181,
9,
800,
3726,
3726,
31,
376,
21,
1935,
1463,
132,
6367,
8120,
17,
132,
13173,
13,
5,
5567,
108,
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... |
Wpf custom control template - relative font size
===
I am creating a custom WPF control that let's say for simplicity sake has a vertical stack panel with a "title" TextBlock, followed by a ContentPresenter. I want the font size for the "title" to be 5 Points LARGER than the size used in the content, which is inherite... | 0 | [
2,
619,
7721,
5816,
569,
22894,
13,
8,
4543,
9978,
1072,
800,
3726,
3726,
31,
589,
2936,
21,
5816,
619,
7721,
569,
30,
408,
22,
18,
395,
26,
20595,
8132,
63,
21,
7035,
7566,
4113,
29,
21,
13,
7,
22235,
7,
1854,
12048,
15,
709,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
check if X is derived of Y via typeid
===
i need to convert pointers to long (SendMessage())
and i want to safely check if the variable is correct on the otherside. So i was thinking of doing dynamic_cast but that wont work on classes that are not virtual. Then i thought of doing typeid but that will work until i pas... | 0 | [
2,
2631,
100,
993,
25,
3981,
16,
13,
93,
1197,
1001,
1340,
800,
3726,
3726,
31,
376,
20,
8406,
454,
445,
20,
175,
13,
5,
18,
2451,
3845,
18,
1303,
5,
6,
6,
17,
31,
259,
20,
9817,
2631,
100,
14,
7612,
25,
4456,
27,
14,
89,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the status of 4D?
===
Our business uses 4D as our database and dynamic web server (and has been for at least the last 8 years). I understand that 4D used to be rather big as a all-in-one solution for serving web applications on the Mac in the past, but I don't see evidence of much continued use of it nowadays.... | 0 | [
2,
98,
22,
18,
14,
1782,
16,
268,
43,
60,
800,
3726,
3726,
318,
508,
2027,
268,
43,
28,
318,
6018,
17,
7782,
2741,
8128,
13,
5,
290,
63,
74,
26,
35,
639,
14,
236,
469,
122,
6,
9,
31,
1369,
30,
268,
43,
147,
20,
44,
864,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Viewing swf files in magazine format
===
I have a set of swf files and can view them one at a time. However what I would like to is to view them in magazine format, as below:
First view is: swf file1 (magazine front cover)
Next view: swf file2 (magazine page 1) on left + swf file3 (magazine page 2) on right
Next vi... | 0 | [
2,
11244,
13,
18,
15263,
6488,
19,
1039,
2595,
800,
3726,
3726,
31,
57,
21,
309,
16,
13,
18,
15263,
6488,
17,
92,
1418,
105,
53,
35,
21,
85,
9,
207,
98,
31,
83,
101,
20,
25,
20,
1418,
105,
19,
1039,
2595,
15,
28,
1021,
45,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Parsing GPS receiver output via regex in Python
===
I have a friend who is finishing up his masters degree in aerospace engineering. For his final project, he is on a small team tasked with writing a program for tracking weather balloons, rockets and satellites. The program receives input from a GPS device, does calcu... | 0 | [
2,
2017,
18,
68,
18298,
6264,
5196,
1197,
7953,
1706,
19,
20059,
800,
3726,
3726,
31,
57,
21,
860,
72,
25,
3718,
71,
33,
5001,
1168,
19,
15121,
1552,
9,
26,
33,
426,
669,
15,
24,
25,
27,
21,
284,
173,
14605,
29,
1174,
21,
625,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 - Create a list/dict with Initial Capacity
===
Code like this often happens:
l = []
while foo:
#baz
l.append(bar)
#qux
This is really slow if you're about to append thousands of elements to your list, as the list will have to constantly be re-initialized to grow. (I und... | 0 | [
2,
20059,
13,
8,
1600,
21,
968,
118,
16315,
29,
2104,
2301,
800,
3726,
3726,
1797,
101,
48,
478,
5531,
45,
644,
800,
20767,
133,
4310,
111,
45,
6926,
969,
380,
644,
9,
22358,
43,
5,
1850,
6,
6926,
5495,
396,
48,
25,
510,
2276,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MSBuild ITaskItem array is out of date
===
I'm creating a custom ITask for MSBuild which uploads the output files of my build to Fondario. I'm using a web deployment project to publish my app and hooking in to the AfterBuild target to do my custom work.
If I add a file to my web application, the first time I do a ... | 0 | [
2,
4235,
29361,
32,
20310,
2119,
79,
7718,
25,
70,
16,
1231,
800,
3726,
3726,
31,
22,
79,
2936,
21,
5816,
32,
20310,
26,
4235,
29361,
56,
71,
8294,
18,
14,
5196,
6488,
16,
51,
1895,
20,
7625,
8756,
9,
31,
22,
79,
568,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Schema (XSD) for Microsoft .NET configuration file
===
I'm searching the XSD (XML Schema) for the Microsoft .NET application configuration files. Till now I found only this: [Configuration File Schema for the .NET Framework][1] but I'm more interested in the XSD.
Or - asked in general - I search also XSDs in genera... | 0 | [
2,
23874,
13,
5,
396,
18,
43,
6,
26,
7099,
13,
9,
2328,
8091,
3893,
800,
3726,
3726,
31,
22,
79,
5792,
14,
993,
18,
43,
13,
5,
396,
8184,
23874,
6,
26,
14,
7099,
13,
9,
2328,
3010,
8091,
6488,
9,
3924,
130,
31,
216,
104,
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... |
AS400 C#.net inserting new record problems
===
I am trying to build a C#.net program that works like a RPG Subfile on the AS400.
Have the general subfile part working. I can display and then edit and update existing records.
Am blowing up in my code where I am trying to insert a new record. Blowing up on the
... | 0 | [
2,
28,
7114,
272,
5910,
9,
2328,
14692,
68,
78,
571,
1716,
800,
3726,
3726,
31,
589,
749,
20,
1895,
21,
272,
5910,
9,
2328,
625,
30,
693,
101,
21,
22338,
972,
16877,
27,
14,
28,
7114,
9,
57,
14,
297,
972,
16877,
141,
638,
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... |
Exit Edit Mode
===
I have an array of objects which populate a UITableView. When a user removes the last object from the array, I automatically create a new "default" object. However, in the TableView, when the user gets there, the list is still in "Edit" mode. Is there a way for me to programatically set the TableVie... | 0 | [
2,
4350,
9392,
3740,
800,
3726,
3726,
31,
57,
40,
7718,
16,
3916,
56,
1675,
12383,
21,
13,
11193,
579,
4725,
9,
76,
21,
4155,
4681,
18,
14,
236,
3095,
37,
14,
7718,
15,
31,
7499,
1600,
21,
78,
13,
7,
13862,
9708,
7,
3095,
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... |
W3C Involvement In Flash & Silverlight
===
It seems to me that the key USP of Flash/Silverlight is the ability to provide access (albeit indirectly) to the graphics subsystem of the client, enabling video, smooth transitions and "fancy" visual effects.
This sounds like a good idea, and a natural evolution/extension... | 0 | [
2,
619,
240,
150,
5679,
19,
4433,
279,
1172,
3130,
800,
3726,
3726,
32,
2206,
20,
55,
30,
14,
1246,
182,
306,
16,
4433,
118,
16782,
3130,
25,
14,
2165,
20,
1181,
1381,
13,
5,
192,
863,
242,
20713,
6,
20,
14,
8351,
972,
10724,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Unit Testing with functions that return random results
===
I don't think that this is specific to a language or framework, but I am using xUnit.net and C#.
I have a function that returns a random date in a certain range. I pass in a date, and the returning date is always in range of 1 to 40 years before the given d... | 0 | [
2,
1237,
4431,
29,
3719,
30,
788,
5477,
1736,
800,
3726,
3726,
31,
221,
22,
38,
277,
30,
48,
25,
1903,
20,
21,
816,
54,
6596,
15,
47,
31,
589,
568,
993,
15464,
9,
2328,
17,
272,
5910,
9,
31,
57,
21,
1990,
30,
4815,
21,
5477,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 associate ".js.php" to JavaScript Syntax in the NetBeans 6.5 IDE?
===
When I generate CSS or JavaScript files using PHP I like to use .js.php or .css.php file extensions. so that I know what's going on.
Is there a way of associating these "compound" file extensions to their respective languages? | 0 | [
2,
184,
92,
31,
4169,
13,
7,
9,
728,
18,
9,
26120,
7,
20,
8247,
8741,
22649,
19,
14,
4275,
863,
5950,
400,
9,
264,
13,
3448,
60,
800,
3726,
3726,
76,
31,
7920,
272,
18,
18,
54,
8247,
8741,
6488,
568,
13,
26120,
31,
101,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Maximize SDL window
===
How should I tell SDL to maximize the application window?
I'm creating the window with these flags: SDL_OPENGL | SDL_HWSURFACE | SDL_DOUBLEBUF | SDL_RESIZABLE.
Thanks for your replies | 0 | [
2,
23952,
13,
18,
8643,
1463,
800,
3726,
3726,
184,
378,
31,
494,
13,
18,
8643,
20,
23952,
14,
3010,
1463,
60,
31,
22,
79,
2936,
14,
1463,
29,
158,
9318,
45,
13,
18,
8643,
1,
10157,
8430,
13,
1,
13,
18,
8643,
1,
252,
499,
18... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are there any standard texts on the subject of Software Testing?
===
I found two general books on software engineering ([Software Engineering 7.5 by Ian Sommerville][1] and [Software Engineering by Roger S Pressman][2]) and that have chapters on testing and validation and verification, however are there any "required ... | 0 | [
2,
50,
80,
186,
1236,
6381,
27,
14,
1550,
16,
2306,
4431,
60,
800,
3726,
3726,
31,
216,
81,
297,
964,
27,
2306,
1552,
13,
5,
2558,
12980,
5011,
1552,
453,
9,
264,
34,
5899,
24856,
1125,
500,
2558,
165,
500,
17,
636,
12980,
5011,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tool to trace local function calls in Linux
===
I am looking for a tool like [ltrace][1] or [strace][2] that can trace locally defined functions in an executable. ltrace only traces dynamic library calls and strace only traces system calls. For example, given the following C program:
#include <stdio.h>
... | 0 | [
2,
5607,
20,
5565,
375,
1990,
3029,
19,
13024,
800,
3726,
3726,
31,
589,
699,
26,
21,
5607,
101,
636,
255,
38,
7367,
500,
2558,
165,
500,
54,
636,
384,
7367,
500,
2558,
135,
500,
30,
92,
5565,
6680,
2811,
3719,
19,
40,
1396,
171... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Autocreate stub properties for interfaces in C#?
===
I've switch from VB.NET to C# several months ago, while there are a lot of features I **really** like in C#, believe it or not, there are some features that I **really** miss from VB.NET.
One of those features is whenever I implemented an interface in VB.NET the ... | 0 | [
2,
3108,
6037,
1373,
21354,
3704,
26,
6573,
18,
19,
272,
5910,
60,
800,
3726,
3726,
31,
22,
195,
5521,
37,
13,
20468,
9,
2328,
20,
272,
5910,
238,
818,
1464,
15,
133,
80,
50,
21,
865,
16,
967,
31,
13,
1409,
15257,
1409,
101,
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 programmatically cancel an embedded MsBuild build
===
I'm embedding MSBuild directly into a more complex build tool. The relevant code looks roughly like this:
// assume 'using Microsoft.Build.BuildEngine;'
Engine e = Engine();
BuildPropertyGroup props = new BuildPropertyGroup();
props.Set... | 0 | [
2,
184,
20,
625,
6732,
1326,
14815,
40,
12138,
4235,
29361,
1895,
800,
3726,
3726,
31,
22,
79,
11911,
69,
3258,
4235,
29361,
1703,
77,
21,
91,
1502,
1895,
5607,
9,
14,
7480,
1797,
1879,
4457,
101,
48,
45,
12894,
7158,
13,
22,
1265... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
how do I get MySQL's exmplain to ignore constants?
===
I have a query I want to optimize that look something like this
select cols from tbl where col = "some runt time value" limit 1;
I want to known what key's are being used but whatever I pass to explain, it is able to optimize the where clause to nothing ... | 0 | [
2,
184,
107,
31,
164,
51,
18,
22402,
22,
18,
1396,
2554,
10792,
20,
7174,
3587,
18,
60,
800,
3726,
3726,
31,
57,
21,
25597,
31,
259,
20,
22864,
30,
361,
301,
101,
48,
5407,
3313,
18,
37,
13,
38,
6287,
113,
3313,
800,
13,
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... |
JButton expanding to take up entire frame/container
===
Hey everyone. I'm trying to make a swing GUI with a button and a label on it. im using a border layout and the label ( in the north field ) shows up fine, but the button takes up the rest of the frame (it's in the center field). any idea how to fix this? | 0 | [
2,
487,
811,
444,
9393,
20,
247,
71,
1078,
3523,
118,
1126,
5851,
106,
800,
3726,
3726,
8409,
1266,
9,
31,
22,
79,
749,
20,
233,
21,
5587,
9457,
29,
21,
5167,
17,
21,
1899,
27,
32,
9,
797,
568,
21,
1862,
9106,
17,
14,
1899,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Staticly linked and Dynamicly linked?
===
I often hear the terms 'staticly linked' and 'dynamicly linked', often in reference to code written in C(++|#) but I don't know much of anything about either, what are they, what exactly are they talking about, and what are they linking? | 0 | [
2,
98,
50,
12038,
102,
4727,
17,
7782,
102,
4727,
60,
800,
3726,
3726,
31,
478,
990,
14,
1663,
13,
22,
18077,
102,
4727,
22,
17,
13,
22,
20985,
102,
4727,
22,
15,
478,
19,
2801,
20,
1797,
642,
19,
272,
5,
20512,
1,
5910,
6,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Java Hashmap and Mutlidimensional array type sig in JNSI?
===
I've got a method JNSI that calls a Java method that take a Hasmap<String, String> as input.
I've tried
handler.@com.mypackage::myMethod(Ljava/util/Hashmap;)(myHashMap);
handler.@com.mypackage::myMethod(Ljava/util/Hashmap<Ljava/lang/String,Lj... | 0 | [
2,
8247,
19170,
15022,
17,
13,
7903,
1210,
7865,
7718,
1001,
8858,
19,
487,
2172,
49,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
2109,
487,
2172,
49,
30,
3029,
21,
8247,
2109,
30,
247,
21,
63,
15022,
1,
11130,
15,
3724,
1,
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 (most productive) FLEX IDE?
===
Some requirements:
* Step-by-step debugging & Break Points
* View variable values while debugging
I'm not concerned about cost (Ok, over $1K gets a little pricey looking :-)
| 0 | [
2,
98,
25,
14,
246,
13,
5,
4630,
15337,
6,
14409,
13,
3448,
60,
800,
3726,
3726,
109,
4786,
45,
1637,
1424,
8,
779,
8,
8375,
121,
16254,
2762,
279,
1442,
819,
1637,
1418,
7612,
4070,
133,
121,
16254,
2762,
31,
22,
79,
52,
3518,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Simple Regular Expression - VB.Net
===
I have a syntax highlighting function in vb.net. I use regular expressions to match "!IF" for instance and then color it blue. This works perfect until I tried to figure out how to do comments.
The language I'm writing this for a comment can either be if the line starts with ... | 0 | [
2,
1935,
1290,
1803,
13,
8,
13,
20468,
9,
2328,
800,
3726,
3726,
31,
57,
21,
22649,
23102,
1990,
19,
13,
20468,
9,
2328,
9,
31,
275,
1290,
13832,
20,
730,
13,
7,
187,
821,
7,
26,
4851,
17,
94,
1665,
32,
705,
9,
48,
693,
2107... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way to stress test a rails web app?
===
Are there any good (preferably free) tools out there?
Can they give accurate estimates that reflect production results when the app goes live? | 0 | [
2,
246,
161,
20,
5384,
1289,
21,
2240,
18,
2741,
4865,
60,
800,
3726,
3726,
50,
80,
186,
254,
13,
5,
3515,
2407,
4801,
551,
6,
4672,
70,
80,
60,
92,
59,
590,
8137,
10527,
30,
6907,
637,
1736,
76,
14,
4865,
1852,
515,
60,
3,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Resharper update namespace on all files in project
===
I know i can update my current files namespace to match the directory structure. Can i do this all at once for all files in a project. | 0 | [
2,
302,
23646,
106,
11100,
204,
5582,
27,
65,
6488,
19,
669,
800,
3726,
3726,
31,
143,
31,
92,
11100,
51,
866,
6488,
204,
5582,
20,
730,
14,
16755,
1411,
9,
92,
31,
107,
48,
65,
35,
382,
26,
65,
6488,
19,
21,
669,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
ViewState, FormView, and Controls
===
How do you (in Visual Studio) compare the controls in the different templates in a formview so you can track down a ViewState error? | 0 | [
2,
1418,
3859,
15,
505,
4725,
15,
17,
8671,
800,
3726,
3726,
184,
107,
42,
13,
5,
108,
3458,
1120,
6,
11590,
14,
8671,
19,
14,
421,
22894,
18,
19,
21,
505,
4725,
86,
42,
92,
792,
125,
21,
1418,
3859,
7019,
60,
3,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Javascript Timing
===
I am trying to create a countdown using javascript. I got some code from [here](http://w3schools.com/js/js_timimg.asp) and modified it slighly.
<code>
<script type="text/javascript">
var c=10;
var t;
function timedCount()
{
document.getElementById('txt').value=c... | 0 | [
2,
8247,
8741,
11812,
800,
3726,
3726,
31,
589,
749,
20,
1600,
21,
22566,
568,
8247,
8741,
9,
31,
330,
109,
1797,
37,
636,
6836,
500,
5,
21127,
6903,
499,
240,
7535,
18,
9,
960,
118,
728,
18,
118,
728,
18,
1,
10002,
1660,
263,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the difference betwene equality and equivalence
===
I've read a few instances in reading mathematics and computer science that use the equivalence symbol, (basically an '=' with three lines) and it always makes sense to me to read this as if it were equality. What is the difference between these two concepts?... | 0 | [
2,
98,
25,
14,
2841,
5676,
458,
556,
10337,
17,
27368,
800,
3726,
3726,
31,
22,
195,
1302,
21,
310,
13946,
19,
1876,
4264,
17,
1428,
762,
30,
275,
14,
27368,
4678,
15,
13,
5,
6093,
8438,
40,
13,
22,
3726,
22,
29,
132,
1560,
6,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Apache Redirect Rule Always fires on every request
===
So the following rewrite rules always seem to fire. This has the effect of hiding another domain that I am hosting on the server?
I can't seem to figure out what's wrong and it is time to call in the experts:
RewriteEngine on
RewriteCond %{HTTP_HOST} ^daniel... | 0 | [
2,
17140,
302,
14706,
1828,
550,
11327,
27,
352,
3772,
800,
3726,
3726,
86,
14,
249,
27891,
1761,
550,
2260,
20,
535,
9,
48,
63,
14,
1590,
16,
5314,
226,
4603,
30,
31,
589,
10637,
27,
14,
8128,
60,
31,
92,
22,
38,
2260,
20,
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... |
Unit testing destructors?
===
Is there any good way to unit test destructors? Like say I have a class like this (contrived) example:
class X
{
private:
int *x;
public:
X()
{
x = new int;
}
~X()
{
delete x;
... | 0 | [
2,
1237,
4431,
13,
20137,
248,
18,
60,
800,
3726,
3726,
25,
80,
186,
254,
161,
20,
1237,
1289,
13,
20137,
248,
18,
60,
101,
395,
31,
57,
21,
718,
101,
48,
13,
5,
1126,
3367,
4763,
6,
823,
45,
718,
993,
13,
1,
932,
45,
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... |
Redirecting cout to a console in windows
===
I have an application which is a relatively old. Through some minor changes, it builds nearly perfectly with Visual C++ 2008. One thing that I've noticed is that my "debug console" isn't quite working right. Basically in the past, I've use AllocConsole() to create a console... | 0 | [
2,
302,
14706,
68,
272,
1320,
20,
21,
8650,
19,
1936,
800,
3726,
3726,
31,
57,
40,
3010,
56,
25,
21,
3109,
315,
9,
120,
109,
1689,
1693,
15,
32,
1895,
18,
1212,
5759,
29,
3458,
272,
20512,
570,
9,
53,
584,
30,
31,
22,
195,
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... |
Getting a unique ID for a window of another application
===
I'm a newbie Cocoa developer and I'm developing my first application. I want to read a unique identifier from any window of any application - whether it's Cocoa or Carbon. Cocoa applications make their window IDs available to AppleScript (although I'm sure th... | 0 | [
2,
1017,
21,
2619,
4924,
26,
21,
1463,
16,
226,
3010,
800,
3726,
3726,
31,
22,
79,
21,
78,
5893,
24507,
10058,
17,
31,
22,
79,
3561,
51,
64,
3010,
9,
31,
259,
20,
1302,
21,
2619,
25570,
37,
186,
1463,
16,
186,
3010,
13,
8,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I convert UNicode to an Integer Value and not raise an exception if the text is not really an integer
===
I have some HTML I am trying to parse. There are cases where the html attributes alone are not going to help me identify the row type (header versus data). Fortunately, if my row is a data row then it sho... | 0 | [
2,
184,
107,
31,
8406,
28010,
20,
40,
13820,
1923,
17,
52,
3972,
40,
5391,
100,
14,
1854,
25,
52,
510,
40,
13820,
800,
3726,
3726,
31,
57,
109,
13,
15895,
31,
589,
749,
20,
2017,
870,
9,
80,
50,
1871,
113,
14,
13,
15895,
13422... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 accordion - using each
===
I am trying to create a custom accordion for my page to that display my posts. I have it in list format using HTML and I am trying to create an effect when you click each header to expand to show more information.
But I don't want to have say 6 blocks of code for 6 of the <li> elem... | 0 | [
2,
5816,
20753,
13,
8,
568,
206,
800,
3726,
3726,
31,
589,
749,
20,
1600,
21,
5816,
20753,
26,
51,
2478,
20,
30,
3042,
51,
9868,
9,
31,
57,
32,
19,
968,
2595,
568,
13,
15895,
17,
31,
589,
749,
20,
1600,
40,
1590,
76,
42,
108... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get a div float to the bottom of its container?
===
I have floated images and inset boxes at the top of a container using float:right (or left) many times. Recently I hit a need to float a div at the bottom right corner of another div with the normal text wrap that you get with float (text wrapped above and t... | 0 | [
2,
184,
107,
31,
164,
21,
13,
12916,
11510,
20,
14,
2129,
16,
82,
12147,
60,
800,
3726,
3726,
31,
57,
15400,
3502,
17,
19,
3554,
8120,
35,
14,
371,
16,
21,
12147,
568,
11510,
45,
4183,
13,
5,
248,
225,
6,
151,
436,
9,
1989,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the most ridiculous pessimization you've seen?
===
We all know that premature optimization is the root of all evil because it leads to unreadable/unmaintainable code. Even worse is pessimization, when someone implements an "optimization" because they *think* it will be faster, but it ends up being slower, as ... | 4 | [
2,
98,
25,
14,
127,
9080,
10457,
8672,
1829,
42,
22,
195,
541,
60,
800,
3726,
3726,
95,
65,
143,
30,
17769,
21597,
25,
14,
5900,
16,
65,
3215,
185,
32,
4259,
20,
367,
10647,
579,
118,
1020,
6232,
5851,
579,
1797,
9,
166,
3105,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 database schema can I use to save different types of billing data?
===
I have a system that creates an order and that order can be billed to a house account, sent Cash on Delivery (COD), or charged to a credit card. I've created the following tables:
ORDERS<br/>
order_id<br/>
billingoption_id
BILLINGOPTI... | 0 | [
2,
98,
6018,
23874,
92,
31,
275,
20,
2079,
421,
2551,
16,
1071,
68,
1054,
60,
800,
3726,
3726,
31,
57,
21,
329,
30,
9695,
40,
389,
17,
30,
389,
92,
44,
13,
17823,
20,
21,
191,
2176,
15,
795,
3392,
27,
6010,
13,
5,
716,
43,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Join Tables in .NET DataSet to Display in DataGridView
===
I have two tables in a DataSet in .NET. I want to join them on an ID column. Then I want a DataGridView to display two columns from the first table and one column from the second table.
If it makes it easier, the relation between the two tables is one-to-on... | 0 | [
2,
1865,
7484,
19,
13,
9,
2328,
1054,
3554,
20,
3042,
19,
1054,
16375,
4725,
800,
3726,
3726,
31,
57,
81,
7484,
19,
21,
1054,
3554,
19,
13,
9,
2328,
9,
31,
259,
20,
1865,
105,
27,
40,
4924,
4698,
9,
94,
31,
259,
21,
1054,
16... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.NET/Mono Database Access—Easy column access?
===
I am not sure if I am missing something grotesquely obvious or what, but I can't seem to figure out how to efficiently access tables in a relational database. I am using PostgreSQL for the database server (and Npgsql for its access) and C# with Mono 2.0.
Say I have... | 0 | [
2,
13,
9,
2328,
118,
20027,
6018,
1381,
1,
18385,
4698,
1381,
60,
800,
3726,
3726,
31,
589,
52,
562,
100,
31,
589,
2863,
301,
27413,
102,
4674,
54,
98,
15,
47,
31,
92,
22,
38,
2260,
20,
1465,
70,
184,
20,
20519,
1381,
7484,
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... |
Multiline Template Text Control in C#
===
I'd like a textbox that allows for certain text within to be "constant" and uneditable while the rest of the text is editable. For instance, I'd like to define a template like this:
<Name:>[]
<Address:>[] <City>:[]
So that the user could later enter:
<Na... | 0 | [
2,
1889,
1143,
22894,
1854,
569,
19,
272,
5910,
800,
3726,
3726,
31,
22,
43,
101,
21,
1854,
5309,
30,
2965,
26,
1200,
1854,
363,
20,
44,
13,
7,
29639,
7,
17,
367,
69,
242,
579,
133,
14,
760,
16,
14,
1854,
25,
9392,
579,
9,
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... |
Use double classes in IE6 CSS?
===
is there any way to make IE6 understand double classes,
say I have a class MenuButton with a color class and possibly a clicked class;
like :
.LeftContent a.MenuButton {..general rules..}
.LeftContent a.MenuButton.Orange {..sets background-image..}
.LeftContent a.MenuButto... | 0 | [
2,
275,
1494,
2684,
19,
13,
660,
379,
272,
18,
18,
60,
800,
3726,
3726,
25,
80,
186,
161,
20,
233,
13,
660,
379,
1369,
1494,
2684,
15,
395,
31,
57,
21,
718,
11379,
811,
444,
29,
21,
1665,
718,
17,
2879,
21,
15802,
718,
73,
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... |
LINQy way to check if any objects in a collection have the same property value
===
I have a class Agent with a property Id
Given a collection of Agents I need to check if any of them have duplicate Ids.
I am currently doing this with a hash table but am trying to get Linq-ified, what's a good way of doing this? | 0 | [
2,
6294,
1251,
93,
161,
20,
2631,
100,
186,
3916,
19,
21,
1206,
57,
14,
205,
1354,
1923,
800,
3726,
3726,
31,
57,
21,
718,
2267,
29,
21,
1354,
4924,
504,
21,
1206,
16,
5125,
31,
376,
20,
2631,
100,
186,
16,
105,
57,
19429,
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... |
Entity Framework pipeline: Expression trees to ESQL to SQL?
===
What is the Entity Framework pipeline like?
What gets translated to SQL, Expression Trees or ESQL, or both?
Is ESQL something an Entity Framework provider needs to implement or translate, or that the framework takes care of? | 0 | [
2,
9252,
6596,
12250,
45,
1803,
1913,
20,
26376,
255,
20,
4444,
255,
60,
800,
3726,
3726,
98,
25,
14,
9252,
6596,
12250,
101,
60,
98,
3049,
4331,
20,
4444,
255,
15,
1803,
1913,
54,
26376,
255,
15,
54,
156,
60,
25,
26376,
255,
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... |
MultiMap implementation
===
I'm writing a simple IDictionary abstraction in C# that wraps a
Dictionary<K, ICollection<V>>. Basically, it maps multiple values to one key. I can't decide whether to remove a key and its empty list when the last item in a values list is removed, or leave it (to avoid instan... | 0 | [
2,
1889,
15022,
6123,
800,
3726,
3726,
31,
22,
79,
1174,
21,
1935,
31,
22595,
1857,
23907,
19,
272,
5910,
30,
8118,
18,
21,
9186,
1569,
255,
38,
73,
197,
15,
31,
15015,
872,
1569,
255,
38,
73,
710,
1569,
263,
38,
73,
1569,
263,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 - Pass the value of one control to a Converter to set the width on another control
===
I want to set the width of a TextBlock based on the width of its container, minus the margins set on the TextBlock.
Here is my code
<TextBlock x:Name="txtStatusMessages"
Width="{Binding ElementName=Lay... | 0 | [
2,
619,
7721,
13,
8,
1477,
14,
1923,
16,
53,
569,
20,
21,
25893,
20,
309,
14,
9456,
27,
226,
569,
800,
3726,
3726,
31,
259,
20,
309,
14,
9456,
16,
21,
1854,
12048,
432,
27,
14,
9456,
16,
82,
12147,
15,
13,
15495,
14,
5440,
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... |
Efficient ISNUMERIC() replacements?
===
So I just spent 5 hours troubleshooting a problem which turned out to be due not only to the [old unreliable][1] `ISNUMERIC` but it looks like my problem only appears when the UDF in which `ISNUMERIC` is declared `WITH SCHEMABINDING` and is called within a stored proc (I've got ... | 0 | [
2,
8243,
25,
6336,
14744,
5,
6,
4610,
18,
60,
800,
3726,
3726,
86,
31,
114,
1111,
331,
974,
2572,
12511,
68,
21,
1448,
56,
412,
70,
20,
44,
397,
52,
104,
20,
14,
636,
1218,
26313,
500,
2558,
165,
500,
13,
1,
403,
6336,
14744,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 fix missing git remote details?
===
Repository clones that I have allow me to do this:
% git pull
% git push
But some repositories require me to type:
% git pull origin master
% git push origin master
I think I am missing something in the latter case - does anyone know what is (n... | 0 | [
2,
184,
107,
31,
6098,
2863,
13,
10404,
5388,
3289,
60,
800,
3726,
3726,
24869,
13871,
18,
30,
31,
57,
1655,
55,
20,
107,
48,
45,
13,
11881,
13,
10404,
2201,
13,
11881,
13,
10404,
3250,
47,
109,
302,
14882,
262,
2829,
4077,
55,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
The Best Memory Leak Definition
===
I feel like developers talk about memory leaks but when you ask them what that means many have no idea. To prevent these situations, let's decide on one.
Please no Wikipedia definitions...
> What is your best definition of a
> **memory leak** and what is the *best way*
> to... | 0 | [
2,
14,
246,
1912,
11724,
5465,
800,
3726,
3726,
31,
583,
101,
10168,
930,
88,
1912,
11724,
18,
47,
76,
42,
1349,
105,
98,
30,
1108,
151,
57,
90,
882,
9,
20,
2501,
158,
8329,
15,
408,
22,
18,
4073,
27,
53,
9,
2247,
90,
20169,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Dot product in C++ using generic algorithms
===
I´m sure there´s a clever one-liner using the C++ stl generic algorithms for implementing the dot product of the elements in any ordered container, such as a vector or list. I just don´t seem to remember it!
The fancy implementation would be:
template <class contai... | 0 | [
2,
14123,
2374,
19,
272,
20512,
568,
12733,
15935,
800,
3726,
3726,
31,
307,
562,
80,
13,
18,
21,
11994,
53,
8,
14813,
568,
14,
272,
20512,
354,
255,
12733,
15935,
26,
17333,
14,
14123,
2374,
16,
14,
2065,
19,
186,
1905,
12147,
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 to deal with xapian php exceptions
===
Help with using the xapian php wrapper.
I have a couple of custom exception handlers for different categories of errors (I'm thinking of seperating them out more).
Xapian handles errors by throwing standard Exception objects.
I would like to use a custom exception han... | 0 | [
2,
184,
20,
1183,
29,
13,
6791,
19749,
13,
26120,
13392,
800,
3726,
3726,
448,
29,
568,
14,
13,
6791,
19749,
13,
26120,
28051,
9,
31,
57,
21,
1335,
16,
5816,
5391,
24641,
18,
26,
421,
6422,
16,
11908,
13,
5,
49,
22,
79,
1440,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 easiest way to create and compare a salted password in .NET?
===
In an ongoing effort to improve my code I am looking for the best way to create and compare a salted password in .NET.
Is there a better, or more secure, way of doing this?
My current code is as follows:
public static strin... | 0 | [
2,
98,
25,
14,
27237,
161,
20,
1600,
17,
11590,
21,
2693,
69,
20884,
19,
13,
9,
2328,
60,
800,
3726,
3726,
19,
40,
6748,
2150,
20,
3545,
51,
1797,
31,
589,
699,
26,
14,
246,
161,
20,
1600,
17,
11590,
21,
2693,
69,
20884,
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... |
aurioTouch sample app's audio playback/thru not working?
===
According to Apple's description, the aurioTouch sample app is suppose to "get the audio input and copy it to the output", which I think means that the app will playback/thru any sound the iPhone's mike picks up through the iPhone's speakers.
When I loade... | 0 | [
2,
21,
3594,
111,
15725,
5717,
4865,
22,
18,
4023,
21306,
118,
96,
1820,
52,
638,
60,
800,
3726,
3726,
496,
20,
4037,
22,
18,
5318,
15,
14,
21,
3594,
111,
15725,
5717,
4865,
25,
5787,
20,
13,
7,
3060,
14,
4023,
6367,
17,
4344,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Good python library for designing a mmo? Actor based design
===
i m trying to design a mmo game using python...
I have evaluated stackless and since it is not the general python and it is a fork, i dont want to use it
I am trying to chose between
pysage
candygram
dramatis
and
parley
any one try any of th... | 0 | [
2,
254,
20059,
1248,
26,
15026,
21,
1620,
111,
60,
1574,
432,
704,
800,
3726,
3726,
31,
307,
749,
20,
704,
21,
1620,
111,
250,
568,
20059,
9,
9,
9,
31,
57,
19018,
7566,
923,
17,
179,
32,
25,
52,
14,
297,
20059,
17,
32,
25,
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... |
Can you use LINQ or lambdas to perform matrix operations?
===
I know how to do this using for loops. Is it possible to do something like this using LINQ or lambdas?
int[] a = { 10, 20, 30 };
int[] b = { 2, 4, 10 };
int[] c = a * b; //resulting array should be { 20, 80, 300 } | 0 | [
2,
92,
42,
275,
6294,
1251,
54,
13,
24187,
18,
20,
2985,
8187,
1311,
60,
800,
3726,
3726,
31,
143,
184,
20,
107,
48,
568,
26,
19661,
9,
25,
32,
938,
20,
107,
301,
101,
48,
568,
6294,
1251,
54,
13,
24187,
18,
60,
19,
38,
2558... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I store an enum value in a Windows Forms settings file?
===
I'm using Windows Forms and VS2008. I want to store an enum value in my application's settings file.
The settings editor in VS2008 only gives me a limited set of types. Amazingly, enums don't seem to be one of these types that are automatically su... | 0 | [
2,
184,
107,
31,
1718,
40,
1957,
723,
1923,
19,
21,
1936,
1997,
12410,
3893,
60,
800,
3726,
3726,
31,
22,
79,
568,
1936,
1997,
17,
4611,
2753,
9,
31,
259,
20,
1718,
40,
1957,
723,
1923,
19,
51,
3010,
22,
18,
12410,
3893,
9,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C++ Linking Errors: Undefined symbols using a templated class.
===
I'm getting some really wierd linking errors from a class I wrote. I am completely unable to find anything that will describe what is happening.
Visual Studio (Windows XP)
> players.obj : error LNK2019: unresolved external symbol "public: __thisc... | 0 | [
2,
272,
20512,
12585,
11908,
45,
367,
13439,
9794,
568,
21,
22894,
43,
718,
9,
800,
3726,
3726,
31,
22,
79,
1017,
109,
510,
11842,
897,
12585,
11908,
37,
21,
718,
31,
738,
9,
31,
589,
1524,
2343,
20,
477,
602,
30,
129,
4996,
98,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C++ array size dependant on function parameter causes compile errors
===
I have a simple function in which an array is declared with size
depending on the parameter which is int.
void f(int n){
char a[n];
};
int main() {
return 0;
}
This piece of code compiles fine on g++ ... | 0 | [
2,
272,
20512,
7718,
1072,
12547,
1830,
27,
1990,
18906,
4047,
26561,
11908,
800,
3726,
3726,
31,
57,
21,
1935,
1990,
19,
56,
40,
7718,
25,
2482,
29,
1072,
4758,
27,
14,
18906,
56,
25,
19,
38,
9,
11364,
398,
5,
6391,
13,
103,
6,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why the Excess Memory for Strings in Delphi?
===
I'm reading in a large text file with 1.4 million lines that is 24 MB in size (average 17 characters a line).
I using Delphi 2009 and the file is ANSI but gets converted to Unicode upon reading, so fairly you can say the text once converted is 48 MB in size.
I'm l... | 0 | [
2,
483,
14,
9521,
1912,
26,
7887,
19,
23030,
60,
800,
3726,
3726,
31,
22,
79,
1876,
19,
21,
370,
1854,
3893,
29,
137,
9,
300,
507,
1560,
30,
25,
937,
14023,
19,
1072,
13,
5,
27345,
369,
1766,
21,
293,
6,
9,
31,
568,
23030,
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... |
opengl: how to avoid texture scaling
===
How do I apply a *repeating* texture that always maintains its original scale (1 pixel in the texture = 1 pixel on screen), regardless of the vertex data it is applied with.
I realize this is not the most usual task, but is it possible to easily set opengl to do this, or do ... | 0 | [
2,
368,
8430,
45,
184,
20,
2658,
12714,
26829,
800,
3726,
3726,
184,
107,
31,
5645,
21,
1637,
99,
1664,
1880,
2483,
12714,
30,
550,
9767,
82,
501,
3464,
13,
5,
165,
18146,
19,
14,
12714,
800,
137,
18146,
27,
2324,
6,
15,
7148,
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... |
What are the primary advantages of building closed-source applications?
===
For quite some time now it has been argued that open-source, or some close derivative of open-source is the fastest way to improve upon an application. However, I have not really taken the time to think through closed-source, and the advantage... | 0 | [
2,
98,
50,
14,
1256,
14683,
16,
353,
827,
8,
12097,
3767,
60,
800,
3726,
3726,
26,
1450,
109,
85,
130,
32,
63,
74,
3778,
30,
368,
8,
12097,
15,
54,
109,
543,
15776,
16,
368,
8,
12097,
25,
14,
7518,
161,
20,
3545,
685,
40,
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... |
Pagination in CouchDB?
===
How would I go about implementation the queries required for pagination?
Basically, when page 1 is requested, get the first 5 entries. For page 2, get the next 5 and so on.
I plan to use this via the couchdb-python module, but that shouldn't make any difference to the implementation. | 0 | [
2,
19006,
108,
857,
19,
4914,
9007,
60,
800,
3726,
3726,
184,
83,
31,
162,
88,
6123,
14,
9386,
2829,
1390,
26,
19006,
108,
857,
60,
11374,
15,
76,
2478,
137,
25,
6602,
15,
164,
14,
64,
331,
11399,
9,
26,
2478,
172,
15,
164,
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... |
Java Private Field Visibility
===
So I was making a class the other day and used Eclipse's method to create the equals method when I realized that it generated the following **working** code:
class Test {
private int privateInt;
[...]
public boolean equals(Object obj) {
[...]
... | 0 | [
2,
8247,
932,
575,
19476,
800,
3726,
3726,
86,
31,
23,
544,
21,
718,
14,
89,
208,
17,
147,
11652,
22,
18,
2109,
20,
1600,
14,
2747,
18,
2109,
76,
31,
1896,
30,
32,
6756,
14,
249,
13,
1409,
14120,
1409,
1797,
45,
718,
1289,
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... |
Is VARCHAR like totally 1990s?
===
1. VARCHAR does not store Unicode characters.
2. NVARCHAR does store Unicode characters.
3. Today's applications should always be Unicode compatible.
4. NVARCHAR takes twice the amount of space to store it.
5. Point 4 doesn't matter because storage space is extremely inexpensive.... | 0 | [
2,
25,
4033,
5433,
101,
5139,
961,
18,
60,
800,
3726,
3726,
137,
9,
4033,
5433,
630,
52,
1718,
28010,
1766,
9,
172,
9,
13,
103,
3311,
5433,
630,
1718,
28010,
1766,
9,
203,
9,
786,
22,
18,
3767,
378,
550,
44,
28010,
14961,
9,
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... |
Any disadvantage of extension method?
===
Extension method is a really helpful feature that you can add a lot of functions you want in any class. But I am wondering if there is any disadvantage that might bring troubles to me. Any comments or suggestions? | 0 | [
2,
186,
13387,
16,
3896,
2109,
60,
800,
3726,
3726,
3896,
2109,
25,
21,
510,
15600,
1580,
30,
42,
92,
3547,
21,
865,
16,
3719,
42,
259,
19,
186,
718,
9,
47,
31,
589,
5712,
100,
80,
25,
186,
13387,
30,
530,
1499,
16615,
20,
55,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is N-Tier architecture?
===
I've seen quite a few developer job postings recently that include a sentence that reads more or less like this: "Must have experience with N-Tier architecture", or "Must be able to develop N-Tier apps".
This leads me to ask, what is N-Tier architecture? How does one gain experience... | 0 | [
2,
98,
25,
13,
103,
8,
5259,
2607,
60,
800,
3726,
3726,
31,
22,
195,
541,
1450,
21,
310,
10058,
1205,
15669,
18,
1989,
30,
468,
21,
5123,
30,
11137,
91,
54,
787,
101,
48,
45,
13,
7,
3605,
38,
57,
1496,
29,
13,
103,
8,
5259,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Generating partitions in Java
===
I am given an integer (lets call it x) and I need to generate an array of arrays, where each subarray is a list of elements which are one of a given set of integers, and the sum of all of the elements of each subarray is x. The array of arrays needs to contain all possible distinct su... | 0 | [
2,
13500,
10711,
18,
19,
8247,
800,
3726,
3726,
31,
589,
504,
40,
13820,
13,
5,
11045,
645,
32,
993,
6,
17,
31,
376,
20,
7920,
40,
7718,
16,
7718,
18,
15,
113,
206,
972,
8576,
93,
25,
21,
968,
16,
2065,
56,
50,
53,
16,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I copy text from my xterm without a mouse?
===
I want to use part of the output of a command run from the command line in another xterm, or as part of a different command. For instance:
> grep error error.log
error: can't find file ~/<some very long path>/thisfile
and I want to do this:
>... | 0 | [
2,
184,
107,
31,
4344,
1854,
37,
51,
993,
3964,
366,
21,
7567,
60,
800,
3726,
3726,
31,
259,
20,
275,
141,
16,
14,
5196,
16,
21,
1202,
485,
37,
14,
1202,
293,
19,
226,
993,
3964,
15,
54,
28,
141,
16,
21,
421,
1202,
9,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 run a rake task from Capistrano?
===
I already have a deploy.rb that can deploy my app on my production server.
My app contains a custom rake task (a .rake file in the lib/tasks directory).
I'd like to create a cap task that will remotely run that rake task. | 0 | [
2,
184,
107,
31,
485,
21,
21009,
3005,
37,
2605,
702,
17555,
60,
800,
3726,
3726,
31,
614,
57,
21,
17617,
9,
7549,
30,
92,
17617,
51,
4865,
27,
51,
637,
8128,
9,
51,
4865,
1588,
21,
5816,
21009,
3005,
13,
5,
58,
13,
9,
4951,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Proper MIME type for PDF files
===
When working with PDFs, I've run across the MIME types 'application/pdf' and 'application/x-pdf' among others.
Is there a difference between these two types, and if so what is it? Is one preferred over the other?
I'm working on a web-app which must deliver huge amounts of PDFs... | 0 | [
2,
4119,
26193,
1001,
26,
13,
11124,
6488,
800,
3726,
3726,
76,
638,
29,
13,
11124,
18,
15,
31,
22,
195,
485,
464,
14,
26193,
2551,
13,
22,
2552,
20669,
118,
11124,
22,
17,
13,
22,
2552,
20669,
118,
396,
8,
11124,
22,
497,
654,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
debugging javascript with firebug
===
I cannot seem to debug my javascript code with Firebug. The play button is greyed out.
I use FireFox 3.0.4 and Firebug 1.2.1
Are there any known issues?
This is the script i want to debug:
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//E... | 0 | [
2,
121,
16254,
2762,
8247,
8741,
29,
535,
16254,
800,
3726,
3726,
31,
1967,
2260,
20,
121,
16254,
51,
8247,
8741,
1797,
29,
535,
16254,
9,
14,
418,
5167,
25,
2682,
69,
70,
9,
31,
275,
535,
18219,
203,
9,
387,
9,
300,
17,
535,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
document.body.offsetWidth variations for different browsers
===
document.body.offsetWidth returns the innerwidth value from left hand side to the left side of the vertical scrollbar in firefox.
In IE it doesn't, instead it returns from left hand side to the right side of the vertical scrollbar.
Does anyone know a se... | 0 | [
2,
4492,
9,
9760,
9,
1299,
3554,
3976,
43,
96,
8194,
26,
421,
16495,
18,
800,
3726,
3726,
4492,
9,
9760,
9,
1299,
3554,
3976,
43,
96,
4815,
14,
3754,
3976,
43,
96,
1923,
37,
225,
224,
270,
20,
14,
225,
270,
16,
14,
7035,
12159... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.