unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
How to automate the test running process using TestComplete?
===
We are trying to integrate tests in our daily builds using TestComplete, so far we have a machine dedicated for testing and our build script copies to this machine everything TestComplete needs for its tests (Application, Database, Test script project and source files, etc).
Basically we can open the TestComplete project manually and run the tests.
Now we want to automate that process, so how do you do it? Or how do you think would be the simplest and best way to make this automation?
Keeping it short, we want to automate the process of opening TestComplete, running all the tests and sending an email with the test results.
Anyone can share some experience about this?
Thanks. | 0 | [
2,
184,
20,
3108,
5281,
14,
1289,
946,
953,
568,
1289,
15990,
60,
800,
3726,
3726,
95,
50,
749,
20,
18399,
4894,
19,
318,
1954,
1895,
18,
568,
1289,
15990,
15,
86,
463,
95,
57,
21,
1940,
2360,
26,
4431,
17,
318,
1895,
3884,
3298... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 extents of the meaning of "distributing" under the LGPL license?
===
This question is a follow up on one of my other questions, [Can I legally Incorporating GPL & LGPL, open-sourced software in a proprietary, closed-source project?][1]
Many of the conditions of the [LGPL license][2] are based on the notion of distribution. My company does business as a consultant. We are contracted to create software, which we deliver to our clients. Does this constitute distribution under the LGPL license?
We have also made available the software, to our clients, for download through a password-protected file server. Does this constitute distribution?
[1]: http://stackoverflow.com/questions/94346/can-i-legally-incorporating-gpl-lgpl-open-sourced-software-in-a-proprietary-clo
[2]: http://www.gnu.org/licenses/lgpl-3.0.txt | 0 | [
2,
98,
50,
14,
5674,
18,
16,
14,
1813,
16,
13,
7,
2906,
13202,
1203,
7,
131,
14,
13,
10641,
5727,
3962,
60,
800,
3726,
3726,
48,
1301,
25,
21,
1740,
71,
27,
53,
16,
51,
89,
2346,
15,
636,
1245,
31,
10524,
15239,
489,
5727,
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... |
Asp XML Parsing
===
I am new to asp and have a deadline in the next few days.
i receive the following xml from within a webservice response.
`print("<?xml version="1.0" encoding="UTF-8"?>
<user_data>
<execution_status>0</execution_status>
<row_count>1</row_count>
<txn_id>stuetd678</txn_id>
<person_info>
<attribute name="firstname">john</attribute>
<attribute name="lastname">doe</attribute>
<attribute name="emailaddress">john.doe@johnmail.com</attribute>
</person_info>
</user_data>");`
How can i parse this xml into asp attributes?
Any help is greatly appreciated
Thanks
Damien | 0 | [
2,
28,
306,
23504,
2017,
18,
68,
800,
3726,
3726,
31,
589,
78,
20,
28,
306,
17,
57,
21,
15968,
19,
14,
328,
310,
509,
9,
31,
2588,
14,
249,
23504,
37,
363,
21,
2741,
11449,
1627,
9,
13,
1,
10299,
5,
7,
1,
60,
396,
8184,
61... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 ASP.Net, during which page lifecycle event does viewstate get loaded?
===
I know it happens sometime before Load, but during what event exactly? | 0 | [
2,
19,
28,
306,
9,
2328,
15,
112,
56,
2478,
201,
12467,
807,
630,
1418,
3859,
164,
8572,
60,
800,
3726,
3726,
31,
143,
32,
5531,
8530,
115,
6305,
15,
47,
112,
98,
807,
1890,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Method to generate pdf from access+vb6 or just sql 2005?
===
The setup:
Multiple computers using an adp file to access a sql 2005 database. Most don't have a pdf distiller. An access form (plain form, not crystal) is created that needs to be saved as a pdf.
The only way I can think of is send a request from access to the sql server for a web page. Something like:
"http://sqlserver/generatepdf.php?id=123"
I'm trying to avoid the web page 'middle man'. Is there a way to generate the pdf in T-SQL? Anyone have any other ideas. I'm not looking for code, just methdology ideas.
Thank you | 0 | [
2,
2109,
20,
7920,
13,
11124,
37,
1381,
2430,
20468,
379,
54,
114,
4444,
255,
812,
60,
800,
3726,
3726,
14,
18161,
45,
1886,
7774,
568,
40,
21,
7431,
3893,
20,
1381,
21,
4444,
255,
812,
6018,
9,
127,
221,
22,
38,
57,
21,
13,
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... |
Open source .NET tools
===
Which is the best open source .NET tool you have used? Please list one tool per answer. | 4 | [
2,
368,
1267,
13,
9,
2328,
4672,
800,
3726,
3726,
56,
25,
14,
246,
368,
1267,
13,
9,
2328,
5607,
42,
57,
147,
60,
2247,
968,
53,
5607,
416,
1623,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
J2ME coverage tools
===
I need to estimate the code coverage of a test set.
The tests are run on a J2ME application, on a physical device.
This is mainly to identify pieces of code the tests do not touch at all.
It would also be nice to be able to combine the report data arbitrarily afterwards, so I can see how much a new test actually increases coverage.
Are there any alternatives to [Cobertura4j2me](http://www.cobertura4j2me.org/)? | 0 | [
2,
487,
135,
790,
5245,
4672,
800,
3726,
3726,
31,
376,
20,
10243,
14,
1797,
5245,
16,
21,
1289,
309,
9,
14,
4894,
50,
485,
27,
21,
487,
135,
790,
3010,
15,
27,
21,
1825,
3646,
9,
48,
25,
2011,
20,
5808,
2491,
16,
1797,
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... |
Need a free datepicker for ASPX
===
What is the best FREE Datepicker that can be dropped into an ASPX application? | 4 | [
2,
376,
21,
551,
1231,
16855,
106,
26,
28,
306,
396,
800,
3726,
3726,
98,
25,
14,
246,
551,
1231,
16855,
106,
30,
92,
44,
1539,
77,
40,
28,
306,
396,
3010,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Offline lorem ipsum generator
===
What would be a good offline alternative of the online [Lipsum generator][1]? It's frustrating when I'm not online and need some placeholder text for testing purpose. A CLI utility would be ideal, so that I can tailor the output to fit my needs.
[1]: www.lipsum.com/feed/html | 0 | [
2,
168,
1143,
12977,
79,
31,
1919,
723,
15286,
800,
3726,
3726,
98,
83,
44,
21,
254,
168,
1143,
2676,
16,
14,
2087,
636,
6013,
18,
723,
15286,
500,
2558,
165,
500,
60,
32,
22,
18,
25568,
76,
31,
22,
79,
52,
2087,
17,
376,
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... |
Best container for double-indexing
===
What is the best way (in C++) to set up a container allowing for double-indexing? Specifically, I have a list of objects, each indexed by a key (possibly multiple per key). This implies a multimap. The problem with this, however, is that it means a possibly worse-than-linear lookup to find the location of an object. I'd rather avoid duplication of data, so having each object maintain it's own coordinate and have to move itself in the map would be bad (not to mention that moving your own object may indirectly call your destructor whilst in a member function!). I would rather some container that maintains an index both by object pointer and coordinate, and that the objects themselves guarantee stable references/pointers. Then each object could store an iterator to the index (including the coordinate), sufficiently abstracted, and know where it is. Boost.MultiIndex seems like the best idea, but it's very scary and I don't wany my actual objects to need to be const.
What would you recommend? | 0 | [
2,
246,
12147,
26,
1494,
8,
25671,
68,
800,
3726,
3726,
98,
25,
14,
246,
161,
13,
5,
108,
272,
20512,
6,
20,
309,
71,
21,
12147,
2719,
26,
1494,
8,
25671,
68,
60,
3524,
15,
31,
57,
21,
968,
16,
3916,
15,
206,
4348,
69,
34,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 method to detect offline mode in the browser?
===
I have a web application where there are number of Ajax components which refresh them selves every so often inside a page (its a dashboard of sorts).
Now, I want to add functionality to the page so that when there is no Internet connectivity, the current content of the page doesn't change and a message appears on the page saying that the page is offline (currently, as these various gadgets on the page try to refresh themselves and find that there is no connectivity, their old data vanishes).
So, what is the best way to go about this? | 0 | [
2,
98,
25,
14,
246,
2109,
20,
9092,
168,
1143,
3740,
19,
14,
16495,
60,
800,
3726,
3726,
31,
57,
21,
2741,
3010,
113,
80,
50,
234,
16,
20624,
5090,
56,
24905,
105,
6254,
195,
18,
352,
86,
478,
572,
21,
2478,
13,
5,
7363,
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... |
Debugging my web app with JSON/Firefox - Firefox handling of JSON?
===
I'm attempting to debug my web application with FireFox3. However, when a JSON feed comes from my application, Firefox wants to open up the "application/json" in a new program. Is there a way to configure FireFox3 to handle JSON like regular text files and open up the JSON in the current tab?
Thanks. | 0 | [
2,
121,
16254,
2762,
51,
2741,
4865,
29,
487,
528,
118,
5929,
18219,
13,
8,
535,
18219,
7988,
16,
487,
528,
60,
800,
3726,
3726,
31,
22,
79,
6314,
20,
121,
16254,
51,
2741,
3010,
29,
535,
18219,
240,
9,
207,
15,
76,
21,
487,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the most accurate method of estimating peak bandwidth requirement for a web application?
===
I am working on a client proposal and they will need to upgrade their network infrastructure to support hosting an ASP.NET application. Essentially, I need to estimate peak usage for a system with a known quantity of users (currently 250). A simple answer like "you'll need a dedicated T1 line" would probably suffice, but I'd like to have data to back it up.
[Another question](http://stackoverflow.com/questions/54184/best-tool-to-monitor-network-connection-bandwidth#54245) referenced NetLimiter, which looks pretty slick for getting a sense of what's being used.
My general thought is that I'll fire the web app up and use the system like I would anticipate it be used at the customer, really at a leisurely pace, over a certain time span, and then multiply the bandwidth usage by the number of users and divide by the time.
This doesn't seem very scientific. It may be good enough for a proposal, but I'd like to see if there's a better way.
I know there are load tools available for testing web application performance, but it seems like these would not accurately simulate peak user load for bandwidth testing purposes (too much at once).
The platform is Windows/ASP.NET and the application is hosted within SharePoint (MOSS 2007). | 0 | [
2,
98,
25,
14,
127,
8137,
2109,
16,
13,
15018,
79,
1880,
3059,
23392,
8981,
26,
21,
2741,
3010,
60,
800,
3726,
3726,
31,
589,
638,
27,
21,
6819,
5149,
17,
59,
129,
376,
20,
9483,
66,
982,
5282,
20,
555,
10637,
40,
28,
306,
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... |
Using Vim for Lisp development
===
I've been using Lisp on and off for a while but I'm starting to get more serious about doing some "real" work in Lisp. I'm a huge Vim fan and was wondering how I can be most productive using Vim as my editor for Lisp development. Plugins, work flow suggestions, etc. are all welcome.
Please don't say "use emacs" as I've already ramped up on Vim and I'm really enjoying it as an editor. | 0 | [
2,
568,
1790,
79,
26,
2093,
3401,
522,
800,
3726,
3726,
31,
22,
195,
74,
568,
2093,
3401,
27,
17,
168,
26,
21,
133,
47,
31,
22,
79,
1422,
20,
164,
91,
2055,
88,
845,
109,
13,
7,
7467,
7,
170,
19,
2093,
3401,
9,
31,
22,
79,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the cost of a function call?
===
Compared to
* Simple memory access
* Disk access
* Memory access on another computer(on the same network)
* Disk access on another computer(on the same network)
in C++ on windows.
| 0 | [
2,
98,
25,
14,
1516,
16,
21,
1990,
645,
60,
800,
3726,
3726,
2428,
20,
1637,
1935,
1912,
1381,
1637,
8582,
1381,
1637,
1912,
1381,
27,
226,
1428,
5,
218,
14,
205,
982,
6,
1637,
8582,
1381,
27,
226,
1428,
5,
218,
14,
205,
982,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
DNS- Route DNS for subfolder to different server?
===
LEt's say I want to have a subfolder called- http://www.foo.com/news/ but I actually want that news folder on a different server. I realize it can be done easily with subdomains, but I was really hoping for the subfolder thing.
Is it possible? How? | 0 | [
2,
13,
43,
2172,
8,
858,
13,
43,
2172,
26,
972,
8814,
106,
20,
421,
8128,
60,
800,
3726,
3726,
408,
22,
18,
395,
31,
259,
20,
57,
21,
972,
8814,
106,
227,
8,
7775,
6903,
6483,
9,
4120,
111,
9,
960,
118,
14962,
118,
47,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tasklist replacement for Visual Studio
===
I would like to use the task-list in Visual Studio but it really lacks almost any useful feature a task-list should provide. So I use [Todo-List][1] externally, to keep track of the things I need to get done. Would be nice to have it all in one place.
So does anyone know of a cool replacement Add-On for the tasklist in Visual Studio?
Thanks in advance!
[1]: http://www.abstractspoon.com/ | 0 | [
2,
3005,
5739,
4610,
26,
3458,
1120,
800,
3726,
3726,
31,
83,
101,
20,
275,
14,
3005,
8,
5739,
19,
3458,
1120,
47,
32,
510,
1792,
18,
557,
186,
4811,
1580,
21,
3005,
8,
5739,
378,
1181,
9,
86,
31,
275,
636,
262,
537,
8,
5739,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
attach .mdf to sql2005
===
running sp_attach_single_file_db give this error:
The log scan number (10913:125:2) passed to log scan in database 'myDB' is not valid
isn't it supposed to re-create the log file? how else would i be able to attach / repair that .mdf file?
thanks | 0 | [
2,
19514,
13,
9,
79,
8736,
20,
4444,
255,
2835,
800,
3726,
3726,
946,
3782,
1,
14986,
673,
1,
14031,
1,
16877,
1,
9007,
590,
48,
7019,
45,
14,
6738,
8313,
234,
13,
5,
16597,
1543,
45,
16649,
45,
135,
6,
1100,
20,
6738,
8313,
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... |
Image Processing, In Python?
===
I've recently come across a problem which requires at least a basic degree of image processing, can I do this in Python, and if so, with what? | 4 | [
2,
1961,
5511,
15,
19,
20059,
60,
800,
3726,
3726,
31,
22,
195,
1989,
340,
464,
21,
1448,
56,
4781,
35,
639,
21,
2125,
1168,
16,
1961,
5511,
15,
92,
31,
107,
48,
19,
20059,
15,
17,
100,
86,
15,
29,
98,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Generics vs. Array Lists
===
The system I work on here was written before .net 2.0 and didn't have the benefit of generics. It was eventually updated to 2.0, but none of the code was refactored due to time constraints. There are a number of places where the code uses ArraysLists etc. that store things as objects.
From performance perspective, how important change the code to using generics? I know from a perfomance perspective, boxing and unboxing etc., it is inefficient, but how much of a performance gain will there really be from changing it? Are generics something to use on a go forward basis, or it there enough of a performance change that a conscience effort should be made to update old code? | 0 | [
2,
12733,
18,
4611,
9,
7718,
7227,
800,
3726,
3726,
14,
329,
31,
170,
27,
235,
23,
642,
115,
13,
9,
2328,
172,
9,
387,
17,
223,
22,
38,
57,
14,
4234,
16,
12733,
18,
9,
32,
23,
878,
6372,
20,
172,
9,
387,
15,
47,
2369,
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... |
looking for a good summary of SQL 2005 Partitioning
===
I'm looking at [this][1] as a baseline explanation of the SQL 2005 Enterprise partitioning. Is there a resource that goes deeper into fine points and considerations of this issue. Some more examples would be useful too.
My main scenario is a time based partition system. With one partition that has the most accessed last X days. This partition will have to somehow slide (at least periodically) to keep it refereeing to the same amount of days.
[1]: http://www.sqlservercentral.com/articles/SQL+Server+2005/61765/ | 0 | [
2,
699,
26,
21,
254,
14740,
16,
4444,
255,
812,
10711,
68,
800,
3726,
3726,
31,
22,
79,
699,
35,
636,
1565,
500,
2558,
165,
500,
28,
21,
27150,
5764,
16,
14,
4444,
255,
812,
6002,
10711,
68,
9,
25,
80,
21,
6577,
30,
1852,
5891... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 return a random numbers as a column in SQL Server 2005?
===
I'm running a SQL query on SQL Server 2005, and in addition to 2 columns being queried from the database, I'd also like to return 1 column of random numbers along with them. I tried this:
select column1, column2, floor(rand() * 10000) as column3 from table1
...which kinda works, but the problem is that this query returns the same random number on every row. It's a different number each time you run the query, but it doesn't vary from row to row. How can I do this and get a new random number for each row? | 0 | [
2,
184,
107,
31,
788,
21,
5477,
2116,
28,
21,
4698,
19,
4444,
255,
8128,
812,
60,
800,
3726,
3726,
31,
22,
79,
946,
21,
4444,
255,
25597,
27,
4444,
255,
8128,
812,
15,
17,
19,
848,
20,
172,
7498,
142,
9386,
11942,
37,
14,
6018... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 load xml from a url instead of a file path in .NET?
===
We currently have code like this:
Dim xDoc = XDocument.Load(myXMLFilePath)
The only way we know how to do it currently is by using a file path and impersonation (since this file is on a secured network path).
I've looked at [XDocument.Load on MSDN][1], but I don't see anything.
[1]: http://msdn.microsoft.com/en-us/library/system.xml.linq.xdocument.load.aspx | 0 | [
2,
184,
92,
31,
6305,
23504,
37,
21,
287,
6362,
700,
16,
21,
3893,
2013,
19,
13,
9,
2328,
60,
800,
3726,
3726,
95,
871,
57,
1797,
101,
48,
45,
5937,
993,
13799,
800,
993,
28132,
9,
8294,
5,
915,
396,
8184,
16877,
8353,
6,
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... |
Is it best to have a separate SQL developer? Or a jack of all trades programmer?
===
Currently my shop is making a switch from the usual ".NET/TSQL/XHTML+CSS" Jack of all trades developer to a more focused shop where the app dev only works on pushing the business requirements into code, the SQL dev only writes stored procedures and SSIS packages/etc
Is this best for everyone or just big enterprise shops where everything needs to be segregated for the usual political reasons? | 0 | [
2,
25,
32,
246,
20,
57,
21,
1725,
4444,
255,
10058,
60,
54,
21,
1040,
16,
65,
16983,
17968,
60,
800,
3726,
3726,
871,
51,
2546,
25,
544,
21,
5521,
37,
14,
3820,
13,
7,
9,
2328,
118,
38,
18,
22402,
118,
396,
15895,
2430,
6824,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Fetch one row per account id from list
===
I have a table with game scores, allowing multiple rows per account id: `scores (id, score, accountid)`. I want a list of the top 10 scorer ids and their scores.
Can you provide an sql statement to select the top 10 scores, but only one score per account id?
Thanks!
| 0 | [
2,
18312,
53,
3131,
416,
2176,
4924,
37,
968,
800,
3726,
3726,
31,
57,
21,
859,
29,
250,
7369,
15,
2719,
1886,
11295,
416,
2176,
4924,
45,
13,
1,
15077,
18,
13,
5,
1340,
15,
1618,
15,
2176,
1340,
6,
1,
9,
31,
259,
21,
968,
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... |
Coldfusion mail queue stops processing
===
Our CF server occasionally stops processing mail. This is problematic, as many of our clients depend on it.
We cound suggestions online that 0-byte files in the undeliverable folder, so I created a task that removes them every 3 minutes. However, the stoppage has occurred again.
I am looking for suggestions for diagnosing and fixing this isse.
CF 8 standard
Win2k3 | 0 | [
2,
1191,
9818,
4216,
22521,
6604,
5511,
800,
3726,
3726,
318,
10084,
8128,
4533,
6604,
5511,
4216,
9,
48,
25,
21070,
15,
28,
151,
16,
318,
7421,
12547,
27,
32,
9,
95,
326,
8724,
18389,
2087,
30,
713,
8,
23246,
6488,
19,
14,
367,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 debug logging tools are available from Javascript?
===
I'd like to create a "universal" debug logging function that inspects the JS namespace for well-known logging libraries.
For example, currently it supports Firebug's console.log:
var console = window['console'];
if (console && console.log) {
console.log(message);
}
Obviously, this only works in Firefox if Firebug is installed/enabled. Basically, I will be providing a JS library which I don't know what environment it will be pulled into, and I'd like to be able to figure out if there is a way to report debug output to the user.
So, perhaps jQuery provides something - I'd check that jQuery is present and use it. Or maybe there are well-known IE plugins that work that I can sniff for.
Please, only one library/technology per answer, so they can get vote-ranked. | 4 | [
2,
98,
121,
16254,
13,
13919,
4672,
50,
904,
37,
8247,
8741,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
1600,
21,
13,
7,
20748,
7,
121,
16254,
13,
13919,
1990,
30,
19,
7350,
18,
14,
487,
18,
204,
5582,
26,
134,
8,
2929,
13,
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 difference between range and xrange?
===
Apparently xrange is faster but I have no idea why it's faster (and no proof besides the anecdotal so far that it is faster) or what besides that is different about
for i in range(0, 20):
for i in xrange(0, 20):
| 0 | [
2,
98,
25,
14,
2841,
128,
978,
17,
993,
8366,
60,
800,
3726,
3726,
3083,
993,
8366,
25,
4233,
47,
31,
57,
90,
882,
483,
32,
22,
18,
4233,
13,
5,
290,
90,
6070,
3410,
14,
40,
3319,
537,
3663,
86,
463,
30,
32,
25,
4233,
6,
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... |
Restarting ColdFusion mail queue
===
We are currently experiencing intermittent mail queue stoppages. I'm seeking diagnostic help in another area.
In the meantime, is there a way to restart the CF mail queue without restarting the service as a whole?
CF8 standard
Win2k3 | 0 | [
2,
22767,
68,
1191,
9818,
4216,
22521,
800,
3726,
3726,
95,
50,
871,
15138,
19667,
4216,
22521,
747,
6486,
18,
9,
31,
22,
79,
5246,
16458,
448,
19,
226,
217,
9,
19,
14,
14058,
15,
25,
80,
21,
161,
20,
22767,
14,
10084,
4216,
225... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Python implementation of Parsec?
===
I recently wrote a parser in Python using Ply (it's a python reimplementation of yacc). When I was almost done with the parser I discovered that the grammar I need to parse requires me to do some look up during parsing to inform the lexer. Without doing a look up to inform the lexer I cannot correctly parse the strings in the language.
Given than I can control the state of the lexer from the grammar rules I think I'll be solving my use case using a look up table in the parser module, but it may become too difficult to maintain/test. So I want to know about some of the other options.
In Haskell I would use Parsec, a library of parsing functions (known as combinators). Is there a Python implementation of Parsec? Or perhaps some other production quality library full of parsing functionality so I can build a context sensitive parser in Python? | 4 | [
2,
20059,
6123,
16,
2017,
14332,
60,
800,
3726,
3726,
31,
1989,
738,
21,
2017,
4104,
19,
20059,
568,
351,
102,
13,
5,
242,
22,
18,
21,
20059,
302,
8983,
413,
1130,
857,
16,
2167,
3384,
6,
9,
76,
31,
23,
557,
677,
29,
14,
2017,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 priortize multiple triggers of a table?
===
I have a couple of triggers on a table that I want to keep ***separate*** and would like to priortize them.
I could have just one trigger and do the logic there, but I was wondering if there was an easier/logical way of accomplishing this of having it in a pre-defined order. | 0 | [
2,
184,
107,
42,
1313,
38,
2952,
1886,
7286,
18,
16,
21,
859,
60,
800,
3726,
3726,
31,
57,
21,
1335,
16,
7286,
18,
27,
21,
859,
30,
31,
259,
20,
643,
8980,
18,
14189,
5487,
2483,
1409,
17,
83,
101,
20,
1313,
38,
2952,
105,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why aren't variables declared in "try" in scope in "catch" or "finally"?
===
In C# and in Java (and possibly other languages as well), variables declared in a "try" block are not in scope in the corresponding "catch" or "finally" blocks. For example, the following code does not compile:
try {
String s = "test";
// (more code...)
}
catch {
Console.Out.WriteLine(s); //Java fans: think "System.out.println" here instead
}
In this code, a compile-time error occurs on the reference to s in the catch block, because s is only in scope in the try block. (In Java, the compile error is "s cannot be resolved"; in C#, it's "The name 's' does not exist in the current context".)
The general solution to this issue seems to be to instead declare variables just before the try block, instead of within the try block:
String s;
try {
s = "test";
// (more code...)
}
catch {
Console.Out.WriteLine(s); //Java fans: think "System.out.println" here instead
}
However, at least to me, (1) this feels like a clunky solution, and (2) it results in the variables having a larger scope than the programmer intended (the entire remainder of the method, instead of only in the context of the try-catch-finally).
My question is, what were/are the rationale(s) behind this language design decision (in Java, in C#, and/or in any other applicable languages)? | 0 | [
2,
483,
4847,
22,
38,
12157,
2482,
19,
13,
7,
5840,
7,
19,
9914,
19,
13,
7,
18208,
7,
54,
13,
7,
4932,
102,
7,
60,
800,
3726,
3726,
19,
272,
5910,
17,
19,
8247,
13,
5,
290,
2879,
89,
2556,
28,
134,
6,
15,
12157,
2482,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you rate-limit an IO operation?
===
Suppose you have a program which reads from a socket. How do you keep the download rate below a certain given threshold?
| 0 | [
2,
184,
107,
42,
1684,
8,
20565,
40,
13,
1963,
1453,
60,
800,
3726,
3726,
5787,
42,
57,
21,
625,
56,
11137,
37,
21,
18482,
9,
184,
107,
42,
643,
14,
7121,
1684,
1021,
21,
1200,
504,
11361,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Alternative to 'truss -p' instruction
===
I am looking for a command in Unix that returns the status of a process(active, dead, sleeping, waiting for another process, etc.)
is there any available?<br>
A shell script maybe? | 0 | [
2,
2676,
20,
13,
22,
8989,
18,
18,
13,
8,
306,
22,
7304,
800,
3726,
3726,
31,
589,
699,
26,
21,
1202,
19,
22540,
30,
4815,
14,
1782,
16,
21,
953,
5,
7889,
15,
828,
15,
4777,
15,
1672,
26,
226,
953,
15,
2722,
9,
6,
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,
0,
0,
0,
0... |
Explain the quantile() function in R
===
I've been mystified by the R quantile function all day.
I have an intuitive notion of how quantiles work, and an M.S. in stats, but boy oh boy, the documentation for it is confusing to me.
From the docs:
> Q\[i](p) = (1 - gamma) x[j] + gamma
> x\[j+1],
I'm with it so far. For a type *i* quantile, it's an iterpolation between x[j] and x [j+1], based on some mysterious constant *gamma*
> where 1 <= i <= 9, (j-m)/n <= p <
> (j-m+1)/ n, x[j] is the jth order
> statistic, n is the sample size, and m
> is a constant determined by the sample
> quantile type. Here gamma depends on
> the fractional part of g = np+m-j.
>
So, how calculate j? m?
> For the continuous sample quantile
> types (4 through 9), the sample
> quantiles can be obtained by linear
> interpolation between the kth order
> statistic and p(k):
>
> p(k) = (k - alpha) / (n - alpha - beta
> + 1),
> where α and β are constants determined
> by the type. Further, m = alpha + p(1
> - alpha - beta), and gamma = g.
Now I'm really lost. p, which was a constant before, is now apparently a function.
So for Type 7 quantiles, the default...
> Type 7
>
> p(k) = (k - 1) / (n - 1). In this case, p(k) = mode[F(x[k])]. This is used by S.
Anyone want to help me out? In particular I'm confused by the notation of p being a function and a constant, what the heck *m* is, and now to caculate j for some particular *p*.
I hope that based on the answers here, we can submit some revised documentation that better explains what is going on here.
[quantile.R source code][1]
or type: quantile.default
[1]: https://svn.r-project.org/R/trunk/src/library/stats/R/quantile.R | 0 | [
2,
3271,
14,
9836,
9802,
5,
6,
1990,
19,
761,
800,
3726,
3726,
31,
22,
195,
74,
51,
384,
4462,
34,
14,
761,
9836,
9802,
1990,
65,
208,
9,
31,
57,
40,
13,
24392,
7834,
16,
184,
9836,
9802,
18,
170,
15,
17,
40,
307,
9,
18,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Deleting rows in joined tables using ADO
===
Now I have seen this question in [another forum][1] but it didn't had an acceptable answer.
Suppose I have two tables, the Groups table and the Elements table. The tables have no defined relationships. The Elements table has an IdGroup field that refers to the IdGroup (PK) field of the Groups table.
I use the following query through an ADO recordset to populate the tables values to a datagrid:
SELECT Elements.*, Groups.GroupName
FROM Elements
INNER JOIN Groups ON Elements.IdGroup = Groups.IdGroup
From that grid I want to press Delete in order to delete an Element. Here is my problem. When I used DAO, the DAO Delete() function deleted only the record in the Elements group. This was the expected behavior.
When I changed to ADO, the Delete() function deleted records in both tables, the element record and the group to which the element belonged!
Is there any way to reproduce the DAO behavior in ADO without having to define relationships into the tables?
Note: I know there are alternatives (executing DELETE querys could do the job). Just show me a way to do this in ADO, or say it cannot be done.
[1]: http://www.access-programmers.co.uk/forums/showthread.php?t=95929 | 0 | [
2,
121,
1336,
68,
11295,
19,
670,
7484,
568,
21,
537,
800,
3726,
3726,
130,
31,
57,
541,
48,
1301,
19,
636,
14945,
5691,
500,
2558,
165,
500,
47,
32,
223,
22,
38,
41,
40,
12513,
1623,
9,
5787,
31,
57,
81,
7484,
15,
14,
1170,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
learning drupal fast track: how to create a stackoverflow clone?
===
I've started figuring out drupal, and so far most of the results are just ugly.
May be I need to learn it in something similar to a real-life project.
I thought — to reproduce this site's functionality might be a good learning project. But I need help. :)
Without assuming this site is based on drupal (it most likely is not — too quick, I think) is there a way to build something similar in functionality (yes, slower, OK if not as fancy as this one, but close) with existing drupal modules and schemes (or with minimal tweaking)?
Or drupal is not good enough for that?
Or — is it too complicated project for a student?
Which existing modules and schemes might help to build something similar?
(No competition is intended with stackoverflow.) | 0 | [
2,
2477,
15708,
6720,
1512,
792,
45,
184,
20,
1600,
21,
7566,
2549,
9990,
13871,
60,
800,
3726,
3726,
31,
22,
195,
373,
25379,
70,
15708,
6720,
15,
17,
86,
463,
127,
16,
14,
1736,
50,
114,
9212,
9,
123,
44,
31,
376,
20,
2484,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Java: Best Place to Begin Learning Basic Networking
===
I am trying to write a simple networked chat program in Java. I have almost no networking experience. I was wondering what resources I should begin looking at (beside here of course).
Sticking with the core Java API would be best for now. | 0 | [
2,
8247,
45,
246,
209,
20,
2348,
2477,
2125,
16230,
800,
3726,
3726,
31,
589,
749,
20,
2757,
21,
1935,
982,
69,
6615,
625,
19,
8247,
9,
31,
57,
557,
90,
16230,
1496,
9,
31,
23,
5712,
98,
2566,
31,
378,
2348,
699,
35,
13,
5,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I automate the process of deploying an InfoPath Form to SharePoint Server 2007?
===
It is a real pain to deploy my InfoPath 2007 Forms from the designer into our development environment's SharePoint server. All of our forms require "full trust" since they include business logic written in C#. Here are the manual steps:
1) Run the "Publish Form" wizard in InfoPath, specifying the target site to publish to and location to save the xsn file.
2) De-activate the existing version of the form from the site collection features (if an older version exists).
3) Log into Central Admin on the development server. Navigate to Application Management -> Manage Form Templates and upload the xsn file.
4) Activate the form as a site collection feature.
Does anyone have an idea how this can be automated? Maybe via stsadm? | 0 | [
2,
184,
92,
31,
3108,
5281,
14,
953,
16,
17617,
68,
40,
15404,
8353,
505,
20,
1891,
3132,
8128,
624,
60,
800,
3726,
3726,
32,
25,
21,
683,
1257,
20,
17617,
51,
15404,
8353,
624,
1997,
37,
14,
4742,
77,
318,
522,
2307,
22,
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... |
SQLite / Firebird embedded for numeric data
===
I have an experiment streaming up 1Mb/s of numeric data which needs to be stored for later processing.
It seems as easy to write directly into a database as to a CSV file and I would then have the ability to easily retrieve subsets or ranges.
I have experience of sqlite2 (when it only had text fields) and it seemed pretty much as fast as raw disk access.
Any opinions on the best current in-process DBMS for this application?
| 0 | [
2,
4444,
10601,
13,
118,
535,
8490,
12138,
26,
15764,
596,
1054,
800,
3726,
3726,
31,
57,
40,
5737,
11920,
71,
137,
5024,
118,
18,
16,
15764,
596,
1054,
56,
2274,
20,
44,
8214,
26,
138,
5511,
9,
32,
2206,
28,
2010,
20,
2757,
170... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 handle UTF-8 characters in sqlite2 to sqlite3 migration
===
Trying the easy approach:
> sqlite2 mydb.db .dump | sqlite3 mydb-new.db
I got this error:
> SQL error near line 84802: no such column: Ð
In that line the script is this:
> INSERT INTO vehiculo VALUES(127548,'21K0065217',**Ñ**,'PA007808',65217,279,1989,3,468,'1998-07-30 00:00:00.000000','14/697/98-07',2,'',1);
My guess is that **the 'Ñ' without quotes is the problem**.
any idea?
PD: I'm under Windows right now and I would like to use the command-line so it can be automatized (this process will be done on daily basis by a server). | 0 | [
2,
184,
20,
3053,
287,
11720,
8,
457,
1766,
19,
4444,
10601,
135,
20,
4444,
10601,
240,
8443,
800,
3726,
3726,
749,
14,
2010,
2141,
45,
13,
1,
4444,
10601,
135,
51,
9007,
9,
9007,
13,
9,
43,
11134,
13,
1,
4444,
10601,
240,
51,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why is Application.Restart() not reliable?
===
Using the Method Application.Restart() in C# should restart the current Application: but it seems that this is not always working.
Is there a reason for this Issue, can somebody tell me, why it doesn't work all the time? | 0 | [
2,
483,
25,
3010,
9,
99,
13680,
5,
6,
52,
11398,
60,
800,
3726,
3726,
568,
14,
2109,
3010,
9,
99,
13680,
5,
6,
19,
272,
5910,
378,
22767,
14,
866,
3010,
45,
47,
32,
2206,
30,
48,
25,
52,
550,
638,
9,
25,
80,
21,
1215,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there any built-in way to convert an integer to a string (of any base) in C#?
===
Convert.ToString() only allows base values of 2, 8, 10, and 16 for some odd reason; is there some obscure way of providing any base between 2 and 16? | 0 | [
2,
25,
80,
186,
392,
8,
108,
161,
20,
8406,
40,
13820,
20,
21,
3724,
13,
5,
1041,
186,
1000,
6,
19,
272,
5910,
60,
800,
3726,
3726,
8406,
9,
262,
11130,
5,
6,
104,
2965,
1000,
4070,
16,
172,
15,
469,
15,
332,
15,
17,
347,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Vim shortcut for adding arguments to a function
===
Is there a Vim shortcut for jumping to the argument list of the current function? I often find myself needing to mess with the argument list of a function, and it's kind of annoying to have to do ?def or ?function or 10k or what-have-you until I finally get to it, then /( or t( or 5e to get to the right position in the argument list, and so on. It would be great if I could just hit ,a for example and instantly get put into insert mode at the end/beginning of the argument list.
If no such shortcut exists, I'll just write one and post it here as an answer. :-) | 0 | [
2,
1790,
79,
502,
4118,
26,
4721,
10553,
20,
21,
1990,
800,
3726,
3726,
25,
80,
21,
1790,
79,
502,
4118,
26,
8759,
20,
14,
5476,
968,
16,
14,
866,
1990,
60,
31,
478,
477,
992,
12210,
20,
3957,
29,
14,
5476,
968,
16,
21,
1990,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 "pause" my code in Visual Basic (VB6)?
===
I have a long running process in VB6 that I want to finish before executing the next line of code. How can I do that? Built-in function? Can I control how long to wait? | 0 | [
2,
184,
107,
31,
13,
7,
1060,
3699,
7,
51,
1797,
19,
3458,
2125,
13,
5,
20468,
379,
6,
60,
800,
3726,
3726,
31,
57,
21,
175,
946,
953,
19,
13,
20468,
379,
30,
31,
259,
20,
2106,
115,
25836,
14,
328,
293,
16,
1797,
9,
184,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where is the best place to store user related data in asp.net?
===
When a customer logs in to my site, I need to know their account id and their menu id. This lets me know what data they can see on a page and what menu they get. I don't want to have to read this data over and over. Should I store this in a session variable or customize the membership user and membership provider to contain this information? | 0 | [
2,
113,
25,
14,
246,
209,
20,
1718,
4155,
1597,
1054,
19,
28,
306,
9,
2328,
60,
800,
3726,
3726,
76,
21,
7705,
18893,
19,
20,
51,
689,
15,
31,
376,
20,
143,
66,
2176,
4924,
17,
66,
11379,
4924,
9,
48,
6884,
55,
143,
98,
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... |
Differences between MSIL and Java bytecode?
===
I'm new to .Net and I'm trying to understand the basics first. What is the difference between MSIL and Java bytecode? | 0 | [
2,
4921,
128,
307,
8556,
17,
8247,
34,
591,
9375,
60,
800,
3726,
3726,
31,
22,
79,
78,
20,
13,
9,
2328,
17,
31,
22,
79,
749,
20,
1369,
14,
2125,
18,
64,
9,
98,
25,
14,
2841,
128,
307,
8556,
17,
8247,
34,
591,
9375,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Java Serialization with non serializable parts
===
I have:
class MyClass extends MyClass2 implements Serializable {
//...
}
In MyClass2 is a property that is not serializable. How can I serialize (and de-serialize) this object?
Correction: MyClass2 is, of course, not an interface but a class. | 0 | [
2,
8247,
5956,
1829,
29,
538,
5956,
3186,
579,
1341,
800,
3726,
3726,
31,
57,
45,
718,
51,
1898,
9073,
51,
1898,
135,
8713,
18,
5956,
3186,
579,
13,
1,
12894,
9,
9,
9,
13,
1,
19,
51,
1898,
135,
25,
21,
1354,
30,
25,
52,
5956... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 one create an index on the date part of DATETIME field in MySql
===
How do I create an index on the date part of DATETIME field?
mysql> SHOW COLUMNS FROM transactionlist;
+-------------------+------------------+------+-----+---------+----------------+
| Field | Type | Null | Key | Default | Extra |
+-------------------+------------------+------+-----+---------+----------------+
| TransactionNumber | int(10) unsigned | NO | PRI | NULL | auto_increment |
| WagerId | int(11) | YES | MUL | 0 | |
| TranNum | int(11) | YES | MUL | 0 | |
| TranDateTime | datetime | NO | | NULL | |
| Amount | double | YES | | 0 | |
| Action | smallint(6) | YES | | 0 | |
| Uid | int(11) | YES | | 1 | |
| AuthId | int(11) | YES | | 1 | |
+-------------------+------------------+------+-----+---------+----------------+
8 rows in set (0.00 sec)
TranDateTime is used to save the date and time of a transaction as it happens
My Table has over 1,000,000 records in it and it and the statement
SELECT * FROM transactionlist where date(TranDateTime) = '2008-08-17'
Takes a long time.
| 0 | [
2,
184,
630,
53,
1600,
40,
4348,
27,
14,
1231,
141,
16,
1231,
891,
575,
19,
51,
18,
22402,
800,
3726,
3726,
184,
107,
31,
1600,
40,
4348,
27,
14,
1231,
141,
16,
1231,
891,
575,
60,
51,
18,
22402,
1,
298,
7498,
37,
12799,
5739,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is your favorite Resharper/Visual Studio shortcut?
===
Let's show some Resharper love and learn new shortcuts while at it:
Along the lines of Joel Spolsky's "What is your single favorite keyboard shortcut in Emacs?" what is your single favorite Resharper shortcut? One shortcut per answer, please.
Would it be:
- ctrl-N/ctrl-shift-N (open type/open file)
- ctrl-shift-G (a friend calls this
"Super Go")
- alt-ins
- ctrl-k-ctrl-s/ctrl-/ (comment/uncomment)
- f2 (rename method/variable etc.)
I figure we can deal with more than one favorite by providing multiple answers - let the best ones rise to the top. | 2 | [
2,
98,
25,
154,
3839,
302,
23646,
106,
118,
20893,
1120,
502,
4118,
60,
800,
3726,
3726,
408,
22,
18,
298,
109,
302,
23646,
106,
339,
17,
2484,
78,
502,
4118,
18,
133,
35,
32,
45,
303,
14,
1560,
16,
8873,
13,
18,
7332,
2397,
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... |
CruiseControl + Starteam: not picking up all files
===
Our CruiseControl system checks out from starteam. I've noticed that it is sometimes not checking out new versions of files, only added files.
Does anyone know why this is?
| 0 | [
2,
6581,
12898,
2754,
778,
6575,
45,
52,
7833,
71,
65,
6488,
800,
3726,
3726,
318,
6581,
12898,
329,
16602,
70,
37,
778,
6575,
9,
31,
22,
195,
2711,
30,
32,
25,
1030,
52,
9886,
70,
78,
3281,
16,
6488,
15,
104,
905,
6488,
9,
63... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How Can You Generate a Makefile from an XCode Project?
===
I want to generate a Makefile from an existing XCode project on the Mac. Specifically, an existing iPhone, Objective-C program on the Mac.
I found [PBToMake][1], but it looks like it is for XCode 2.1 and when I tried using it, it did not work for an XCode 3.1 project.
[1]: http://members.bellatlantic.net/%7Evze35xda/software.html | 0 | [
2,
184,
92,
42,
7920,
21,
233,
16877,
37,
40,
993,
9375,
669,
60,
800,
3726,
3726,
31,
259,
20,
7920,
21,
233,
16877,
37,
40,
3149,
993,
9375,
669,
27,
14,
1572,
9,
3524,
15,
40,
3149,
21024,
15,
7038,
8,
150,
625,
27,
14,
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... |
Can JQuery read/write cookies to a browser?
===
Simple example: I want to have some items on a page (like divs or table rows) and I want to let the user click on them to select them. That seems easy enough in jquery. To save which items a user clicks on with no server-side post backs, I was thinking a cookie would be a simple way to get this done.
1. Is this assumption that a cookie is ok in this case, correct?
2. If it is correct, does the jquery api have some way to read/write cookie info that is nicer than the default JS apis? | 0 | [
2,
92,
487,
8190,
93,
1302,
118,
23716,
19396,
20,
21,
16495,
60,
800,
3726,
3726,
1935,
823,
45,
31,
259,
20,
57,
109,
3755,
27,
21,
2478,
13,
5,
1403,
13,
12916,
18,
54,
859,
11295,
6,
17,
31,
259,
20,
408,
14,
4155,
10840,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
T-SQL triggers firing a "Column name or number of supplied values does not match table definition" error
===
Here's something I haven't been able to fix, and I've looked **everywhere**. Perhaps someone here will know!
I have a table called dandb_raw, with three columns in particular: dunsId (PK), name, and searchName. I also have a trigger that acts on this table:
SET ANSI_NULLS ON
GO
SET QUOTED_IDENTIFIER ON
GO
ALTER TRIGGER [dandb_raw_searchNames]
ON [dandb_raw]
FOR INSERT, UPDATE
AS
SET NOCOUNT ON
select dunsId, name into #magic from inserted
UPDATE dandb
SET dandb.searchName = company_generateSearchName(dandb.name)
FROM (select dunsId, name from #magic) i
INNER JOIN dandb_raw dandb
on i.dunsId = dandb.dunsId
--Add new search matches
SELECT c.companyId, dandb.dunsId
INTO #newMatches
FROM dandb_raw dandb
INNER JOIN (select dunsId, name from #magic) a
on a.dunsId = dandb.dunsId
INNER JOIN companies c
ON dandb.searchName = c.searchBrand
--avoid url matches that are potentially wrong
AND (lower(dandb.url) = lower(c.url)
OR dandb.url = ''
OR c.url = ''
OR c.url is null)
INSERT INTO #newMatches (companyId, dunsId)
SELECT c.companyId, max(dandb.dunsId) dunsId
FROM dandb_raw dandb
INNER JOIN
(
select
case when charindex('/',url) <> 0 then left(url, charindex('/',url)-1)
else url
end urlMatch, * from companies
) c
ON dandb.url = c.urlMatch
where subsidiaryOf = 1 and isReported = 1 and dandb.url <> ''
and c.companyId not in (select companyId from #newMatches)
group by companyId
having count(dandb.dunsId) = 1
UPDATE cd
SET cd.dunsId = nm.dunsId
FROM companies_dandb cd
INNER JOIN #newMatches nm
ON cd.companyId = nm.companyId
GO
The trigger causes inserts to fail:
insert into [dandb_raw](dunsId, name)
select 3442355, 'harper'
union all
select 34425355, 'har 466per'
update [dandb_raw] set name ='grap6767e'
With this error:
Msg 213, Level 16, State 1, Procedure companies_contactInfo_updateTerritories, Line 20
Insert Error: Column name or number of supplied values does not match table definition.
The most curious thing about this is that each of the individual statements in the trigger works on its own. It's almost as though inserted is a one-off table that infects temporary tables if you try to move inserted into one of them.
So what causes the trigger to fail? How can it be stopped? | 0 | [
2,
13,
38,
8,
18,
22402,
7286,
18,
7139,
21,
13,
7,
716,
4404,
103,
204,
54,
234,
16,
7949,
4070,
630,
52,
730,
859,
5465,
7,
7019,
800,
3726,
3726,
235,
22,
18,
301,
31,
2933,
22,
38,
74,
777,
20,
6098,
15,
17,
31,
22,
19... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to evaluate Eclipse RCP for an in-house project?
===
I have only a basic understanding of Eclipse RCP.
I am about to start an in-house application for our technical support team, that will likely grow over time. The team is distributed across continents so I would like to be able to auto-update the application when new versions are made available. The application aims to capture knowledge from technical support incidents while making it easy to replay data fixes across clients. The things that make eclipse RCP look interesting are Eclipse Communication Framework (ECF) and Data Tools Platform (DTP). My constraints are:
1. Small Team (basically just me for now :)
2. Have to manage it as a side project until its usefulness is proven
I am basically looking for insights from other developers who have worked with Eclipse RCP or who know a better alternative. | 0 | [
2,
184,
20,
13,
15599,
11652,
761,
7439,
26,
40,
19,
8,
1682,
669,
60,
800,
3726,
3726,
31,
57,
104,
21,
2125,
3260,
16,
11652,
761,
7439,
9,
31,
589,
88,
20,
799,
40,
19,
8,
1682,
3010,
26,
318,
2447,
555,
173,
15,
30,
129,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
GLSL major mode for emacs?
===
I found this link <http://artis.imag.fr/~Xavier.Decoret/resources/glsl-mode/>, but there isn't a lot of description around it, aside that it's "simple".
Ideally, I'd like an extension to CcMode that can do it, or at least a mode that can handle auto-styling and has similar shortcuts to CcMode.
If there isn't one, any good elips references to help me get started writing it myself would be greatly appreciated. | 0 | [
2,
13,
8430,
18,
255,
394,
3740,
26,
13,
62,
6893,
18,
60,
800,
3726,
3726,
31,
216,
48,
3508,
13,
1,
21127,
6903,
2900,
403,
9,
49,
9473,
9,
6177,
118,
1,
6791,
9397,
9,
546,
10375,
38,
118,
99,
12097,
18,
118,
8430,
18,
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... |
What's the best way to send a file over a network using C#?
===
Can anyone point me to a tutorial on the best way to open a connection from client to server, read in a binary file and send its contents reliably across the network connection? Even better, is there an open source library that already does this that I could refer to?
Thanks!
| 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
2660,
21,
3893,
84,
21,
982,
568,
272,
5910,
60,
800,
3726,
3726,
92,
1276,
454,
55,
20,
21,
29724,
27,
14,
246,
161,
20,
368,
21,
2760,
37,
6819,
20,
8128,
15,
1302,
19,
21,
14171,
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... |
How to get a table of dates between x and y in sql server 2005
===
I just want a quick way (and preferably not using a while loop)of createing a table of every date between date @x and date @y so I can left outer join to some stats tables, some of which will have no records for certain days in between, allowing me to mark missing days with a 0 | 0 | [
2,
184,
20,
164,
21,
859,
16,
4076,
128,
993,
17,
13,
93,
19,
4444,
255,
8128,
812,
800,
3726,
3726,
31,
114,
259,
21,
2231,
161,
13,
5,
290,
6369,
4801,
52,
568,
21,
133,
5293,
6,
1041,
1600,
68,
21,
859,
16,
352,
1231,
128... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 create a paramaterized query in MS Access 2003 and use other queries/forms to fill the parimeters and obtain a result set.
===
I'd like to be able to create a parameterized query in MS Access 2003 and feed the values of certain form elements to that query and then get the corresponding result set back and do some basic calculations with them. I'm coming up short in figuring out how to get the parameters of the query to be populated by the form elements. If I have to use VBA, that's fine.
Thanks in advance! | 0 | [
2,
184,
107,
42,
1600,
21,
2258,
540,
815,
1333,
25597,
19,
4235,
1381,
973,
17,
275,
89,
9386,
2829,
118,
4190,
18,
20,
3509,
14,
19498,
7307,
18,
17,
5545,
21,
829,
309,
9,
800,
3726,
3726,
31,
22,
43,
101,
20,
44,
777,
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... |
Log4Net: set Max backup files on RollingFileAppender with rolling Date
===
I have the following configuration, but I have not able to find any documentation on how to set a maximum backup files on date rolling style. I know that you can do this with size rolling style by using the maxSizeRollBackups.
<code>
<appender name="AppLogFileAppender" type="log4net.Appender.RollingFileAppender">
<file value="mylog.log" />
<appendToFile value="true" />
<lockingModel type="log4net.Appender.FileAppender+MinimalLock" />
<rollingStyle value="Date" />
<datePattern value=".yyMMdd.'log'" />
<layout type="log4net.Layout.PatternLayout">
<conversionPattern value="%d %-5p %c - %m%n" />
</layout>
</appender>
</code> | 0 | [
2,
6738,
300,
2328,
45,
309,
2049,
10119,
6488,
27,
3929,
16877,
22358,
1157,
29,
3929,
1231,
800,
3726,
3726,
31,
57,
14,
249,
8091,
15,
47,
31,
57,
52,
777,
20,
477,
186,
13945,
27,
184,
20,
309,
21,
2979,
10119,
6488,
27,
123... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Legality of Encryption in Standard Libraries
===
Some programming languages such as Java and C# include encryption packages in their standard libraries. Others such as Python and Ruby make you download third-party modules to do strong encryption. I assume that this is for legal reasons; perhaps Sun Microsystems has enough lawyers that they aren't afraid of getting sued, while Guido van Rossum feels more vulnerable.
But what does the law actually say about this? At this point, would open source authors have anything to fear if they included strong encryption in their programming languages' standard libraries? If so, then why don't they? If not, then how do Sun and Microsoft get away with it. | 0 | [
2,
1517,
856,
16,
24420,
19,
1236,
8649,
800,
3726,
3726,
109,
3143,
2556,
145,
28,
8247,
17,
272,
5910,
468,
24420,
16875,
19,
66,
1236,
8649,
9,
654,
145,
28,
20059,
17,
10811,
233,
42,
7121,
422,
8,
9635,
17113,
20,
107,
966,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 tools and techniques do you use to fix browser memory leaks?
===
I am trying to fix memory leaks in IE 7. Using Drip for investigations but it is not helping much when most dynamically generated DOM elements do not have unique ids.
Tips? | 0 | [
2,
98,
4672,
17,
4212,
107,
42,
275,
20,
6098,
16495,
1912,
11724,
18,
60,
800,
3726,
3726,
31,
589,
749,
20,
6098,
1912,
11724,
18,
19,
13,
660,
453,
9,
568,
24663,
26,
10511,
47,
32,
25,
52,
3713,
212,
76,
127,
7782,
1326,
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,
0,
0,
0,
0,
0,
0... |
RSS Statistics/Traffic Metrics
===
I want to track how much traffic I'm getting on an RSS feed that is set up using .Net 2.0 & SQL Server.
Is there an industry standard on what metrics I should use, for example, page hits? | 0 | [
2,
13,
1224,
18,
5818,
118,
1939,
2460,
596,
11544,
18,
800,
3726,
3726,
31,
259,
20,
792,
184,
212,
2227,
31,
22,
79,
1017,
27,
40,
13,
1224,
18,
4063,
30,
25,
309,
71,
568,
13,
9,
2328,
172,
9,
387,
279,
4444,
255,
8128,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I modify a ReadOnly Linq property
===
I have a LINQ to SQL generated class with a readonly property:
<Column(Name:="totalLogins", Storage:="_TotalLogins", DbType:="Int", UpdateCheck:=UpdateCheck.Never)> _
Public ReadOnly Property TotalLogins() As System.Nullable(Of Integer)
Get
Return Me._TotalLogins
End Get
End Property
This prevents it from being changed externally, but I would like to update the property from within my class like below:
Partial Public Class User
...
Public Shared Sub Login(Username, Password)
ValidateCredentials(UserName, Password)
Dim dc As New MyDataContext()
Dim user As User = (from u in dc.Users select u where u.UserName = Username)).FirstOrDefault()
user._TotalLogins += 1
dc.SubmitChanges()
End Sub
...
End Class
But the call to user._TotalLogins += 1 is not being written to the database? Any thoughts on how to get LINQ to see my changes?
| 0 | [
2,
184,
107,
31,
17579,
21,
1302,
4965,
6294,
1251,
1354,
800,
3726,
3726,
31,
57,
21,
6294,
1251,
20,
4444,
255,
6756,
718,
29,
21,
1302,
4965,
1354,
45,
13,
1,
716,
4404,
103,
5,
7259,
45,
3726,
7,
20148,
1415,
17040,
7,
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... |
Good ways to motivate and inspire high school students regarding software development?
===
My company is allowing some local high school students to come on-site and job shadow for an hour or two. What are some ways that I can inspire these young people into potentially taking a career in software development? Any advice would be great. Thanks!
| 2 | [
2,
254,
2847,
20,
13,
24271,
1373,
17,
19146,
183,
116,
573,
3467,
2306,
522,
60,
800,
3726,
3726,
51,
237,
25,
2719,
109,
375,
183,
116,
573,
20,
340,
27,
8,
9097,
17,
1205,
3118,
26,
40,
1671,
54,
81,
9,
98,
50,
109,
2847,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Batch source-code aware spell check
===
What is a tool or technique that can be used to perform spell checks upon a whole source code base and its associated resource files?
The spell check should be *source code aware* meaning that it would stick to checking string literals in the code and not the code itself. Bonus points if the spell checker understands common resource file formats, for example text files containing name-value pairs (only check the values). Super-bonus points if you can tell it which parts of an XML DTD or Schema should be checked and which should be ignored.
Many IDEs can do this for the file you are currently working with. The difference in what I am looking for is something that can operate upon a whole source code base at once.
Something like a Findbugs or PMD type tool for mis-spellings would be ideal. | 0 | [
2,
13064,
1267,
8,
9375,
3854,
4762,
2631,
800,
3726,
3726,
98,
25,
21,
5607,
54,
4873,
30,
92,
44,
147,
20,
2985,
4762,
16602,
685,
21,
979,
1267,
1797,
1000,
17,
82,
1598,
6577,
6488,
60,
14,
4762,
2631,
378,
44,
1637,
12097,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Passing parameters to start as a console or GUI application?
===
I have a console application that will be kicked off with a scheduler. If for some reason, part of that file is not able to be built I need a GUI front end so we can run it the next day with specific input.
Is there as way pass parameters to the application entry point to start the console application or the GUI application based on the arguments passed. | 0 | [
2,
2848,
12905,
20,
799,
28,
21,
8650,
54,
9457,
3010,
60,
800,
3726,
3726,
31,
57,
21,
8650,
3010,
30,
129,
44,
5437,
168,
29,
21,
4345,
139,
9,
100,
26,
109,
1215,
15,
141,
16,
30,
3893,
25,
52,
777,
20,
44,
392,
31,
376,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 force a Java subclass to define an Annotation?
===
If a class defined an annotation, is it somehow possible to force its subclass to define the same annotation?
For instance, we have a simple class/subclass pair that share the `@Author @interface.`
What I'd like to do is force each further subclass to define the same `@Author` annotation, preventing a `RuntimeException` somewhere down the road.
TestClass.java:
import java.lang.annotation.*;
@Retention(RetentionPolicy.RUNTIME)
@interface Author { String name(); }
@Author( name = "foo" )
public abstract class TestClass
{
public static String getInfo( Class<? extends TestClass> c )
{
return c.getAnnotation( Author.class ).name();
}
public static void main( String[] args )
{
System.out.println( "The test class was written by "
+ getInfo( TestClass.class ) );
System.out.println( "The test subclass was written by "
+ getInfo( TestSubClass.class ) );
}
}
TestSubClass.java:
@Author( name = "bar" )
public abstract class TestSubClass extends TestClass {}
I know I can enumerate all annotations at runtime and check for the missing `@Author`, but I'd really like to do this at compile time, if possible.
| 0 | [
2,
184,
107,
31,
558,
21,
8247,
972,
1898,
20,
9267,
40,
40,
1270,
857,
60,
800,
3726,
3726,
100,
21,
718,
2811,
40,
40,
1270,
857,
15,
25,
32,
3625,
938,
20,
558,
82,
972,
1898,
20,
9267,
14,
205,
40,
1270,
857,
60,
26,
485... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 all the different ways to create an object in Java?
===
Had a conversation with a coworker the other day about this.
There's the obvious which is to use a constructor, but what other ways are there? | 0 | [
2,
98,
50,
65,
14,
421,
2847,
20,
1600,
40,
3095,
19,
8247,
60,
800,
3726,
3726,
41,
21,
2735,
29,
21,
326,
22560,
14,
89,
208,
88,
48,
9,
80,
22,
18,
14,
4674,
56,
25,
20,
275,
21,
6960,
248,
15,
47,
98,
89,
2847,
50,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Unit Testing in .NET: How to Mock Entity Data Provider
===
Does anyone know whether there's a way to mock Entity Data Provider so Unit Tests don't hit the live data? I found this blog but it seems the project hasn't been released:
http://www.chrisdoesdev.com/index.php/archives/62
Thanks | 0 | [
2,
1237,
4431,
19,
13,
9,
2328,
45,
184,
20,
10506,
9252,
1054,
11747,
800,
3726,
3726,
630,
1276,
143,
1472,
80,
22,
18,
21,
161,
20,
10506,
9252,
1054,
11747,
86,
1237,
4894,
221,
22,
38,
770,
14,
515,
1054,
60,
31,
216,
48,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I open "Find Files" dialog from command-line in Windows XP?
===
I'd like to create a hotkey to search for files under a certain folder in Windows XP; I'm using AutoHotkey to create this shortcut.
Problem is that I need to know a command-line statement to run in order to open the standard Windows "Find Files/Folders" dialog. I've googled for a while and haven't found any page indicating how to do this.
I'm assuming that if I know the command-line statement for bringing up this prompt, it will allow me to pass in a parameter for what folder I want to be searching under. I know you can do this by right-clicking on a folder in XP, so I assume there's some way I could do it on the command line...? | 0 | [
2,
184,
107,
31,
368,
13,
7,
19811,
6488,
7,
28223,
37,
1202,
8,
1143,
19,
1936,
23045,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
1600,
21,
1047,
4237,
20,
2122,
26,
6488,
131,
21,
1200,
19294,
19,
1936,
23045,
73,
31,
22,
79,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Sniffing traffic between a Flex app and ColdFusion backend
===
What is a good strategy for sniffing/tracing function calls between a Flex application and a ColdFusion-based backend running on ColdFusion server? I understand they use AMF protocol.
I'm used to using [Fiddler][1] to sniff transactions between HTTP clients and servers, and it works great as long as you're using plain text or XML HTTP requests and responses (including those over SSL) but it isn't much help for binary protocols like AMF over HTTP.
In my case, I **do** have access to the source code for the client and server, but I'm looking for an easy way to passively sniff traffic in any Flex + ColdFusion situation, without having to tweak anything on the server.
[1]: http://www.fiddlertool.com/fiddler/ | 0 | [
2,
15312,
68,
2227,
128,
21,
14409,
4865,
17,
1191,
9818,
97,
2451,
800,
3726,
3726,
98,
25,
21,
254,
4427,
26,
15312,
68,
118,
1939,
6302,
1990,
3029,
128,
21,
14409,
3010,
17,
21,
1191,
9818,
8,
1281,
97,
2451,
946,
27,
1191,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does Anyone Still Code using "notepad" ?
===
I know we've got all of these nice IDE's out there today. With the way that it intelligently finishes your coding for you or checks syntax as you type - its cool. But.... for those of us who really love to bang out code in a simple editor <add your favorite here>, is it still possible to do this AND, if so, is anyone? I am finally migrating over to VS.NET 2008 from VB 6, ASP, VBScript, etc and before that I came from the mainframe world. I am a straight "notepad" developer. I think the VS.NET IDE is nice, dont get me wrong, but I really miss not being able to bang out some good ol' ASP in notepad and copy it over to the test server to see it run. | 4 | [
2,
630,
1276,
174,
1797,
568,
13,
7,
10280,
8240,
7,
13,
60,
800,
3726,
3726,
31,
143,
95,
22,
195,
330,
65,
16,
158,
2210,
13,
3448,
22,
18,
70,
80,
786,
9,
29,
14,
161,
30,
32,
9214,
102,
13625,
154,
13,
15458,
26,
42,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the canonical way to store arbitrary (possibly marked up) text in SQL?
===
What do wikis/stackoverflow/etc. do when it comes to storing text? Is the text broken at newlines? Is it broken into fixed-length chunks? How do you best store arbitrarily long chunks of text?
| 0 | [
2,
98,
22,
18,
14,
5742,
4272,
161,
20,
1718,
17237,
13,
5,
21628,
2739,
71,
6,
1854,
19,
4444,
255,
60,
800,
3726,
3726,
98,
107,
13,
17375,
18,
118,
25325,
2549,
9990,
118,
1198,
150,
9,
107,
76,
32,
1624,
20,
25615,
1854,
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... |
Messaging solution for a serial hardware device
===
I have a serial hardware device that I'd like to share with multiple applications, that may reside on different machines within a network. This serial device is capable of receiving and sending packets to a wireless network. The software that communicates with the serial device is written in Java, and I'd like to keep it a 100% Java solution, if possible.
I am currently looking at XMPP, using Jive software's Openfire server and Smack API. With this solution, packets coming off the serial device are sent to a chat group, and consumed by any waiting clients. Similarly, any client application may send packets to the serial device, via the Smack API. The Smack API is capable of sending arbitrary objects in a message, but the packets are just byte arrays, so they can be converted to hex strings and sent as text.
I'd like to hear of other possible solutions. I thought of JMS but it seemed a bit too heavyweight. Ultimately I'm looking for the lowest footprint solution that meets my needs. | 0 | [
2,
26437,
4295,
26,
21,
5956,
7610,
3646,
800,
3726,
3726,
31,
57,
21,
5956,
7610,
3646,
30,
31,
22,
43,
101,
20,
1891,
29,
1886,
3767,
15,
30,
123,
14670,
27,
421,
6035,
363,
21,
982,
9,
48,
5956,
3646,
25,
3868,
16,
3396,
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 to convert a date/time to unix time (seconds since 1970) in perl.
===
Bonus question: How to parse a date/time. | 0 | [
2,
184,
20,
8406,
21,
1231,
118,
891,
20,
22540,
85,
13,
5,
5007,
18,
179,
1133,
6,
19,
416,
255,
9,
800,
3726,
3726,
5708,
1301,
45,
184,
20,
2017,
870,
21,
1231,
118,
891,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Can this macro be converted to a function?
===
While refactoring code and ridding myself of all those #defines that we're now taught to hate, I came across this beauty used to calculate the number of elements in a structure:
#define STRUCTSIZE(s) (sizeof(s) / sizeof(*s))
Very useful as it is but can it be converted into an inline function or template?
| 0 | [
2,
92,
48,
9069,
44,
3494,
20,
21,
1990,
60,
800,
3726,
3726,
133,
302,
17455,
68,
1797,
17,
6681,
3258,
992,
16,
65,
273,
6926,
13862,
10652,
30,
95,
22,
99,
130,
2359,
20,
3223,
15,
31,
281,
464,
48,
3679,
147,
20,
18469,
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 I use JUnitPerf with JWebUnit and JUnit 4?
===
I have a series of functional tests against a web application that correctly run, but each require the class level setup and teardown provided with the @BeforeClass and @AfterClass annotations, and hence require JUnit 4.0 or above.
Now I want to perform load testing using a small number of these functional tests, which simulate a large number of users requesting the related page of the web application. In order for each user to have their own "simulated browser" in JWebUnit, I need to use a TestFactory in JUnitPerf to instantiate the class under test, but since JUnit 4 tests are annotated with @Test instead of being derived from TestCase, I'm getting a "TestFactory must be constructed with a TestCase class" exception.
Is anyone successfully using JUnitPerf and its TestFactory with JUnit 4? And what is the secret sauce that lets it all work? | 0 | [
2,
184,
107,
31,
275,
7446,
242,
1432,
410,
29,
487,
14113,
15464,
17,
7446,
242,
268,
60,
800,
3726,
3726,
31,
57,
21,
231,
16,
7652,
4894,
149,
21,
2741,
3010,
30,
12044,
485,
15,
47,
206,
4077,
14,
718,
662,
18161,
17,
5898,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 detect whether Vista UAC is enabled?
===
I need my application to behave differently depending on whether Vista UAC is enabled or not. How can my application detect the state of UAC on the user's computer? | 0 | [
2,
184,
20,
9092,
1472,
13520,
287,
1738,
25,
9338,
60,
800,
3726,
3726,
31,
376,
51,
3010,
20,
14149,
12670,
4758,
27,
1472,
13520,
287,
1738,
25,
9338,
54,
52,
9,
184,
92,
51,
3010,
9092,
14,
146,
16,
287,
1738,
27,
14,
4155,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Why is my program asking for permission to run on Vista?
===
I've just built a VS C++ 6.0 program using VS 2008. When I attempt to run or debug the application, Vista asks for permission. What is it about how the program is built that causes this? The program is being built and run from a subfolder of C:\Dev
[This response][1] from a Microsoft MVP made no sense to me
[1]: http://www.vistax64.com/vista-installation-setup/138053-vista-asks-permission-run-installed-programs.html | 0 | [
2,
483,
25,
51,
625,
3379,
26,
5572,
20,
485,
27,
13520,
60,
800,
3726,
3726,
31,
22,
195,
114,
392,
21,
4611,
272,
20512,
400,
9,
387,
625,
568,
4611,
570,
9,
76,
31,
1735,
20,
485,
54,
121,
16254,
14,
3010,
15,
13520,
3913,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subversion Error: "Working copy [directory] not locked"
===
I am trying to merge a directory in subversion, but I get the following error when I do so:
svn: Working copy '[directory name]' not locked'
Does anyone know how to fix this?
In this instance, the parent directory has the same name as the sub directory. I don't know if this has anything to do with the error though. | 0 | [
2,
972,
10898,
7019,
45,
13,
7,
14120,
4344,
636,
10197,
93,
500,
52,
4011,
7,
800,
3726,
3726,
31,
589,
749,
20,
12666,
21,
16755,
19,
972,
10898,
15,
47,
31,
164,
14,
249,
7019,
76,
31,
107,
86,
45,
13,
18,
16578,
45,
638,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 I catch exceptions only to log them?
===
Should I catch exceptions for logging purposes?
<pre>
public foo(..)
{
try
{
...
} catch (Exception ex) {
Logger.Error(ex);
throw;
}
}
</pre>
If I have this in place in each of my layers (DataAccess, Business and WebService) it means the exception is logged several times.
Does it make sense to do so if my layers are in separate projects and only the public interfaces have try/catch in them?
Why? Why not? Is there a different approach I could use? | 0 | [
2,
378,
31,
2949,
13392,
104,
20,
6738,
105,
60,
800,
3726,
3726,
378,
31,
2949,
13392,
26,
13,
13919,
4612,
60,
13,
1,
3515,
1,
317,
4310,
111,
5,
9,
9,
6,
13,
1,
1131,
13,
1,
13,
9,
9,
9,
13,
1,
2949,
13,
5,
10066,
872... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Overriding a MIME type in Rails
===
I want to override the JSON MIME type ("application/json") in Rails to ("text/x-json"). I tried to register the MIME type again in mime_types.rb but that didn't work. Any suggestions?
Thanks. | 0 | [
2,
84,
5175,
68,
21,
26193,
1001,
19,
2240,
18,
800,
3726,
3726,
31,
259,
20,
84,
11891,
14,
487,
528,
26193,
1001,
13,
5,
7,
2552,
20669,
118,
728,
528,
7,
6,
19,
2240,
18,
20,
13,
5,
7,
11969,
118,
396,
8,
728,
528,
7,
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... |
Is there any benefit to using Cocoa's version of MVC with .NET?
===
There's a diagram depicting the difference between traditional MVC and Cocoa MVC here:
http://developer.apple.com/documentation/Cocoa/Conceptual/CocoaFundamentals/CocoaDesignPatterns/chapter_5_section_4.html#//apple_ref/doc/uid/TP40002974-CH6-SW22
Are there any benefits of doing it the "Cocoa" way in .NET using Visual Studio? | 0 | [
2,
25,
80,
186,
4234,
20,
568,
24507,
22,
18,
615,
16,
307,
8990,
29,
13,
9,
2328,
60,
800,
3726,
3726,
80,
22,
18,
21,
14161,
11235,
14,
2841,
128,
1361,
307,
8990,
17,
24507,
307,
8990,
235,
45,
7775,
6903,
26051,
106,
9,
24... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
While coding, how many columns do you format for?
===
in the old days everything was 80 columns. so if you wanted your code to be readable, you'd make it fit. but that's not the case anymore with wider and wider screens, so how long of line is too long? | 0 | [
2,
133,
13,
15458,
15,
184,
151,
7498,
107,
42,
2595,
26,
60,
800,
3726,
3726,
19,
14,
315,
509,
796,
23,
2972,
7498,
9,
86,
100,
42,
417,
154,
1797,
20,
44,
1302,
579,
15,
42,
22,
43,
233,
32,
2742,
9,
47,
30,
22,
18,
52,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to determine the Schemas inside an Oracle Data Pump Export file.
===
I was given an Oracle database backup (.dmp file), which was created with expdp. Besides this I have no information about the file.
I need to inspect the .dmp file and list all of the schemas in it, how do i do that?
One constraint, I cannot restore the entire database within the backup.So to import the backup per schema, the impdp command requires you to list the schemas you wish to import, and I dont have that list. | 0 | [
2,
184,
20,
3746,
14,
23874,
18,
572,
40,
15759,
1054,
9786,
7487,
3893,
9,
800,
3726,
3726,
31,
23,
504,
40,
15759,
6018,
10119,
13,
5,
9,
43,
2554,
3893,
6,
15,
56,
23,
679,
29,
13,
6899,
7431,
9,
3410,
48,
31,
57,
90,
676... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JQuery error option in $.ajax utility
===
The documentation indicates that the error: option function will make available: XHR instance, a status message string (in this case always error) and an optional exception object returned from the XHR instance (Book: JQuery in Action)
Using the following (in the $.ajax call) I was able to determine I had a "parsererror" and a "timeout" (since I added the timeout: option) error
error: function(request, error){}
What are other things you evaluate in the error option? do you include the optional exception object?
This is a complete $.ajax call:
$.ajax({
type: "post",
url: "http://myServer/cgi-bin/broker" ,
dataType: "text",
data: {
'_service' : 'myService',
'_program' : 'myProgram',
'start' : start,
'end' : end
},
beforeSend: function() {
$("#loading").removeClass("hide");
},
timeout: 5000,
error: function(request,error) {
$("#loading").addClass("hide");
if (error = "timeout") {
$("#error").append("The request timed out, please resubmit");
}
else {
$("#error").append("ERROR: " + error);
}
},
success: function(request) {
$("#loading").addClass("hide");
var t = eval( "(" + request + ")" ) ;
} // End success
}); // End ajax method
Thanks for the input
| 0 | [
2,
487,
8190,
93,
7019,
4255,
19,
5579,
9,
6881,
7522,
10082,
800,
3726,
3726,
14,
13945,
6475,
30,
14,
7019,
45,
4255,
1990,
129,
233,
904,
45,
993,
3112,
4851,
15,
21,
1782,
2802,
3724,
13,
5,
108,
48,
610,
550,
7019,
6,
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... |
XNA File Load
===
In XNA, how do I load in a texture or mesh from a file without using the content pipeline? | 0 | [
2,
993,
325,
3893,
6305,
800,
3726,
3726,
19,
993,
325,
15,
184,
107,
31,
6305,
19,
21,
12714,
54,
55,
1635,
37,
21,
3893,
366,
568,
14,
2331,
12250,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to build a 64-bit .NET DLL, with 64-bit COM interop?
===
I need to build a managed DLL, targeted for x64, and expose it via x64 COM. I need a walk through, good article, etc...
Interop is fairly straightforward, but when you talk about x64 on both sides, I can't find anything. | 0 | [
2,
184,
20,
1895,
21,
4384,
8,
3326,
13,
9,
2328,
13,
43,
211,
15,
29,
4384,
8,
3326,
13,
960,
1480,
2594,
60,
800,
3726,
3726,
31,
376,
20,
1895,
21,
1471,
13,
43,
211,
15,
9536,
26,
993,
3470,
15,
17,
13833,
32,
1197,
993,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a file with su/sudo inside Emacs
===
Suppose I want to open a file in an existing Emacs session using `su` or `sudo`, without dropping down to a shell and doing `sudoedit` or `sudo emacs`. One way to do this is
(require 'tramp)
C-c C-f /sudo::/path/to/file
but this requires an expensive [round-trip through SSH][1]. Is there a more direct way?
[1]: http://www.gnu.org/software/tramp/ | 0 | [
2,
368,
21,
3893,
29,
2538,
118,
18,
18601,
572,
13,
62,
6893,
18,
800,
3726,
3726,
5787,
31,
259,
20,
368,
21,
3893,
19,
40,
3149,
13,
62,
6893,
18,
3723,
568,
13,
1,
1666,
1,
54,
13,
1,
18,
18601,
1,
15,
366,
6780,
125,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 characteristic to a just-in-time (JIT) compiler?
===
What does a JIT compiler specifically do as opposed to a non-JIT compiler? Can someone give a succinct and easy to understand example of this?
| 0 | [
2,
98,
25,
7326,
20,
21,
114,
8,
108,
8,
891,
13,
5,
13803,
6,
21486,
60,
800,
3726,
3726,
98,
630,
21,
13,
13803,
21486,
3524,
107,
28,
3499,
20,
21,
538,
8,
13803,
21486,
60,
92,
737,
590,
21,
13,
29437,
4812,
17,
2010,
20... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Does an application-wide exception handler make sense?
===
Long story short, I have a substantial Python application that, among other things, does outcalls to "losetup", "mount", etc. on Linux. Essentially consuming system resources that must be released when complete.
If my application crashes, I want to ensure these system resources are properly released.
Does it make sense to do something like the following?
def main():
# TODO: main application entry point
pass
def cleanup():
# TODO: release system resources here
pass
if __name__ == "__main__":
try:
main()
except:
cleanup()
raise
Is this something that is typically done? Is there a better way? Perhaps the destructor in a singleton class? | 0 | [
2,
630,
40,
3010,
8,
8077,
5391,
24641,
233,
1259,
60,
800,
3726,
3726,
175,
609,
502,
15,
31,
57,
21,
6185,
20059,
3010,
30,
15,
497,
89,
564,
15,
630,
70,
9200,
18,
20,
13,
7,
1415,
3554,
576,
7,
15,
13,
7,
9780,
7,
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... |
When should I consider changing thread priority
===
I once was asked to increase thread priority to fix a problem. I refused, saying that changing it was dangerous and was not the root cause of the problem.
My question is, under what circumstannces *should* I conider changing priority of threads? | 0 | [
2,
76,
378,
31,
3563,
4226,
9322,
9857,
800,
3726,
3726,
31,
382,
23,
411,
20,
1839,
9322,
9857,
20,
6098,
21,
1448,
9,
31,
2453,
15,
1148,
30,
4226,
32,
23,
3342,
17,
23,
52,
14,
5900,
1679,
16,
14,
1448,
9,
51,
1301,
25,
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... |
oAuth REST and C# What's the missing piece
===
I found a library that makes it easy to get my oAuth_token and oAuth_token_secret with c#. If I'm trying to make a POST to a RESTful web service (ie. http://brightkite.com/places/356a192b7913b04c54574d18c28d46e6395428ab/checkins) how are those two keys leveraged to varify authentication. A C# example would be awesome! | 0 | [
2,
635,
1346,
96,
760,
17,
272,
5910,
98,
22,
18,
14,
2863,
1855,
800,
3726,
3726,
31,
216,
21,
1248,
30,
1364,
32,
2010,
20,
164,
51,
635,
1346,
96,
1,
262,
2853,
17,
635,
1346,
96,
1,
262,
2853,
1,
17902,
29,
272,
5910,
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... |
comparison of ways to maintain state
===
There are various ways to maintain user state using in web development.
These are the ones that I can think of right now:
1. Query String
2. Cookies
3. Form Methods (Get and Post)
4. Viewstate (ASP.NET only I guess)
5. Session (InProc Web server)
6. Session (Dedicated web server)
7. Session (Database)
etc.
I know that each method has its own advantages and disadvantages like cookies not being secure and QueryString having a length limit and being plain ugly to look at! ;)
But, when designing a web application I am always confused as to what methods to use for what application or what methods to avoid.
What I would like to know is what method(s) do you generally use and would recommend or more interestingly which of these methods would you like to avoid in certain scenarios and why? | 0 | [
2,
6050,
16,
2847,
20,
4027,
146,
800,
3726,
3726,
80,
50,
617,
2847,
20,
4027,
4155,
146,
568,
19,
2741,
522,
9,
158,
50,
14,
53,
18,
30,
31,
92,
277,
16,
193,
130,
45,
137,
9,
25597,
3724,
172,
9,
19396,
203,
9,
505,
3195,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
VB.Net (or C#) 2008 Multi Threaded Import
===
I am looking to build a multi-threaded text import facility (generally CSV into SQL Server 2005) and would like to do this in VB.NET but I am not against C#. I have VS 2008 trial and just dont know where to begin. Can anyone point me in the direction of where I can look at and play with the source of a *VERY* simple multi-threaded application for VS 2008?
Thanks! | 0 | [
2,
13,
20468,
9,
2328,
13,
5,
248,
272,
5910,
6,
570,
1889,
9322,
69,
9010,
800,
3726,
3726,
31,
589,
699,
20,
1895,
21,
1889,
8,
96,
10647,
69,
1854,
9010,
2646,
13,
5,
22787,
272,
18,
710,
77,
4444,
255,
8128,
812,
6,
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 do you promote/advertise/evangelize your open source project?
===
How do you promote/advertise/evangelize your open source project?
I know about sourceforge and freshmeat, and they gave me some initial traffic, but I'd like to push for a greater audience. Once a critical mass is reached, I won't have to push anymore, but what methods can I use to draw eyeballs.
Of course holding those eyeballs depends upon the quality of the project, but that is another issue. | 2 | [
2,
184,
107,
42,
3947,
118,
22898,
2628,
118,
2443,
13539,
2952,
154,
368,
1267,
669,
60,
800,
3726,
3726,
184,
107,
42,
3947,
118,
22898,
2628,
118,
2443,
13539,
2952,
154,
368,
1267,
669,
60,
31,
143,
88,
1267,
1106,
834,
17,
31... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the easiest way to convert from asp classic to asp.net?
===
I am a .Net developer that has been tasked with upgrading a classic asp website to asp.net. The website is currently running on luck and bubble gum but there is not enough time or money to stop progress and do a full rewrite. Of course I will still need to be able to deliver new features while I am upgrading.
What strategies should I use to make a smooth gradual change to asp.net? Should I convert to a single tier .net solution and then refactor to a proper multi-tier solution or should I design my business and data layers now? Should I go straight to 3.5 or is it easier to just get to 1.1 and upgrade to 2.0 or 3.5 after? | 0 | [
2,
98,
25,
14,
27237,
161,
20,
8406,
37,
28,
306,
2732,
20,
28,
306,
9,
2328,
60,
800,
3726,
3726,
31,
589,
21,
13,
9,
2328,
10058,
30,
63,
74,
14605,
29,
26939,
21,
2732,
28,
306,
2271,
20,
28,
306,
9,
2328,
9,
14,
2271,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 convert floats to human-readable fractions?
===
Let's say we have 0.33, we need to output "1/3". <br />
If we have "0.4", we need to output "2/5".
The idea is to make it human-readable to make the user understand "x parts out of y" as a better way of understanding data.
I know that percentages is a good substitute but I was wondering if there was a simple way to do this? | 0 | [
2,
184,
20,
8406,
11510,
18,
20,
585,
8,
10647,
579,
10885,
18,
60,
800,
3726,
3726,
408,
22,
18,
395,
95,
57,
713,
9,
4048,
15,
95,
376,
20,
5196,
13,
7,
8197,
240,
7,
9,
13,
1,
5145,
13,
118,
1,
100,
95,
57,
13,
7,
387... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why does an onclick property set with setAttribute fail to work in IE?
===
Ran into this problem today, posting in case someone else has the same issue.
var execBtn = document.createElement('input');
execBtn.setAttribute("type", "button");
execBtn.setAttribute("id", "execBtn");
execBtn.setAttribute("value", "Execute");
execBtn.setAttribute("onclick", "runCommand();");
Turns out to get IE to run an onclick on a dynamically generated element, we can't use setAttribute. Instead, we need to set the onclick property on the object with an anonymous function wrapping the code we want to run.
execBtn.onclick = function() { runCommand() }; | 0 | [
2,
483,
630,
40,
27,
150,
10129,
1354,
309,
29,
309,
721,
14755,
7476,
20,
170,
19,
13,
660,
60,
800,
3726,
3726,
717,
77,
48,
1448,
786,
15,
15669,
19,
610,
737,
962,
63,
14,
205,
1513,
9,
4033,
1396,
3319,
220,
38,
103,
800,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.