unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
What is the best web prototyping tool?
===
What is the best tool to create a web-apps interface prototype? | 4 | [
2,
98,
25,
14,
246,
2741,
9347,
1084,
3181,
5607,
60,
800,
3726,
3726,
98,
25,
14,
246,
5607,
20,
1600,
21,
2741,
8,
7753,
18,
6573,
7063,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Accessing URL parameters in Oracle Forms / OC4J
===
How do I access parameters passed into an Oracle Form via a URL.
Eg given the url:
> http://example.com/forms90/f90servlet?config=cust&form='a_form'&p1=something&p2=else
This will launch the 'a_form' form, using the 'cust' configuration, but I can't work how (or even if it's possible) to access p1 (with value of 'something') p2 (with value of 'else')
Does anyone know how I can do this? (Or even if it is/isn't possible?
Thanks
Dave Smylie
| 0 | [
2,
1381,
68,
287,
6362,
12905,
19,
15759,
1997,
13,
118,
13,
2499,
300,
728,
800,
3726,
3726,
184,
107,
31,
1381,
12905,
1100,
77,
40,
15759,
505,
1197,
21,
287,
6362,
9,
12369,
504,
14,
287,
6362,
45,
13,
1,
7775,
6903,
29041,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Displaying the current authenticated Sharepoint user from an asp.net Page Viewer Web Part
===
I am creating a standalone asp.net page that needs to be embedded into a sharepoint site using the Page Viewer Web Part. The asp.net page is published to the same server on a different port, giving me the URL to embed.
The requirement is that after a user is authenticated using Sharepoint authentication, they navigate to a page containing the asp.net web part for more options.
What I need to do from this asp.net page is query Sharepoint for the currently authenticated username, then display this on the page from the asp.net code.
This all works fine when I debug the application from VS, but when published and displayed though Sharepoint, I always get NULL as the user.
Any suggestions on the best way to get this to work would be much appreciated.
| 0 | [
2,
17418,
14,
866,
14351,
1669,
1891,
3132,
4155,
37,
40,
28,
306,
9,
2328,
2478,
16812,
2741,
141,
800,
3726,
3726,
31,
589,
2936,
21,
26986,
28,
306,
9,
2328,
2478,
30,
2274,
20,
44,
12138,
77,
21,
1891,
3132,
689,
568,
14,
24... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get a stack trace when C++ program crashes? (using msvc8/2005)
===
Sometimes my c++ program crashes in debug mode, and what I got is a message box saying that an assertion failed in some of the internal memory management routines (accessing unallocated memory etc.). But I don't know where that was called from, because I didn't get any stack trace. How do I get a stack trace or at least see where it fails in my code (instead of library/ built-in routines)? | 0 | [
2,
184,
20,
164,
21,
7566,
5565,
76,
272,
20512,
625,
21563,
60,
13,
5,
12655,
4235,
8990,
12530,
2835,
6,
800,
3726,
3726,
1030,
51,
272,
20512,
625,
21563,
19,
121,
16254,
3740,
15,
17,
98,
31,
330,
25,
21,
2802,
1649,
1148,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to resolve a conflict with git-svn?
===
What is the best way to resolve a conflict when doing a "git svn rebase", and the git branch you are on becomes "(no-branch)"?
| 0 | [
2,
184,
20,
9854,
21,
2930,
29,
13,
10404,
8,
18,
16578,
60,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
9854,
21,
2930,
76,
845,
21,
13,
7,
10404,
13,
18,
16578,
302,
8436,
7,
15,
17,
14,
13,
10404,
1686,
42,
50,
27,
2633,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Which is the best Java GUI editor for rapid development and maintainability: Eclipse/SWT or Netbeans/Matisse?
===
Which is the best Java GUI editor for rapid development and maintainability: Eclipse/SWT or Netbeans/Matisse? | 0 | [
2,
56,
25,
14,
246,
8247,
9457,
1835,
26,
4470,
522,
17,
4027,
4091,
45,
11652,
118,
18,
499,
38,
54,
4275,
863,
5950,
118,
5146,
11001,
60,
800,
3726,
3726,
56,
25,
14,
246,
8247,
9457,
1835,
26,
4470,
522,
17,
4027,
4091,
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,
0,
0,
0,
0,
0... |
QT: meaning of slot return value?
===
According to the documentation the return value from a slot doesn't mean anything.
Yet in the generated moc code I see that if a slot returns a value this value is used for something. Any idea what does it do?
| 0 | [
2,
2593,
38,
45,
1813,
16,
7958,
788,
1923,
60,
800,
3726,
3726,
496,
20,
14,
13945,
14,
788,
1923,
37,
21,
7958,
1437,
22,
38,
884,
602,
9,
768,
19,
14,
6756,
22647,
1797,
31,
196,
30,
100,
21,
7958,
4815,
21,
1923,
48,
1923,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Database schema for a heirarchial groups
===
I'm working on a database design for groups hierarchy used as the foundation of a larger system. Each group can contain other groups, and also 'devices' as leaf objects (nothing goes below device).
The database being used is MS SQL 2005. (Though working in MS SQL 2000 would be a bonus; a solution requiring MS SQL 2008 is unfortunately not feasible at this time).
There are different types of groups, and these need to be dynamic and definable at run-time by users. For example, group types might be "customer", "account", "city", or "building", "floor", and each type is going to have a different set of attributes, definable by the user. There will also be business rules applied - eg, a "floor" can only be contained underneath a "building" group, and again, these are definable at runtime.
A lot of the application functionality comes from running reports based on these groups, so there needs to be a relatively fast way to get a list of all devices contained within a certain group (and all sub-groups).
Storing groups using [modified pre-order tree traversal][1] technique has the upside that it is fast, but the downside that it is fairly complex and fragile - if external users/applications modify the database, there is the potential for complete breakage. We're also implementing an ORM layer, and this method seems to complicate using relations in most ORM libraries.
Using [common table expressions][2] and a "standard" id/parentid groups relation seem to be a powerful way to avoid running multiple recursive queries. Is there any downside to this method?
As far as attributes, what is the best way to store them? A long, narrow table that relates back to group? Should a common attribute, like "name" be stored in a groups table, instead of the attributes table (a lot of the time, the name will be all that is required to display)?
Are there going to be performance issues using this method (let's assume a high average of 2000 groups with average of 6 attributes each, and average 10 concurrent users, on a reasonable piece of hardware, eg, quad-core Xeon 2 Ghz, 4GB ram, discounting any other processes)?
Feel free to suggest a completely different schema than what I've outlined here. I was just trying to illustrate the issues I'm concerned about.
[1]: http://www.sitepoint.com/article/hierarchical-data-database/2/
[2]: http://msdn.microsoft.com/en-us/magazine/cc163346.aspx
| 0 | [
2,
6018,
23874,
26,
21,
7678,
18326,
192,
1170,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
6018,
704,
26,
1170,
14417,
147,
28,
14,
1304,
16,
21,
1662,
329,
9,
206,
214,
92,
3717,
89,
1170,
15,
17,
67,
13,
22,
546,
18507,
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... |
Change Style/Look of Asp:CheckBox using CSS
===
I want to change the standard "3D" look of the standard asp.net checkbox to say solid 1px. If I try to apply the styling to the Border for example it does just that - draws the standard checkbox with a border around it - which is valid I guess.
Anyway, is there a way to change how the actual textbox is styled? | 0 | [
2,
753,
1034,
118,
5810,
16,
28,
306,
45,
12542,
5309,
568,
272,
18,
18,
800,
3726,
3726,
31,
259,
20,
753,
14,
1236,
13,
7,
240,
43,
7,
361,
16,
14,
1236,
28,
306,
9,
2328,
2631,
5309,
20,
395,
2941,
137,
306,
396,
9,
100,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Monthly Birthday SQL Query.
===
How would retrieve all customer's birthdays for a given month in SQL? What about MySQL?
I was thinking of using the following with SQL server.
select c.name
from cust c
where datename(m,c.birthdate) = datename(m,@suppliedDate)
order by c.name | 0 | [
2,
6460,
4455,
4444,
255,
25597,
9,
800,
3726,
3726,
184,
83,
11917,
65,
7705,
22,
18,
4455,
18,
26,
21,
504,
1617,
19,
4444,
255,
60,
98,
88,
51,
18,
22402,
60,
31,
23,
1440,
16,
568,
14,
249,
29,
4444,
255,
8128,
9,
5407,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you determine the size of a file (in C) for files that are larger than 4GB?
===
The code currently does this and the fgetpos does handle files larger than 4GB but the seek returns an error, so any idea how to seek to the end of a file >4GB?
fpos_t currentpos;
sok=fseek(fp,0,SEEK_END);
assert(sok==0,"Seek error!");
fgetpos(fp,¤tpos);
m_filesize=currentpos;
| 0 | [
2,
184,
107,
42,
3746,
14,
1072,
16,
21,
3893,
13,
5,
108,
272,
6,
26,
6488,
30,
50,
1662,
119,
268,
11400,
60,
800,
3726,
3726,
14,
1797,
871,
630,
48,
17,
14,
398,
3060,
12551,
630,
3053,
6488,
1662,
119,
268,
11400,
47,
14,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can you change the Visual Studio IDE profile?
===
Can the Visual Studio IDE profile be changed without clearing all VS settings? | 0 | [
2,
184,
92,
42,
753,
14,
3458,
1120,
13,
3448,
5296,
60,
800,
3726,
3726,
92,
14,
3458,
1120,
13,
3448,
5296,
44,
1015,
366,
8130,
65,
4611,
12410,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Graphical DIFF programs for linux
===
I really like Araxis Merge for a graphical DIFF program for the PC. I have no idea
what's available for linux, though. We're running SUSE linix on our z800 mainframe.
I'd be most grateful if I could get a few pointers to what programs everyone else likes.
Thanks, Scott | 0 | [
2,
21755,
20811,
1726,
26,
13024,
800,
3726,
3726,
31,
510,
101,
13,
512,
19676,
12666,
26,
21,
21755,
20811,
625,
26,
14,
5168,
9,
31,
57,
90,
882,
98,
22,
18,
904,
26,
13024,
15,
362,
9,
95,
22,
99,
946,
13,
18,
3699,
6294,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 statistics of HTML vs. Text email usage
===
What the latest figures are on people viewing their emails in text only mode vs. HTML?
[Wikipedia][1] and it's [source][2] both seem to reference [this][3] research from 2006.
[1]: http://en.wikipedia.org/wiki/Html_email
[2]: http://www.emaillabs.com/tools/email-marketing-statistics.html
[3]: http://www.dmnews.com/Outlook-2006-More-Technology-More-Targeting/article/90305/ | 0 | [
2,
98,
50,
14,
5818,
16,
13,
15895,
4611,
9,
1854,
8517,
7514,
800,
3726,
3726,
98,
14,
5736,
2957,
50,
27,
148,
11244,
66,
8517,
18,
19,
1854,
104,
3740,
4611,
9,
13,
15895,
60,
636,
17375,
26132,
500,
2558,
165,
500,
17,
32,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Create program installer in Visual Studio 2005?
===
I'm a web-guy stuck in "application world" in VS 2005. I created my windows forms program and want to give my end users the ability to install it (and some of it's resources) into a standard Program Files/App Directory location along with a start menu/desktop launcher.
The help files don't give any instructions (that I can find). This seems like such a trivial task to create an installer - but it's eluding me.
Any hints would be greatly appreciated! | 0 | [
2,
1600,
625,
16146,
106,
19,
3458,
1120,
812,
60,
800,
3726,
3726,
31,
22,
79,
21,
2741,
8,
19979,
4549,
19,
13,
7,
2552,
20669,
126,
7,
19,
4611,
812,
9,
31,
679,
51,
1936,
1997,
625,
17,
259,
20,
590,
51,
241,
3878,
14,
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... |
Accessing files across the windows network with near MAX_PATH length
===
I'm using C++ and accessing a UNC path across the network. This path is slightly greater than MAX_PATH. So I cannot obtain a file handle.
But if I run the program on the computer in question, the path is not greater than MAX_PATH. So I can get a file handle. If I rename the file to have less characters (minus length of computer name) I can access the file.
Can this file be accessed across the network even know the computer name in the UNC path puts it over the MAX_PATH limit?
| 0 | [
2,
1381,
68,
6488,
464,
14,
1936,
982,
29,
424,
2049,
1,
8353,
1476,
800,
3726,
3726,
31,
22,
79,
568,
272,
20512,
17,
1381,
68,
21,
16061,
2013,
464,
14,
982,
9,
48,
2013,
25,
1847,
1894,
119,
2049,
1,
8353,
9,
86,
31,
1967,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 add another run level (level 7) in Ubuntu?
===
Ubuntu has 8 run levels (0-6 and S), I want to add the run level 7.
I have done the following:
1.- Created the folder **/etc/rc7.d/**, which contains some symbolic links to **/etc/init.d/**
2.- Created the file **/etc/event.d/rc7** This is its content:
# rc7 - runlevel 7 compatibility
#
# This task runs the old sysv-rc runlevel 7 ("multi-user") scripts. It
# is usually started by the telinit compatibility wrapper.
start on runlevel 7
stop on runlevel [!7]
console output
script
set $(runlevel --set 7 || true)
if [ "$1" != "unknown" ]; then
PREVLEVEL=$1
RUNLEVEL=$2
export PREVLEVEL RUNLEVEL
fi
exec /etc/init.d/rc 7
end script
I thought that would be enough, but **telinit 7** still throws this error: *telinit: illegal runlevel: 7* | 0 | [
2,
184,
107,
31,
3547,
226,
485,
662,
13,
5,
3906,
453,
6,
19,
287,
12968,
2473,
60,
800,
3726,
3726,
287,
12968,
2473,
63,
469,
485,
2216,
13,
5,
387,
8,
379,
17,
13,
18,
6,
15,
31,
259,
20,
3547,
14,
485,
662,
453,
9,
31... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are some resources for learning to write specifcations?
===
At work I am responsible for writing specifications quite often and I am also the person who first insisted on getting specifications in the first place. The problem is I am unsure how specifications should look and what they should contain. A lot of the time when my boss is writing the specification (we are both inexperienced in it) they put in table names and things that I don't think belong etc. So what is a good way to learn to write a good spec? | 0 | [
2,
98,
50,
109,
2566,
26,
2477,
20,
2757,
12737,
821,
16893,
18,
60,
800,
3726,
3726,
35,
170,
31,
589,
1864,
26,
1174,
17971,
1450,
478,
17,
31,
589,
67,
14,
840,
72,
64,
6619,
27,
1017,
17971,
19,
14,
64,
209,
9,
14,
1448,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 - When to use file vs open
===
What's the difference between file and open in Python? When should I use which one? (Say I'm in 2.5) | 0 | [
2,
20059,
13,
8,
76,
20,
275,
3893,
4611,
368,
800,
3726,
3726,
98,
22,
18,
14,
2841,
128,
3893,
17,
368,
19,
20059,
60,
76,
378,
31,
275,
56,
53,
60,
13,
5,
6366,
31,
22,
79,
19,
172,
9,
264,
6,
3,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Code Reviews with CI
===
What sorts of things do you look for in a code review when using continuous integration? It seems like a lot of the literature around for code reviews mentions things like coding style, spelling mistakes, resource usage, error handling, etc. (perhaps not in that order :-) However tools like FxCop and StyleCop seem to pick up a most of the trivial problems.
I would think that as many checks as possible should be pushed into CI to save time and ensure that those checks are done consistently. If you take this approach it seems like the main things to look for in a review are things like poor design, failing to use the existing code structure properly, subtle defects that may been missed in tests, etc
How does everyone else do reviews with CI in place? What other things do you look for in a review? | 0 | [
2,
1797,
2783,
29,
5486,
800,
3726,
3726,
98,
14357,
16,
564,
107,
42,
361,
26,
19,
21,
1797,
1487,
76,
568,
6357,
8078,
60,
32,
2206,
101,
21,
865,
16,
14,
2233,
140,
26,
1797,
2783,
10292,
564,
101,
13,
15458,
1034,
15,
11292,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Relative path in web config
===
How can I have a relative path in the web.config file. This value is not in the connection string so I cannot use |DataDirectory| (I think), so what can I do? | 0 | [
2,
4543,
2013,
19,
2741,
13,
14093,
2816,
800,
3726,
3726,
184,
92,
31,
57,
21,
4543,
2013,
19,
14,
2741,
9,
14093,
2816,
3893,
9,
48,
1923,
25,
52,
19,
14,
2760,
3724,
86,
31,
1967,
275,
13,
1,
18768,
10197,
93,
1,
13,
5,
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,
0,
0,
0,
0,
0,
0,
0... |
Using Divs to display table-like data
===
I want to display data like the following:
Title Subject Summary Date
So my html looks like:
div class="title" /div div class="subject" /div .... etc.
The problem is, all the text doesn't appear on a single line. I tried adding display="block" but that doesn't seem to work.
What am I doing wrong here?
| 0 | [
2,
568,
13,
12916,
18,
20,
3042,
859,
8,
1403,
1054,
800,
3726,
3726,
31,
259,
20,
3042,
1054,
101,
14,
249,
45,
581,
1550,
14740,
1231,
86,
51,
13,
15895,
1879,
101,
45,
13,
12916,
718,
3726,
7,
22235,
7,
13,
118,
12916,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What tool/application/whatever do you wish existed?
===
This may sound like a but of a fluff question, but I think it can be of some use. Often I've seen people, both on SO and off, say that they want to contribute or work on a project of some sort, but they don't know what or how. Most of the time, the response is to "find an open source project" or "just do something they find interesting". I think it would be awesome if we could come up some better answers. So the question is, what do you, the SO community, a group of developers, hackers and programmers, think would be interesting or cool? Some open-source project that has fallen by the wayside? Something new?
Ideally, this question might push somebody to implement or take on one of these projects. If nothing else, this might serve as an interesting gauge of which projects developers are really interested in. | 4 | [
2,
98,
5607,
118,
2552,
20669,
118,
13515,
107,
42,
2536,
4589,
60,
800,
3726,
3726,
48,
123,
646,
101,
21,
47,
16,
21,
6777,
2460,
1301,
15,
47,
31,
277,
32,
92,
44,
16,
109,
275,
9,
478,
31,
22,
195,
541,
148,
15,
156,
27,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I access my memory mapped I/O Device (FPGA) from a RTP in VxWorks?
===
When using VxWorks, we are trying to access a memory mapped I/O device from a Real-Time Process.
Since RTPs have memory protection, how can I access my I/O device from one?
Note: I have the answer, I will be posting it shortly, feel free to answer as yours might be better than mine but please don't be offended by this population of the SO knowledgebase | 0 | [
2,
184,
107,
31,
1381,
51,
1912,
20877,
31,
118,
111,
3646,
13,
5,
12087,
1136,
6,
37,
21,
761,
13726,
19,
566,
396,
7684,
60,
800,
3726,
3726,
76,
568,
566,
396,
7684,
15,
95,
50,
749,
20,
1381,
21,
1912,
20877,
31,
118,
111,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Writing to the windows logs in Python
===
Is it possible to write to the windows logs in python? | 0 | [
2,
1174,
20,
14,
1936,
18893,
19,
20059,
800,
3726,
3726,
25,
32,
938,
20,
2757,
20,
14,
1936,
18893,
19,
20059,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
IIS 6.0 Is Stubbornly Remembering Authentication Settings
===
I have an .asmx in a folder in my application and I keep getting a 401 trying to access it.
I have double and triple checked the setting including the directory security settings. It allows anonymous. I turned off Windows Authentication.
If I delete the application and the folder its in, then redeploy it under the same application name it magically reapplies the old settings.
If I deploy the exact same application to a different folder on the server and create another application under a new name and set up the directory security setting again it works!!!
How do I get IIS to forget the setting under the original application name?
| 2 | [
2,
595,
18,
400,
9,
387,
25,
13011,
102,
11135,
27963,
12410,
800,
3726,
3726,
31,
57,
40,
13,
9,
472,
79,
396,
19,
21,
19294,
19,
51,
3010,
17,
31,
643,
1017,
21,
13,
20658,
749,
20,
1381,
32,
9,
31,
57,
1494,
17,
4684,
650... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Whats the best way to pass html embed code via rss feed to a rss parser in php?
===
Im trying to put an html embed code for a flash video into the rss feed, which will then be parser by a parser (magpie) on my other site. How should I encode the embed code on one side, and then decode it on the other so I can insert clean html into the DB on the receiving server? | 0 | [
2,
98,
18,
14,
246,
161,
20,
1477,
13,
15895,
11911,
69,
1797,
1197,
13,
1224,
18,
4063,
20,
21,
13,
1224,
18,
2017,
4104,
19,
13,
26120,
60,
800,
3726,
3726,
797,
749,
20,
442,
40,
13,
15895,
11911,
69,
1797,
26,
21,
4433,
76... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Stable, efficient sort?
===
I'm trying to create an unusual associative array implementation that is very space-efficient, and I need a sorting algorithm that meets all of the following:
1. Stable (Does not change the relative ordering of elements with equal keys.)
2. In-place or almost in-place (O(log n) stack is fine, but no O(n) space usage or heap allocations.
3. O(n log n) time complexity.
Also note that the data structure to be sorted is an array.
It's easy to see that there's a basic algorithm that matches any 2 of these three (insertion sort matches 1 and 2, merge sort matches 1 and 3, heap sort matches 2 and 3), but I cannot for the life of me find anything that matches all three of these criteria. | 0 | [
2,
4521,
15,
8243,
2058,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
1600,
40,
4706,
28,
18,
16325,
3366,
7718,
6123,
30,
25,
253,
726,
8,
23702,
15,
17,
31,
376,
21,
2058,
68,
9083,
30,
5224,
65,
16,
14,
249,
45,
137,
9,
4521... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Internet Explorer 8 beta 2 and Standards
===
Internet Explorer 8 breaks what must be every 3rd page I look at. The point of this early release was, I presume, to give website owners the chance to update their sites so it wouldn't be such a hassle for the final release.
Has anyone actually done this?
Is anyone even planning on doing this?
I have yet to notice any of the big sites like ebay, myspace, facebook and so on bother so why will smaller sites if they can just use the compatibility mode?
I think i'll do it with mine, but how can you have your site compatible with IE7 and 8? | 0 | [
2,
2620,
8520,
469,
8434,
172,
17,
3364,
800,
3726,
3726,
2620,
8520,
469,
7947,
98,
491,
44,
352,
203,
897,
2478,
31,
361,
35,
9,
14,
454,
16,
48,
274,
830,
23,
15,
31,
29294,
15,
20,
590,
2271,
4515,
14,
1504,
20,
11100,
66,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 one object's method to update another object's attribute?
===
I have three (C++) classes: Player, Hand, and Card.
Player has a member, hand, that holds a Hand. It also has a method, getHand(), that returns the contents of hand.
Hand Player::getHand() {
return hand;
}
Hand has a method, addCard(Card c), that adds a card to the hand.
I want to do this:
player1.getHand().addCard(c);
but it doesn't work. It doesn't throw an error, so it's doing something. But if I examine the contents of player1's hand afterward, the card hasn't been added.
How can I get this to work? | 0 | [
2,
184,
20,
275,
53,
3095,
22,
18,
2109,
20,
11100,
226,
3095,
22,
18,
35,
14755,
60,
800,
3726,
3726,
31,
57,
132,
13,
5,
150,
20512,
6,
2684,
45,
517,
15,
224,
15,
17,
2056,
9,
517,
63,
21,
322,
15,
224,
15,
30,
2763,
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 to return the date part only from a SQL Server datetime datatype
===
SELECT GETDATE()
Returns: <code>2008-09-22 15:24:13.790</code>
I want that date part without the time part: <code>2008-09-22 00:00:00.000</code> | 0 | [
2,
184,
20,
788,
14,
1231,
141,
104,
37,
21,
4444,
255,
8128,
1231,
891,
1054,
4474,
800,
3726,
3726,
5407,
164,
8209,
5,
6,
4815,
45,
13,
1,
9375,
1,
2753,
8,
2545,
8,
2287,
357,
22830,
45,
1543,
9,
25242,
1,
118,
9375,
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... |
Java RSS library
===
I'm looking for a Java library for generating RSS feeds, any recommendations?
Cheers,
Don | 0 | [
2,
8247,
13,
1224,
18,
1248,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
8247,
1248,
26,
13500,
13,
1224,
18,
17058,
15,
186,
12121,
60,
10497,
18,
15,
221,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Keeping my PHP pretty
===
I am creating a site in which different pages can look very different depending upon certain conditions (ie logged in or not, form filled out or not, etc). This makes it necessary to output diferent blocks of html at different times.
Doing that, however, makes my php code look horrific... it really messes with the formatting and "shape" of the code. How should I get around this? Including custom "html dump" functions at the bottom of my scripts? The same thing, but with includes? Heredocs (don't look too good)?
Thanks! | 0 | [
2,
2882,
51,
13,
26120,
1772,
800,
3726,
3726,
31,
589,
2936,
21,
689,
19,
56,
421,
4434,
92,
361,
253,
421,
4758,
685,
1200,
2039,
13,
5,
660,
13,
19287,
19,
54,
52,
15,
505,
1943,
70,
54,
52,
15,
2722,
6,
9,
48,
1364,
32,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Selenium internals
===
How does selenium work? Can you explain the internal working of it. | 0 | [
2,
23027,
14311,
3117,
18,
800,
3726,
3726,
184,
630,
23027,
14311,
170,
60,
92,
42,
3271,
14,
3117,
638,
16,
32,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Dynamic IP-based blacklisting
===
Folks, we all know that IP blacklisting doesn't work - spammers can come in through a proxy, plus, legitimate users might get affected... That said, blacklisting seems to me to be an efficient mechanism to stop a persistent attacker, given that the actual list of IP's is determined dynamically, based on application's feedback and user behavior.
For example:
- someone trying to brute-force your login screen
- a poorly written bot issues very strange HTTP requests to your site
- a script-kiddie uses a scanner to look for vulnerabilities in your app
I'm wondering if the following mechanism would work, and if so, do you know if there are any tools that do it:
- In a web application, developer has a hook to report an "offense". An offense can be minor (invalid password) and it would take dozens of such offenses to get blacklisted; or it can be major, and a couple of such offenses in a 24-hour period kicks you out.
- Some form of a web-server-level block kicks in on before every page is loaded, and determines if the user comes from a "bad" IP.
- There's a "forgiveness" mechanism built-in: offenses no longer count against an IP after a while.
Thanks! | 0 | [
2,
7782,
15735,
8,
1281,
319,
5739,
68,
800,
3726,
3726,
14563,
15,
95,
65,
143,
30,
15735,
319,
5739,
68,
1437,
22,
38,
170,
13,
8,
6954,
11531,
18,
92,
340,
19,
120,
21,
27188,
15,
3123,
15,
11912,
3878,
530,
164,
4114,
9,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why are a DisplayObject's child's .name property and the results of getChildByName() sometimes different?
===
Can anyone explain the difference between the "name" property of a display object and the value found by *getChildByName("XXX")* function? They're the same 90% of the time, until they aren't, and things fall apart.
For example, in the code below, I find an object by instance name only by directly examining the child's name property; *getChildByName()* fails.
var gfx:MovieClip = new a_Character(); //(a library object exported for Actionscript)
var do1:DisplayObject = null;
var do2:DisplayObject = null;
for( var i:int = 0 ; i < gfx.amSword.numChildren ; i++ )
{
var child:DisplayObject = e.gfx.amSword.getChildAt(i);
if( child.name == "amWeaponExchange" ) //An instance name set in the IDE
{
do2 = child;
}
}
trace("do2:", do2 );
var do1:DisplayObject = e.gfx.amSword.getChildByName["amWeaponExchange"];
Generates the following output:
do2: [object MovieClip]
ReferenceError: Error #1069: Property amWeaponExchange not found on builtin.as$0.MethodClosure and there is no default value.
Any ideas what Flash is thinking?
| 0 | [
2,
483,
50,
21,
3042,
23793,
22,
18,
850,
22,
18,
13,
9,
7259,
1354,
17,
14,
1736,
16,
164,
11287,
779,
7259,
5,
6,
1030,
421,
60,
800,
3726,
3726,
92,
1276,
3271,
14,
2841,
128,
14,
13,
7,
7259,
7,
1354,
16,
21,
3042,
3095,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to create basic Adobe Illustrator files programatically?
===
I need to create a really basic Adobe Illustrator file on the clipboard that I can paste in Adobe Illustrator or Expression Design. I'm looking for code samples on how to programaticaly generate Adobe Illustrator Files, preferably from C# or some other .NET language (but at the moment any language goes).
I have found the Adobe Illustrator 3 File Format documentation online but it's allot to digest for this simple scenario.
I don't want to depend on the actual Adobe Illustrator program (COM interop for instance) to generate my documents. Must be pure code.
| 0 | [
2,
184,
20,
1600,
2125,
20299,
13805,
6488,
625,
721,
8438,
60,
800,
3726,
3726,
31,
376,
20,
1600,
21,
510,
2125,
20299,
13805,
3893,
27,
14,
12229,
2806,
30,
31,
92,
640,
62,
19,
20299,
13805,
54,
1803,
704,
9,
31,
22,
79,
699... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where can I find some up to date information on OpenID authentication with rails?
===
The question says it all. I can't seem to find any recent rails tutorials or whatever to set up an OpenID authentication system. I found [RestfulOpenIDAuthentication](http://github.com/ReinH/restful_open_id_authentication/tree/master) but it's so much older than the vanilla Restful Authentication and the docs don't even mention Rails 2 that I am pretty wary. Does anyone have any tips? I'd like to do what stackoverflow does and *only* have OpenID support.
Thanks! | 0 | [
2,
113,
92,
31,
477,
109,
71,
20,
1231,
676,
27,
368,
1340,
27963,
29,
2240,
18,
60,
800,
3726,
3726,
14,
1301,
898,
32,
65,
9,
31,
92,
22,
38,
2260,
20,
477,
186,
1764,
2240,
18,
29724,
18,
54,
2099,
20,
309,
71,
40,
368,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 calculate # of lines of code in code behind and aspx files?
===
Looking for a tool to calculate the # of lines of code in an asp.net (vb.net) application.
The tricky part is that it needs to figure out the inline code in aspx files also.
So it will be lines of code in vb files (minus comments) plus the inline code in aspx files (not all the lines of aspx files, just the code between <% %> tags.
| 0 | [
2,
5607,
20,
18469,
6926,
16,
1560,
16,
1797,
19,
1797,
439,
17,
28,
306,
396,
6488,
60,
800,
3726,
3726,
699,
26,
21,
5607,
20,
18469,
14,
6926,
16,
1560,
16,
1797,
19,
40,
28,
306,
9,
2328,
13,
5,
20468,
9,
2328,
6,
3010,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 tail (log file visualization) freeware tool ?
===
I have many programs generating tons of logs in files.
What freeware do you know, either for Windows or for multi-platforms (if they are in java for instance), able to tail (display the end of) those files ?
A plus would be their capacity to display some line in a certain visual style depending on 'grep' criteria | 4 | [
2,
246,
3424,
13,
5,
5567,
3893,
28873,
6,
551,
5011,
5607,
13,
60,
800,
3726,
3726,
31,
57,
151,
1726,
13500,
5278,
16,
18893,
19,
6488,
9,
98,
551,
5011,
107,
42,
143,
15,
694,
26,
1936,
54,
26,
1889,
8,
27035,
18,
13,
5,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Recommended WPF Calendar
===
What WPF Calendar control would you recommend? I am looking for something that will let me display a variable amount of weeks potentially spanning multiple months. | 0 | [
2,
5773,
619,
7721,
7036,
800,
3726,
3726,
98,
619,
7721,
7036,
569,
83,
42,
12360,
60,
31,
589,
699,
26,
301,
30,
129,
408,
55,
3042,
21,
7612,
2006,
16,
1342,
9465,
16092,
1886,
818,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Large Image resizing libraries
===
Does anyone know of any good image resizing libraries that will handling resizing large images(~7573 x ~9485). Something that is fast and doesn't chew to much memory would be great. At the moment I am using IrfanView and just shell invoking it with arguments but I would like to find something that integrates into .net a bit more.
Thanks. | 0 | [
2,
370,
1961,
10719,
3335,
8649,
800,
3726,
3726,
630,
1276,
143,
16,
186,
254,
1961,
10719,
3335,
8649,
30,
129,
7988,
10719,
3335,
370,
3502,
5,
1,
3283,
4440,
993,
13,
1,
4588,
3058,
6,
9,
301,
30,
25,
1512,
17,
1437,
22,
38,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the cost of using a pointer to member function vs. a switch?
===
I have the following situation:
<pre><code>
class A
{
public:
A(int whichFoo);
int foo1();
int foo2();
int foo3();
int callFoo(); // cals one of the foo's depending on the value of whichFoo
};
</code></pre>
In my current implementation I save the value of <code>whichFoo</code> in a data member in the constructor and use a <code>switch</code> in <code>callFoo()</code> to decide which of the foo's to call. Alternatively, I can use a <code>switch</code> in the constructor to save a pointer to the right <code>fooN()</code> to be called in <code>callFoo()</code>.
My question is which way is more efficient if an object of class A is only constructed once, while <code>callFoo()</code> is called a very large number of times. So in the first case we have multiple executions of a switch statement, while in the second there is only one switch, and multiple calls of a member function using the pointer to it. I know that calling a member function using a pointer is slower than just calling it directly. Does anybody know if this overhead is more or less than the cost of a <code>switch</code>? | 0 | [
2,
98,
25,
14,
1516,
16,
568,
21,
454,
106,
20,
322,
1990,
4611,
9,
21,
5521,
60,
800,
3726,
3726,
31,
57,
14,
249,
1858,
45,
13,
1,
3515,
1,
9375,
1,
718,
21,
13,
1,
317,
45,
21,
5,
6391,
56,
4120,
111,
6,
73,
19,
38,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Set operation in .NET C#
===
I'm working on a something related to roughset right now. The project uses alot of sets operation and manipulation. I've been using string operations as a stop gap measure for set operation. It has worked fine until we need to process some ungodly amount of data ( 500,000 records with about 40+ columns each ) through the algorithm.
I know that there is no set data structure in .net 2.0(2.0 was the latest when I started the project) I want to know if there is any library that offer fast set operation in .net c# or if 3.5 has added native set data structure.
Thanks . | 0 | [
2,
309,
1453,
19,
13,
9,
2328,
272,
5910,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
301,
1597,
20,
4182,
3554,
193,
130,
9,
14,
669,
2027,
21,
5639,
16,
3415,
1453,
17,
17561,
9,
31,
22,
195,
74,
568,
3724,
1311,
28,
21,
747... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I use owfs to read an iButton temperature logger?
===
I've installed [`owfs`][1] and am trying to read the data off a [iButton temperature logger][2].
`owfs` lets me mount the iButton as a fuse filesystem and I can see all the data. I'm having trouble figuring out what is the best way to access the data though. I can get individual readings by `cat`ting the files, e.g. `cat onewire/{deviceid}/log/temperature.1`, but the `onewire/{deviceid}/log/temperature.ALL` file is "broken" (possible too large, as `histogram/temperature.ALL` work fine).
A python script to read all files seems to work but takes a very long time. Is there a better way to do it? Does anyone have any examples?
I'm using Ubuntu 8.04 and couldn't get the java "one wire viewer" app to run.
[1]: http://www.owfs.org/
[2]: http://www.maxim-ic.com/quick_view2.cfm/qv_pk/4088 | 0 | [
2,
184,
107,
31,
275,
13,
3581,
11754,
20,
1302,
40,
31,
811,
444,
3348,
13,
29480,
60,
800,
3726,
3726,
31,
22,
195,
4066,
636,
1,
3581,
11754,
1,
500,
2558,
165,
500,
17,
589,
749,
20,
1302,
14,
1054,
168,
21,
636,
49,
811,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Hidden markov models implementation in .net?
===
Does anyone know of any HMM implementation in .net?
I've some stuff that I did that was basicly reverse engineered from what little knowledge that I have regarding the subject and some c++ code of a very domain specific application that one of my professors did.
I want to improve it somewhat and having another's work that is in the same language to compare to can really help to see if I've got it right or not. | 0 | [
2,
3689,
943,
2026,
2761,
6123,
19,
13,
9,
2328,
60,
800,
3726,
3726,
630,
1276,
143,
16,
186,
13,
15530,
6123,
19,
13,
9,
2328,
60,
31,
22,
195,
109,
3217,
30,
31,
144,
30,
23,
2125,
102,
7006,
16596,
37,
98,
265,
1918,
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... |
Create a small 'window-form' application that runs anywhere
===
I work in the embedded world, using mainly C and no GUI at all (because there is no display screen).
What is the best programming environment (langauge/IDE/etc) for me to build a simple window-form application that will run on all the common platforms: windows/linux/mac-os ?
I have my eye on Python and one of it's widget libraries, QT or WxWidgets. Is that a good option ? | 0 | [
2,
1600,
21,
284,
13,
22,
27508,
8,
4190,
22,
3010,
30,
1461,
4922,
800,
3726,
3726,
31,
170,
19,
14,
12138,
126,
15,
568,
2011,
272,
17,
90,
9457,
35,
65,
13,
5,
4451,
80,
25,
90,
3042,
2324,
6,
9,
98,
25,
14,
246,
3143,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Removing blotchiness on transparent PNGs filtered with additional opacity in IE
===
I made a rotating image fader using Javascript and CSS to show images and unload them. I wanted to use transparent PNG's, I didn't expect or care if they looked good in IE 6, but IE 7 and 8 treated them with the same disrespect. Firefox and other modern browsers looked great. <br>Every picture with `image.filter = alpha(opacity=xxx)` in it looks like some of the transparency has some leftover noise, maybe from compression or something, no matter what I do to the picture, there's still something there.
<p>
I've done workarounds by placing JPG's on white background and using GIF's. <br>Also can someone tell me if this is actually a bug in IE?
<hr>
Let me know if you need an example and I'll make one | 0 | [
2,
9096,
28001,
8776,
27,
14862,
351,
2723,
18,
25090,
29,
1351,
13,
11490,
5788,
19,
13,
660,
800,
3726,
3726,
31,
117,
21,
16164,
1961,
1399,
1157,
568,
8247,
8741,
17,
272,
18,
18,
20,
298,
3502,
17,
367,
8294,
105,
9,
31,
41... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 largest TCP/IP network port number allowable for IPv4?
===
What is the highest port number one can use, if any? | 0 | [
2,
98,
25,
14,
1075,
13,
38,
7439,
118,
4307,
982,
1295,
234,
1655,
579,
26,
31,
10166,
300,
60,
800,
3726,
3726,
98,
25,
14,
1554,
1295,
234,
53,
92,
275,
15,
100,
186,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to release .Net apps without bundling .Net framework?
===
I have a strange requirement to ship an application without bundling .Net framework (to save memory footprint and bandwidth).
Is this possible? Customers may or may not have .Net runtime installed on their systems.
Will doing Ngen take care of this problem? I was looking for something like the good old ways of releasing C++ apps (using linker to link only the binaries you need). | 0 | [
2,
184,
20,
830,
13,
9,
2328,
4865,
18,
366,
5502,
11371,
13,
9,
2328,
6596,
60,
800,
3726,
3726,
31,
57,
21,
2578,
8981,
20,
995,
40,
3010,
366,
5502,
11371,
13,
9,
2328,
6596,
13,
5,
262,
2079,
1912,
18511,
17,
23392,
6,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the difference between 0.0.0.0 and 255.255.255.255 in IPv4?
===
I've heard some people say the IPv4 broadcast address is 0.0.0.0 and others say it is 255.255.255.255... would someone explain the real-world difference? | 0 | [
2,
98,
25,
14,
2841,
128,
713,
9,
387,
9,
387,
9,
387,
17,
13,
20038,
9,
20038,
9,
20038,
9,
20038,
19,
31,
10166,
300,
60,
800,
3726,
3726,
31,
22,
195,
752,
109,
148,
395,
14,
31,
10166,
300,
1992,
3218,
25,
713,
9,
387,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which open-source Scrum project management tool do you use?
===
I'm looking for an open-source Scrum project management tool for a small dev team (3 to 6 developers). I've been impressed by [trac][1] but I don't need its bug tracking feature as we already use [Mantis][2]. I'm having a look at [iceScrum][3] which seems feature-full and shiny but a bit cluttered. A solution that integrates into eclipse would be a plus.
[1]: http://trac.edgewall.org/
[2]: http://www.mantisbt.org/
[3]: http://www.icescrum.org/
| 4 | [
2,
56,
368,
8,
12097,
26562,
669,
1097,
5607,
107,
42,
275,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
40,
368,
8,
12097,
26562,
669,
1097,
5607,
26,
21,
284,
9664,
173,
13,
5,
240,
20,
400,
10168,
6,
9,
31,
22,
195,
74,
7059... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Understanding C++ boost library the easy way
===
I have been using C++ boost library for about 2 years now. However, I haven't found any good documentation that gives an overview of how its various components have been implemented and the involved basic principles for implementation.
I am aware of the following resources, that cover bits and parts of boost.
1) Boost documentation - Mainly deals with usage of the library - that too very brief - I usually employ "kodesearch" and "google code search" to find examples of usages of the library, but it is somewhat cumbersome. Another place to search is the boost mailing list, but search of mailing lists is usually even more time-taking.
2) Book "C++ Template Metaprogramming" - There are 1-2 other books on templates but their main focus is templates in general and the possibilities of using templates, and boost is only scratched on the side.
3) Book "Boost Graph Library" - This comes closer to what I want, but still the main focus is the graph library (discusses some general boost techniques though).
Do you know of anything that can give me a holistic view of boost?
| 0 | [
2,
3260,
272,
20512,
10419,
1248,
14,
2010,
161,
800,
3726,
3726,
31,
57,
74,
568,
272,
20512,
10419,
1248,
26,
88,
172,
122,
130,
9,
207,
15,
31,
2933,
22,
38,
216,
186,
254,
13945,
30,
2352,
40,
21598,
16,
184,
82,
617,
5090,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Centered background image is off by 1px
===
My web page sits in a DIV that is 960px wide, I center this DIV in the middle of the page by using the code:
html,body{background: url(images/INF_pageBg.gif) center top repeat-y #777777;text-align:center;}
#container{background-color:#ffffff;width:960px;text-align:left;margin:0 auto 0 auto;}
I need the background image of the html/body to tile down the middle of the page, which it does, however if the viewable pane in the browser is an odd number of pixels width then the centered background and centered DIV don't align together.
This is only happening in FF.
Does anybody know of a workaround? | 0 | [
2,
10583,
2395,
1961,
25,
168,
34,
137,
306,
396,
800,
3726,
3726,
51,
2741,
2478,
7550,
19,
21,
13,
12916,
30,
25,
13,
24504,
306,
396,
1051,
15,
31,
459,
48,
13,
12916,
19,
14,
772,
16,
14,
2478,
34,
568,
14,
1797,
45,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
VB.NET - Should a Finalize method be added when implementing IDisposable?
===
In Visual Studio, when I type the line "`Implements IDisposable`", the IDE automatically adds:
- a `disposedValue` member variable
- a `Sub Dispose() Implements IDisposable.Dispose`
- a `Sub Dispose(ByVal disposing As Boolean)`
The `Dispose()` should be left alone, and the clean up code should be put in `Dispose(disposing)`.
However the [Dispose Finalize Pattern][1] says you should also override `Sub Finalize()` to call `Dispose(False)`. Why doesn't the IDE also add this? Must I add it myself, or is it somehow called implicitly?
[1]: http://msdn.microsoft.com/en-us/library/s9bwddyx.aspx "Dispose Finalize Pattern" | 0 | [
2,
13,
20468,
9,
2328,
13,
8,
378,
21,
426,
2952,
2109,
44,
905,
76,
17333,
13,
19405,
12551,
579,
60,
800,
3726,
3726,
19,
3458,
1120,
15,
76,
31,
1001,
14,
293,
13,
7,
1,
8983,
413,
6601,
13,
19405,
12551,
579,
1,
7,
15,
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 remove duplication in shoulda tests?
===
Here is what I have:
context "Create ingredient from string" do
context "1 cups butter" do
setup do
@ingredient = Ingredient.create(:ingredient_string => "1 cups butter")
end
should "return unit" do
assert_equal @ingredient.unit, 'cups'
end
should "return amount" do
assert_equal @ingredient.amount, 1.0
end
should "return name" do
assert_equal @ingredient.name, 'butter'
end
end
context "1 (18.25 ounce) package devil's food cake mix with pudding" do
setup do
@ingredient = Ingredient.create(:ingredient_string => "1 (18.25 ounce) package devil's food cake mix with pudding")
end
should "return unit" do
assert_equal @ingredient.unit, '(18.25 ounce) package'
end
should "return amount" do
assert_equal @ingredient.amount, 1.0
end
should "return name" do
assert_equal @ingredient.name, 'devil\'s food cake mix with pudding'
end
end
end
Clearly there is a lot of duplication there. Any thoughts on how to remove it, if only at the very least the context and the string? | 0 | [
2,
184,
107,
31,
4681,
1052,
20669,
19,
378,
58,
4894,
60,
800,
3726,
3726,
235,
25,
98,
31,
57,
45,
4141,
13,
7,
6037,
1373,
23933,
37,
3724,
7,
107,
4141,
13,
7,
165,
15737,
8270,
7,
107,
18161,
107,
13,
1,
68,
2095,
49,
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... |
Maintaining Multiple Databases Across Several Platforms
===
What's the best way to maintain a multiple databases across several platforms (Windows, Linux, OS X and Solaris) and keep them in sync with one another? I've tried several different programs and nothing seems to work! | 0 | [
2,
8215,
1886,
6018,
18,
464,
238,
6843,
800,
3726,
3726,
98,
22,
18,
14,
246,
161,
20,
4027,
21,
1886,
6018,
18,
464,
238,
6843,
13,
5,
27508,
18,
15,
13024,
15,
13,
759,
993,
17,
4535,
403,
6,
17,
643,
105,
19,
6063,
150,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Scrum on a distance
===
We are setting up a project with at very distributed nature. Half of the dev team will be in one location and half in another. The business representative will be in a third location. Any advice on how we should handle this? Good software to ease things up (in a ddition to scrum software we need whiteboards etc.)? How to do the scrum meetings over phone or other communication? | 0 | [
2,
26562,
27,
21,
1583,
800,
3726,
3726,
95,
50,
2697,
71,
21,
669,
29,
35,
253,
4387,
1444,
9,
519,
16,
14,
9664,
173,
129,
44,
19,
53,
1474,
17,
519,
19,
226,
9,
14,
508,
2652,
129,
44,
19,
21,
422,
1474,
9,
186,
4978,
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... |
Do you create your own code generators?
===
[The Pragmatic Programmer][1] advocates the use of code generators.
Do you create code generators on your projects? If yes, what do you use them for?
[1]: http://www.amazon.com/Pragmatic-Programmer-Journeyman-Master/dp/020161622X/ref=pd_bbs_sr_1?ie=UTF8&s=books&qid=1222060680&sr=8-1 | 0 | [
2,
107,
42,
1600,
154,
258,
1797,
20495,
60,
800,
3726,
3726,
636,
124,
28443,
17968,
500,
2558,
165,
500,
15171,
14,
275,
16,
1797,
20495,
9,
107,
42,
1600,
1797,
20495,
27,
154,
2314,
60,
100,
1643,
15,
98,
107,
42,
275,
105,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Multiple services from the same executable
===
I've written a small service (plain Win32) and I'd like to know if it's possible to run multiple instances of it when multiple users are logged on.
Basically, let's say we've got UserA and UserB for UserA the service would log on as "domain\UserA" and for UserB the service would log on as "domain\UserB" - this is from the same executable of course. I can change the logon dynamically using the ChangeServiceConfig() function, but it changes it system-wide it seems, while I'd like each user to have his own copy of the service running only for him.
Thank you in advance for any pointers. | 0 | [
2,
1886,
687,
37,
14,
205,
1396,
17194,
5924,
800,
3726,
3726,
31,
22,
195,
642,
21,
284,
365,
13,
5,
9897,
108,
628,
3125,
6,
17,
31,
22,
43,
101,
20,
143,
100,
32,
22,
18,
938,
20,
485,
1886,
13946,
16,
32,
76,
1886,
3878,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 the host localhost always available for the own system?
===
Is it always possible to ping localhost and it resolves to 127.0.0.1?
I know Windows Vista, XP, Ubuntu and Debian do it but does everyone do it? | 0 | [
2,
25,
14,
2015,
375,
11694,
550,
904,
26,
14,
258,
329,
60,
800,
3726,
3726,
25,
32,
550,
938,
20,
13,
3181,
375,
11694,
17,
32,
9854,
18,
20,
13,
11595,
9,
387,
9,
387,
9,
165,
60,
31,
143,
1936,
13520,
15,
23045,
15,
287,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Team size and project iteration length.
===
Do you think that project iteration length is related on project team size? What kind of relation it forms? What other key factors you use to recognize correct iteration length for different projects. | 4 | [
2,
173,
1072,
17,
669,
23534,
1476,
9,
800,
3726,
3726,
107,
42,
277,
30,
669,
23534,
1476,
25,
1597,
27,
669,
173,
1072,
60,
98,
825,
16,
5827,
32,
1997,
60,
98,
89,
1246,
4776,
42,
275,
20,
5844,
4456,
23534,
1476,
26,
421,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Python-passing variable between classes
===
I'm trying to create a character generation wizard for a game. In one class I calculate the attributes of the character. In a different class, I'm displaying to the user which specialties are available based on the attributes of the character. However, I can't remember how to pass variables between different classes.
Here is an example of what I have:
class BasicInfoPage(wiz.WizardPageSimple):
def __init__(self, parent, title):
wiz.WizardPageSimple.__init__(self, parent)
self.next = self.prev = None
self.sizer = makePageTitle(self, title)
<---snip--->
self.intelligence = self.genAttribs()
class MOS(wiz.WizardPageSimple):
def __init__(self, parent, title):
wiz.WizardPageSimple.__init__(self, parent)
self.next = self.prev = None
self.sizer = makePageTitle(self, title)
def eligibleMOS(self, event):
if self.intelligence >= 12:
self.MOS_list.append("Analyst")
The problem is that I can't figure out how to use the "intelligence" variable from the BasicInfoPage class to the MOS class. I've tried several different things from around the Internet but nothing seems to work. What am I missing? | 0 | [
2,
20059,
8,
6201,
68,
7612,
128,
2684,
800,
3726,
3726,
31,
22,
79,
749,
20,
1600,
21,
925,
2782,
10276,
26,
21,
250,
9,
19,
53,
718,
31,
18469,
14,
13422,
16,
14,
925,
9,
19,
21,
421,
718,
15,
31,
22,
79,
17418,
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... |
Flex AdvancedDataGrid: How do I style the summary rows?
===
I have an AdvancedDataGrid with a GroupingCollection and a SummaryRow. How do I display the summary row data in bold? Below is my code:
<mx:AdvancedDataGrid width="100%" height="100%" id="adg" defaultLeafIcon="{null}" >
<mx:dataProvider>
<mx:GroupingCollection id="gc" source="{dataProvider}">
<mx:Grouping>
<mx:GroupingField name="bankType">
<mx:summaries>
<mx:SummaryRow summaryPlacement="group" id="summaryRow">
<mx:fields>
<mx:SummaryField dataField="t0"
label="t0" operation="SUM" />
</mx:fields>
</mx:SummaryRow>
</mx:summaries>
</mx:GroupingField>
</mx:Grouping>
</mx:GroupingCollection>
</mx:dataProvider>
<mx:columns>
<mx:AdvancedDataGridColumn dataField="GroupLabel"
headerText=""/>
<mx:AdvancedDataGridColumn dataField="name"
headerText="Bank" />
<mx:AdvancedDataGridColumn dataField="t0"
headerText="Amount" formatter="{formatter}"/>
</mx:columns>
</mx:AdvancedDataGrid> | 0 | [
2,
14409,
2255,
18768,
16375,
45,
184,
107,
31,
1034,
14,
14740,
11295,
60,
800,
3726,
3726,
31,
57,
40,
2255,
18768,
16375,
29,
21,
19288,
15015,
872,
17,
21,
14740,
5417,
9,
184,
107,
31,
3042,
14,
14740,
3131,
1054,
19,
5657,
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... |
OpenGL: projecting mouse click onto geometry
===
I have this view set:
glMatrixMode(GL_MODELVIEW); //Switch to the drawing perspective
glLoadIdentity(); //Reset the drawing perspective
and I get a screen position (sx, sy) from a mouse click.
Given a value of z, how can I calculate x and y in 3d-space from sx and sy? | 0 | [
2,
368,
8430,
45,
669,
68,
7567,
10840,
1204,
11689,
800,
3726,
3726,
31,
57,
48,
1418,
309,
45,
489,
19073,
17224,
15570,
5,
8430,
1,
13998,
4725,
6,
73,
12894,
18,
15915,
20,
14,
3533,
6531,
13,
8430,
8294,
13384,
856,
5,
6,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you get the Eclipse Package Explorer to show files whose names begins with a . (period)?
===
When a folder in the Eclipse Package Explorer (one which is linked to a directory somewhere in the filesystem) contains files whose names begin with a . (period), those files do not appear. Can Eclipse be configured to show these files, and if so, how? | 0 | [
2,
184,
107,
42,
164,
14,
11652,
6030,
8520,
20,
298,
6488,
1196,
1817,
2661,
29,
21,
13,
9,
13,
5,
27441,
6,
60,
800,
3726,
3726,
76,
21,
19294,
19,
14,
11652,
6030,
8520,
13,
5,
849,
56,
25,
4727,
20,
21,
16755,
3493,
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... |
Character Limit in HTML
===
How do you impliment a character limit on a textbox in HTML? I know it's a basic question, but I don't really use HTML too much, so I don't know. | 0 | [
2,
925,
4496,
19,
13,
15895,
800,
3726,
3726,
184,
107,
42,
5420,
1210,
1130,
21,
925,
4496,
27,
21,
1854,
5309,
19,
13,
15895,
60,
31,
143,
32,
22,
18,
21,
2125,
1301,
15,
47,
31,
221,
22,
38,
510,
275,
13,
15895,
266,
212,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How do I determine the value of a generic parameter on my class instance
===
I have a marker interface defined as
public interface IExtender<T>
{
}
I have a class that implements IExtender
public class UserExtender : IExtender<User>
At runtime I recieve the UserExtender type as a parameter to my evaluating method
public Type Evaluate(Type type) // type == typeof(UserExtender)
How do I make my Evaluate method return
typeof(User)
based on the runtime evaluation. I am sure reflection is involved but I can't seem to crack it.
(I was unsure how to word this question. I hope it is clear enough.) | 0 | [
2,
184,
107,
31,
3746,
14,
1923,
16,
21,
12733,
18906,
27,
51,
718,
4851,
800,
3726,
3726,
31,
57,
21,
13289,
6573,
2811,
28,
317,
6573,
31,
1706,
38,
13630,
1,
38,
1,
13,
1,
13,
1,
31,
57,
21,
718,
30,
8713,
18,
31,
1706,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you declare an object of a class before the class is created in C++?
===
Is there anyway to declare an object of a class before the class is created in C++? I ask because I am trying to use two classes, the first needs to have an instance of the second class within it, but the second class also contains an instance of the first class. I realize that you may think I might get into an infinite loop, but I actually need to create and instance of the second class before the first class. | 0 | [
2,
184,
107,
42,
10123,
40,
3095,
16,
21,
718,
115,
14,
718,
25,
679,
19,
272,
20512,
60,
800,
3726,
3726,
25,
80,
2774,
20,
10123,
40,
3095,
16,
21,
718,
115,
14,
718,
25,
679,
19,
272,
20512,
60,
31,
1349,
185,
31,
589,
74... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 relationship between margin, padding and width in different browsers?
===
CSS width value = display width of inside?
or
CSS width value = display width of inside + CSS margin-left + CSS margin-right?
| 0 | [
2,
98,
22,
18,
14,
1429,
128,
5440,
15,
4432,
3258,
17,
9456,
19,
421,
16495,
18,
60,
800,
3726,
3726,
272,
18,
18,
9456,
1923,
800,
3042,
9456,
16,
572,
60,
54,
272,
18,
18,
9456,
1923,
800,
3042,
9456,
16,
572,
2754,
272,
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,
0,
0,
0,
0,
0... |
Dymically added controls
===
I'm trying to wrap my head around asp.net. I have a background as a long time php developer, but I'm now facing the task of learning asp.net and I'm having some trouble with it. It might very well be because I'm trying to force the framework into something it is not intended for - so I'd like to learn how to do it "the right way". :-)
My problem is how to add controls to a page programmatically at runtime. As far as I can figure out you need to create the controls at page_init as they otherwise disappears at the next PostBack. But many times I'm facing the problem that I don't know which controls to add in page_init as it is dependent on values from at previous PostBack.
A simple scenario could be a form with a dropdown control added in the designer. The dropdown is set to AutoPostBack. When the PostBack occur I need to render one or more controls denepending on the selected value from the dropdown control and preferably have those controls act as if they had been added by the design (as in "when posted back, behave "properly").
Am I going down the wrong path here? | 0 | [
2,
9841,
79,
8438,
905,
8671,
800,
3726,
3726,
31,
22,
79,
749,
20,
8118,
51,
157,
140,
28,
306,
9,
2328,
9,
31,
57,
21,
2395,
28,
21,
175,
85,
13,
26120,
10058,
15,
47,
31,
22,
79,
130,
4325,
14,
3005,
16,
2477,
28,
306,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I test for an expected exception with a specific exception message in Visual Studio Test?
===
Visual Studio Test can check for expected exceptions using the ExpectedException attribute. You can pass in an exception like this:
[TestMethod]
[ExpectedException(typeof(CriticalException))]
public void GetOrganisation_MultipleOrganisations_ThrowsException()
You can also check for the message contained within the ExpectedException like this:
[TestMethod]
[ExpectedException(typeof(CriticalException), "An error occured")]
public void GetOrganisation_MultipleOrganisations_ThrowsException()
But when testing I18N applications I would use a resource file to get that error message (any may even decide to test the different localizations of the error message if I want to, but Visual Studio will not let me do this:
[TestMethod]
[ExpectedException(typeof(CriticalException), MyRes.MultipleOrganisationsNotAllowed)]
public void GetOrganisation_MultipleOrganisations_ThrowsException()
The compiler will give the following error:
> An attribute argument must be a
> constant expression, typeof expression
> or array creation expression of an
> attribute
Does anybody know how to test for an exception that has a message from a resource file?
----------
One option I have considered is using custom exception classes, but based on often heard advice such as:
> "Do create and throw custom exceptions
> if you have an error condition that
> can be programmatically handled in a
> different way than any other existing
> exception. Otherwise, throw one of the
> existing exceptions." [Source][1]
I'm not expecting to handle the exceptions differently in normal flow (it's a critical exception, so I'm going into panic mode anyway) and I don't think creating an exception for each test case is the right thing to do. Any opinions?
[1]: http://blogs.msdn.com/kcwalina/archive/2005/03/16/396787.aspx | 0 | [
2,
184,
92,
31,
1289,
26,
40,
1727,
5391,
29,
21,
1903,
5391,
2802,
19,
3458,
1120,
1289,
60,
800,
3726,
3726,
3458,
1120,
1289,
92,
2631,
26,
1727,
13392,
568,
14,
1727,
10066,
872,
35,
14755,
9,
42,
92,
1477,
19,
40,
5391,
101... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Good Secure Backups for Home Users
===
What is a good, secure, method to do backups?
Not for businesses who can spend big bucks on a solution, but people who do research & development at home and cannot afford to loose any work?
| 0 | [
2,
254,
4315,
10119,
18,
26,
213,
3878,
800,
3726,
3726,
98,
25,
21,
254,
15,
4315,
15,
2109,
20,
107,
10119,
18,
60,
52,
26,
4426,
72,
92,
3256,
580,
15324,
27,
21,
4295,
15,
47,
148,
72,
107,
527,
279,
522,
35,
213,
17,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Converting Reverse Polish Notation
===
Is there any way to interpret Reverse Polish Notation into "normal" mathematical notation when using either C++ or C#? I work for an engineering firm, so they use RPN occasionally and we need a way to convert it. Any suggestions? | 0 | [
2,
19583,
7006,
2283,
15591,
800,
3726,
3726,
25,
80,
186,
161,
20,
11584,
7006,
2283,
15591,
77,
13,
7,
17462,
7,
7046,
15591,
76,
568,
694,
272,
20512,
54,
272,
5910,
60,
31,
170,
26,
40,
1552,
1904,
15,
86,
59,
275,
13,
6952,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Java User Interface Specification
===
Java supplies standard User Interface guidelines for applications built using Java Swing. The basic guidelines are good, but I really feel the look and feel is really boring and outdated.
Is anyone aware of a publicly available Java User Interface Guide that has better look & feel guidelines than the Sun provided guidelines? | 0 | [
2,
8247,
4155,
6573,
14177,
800,
3726,
3726,
8247,
4852,
1236,
4155,
6573,
12629,
26,
3767,
392,
568,
8247,
5587,
9,
14,
2125,
12629,
50,
254,
15,
47,
31,
510,
583,
14,
361,
17,
583,
25,
510,
13081,
17,
70,
43,
1669,
9,
25,
1276... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When to enable/disable Viewstate
===
I generaly disable viewstate for my ASP.net controls unless I explicitly know I am going to require view state for them. I have found that this can significantly reduce the page size of the HTML generated.
Is this good practice? When should be enabled or disabled? | 0 | [
2,
76,
20,
9240,
118,
2906,
579,
1418,
3859,
800,
3726,
3726,
31,
297,
93,
1460,
579,
1418,
3859,
26,
51,
28,
306,
9,
2328,
8671,
4003,
31,
13108,
143,
31,
589,
228,
20,
4077,
1418,
146,
26,
105,
9,
31,
57,
216,
30,
48,
92,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 IIS6 to play nice with WordPress Pretty Permalinks
===
I've got a WordPress powered blog that I'm trying to get setup on our IIS6 server and everything works besides the permalink structure which I'm having a big headache with.
After googling around/wordpress codex I learned that it's because IIS6 doesn't have the equivalent of Apache's mod_rewrite which is required for this feature to work. So that's where I'm at now. I can't seem to find a functional solution to get the pretty permalinks to work without the "index.php/," anyone have any recommendations?
What I can't do:
- Upgrade to IIS7
- Switch to Apache
- Quit my job
Those suggestions have been offered to me, which sadly, I can't do any of those. Just an, FYI.
Much thanks for anyone who can lead me in the right direction. | 0 | [
2,
1017,
595,
18,
379,
20,
418,
2210,
29,
833,
5890,
1772,
416,
540,
6258,
18,
800,
3726,
3726,
31,
22,
195,
330,
21,
833,
5890,
7462,
8146,
30,
31,
22,
79,
749,
20,
164,
18161,
27,
318,
595,
18,
379,
8128,
17,
796,
693,
3410,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Anyone have success in the Blackberry market?
===
We've all heard of successes by small-time software developers on the iPhone App store. Has anyone actually had success selling applications in the Blackberry | 4 | [
2,
1276,
57,
1280,
19,
14,
27367,
1135,
60,
800,
3726,
3726,
95,
22,
195,
65,
752,
16,
16479,
34,
284,
8,
891,
2306,
10168,
27,
14,
21024,
4865,
1718,
9,
63,
1276,
1121,
41,
1280,
4355,
3767,
19,
14,
27367,
3,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Including a WebService reference in a control
===
I've written a control in C# that overrides the built-in DropDownList control. For this I need a javascript resource included, which I'm including as an embedded resource then adding the `WebResource` attribute, which works fine.
However, I also need to reference a webservice, which I would normally include in the scriptmanager on the page like this
<asp:scriptmanager id="scriptmanager" runat="server">
<Services>
<asp:ServiceReference Path="~/Path/To/Service.asmx" />
</Services>
</asp:scriptmanager>
Is there any way to make the page include this reference in the code behind on the control I've created, similar to how it includes the embedded javascript file?
| 0 | [
2,
215,
21,
2741,
11449,
2801,
19,
21,
569,
800,
3726,
3726,
31,
22,
195,
642,
21,
569,
19,
272,
5910,
30,
84,
11891,
18,
14,
392,
8,
108,
2804,
2968,
5739,
569,
9,
26,
48,
31,
376,
21,
8247,
8741,
6577,
506,
15,
56,
31,
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... |
Hash Code implementation
===
How do we decide on the best implementation of hashcode method for a collection?(assuming that equals method has been overridden correctly) | 0 | [
2,
19170,
1797,
6123,
800,
3726,
3726,
184,
107,
95,
4073,
27,
14,
246,
6123,
16,
19170,
9375,
2109,
26,
21,
1206,
60,
5,
9755,
723,
68,
30,
2747,
18,
2109,
63,
74,
84,
15267,
12044,
6,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Potential legal issues with storing Social Security/Insurance Numbers (SSNs/SINs)?
===
A client using our system has requested that we store the SSNs/SINs of the end users in our database. Currently, we store minimal information about users (name, email address, and optionally, country), so I'm not overly concerned about a security breach - however, I have a suspicion there could be legal issues about storing SSNs and not taking "appropriate" measures to secure them (coming from Australia, this is my first encounter with them). Is this a valid concern?
I also read on the Wikipedia page about SINs (Canada's equivalent to SSNs) that it should ONLY be used when absolutely necessary and definitely shouldn't be used as a general identifier, or similar.
So, are there any potential legal issues about this sort of thing? Do you have any recommendations? | 0 | [
2,
2222,
1517,
1549,
29,
25615,
668,
1221,
118,
108,
4082,
2416,
2116,
13,
5,
18,
18,
2172,
118,
18,
108,
18,
6,
60,
800,
3726,
3726,
21,
6819,
568,
318,
329,
63,
6602,
30,
95,
1718,
14,
13,
18,
18,
2172,
118,
18,
108,
18,
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... |
Running SQL Server on the Web Server
===
Is it good, bad, or indifferent to run SQL Server on your webserver?
I'm using Server 2008 and SQL Server 2005, but I don't think that matters to this question. | 0 | [
2,
946,
4444,
255,
8128,
27,
14,
2741,
8128,
800,
3726,
3726,
25,
32,
254,
15,
896,
15,
54,
19,
15782,
20,
485,
4444,
255,
8128,
27,
154,
2741,
10321,
106,
60,
31,
22,
79,
568,
8128,
570,
17,
4444,
255,
8128,
812,
15,
47,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0... |
Is there a function in python to split a string without ignoring the spaces?
===
Is there a function in python to split a string without ignoring the spaces in the resulting list e.g
s="This is the string i want to split".split()
gives me this
>>> s
['This', 'is', 'the', 'string', 'i', 'want', 'to', 'split']
i want something like;
['This',' ','is',' ', 'the',' ','string', ' ', .....]
| 0 | [
2,
25,
80,
21,
1990,
19,
20059,
20,
2132,
21,
3724,
366,
9321,
14,
7644,
60,
800,
3726,
3726,
25,
80,
21,
1990,
19,
20059,
20,
2132,
21,
3724,
366,
9321,
14,
7644,
19,
14,
2927,
968,
13,
62,
9,
263,
13,
18,
3726,
7,
1565,
25... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I uninstall an application using PowerShell?
===
Is there a simple way to hook into the standard 'Add or Remove Programs' functionality using PowerShell to uninstall an existing application? Or to check if the application is installed? | 0 | [
2,
184,
92,
31,
367,
108,
21300,
40,
3010,
568,
414,
15984,
60,
800,
3726,
3726,
25,
80,
21,
1935,
161,
20,
5559,
77,
14,
1236,
13,
22,
14854,
54,
4681,
1726,
22,
18548,
568,
414,
15984,
20,
367,
108,
21300,
40,
3149,
3010,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Role Based Access Control in PHP
===
Are there any open source PHP-based role-based access control system that can be used for a codeigniter framework? | 0 | [
2,
597,
432,
1381,
569,
19,
13,
26120,
800,
3726,
3726,
50,
80,
186,
368,
1267,
13,
26120,
8,
1281,
597,
8,
1281,
1381,
569,
329,
30,
92,
44,
147,
26,
21,
1797,
9693,
242,
106,
6596,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
iPhone development on Windows
===
Is there a way to develop iPhone applications on Windows? I really don't want to get yet another machine.
There is a project on http://code.google.com/p/winchain/wiki/HowToUse that seemed to work with iPhone 1.0, but had limited success with iPhone 2.0, plus it requires all the cygwin insanity.
Is there anything else, or do I have to buy a mac? | 4 | [
2,
21024,
522,
27,
1936,
800,
3726,
3726,
25,
80,
21,
161,
20,
2803,
21024,
3767,
27,
1936,
60,
31,
510,
221,
22,
38,
259,
20,
164,
768,
226,
1940,
9,
80,
25,
21,
669,
27,
7775,
6903,
9375,
9,
16111,
4875,
9,
960,
118,
306,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why Re-throwing Exceptions?
===
I've seen the following code many times:
try
{
... // some code
}
catch (Exception ex)
{
... // Do something
throw new CustomException(ex);
// or
// throw;
// or
// throw ex;
}
Can you please explain the purpose of re-throwing an exception? Is it following a pattern/best practice in exception handling? (I've read somewhere that it's called "Caller Inform" pattern?) | 0 | [
2,
483,
302,
8,
21440,
68,
13392,
60,
800,
3726,
3726,
31,
22,
195,
541,
14,
249,
1797,
151,
436,
45,
1131,
13,
1,
13,
9,
9,
9,
12894,
109,
1797,
13,
1,
2949,
13,
5,
10066,
872,
1396,
6,
13,
1,
13,
9,
9,
9,
12894,
107,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to read a barcode from an image
===
I'm seeking a library, technique or advice on how to read an [EAN-13][1] barcode from an image (including [ISBN][2],and [ISSN][3] encodings).
The image would come from a mobile phone or webcam, so resolution may be quite poor.
I'm specifically interested in something that could be used from ruby on rails, but answers for other languages are welcome. Open Source solutions preferred.
[1]: http://en.wikipedia.org/wiki/EAN-13
[2]: http://en.wikipedia.org/wiki/ISBN#EAN_format_used_in_barcodes.2C_and_upgrading
[3]: http://en.wikipedia.org/wiki/ISSN | 0 | [
2,
184,
20,
1302,
21,
748,
9375,
37,
40,
1961,
800,
3726,
3726,
31,
22,
79,
5246,
21,
1248,
15,
4873,
54,
4978,
27,
184,
20,
1302,
40,
636,
5609,
8,
1543,
500,
2558,
165,
500,
748,
9375,
37,
40,
1961,
13,
5,
3970,
636,
14084,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Attaching Informix .dat and .idx files
===
We are trying to duplicate one of our informix database on a test server, but without Informix expertise in house we can only guess what we need to do. I am learning this stuff on the fly myself and nowhere near the expertise level needed to operate Informix efficiently or even inefficiently. Anyhow...
We managed to copy the .dat and .idx files from the live server somewhere. Installed Linux and the latest Informix Dynamic Server on it and have it up and running.
Now what should we do with the .dat and idx files from the live server? Do we copy it somewhere and it will recognize it automatically?
Or is there an equivalent way like you can do attach DB from MS SQLServer to register the database files in the new database?
At my rope end... | 0 | [
2,
19514,
68,
10361,
4028,
13,
9,
593,
38,
17,
13,
9,
1340,
396,
6488,
800,
3726,
3726,
95,
50,
749,
20,
19429,
53,
16,
318,
10361,
4028,
6018,
27,
21,
1289,
8128,
15,
47,
366,
10361,
4028,
12303,
19,
191,
95,
92,
104,
2321,
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... |
Getting user name/password of the logged in user in Windows
===
Is there any API to get the currently logged in user's name and password in Windows?
Thank you in advance. | 0 | [
2,
1017,
4155,
204,
118,
6201,
9587,
16,
14,
13,
19287,
19,
4155,
19,
1936,
800,
3726,
3726,
25,
80,
186,
21,
2159,
20,
164,
14,
871,
13,
19287,
19,
4155,
22,
18,
204,
17,
20884,
19,
1936,
60,
3531,
42,
19,
3612,
9,
3,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Why is ENUM better then INT
===
I just ran a "PROCEDURE ANALYSE ( )" on one of my tables. And I have this column that is of type INT and it only ever contains values from 0 to 12 (category IDs).
And MySQL said that I would be better of with a ENUM('0','1','2',...,'12'). This category's are basically static and won't change in the future, but if they do I can just alter that column and add it to the ENUM list...
So why is ENUM better in this case? | 0 | [
2,
483,
25,
1957,
723,
574,
94,
19,
38,
800,
3726,
3726,
31,
114,
717,
21,
13,
7,
15617,
69,
4221,
13,
21702,
13,
5,
13,
6,
7,
27,
53,
16,
51,
7484,
9,
17,
31,
57,
48,
4698,
30,
25,
16,
1001,
19,
38,
17,
32,
104,
462,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
jBPM, concurrent execution and process variables
===
When a process in jBPM forks into concurrent paths, each of these paths gets their own copy of the process variables, so that they run isolated from each other.
But what happens when the paths join again ?
Obviously there could be conflicting updates.
Does the context revert back to the state before the fork?
Can I choose to copy individual variables from the separate tracks? | 0 | [
2,
487,
220,
5576,
15,
19513,
5769,
17,
953,
12157,
800,
3726,
3726,
76,
21,
953,
19,
487,
220,
5576,
8777,
18,
77,
19513,
12074,
15,
206,
16,
158,
12074,
3049,
66,
258,
4344,
16,
14,
953,
12157,
15,
86,
30,
59,
485,
6331,
37,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which CSS tag creates a box like this with title?
===
I want to create a box like this with title:
![CSS box with title][1]
Can any one please let me know if there is a default CSS tag to do this? Or do I need to create my custom style?
[1]: http://www.mozammelhaque.com/d/box.JPG | 0 | [
2,
56,
272,
18,
18,
3383,
9695,
21,
1649,
101,
48,
29,
581,
60,
800,
3726,
3726,
31,
259,
20,
1600,
21,
1649,
101,
48,
29,
581,
45,
13,
187,
2558,
6824,
18,
1649,
29,
581,
500,
2558,
165,
500,
92,
186,
53,
2247,
408,
55,
143... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
File format of CF10-jpg
===
While working on a tool that allows to exchange images of several third-party applications and thus creating individual "skins" for those applications, I have stumbled across a jpg-format about which I cannot seem to find any decent informations.
When looking at it in a hex-editor, it starts with the tag "CF10". Searching the internet has only provided a tool that is able to handle these kind of files, without any additional informations.
Does anyone have any further informations about this type of jpg-format? | 0 | [
2,
3893,
2595,
16,
10084,
1036,
8,
12851,
263,
800,
3726,
3726,
133,
638,
27,
21,
5607,
30,
2965,
20,
1950,
3502,
16,
238,
422,
8,
9635,
3767,
17,
1086,
2936,
1359,
13,
7,
18,
6773,
7,
26,
273,
3767,
15,
31,
57,
10282,
464,
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... |
Property Grid Object failing on combo box selection but OK when combobox scrolled or double clicked
===
I have a Property Grid in C#, loading up a 'PropertyAdapter' object (a basic wrapper around one of my objects displaying relevant properties with the appropriate tags)
I have a TypeConverter on one of the properties (DataType, that returns an enumeration of possible values) as I want to limit the values available to the property grid to Decimal and Integer, with the 2 methods as follows
public override bool GetStandardValuesSupported(ITypeDescriptorContext context)
{
return true;
}
public override StandardValuesCollection GetStandardValues(ITypeDescriptorContext context)
{
return new StandardValuesCollection(new List<Constants.DataTypes>() { Constants.DataTypes.Decimal, Constants.DataTypes.Integer });
}
This is displaying just as I want it on the property grid, and when I double click the property field in the property grid, it happily switches between Integer and Decimal. Similarily I can use the mouse wheel to scroll through the options in the property filed's combobox.
If I however use the property field as a Combo Box and select a value from the drop-down, I get the standard property grid error box with the error:
> Object of type 'System.String' cannot
> be converted to type
> 'Pelion.PM3.Utils.Constants+DataTypes'.
I am assuming I can use the Converter overrides in the Type converter to trap these and convert them to an Enum of DataTypes, but why would the property grid fail when I select from the drop-down instead of double clicking or 'mouseewheeling' on the drop down? | 0 | [
2,
1354,
7354,
3095,
7250,
27,
22621,
1649,
3155,
47,
5854,
76,
22621,
5309,
12159,
69,
54,
1494,
15802,
800,
3726,
3726,
31,
57,
21,
1354,
7354,
19,
272,
5910,
15,
12797,
71,
21,
13,
22,
10890,
106,
1084,
27576,
106,
22,
3095,
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... |
VS 2003 CrystalReports - details section problem
===
I have 2 details section on my report (Datails a and Details b).
Fields i both sections can grow up to 10 lines.
How to force CrystalReport that both section must be printed on one page.
Currently CrystalReport on bottom page print section "Details a", but section "Details b" print on next page.
How to prevent this behavior.
Sorry for my bad English and thank you in advance.
| 0 | [
2,
4611,
973,
4282,
17437,
18,
13,
8,
3289,
1050,
1448,
800,
3726,
3726,
31,
57,
172,
3289,
1050,
27,
51,
1330,
13,
5,
593,
8682,
18,
21,
17,
3289,
334,
6,
9,
2861,
31,
156,
4501,
92,
3213,
71,
20,
332,
1560,
9,
184,
20,
558... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Hiding toolbar / status bar with javascript in CURRENT browser window?
===
Is there some way to hide the browser toolbar / statusbar etc in current window via javascript? I know I can do it in a popup with window.open () but i need to do it this way. Is it possible at all?
| 0 | [
2,
5314,
5607,
1850,
13,
118,
1782,
748,
29,
8247,
8741,
19,
866,
16495,
1463,
60,
800,
3726,
3726,
25,
80,
109,
161,
20,
3077,
14,
16495,
5607,
1850,
13,
118,
1782,
1850,
2722,
19,
866,
1463,
1197,
8247,
8741,
60,
31,
143,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Preventing Cisco PIX/ASA5520 from advertising ospf default route to zone
===
I have an ASA5520, and I want to run ospf on it. It has 4 interfaces. I only want the default-information originate to advertise on one interface. How would I do that? | 2 | [
2,
11520,
28184,
13,
18321,
118,
8588,
4083,
1323,
37,
5620,
13,
759,
7721,
12838,
858,
20,
2464,
800,
3726,
3726,
31,
57,
40,
28,
58,
4083,
1323,
15,
17,
31,
259,
20,
485,
13,
759,
7721,
27,
32,
9,
32,
63,
268,
6573,
18,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How not to repeat yourself across projects and/or languages
===
I'm working on several distinct but related projects in different programming languages. Some of these projects need to parse filenames written by other projects, and expect a certain filename pattern.
This pattern is now hardcoded in several places and in several languages, making it a maintenance bomb. It is fairly easy to define this pattern exactly once in a given project, but what are the techniques for defining it once and for all for all projects and for all languages in use? | 0 | [
2,
184,
52,
20,
6830,
2834,
464,
2314,
17,
118,
248,
2556,
800,
3726,
3726,
31,
22,
79,
638,
27,
238,
4421,
47,
1597,
2314,
19,
421,
3143,
2556,
9,
109,
16,
158,
2314,
376,
20,
2017,
870,
3893,
7259,
18,
642,
34,
89,
2314,
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... |
Open source/Home developer's Toolbox
===
I'm looking for tools which are free for personal use.
I've been using [#Develop][1] And VS Express edition as IDE for quite some time now.
For Unit testing I use [NUnit][2] and [TestDriven.NET][3] for runner.
Are there any other good tools for an open source developer?
[1]: http://www.icsharpcode.net/OpenSource/SD/
[2]: http://www.nunit.org
[3]: http://www.testdriven.net/ | 4 | [
2,
368,
1267,
118,
8167,
10058,
22,
18,
5607,
5309,
800,
3726,
3726,
31,
22,
79,
699,
26,
4672,
56,
50,
551,
26,
1319,
275,
9,
31,
22,
195,
74,
568,
636,
5910,
26051,
500,
2558,
165,
500,
17,
4611,
2999,
1322,
28,
13,
3448,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.