unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Writing a cookie from an ASP.Net HTTPHandler - Page.Response object?
===
I am creating an HTTP handler that listens for calls to a specific file type, and handles it accordingly. My HTTP Handler listens for .bcn files, then writes a cookie to the user's computer and sends back an image... this will be used in advertising banners so that the user is tagged as seeing the banner, and we can then offer special deals when they visit our site later.
The problem i'm having is getting access to the Page object... of course an HTTPHandler is not actually a page, and since the Response object lives within the Page object, I can't get access to it to write the cookie.
Is there a way around this, or do i need to revert back to just using a standard aspx page to do this?
Thanks heaps..
Greg | 0 | [
2,
1174,
21,
19980,
37,
40,
28,
306,
9,
2328,
7775,
3203,
1252,
13,
8,
2478,
9,
99,
18,
8782,
870,
3095,
60,
800,
3726,
3726,
31,
589,
2936,
40,
7775,
24641,
30,
3834,
18,
26,
3029,
20,
21,
1903,
3893,
1001,
15,
17,
3053,
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... |
Should all public methods of an API be documented?
===
When writing "library" type classes, is it better practice to always write markup documentation (i.e. javadoc) in java or assume that the code can be "self-documenting"? For example, given the following method stub:
/**
* Copies all readable bytes from the provided input stream to the provided output
* stream. The output stream will be flushed, but neither stream will be closed.
*
* @param inStream an InputStream from which to read bytes.
* @param outStream an OutputStream to which to copy the read bytes.
* @throws IOException if there are any errors reading or writing.
*/
public void copyStream(InputStream inStream, OutputStream outStream) throws IOException {
// copy the stream
}
The javadoc seems to be self-evident, and noise that just needs to be updated if the funcion is changed at all. But the sentence about flushing and not closing the stream could be valuable.
So, when writing a library, is it best to:
a) always document
b) document anything that isn't obvious
c) never document (code should speak for itself!)
I tend toward option b, myself... | 0 | [
2,
378,
65,
317,
3195,
16,
40,
21,
2159,
44,
8926,
60,
800,
3726,
3726,
76,
1174,
13,
7,
1210,
2559,
622,
7,
1001,
2684,
15,
25,
32,
574,
1345,
20,
550,
2757,
943,
576,
13945,
13,
5,
49,
9,
62,
9,
8247,
13799,
6,
19,
8247,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 often do you update statistics in SQL Server 2000?
===
I'm wondering if updating statistics has helped you before and how did you know to update them? | 0 | [
2,
184,
478,
107,
42,
11100,
5818,
19,
4444,
255,
8128,
824,
60,
800,
3726,
3726,
31,
22,
79,
5712,
100,
71,
43,
1880,
5818,
63,
1456,
42,
115,
17,
184,
144,
42,
143,
20,
11100,
105,
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... |
What's a good Systems Interface Specification template?
===
A client has a number of disparate systems that they are planning to link together and have asked for a set of system interface specifications that would document the data and protocols used to interface the different parts.
The interfaces are between processes not between users.
Any recommendations for a template that we could use to document the system interfaces?
| 0 | [
2,
98,
22,
18,
21,
254,
1242,
6573,
14177,
22894,
60,
800,
3726,
3726,
21,
6819,
63,
21,
234,
16,
1460,
6351,
591,
1242,
30,
59,
50,
2334,
20,
3508,
429,
17,
57,
411,
26,
21,
309,
16,
329,
6573,
17971,
30,
83,
4492,
14,
1054,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get a range's address including the worksheet name, but not the workbook name, in Excel VBA?
===
If I have a Range object--for example, let's say it refers to cell A1 on a worksheet called Book1. So I know that calling Address() will get me a simple local reference: "$A$1". I know it can also be called as Address(External:=True) to get a reference including the workbook name and worksheet name: "[Book1]Sheet1!$A$1".
What I want is to get an address including the sheet name, but not the book name. I really don't want to call Address(External:=True) and try to strip out the workbook name myself with string functions. Is there any call I can make on the range to get "Sheet1!$A$1"? | 0 | [
2,
184,
107,
31,
164,
21,
978,
22,
18,
3218,
215,
14,
170,
17627,
204,
15,
47,
52,
14,
170,
5199,
204,
15,
19,
20700,
566,
969,
60,
800,
3726,
3726,
100,
31,
57,
21,
978,
3095,
8,
8,
1106,
823,
15,
408,
22,
18,
395,
32,
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 standard techniques are there for using cpu specific features in dll's?
===
Short version: I'm wondering if it's possible, and how best, to utilise cpu specific
instructions within a dll?
Slightly longer version:
When downloading (32bit) dll's from, say, Microsoft it seems that one size fits all processors.
Does this mean that they are strictly built for the lowest common denominator (ie. the
minimum platform supported by the OS)?
Or is there some technique that is used to export a single interface within the dll but utilise
cpu specific code behind the scenes to get optimal performance? And if so, how is it done?
| 0 | [
2,
98,
1236,
4212,
50,
80,
26,
568,
17578,
1903,
967,
19,
13,
43,
211,
22,
18,
60,
800,
3726,
3726,
502,
615,
45,
31,
22,
79,
5712,
100,
32,
22,
18,
938,
15,
17,
184,
246,
15,
20,
13,
14255,
2628,
17578,
1903,
7650,
363,
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... |
Streaming large result sets with MySQL 4.1.x + Connector/J
===
I’m trying to get a large result set to stream and having no luck. The [MySQL docs][1] are somewhat unclear as to whether this should even work. E.g.:
<blockquote>When using versions of the JDBC driver earlier than 3.2.1, and connected to server versions earlier than 5.0.3, the setFetchSize() method has no effect, other than to toggle result set streaming as described above.</blockquote>
I'm using MySQL 4.1.19 with Connector/J 5.1.6. My code is basically:
stmt = conn.createStatement(java.sql.ResultSet.TYPE_FORWARD_ONLY, java.sql.ResultSet.CONCUR_READ_ONLY);
stmt.setFetchSize(Integer.MIN_VALUE);
stmt.executeQuery(“select * from huge_table”);
Thanks.
[1]: http://dev.mysql.com/doc/refman/4.1/en/connector-j-reference-implementation-notes.html | 0 | [
2,
11920,
370,
829,
3415,
29,
51,
18,
22402,
268,
9,
165,
9,
396,
2754,
17991,
118,
728,
800,
3726,
3726,
31,
1,
79,
749,
20,
164,
21,
370,
829,
309,
20,
3766,
17,
452,
90,
5419,
9,
14,
636,
915,
18,
22402,
9765,
18,
500,
25... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Resources for code generation of database objects
===
I am working a project where I need to generate a series of classes to represent/access data in the database. Third party projects such as hibernate or subsonic are not an option. I am new in this subject domain, so I am looking for information on the topic. The project is in .net.
**What is your single best resource for topics on code generation of data access?**
<br/>
<U>Please post only one link at a time and look for your resource before posting. If you find your resource, please vote up instead of posting it. </u>.
( I am not interesting in rep, just information) | 0 | [
2,
2566,
26,
1797,
2782,
16,
6018,
3916,
800,
3726,
3726,
31,
589,
638,
21,
669,
113,
31,
376,
20,
7920,
21,
231,
16,
2684,
20,
3501,
118,
20604,
1054,
19,
14,
6018,
9,
422,
346,
2314,
145,
28,
4148,
2102,
8820,
54,
972,
17766,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Code Review Tools? (Mondrain)
===
I've read a bit about Google's [Mondrain][1], and I've seen Atlassian's [Crucible][2] demonstrated - I'm convinced that the tools have value. Are there open-source code review tools? It would be used on a proprietary codebase, so it can't be a public site or service (eg: Google Code's features include some of those of Crucible). We have released some of our libraries as open source, but by and large my employer's codebase is still closed.
[1]: http://www.niallkennedy.com/blog/2006/11/google-mondrian.html
[2]: http://www.atlassian.com/software/crucible/ | 0 | [
2,
368,
1267,
1797,
1487,
4672,
60,
13,
5,
4660,
8664,
6,
800,
3726,
3726,
31,
22,
195,
1302,
21,
1142,
88,
8144,
22,
18,
636,
4660,
8664,
500,
2558,
165,
500,
15,
17,
31,
22,
195,
541,
11986,
10760,
22,
18,
636,
22010,
2854,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Oracle Insert via Select from multiple tables where one table may not have a row
===
I have a number of code value tables that contain a code and a description with a Long id.
I now want to create an entry for an Account Type that references a number of codes, so I have something like this:
insert into account_type_standard (account_type_Standard_id,
tax_status_id, recipient_id)
( select account_type_standard_seq.nextval,
ts.tax_status_id, r.recipient_id
from tax_status ts, recipient r
where ts.tax_status_code = ?
and r.recipient_code = ?)
This retrieves the appropriate values from the tax\_status and recipient tables if a match is found for their respective codes. Unfortunately, recipient_code is nullable, and therefore the ? substitution value could be null. Of course, the implicit join doesn't return a row, so a row doesn't get inserted into my table.
I've tried using NVL on the ? and on the r.recipient_id.
I've tried to force an outer join on the r.recipient_code = ? by adding (+), but it's not an explicit join, so Oracle still didn't add another row.
Anyone know of a way of doing this?
I can obviously modify the statement so that I do the lookup of the recipient\_id externally, and have a ? instead of r.recipient\_id, and don't select from the recipient table at all, but I'd prefer to do all this in 1 SQL statement. | 0 | [
2,
15759,
14692,
1197,
5407,
37,
1886,
7484,
113,
53,
859,
123,
52,
57,
21,
3131,
800,
3726,
3726,
31,
57,
21,
234,
16,
1797,
1923,
7484,
30,
3717,
21,
1797,
17,
21,
5318,
29,
21,
175,
4924,
9,
31,
130,
259,
20,
1600,
40,
2792... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Evolutionary Algorithms: Optimal Repopulation Breakdowns
===
It's really all in the title, but here's a breakdown for anyone who is interested in Evolutionary Algorithms:
In an EA, the basic premise is that you randomly generate a certain number of organisms (which are really just sets of parameters), run them against a problem, and then let the top performers survive.
You then repopulate with a combination of crossbreeds of the survivors, mutations of the survivors, and also a certain number of new random organisms.
Do that several thousand times, and efficient organisms arise.
Some people also do things like introduce multiple "islands" of organisms, which are seperate populations that are allowed to crossbreed once in awhile.
So, my question is: what are the optimal repopulation percentages?
I have been keeping the top 10% performers, and repopulating with 30% crossbreeds and 30% mutations. The remaining 30% is for new organisms.
I have also tried out the multiple island theory, and I'm interested in your results on that as well.
It is not lost on me that this is exactly the type of problem an EA could solve. Are you aware of anyone trying that?
Thanks in advance! | 0 | [
2,
13918,
15935,
45,
17586,
302,
22000,
13369,
18,
800,
3726,
3726,
32,
22,
18,
510,
65,
19,
14,
581,
15,
47,
235,
22,
18,
21,
13369,
26,
1276,
72,
25,
3158,
19,
13918,
15935,
45,
19,
40,
13507,
15,
14,
2125,
20236,
25,
30,
42... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Web Log analysis in Java
===
How to read a web server log file in Java. This file is getting updated all the time. If I open a new FileInputStream, will it read the log real time?
Regards | 0 | [
2,
2741,
6738,
2495,
19,
8247,
800,
3726,
3726,
184,
20,
1302,
21,
2741,
8128,
6738,
3893,
19,
8247,
9,
48,
3893,
25,
1017,
6372,
65,
14,
85,
9,
100,
31,
368,
21,
78,
3893,
108,
4881,
11260,
15,
129,
32,
1302,
14,
6738,
683,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
error installing RMagick from gem
===
Trying to install the RMagick gem is failing with an error about being unable to find ImageMagick libraries, even though I'm sure they are installed.
The pertinent output from gem install rmagick is:
checking for InitializeMagick() in -lMagick... no
checking for InitializeMagick() in -lMagickCore... no
checking for InitializeMagick() in -lMagick++... no
Can't install RMagick 2.6.0. Can't find the ImageMagick library or one of the dependent libraries. Check the mkmf.log file for more detailed information.
*** extconf.rb failed ***
And looking in mkmf.log reveals:
have_library: checking for InitializeMagick() in -lMagick... -------------------- no
"/usr/local/bin/gcc -o conftest -I.
-I/usr/local/lib/ruby/1.8/i386-solaris2.10 -I. -I/usr/local/include/ImageMagick -I/usr/local/include/ImageMagick conftest.c -L. - L/usr/local/lib -Wl,-R/usr/local/lib -L/usr/local/lib -L/usr/local/lib -R/usr/local/lib -lfreetype -lz -L/usr/local/lib -L/usr/local/lib -lMagickCore -lruby-static - lMagick -ldl -lcrypt -lm -lc"
ld: fatal: library -lMagick: not found
ld: fatal: File processing errors. No output written to conftest
This is on Solaris 10 x86 with ImageMagick version 6.4.3 and RMagick version 2.6.0
Any advice would be much appreciated!!
googling hasn't been too helpful.
thanks - | 0 | [
2,
7019,
25429,
761,
21200,
197,
37,
8551,
800,
3726,
3726,
749,
20,
16146,
14,
761,
21200,
197,
8551,
25,
7250,
29,
40,
7019,
88,
142,
2343,
20,
477,
1961,
21200,
197,
8649,
15,
166,
362,
31,
22,
79,
562,
59,
50,
4066,
9,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Convert console exe to dll in C
===
I am interested in calling [SoX][1], an open source console application, from another Windows GUI program (written in Delphi naturally). Instead of dealing with scraping and hiding the console window, I would like to just convert the application to a DLL that I can call from my application.
Before I start down this path I am curious how much work I should expect to be in for? Are we talking a major undertaking, or is there a straight forward solution? I know some C, but am by no means an expert.
I am not expecting SoX specific details, just EXE console application conversion to DLL in general. If someone is familiar with SoX though, even better.
[1]: http://sourceforge.net/projects/sox | 0 | [
2,
8406,
8650,
1396,
62,
20,
13,
43,
211,
19,
272,
800,
3726,
3726,
31,
589,
3158,
19,
2555,
636,
18,
6326,
500,
2558,
165,
500,
15,
40,
368,
1267,
8650,
3010,
15,
37,
226,
1936,
9457,
625,
13,
5,
6390,
19,
23030,
8000,
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... |
Can you Catch an Exception after the main application unit has ended?
===
In one of our application im getting an exception that i can not seem to find or trap.
...
Application.CreateForm(TFrmMain, FrmMain);
outputdebugstring(pansichar('Application Run')); //this is printed
Application.Run;
outputdebugstring(pansichar('Application Run After')); //this is printed
end.
<--- The Exception seems to be here
The Event log shows
> ODS: Application Run
> //Various Application Messages
> ODS: Application Run After
> First Change Exception at $xxxxxxxx. ...etc
All i can think of is it is the finalization code of one of the units.
(Delphi 7)
| 0 | [
2,
92,
42,
2949,
40,
5391,
75,
14,
407,
3010,
1237,
63,
1272,
60,
800,
3726,
3726,
19,
53,
16,
318,
3010,
797,
1017,
40,
5391,
30,
31,
92,
52,
2260,
20,
477,
54,
5585,
9,
13,
9,
9,
9,
3010,
9,
6037,
1373,
4190,
5,
11720,
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... |
In sharepoint designer's workflow editor how do I get the workflow initiators username?
===
In Sharepoint designer's workflow editor I wish to retrieve the username/name of the work flow initiator (i.e. who kicked it off or triggered the workflow) - this is relatively easy to do using 3rd party products such as Nintex Workflow 2007 (where I would use something like {Common:Initiator}) - but I can't seem to find any way out of the box to do this using share point designer and MOSS 2007. | 0 | [
2,
19,
1891,
3132,
4742,
22,
18,
170,
9990,
1835,
184,
107,
31,
164,
14,
170,
9990,
19,
8793,
9922,
4155,
7259,
60,
800,
3726,
3726,
19,
1891,
3132,
4742,
22,
18,
170,
9990,
1835,
31,
2536,
20,
11917,
14,
4155,
7259,
118,
7259,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why use iterators instead of array indices?
===
Take the following two lines of code:
for (int i = 0; i < some_vector.size(); i++)
{
//do stuff
}
And this:
for (some_iterator = some_vector.begin(); some_iterator != some_vector.end();
some_iterator++)
{
//do stuff
}
I'm told that the second way is preferred. Why exactly is this? | 0 | [
2,
483,
275,
32,
106,
9922,
700,
16,
7718,
19,
8779,
18,
60,
800,
3726,
3726,
247,
14,
249,
81,
1560,
16,
1797,
45,
26,
13,
5,
6391,
31,
800,
713,
73,
31,
13,
1,
109,
1,
28033,
9,
10454,
5,
6,
73,
31,
20512,
6,
13,
1,
12... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
"Hidden Secrets" of the Visual Studio .NET debugger?
===
As much as I generally don't like the discussion/subjective posts on SO, I have really come to appreciate the "Hidden Secrets" set of posts that people have put together. They provide a great overview of some commonly missed tools that you might now otherwise discover.
For this question I would like to explore the Visual Studio .NET debugger. What are some of the "hidden secrets" in the VS.NET debugger that you use often or recently discovered and wish you would have known long ago? | 4 | [
2,
13,
7,
1822,
43,
817,
7818,
7,
16,
14,
3458,
1120,
13,
9,
2328,
121,
2345,
11356,
60,
800,
3726,
3726,
28,
212,
28,
31,
1469,
221,
22,
38,
101,
14,
5460,
118,
28743,
1284,
9868,
27,
86,
15,
31,
57,
510,
340,
20,
8831,
14,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you document projects you work on?
===
Where I work, I'm constantly doing development work. We're usually in a position where we're always busy doing development work with no time to write real maintainer documentation. I doubt my position is unique.
My question to everyone is, how do you/your development team handle documentation?
Do you document as you go? Do you write documentation at the end of the project? Is there a separate team of people who are solely responsible for gathering and writing documentation? Do you use inline documentation like Javadoc comments or .NET's XML comments?
What does everyone find to be the most effective, and how do you plan time to actually write it? | 0 | [
2,
184,
107,
42,
4492,
2314,
42,
170,
27,
60,
800,
3726,
3726,
113,
31,
170,
15,
31,
22,
79,
7545,
845,
522,
170,
9,
95,
22,
99,
951,
19,
21,
649,
113,
95,
22,
99,
550,
4394,
845,
522,
170,
29,
90,
85,
20,
2757,
683,
4027,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Linux: How to measure actual memory usage of an application or process?
===
How do you measure the memory usage of an application or process in Linux?
I've read [here][1] that "ps" is not an accurate tool to use for this intent.
Thanks,
Kenneth
[1]: http://virtualthreads.blogspot.com/2006/02/understanding-memory-usage-on-linux.html | 0 | [
2,
13024,
45,
184,
20,
4058,
3463,
1912,
7514,
16,
40,
3010,
54,
953,
60,
800,
3726,
3726,
184,
107,
42,
4058,
14,
1912,
7514,
16,
40,
3010,
54,
953,
19,
13024,
60,
31,
22,
195,
1302,
636,
6836,
500,
2558,
165,
500,
30,
13,
7,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Style - When to serialize a Django model Instance: signals vs model's save method
===
I plan to serialize a Django model to XML when it's saved or updated. (The XML's going to be imported into a flash movie). Is it better to listen for a post_save() or pre_save() signal and then perform the serialization, or to just handle it in the model's save() methon | 0 | [
2,
1034,
13,
8,
76,
20,
5956,
2952,
21,
3857,
14541,
1061,
4851,
45,
7616,
4611,
1061,
22,
18,
2079,
2109,
800,
3726,
3726,
31,
944,
20,
5956,
2952,
21,
3857,
14541,
1061,
20,
23504,
76,
32,
22,
18,
4377,
54,
6372,
9,
13,
5,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to measure "spare" CPU time on a Linux based system
===
For some of the customers that we develop software for, we are required to "guarantee" a certain amount of spare resources (memory, disk space, CPU). Memory and disk space are simple, but CPU is a bit more difficult.
One technique that we have used is to create a process that consumes a guaranteed amount of CPU time (say 2.5 seconds every 5 seconds). We run this process at highest priority in order to guarantee that it runs and consumes all of its required CPU cycles.
If our normal applications are able to run at an acceptable level of performance and can pass all of their functionality tests while the spare time process is running as well, then we "assume" that we have met our commitment for spare CPU time.
I'm sure that there are other techniques for doing the same thing, and would like to learn about them. | 0 | [
2,
98,
25,
14,
246,
161,
20,
4058,
13,
7,
3401,
1509,
7,
17578,
85,
27,
21,
13024,
432,
329,
800,
3726,
3726,
26,
109,
16,
14,
5279,
30,
95,
2803,
2306,
26,
15,
95,
50,
1390,
20,
13,
7,
15258,
7874,
2851,
7,
21,
1200,
2006,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 organize and keep track of multiple (many) projects
===
As a contractor, out-sourcer and shareware author,I have about 5-10 projects going on at any one time. Each project has a todo list, requirements need to be communicated to other outsources and employees, status needs to be given to clients, and developer's questions need to be answered.
Sometimes it is too much... but then I realize that I'm not very organized and there has to be a better way.
What is your better way?
How do you keep track of requirements for multiple projects, assign work to multiple developers, obtain and give status for multiple projects to multiple clients?
What tools do you use? What processes? | 2 | [
2,
184,
107,
42,
9213,
17,
643,
792,
16,
1886,
13,
5,
14842,
6,
2314,
800,
3726,
3726,
28,
21,
15136,
15,
70,
8,
12097,
139,
17,
1891,
5011,
1314,
15,
49,
57,
88,
331,
8,
1036,
2314,
228,
27,
35,
186,
53,
85,
9,
206,
669,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Strange VB6 build problems (related to nlog)
===
This I think is related to my use of the nlog C++ API (and my question on the nlog forum is [here][1]); the purpose of my asking this question here is to get a wider audience to my problem and perhaps to also get some more general ideas behind the VB6 IDE's failure to build in my particular scenario.
Briefly, the problem that I am having is that I am having trouble building VB6 components which reference unmanaged C++ components which have calls to nlog's C\C++ API (which is defined in NLogC.DLL). The build problems are not occurring during compile time, they are occurring when the binary is being built which suggests to me that it's some kind of linker type problem? Don't know enough about how VB6 binaries are produced to tell. The VB6 binary is produced, but it is corrupted and crashes shortly after it is invoked.
Has anyone had any similar experiences with VB6 (doesn't have to be related to nlog or C++)?
[1]: http://www.nabble.com/NLogC-problems-with-VB6-IDE-tt19662300s6167.html | 0 | [
2,
2578,
13,
20468,
379,
1895,
1716,
13,
5,
6203,
20,
13,
103,
5567,
6,
800,
3726,
3726,
48,
31,
277,
25,
1597,
20,
51,
275,
16,
14,
13,
103,
5567,
272,
20512,
21,
2159,
13,
5,
290,
51,
1301,
27,
14,
13,
103,
5567,
5691,
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... |
Deploying perl to a share nothing cluster
===
Anyone have suggestions for deployment methods for perl modules to a share nothing cluster?
Our current method is very manual.
1. Take down half the cluster
2. Copy perl modules ( cpan style modules ) to downed cluster members
3. ssh to each member and run perl Makefile.pl; make ; make install on each module to be installed
4. Confirm deployment
5. In service the newly deployed cluster members, out of service the old cluster members and repeat steps 2 -> 4
This is obviously far from optimal, anyone have or know of good tool chains for deploying perl modules to a shared nothing cluster? | 0 | [
2,
17617,
68,
416,
255,
20,
21,
1891,
626,
7460,
800,
3726,
3726,
1276,
57,
18389,
26,
10475,
3195,
26,
416,
255,
17113,
20,
21,
1891,
626,
7460,
60,
318,
866,
2109,
25,
253,
5132,
9,
137,
9,
247,
125,
519,
14,
7460,
172,
9,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SVN installation
===
I am going to install SVN for my personal projects. Is it better to install it on a spare machine(Win XP) or will I save myself grief if I install it on the machine I use for development(Vista). | 0 | [
2,
13,
18,
16578,
7758,
800,
3726,
3726,
31,
589,
228,
20,
16146,
13,
18,
16578,
26,
51,
1319,
2314,
9,
25,
32,
574,
20,
16146,
32,
27,
21,
8001,
1940,
5,
4181,
23045,
6,
54,
129,
31,
2079,
992,
10101,
100,
31,
16146,
32,
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,
0,
0,
0,
0,
0,
0,
0... |
Is there a Dependency Injection framework for PHP4?
===
I'm stuck on a PHP 4 server, and I would like to start moving an old legacy project to modern Design Patterns, including Dependency Injection. Are there any dependency injection frameworks that will work with PHP 4? | 0 | [
2,
25,
80,
21,
26835,
13646,
6596,
26,
13,
26120,
300,
60,
800,
3726,
3726,
31,
22,
79,
4549,
27,
21,
13,
26120,
268,
8128,
15,
17,
31,
83,
101,
20,
799,
1219,
40,
315,
7780,
669,
20,
773,
704,
6282,
15,
215,
26835,
13646,
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,
0,
0... |
What is the best method to convert to an Integer in Javascript?
===
There are several different methods for converting floating point numbers to Integers in Javascript. My question is what method gives the best performance, is most compatible, or is considered the best practise?
Here are a few methods that I know of:
var a = 2.5;
window.parseInt(a); // 2
Math.floor(a); // 2
a | 0; // 2
I'm sure there are others out there. Suggestions?
| 0 | [
2,
98,
25,
14,
246,
2109,
20,
8406,
20,
40,
13820,
19,
8247,
8741,
60,
800,
3726,
3726,
80,
50,
238,
421,
3195,
26,
19583,
8319,
454,
2116,
20,
13820,
18,
19,
8247,
8741,
9,
51,
1301,
25,
98,
2109,
2352,
14,
246,
956,
15,
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... |
Sources for learning about Scheme Macros: define-syntax and syntax-rules
===
I've read [JRM's Syntax-rules Primer][1] for the Merely Eccentric and it has helped me understand syntax-rules and how it's different from common-lisp's define-macro. syntax-rules is only one way of implementing a syntax transformer within define-syntax.
I'm looking for two things, the first is more examples and explanations of syntax-rules and the second is good sources for learning the other ways of using define-syntax. What resources do you recommend?
[1]: http://www.xs4all.nl/~hipster/lib/scheme/gauche/define-syntax-primer.txt | 0 | [
2,
2662,
26,
2477,
88,
4276,
9069,
18,
45,
9267,
8,
9507,
15514,
17,
22649,
8,
16154,
18,
800,
3726,
3726,
31,
22,
195,
1302,
636,
13529,
79,
22,
18,
22649,
8,
16154,
18,
1621,
139,
500,
2558,
165,
500,
26,
14,
5494,
15632,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using AppleScript to hide Keynote Text Fields in A Slide
===
I am no AppleScript Jedi, I've only done a few simple things, but I haven't been able to figure this one out and could use some help:
My wife uses slides for her Art History courses and would like to use the same slides for exams (sans identifying names). Rather than create a new presentation, I'd like a tool that iterates through the slides and hides the text fields.
Looking through the Keynote dictionary didn't give me any clues as to how to approach this, any ideas? | 0 | [
2,
568,
4037,
8741,
20,
3077,
26991,
1854,
2861,
19,
21,
6464,
800,
3726,
3726,
31,
589,
90,
4037,
8741,
12671,
49,
15,
31,
22,
195,
104,
677,
21,
310,
1935,
564,
15,
47,
31,
2933,
22,
38,
74,
777,
20,
1465,
48,
53,
70,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can a C program produce a core dump of itself without terminating?
===
I want a C program to produce a core dump under certain circumstances. This is a program that runs in a production environment and isn't easily stopped and restarted to adjust other kinds of debugging code. Also, since it's in a production environment, I don't want to call abort(). The issues under investigation aren't easily replicated in a non-production environment. What I'd like is for the program, when it detects certain issues, to produce a core dump on its own, preferably with enough information to rename the file, and then continue. | 0 | [
2,
184,
92,
21,
272,
625,
2213,
21,
2884,
11424,
16,
1145,
366,
25724,
60,
800,
3726,
3726,
31,
259,
21,
272,
625,
20,
2213,
21,
2884,
11424,
131,
1200,
5072,
9,
48,
25,
21,
625,
30,
1461,
19,
21,
637,
2307,
17,
2532,
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... |
Can anyone recommend a good Business Activity Monitoring (BAM) tool?
===
We are looking for a flexible Business Activity Monitoring package affordable enough for the average SMB and that can integrate reasonably well with our .NET applications (SOAP/REST interface is just fine).
I am aware that BizTalk has a BAM component, but we are not interested in using BizTalk as a messaging solution and I hate to buy a BizTalk license and get saddled with the heft of BizTalk just for the integrated BAM capabilities.
Ideally we are looking for a BAM solution that is middleware/vendor agnostic.
The alternative to buying a BAM package is, of course, building a customized BAM solution, but I'd like to reserve that option as a last resort.
I'm interested in any experiences, positive or negative, you may have had using a commercial (or open source) BAM product. | 0 | [
2,
92,
1276,
12360,
21,
254,
508,
2358,
8984,
13,
5,
969,
79,
6,
5607,
60,
800,
3726,
3726,
95,
50,
699,
26,
21,
13568,
508,
2358,
8984,
6030,
17792,
511,
26,
14,
862,
13,
18,
5024,
17,
30,
92,
18399,
19531,
134,
29,
318,
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... |
C++ tr1 on GCC 3.4.4 (for the Nokia N810 tablet computer)
===
What does it take to get C++ **tr1** members (shared_ptr especially, but we'd like function and bind and ALL the others) working with **GCC 3.4.4** (for the Nokia **N810** tablet computer).
Has anyone done this? Attempted this?
It may **not** be feasible for us to upgrade to GCC 4.x to cross-compile for this device (but if you've done that, we'd love to know).
There may be many approaches, and I'd like to avoid dead ends others have hit.
Thank you!
| 0 | [
2,
272,
20512,
9235,
165,
27,
489,
3384,
203,
9,
300,
9,
300,
13,
5,
1106,
14,
24294,
13,
103,
20219,
16394,
1428,
6,
800,
3726,
3726,
98,
630,
32,
247,
20,
164,
272,
20512,
13,
1409,
6384,
165,
1409,
443,
13,
5,
16608,
43,
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... |
Forcing a ListView to draw in the background
===
I have a ListView which sometimes I need to put around 10000 items in. ListViews don't really handle this well, and they lock up for a couple of seconds while they sort the items and draw them. If you add the items in individually, it's even worse, locking up for nearly a minute.
To get around this, I thought I'd try populating the ListView before I need to display it, but unfortunately it has other ideas. It only starts drawing when I turn the panel that contains the ListView visible, making the program hang for a couple of seconds.
Any ideas for how I can eliminate this delay? Or is there another component that's relatively easy to use that is better at showing large quantities of data? | 0 | [
2,
6135,
21,
968,
4725,
20,
2003,
19,
14,
2395,
800,
3726,
3726,
31,
57,
21,
968,
4725,
56,
1030,
31,
376,
20,
442,
140,
332,
3993,
3755,
19,
9,
968,
4725,
18,
221,
22,
38,
510,
3053,
48,
134,
15,
17,
59,
3991,
71,
26,
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... |
Do I have to cause an ValueError in Python
===
I have this code:
chars = #some list
try:
indx = chars.index(chars)
except ValueError:
#doSomething
else:
#doSomethingElse
I want to be able to do this because I don't like knowfully causing Exceptions:
chars = #some list
indx = chars.index(chars)
if indx == -1:
#doSomething
else:
#doSomethingElse
Is there a way I can do this? | 0 | [
2,
107,
31,
57,
20,
1679,
40,
1923,
29992,
19,
20059,
800,
3726,
3726,
31,
57,
48,
1797,
45,
4892,
18,
800,
6926,
3220,
968,
1131,
45,
19,
43,
396,
800,
4892,
18,
9,
25671,
5,
5433,
18,
6,
1613,
1923,
29992,
45,
6926,
537,
909... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 apply a .net attribute to a return type
===
How do I apply the MarshalAsAttribute to the return type of the code below?
<pre>
public ISomething Foo()
{
return new MyFoo();
}
</pre> | 0 | [
2,
184,
107,
42,
5645,
21,
13,
9,
2328,
35,
14755,
20,
21,
788,
1001,
800,
3726,
3726,
184,
107,
31,
5645,
14,
7583,
8588,
38,
14755,
20,
14,
788,
1001,
16,
14,
1797,
1021,
60,
13,
1,
3515,
1,
317,
31,
9099,
4310,
111,
5,
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... |
EWOULDBLOCK equivalent errno under Windows Perl
===
G'day Stackoverflowers,
I'm the author of Perl's [autodie][1] pragma, which changes Perl's built-ins to throw exceptions on failure. It's similar to [Fatal][2], but with lexical scope, an extensible exception model, more intelligent return checking, and much, much nicer error messages. It will be replacing the `Fatal` module in future releases of Perl (provisionally 5.10.1+), but can currently be downloaded from the CPAN for Perl 5.8.0 and above.
The next release of `autodie` will add special handling for calls to `flock` with the `LOCK_NB` (non-blocking) option. While a failed `flock` call would normally result in an exception under `autodie`, a failed call to `flock` using `LOCK_NB` will merely return false if the returned errno (`$!`) is `EWOULDBLOCK`.
The reason for this is so people can continue to write code like:
use Fcntl qw(:flock);
use autodie; # All perl built-ins now succeed or die.
open(my $fh, '<', 'some_file.txt');
my $lock = flock($fh, LOCK_EX | LOCK_NB); # Lock the file if we can.
if ($lock) {
# Opportuntistically do something with the locked file.
}
In the above code, a lock that fails because someone else has the file locked already (`EWOULDBLOCK`) is not considered to be a hard error, so autodying `flock` merely returns a false value. In the situation that we're working with a filesystem that doesn't support file-locks, or a network filesystem and the network just died, then autodying `flock` generates an appropriate exception when it sees that our errno is not `EWOULDBLOCK`.
This works just fine in my dev version on Unix-flavoured systems, but it fails horribly under Windows. It appears that while Perl under Windows supports the `LOCK_NB` option, it doesn't define `EWOULDBLOCK`. Instead, the errno returned is 33 ("Domain error") when blocking would occur.
Obviously I can hard-code this as a constant into `autodie`, but that's not what I want to do here, because it means that I'm screwed if the errno ever changes (or has changed). I would love to compare it to the Windows equivalent of `POSIX::EWOULDBLOCK`, but I can't for the life of me find where such a thing would be defined. If you can help, let me know.
Answers I specifically don't want:
* Suggestions to hard-code it as a constant (or worse still, leave a magic number floating about).
* Not supporting `LOCK_NB` functionality at all under Windows.
* Assuming that any failure from a `LOCK_NB` call to `flock` should return merely false.
* Suggestions that I ask on p5p or [perlmonks][3]. I already know about them.
* An explanation of how `flock`, or exceptions, or `Fatal` work. I already know. Intimately.
Many thanks in advance,
Paul
[1]: http://search.cpan.org/perldoc?autodie
[2]: http://search.cpan.org/perldoc?Fatal
[3]: http://perlmonks.org/ | 0 | [
2,
13,
62,
8264,
12048,
4602,
13,
106,
139,
251,
131,
1936,
416,
255,
800,
3726,
3726,
489,
22,
1185,
7566,
2549,
11407,
18,
15,
31,
22,
79,
14,
1314,
16,
416,
255,
22,
18,
636,
18042,
3840,
500,
2558,
165,
500,
3865,
14336,
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... |
WSE 2.0 Web Services Client using .NET 2.0
===
What's the best way to access WSE 2.0 web services from .NET 2.0?
Using VS2005's web references is not working, because generated classes are using System.Web.Services as their base (instead of Microsoft.Web.Services2). | 0 | [
2,
619,
870,
172,
9,
387,
2741,
687,
6819,
568,
13,
9,
2328,
172,
9,
387,
800,
3726,
3726,
98,
22,
18,
14,
246,
161,
20,
1381,
619,
870,
172,
9,
387,
2741,
687,
37,
13,
9,
2328,
172,
9,
387,
60,
568,
4611,
2835,
22,
18,
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... |
Preventing Mongrel/Mysql Errno::EPIPE exceptions
===
I have a rails app that I have serving up XML on an infrequent basis.
This is being run with mongrel and mysql.
I've found that if I don't exercise the app for longer than a few hours it goes dead and starts throwing Errno::EPIPE errors. It seems that the mysql connection get timed out for inactivity or something like that.
It can be restarted with 'mongrel_rails restart -P /path/to/the/mongrel.pid' ... but that's not really a solution.
My collaborator expects the app to be there when he is working on his part (and I am most likely not around).
My question is:
- What can I do to prevent this problem from occurring in the 1st place? (e.g. don't time me out!!).
- Failing that, is there some code I can insert somewhere to automatically remake the Db connection?
| 0 | [
2,
11520,
21028,
7256,
118,
915,
18,
22402,
13,
106,
139,
251,
45,
45,
62,
15185,
13392,
800,
3726,
3726,
31,
57,
21,
2240,
18,
4865,
30,
31,
57,
1799,
71,
23504,
27,
40,
19,
22840,
2239,
9,
48,
25,
142,
485,
29,
21028,
7256,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
max time a report should take to generate report.
===
I am just curious to know how long(minutes) does a report should take to generate report when it returns 1MB of data. Maybe using views and table is properly index. SSRS reporting and server side generation. | 0 | [
2,
2049,
85,
21,
1330,
378,
247,
20,
7920,
1330,
9,
800,
3726,
3726,
31,
589,
114,
7686,
20,
143,
184,
175,
5,
5556,
18,
6,
630,
21,
1330,
378,
247,
20,
7920,
1330,
76,
32,
4815,
137,
5024,
16,
1054,
9,
913,
568,
4146,
17,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... |
Python Reporting
===
Are there any packages that provide to following:
1) Integration with python application with minimal dependencies (beyond existing depends we use such as wx and matplotlib)<br>
2) Visual design tool to make it easier for less technical users to design their own reports<br>
3) Able to work with MySQL and Oracle databases
The following are pluses but not necessary:
1) Web based software for serving reports, also scheduling delivery via multiple methods such as email<br>
2) Standards based, reports are not a proprietary binary file format<br>
3) Reports can be saved in multiple formats (pdf, html, etc)<br> | 0 | [
2,
20059,
6670,
800,
3726,
3726,
50,
80,
186,
16875,
30,
1181,
20,
249,
45,
137,
6,
8078,
29,
20059,
3010,
29,
8663,
29411,
13,
5,
27333,
3149,
9597,
95,
275,
145,
28,
619,
396,
17,
4277,
13221,
38,
8326,
6,
1,
5145,
1,
172,
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... |
Which browsers and operating systems do you target on new websites?
===
When you are working on a new website, what combinations of browsers and operating systems do you target, and at what priorities? Do you find targeting a few specific combinations (and ignoring the rest) better than trying to strive to make them all work as intended?
Common browsers I think about:
<ul>
<li>Firefox (1, 1.5, 2, 3)</li>
<li>Internet Explorer (6, 7, 8-beta)</li>
<li>Opera</li>
</ul>
Common operating systems:
<ul>
<li>Windows (XP, Vista)</li>
<li>Mac OSX</li>
<li>Linux</li>
<li>Unix</li>
</ul> | 0 | [
2,
56,
16495,
18,
17,
2455,
1242,
107,
42,
2935,
27,
78,
13931,
60,
800,
3726,
3726,
76,
42,
50,
638,
27,
21,
78,
2271,
15,
98,
17908,
16,
16495,
18,
17,
2455,
1242,
107,
42,
2935,
15,
17,
35,
98,
20872,
60,
107,
42,
477,
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... |
Delphi 7 make complains about files not found
===
I've got a BPG file that I've modified to use as a make file for our company's automated build server. In order to get it to work I had to change
<pre>
Uses * Uses
unit1 in 'unit1.pas' * unit1
unit2 in 'unit2.pas' * unit2
... * ...
</pre>
in the DPR file to get it to work without the compiler giving me some guff about unit1.pas not found.
This is annoying because I want to use a BPG file to actually see the stuff in my project and every time I add a new unit, it auto-jacks that in 'unitx.pas' into my DPR file.<p>
I'm running `make -f [then some options]`, the DPR's that I'm compiling are not in the same directory as the make file, but I'm not certain that this matters. Everything compiles fine as long as the `in 'unit1.pas` is removed. <p>
| 0 | [
2,
23030,
453,
233,
15310,
18,
88,
6488,
52,
216,
800,
3726,
3726,
31,
22,
195,
330,
21,
334,
9623,
3893,
30,
31,
22,
195,
5372,
20,
275,
28,
21,
233,
3893,
26,
318,
237,
22,
18,
14904,
1895,
8128,
9,
19,
389,
20,
164,
32,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should constructor variables pass direct to private fields or properties?
===
Now this is .NET but I am sure the principal should apply to all OOP language, to simplify I take .NET as an example:
R# usually creator constructor and passing incoming variable to private field, which for me mi tend to pass it to Property.
Any opinion on how the different and what is the best practice for that? | 0 | [
2,
378,
6960,
248,
12157,
1477,
1744,
20,
932,
2861,
54,
3704,
60,
800,
3726,
3726,
130,
48,
25,
13,
9,
2328,
47,
31,
589,
562,
14,
2279,
378,
5645,
20,
65,
13,
21709,
816,
15,
20,
28257,
31,
247,
13,
9,
2328,
28,
40,
823,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
HTTPHandler tag in Web.Config breaks asmx Files...
===
In my ASP.Net 1.1 application, i've added the following to my Web.Config (within the System.Web tag section):
<httpHandlers>
<add verb="*" path="*.bcn" type="Internet2008.Beacon.BeaconHandler, Internet2008" />
</httpHandlers>
This works fine, and the HTTPHandler kicks in for files of type .bcn, and does its thing.. however for some reason all ASMX files stop working. Any idea why this would be the case?
Cheers
Greg | 0 | [
2,
7775,
3203,
1252,
3383,
19,
2741,
9,
14093,
2816,
7947,
28,
79,
396,
6488,
9,
9,
9,
800,
3726,
3726,
19,
51,
28,
306,
9,
2328,
137,
9,
165,
3010,
15,
31,
22,
195,
905,
14,
249,
20,
51,
2741,
9,
14093,
2816,
13,
5,
1410,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What can cause ASPNET AJAX page to revert to normal ASPX mode ? / UpdatePanel broken
===
I am using VS 2008 with a very simple UpdatePanel scenario.
But i cannot get UpdatePanel to work and cant seem to find out why
I have in fact reverted to a very simple example to validate it is not my code:
http://ajax.net-tutorials.com/controls/updatepanel-control/
In this example I click on either button and both text links update.
I dont get any errors, the page just behaves like a normal ASPX page.
What things do i need to check. I've been googling this for an hour and not found what I need. | 0 | [
2,
98,
92,
1679,
28,
306,
2328,
20624,
2478,
20,
24156,
20,
1826,
28,
306,
396,
3740,
13,
60,
13,
118,
11100,
3206,
532,
2023,
800,
3726,
3726,
31,
589,
568,
4611,
570,
29,
21,
253,
1935,
11100,
3206,
532,
12705,
9,
47,
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 you get the state to which a (.net) form will be restored?
===
I have a windows application and I want to save the size, position and WindowState between sessions. There is one caveat however. If the state when closing is minimized then I want to restore to the last visible state, i.e. Normal if it was normal before being minimized or maximized if it was maximized.
Is there a property, check, call do do this?
| 0 | [
2,
184,
107,
42,
164,
14,
146,
20,
56,
21,
13,
5,
9,
2328,
6,
505,
129,
44,
4617,
60,
800,
3726,
3726,
31,
57,
21,
1936,
3010,
17,
31,
259,
20,
2079,
14,
1072,
15,
649,
17,
1463,
3859,
128,
5763,
9,
80,
25,
53,
3542,
721,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it expected that all the units of a Project Group in Delphi 7 to be in one folder?
===
Maybe this applied to other Delphi's (I've only used 7). We've got our code broken up so that nearly every DLL in our fairly massive app is in a different folder. <p>
99% of the open source stuff I've downloaded to plug into Delphi have had all their source munged into one folder. <p>
It seems like this was an assumption that the developers of Delphi made about the coding practices of it's users that may be non-obvious. | 0 | [
2,
25,
32,
1727,
30,
65,
14,
1398,
16,
21,
669,
214,
19,
23030,
453,
20,
44,
19,
53,
19294,
60,
800,
3726,
3726,
913,
48,
2435,
20,
89,
23030,
22,
18,
13,
5,
49,
22,
195,
104,
147,
453,
6,
9,
95,
22,
195,
330,
318,
1797,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Advanced searching in Vim
===
Is there a way to search for multiple strings simultaneously in Vim? I recall reading somewhere that it was possible but somehow forgot the technique.
So for example, I have a text file and I want to search for "foo" and "bar" simultaneously (not necessarily as a single string, can be in different lines altogether).
How do I achieve that?
Thank you | 0 | [
2,
2255,
5792,
19,
1790,
79,
800,
3726,
3726,
25,
80,
21,
161,
20,
2122,
26,
1886,
7887,
6888,
19,
1790,
79,
60,
31,
7111,
1876,
3493,
30,
32,
23,
938,
47,
3625,
9564,
14,
4873,
9,
86,
26,
823,
15,
31,
57,
21,
1854,
3893,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL Server Provisioning Tool
===
Running under Server 2008, SQL Server 2005 SP2 has the option to "Add New Administrator" from the SQL Server 2005 Surface Ara Configuration. This launches the SQL Server 2005 User Provisioning Tool for Vista. You are then able to grant privileges such as Server SysAdmin role etc.
When I do this the privileges are copied across and appear to be saved but when I return to this tool it is clear that they have not been saved. Anybody else experience this or know how to "make it stick" ? | 0 | [
2,
4444,
255,
8128,
8738,
68,
5607,
800,
3726,
3726,
946,
131,
8128,
570,
15,
4444,
255,
8128,
812,
3782,
135,
63,
14,
4255,
20,
13,
7,
14854,
78,
8890,
7,
37,
14,
4444,
255,
8128,
812,
1490,
12893,
8091,
9,
48,
22933,
14,
4444,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Books for Software Engineering
===
What would be a recommended book for Software Engineering? The book should be covering the various stages involved in software development process, covering topics such as:
- requirement gatherings
- use cases
- domain model
- functional specifications
- architecture design
- testing
- deployment
It should be a book that would help someone to understand the various processes, how to document use cases, domain modeling, architecture design etc., explain about how the various steps help in the development of the software. Not so much on the code writing, more on the documentation, design, planning prior to it.
| 4 | [
2,
5773,
964,
26,
2306,
1552,
800,
3726,
3726,
98,
83,
44,
21,
5773,
360,
26,
2306,
1552,
60,
14,
360,
378,
44,
3846,
14,
617,
4891,
1013,
19,
2306,
522,
953,
15,
3846,
7569,
145,
28,
45,
13,
8,
8981,
5822,
18,
13,
8,
275,
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... |
Linux/C++ programmer to C#/Windows programmer
===
I have been coding exclusively for a while now on Linux with C++. In my current job, it's a Windows shop with C# as main language. I've retrained myself to use Visual Studio instead of emacs ( main reason is the integrated debugger in VC, emacs mode in VC helps ), setup Cygwin ( since I cannot live without a shell ) and pickup the ropes of managed language. What tools, books, website ( besides MSDN ) or pitfalls do you think I should check to make myself a more efficient Windows/C# coder? | 0 | [
2,
13024,
118,
150,
20512,
17968,
20,
272,
5910,
118,
27508,
18,
17968,
800,
3726,
3726,
31,
57,
74,
13,
15458,
7008,
26,
21,
133,
130,
27,
13024,
29,
272,
20512,
9,
19,
51,
866,
1205,
15,
32,
22,
18,
21,
1936,
2546,
29,
272,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Intergrated Version Control for Visual Studio
===
What version control systems have you used to manage projects developed with Visual Studio (2005)? What would you recommend and Why? What limitations have you found with your top rated version control system? | 0 | [
2,
1480,
15125,
69,
615,
569,
26,
3458,
1120,
800,
3726,
3726,
98,
615,
569,
1242,
57,
42,
147,
20,
4705,
2314,
885,
29,
3458,
1120,
13,
5,
2835,
6,
60,
98,
83,
42,
12360,
17,
483,
60,
98,
14070,
57,
42,
216,
29,
154,
371,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I create an installer for a .Net website, Windows Service, and more???
===
I need to create an installer program that will do install the following:
1. ASP.Net Website
2. Windows Service
3. SQL Express if it isn't installed
and the user doesn't have a SQL
Server
4. Dundas Charts
5. ASP.Net AJAX v.1.0
6. ReportViewer control (for 2.0 Framework)
7. Check Framework prerequisites (2.0)
8. Configure IIS and app.config (data connection strings, etc.)
Is it realistic to be able to do this with a VS Setup Project? Or, should I be looking at other install tools? Any help is appreciated here, or a shove to some resources. I'm not finding much.
| 0 | [
2,
184,
107,
31,
1600,
40,
16146,
106,
26,
21,
13,
9,
2328,
2271,
15,
1936,
365,
15,
17,
91,
60,
60,
60,
800,
3726,
3726,
31,
376,
20,
1600,
40,
16146,
106,
625,
30,
129,
107,
16146,
14,
249,
45,
137,
9,
28,
306,
9,
2328,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way to do Version Control for MS Excel
===
What version control systems have you used with MS Excel (2003/2007)? What would you recommend and Why? What limitations have you found with your top rated version control system? | 0 | [
2,
246,
161,
20,
107,
615,
569,
26,
4235,
20700,
800,
3726,
3726,
98,
615,
569,
1242,
57,
42,
147,
29,
4235,
20700,
13,
5,
3325,
118,
2727,
6,
60,
98,
83,
42,
12360,
17,
483,
60,
98,
14070,
57,
42,
216,
29,
154,
371,
7675,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Standardize Error Classification & graceful Handling
===
(Couldn't find Q that covers my scope. If this is a dupe let me know where to go & I'll delete this question.)
I need to standardize on how I classify and handle errors/exceptions 'gracefully'.
I currently use a process by which I report the errors to a function passing an error-number, severity-code, location-info and extra-info-string. This function returns boolean true if the error is fatal and the app should die, false otherwise. As part of it's process, apart from visual-feedback to the user, the function also log-to-file errors of above some severity-level.
This seems to work, but it feels incomplete, not entirely 'graceful', doesn't allow for user-intervention e.g. '..that didn't work, let me try this..'-variety or something like that.
What would be a good standard way of generalizing this, that I can put in a library and re-use in all my apps?
| 0 | [
2,
1236,
2952,
7019,
4039,
279,
22609,
7988,
800,
3726,
3726,
13,
5,
13431,
103,
22,
38,
477,
2593,
30,
2937,
51,
9914,
9,
100,
48,
25,
21,
17938,
62,
408,
55,
143,
113,
20,
162,
279,
31,
22,
211,
27448,
48,
1301,
9,
6,
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... |
Restrict a string to whitelisted characters using XSLT 1.0
===
## Question ##
Using XSLT 1.0, given a string with arbitrary characters how can I get back a string that meets the following rules.
1. First character must be one of these: a-z, A-Z, colon, or underscore
1. All other characters must be any of those above or 0-9, period, or hyphen
1. If any character does not meet the above rules, replace it with an underscore
## Background ##
In an XSLT I'm translating some attributes into elements, but I need to be sure the attribute doesn't contain any values that can't be used in an element name. I don't care much about the integrity of the attribute being converted to the name as long as it's being converted predictably. I also don't need to compensate for *every* valid character in an element name (there's a bunch).
The problem I was having was with the attributes having spaces coming in, which the translate function can easily convert to underscores:
translate(@name,' ','_')
But soon after I found some of the attributes using slashes, so I have to add that now too. This will quickly get out of hand. I want to be able to define a whitelist of allowed characters, and replace any non-allowed characters with an underscore, but translate works as by replacing from a blacklist.
| 0 | [
2,
15436,
21,
3724,
20,
359,
11257,
1766,
568,
993,
18,
255,
38,
137,
9,
387,
800,
3726,
3726,
6926,
5910,
1301,
6926,
5910,
568,
993,
18,
255,
38,
137,
9,
387,
15,
504,
21,
3724,
29,
17237,
1766,
184,
92,
31,
164,
97,
21,
372... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 prefer to organize exception definitions?
===
I almost feel embarrassed to ask, but I always struggle with how to organize exception definitions. The three ways I've done this before are:
- Use the file-per-class rule. I'm not crazy about this because it either clutters up my directory structure and namespaces. I could organize them into subdirectories and segment namespaces for them, but I don't really like that, and that's not how the standard libraries usually do it.
- put the definitions in a file containing the related class(es). I don't really like this either because then exception definitions are scattered about and may be hard to find without the aid of a code navigation tool.
- One file with all the exception definitions for a namespace or "package" of related classes. This is kind of a compromise between the above two, but it may leave situations in which it's hard to tell which exceptions "belong" to a particular group of classes or set of functionality.
I don't really like any of the above, but is there a sort of best-practice that I haven't picked up on that would be better?
| 0 | [
2,
184,
107,
42,
6369,
20,
9213,
5391,
18544,
60,
800,
3726,
3726,
31,
557,
583,
10920,
20,
1349,
15,
47,
31,
550,
4697,
29,
184,
20,
9213,
5391,
18544,
9,
14,
132,
2847,
31,
22,
195,
677,
48,
115,
50,
45,
13,
8,
275,
14,
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 does "Cannot evaluate expression because the code of the current method is optimized." mean?
===
I wrote some code with a lot of recursion, that takes quite a bit of time to complete. Whenever I "pause" the run to look at what's going on I get:
>>Cannot evaluate expression because the code of the current method is optimized.
I think I understand what that means. However, what puzzles me is that after I hit step, the code is not "optimized" anymore, and I can look at my variables. How does this happen? How can the code flip back and forth between optimized and non-optimzed code? | 0 | [
2,
98,
630,
13,
7,
1245,
1270,
13,
15599,
1803,
185,
14,
1797,
16,
14,
866,
2109,
25,
22864,
43,
9,
7,
884,
60,
800,
3726,
3726,
31,
738,
109,
1797,
29,
21,
865,
16,
26604,
5991,
15,
30,
1384,
1450,
21,
1142,
16,
85,
20,
127... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 embed an "a:hover{...}" rule into a style attribute in the middle of a document?
===
I know that embedding CSS styles directly into the HTML tags they affect defeats much of the purpose of CSS, but sometimes it's useful for debugging purposes, as in:
<p style="font-size: 24px">asdf</p>
What's the syntax for embedding a rule like:
a:hover {text-decoration: underline;}
into the style attribute of an A tag? It's obviously not this...
<a href="foo" style="text-decoration: underline">bar</a>
...since that would apply all the time, as opposed to just during hover. | 0 | [
2,
184,
107,
31,
11911,
69,
40,
13,
7,
58,
45,
252,
2549,
1,
9,
9,
9,
1,
7,
1828,
77,
21,
1034,
35,
14755,
19,
14,
772,
16,
21,
4492,
60,
800,
3726,
3726,
31,
143,
30,
11911,
69,
3258,
272,
18,
18,
6443,
1703,
77,
14,
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 is the most esoteric thing you have ever done namespaces?
===
I am interested in unprecedented, cool, and esoteric ways to use namespaces. I know that many advanced developers "hack" namespaces by, for example, using them as references to string constants. In the string constants example, the idea is to implement DRY (DRY = Do Not Repeat Yourself) and you can keep all your strings in one file or the like.
My question is as follows: What is the most esoteric thing you have ever done with namespaces?
note: I am looking for answers related to the common languages like C#, Ruby, Perl, etc. | 0 | [
2,
98,
25,
14,
127,
27850,
584,
42,
57,
462,
677,
204,
5582,
18,
60,
800,
3726,
3726,
31,
589,
3158,
19,
18169,
15,
2700,
15,
17,
27850,
2847,
20,
275,
204,
5582,
18,
9,
31,
143,
30,
151,
2255,
10168,
13,
7,
22983,
7,
204,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to differentiate a HTTP Request submitted from a HTML form and a HTTP Request submitted from a client?
===
Is there any way (in Java Servlet) to determine whether a HTTP POST or GET request is a result from a submission from a HTML form or otherwise? | 0 | [
2,
184,
20,
22144,
21,
7775,
3772,
7368,
37,
21,
13,
15895,
505,
17,
21,
7775,
3772,
7368,
37,
21,
6819,
60,
800,
3726,
3726,
25,
80,
186,
161,
13,
5,
108,
8247,
13,
10321,
1336,
6,
20,
3746,
1472,
21,
7775,
678,
54,
164,
3772... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Vista and ProgramData
===
What is the right place to store program data files which are the same for every user but have to be writeable for the program? What would be the equivalent location on MS Windows XP? I have read that C:\ProgramData is not writeable after installation by normal users. Is that true? How can I retrieve that directory programmatically using the Platform SDK?
Many thanks in advance.
Best regards,
frast | 0 | [
2,
13520,
17,
625,
18768,
800,
3726,
3726,
98,
25,
14,
193,
209,
20,
1718,
625,
1054,
6488,
56,
50,
14,
205,
26,
352,
4155,
47,
57,
20,
44,
2757,
579,
26,
14,
625,
60,
98,
83,
44,
14,
4602,
1474,
27,
4235,
1936,
23045,
60,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I programmatically manipulate Windows desktop icon locations?
===
Several years back, I innocently tried to write a little app to save my tactically placed desktop icons because I was sick of dragging them back to their locations when some event reset them. I gave up after buring WAY too much time having failed to find a way to query, much less save and reset, my icons' desktop position.
Anyone know where Windows persists this info and if there's an API to set them?
Thanks,
Richard | 0 | [
2,
184,
92,
31,
625,
6732,
1326,
18468,
1936,
17404,
9801,
4095,
60,
800,
3726,
3726,
238,
122,
97,
15,
31,
5490,
102,
794,
20,
2757,
21,
265,
4865,
20,
2079,
51,
8418,
102,
1037,
17404,
9801,
18,
185,
31,
23,
3352,
16,
13052,
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... |
Is it possible to make an eclipse p2 provisionning mechanism running *locally* ?
===
Eclipse 3.4[.x] - also known as [Ganymede][1] - comes with this new mechanism of provisioning called **p2**.
"Provisioning" is the process allowing to discover and update on demand some parts of an application, as explained in general in this article on the [Sun Web site][2].
Eclipse has an extended [wiki section][3] in which p2 details are presented.
Specifically, it says in this wiki page that p2 will look for new components
However after reading it.
I suppose (but you may confirm that point by your own experience), that p2 can function file "file://" protocol, which would allow it to provision with **local** file (either on your computer or on an UNC path '\\server\path'), as [illustrated here][4], but also by the files:
- [eclipse-SDK-3.4-win32]\eclipse\configuration\\.settings\org.eclipse.equinox.p2.artifact.repository.prefs
- [eclipse-SDK-3.4-win32]\eclipse\configuration\\.settings\org.eclipse.equinox.p2.metadata.repository.prefs
p2 mechanism is used to update eclipse itself, through an [eclipse 3.4 update site][5], and reference in those '.prefs' files with line like:
repositories/file\:_C\:_jv_eclipse_eclipse-SDK-3.4-win32_eclipse/url=file\:/C\:/jv/eclipse/eclipse-SDK-3.4-win32/eclipse/
Now, how could I replicate the eclipse components present in that update site into a local directory and reference those components through the mentionned '.prefs' files, **in order to have an upgrade process entirely run locally**, without having to access the web ?
I suppose that some p2 metadata files present in the distant 'update site' need to be replicated and changed as well.
Do you have any thoughts/advices/tips on that ? (i.e. on how to discover and retrieve and update the complete structure needed for a full eclipse installation, in order to run that installation locally)
[1]: http://www.eclipse.org/downloads/packages/
[2]: http://developers.sun.com/mobility/midp/articles/ota
[3]: http://wiki.eclipse.org/Category:Equinox_p2
[4]: http://wiki.eclipse.org/Equinox_p2_PDE_Integration
[5]: http://download.eclipse.org/eclipse/updates/3.4 | 0 | [
2,
25,
32,
938,
20,
233,
40,
11652,
351,
135,
8738,
2981,
6534,
946,
1637,
15580,
102,
2483,
13,
60,
800,
3726,
3726,
11652,
203,
9,
300,
2558,
9,
396,
500,
13,
8,
67,
167,
28,
636,
2342,
93,
4688,
62,
500,
2558,
165,
500,
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... |
HttpHeaders in ASP.NET 1.1
===
How do I read the Response Headers that are being sent down in a page ? I want to be able to read the header values and modify some of them. This is for an ASP.NET 1.1 application but I would be curious to know if it can done in any version of ASP.NET. | 0 | [
2,
7775,
1743,
445,
19,
28,
306,
9,
2328,
137,
9,
165,
800,
3726,
3726,
184,
107,
31,
1302,
14,
1627,
157,
445,
30,
50,
142,
795,
125,
19,
21,
2478,
13,
60,
31,
259,
20,
44,
777,
20,
1302,
14,
157,
106,
4070,
17,
17579,
109,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Get CSIDL_LOCAL_APPDATA path for any user on Windows
===
Is there any Win32/MFC API to get the `CSIDL_LOCAL_APPDATA` for **any** user that I want (not only the currently logged on one)? Let's say I have a list of users in the form "domain\user" and I want to get a list of their paths - is that possible?
Thanks in advance! | 0 | [
2,
164,
13,
16166,
8643,
1,
15580,
1,
7753,
18768,
2013,
26,
186,
4155,
27,
1936,
800,
3726,
3726,
25,
80,
186,
628,
3125,
118,
79,
7061,
21,
2159,
20,
164,
14,
13,
1,
16166,
8643,
1,
15580,
1,
7753,
18768,
1,
26,
13,
1409,
60... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Common CRUD functions in PHP
===
Is there a simple way to write a common function for each of the CRUD (create, retreive, update, delete) operations in php WITHOUT using any framework. For example I wish to have a single create function that takes the table name and field names as parameters and inserts data into a mySQL database. Another requirement is that the function should be able to support joins i.e. it should be able to insert data into multiple tables if required.
I know that these tasks could be done by using a framework but because of various reasons - too lengthy to explain here - I cannot use them.
many thanks in advance.
Vinayak | 0 | [
2,
757,
11498,
43,
3719,
19,
13,
26120,
800,
3726,
3726,
25,
80,
21,
1935,
161,
20,
2757,
21,
757,
1990,
26,
206,
16,
14,
11498,
43,
13,
5,
6037,
1373,
15,
13,
6239,
99,
1284,
15,
11100,
15,
27448,
6,
1311,
19,
13,
26120,
366,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 unit test web page authorization using ASP.NET MVC?
===
Let's say you have a profile page that can only be accessed by the owner of that profile. This profile page is located at:
User/Profile/{userID}
Now, I imagine in order to prevent access to this page by other users, you could structure your UserController class's Profile function to check the current session's identity:
HttpContext.Current.User.Identity.Name
If the id matches the one in the url, then you proceed. Otherwise you redirect to some sort of error page.
My question is how do you unit test something like this? I'm guessing that you need to use some sort of dependency injection instead of the HttpContext in the controller to do the check on, but I am unclear what the best way to do that is. Any advice would be helpful. | 0 | [
2,
184,
107,
42,
1237,
1289,
2741,
2478,
22677,
568,
28,
306,
9,
2328,
307,
8990,
60,
800,
3726,
3726,
408,
22,
18,
395,
42,
57,
21,
5296,
2478,
30,
92,
104,
44,
12904,
34,
14,
2410,
16,
30,
5296,
9,
48,
5296,
2478,
25,
335,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 change the maximum Upload File Size for the Document Manager in a Telerik RAD Controls RADEditor/WYSIWYG control?
===
I'm using the Telerik RAD Controls RADEditor/WYSIWYG control as part of a Dynamic Data solution.
I would like to be able to upload files using the Document Manager of this control.
However, these files are larger than whatever the default setting is for maximum upload file size.
Can anyone point me in the right direction to fix this? | 0 | [
2,
184,
107,
31,
753,
14,
2979,
71,
8294,
3893,
1072,
26,
14,
4492,
1382,
19,
21,
4338,
6639,
4944,
8671,
4944,
13401,
118,
7913,
18,
49,
7913,
263,
569,
60,
800,
3726,
3726,
31,
22,
79,
568,
14,
4338,
6639,
4944,
8671,
4944,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a way to embed a web control in a Windows application that renders using anything but Trident (IE)?
===
I have heard mention that some desktop applications are pretty much just wrappers for websites now.
I have even had the occasional problem that has been best solved this way in the past and I can see it being really useful for current applications development.
However, one problem I always seemed to run into was that the Web Site display controls in Visual Studio use the [Trident (Internet Explorer)][1] rendering engine. This tended to be IE6 rendering, but I'm not sure if newer machines in turn use IE7 rendering.
Is there any easy way to use say [Gecko (Firefox)][2] or even [Webkit (Safari/Chrome)][3] for rendering?
Ultimately I would like to be able to easily plug in this dependency and in turn have a (mostly) compliant framework to develop with and to in turn have consistent rendering for all users.
Please mention if there are any licensing concerns.
Also feel free to ridicule me as I know what I'm asking kind of seems like asking for a "just plug in" internet browser :)
[1]: http://en.wikipedia.org/wiki/Trident_(layout_engine)
[2]: http://en.wikipedia.org/wiki/Gecko_(layout_engine)
[3]: http://en.wikipedia.org/wiki/WebKit | 0 | [
2,
25,
80,
21,
161,
20,
11911,
69,
21,
2741,
569,
19,
21,
1936,
3010,
30,
16535,
18,
568,
602,
47,
26084,
13,
5,
660,
6,
60,
800,
3726,
3726,
31,
57,
752,
3794,
30,
109,
17404,
3767,
50,
1772,
212,
114,
28051,
18,
26,
13931,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 creating a collection via WebDAV should the name of the collection end with a slash
===
A WebDAV library I'm using is issuing this request
<pre>
MKCOL /collection HTTP/1.1
</pre>
To which apache is issuing a 301 because /collection exists
<pre>
HTTP/1.1 301
Location: /collection/
</pre>
Rather than a
<pre>
HTTP/1.1 405 Method Not Allowed
</pre>
The spec is a bit vague on this (or it could be my reading of it), but when issuing an MKCOL, should the name of your collection always end with a slash (as it is a collection) ? | 0 | [
2,
76,
2936,
21,
1206,
1197,
2741,
43,
5214,
378,
14,
204,
16,
14,
1206,
241,
29,
21,
14098,
800,
3726,
3726,
21,
2741,
43,
5214,
1248,
31,
22,
79,
568,
25,
17502,
48,
3772,
13,
1,
3515,
1,
10804,
7771,
13,
118,
15015,
872,
77... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
what's the best implemention of client creatable and modifiable web forms in a relational database?
===
In several web application projects I've been a part of, the client asks to be able to create their own forms. The question arises on how to store their form definitions, and then how to store user inputted values into those custom forms.
I've seen it done two ways:
1. Assuming that the client only defines how many fields, and what labels are associated with those fields; we can come to a solution involving four tables. **`FormDefinition`**, **`FormFieldDefinition`**, **`FormInstances`**, **`FormFieldValues`**. The client makes changes to `FormDefinition` and `FormFieldDefinition`, and the web app uses that information to render an HTML web form, on which the website visitor (end user) will submit the form, in which a new row in `FormInstances` is created and the values are saved in the `FormFieldValues` table.
>Rows in **`FormDefinition`** defines the form, i.e. `form definition ID = 2, form title = 'Car Registration Form'`. Rows in **`FormFieldDefinition`** defines fields of a form in `FormDefinition`, i.e. `field definition ID = 7, field label = 'Car Model', field type = 'varchar(50)'`. Rows in **`FormInstance`** is an instance of each form filled out by a user, i.e. `definition id = 2, date_entered = '2008-09-24'`. And rows in **`FormFieldValues`** are entries by the user, i.e. `field definition = 7, value = 'Tiburon'`.
Unfortunately, it means the value column in `FormFieldValues` must be a char type of the largest possible size that your client might specify in a web form... and when form definitions change, managing old data becomes iffy. But user entries are queryable (i wrote a [quick query][1] that lists user entries given a form id, which is similar to [another pivot question][2]).
1. An alternative to using four tables would be to serialize the form definitions and user's form entries into XML (or YAML or something similar) and store that as text. The upside is that the forms are human readable in the database. The downside is that there will be more application overhead with parsing XML, and the database becomes much less queryable from an SQL standpoint.
My real question is, what is this database model called? (So I can google this problem.) But I would settle on an answer to: which is the better implementation or are there better (or just as good) implementations out there?
[1]: http://pastie.org/pastes/275090
[2]: http://stackoverflow.com/questions/24470/sql-server-pivot-examples | 0 | [
2,
98,
22,
18,
14,
246,
8713,
872,
16,
6819,
13,
14946,
5924,
17,
7226,
25372,
2741,
1997,
19,
21,
5827,
192,
6018,
60,
800,
3726,
3726,
19,
238,
2741,
3010,
2314,
31,
22,
195,
74,
21,
141,
16,
15,
14,
6819,
3913,
20,
44,
777,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Identifying references to Java classes using Perl
===
I'm writing a perl script and I've come to a point where I need to parse a Java source file line by line checking for references to a fully qualified Java class name. I know the class I'm looking for up front; also the fully qualified name of the source file that is being searched (based on its path).
For example find all valid references to foo.bar.Baz inside the com/bob/is/YourUncle.java file.
At this moment the cases I can think of that it needs to account for are:
1. The file being parsed is in the same package as the search class.
find foo.bar.Baz references in foo/bar/Boing.java
2. It should ignore comments.
// this is a comment saying this method returns a foo.bar.Baz or Baz instance
// it shouldn't count
/* a multiline comment as well
this shouldn't count
if I put foo.bar.Baz or Baz in here either */
3. In-line fully qualified references.
foo.bar.Baz fb = new foo.bar.Baz();
4. References based off an import statement.
import foo.bar.Baz;
...
Baz b = new Baz();
What would be the most efficient way to do this in perl 5.8? Some fancy regex perhaps?
open F, $File::Find::name or die;
# these three things are already known
# $classToFind looking for references of this class
# $pkgToFind the package of the class you're finding references of
# $currentPkg package name of the file being parsed
while(<F>){
# ... do work here
}
close F;
# the results are availble here in some form | 0 | [
2,
13785,
7231,
20,
8247,
2684,
568,
416,
255,
800,
3726,
3726,
31,
22,
79,
1174,
21,
416,
255,
3884,
17,
31,
22,
195,
340,
20,
21,
454,
113,
31,
376,
20,
2017,
870,
21,
8247,
1267,
3893,
293,
34,
293,
9886,
26,
7231,
20,
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... |
I can't include a version number in this old Delphi project I inherited. How do I fix it?
===
I have an old Delphi codebase I have to maintain, lots of DLLs, some older than others. In some of these DLLs there is no version information in the Project Options dialog. The controls for adding a version are greyed out and I can't even add a version number by manually editing the .DOF file. How can I include a version number in these projects? | 0 | [
2,
31,
92,
22,
38,
468,
21,
615,
234,
19,
48,
315,
23030,
669,
31,
7179,
9,
184,
107,
31,
6098,
32,
60,
800,
3726,
3726,
31,
57,
40,
315,
23030,
1797,
8436,
31,
57,
20,
4027,
15,
7503,
16,
13,
43,
211,
18,
15,
109,
1234,
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... |
Simple serial AVR programmer for beginner
===
What is the cheap and good way to make a serial (RS232) programmer for AVR atMega and atTiny? There are several circuits in the Internet, but which one is better?
I'd like to be able to program my controller from Linux and Windows using some standard tools. | 0 | [
2,
1935,
5956,
21,
6938,
17968,
26,
26931,
800,
3726,
3726,
98,
25,
14,
9148,
17,
254,
161,
20,
233,
21,
5956,
13,
5,
1224,
20730,
6,
17968,
26,
21,
6938,
35,
22168,
17,
35,
2864,
93,
60,
80,
50,
238,
17711,
19,
14,
2620,
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... |
unsigned int vs. size_t
===
I notice that modern C and C++ code seems to use `size_t` instead of `int`/`unsigned int` pretty much everywhere - from parameters for C string functions to the STL. I am curious as to the reason for this and the benefits it brings. | 0 | [
2,
28839,
19,
38,
4611,
9,
1072,
1,
38,
800,
3726,
3726,
31,
3551,
30,
773,
272,
17,
272,
20512,
1797,
2206,
20,
275,
13,
1,
10454,
1,
38,
1,
700,
16,
13,
1,
6391,
1,
118,
1,
1020,
13472,
19,
38,
1,
1772,
212,
6417,
13,
8,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL Command
===
What is the SQL command to copy a table from one database to another database?
Sorry if the question is too novice.
Thanks. | 0 | [
2,
4444,
255,
1202,
800,
3726,
3726,
98,
25,
14,
4444,
255,
1202,
20,
4344,
21,
859,
37,
53,
6018,
20,
226,
6018,
60,
1875,
100,
14,
1301,
25,
266,
21999,
9,
3669,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Mocking classes that aren't interfaces
===
I've been writing some providers in c# that inherit from the providerbase class. I've found that it's hard to write tests that use the providers as most mocking frameworks will only allow you to mock an interface.
Is there any way to mock a call to a provider that inherits from providerbase?
If not, is there a pattern that I can use to implement mocking of providers? | 0 | [
2,
18446,
2684,
30,
4847,
22,
38,
6573,
18,
800,
3726,
3726,
31,
22,
195,
74,
1174,
109,
13488,
19,
272,
5910,
30,
17569,
37,
14,
11747,
8436,
718,
9,
31,
22,
195,
216,
30,
32,
22,
18,
552,
20,
2757,
4894,
30,
275,
14,
13488,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 does string.unpack work in Ruby?
===
Can someone explain why how the result for the following unpack is computed?
"aaa".unpack('h2H2') #=> ["16", "61"]
In binary, 'a' = 0110 0001. I'm not sure how the 'h2' can become 16 (0001 0000) or 'H2' can become 61 (0011 1101). | 0 | [
2,
184,
630,
3724,
9,
1020,
8573,
170,
19,
10811,
60,
800,
3726,
3726,
92,
737,
3271,
483,
184,
14,
829,
26,
14,
249,
367,
8573,
25,
26331,
60,
13,
7,
22160,
7,
9,
1020,
8573,
5,
22,
252,
135,
252,
135,
22,
6,
6926,
3726,
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... |
JSP pagination without retrieving the whole result set?
===
<p>I need to display the log entries from a database.
Of course the log data is huge, so I have to show the results on several pages, and that **without** getting **all** the log data at once, but as the user navigates through the pages.</p>
<p>I know about [DisplayTag][1] and [TableTags][2], but it seems to me that they both fetch all the data before applying pagination.</p>
<p>Before I start developing my own JSP tag, does anyone know of a 3rd party solution for this problem?</p>
<p>Thanks,<br>Marius</p>
[1]: http://displaytag.sourceforge.net/11/
[2]: http://code.google.com/p/tabletags/ | 0 | [
2,
487,
3401,
19006,
108,
857,
366,
13,
6239,
3272,
8397,
14,
979,
829,
309,
60,
800,
3726,
3726,
13,
1,
306,
1,
49,
376,
20,
3042,
14,
6738,
11399,
37,
21,
6018,
9,
16,
674,
14,
6738,
1054,
25,
2329,
15,
86,
31,
57,
20,
298... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are their naming conventions for ASP.NET web application directory structures?
===
Currently I am developing a site with about seven partial classes, a few icons, three pages and an App_Themes folder. I was interested to know, is there an industry standard directory structure for anything larger than a small project?
For example, I want to keep the classes in separate folders, the images in separate folders etc. My current directory structure is as follows (not exact, this is from memory):
- (root) contains the codebehind and forms
- /App_Data
- /App_Themes
- /Bin
- /Images
- /Models - I stole the name from MVC. It sounded more appropriate then 'classes'
- /FusionCharts - a flash charting library
I briefly played with MVC, and it looked like a nice directory structure, however, I am using ASP.NET Ajax.
So, I guess the question is, is there a way to make this directory structure more orderly in your own opinion? Please give answers as to why you made your decision also :). | 0 | [
2,
50,
66,
10929,
15117,
26,
28,
306,
9,
2328,
2741,
3010,
16755,
3815,
60,
800,
3726,
3726,
871,
31,
589,
3561,
21,
689,
29,
88,
810,
7284,
2684,
15,
21,
310,
9801,
18,
15,
132,
4434,
17,
40,
4865,
1,
124,
3845,
19294,
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... |
Algorithm for implementing iterators
===
I'd love to figure it out myself but I was wondering **roughly what's the algorithm for converting a function with yield statements into a state machine for an enumerator?** For example how does C# turn this:
IEnumerator<string> strings(IEnumerable<string> args)
{ IEnumerator<string> enumerator2 = getAnotherEnumerator();
foreach(var arg in arg)
{ enumerator2.MoveNext();
yield return arg+enumerator.Current;
}
}
into this:
bool MoveNext()
{ switch (this.state)
{
case 0:
this.state = -1;
this.enumerator2 = getAnotherEnumerator();
this.argsEnumerator = this.args.GetEnumerator();
this.state = 1;
while (this.argsEnumerator.MoveNext())
{
this.arg = this.argsEnumerator.Current;
this.enumerator2.MoveNext();
this.current = this.arg + this.enumerator2.Current;
this.state = 2;
return true;
state1:
this.state = 1;
}
this.state = -1;
if (this.argsEnumerator != null) this.argsEnumerator.Dispose();
break;
case 2:
goto state1;
}
return false;
}
Of course the result can be completely different depending on the original code.
| 0 | [
2,
9083,
26,
17333,
32,
106,
9922,
800,
3726,
3726,
31,
22,
43,
339,
20,
1465,
32,
70,
992,
47,
31,
23,
5712,
13,
1409,
19899,
102,
98,
22,
18,
14,
9083,
26,
19583,
21,
1990,
29,
11537,
9015,
77,
21,
146,
1940,
26,
40,
26940,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 possible reasons for java.io.IOException: "The filename, directory name, or volume label syntax is incorrect"
===
I am trying to copy a file using the following code:
File targetFile = new File(targetPath + File.separator + filename);
...
targetFile.createNewFile();
fileInputStream = new FileInputStream(fileToCopy);
fileOutputStream = new FileOutputStream(targetFile);
byte[] buffer = new byte[64*1024];
int i = 0;
while((i = fileInputStream.read(buffer)) != -1) {
fileOutputStream.write(buffer, 0, i);
}
For some users the <code>targetFile.createNewFile</code> results in this exception:
java.io.IOException: The filename, directory name, or volume label syntax is incorrect
at java.io.WinNTFileSystem.createFileExclusively(Native Method)
at java.io.File.createNewFile(File.java:850)
Filename and directory name seem to be correct. The directory <code>targetPath</code> is even checked for existence before the copy code is executed and the filename looks like this: <code>AB_timestamp.xml</code>
The user has write permissions to the <code>targetPath</code> and can copy the file without problems using the OS.
As I don't have access to a machine this happens on yet and can't reproduce the problem on my own machine I turn to you for hints on the reason for this exception.
| 0 | [
2,
98,
50,
938,
2932,
26,
8247,
9,
1963,
9,
1963,
10066,
872,
45,
13,
7,
124,
3893,
7259,
15,
16755,
204,
15,
54,
2310,
1899,
22649,
25,
18867,
7,
800,
3726,
3726,
31,
589,
749,
20,
4344,
21,
3893,
568,
14,
249,
1797,
45,
3893... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the security concerns of evaluating user code in PHP?
===
I am wondering what security concerns there are to implementing a PHP evaluator like this:
<?php eval($_POST['codeInput']); %>
| 0 | [
2,
98,
50,
14,
1221,
4823,
16,
26764,
4155,
1797,
19,
13,
26120,
60,
800,
3726,
3726,
31,
589,
5712,
98,
1221,
4823,
80,
50,
20,
17333,
21,
13,
26120,
6805,
2377,
3457,
101,
48,
45,
13,
1,
60,
26120,
13,
62,
3377,
5,
4403,
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,
0,
0,
0,
0... |
Recommendations for a good C#/ .NET based lexical analyser
===
Can anyone recommend a good .NET based lexical analyser, preferably written in C#? | 0 | [
2,
12121,
26,
21,
254,
272,
5910,
118,
13,
9,
2328,
432,
29180,
13,
21702,
139,
800,
3726,
3726,
92,
1276,
12360,
21,
254,
13,
9,
2328,
432,
29180,
13,
21702,
139,
15,
6369,
4801,
642,
19,
272,
5910,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Why do my hot-deployed files disappear sometimes? (I think Apache has something to do with it)
===
Here's my situation:
- Windows Server
- Apache
- CruiseControl
The last step of my CruiseControl deploy scripts copies the build to Apache's htdocs folder, in a "demos" folder (I believe this is referred to as a "hot deploy"?)
All is good and dandy, except that SOMETIMES (not common, but it happens enough that it bugs me), the demos folder doesn't contain the files I built! The old one is gone and the new one isn't there, just vanished.
My gut feeling is that if I try to overwrite a file while someone on the web is downloading it, Apache just deletes it after the download? I don't know, it doesn't make any sense.
I looked everywhere and couldn't find even a hint...let's see how good this StackOverflow community really is! :) | 0 | [
2,
483,
107,
51,
1047,
8,
17309,
10892,
69,
6488,
10866,
1030,
60,
13,
5,
49,
277,
17140,
63,
301,
20,
107,
29,
32,
6,
800,
3726,
3726,
235,
22,
18,
51,
1858,
45,
13,
8,
1936,
8128,
13,
8,
17140,
13,
8,
6581,
12898,
14,
236,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 program in Visual Studio lets me look into DLLs to see its API?
===
See the question. I want to see the methods and classes offered by a DLLs library. | 0 | [
2,
56,
625,
19,
3458,
1120,
6884,
55,
361,
77,
13,
43,
211,
18,
20,
196,
82,
21,
2159,
60,
800,
3726,
3726,
196,
14,
1301,
9,
31,
259,
20,
196,
14,
3195,
17,
2684,
1434,
34,
21,
13,
43,
211,
18,
1248,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I get a list of all subdomains of a domain?
===
I want to find out all the subdomains of a given domain. I found a hint which tells me to dig the authoritative Nameserver with the following option:
dig @ns1.foo.bar some_domain.com axfr
But this never works. Has anyone a better idea/approach
| 2 | [
2,
184,
107,
31,
164,
21,
968,
16,
65,
972,
537,
6232,
18,
16,
21,
4603,
60,
800,
3726,
3726,
31,
259,
20,
477,
70,
65,
14,
972,
537,
6232,
18,
16,
21,
504,
4603,
9,
31,
216,
21,
6382,
56,
2609,
55,
20,
6131,
14,
25368,
20... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you treat the deployment of configuration files on different systems in Subversion?
===
Subversion is a great way to update our web applications on our servers. With a simple `svn update` all changed files get... well, changed.
Except for the omnipresent configuration files such as `config.php` which hold the database access configuration, server paths etc. And are therefore different on my local development system and the remote server.
With the `update` command, a file modified on the server won't get overwritten, but if I change the file locally and commit it, the server gets the wrong configuration file.
But I don't want to set the `svn:ignore` property either, since the config file belongs to the project.
Is there a Subversion-mechanism which will allow me to easily handle these kind of files? Or is the only way to solve this problem to make a system switch within the config file which will determine the executing system and sets the configuration accordingly? | 0 | [
2,
184,
107,
42,
5752,
14,
10475,
16,
8091,
6488,
27,
421,
1242,
19,
972,
10898,
60,
800,
3726,
3726,
972,
10898,
25,
21,
374,
161,
20,
11100,
318,
2741,
3767,
27,
318,
17595,
9,
29,
21,
1935,
13,
1,
18,
16578,
11100,
1,
65,
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... |
Deployment of custom content type, forms, cqwp, and xsl.
===
Right now I have a visual studio project which contains a custom content type that I made. It also contains all the necessary files for making a sharepoint solution (wsp) file and a script to generate this.
Now, I would like to do 2 things.
First, I'd like to create a custom display form for the content type and include it in my solution so that it is automatically deployed when I deploy my solution. How do I include this in my solution and make my content type use it?
Secondly, you can query this type with the CQWP. I've thought about exporting it, adding more common view fields, and then modifying the XSL that is used to render it. How do I include this into my solution so that it is also deployed. I know i can export the CQWP webpart once it's all setup and include it in my project as a feature. But what abuot the XSL?
Looking forward to see your suggestions, cheers. | 0 | [
2,
10475,
16,
5816,
2331,
1001,
15,
1997,
15,
13,
21980,
13790,
15,
17,
993,
18,
255,
9,
800,
3726,
3726,
193,
130,
31,
57,
21,
3458,
1120,
669,
56,
1588,
21,
5816,
2331,
1001,
30,
31,
117,
9,
32,
67,
1588,
65,
14,
2378,
6488,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Send To/Mail Recipient from WSH
===
I am trying to implement function of windows Send To/Mail Recipient context menu option in windows scripting host. Did not find anything usefull on google except steps to instantiate `Outlook.Application` and directly calling its methods.
I need to go the same path as windows do, as there is a mix of Outlook and Lotus Notes installed, I don't see it good to perform some sort of testing and deciding which object to talk to...
What I have found is that the actual work is done by `sendmail.dll`, there is a handler defined in registry under `HKEY_CLASSES_ROOT\CLSID\{9E56BE60-C50F-11CF-9A2C-00A0C90A90CE}`.
Thanks for your input. | 0 | [
2,
2660,
20,
118,
8079,
7340,
37,
619,
1635,
800,
3726,
3726,
31,
589,
749,
20,
8713,
1990,
16,
1936,
2660,
20,
118,
8079,
7340,
4141,
11379,
4255,
19,
1936,
3884,
68,
2015,
9,
144,
52,
477,
602,
4811,
255,
27,
8144,
1613,
2382,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Email in C++?
===
How can I send an email from C++? Is there a good cross-platform (MS Windows, Linux etc) library that I can use? I'm using GCC (cygwin on MS Windows).
| 0 | [
2,
8517,
19,
272,
20512,
60,
800,
3726,
3726,
184,
92,
31,
2660,
40,
8517,
37,
272,
20512,
60,
25,
80,
21,
254,
919,
8,
27035,
13,
5,
79,
18,
1936,
15,
13024,
2722,
6,
1248,
30,
31,
92,
275,
60,
31,
22,
79,
568,
489,
3384,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Servlet for serving static content
===
I deploy a webapp on two different containers (Tomcat and Jetty), but their default servlets for serving the static content have a different way of handling the URL structure I want to use ([details][1]).
I am therefore looking to include a small servlet in the webapp to serve its own static content (images, CSS, etc.). The servlet should have the following properties:
- No external dependencies
- Simple and reliable
- Support for [`If-Modified-Since`][2] header (i.e. custom [`getLastModified`][3] method)
- (Optional) support for gzip encoding, etags,...
Is such a servlet available somewhere? The closest I can find is [example 4-10][4] from the servlet book.
[1]: http://issues.apache.org/bugzilla/show_bug.cgi?id=42411
[2]: http://www.freesoft.org/CIE/RFC/1945/58.htm
[3]: http://java.sun.com/j2ee/1.4/docs/api/javax/servlet/http/HttpServlet.html#getLastModified(javax.servlet.http.HttpServletRequest)
[4]: http://www.unix.org.ua/orelly/java-ent/servlet/ch04_04.htm#ch04-35758 | 0 | [
2,
13,
10321,
1336,
26,
1799,
12038,
2331,
800,
3726,
3726,
31,
17617,
21,
2741,
7753,
27,
81,
421,
18988,
13,
5,
6015,
5782,
17,
17341,
93,
6,
15,
47,
66,
12838,
13,
10321,
11045,
26,
1799,
14,
12038,
2331,
57,
21,
421,
161,
16... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best PHP MVC framework for scalability?
===
There are a lot of MVC frameworks for PHP. **Which one is the best in terms of scalability?** Is there any framework that supports splitting applications on many front end and database servers? Sharding? Other enterprise features?
Ideally the framework should support sites with thousands of concurrent users per server.
I would greatly appreciate if you could specify if your opinion comes from experience and what level of scale was supported by the system. | 4 | [
2,
98,
25,
14,
246,
13,
26120,
307,
8990,
6596,
26,
18957,
4091,
60,
800,
3726,
3726,
80,
50,
21,
865,
16,
307,
8990,
6596,
18,
26,
13,
26120,
9,
13,
1409,
2140,
53,
25,
14,
246,
19,
1663,
16,
18957,
4091,
60,
1409,
25,
80,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 stack trace from a running Python application
===
I have this Python application that gets stuck from time to time and I can't find out where.
Is there any way to signal Python interpreter to show you the exact code that he's running (somekind of stacktrace on-the-fly)?
| 0 | [
2,
1017,
7566,
5565,
37,
21,
946,
20059,
3010,
800,
3726,
3726,
31,
57,
48,
20059,
3010,
30,
3049,
4549,
37,
85,
20,
85,
17,
31,
92,
22,
38,
477,
70,
113,
9,
25,
80,
186,
161,
20,
2800,
20059,
19336,
20,
298,
42,
14,
5340,
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 check that I removed required data only?
===
I have a really big database (running on PostgreSQL) containing a lot of tables with sophisticated relations between them (foreign keys, on delete cascade and so on).
I need remove some data from a number of tables, but I'm not sure what amount of data will be really deleted from database due to cascade removals.
How can I check that I'll not delete data that should not be deleted?
I have a test database - just a copy of real one where I can do what I want :)
The only idea I have is dump database before and after and check it. But it not looks comfortable.
Another idea - dump part of database, that, as I think, should not be affected by my DELETE statements and check this part before and after data removal. But I see no simple ways to do it (there are hundreds of tables and removal should work with ~10 of them). Is there some way to do it?
Any other ideas how to solve the problem?
| 0 | [
2,
184,
107,
31,
2631,
30,
31,
1974,
1390,
1054,
104,
60,
800,
3726,
3726,
31,
57,
21,
510,
580,
6018,
13,
5,
11325,
27,
678,
6879,
18,
22402,
6,
3503,
21,
865,
16,
7484,
29,
13388,
2649,
128,
105,
13,
5,
28292,
5534,
15,
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... |
What are you favourite Matlab/Octave programming tricks?
===
I think everyone would agree that the matlab language is not pretty, or particularly consistent. But nevermind! We still have to use it to get things done.
What are your favourite tricks for making things easier? Lets have one per answer so people can vote them up if they agree. Also, try to illustrate your answer with an example. | 4 | [
2,
98,
50,
42,
7740,
4277,
9086,
118,
20303,
195,
3143,
13747,
60,
800,
3726,
3726,
31,
277,
1266,
83,
4524,
30,
14,
4277,
9086,
816,
25,
52,
1772,
15,
54,
1653,
8224,
9,
47,
243,
15918,
187,
95,
174,
57,
20,
275,
32,
20,
164,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to Google for --depend?
===
The latest makefiles we've received from a third party vendor contain rules with --depend on the end of build rules, so I thought I would look it up on Google, but try as I might, I can't persuade it to display any pages with exactly the characters --depend
I've tried surrounding it with quotes "--depend": I've tried the Advanced Search: I've tried backslashes "\\-\\-depend" in the (vain) hope that there is some sort of unpublished regular expression search available.
Am I missing something blindingly obvious?
Please note that this is NOT a question about what --depend does, I know that, it's a question about how you Google for very precise, programmer orientated, text. | 0 | [
2,
184,
20,
8144,
26,
13,
8,
8,
19038,
60,
800,
3726,
3726,
14,
5736,
233,
16877,
18,
95,
22,
195,
420,
37,
21,
422,
346,
23510,
3717,
1761,
29,
13,
8,
8,
19038,
27,
14,
241,
16,
1895,
1761,
15,
86,
31,
289,
31,
83,
361,
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... |
Heisenbug: WinApi program crashes on some computers
===
Please help! I'm really at my wits' end.
My program is a little personal notes manager (google for "cintanotes").
On some computers (and of course I own none of them) it crashes with an unhandled exception.
Nothing special about these computers could be said, except that they tend to have AMD CPUs.
Environment: Windows XP, Visual C++ 2005/2008, raw WinApi.
Here is what is certain about this "Heisenbug":
1) The crash happens only in the Release version.
2) The crash goes away as soon as I remove all GDI-related stuff.
3) BoundChecker has no complains.
4) Writig a log shows that the crash happens on a declaration of a local int variable! How could that be? Memory corruption?
Any ideas would be greatly appreciated!
| 0 | [
2,
24,
49,
1264,
16254,
45,
628,
2552,
49,
625,
21563,
27,
109,
7774,
800,
3726,
3726,
2247,
448,
187,
31,
22,
79,
510,
35,
51,
9642,
18,
22,
241,
9,
51,
625,
25,
21,
265,
1319,
2434,
1382,
13,
5,
16111,
4875,
26,
13,
7,
448... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.