unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Receive parameter from request body in WCF/ADO.NET Data Service
===
I'm tryint to post to a ADO.NET Data Service but the parameters seems to get lost along the way.
I got something like:
[WebInvoke(Method="POST")]
public int MyMethod(int foo, string bar) {...}
and I make an ajax-call using prototype.js as:
var args = {foo: 4, bar: "'test'"};
new Ajax.Requst(baseurl + 'MyMethod',
method: 'POST',
parameters: args,
onSuccess: jadda,
onFailure: jidda
}
If I replace "method: 'POST'" with "method: 'GET'" and "WebInvoke(Method="POST")" with "WebGet" everything works but now (using post) all I get is:
> Bad Request - Error in query syntax.
from the service.
The only fix (that I don't want to use) is to send all parameters in the URL even when I perform a post. Any ideas are welcome. | 0 | [
2,
2588,
18906,
37,
3772,
358,
19,
11801,
410,
118,
5672,
9,
2328,
1054,
365,
800,
3726,
3726,
31,
22,
79,
1131,
6391,
20,
678,
20,
21,
21,
537,
9,
2328,
1054,
365,
47,
14,
12905,
2206,
20,
164,
529,
303,
14,
161,
9,
31,
330,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 come you can create an interface instance in Office Interop?
===
I've seen this quite a few times while using Office Interop classes
this.CustomXMLParts.Add(MyResources.Data, new Office.CustomXMLSchemaCollection());
If I hover over the CustomXMLSchemaCollection class, it shows up as an interface. Then how come I can do a new on it ? What gives?
BTW this code compiles and works. | 0 | [
2,
184,
340,
42,
92,
1600,
40,
6573,
4851,
19,
488,
1480,
2594,
60,
800,
3726,
3726,
31,
22,
195,
541,
48,
1450,
21,
310,
436,
133,
568,
488,
1480,
2594,
2684,
48,
9,
4636,
6015,
396,
8184,
3091,
18,
9,
14854,
5,
915,
99,
1209... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 look up an ejb in jBoss 4.2?
===
I have a simple j2ee application:
foo.ear
- foo.war
- foo.jar (ejb3 jar)
I am deploying into jBoss 4.2.2, which is J2EE 1.4 compliant, with an ejb3 jar deployer. Thus, at present it is not possible to use the @EJB annotation in servlets. In a regular 1.4 j2EE app I could use a `<ejb-local-ref>` element in my web.xml, however, because my ejb's are v3 they have no `<local-home>` interface. Can anyone suggest a JEE compliant way to look up my ejb from the a servlet, **without resorting to a platform specific JNDI lookup**? | 0 | [
2,
184,
107,
31,
361,
71,
40,
13,
10022,
220,
19,
487,
10349,
18,
268,
9,
135,
60,
800,
3726,
3726,
31,
57,
21,
1935,
487,
135,
2851,
3010,
45,
4310,
111,
9,
10717,
13,
8,
4310,
111,
9,
1885,
13,
8,
4310,
111,
9,
6300,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get Asp.Net to redirect user back to their starting point.
===
Guys, I’ve been writing code for 15+ years, but managed to avoid “Web Development” until 3 months ago.
I have inherited a legacy Asp.net application (started in .net 1.1, we’re now on .Net 2.0), it’s the administration tool for our product.
In several places the admin tool simply maintains long lists of values.
The list (could be 200+ items) appear in a GridView (Page A), user clicks an edit button for an item, this brings them to an edit page for the item (Page B) where they can change the value (or values, an item in the list may be associated with several values e.g. name and address and preferred colour, breed of cat . . .)
Currently when the user presses “Save” on Page B, we redirect back to Page A. The page opens at the top of the list, this annoys the user as often several items in sequence will need to be configured together, and the user needs to 1. Remember which item they just edited, 2. scroll down to that item
What I want to do is have the list bring the user back to the item they just edited, as often several items in sequence will need to be configured together.
**Fastest Gun Stop** . . . and keep reading
1. Suggestions on the lines of “regroup the items so there are fewer in the list” will be considered unhelpful
2. Valid points that .Net 3.5 does this automatically, will be considered unhelpful by me (but post them anyway, it may help some other poor fool)
3. I think I could do this by posting the Id of the edited item when re-loading Page A, and scrolling the grid to this point, however **My Question is** . . .
Is there a feature to do this that I don’t know about (and what is it)
and/or
What is the accepted way of doing this?
Thanks in advance
B. Worrier | 0 | [
2,
184,
20,
164,
28,
306,
9,
2328,
20,
302,
14706,
4155,
97,
20,
66,
1422,
454,
9,
800,
3726,
3726,
2776,
15,
31,
1,
195,
74,
1174,
1797,
26,
357,
2430,
122,
15,
47,
1471,
20,
2658,
13,
1,
14113,
522,
1,
163,
203,
818,
1464,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are there any pitfalls / things you need to know when changing from MyISAM to InnoDB
===
One of my projects use the MyISAM engine in MySQL, but I'm considering changing it to InnoDB as I need transaction support here and there.
+ What should I look at or consider before doing this?
+ Can I just change the engine, or should the data be prepared for it? | 0 | [
2,
50,
80,
186,
4175,
5660,
18,
13,
118,
564,
42,
376,
20,
143,
76,
4226,
37,
51,
49,
6101,
20,
19,
251,
9007,
800,
3726,
3726,
53,
16,
51,
2314,
275,
14,
51,
49,
6101,
1406,
19,
51,
18,
22402,
15,
47,
31,
22,
79,
5154,
42... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I load a 32 bit DLL into a 64 bit process on Windows?
===
I recently upgraded a c# windows service to run as a 64 bit .net process. Normally, this would be trivial, but the system makes use of a 32-bit DLL written in C++. It is not an option to convert this DLL to 64 bit, so I wrapped the DLL in a separate 32 bit .net process and exposed a .net interface via remoting.
This is quite a reliable solution, but I would prefer to run the system as a single process. Is there any way I can load my 32 bit DLL into a 64 bit process and access it directly (perhaps through some sort of thunking layer)? | 0 | [
2,
92,
31,
6305,
21,
2512,
1142,
13,
43,
211,
77,
21,
4384,
1142,
953,
27,
1936,
60,
800,
3726,
3726,
31,
1989,
9958,
21,
272,
5910,
1936,
365,
20,
485,
28,
21,
4384,
1142,
13,
9,
2328,
953,
9,
4147,
15,
48,
83,
44,
13,
1971... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 pointers that a software requirement is in fact political?
===
Probably an easy one:
**Are there any rules of thumb or pointers that could help recognise political requirements?**
Let’s say one of stakeholders (your boss, a head of another department or an actual user) asks for a feature or particular characteristic of software being developed by yourself or your team. Is there a litmus test to determine whether requirement is political?
This question is really simple and is not about how to deal with political requirements or whether they are bad or good for software. How do you tell that whatever you have been asked to do is to pursue someone’s tacit or actually openly stated political agenda?
| 0 | [
2,
254,
454,
445,
30,
21,
2306,
8981,
25,
19,
837,
675,
60,
800,
3726,
3726,
910,
40,
2010,
53,
45,
13,
1409,
1509,
80,
186,
1761,
16,
5078,
54,
454,
445,
30,
110,
448,
16945,
675,
4786,
60,
1409,
408,
1,
18,
395,
53,
16,
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... |
In Eclipse, what can cause Package Explorer "red-x" error-icon when all Java sources compile without errors?
===
I'm using Eclipse for Java development. All my sources compile fine and the resulting application compiles fine. However, I keep getting an "red-x" error notification in the Package Explorer, like this:
![Snapshot of my Eclipse Package Explorer with the error notification icon on my src/sys package][1]
All my sources in this source directory (too long for the snapshot) compile fine, none of the show the "red-x" error icon.
Any suggestions on how to fix the problem would be highly appreciated.
[1]: http://www.freeimagehosting.net/uploads/ef31d95209.png | 0 | [
2,
19,
11652,
15,
98,
92,
1679,
6030,
8520,
13,
7,
2095,
8,
396,
7,
7019,
8,
49,
1126,
76,
65,
8247,
2662,
26561,
366,
11908,
60,
800,
3726,
3726,
31,
22,
79,
568,
11652,
26,
8247,
522,
9,
65,
51,
2662,
26561,
1123,
17,
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... |
What kind of behaviour causes an interrupted exception?
===
I'm relatively new to Threading in Java and I've noticed that everytime I use Thread.sleep() I have to catch InterrupetdException.
What kind of behaviour causes this, and in simple applications where I have a monitor thread can I just Ignore the exception? | 0 | [
2,
98,
825,
16,
7727,
4047,
40,
6354,
5391,
60,
800,
3726,
3726,
31,
22,
79,
3109,
78,
20,
9322,
68,
19,
8247,
17,
31,
22,
195,
2711,
30,
352,
891,
31,
275,
9322,
9,
21092,
5,
6,
31,
57,
20,
2949,
1480,
7964,
1198,
43,
10066... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What can I do if a Java VM crash repeatedly?
===
What is the best practice to solve a Java VM crash if the follow conditions are true:
- No own or third party native code. 100% pure java
- The same program run on many other system without any problems.
PS: With VM crash I means that the VM write a dump file like hs_err_pid1234.log and terminate. | 0 | [
2,
98,
92,
31,
107,
100,
21,
8247,
13,
20147,
4597,
8081,
60,
800,
3726,
3726,
98,
25,
14,
246,
1345,
20,
8402,
21,
8247,
13,
20147,
4597,
100,
14,
1740,
2039,
50,
1151,
45,
13,
8,
90,
258,
54,
422,
346,
1275,
1797,
9,
12849,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Removing Duplicate Images
===
We have a collection of photo images sizing a few hundred gigs. A large number of the photos are visually duplicates, but with differing filesizes, resolution, compression etc.
Is it possible to use any specific image processing methods to search out and remove these duplicate images? | 0 | [
2,
9096,
19429,
3502,
800,
3726,
3726,
95,
57,
21,
1206,
16,
3056,
3502,
13,
18,
3335,
21,
310,
1874,
7175,
18,
9,
21,
370,
234,
16,
14,
7064,
50,
20747,
19429,
18,
15,
47,
29,
19304,
6488,
13569,
15,
4302,
15,
14864,
2722,
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... |
Business Interface pattern with EJB with Remote as well as local interfaces
===
How can I use Business Interface pattern with an EJB (session bean) with Local as well remote interfaces? | 0 | [
2,
508,
6573,
3732,
29,
13,
10022,
220,
29,
5388,
28,
134,
28,
375,
6573,
18,
800,
3726,
3726,
184,
92,
31,
275,
508,
6573,
3732,
29,
40,
13,
10022,
220,
13,
5,
7202,
5991,
15322,
6,
29,
375,
28,
134,
5388,
6573,
18,
60,
3,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Where is the documentation for My class?
===
No I'm not being a wise guy ...
For those fortunate enough to not know the My class: It's something that was **added in VB 2005 (and doesn't exist in C#) and is best described as a 'speeddial for the .net framework'.**
Supposed to make life easier for newbies who won't read which framework classes they should be using
Dim contents As String
contents = My.Computer.FileSystem.ReadAllText("c:\mytextfile.txt")
Instead of this:
Dim contents As String
contents = IO.File.ReadAllText("c:\mytextfile.txt")
My Question: **Where is the MSDN documentation page for which speeddial button maps to what.. ?**
By choosing the name of the class as My - they've just made searching a whole lot more fun that it needs to be. I need to code in C# and can't bear the fun of translating the training/how-to office prog videos which exclusively deal in VB.
More on this from the Dans
- http://msdn.microsoft.com/en-us/magazine/cc163972.aspx
- http://blogs.msdn.com/danielfe/archive/2005/06/14/429092.aspx
Juval Lowy ported My as That in C# as an interim solution. Don't ask me why...
| 0 | [
2,
113,
25,
14,
13945,
26,
51,
718,
60,
800,
3726,
3726,
90,
31,
22,
79,
52,
142,
21,
6714,
1244,
13,
9,
9,
9,
26,
273,
22446,
511,
20,
52,
143,
14,
51,
718,
45,
32,
22,
18,
301,
30,
23,
13,
1409,
14854,
69,
19,
13,
2046... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Defaulting WebParts on a Users MySite in Sharepoint
===
I am working on a project that is replacing an old portal system (Plumtree) with sharepoint and we want to make the transition as smooth as possible.
One thing we are look at currently is taking all the gadgets (Plumtree term for WebParts) and making sure they appear in the same place on the users new MySite.
Plumtree holds this information in a simple table containing the user, page, gadget and position information. I want to find a way to automate reading this table and putting the new WebParts on the users MySite and not have to manually set it up for hundreds of users.
I'm told modifying Sharepoint tables in SQL Server directly is not a good option as it may affect our support arrangements, but if it saves doing this by hand then I would concider it.
Other options that spring to mind are creating a equivalent table and using API calls to load the WebParts the first time the user accesses their MySite.
Any better suggestions? | 0 | [
2,
12838,
68,
2741,
3091,
18,
27,
21,
3878,
51,
9097,
19,
1891,
3132,
800,
3726,
3726,
31,
589,
638,
27,
21,
669,
30,
25,
5496,
40,
315,
8281,
329,
13,
5,
306,
4404,
8101,
6,
29,
1891,
3132,
17,
95,
259,
20,
233,
14,
4513,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to generate empty definitions given a header file
===
I have a 3rd-party library which for various reasons I don't wish to link against yet. I don't want to butcher my code though to remove all reference to its API, so I'd like to generate a dummy implementation of it.
Is there any tool I can use which spits out empty definitions of classes given their header files? It's fine to return nulls, false and 0 by default. I don't want to do anything on-the-fly or anything clever - the mock object libraries I've looked at appear quite heavy-weight? Ideally I want something to use like
$ generate-definition my_header.h > dummy_implemtation.cpp
I'm using Linux, GCC4.1 | 0 | [
2,
184,
20,
7920,
2424,
18544,
504,
21,
157,
106,
3893,
800,
3726,
3726,
31,
57,
21,
203,
897,
8,
9635,
1248,
56,
26,
617,
2932,
31,
221,
22,
38,
2536,
20,
3508,
149,
768,
9,
31,
221,
22,
38,
259,
20,
13768,
51,
1797,
362,
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... |
Customising word separators in vi
===
vi treats dash and space as word separators for commands such as dw and cw.
Is there a way to add underscore as well ?
I quite often want to change part of a variable name containing underscores
e.g. change src_branch to dest_branch
I end up counting characters and using s (e.g. 3sdest) whereas it would be much easier to use cw (e.g. cwdest) | 0 | [
2,
5816,
7552,
833,
1353,
3574,
9922,
19,
1790,
800,
3726,
3726,
1790,
5752,
18,
8405,
17,
726,
28,
833,
1353,
3574,
9922,
26,
14294,
145,
28,
15952,
17,
15739,
9,
25,
80,
21,
161,
20,
3547,
131,
15077,
28,
134,
13,
60,
31,
1450... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a Delphi implementation of Google Data APIs?
===
Google offers [various libraries][1] for interfacing with the Google Data APIs. Currently these do not include Delphi (Win32) support.
Has anyone done any work on a Delphi interface to Google Data, or the underlying Atom/AtomPub protocols?
[1]: http://code.google.com/apis/gdata/clientlibs.html | 0 | [
2,
25,
80,
21,
23030,
6123,
16,
8144,
1054,
21,
8954,
60,
800,
3726,
3726,
8144,
2486,
636,
8220,
1291,
8649,
500,
2558,
165,
500,
26,
1480,
17231,
29,
14,
8144,
1054,
21,
8954,
9,
871,
158,
107,
52,
468,
23030,
13,
5,
4181,
312... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Parsing different date formats from feedparser in python?
===
I'm trying to get the dates from entries in two different RSS feeds through [feedparser][1].
Here is what I'm doing:
import feedparser as fp
reddit = fp.parse("http://www.reddit.com/.rss")
cc = fp.parse("http://contentconsumer.com/feed")
print reddit.entries[0].date
print cc.entries[0].date
And here's how they come out:
2008-10-21T22:23:28.033841+00:00
Wed, 15 Oct 2008 10:06:10 +0000
I want to get to the point where I can find out which is newer easily.
I've tried using the datetime module of Python and searching through the feedparser documentation, but I can't get past this problem. Any help would be much appreciated.
[1]: http://feedparser.org | 0 | [
2,
2017,
18,
68,
421,
1231,
13767,
37,
4063,
3574,
4104,
19,
20059,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
164,
14,
4076,
37,
11399,
19,
81,
421,
13,
1224,
18,
17058,
120,
636,
20954,
3574,
4104,
500,
2558,
165,
500,
9,
235,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 force uninstallation of windows service
===
I installed a windows service using installUtil.exe.
After updating the code I used intallUtil.exe again to install the service w/o uninstalling the original version first.
When I now try to uninstall the service, installUtil.exe completes the uninstall successfully, but the service still appears.
If I try to change its properties, I receive the message 'service is marked for deletion'.
How can I force the deletion (preferrably w/o restarting the server)? | 0 | [
2,
184,
20,
558,
367,
108,
21300,
857,
16,
1936,
365,
800,
3726,
3726,
31,
4066,
21,
1936,
365,
568,
16146,
14255,
9,
1706,
62,
9,
75,
71,
43,
1880,
14,
1797,
31,
147,
19,
38,
1233,
14255,
9,
1706,
62,
188,
20,
16146,
14,
365,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
calling managed code from unmanaged code
===
I want to call my .NET code from unmanaged C++. My process entrypoint is .NET based, so I don't have to worry about hosting the CLR. I know it can be done using COM wrappers for .NET objects, but I would like to access individual static methods of managed classes, so COM isn't my shortest/easiest route.
Thanks! | 0 | [
2,
2555,
1471,
1797,
37,
367,
177,
8030,
1797,
800,
3726,
3726,
31,
259,
20,
645,
51,
13,
9,
2328,
1797,
37,
367,
177,
8030,
272,
20512,
9,
51,
953,
2792,
3132,
25,
13,
9,
2328,
432,
15,
86,
31,
221,
22,
38,
57,
20,
3189,
88... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 XML serialization library for a MFC C++ app
===
I have an application, written in C++ using MFC and Stingray libraries. The application works with a wide variety of large data types, which are all currently serialized based on MFC Document/View serialize derived functionality. I have also added options for XML serialization based on the Stingray libraries, which implements DOM via the Microsoft XML SDK. While easy to implement the performance is terrible, to the extent that it is unusable on anything other than very small documents.
What other XML serialization tools would you folks recommend for this scenario. I don't want DOM, as it seems to be a memory hog, and I'm already dealing with large in memory data. Ideally, i'd like a streaming parser that is fast, and easy to use with MFC. My current front runner is [expat][1] which is fast and simple, but would require a lot of class by class serialization code to be added. Any other efficient and easier to implement alternatives out there that people would recommend?
[1]: http://expat.sourceforge.net/ | 0 | [
2,
246,
23504,
5956,
1829,
1248,
26,
21,
307,
7061,
272,
20512,
4865,
800,
3726,
3726,
31,
57,
40,
3010,
15,
642,
19,
272,
20512,
568,
307,
7061,
17,
8210,
2787,
8649,
9,
14,
3010,
693,
29,
21,
1051,
1747,
16,
370,
1054,
2551,
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... |
git-upload-pack: command not found, how to fix this correctly
===
I have been using git to keep two copies of my project in sync, one is my local box, the other the test server.
This is an issue which occurs when I log onto our remote development server using ssh;
git clone me@me.mydevbox.com:/home/chris/myproject
Initialized empty Git repository in /tmp/myproject/.git/
Password:
bash: git-upload-pack: command not found
fatal: The remote end hung up unexpectedly
fetch-pack from 'me@me.mydevbox.com:/home/chris/myproject' failed.
(I have changed the file names a little to protect the guilty!)
I have done some digging, if I add --upload-pack=`which git-upload-pack` the command works, (and proves that $PATH contains the path to 'git-upload-pack' as per the RTFM solution) but this is really annoying, plus 'git push' doesn't work, because I don't think there is a --unpack= option.
Incidentally, all the git commands work fine from my local box, it is the same version of the software (1.5.4.2), installed on the same NFS mount at /usr/local/bin.
Can anybody help?
| 0 | [
2,
13,
10404,
8,
576,
8294,
8,
8573,
45,
1202,
52,
216,
15,
184,
20,
6098,
48,
12044,
800,
3726,
3726,
31,
57,
74,
568,
13,
10404,
20,
643,
81,
3298,
16,
51,
669,
19,
6063,
150,
15,
53,
25,
51,
375,
1649,
15,
14,
89,
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... |
SQL Server query execution plan shows wrong "actual row count" on an used index and performance is terrible slow
===
Today i stumbled upon an interesting performance problem with a stored procedure running on Sql Server 2005 SP2 in a db running on compatible level of 80 (SQL2000).
The proc runs about 8 Minutes and the execution plan shows the usage of an index with an actual row count of 1.339.241.423 which is about factor 1000 higher than the "real" actual rowcount of the table which is 1.144.640 as shown correctly by estimated row count.
Interestingly enough, when i copy the procs parameter values inside the proc to local variables and than use the local variables in the actual query, everything works fine - the proc runs 18 seconds and the execution plan shows the right actual row count.
I have done dbcc dbreindex already without any success.
dbcc show_statistics shows good data for the index, too.
The proc is created WITH RECOMPILE so every time it runs a new execution plan is getting compiled.
Any ideas?
Anybody out there who knows where Sql Server gets the actual row count value from when calculating query plans?
![alt text][1]
[1]: http://img520.imageshack.us/img520/4259/arcsr9.png | 0 | [
2,
4444,
255,
8128,
25597,
5769,
944,
1285,
1389,
13,
7,
5183,
6948,
3131,
2468,
7,
27,
40,
147,
4348,
17,
956,
25,
5803,
2276,
800,
3726,
3726,
786,
31,
10282,
685,
40,
4883,
956,
1448,
29,
21,
8214,
7004,
946,
27,
4444,
255,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Wordpress Admin Plugin
===
I'm wondering how I can make a plugin to output some data via the admin panel.
Just to get me going what code would make a page in the admin panel (for only administrators) to display time()? | 0 | [
2,
833,
5890,
21,
43,
2160,
10922,
108,
800,
3726,
3726,
31,
22,
79,
5712,
184,
31,
92,
233,
21,
10922,
108,
20,
5196,
109,
1054,
1197,
14,
21,
43,
2160,
4113,
9,
114,
20,
164,
55,
228,
98,
1797,
83,
233,
21,
2478,
19,
14,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0... |
Exposing an enum from a library class
===
In C#, I am using a library that defines an enum. I would like to allow consumers of my code (in a different assembly) to pass in an enum value as a parameter to one of my functions without having to reference the underlying library themselves.
Is there a way for me to expose the library's enumeration to my consumers? | 0 | [
2,
17302,
40,
1957,
723,
37,
21,
1248,
718,
800,
3726,
3726,
19,
272,
5910,
15,
31,
589,
568,
21,
1248,
30,
13110,
40,
1957,
723,
9,
31,
83,
101,
20,
1655,
10932,
16,
51,
1797,
13,
5,
108,
21,
421,
1475,
6,
20,
1477,
19,
40,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Inline script does not resolve in ASP.Net custom control
===
Currently I am working with a **custom** regular expression validator *(unfortunately)*.
I am trying to set the Regex pattern using a server side inline script like this:
ValidationExpression="<%= RegExStrings.SomePattern %>"
However, the script is not resolving to server side code. Instead it is being interpreted literally and I end up with something like this in the rendered markup:
ctl00_DefaultContent_regexValidatorInvitation.validationexpression = "<%= RegExStrings.SomePattern %>";
Any clues as to why this is not resolving properly? | 0 | [
2,
19,
1143,
3884,
630,
52,
9854,
19,
28,
306,
9,
2328,
5816,
569,
800,
3726,
3726,
871,
31,
589,
638,
29,
21,
13,
1409,
4636,
6015,
1409,
1290,
1803,
7394,
3457,
1637,
5,
1020,
6469,
1020,
1373,
102,
6,
2483,
9,
31,
589,
749,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 load a .NET assembly for reflection operations and subsequently unload it?
===
I'm writing a tool to report information about .NET applications deployed across environments and regions within my client's systems.
I'd like to read the values of assembly attributes in these assemblies.
This can be achieved using `Assembly.ReflectionOnlyLoad`, however even this approach keeps the assembly loaded. The issue here is that I cannot load two assemblies that have the same name from different paths, so naturally I can't compare the same application deployed in different systems.
At this point I'm assuming the solution will involve using temporary `AppDomain`s.
Can someone detail how to load an assembly into another `AppDomain`, read the attributes from it and then unload the `AppDomain`?
This needs to work for assemblies on the file system as well as those at URL addresses. | 0 | [
2,
184,
20,
6305,
21,
13,
9,
2328,
1475,
26,
9138,
1311,
17,
1724,
367,
8294,
32,
60,
800,
3726,
3726,
31,
22,
79,
1174,
21,
5607,
20,
1330,
676,
88,
13,
9,
2328,
3767,
6698,
464,
11246,
17,
3332,
363,
51,
6819,
22,
18,
1242,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 split a string with any whitespace chars as delimiters?
===
What regex pattern would need to pass to the java.lang.String.split() method to split a string with all whitespace characters (' ', '\t', '\n', etc.) as delimiters? | 0 | [
2,
184,
107,
31,
2132,
21,
3724,
29,
186,
359,
5582,
4892,
18,
28,
121,
20565,
445,
60,
800,
3726,
3726,
98,
7953,
1706,
3732,
83,
376,
20,
1477,
20,
14,
8247,
9,
9949,
9,
11130,
9,
25603,
5,
6,
2109,
20,
2132,
21,
3724,
29,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Scheduled Report(task) Monitor
===
I have to develop a system to **monitor** the **generation/transmission** of reports.
- System data will be stored in database tables (Sybase)
- Reports will be generated with different schedules ("mon-fri 10pm", "sat 5am", "1st day of the month", etc.)
- System will just monitor that the reports were created. It will not create the reports itself.
- System will notify appropriate personnel when a report did not finish.
- System will maintain a log of all generated reports
Anyone know of a good(tried and proven) table(s) design for storing the task shedules?. I already have an idea, but I don't want reinvent the wheel.
| 0 | [
2,
3758,
1330,
5,
38,
20310,
6,
7626,
800,
3726,
3726,
31,
57,
20,
2803,
21,
329,
20,
13,
1409,
2111,
242,
248,
1409,
14,
13,
1409,
12546,
118,
7028,
12385,
1409,
16,
2813,
9,
13,
8,
329,
1054,
129,
44,
8214,
19,
6018,
7484,
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... |
Convert a number to a string with specified length in C++
===
I have some numbers of different length (like 1, 999, 76492, so on) and I want to convert them all to strings with a common length (for example, if the length is 6, then those strings will be: '000001', '000999', '076492').
In other words, I need to add correct amount of leading zeros to the number.
int n = 999;
string str = some_function(n,6);
//str = '000999'
Is there a function like this in C++?
| 0 | [
2,
8406,
21,
234,
20,
21,
3724,
29,
9931,
1476,
19,
272,
20512,
800,
3726,
3726,
31,
57,
109,
2116,
16,
421,
1476,
13,
5,
1403,
137,
15,
13,
23170,
15,
6914,
3624,
135,
15,
86,
27,
6,
17,
31,
259,
20,
8406,
105,
65,
20,
7887... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 good JavaScript hash(code/table) implementation out there?
===
Yes, I know you could use regular objects as associative arrays in JavaScript, but I'd like to use something closer to java's Map's implementation (HashMap, LinkedHashMap etc). Something that could have any kind of data used as key. Are there any good hash(code/table) in JavaScript implementation out there? | 0 | [
2,
25,
80,
186,
254,
8247,
8741,
19170,
5,
9375,
118,
5924,
6,
6123,
70,
80,
60,
800,
3726,
3726,
1643,
15,
31,
143,
42,
110,
275,
1290,
3916,
28,
28,
18,
16325,
3366,
7718,
18,
19,
8247,
8741,
15,
47,
31,
22,
43,
101,
20,
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... |
On XP, best way to synchronize files and folders.
===
I'm using SyncToy 1.4 and it would be fine for what I need except that: It can't handle the assigned drive letter changing between systems, it leaves its own files in the folders being synched and it recreates empty folders for ones that have been deleted. Also I'm wary of using it to synchronise the same folder pairs between different combinations, e.g. where desktop, laptop(s) and USB drive have been synched, but then both laptop(s) and USB drive have separately had files updated.
SyncToy 2.0 is too slow to be usable. Especially when run again on a folder without any changes it will start from scratch scanning all the files and sub-folders for differences. I've tried BeyondCompare but out-of-the-box it didn't recognise a file had been renamed and would have created a duplicate file with the older name.
It has to be a solution without using Internet based storage, as this isn't always available. I'd prefer something that doesn't add its own files to the folders to be synched, and something with which it's quick and easy to change file and folder synching selections. When run the less interactive the better. For backup purposes it will also be used to synchronize folders on different drives on the same PC.
Do I have to use rsync and batch files? Something with a GUI for granny to use without difficulty, would be better. | 0 | [
2,
27,
23045,
15,
246,
161,
20,
13,
16023,
2952,
6488,
17,
19294,
18,
9,
800,
3726,
3726,
31,
22,
79,
568,
6063,
4812,
7452,
137,
9,
300,
17,
32,
83,
44,
1123,
26,
98,
31,
376,
1613,
30,
45,
32,
92,
22,
38,
3053,
14,
2467,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 compare two arrays and remove matching elements from one for the next loop?
===
How else might you compare two arrays ($A and $B )and reduce matching elements out of the first to prep for the next loop over the array $A?
$A = array(1,2,3,4,5,6,7,8);
$B = array(1,2,3,4);
$C = array_intersect($A,$B); //equals (1,2,3,4)
$A = array_diff($A,$B); //equals (5,6,7,8)
Is this the simplest way or is there a way to use another function that I haven't thought of? My goal is to have an array that I can loop over, pulling out groups of related content (I have defined those relationships elsewhere) until the array returns false. | 0 | [
2,
184,
20,
11590,
81,
7718,
18,
17,
4681,
10120,
2065,
37,
53,
26,
14,
328,
5293,
60,
800,
3726,
3726,
184,
962,
530,
42,
11590,
81,
7718,
18,
13,
5,
4403,
58,
17,
5579,
220,
13,
6,
290,
4136,
10120,
2065,
70,
16,
14,
64,
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... |
In Eclipse, how can I exclude some files (maybe based on the .svn extension or filename) from being copied to the output folder?
===
I'm developing a Java application using Eclipse. My project has two source directories that are both built and then some files are copied into the output folder. From the output directory I then run my application and all works well.
However, I keep having these warnings:
![Snapshot from Problems tab in Eclipse][1]
Anyone know how to get rid of these warnings? Maybe by excluding some files, maybe based on the .svn extension or filename, from the build process? If so, how would I go about excluding those?
[1]: http://www.freeimagehosting.net/uploads/128c1af93f.png | 0 | [
2,
19,
11652,
15,
184,
92,
31,
21077,
109,
6488,
13,
5,
5138,
432,
27,
14,
13,
9,
18,
16578,
3896,
54,
3893,
7259,
6,
37,
142,
18225,
20,
14,
5196,
19294,
60,
800,
3726,
3726,
31,
22,
79,
3561,
21,
8247,
3010,
568,
11652,
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 can you work out the ID of a users MySite
===
In a Sharepoint WebPart written in c# I need to find out either the ID of the current users MySite, or check if the current site is the users MySite.
Ideas? | 0 | [
2,
184,
92,
42,
170,
70,
14,
4924,
16,
21,
3878,
51,
9097,
800,
3726,
3726,
19,
21,
1891,
3132,
2741,
3091,
642,
19,
272,
5910,
31,
376,
20,
477,
70,
694,
14,
4924,
16,
14,
866,
3878,
51,
9097,
15,
54,
2631,
100,
14,
866,
68... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Dynamically add items to a Context Menu & set Click action
===
I have a List of strings that is regenerated every 5 seconds. I want to create a Context Menu and set its items dynamically using this list.
The problem is that I don't have even a clue how to do that and manage the Click action for every item generated (which should use the same method with different parameter DoSomething("item_name")).
How should I do this?
Thanks for your time.
Best regards. | 0 | [
2,
7782,
1326,
3547,
3755,
20,
21,
4141,
11379,
279,
309,
10840,
1028,
800,
3726,
3726,
31,
57,
21,
968,
16,
7887,
30,
25,
29608,
43,
352,
331,
2582,
9,
31,
259,
20,
1600,
21,
4141,
11379,
17,
309,
82,
3755,
7782,
1326,
568,
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... |
Is it better to write a more targeted stored procedure with fewer parameters?
===
Say I have a stored procedure that returns data from a SELECT query. I would like to get a slightly different cut on those results depending on what parameters I pass through. I'm wondering whether it is better design to have multiple stored procedures that take one or no parameters to do this (for example, GetXByDate or GetXByUser), or one stored procedure with multiple parameters that does the lot (for example, GetX)?
The advantage of the first option is that it's simpler and maybe faster, but disadvantage is that the essence of the query is duplicated across the stored procedures and needs to be maintained in several places.
The advantage of the second option is that the query is only present once, but the disadvantage is that the query is more complex and harder to troubleshoot.
What do you use in your solutions and why? Thanks. | 0 | [
2,
25,
32,
574,
20,
2757,
21,
91,
9536,
8214,
7004,
29,
8477,
12905,
60,
800,
3726,
3726,
395,
31,
57,
21,
8214,
7004,
30,
4815,
1054,
37,
21,
5407,
25597,
9,
31,
83,
101,
20,
164,
21,
1847,
421,
1077,
27,
273,
1736,
4758,
27,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Shortcut to collapse to definitions except regions
===
In vs2008, how can I (possibly with a macro) assign a shortcut key to collapse to definitons but leave regions expanded (they must expand if collapsed)? | 0 | [
2,
502,
4118,
20,
6529,
20,
18544,
1613,
3332,
800,
3726,
3726,
19,
4611,
2753,
15,
184,
92,
31,
13,
5,
21628,
29,
21,
9069,
6,
13952,
21,
502,
4118,
1246,
20,
6529,
20,
6312,
2651,
444,
18,
47,
767,
3332,
2766,
13,
5,
2077,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is there a tool that supports discrete mathematics?
===
[Discrete mathematics (also finite mathematics)][1] deals with topics such as logic, set theory, information theory, partially ordered sets, proofs, relations, and a number of other topics.
For other branches of mathematics, there are tools that support programming. For statistics, there is [R][2] and [S][3] that have many useful statistics functions built in. For numerical analysis, [Octave][4] can be used as a language or integrated into C++.
I don't know of any languages or packages that deal specifically with discrete mathematics (although just about every language can be used to implement algorithms used in discrete mathematics, there should be libraries or environments out there designed specifically for these applications).
[1]: http://en.wikipedia.org/wiki/Discrete_mathematics
[2]: http://en.wikipedia.org/wiki/R_(programming_language)
[3]: http://en.wikipedia.org/wiki/S_programming_language
[4]: http://en.wikipedia.org/wiki/GNU_Octave | 0 | [
2,
25,
80,
21,
5607,
30,
6747,
18563,
4264,
60,
800,
3726,
3726,
636,
9752,
99,
591,
4264,
13,
5,
2573,
10796,
4264,
6,
500,
2558,
165,
500,
10342,
29,
7569,
145,
28,
7085,
15,
309,
1639,
15,
676,
1639,
15,
5933,
1905,
3415,
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... |
Export all symbols when creating a DLL
===
With VS2005, I want to create a DLL and automatically export all symbols without adding __declspec(dllexport) everywhere and without hand-creating .def files. Is threre a way to do this? | 0 | [
2,
7487,
65,
9794,
76,
2936,
21,
13,
43,
211,
800,
3726,
3726,
29,
4611,
2835,
15,
31,
259,
20,
1600,
21,
13,
43,
211,
17,
7499,
7487,
65,
9794,
366,
4721,
13,
1,
9522,
7532,
12610,
5,
43,
211,
1706,
1993,
6,
6417,
17,
366,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Doxygen vs Javadoc
===
I just realized from an article in CACM that Doxygen works with Java (and several other languages) too. But Java has already the Javadoc tool. Can someone explain what are the pros and cons of either approach? Are they mutually exclusive? Is there a Maven plugin for Doxygen? | 0 | [
2,
107,
15161,
1863,
4611,
8247,
13799,
800,
3726,
3726,
31,
114,
1896,
37,
40,
2002,
19,
13,
15734,
79,
30,
107,
15161,
1863,
693,
29,
8247,
13,
5,
290,
238,
89,
2556,
6,
266,
9,
47,
8247,
63,
614,
14,
8247,
13799,
5607,
9,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to specify in Eclipse what ot include in a .WAR file
===
In eclipse developing a java app, there are several class files whose are generated by a custom ant script. This happens automatically, and it has set up as an export/publish dependency for /WEB-INF/classes.
With publishing it happens allright, however on exporting to .WAR these files just got missing.
Is there a way to automatize this?
| 0 | [
2,
184,
20,
19077,
19,
11652,
98,
13,
2779,
468,
19,
21,
13,
9,
1885,
3893,
800,
3726,
3726,
19,
11652,
3561,
21,
8247,
4865,
15,
80,
50,
238,
718,
6488,
1196,
50,
6756,
34,
21,
5816,
40,
38,
3884,
9,
48,
5531,
7499,
15,
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 I sanitize CSV input with the CsvReader?
===
I'm using the [CsvReader][1] library in my Windows Forms application, which is coded in horribly messy VB (I've recently taken over the project.)
I'm currently capable of reading semi-colon separated files without quoting, but I'm having a problem: most of the input has quoted fields, but includes unescaped quote characters within the fields.
I cannot change the input, so I must tackle it somehow. One solution would be to entirely disable quoting -- but I'm not quite sure how to do that...
Any help would be appreciated!
[1]: http://sql.codeproject.com/KB/database/CsvReader.aspx | 0 | [
2,
184,
107,
31,
523,
242,
2952,
272,
18,
710,
6367,
29,
14,
272,
18,
710,
10647,
106,
60,
800,
3726,
3726,
31,
22,
79,
568,
14,
636,
6824,
710,
10647,
106,
500,
2558,
165,
500,
1248,
19,
51,
1936,
1997,
3010,
15,
56,
25,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can't resolve DNS
===
I'm trying to consume a webmetod but it seems that my applicaction can't resolve DNS. The problem surfaces when I configure my application with an url (e.g.: http://mywebservice.com/werbservice/methods.asmx), but it does not when I access the same webmethod through the server's IP address.
The thing is that I need to access the webservice using the url and not the IP address due to an existing DHCP server policy.
Can anyone help me ?
Thanks in advance. | 0 | [
2,
92,
22,
38,
9854,
13,
43,
2172,
800,
3726,
3726,
31,
22,
79,
749,
20,
16447,
21,
2741,
5909,
5648,
47,
32,
2206,
30,
51,
4865,
4663,
8645,
92,
22,
38,
9854,
13,
43,
2172,
9,
14,
1448,
11569,
76,
31,
1065,
15951,
51,
3010,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP.NET Performance : web application with ou without precompilation
===
Currently we're using Web Application project, so we have a gain with compilation. But as far as I know, the aspx pages a still compiled at the first page hit. So does precompilation give a perceptible performance gain ? (first hit exluded).
What type of web site (hits/sec, number of users) will benefit of it ? | 0 | [
2,
28,
306,
9,
2328,
956,
13,
45,
2741,
3010,
29,
9028,
366,
782,
11103,
49,
10832,
800,
3726,
3726,
871,
95,
22,
99,
568,
2741,
3010,
669,
15,
86,
95,
57,
21,
3288,
29,
4868,
9,
47,
28,
463,
28,
31,
143,
15,
14,
28,
306,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I replace accented Latin characters in Ruby?
===
I have an `ActiveRecord` model, `Foo`, which has a `name` field. I'd like users to be able to search by name, but I'd like the search to ignore case and any accents. Thus, I'm also storing a `canonical_name` field against which to search:
class Foo
validates_presence_of :name
before_validate :set_canonical_name
private
def set_canonical_name
self.canonical_name ||= canonicalize(self.name) if self.name
end
def canonicalize(x)
x.downcase. # something here
end
end
I need to fill in the "something here" to replace the accented characters. Is there anything better than
x.downcase.gsub(/[àáâãäå]/,'a').gsub(/æ/,'ae').gsub(/ç/, 'c').gsub(/[èéêë]/,'e')....
And, for that matter, since I'm not on Ruby 1.9, I can't put those Unicode literals in my code. The actual regular expressions will look much uglier. | 0 | [
2,
184,
107,
31,
3934,
7980,
69,
2068,
1766,
19,
10811,
60,
800,
3726,
3726,
31,
57,
40,
13,
1,
7889,
14953,
1,
1061,
15,
13,
1,
4120,
111,
1,
15,
56,
63,
21,
13,
1,
7259,
1,
575,
9,
31,
22,
43,
101,
3878,
20,
44,
777,
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... |
Protecting user passwords in desktop applications
===
I'm making a twitter client, and I'm evaluating the various ways of protecting the user's login information.
- Hashing apparently doesn't do it
- Obfuscating in a reversable way is like trying to hide behind my finger
- Plain text sounds and propably is promiscuous
- Requiring the user to type in his password every time would make the application tiresome
Any ideas ?
| 0 | [
2,
8718,
4155,
20884,
18,
19,
17404,
3767,
800,
3726,
3726,
31,
22,
79,
544,
21,
10623,
6819,
15,
17,
31,
22,
79,
26764,
14,
617,
2847,
16,
8718,
14,
4155,
22,
18,
6738,
108,
676,
9,
13,
8,
19170,
68,
3083,
1437,
22,
38,
107,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 budgetting worthwhile for software development freelancer or contractor?
===
As a software freelancer (contractor) does it pay out to budget for things such as marketing and advertisement, training, tools (i.e. business related expenditure) or just buy them ad hoc? Obviously you need to set some money aside for holidays, sickness etc anything that goes under “social security” expenses category, but advertisement and training? Since, common, being on your own you can pretty much make decisions on the spot, pay as you go.
Are there any less obvious benefits to the budgeting apart from not going over the limit? Apart from keeping risks under control?
What is your advice based on personal experience?
| 2 | [
2,
25,
3391,
1203,
29604,
26,
2306,
522,
16043,
139,
54,
15136,
60,
800,
3726,
3726,
28,
21,
2306,
16043,
139,
13,
5,
23311,
248,
6,
630,
32,
1372,
70,
20,
3391,
26,
564,
145,
28,
4743,
17,
17128,
15,
838,
15,
4672,
13,
5,
49,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Embed image in code, without using resource section or external images
===
I'm looking for a way to embed an image in a library (Windows-only). I don't want to go the 'traditional' way of putting it in the resources (because of special circumstances that make it not so convenient to mess around with the resource handle.
Ideally, there would be something like xpm files: a 'text' representation of an image that is put in a c array and that some code converts into a bitmap in memory, which can then somehow be loaded into an HIMAGE or an HICON. The images I want to embed are 32-bit bitmaps (bmp). Any ideas? I'm using MFC so an MFC library would be fine, but of course I can use a library that doesn't use MFC too. Thanks. | 0 | [
2,
11911,
69,
1961,
19,
1797,
15,
366,
568,
6577,
1050,
54,
4886,
3502,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
161,
20,
11911,
69,
40,
1961,
19,
21,
1248,
13,
5,
27508,
18,
8,
4965,
6,
9,
31,
221,
22,
38,
259,
20,
162,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 check for the presence of an OrderBy in a ObjectQuery<T> expression tree
===
I'm using t4 for generating repositories for LINQ to Entities entities.
The repository contains (amongst other things) a List method suitable for paging. The documentation for [Supported and Unsupported Methods][1] does not mention it, but you can't "call" Skip on a unordered IQueryable. It will raise the following exception:
> System.NotSupportedException: The method 'Skip' is only supported for
> sorted input in LINQ to Entities. The method 'OrderBy' must be called before
> the method 'Skip'..
I solved it by allowing to define a default sorting via a partial method. But i'm having problems checking if the expression three indeed contains an OrderBy.
I've reduced the problem to as less code as possible:
public partial class Repository
{
partial void ProvideDefaultSorting(ref IQueryable<Category> currentQuery);
public IQueryable<Category> List(int startIndex, int count)
{
NorthwindEntities ent = new NorthwindEntities();
IQueryable<Category> query = ent.Categories;
ProvideDefaultSorting(ref query);
if (!IsSorted(query))
{
query = query.OrderBy(c => c.CategoryID);
}
return query.Skip(startIndex).Take(count);
}
private Boolean IsSorted(IQueryable<Category> query)
{
return query is IOrderedQueryable<Category>;
}
}
public partial class Repository
{
partial void ProvideDefaultSorting(ref IQueryable<Category> currentQuery)
{
currentQuery = currentQuery.Where(c => c.CategoryName.Contains(" ")); // no sorting..
}
}
This is not my real implementation!
But my **question** is, how could I implement the IsSorted method? The problem is that LINQ to Entities query's are allways of the type ObjectQuery, which implements IOrderedQueryable.
So how should I make sure an OrderBy method is present in the expression tree? Is the only option to parse the tree?
[1]: http://msdn.microsoft.com/en-us/library/bb738474.aspx | 0 | [
2,
184,
20,
2631,
26,
14,
1970,
16,
40,
389,
779,
19,
21,
3095,
8190,
93,
1,
38,
1,
1803,
1541,
800,
3726,
3726,
31,
22,
79,
568,
13,
38,
300,
26,
13500,
302,
14882,
262,
2829,
26,
6294,
1251,
20,
12549,
12549,
9,
14,
24869,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to distribute .Net binaries and PDBs?
===
We altready have a similar question [here][1] but the discussion do not cover all the aspect, so I'm asking again:
*What is the best way to distribute a .Net application considering build mode (release vs. debug) and distribution of PDB files?* Having a good reference to an article covering these aspects would be great.
Consider also the distribution of web application vs. the distribution of windows form applications.
Thanks in advance
Massimo
[1]: http://stackoverflow.com/questions/88950/is-there-any-reason-to-not-ship-the-pdbs-with-your-application | 0 | [
2,
98,
25,
14,
246,
161,
20,
14751,
13,
9,
2328,
4511,
11301,
17,
351,
9007,
18,
60,
800,
3726,
3726,
95,
7051,
15193,
57,
21,
835,
1301,
636,
6836,
500,
2558,
165,
500,
47,
14,
5460,
107,
52,
1227,
65,
14,
7289,
15,
86,
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... |
How to get the text of an exception stack trace in JavaME
===
In regular Java, you can get the text of a stack trace by passing a PrintWriter to printStackTrace. I have a feeling I know the answer to this (i.e. "No") but...
Is there any way to obtain the text of a stack trace in JavaME as a String? | 0 | [
2,
184,
20,
164,
14,
1854,
16,
40,
5391,
7566,
5565,
19,
8247,
790,
800,
3726,
3726,
19,
1290,
8247,
15,
42,
92,
164,
14,
1854,
16,
21,
7566,
5565,
34,
2848,
21,
4793,
9657,
20,
4793,
25325,
38,
7367,
9,
31,
57,
21,
1249,
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... |
IIS 6.0 Integrated authentication : 401.1 with IE7
===
Today I changed the application pool identity of our ASP.NET application from "Network Service" to a domain user.
I added the user to the local group "IIS_WPG", done a iisreset just in case, and
everything works fine with IE6 and Firefox 3.0
But when I go to the website with IE7, an authentication popup appears, I type my credentials, and then :
HTTP Error 401.1 - Unauthorized: Access is denied due to invalid credentials. Internet Information Services (IIS)
Any ideas ? | 0 | [
2,
595,
18,
400,
9,
387,
5547,
27963,
13,
45,
13,
20658,
9,
165,
29,
13,
660,
465,
800,
3726,
3726,
786,
31,
1015,
14,
3010,
3067,
3270,
16,
318,
28,
306,
9,
2328,
3010,
37,
13,
7,
24106,
365,
7,
20,
21,
4603,
4155,
9,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Building a view column out of separate columns
===
In our database, we have a system set up to keep track of applications. We have a bool column that indicates whether or not the application is approved. Then there's another column that indicates whether or not the application is denied. If neither column is true, then the application is considered to be pending.
Is there any easy way to merge those into one value (like say a tinyint or maybe a string that says "approved", "denied", or "pending") in a view? Or is this going to require something like a Table-valued function? | 0 | [
2,
353,
21,
1418,
4698,
70,
16,
1725,
7498,
800,
3726,
3726,
19,
318,
6018,
15,
95,
57,
21,
329,
309,
71,
20,
643,
792,
16,
3767,
9,
95,
57,
21,
1607,
1823,
4698,
30,
6475,
1472,
54,
52,
14,
3010,
25,
3469,
9,
94,
80,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to make a failing $(shell) command interrupt Make
===
I have a Makefile that starts by running a tool before applying the build rules (which this tools writes for me). If this tool, which is a python script, exits with a non-null status code, I want GNU Make to stop right there and not go on with building the program.
Currently, I do something like this (top level, i.e. column 1):
$(info Generating build rules...)
$(shell python collect_sources.py)
include BuildRules.mk
But this does not stop make if `collect_sources.py` exits with a status code of 1. This also captures the standard output of `collect_sources.py` but does not print it out, so I have the feeling I'm looking in the wrong direction.
Any suggestion? | 0 | [
2,
184,
20,
233,
21,
7250,
5579,
5,
15984,
6,
1202,
15811,
233,
800,
3726,
3726,
31,
57,
21,
233,
16877,
30,
3244,
34,
946,
21,
5607,
115,
11989,
14,
1895,
1761,
13,
5,
2140,
48,
4672,
6215,
26,
55,
6,
9,
100,
48,
5607,
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... |
Detecting running in Main Thread in C# library
===
I'm creating a C# dll, which is going to be used by others developers in WinForms. For some reasons, I want to detect, if methods from this library, are called from Main (GUI) Thread and warn developer he has done such a thing (ie. in log file). Is there any reasonable way to detect calling method from main thread?
Remember I have no access to WinForm application.
| 0 | [
2,
9092,
68,
946,
19,
407,
9322,
19,
272,
5910,
1248,
800,
3726,
3726,
31,
22,
79,
2936,
21,
272,
5910,
13,
43,
211,
15,
56,
25,
228,
20,
44,
147,
34,
654,
10168,
19,
628,
4190,
18,
9,
26,
109,
2932,
15,
31,
259,
20,
9092,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Text popping through on image replacement
===
I've used a standard image replacement technique for one of my links, (the nested span technique) but as the image is round & transparent at the edges, the underlying text link is popping through.
Heres my screenshot that explains what I mean.
http://dl.getdropbox.com/u/240752/peepo.gif
Whats the best way to hide this text? I don't want to use `display:none` as its bad practice, and I had a feeling that setting the text size to 0 is also a no-no?
Can anyone suggest a good practice technique, thats not going to get me tried to a tree by google for cloaking.
Many thanks. | 0 | [
2,
1854,
24157,
120,
27,
1961,
4610,
800,
3726,
3726,
31,
22,
195,
147,
21,
1236,
1961,
4610,
4873,
26,
53,
16,
51,
6271,
15,
13,
5,
124,
5618,
69,
6289,
4873,
6,
47,
28,
14,
1961,
25,
560,
279,
14862,
35,
14,
7840,
15,
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... |
Resources for image distortion algorithms
===
Where can I find algorithms for image distortions? There are so much info of Blur and other classic algorithms but so little of more complex ones. In particular, I am interested in swirl effect image distortion algorithm. | 0 | [
2,
2566,
26,
1961,
20353,
15935,
800,
3726,
3726,
113,
92,
31,
477,
15935,
26,
1961,
20353,
18,
60,
80,
50,
86,
212,
15404,
16,
10330,
17,
89,
2732,
15935,
47,
86,
265,
16,
91,
1502,
53,
18,
9,
19,
1498,
15,
31,
589,
3158,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How can you uniquify context-root on jBoss
===
Say I have a simple j2EE ear:
foo.ear
- foo.war
I would like to deploy the same ear twice so I rename the ear:
bar.ear
- foo.war
The `META-INF\application.xml` file looks like this:
<application>
<module>
<web>
<web-uri>foo.war</web-uri>
<context-root>/baz</context-root>
</web>
</module>
</application>
When I deploy there is a collison, both apps will try to mount at `http://localhost:8080/baz`. Is there a way to prefix the ear name to the context-root to get `foo/baz` and `bar/baz`? | 0 | [
2,
184,
92,
42,
9911,
3003,
9596,
4141,
8,
14032,
27,
487,
10349,
18,
800,
3726,
3726,
395,
31,
57,
21,
1935,
487,
135,
2851,
2330,
45,
4310,
111,
9,
10717,
13,
8,
4310,
111,
9,
1885,
31,
83,
101,
20,
17617,
14,
205,
2330,
208... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a PHP function to remove any/all key/value pairs that have a certain value from an array?
===
I think questions like this are the reason why I don't like working with PHP. The manual is good, if you can find what you are looking for. After reading through the [Array Functions][1], I didn't see one that provides the functionality I need.
I have an array (in my case, numerically indexed) that I want to scan for a particular value and, if it's there, remove it. And then, when all instances of that value have been removed, I want to rearrange the array using [array_values][2].
[1]: http://us3.php.net/array
[2]: http://us3.php.net/manual/en/function.array-values.php | 0 | [
2,
25,
80,
21,
13,
26120,
1990,
20,
4681,
186,
118,
1233,
1246,
118,
15165,
7473,
30,
57,
21,
1200,
1923,
37,
40,
7718,
60,
800,
3726,
3726,
31,
277,
2346,
101,
48,
50,
14,
1215,
483,
31,
221,
22,
38,
101,
638,
29,
13,
26120,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Get relative position between 2 DOM elements using JavaScript
===
I've implemented a set of draggable elements that can be dropped into some containers using jQuery. What I need is an animation that moves an element to a specific container without user interaction. The problem is that the elements and the drop containers are in completely different parts of the DOM and mostly positioned using float.
All I need is some code to get the absolute position difference between 2 floating DOM elements, preferrably using jQuery. The only thing I found were some hacks parsing upwards the DOM but always very browser-specific (e.g. "this does not work well with Firefox or IE or whatever").
Best would be something like this:
var distance = getDistance(element1, element2);
or in jQuery notation:
var distance = $(element1).distanceTo($(element2));
| 0 | [
2,
164,
4543,
649,
128,
172,
11859,
2065,
568,
8247,
8741,
800,
3726,
3726,
31,
22,
195,
6807,
21,
309,
16,
5501,
263,
579,
2065,
30,
92,
44,
1539,
77,
109,
18988,
568,
487,
8190,
93,
9,
98,
31,
376,
25,
40,
6236,
30,
4927,
40... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
API java 5 and more: should I return an array or a Collection ?
===
In the spirit of [Best Practices: Always return a \_\_\_\_, never a \_\_\_\_][1], I face a similar question in my upcoming [migration from JDK1.4.2 to JDK5 and more][2]. (Yes, I *know*, [JDK1.4.2 is EOL!][3] ;-) ).
For functions returning a collection (which are not simple [property collections][4]), I always prefer (in JDK1.4.2) returning an Array instead of a generic List, because:
- it enforces the returning type (MyObject[] instead of List of Objects, much more ***type-safe*** on a static -- as in 'compilation' -- level)
- it *suggests* a 'read-only' character to the returned collection (it is more complicated to add an element to the collection, even though this is not as rigorous as the 'read-only' keyword in c#). This is not the same as saying it is 'immutable' since the references inside the array can still be modified...
Of course, I do always *create* this returned array (I do not expose any 'internal' array)
Now, In JDK5 and more, I could use List<MyObject> if I want to.
**What are the good reasons for choosing to return MyObject[] instead of List or Collection<MyObject> when coding in java5 ?**
Bonus, if Collection<MyObject> is used, is it possible to:
- enforce a read-only attribute on the returned collection ? (no add() or remove() possible)
- enforce an immutable aspect to the returned collection ? (even the references of that collection can not be modified)
PS: The [JavaGenericFAQ][5] did not quite have that one.
[1]: http://stackoverflow.com/questions/171156/best-practices-always-return-a-never-a
[2]: http://stackoverflow.com/questions/219164/generics-in-legacy-code
[3]: http://java.sun.com/products/archive/eol.policy.html
[4]: http://stackoverflow.com/questions/35007/how-to-expose-a-collection-property
[5]: http://www.angelikalanger.com/GenericsFAQ/JavaGenericsFAQ.html | 0 | [
2,
21,
2159,
8247,
331,
17,
91,
45,
378,
31,
788,
40,
7718,
54,
21,
1206,
13,
60,
800,
3726,
3726,
19,
14,
2659,
16,
636,
4936,
5242,
45,
550,
788,
21,
13,
1,
15,
243,
21,
13,
1,
500,
2558,
165,
500,
15,
31,
276,
21,
835,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
RFC documents to A4 format
===
When printing RFC documents on my A4 format printer I noticed that I print more than it is considered to be one page in RFC document. I figure this is because probably RFC is written in North American paper letter format (216 × 279 mm) and I want to use ISO A4 format (210 × 297 mm). Info on [Paper size][1]. So my question is if there is some way or program with which I would at least be able to print every letter format page on to the separate A4 format page. I know there will be some unused space at the bottom but at least there will just be one text page per A4 paper page. I tried changing paper size on printer from A4 to letter, but it didn't help.
[1]: http://en.wikipedia.org/wiki/Paper_size | 0 | [
2,
17492,
4374,
20,
21,
300,
2595,
800,
3726,
3726,
76,
7312,
17492,
4374,
27,
51,
21,
300,
2595,
12925,
31,
2711,
30,
31,
4793,
91,
119,
32,
25,
724,
20,
44,
53,
2478,
19,
17492,
4492,
9,
31,
1465,
48,
25,
185,
910,
17492,
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... |
Thread.getContextClassLoader() == null ?
===
Can Thread.getContextClassLoader() be null ? The javadoc is not really clear.
Should a library take this case into account ? | 0 | [
2,
9322,
9,
3060,
1126,
11969,
1898,
8294,
106,
5,
6,
800,
3726,
16203,
13,
60,
800,
3726,
3726,
92,
9322,
9,
3060,
1126,
11969,
1898,
8294,
106,
5,
6,
44,
16203,
13,
60,
14,
8247,
13799,
25,
52,
510,
1207,
9,
378,
21,
1248,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
LINQ to SQL with RDBMS other than MS SQL Server
===
Is there any plans for Microsoft to support LINQ to SQL beyond MS SQL server? | 0 | [
2,
6294,
1251,
20,
4444,
255,
29,
13,
897,
13178,
18,
89,
119,
4235,
4444,
255,
8128,
800,
3726,
3726,
25,
80,
186,
1753,
26,
7099,
20,
555,
6294,
1251,
20,
4444,
255,
1701,
4235,
4444,
255,
8128,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Javascipt library for syntax highlighting for code, then diffs, in HTML, at the line level?
===
Anyone know of a JS library that will allow me to syntax highlight a code block, then highlight line-level diffs? For example, in a subversion diff, I'd like to highlight the characters on the line that have changed (as well as highlighting the fact that there are change(s) on the line). | 0 | [
2,
8247,
18,
11526,
38,
1248,
26,
22649,
23102,
26,
1797,
15,
94,
20811,
18,
15,
19,
13,
15895,
15,
35,
14,
293,
662,
60,
800,
3726,
3726,
1276,
143,
16,
21,
487,
18,
1248,
30,
129,
1655,
55,
20,
22649,
14373,
21,
1797,
1921,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
"Pretty" Continuous Integration for Python
===
This is a slightly.. vain question, but BuildBot's output isn't particularly nice to look at..
For example, compared to..
- [phpUnderControl](http://phpundercontrol.org/about.html)
- [Hudson](http://blogs.sun.com/arungupta/entry/top_10_features_of_hudson)
- [CruiseControl.rb](http://cruisecontrolrb.thoughtworks.com/)
..and others, [BuildBot](http://www.python.org/dev/buildbot/2.5/) looks rather.. archaic
I'm currently playing with Hudson, but it is very Java-centric (although with [this guide](http://redsolo.blogspot.com/2007/11/hudson-embraces-python.html), I found it easier to setup than BuildBot, and produced more info)
Basically: is there any Continuous Integration systems aimed at python, that produce lots of shiney graphs and the likes? | 0 | [
2,
13,
7,
21542,
7,
6357,
8078,
26,
20059,
800,
3726,
3726,
48,
25,
21,
1847,
9,
9,
15845,
1301,
15,
47,
1895,
6813,
22,
18,
5196,
2532,
22,
38,
1653,
2210,
20,
361,
35,
9,
9,
26,
823,
15,
2428,
20,
9,
9,
13,
8,
636,
26120... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do in-line ads indicate a SaaS product's monetization strategy is flawed?
===
Before I continue with my question, I think there's a perfect real-world analogy to the creation of a new and shiny web application. (and yes, I chose the incendiary title to simply to draw you here ... we tolerate them at Google and I have no intention of quitting SO).
When Wal-mart determines that a market will support a store, they build an nice, shiny, new facility and carefully stock it with really low-priced, nice-looking items. Business starts out brisk as people are curious about the new store, and while prices are artificially low.
Once they've driven the competition out-of-business the store manager, under continued pressure to increase profits raises prices to the normal Wal-mart levels, and continues to increase the number of shoppers, since the competition has been eliminated.
Once that growth phase has levelled off, the manager, under continued pressure to raise profits, orders more items than his store will logically hold, including large quantities of impulse items. Since this exceeds the store's capacity, many of these items are simply left on pallets and placed in the aisles.
Target notices the growth of this market and realizes that many of these Wal-mart shoppers are in their demographics. They build a store and stock it with slightly better merchandise which is sold for somewhat more money than the equivalent product at Wal-mart. Many shoppers, who were dubious of the quality of Wal-marts items and irritated at navigating the increasingly cluttered aisles (especially during peak shopping hours), flock to Target where very little merchandise is ever placed in the aisles. The poor store manager is now stuck at an equilibrium and won't be seeing any more of the growth bonuses he's accustomed to. Some people return to the few remaining mom-and-pop stores in the area.
In many cases, the Target (or mom-and-pop) shopper is paying more for exactly the same item. Why? Atmosphere. Studies have shown that it's not the presence of the impulse purchase items, or even the in-store advertising, but rather the general appearance of the store that ultimately determines the shoppers perception of the store (and chain). And open aisles are a huge factor in people's perceptions.
In SaaS products, we expect to see advertising if we're using a free version of the software, but at what level does the advertising impede users to the point where they go elsewhere?
I have a few questions that are much more specific, which I'd love to see hard numbers for or against. Not that I expect everyone to provide real figures in dollars, but most of these questions can be answered with a non-specific y-axis.
If Jeff and Joel will indulge me, I'll frame them in terms of their web-sites. We've seen that SO started (at least when I first surfed here), with some side-bar advertising, but I just noticed there was an in-line ad this morning (here's a picture for those who haven't seen one).
![alt text][1]
Here's what I'm curious to know (and it might take quite a while before some of these can be answered):
1. How has the growth of SO impacted traffic to JoS/BoS/DoS?
2. How has the inclusion of advertising on SO affected revenues?
3. How has the inclusion of in-line advertising on SO impacted traffic (or maybe reduced the growth curve) if at all?
4. What is the proper balance of "impeding the customer" and advertising to maximize both profits and traffic?
5. Are you better off maximizing profits by charging for answers like some of the subscription Q&A sites, even though it reduces traffic and search engine exposure?
SaaS is obviously a fast-growing software product category, but there are challenges looming with consumers that are used to the Internet being free? The real question is how do we make a living off this category. I'm not sure I've seen the "perfect answer" yet!
[1]: http://www.selesy.com/images/misc/SOIn-lineAd.png | 2 | [
2,
107,
19,
8,
1143,
16236,
4342,
21,
18194,
18,
2374,
22,
18,
27054,
1829,
4427,
25,
26248,
60,
800,
3726,
3726,
115,
31,
1816,
29,
51,
1301,
15,
31,
277,
80,
22,
18,
21,
2107,
683,
8,
4423,
25928,
20,
14,
2502,
16,
21,
78,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
User validation dropoff percentage
===
We have a simple registration form for our website users where we only require an e-mail address and a password (both repeated twice to make sure they are correct). We require that the user confirm their e-mail accounts by clicking a link in an e-mail.
We see that a lot of users don't bother following the link in the e-mail (over 18% never activate their account), and we are wondering how this compares to other websites.
We do not know that our domain is blacklisted anywhere, and it has SPF set up correctly to get through spam filters.
Are there statistics on this that I have missed? | 0 | [
2,
4155,
27999,
2804,
1299,
5780,
800,
3726,
3726,
95,
57,
21,
1935,
8587,
505,
26,
318,
2271,
3878,
113,
95,
104,
4077,
40,
13,
62,
8,
8079,
3218,
17,
21,
20884,
13,
5,
8110,
4251,
2088,
20,
233,
562,
59,
50,
4456,
6,
9,
95,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Access Web Datasheet in a webApp
===
I am trying to write a web application in C# ASP.NET3.5 and want to include a Microsoft Office Access Web Datasheet in my application. I have been searching for ages looking for an example on how to use it, but I can't see one anywhere.
It’s the editing view in a SharePoint grid so I know it’s possible, I just can’t find out how to implement it.
Any help would be greatly appreciated.
Richard | 0 | [
2,
1381,
2741,
1054,
17627,
19,
21,
2741,
7753,
800,
3726,
3726,
31,
589,
749,
20,
2757,
21,
2741,
3010,
19,
272,
5910,
28,
306,
9,
2328,
240,
9,
264,
17,
259,
20,
468,
21,
7099,
488,
1381,
2741,
1054,
17627,
19,
51,
3010,
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... |
c# downloading a webpage. A better way needed, CPU usage high
===
Im trying to get this peice of code working a little better. I suspect its the loop reading one byte at a time. I couldn't find another way of doing this with gzip decompression. Implementing a StreamReader is fine but it returns a string which I can't pass to the decompression stream.
Is there a better way?
byte[] bufffer = null;
List<byte> resourceBytes = new List<byte>();
int byteValue = 0;
WebResource resource = new WebResource();
HttpWebResponse webResponse = null;
try {
HttpWebRequest webRequest = (HttpWebRequest)WebRequest.Create(resourceUri);
webRequest.Headers.Add(HttpRequestHeader.AcceptEncoding, "gzip,deflate");
webRequest.Headers.Add(HttpRequestHeader.AcceptCharset, "ISO-8859-1,utf-8;q=0.7,*;q=0.7");
webRequest.UserAgent = agent;
webRequest.Accept = "text/html, application/xml;q=0.9, application/xhtml+xml, image/png, image/jpeg, image/gif, image/x-xbitmap, */*;q=0.1";
webRequest.Credentials = CredentialCache.DefaultCredentials;
webRequest.Referer = resourceUri.OriginalString;
webRequest.Timeout = 5000;
webResponse = (HttpWebResponse)webRequest.GetResponse();
Stream webStream = webResponse.GetResponseStream();
if (!string.IsNullOrEmpty(webResponse.ContentEncoding)) {
if (webResponse.ContentEncoding.ToLower().Contains("gzip")) {
webStream = new GZipStream(webStream, CompressionMode.Decompress);
}
else if (webResponse.ContentEncoding.ToLower().Contains("deflate")) {
webStream = new DeflateStream(webStream, CompressionMode.Decompress);
}
}
do {
byteValue = webStream.ReadByte();
if (byteValue != -1) {
resourceBytes.Add((byte)byteValue);
}
} while (byteValue != -1);
//Free up resources
webStream.Close();
webResponse.Close();
bufffer = resourceBytes.ToArray();
| 0 | [
2,
272,
5910,
7121,
68,
21,
2741,
6486,
9,
21,
574,
161,
851,
15,
17578,
7514,
183,
800,
3726,
3726,
797,
749,
20,
164,
48,
3560,
3568,
16,
1797,
638,
21,
265,
574,
9,
31,
7551,
82,
14,
5293,
1876,
53,
34,
591,
35,
21,
85,
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 many hash buckets
===
If I notice that a hash table (or any other data structure built on a hash table) is filling up, at what point should you build a new table with more buckets. And given n items in the table so far, how do you figure out how many buckets to use in the new one?
So let's say I have 100 buckets. Should I reorganize it when there are 50 items in it? 500? 5000? Or should I look for the most-full bucket and key on that? Then when I hit that point how big do I make the new hash table?
Related to this, if you know beforehand roughly how many items will go in, is there a way to compute the number of buckets to get a good average performance?
I know the real answer depends on a lot of other considerations like how important is speed vs. size in a specific example, but I'm looking for general guildlines.
I also know that I shouldn't be optimizing this sort of thing unless good profiling has indicated that this is a bottleneck. I'm just thinking about a project that would use a lot of hash tables and wondered how to approach this.
| 0 | [
2,
184,
151,
19170,
12433,
18,
800,
3726,
3726,
100,
31,
3551,
30,
21,
19170,
859,
13,
5,
248,
186,
89,
1054,
1411,
392,
27,
21,
19170,
859,
6,
25,
7702,
71,
15,
35,
98,
454,
378,
42,
1895,
21,
78,
859,
29,
91,
12433,
18,
9,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to have a different theme/css load up depending on domain name
===
I have a site, and it will be sold to different clients but for maintenance reasons, we will be keeping one codebase. So this means that this one codebase will have to be dynamic enough to have different styles and so forth, depending on the client.
The domain would be a subdomain-type system, so: projectname.clientname.com , projectname.clientname.com, and so forth, where client name is the company who we have sold the system to.
What I'm trying to do is to have a different theme load up depending on the domain. So I may have ecards.savills.com, and for that, I have a folder in Themes called Savills, and inside that folder called Savills, a .CSS file and I want to load that. I've been playing with the request object, but no luck.
I've tried several methods to achieve this, using stylesheettheme (don't need to skin buttons btw), but I keep getting stack overflows in a system dll for .NET.
What is a robust way to achieve this? | 0 | [
2,
184,
20,
57,
21,
421,
3184,
118,
6824,
18,
6305,
71,
4758,
27,
4603,
204,
800,
3726,
3726,
31,
57,
21,
689,
15,
17,
32,
129,
44,
945,
20,
421,
7421,
47,
26,
5010,
2932,
15,
95,
129,
44,
2882,
53,
1797,
8436,
9,
86,
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... |
Database Locking to handle concurrency-- a good idea?
===
In order to handle concurrency issue, is database locking a good solution?
If not, how to handle concurrency issue? | 0 | [
2,
6018,
17538,
20,
3053,
25547,
8,
8,
21,
254,
882,
60,
800,
3726,
3726,
19,
389,
20,
3053,
25547,
1513,
15,
25,
6018,
17538,
21,
254,
4295,
60,
100,
52,
15,
184,
20,
3053,
25547,
1513,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
create HTML menubar
===
I'm looking for some help with creating a horiztontal menubar in HTML. The menubar will have menus such as File, Edit, View and when you mouseover or click on the File menu (for example), the menu will be displayed showing menu items such as New, Open, etc.
Ideally, I'd like to create the menubar and menus using pure HTML and CSS, but I also have JQuery, Prototype and Scriptaculous at my disposal if necessary. Does anyone know of any good examples/tutorials from which I could draw inspiration?
Cheers,
Don
| 0 | [
2,
1600,
13,
15895,
11379,
1850,
800,
3726,
3726,
31,
22,
79,
699,
26,
109,
448,
29,
2936,
21,
4523,
3186,
444,
3663,
11379,
1850,
19,
13,
15895,
9,
14,
11379,
1850,
129,
57,
11379,
18,
145,
28,
3893,
15,
9392,
15,
1418,
17,
76,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get a client instance created with the $create method?
===
Using the client-side ASP.NET AJAX library, I have created an instance client component with the $create shortcut-method ([http://msdn.microsoft.com/da-dk/library/bb397487(en-us).aspx][1]). The object is attached to a DOM element. Now I need to get a reference to the instance, but it is neither registered on window or on the DOM element, and I cannot find it anywhere.
Does someone know how you can obtain a reference to the instance?
Best regards,
JacobE
[1]: http://msdn.microsoft.com/da-dk/library/bb397487(en-us).aspx | 0 | [
2,
184,
20,
164,
21,
6819,
4851,
679,
29,
14,
5579,
6037,
1373,
2109,
60,
800,
3726,
3726,
568,
14,
6819,
8,
1416,
28,
306,
9,
2328,
20624,
1248,
15,
31,
57,
679,
40,
4851,
6819,
5912,
29,
14,
5579,
6037,
1373,
502,
4118,
8,
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... |
Anyone using RailRoad diagrams generator?
===
I recently installed RailRoad gem to generate an .svg diagram of my app's models and controllers.
The rake task keeps breaking with a similar error:
1.8/usr/lib/ruby/gems/1.8/gems/activesupport-1.4.4/lib/active_support/dependencies.rb:263:in `load_missing_constant': uninitialized constant
I tried the rake task on 2 seperate apps and the error keeps appearing with a different "constant" name.
Anyone using it with similar problems? | 0 | [
2,
1276,
568,
2356,
14161,
18,
15286,
60,
800,
3726,
3726,
31,
1989,
4066,
2356,
8551,
20,
7920,
40,
13,
9,
18,
22955,
14161,
16,
51,
4865,
22,
18,
2761,
17,
9919,
18,
9,
14,
21009,
3005,
8968,
3892,
29,
21,
835,
7019,
45,
137,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 add a page break in XSL-FO?
===
How do you add a page break into a document with XSL-FO? I'm using [Apache FOP][1] to create PDFs, if that makes a difference.
[1]: http://xmlgraphics.apache.org/fop/ | 0 | [
2,
184,
107,
42,
3547,
21,
2478,
1442,
19,
993,
18,
255,
8,
4120,
60,
800,
3726,
3726,
184,
107,
42,
3547,
21,
2478,
1442,
77,
21,
4492,
29,
993,
18,
255,
8,
4120,
60,
31,
22,
79,
568,
636,
7738,
2569,
398,
2594,
500,
2558,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I get an UpdatePanel to intercept a CompositeControl's DropDownList
===
I have a CompositeControl that contains a DropDownList.
I have set the AutoPostBack property of the DropDownList to true.
On the page, I have:
<asp:UpdatePanel ID="UpdatePanel" runat="server">
<ContentTemplate>
<MyControl:Control ID="CustomControl" runat="server" />
</ContentTemplate>
</asp:UpdatePanel>
The problem is that the UpdatePanel is not intercepting the CompositeControl's DropDownList's post back. (A full POST is being performed when the DropDownList is changed)
How can I get the UpdatePanel to handle the postback?
Thanks!
| 0 | [
2,
184,
92,
31,
164,
40,
11100,
3206,
532,
20,
18324,
21,
12639,
12898,
22,
18,
2804,
2968,
5739,
800,
3726,
3726,
31,
57,
21,
12639,
12898,
30,
1588,
21,
2804,
2968,
5739,
9,
31,
57,
309,
14,
3108,
6962,
1958,
1354,
16,
14,
280... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What tool to use to compare and reduce css style sheets
===
I have a page (page1.html) which references a css file (style1.css)
All is good.
I need Page1.html to additionally reference Style2.css
However when I add the reference, some stuff on Page1.html screws up.
How can I determine what it is about Style2.css that is causing this problem?
Some diff Tool?
Some Process? | 0 | [
2,
98,
5607,
20,
275,
20,
11590,
17,
4136,
272,
18,
18,
1034,
8801,
800,
3726,
3726,
31,
57,
21,
2478,
13,
5,
6486,
165,
9,
15895,
6,
56,
7231,
21,
272,
18,
18,
3893,
13,
5,
4381,
165,
9,
6824,
18,
6,
65,
25,
254,
9,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Unexpected list comprehension behaviour in Python.
===
I believe I'm getting bitten by some combination of nested scoping rules and list comprehensions. [Jeremy Hylton's blog post][1] is suggestive about the causes, but I don't really understand CPython's implementation well-enough to figure out how to get around this.
Here is an (overcomplicated?) example. If people have a simpler one that demos it, I'd like to hear it. The issue: the list comprehensions using next() are filled with the result from the last iteration.
What exactly is going on with this, and how do I fix this? Do I have to use a standard for loop? Clearly the function is running the correct number of times.
Some hypotheses:
- generators?
- lazy filling of list comprehensions?
**code**
import itertools
def digit(n):
digit_list = [ (x,False) for x in xrange(1,n+1)]
digit_list[0] = (1,True)
return itertools.cycle ( digit_list)
<pre>
>>> D = digit(5)
>>> [D.next() for x in range(5)]
## This list comprehension works as expected
[(1, True), (2, False), (3, False), (4, False), (5, False)]
</pre>
class counter(object):
def __init__(self):
self.counter = [ digit(4) for ii in range(2) ]
self.totalcount=0
self.display = [0,] * 2
def next(self):
self.totalcount += 1
self.display[-1] = self.counter[-1].next()[0]
print self.totalcount, self.display
return self.display
def next2(self,*args):
self._cycle(1)
self.totalcount += 1
print self.totalcount, self.display
return self.display
def _cycle(self,digit):
d,first = self.counter[digit].next()
#print digit, d, first
#print self._display
self.display[digit] = d
if first and digit > 0:
self._cycle(digit-1)
C = counter()
[C.next() for x in range(5)]
[C.next2() for x in range(5)]
**OUTPUT**
<pre>
In [44]: [C.next() for x in range(6)]
1 [0, 1]
2 [0, 2]
3 [0, 3]
4 [0, 4]
5 [0, 1]
6 [0, 2]
Out[44]: [[0, 2], [0, 2], [0, 2], [0, 2], [0, 2], [0, 2]]
In [45]: [C.next2() for x in range(6)]
7 [0, 3]
8 [0, 4]
9 [1, 1]
10 [1, 2]
11 [1, 3]
12 [1, 4]
Out[45]: [[1, 4], [1, 4], [1, 4], [1, 4], [1, 4], [1, 4]]
</pre>
[1]: http://www.python.org/~jeremy/weblog/040204.html | 0 | [
2,
9380,
968,
27300,
7727,
19,
20059,
9,
800,
3726,
3726,
31,
985,
31,
22,
79,
1017,
21749,
34,
109,
3733,
16,
5618,
69,
11530,
3181,
1761,
17,
968,
27300,
18,
9,
636,
1969,
99,
915,
4085,
7141,
22,
18,
8146,
678,
500,
2558,
165... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way to create a disposable singleton in C#
===
I have a singleton that uses the "static readonly T Instance = new T();" pattern. However, I ran into a case where T is disposable, and actually needs to be disposed for unit tests. How can I modify this pattern to support a disposable singleton?
The interface I would like is something like:
var x = Foo.Instance;
var y = Foo.Instance; // x == y
...
x.Release(); // this causes the next Foo.Instance to return a fresh object
// also, it assumes no further operations on x/y will be performed.
Note - the pattern has to be thread-safe, of course.
| 0 | [
2,
246,
161,
20,
1600,
21,
29854,
345,
444,
19,
272,
5910,
800,
3726,
3726,
31,
57,
21,
345,
444,
30,
2027,
14,
13,
7,
18077,
1302,
4965,
13,
38,
4851,
800,
78,
13,
38,
5,
6,
73,
7,
3732,
9,
207,
15,
31,
717,
77,
21,
610,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ADO.NET Data Services Query Interceptor - can anyone tell me the VB syntax of this C#?
===
I am pretty new to VB.NET - and I'm struggling to convert the signature of the method in the following code snippet. The Expression<...>> bit.
Thanks in advance.
[QueryInterceptor("Orders")]
public Expression<Func<Orders,bool>> OnQueryOrders()
{
return o => o.Customer.ContactName ==
HttpContext.Current.User.Identity.Name
}
| 0 | [
2,
21,
537,
9,
2328,
1054,
687,
25597,
13,
24171,
13,
8,
92,
1276,
494,
55,
14,
13,
20468,
22649,
16,
48,
272,
5910,
60,
800,
3726,
3726,
31,
589,
1772,
78,
20,
13,
20468,
9,
2328,
13,
8,
17,
31,
22,
79,
7587,
20,
8406,
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... |
Open a .webarchive on the iphone?
===
Does anyone know if you can open a .webarchive on the iPhone? A .webarchive is Safari's way of packaging up a webpage and it's associated resources into a single file.
I tried creating one and browsing to a link to one in mobile safari, but it didn't work....
| 0 | [
2,
368,
21,
13,
9,
14113,
23941,
27,
14,
21024,
60,
800,
3726,
3726,
630,
1276,
143,
100,
42,
92,
368,
21,
13,
9,
14113,
23941,
27,
14,
21024,
60,
21,
13,
9,
14113,
23941,
25,
25055,
22,
18,
161,
16,
16850,
71,
21,
2741,
6486,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 good to include title="" within your links?
===
I am developing a website and for the main navigation, I was thinking it would be a good idea to include the title attribute.
<a href="/results/" title="Results">Results</a>
Is this a good thing to do? Also, is it good for SEO and accessibility? | 0 | [
2,
25,
32,
254,
20,
468,
581,
3726,
7,
7,
363,
154,
6271,
60,
800,
3726,
3726,
31,
589,
3561,
21,
2271,
17,
26,
14,
407,
8368,
15,
31,
23,
1440,
32,
83,
44,
21,
254,
882,
20,
468,
14,
581,
35,
14755,
9,
13,
1,
58,
746,
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... |
Stop the Bell on CTRL-A (WinForms)
===
Any ideas how to stop the system bell from sounding when CTRL-A is used to select text in a Winforms application?
Here's the problem. Create a Winforms project. Place a text box on the form and add the following event handler on the form to allow CTRL-A to select all the text in the textbox (no matter which control has the focus).
void Form1_KeyDown(object sender, KeyEventArgs e)
{
if (e.KeyCode == Keys.A && e.Modifiers == Keys.Control)
{
System.Diagnostics.Debug.WriteLine("Control and A were pressed.");
txtContent.SelectionStart = 0;
txtContent.SelectionLength = txtContent.Text.Length;
txtContent.Focus();
e.Handled = true;
}
}
It works, but despite e.Handled = true, the system bell will sound every time CTRL-A is pressed. | 0 | [
2,
747,
14,
1988,
27,
13,
4812,
6362,
8,
58,
13,
5,
4181,
4190,
18,
6,
800,
3726,
3726,
186,
3478,
184,
20,
747,
14,
329,
1988,
37,
10879,
76,
13,
4812,
6362,
8,
58,
25,
147,
20,
5407,
1854,
19,
21,
628,
4190,
18,
3010,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to sort using a GridView and LiNQ?
===
The one thing that LINQ seems to be missing for me is a way to reference columns by text string. For example, I have a typical GridView set up with sorting like this (the DataSource is bound to a LINQ query in the code-behind):
<asp:GridView ID="MyGridView" runat="server" AllowSorting="True">
<Columns>
<asp:BoundField DataField="field1" SortExpression="field1" HeaderText="Field 1" />
<asp:BoundField DataField="field2" SortExpression="field2" HeaderText="Field 2" />
<%-- etc. --%>
</Columns>
</asp:GridView>
To get the sorting to work, I have to use two giant Select statements in the MyGridView_Sorting event handler (to handle ascending and descending):
Dim query = From t In context.MyTables
If e.SortDirection = SortDirection.Ascending Then
Select Case e.SortExpression
Case "field1"
query = query.OrderBy(Function(x) x.field1)
Case "field2"
query = query.OrderBy(Function(x) x.field2)
'etc.'
End Select
Else
Select Case e.SortExpression
Case "field1"
query = query.OrderByDescending(Function(x) x.field1)
Case "field2"
query = query.OrderByDescending(Function(x) x.field2)
'etc.'
End Select
End If
There has got to be a better way to do this, doesn't there? I'm getting the field name and sort direction from the grid - you'd think there would be a way to easily feed that to the LINQ query without having to translate it field by field. Anyone have a better way? | 0 | [
2,
98,
25,
14,
246,
161,
20,
2058,
568,
21,
7354,
4725,
17,
6294,
1251,
60,
800,
3726,
3726,
14,
53,
584,
30,
6294,
1251,
2206,
20,
44,
2863,
26,
55,
25,
21,
161,
20,
2801,
7498,
34,
1854,
3724,
9,
26,
823,
15,
31,
57,
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... |
Batch Renaming of Files in a Directory
===
Is there an easy way to rename a group of files already contained in a directory, using Python?
**Example:** I have a directory full of *.doc files and I want to rename them in a consistent way.
> X.doc -> "new(X).doc"
>
> Y.doc -> "new(Y).doc"
| 0 | [
2,
13064,
25934,
16,
6488,
19,
21,
16755,
800,
3726,
3726,
25,
80,
40,
2010,
161,
20,
302,
7259,
21,
214,
16,
6488,
614,
3437,
19,
21,
16755,
15,
568,
20059,
60,
13,
1409,
29041,
45,
1409,
31,
57,
21,
16755,
503,
16,
1637,
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... |
Does anyone know of a good open source comments module?
===
I want to add the ability to submit, moderate and display comments on an existing set of websites. Surely there's already a bunch of open source components that can handle the following:
1. Comment submission
2. Markup validation
3. Private comment moderation
4. Threaded comment display
5. Locally installed (so works seamlessly with my existing registered users)
I've looked at a couple of systems e.g. [disqus][1] and they fall down because their either hosted remotely, or don't hook in to my existing registered set of users.
Our existing systems are implemented in Java, so it would be an added bonus if the commenting system was Java, too.
----------
An interesting aside is that Google turns out to be next to useless for finding commenting modules, due to the sheer volume of pages on the net that contain the word "comment".
[1]: http://disqus.disqus.com "disqus" | 0 | [
2,
630,
1276,
143,
16,
21,
254,
368,
1267,
7534,
12613,
60,
800,
3726,
3726,
31,
259,
20,
3547,
14,
2165,
20,
12298,
15,
8063,
17,
3042,
7534,
27,
40,
3149,
309,
16,
13931,
9,
7608,
80,
22,
18,
614,
21,
7653,
16,
368,
1267,
50... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you set the StartPostion of a Windows Forms form using code?
===
Is there a way to set the StartPosition of a Windows Forms form using code? It seems whatever I try results in the StartPostion being the default.
Here is what I am doing in the form to display:
public DealsForm()
{
InitializeComponent();
this.StartPosition = FormStartPosition.CenterParent;
}
Here is what I am doing to display the form:
private void nvShowDeals_LinkClicked(object sender, LinkLabelLinkClickedEventArgs e)
{
DealsForm frm = new DealsForm();
frm.DataSource = this.Deals;
frm.Show(this);
}
I have tried putting the following in each of the above methods, to no avail:
this.StartPosition = FormStartPosition.CenterParent;
If I set it via the Property Editor ... it works perfectly, but I would **really** like to do it via code.
Should be a no-brainer ... but for the life of me I can't seem to figure it out ... maybe I need more caffeine.
| 0 | [
2,
184,
107,
42,
309,
14,
799,
6962,
872,
16,
21,
1936,
1997,
505,
568,
1797,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
309,
14,
799,
9339,
16,
21,
1936,
1997,
505,
568,
1797,
60,
32,
2206,
2099,
31,
1131,
1736,
19,
14,
799,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Safely change home directory in cygwin
===
I'm trying to safely update the home directory as specified in `/etc/passwd`, but the standard linux utils - usermod and vipw - for doing so aren't provided by cygwin. Could anyone tell me how they changed this in cygwin? If you know where these utils are hiding, that would be great. | 0 | [
2,
9817,
753,
213,
16755,
19,
6728,
263,
4181,
800,
3726,
3726,
31,
22,
79,
749,
20,
9817,
11100,
14,
213,
16755,
28,
9931,
19,
13,
1,
118,
1198,
150,
118,
6201,
14733,
1,
15,
47,
14,
1236,
13024,
13,
14255,
18,
13,
8,
4155,
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... |
Controlling the execution of a Jython script from Java
===
I'm trying to control the execution of a Jython script from within Java and executed through a call to PythonInterpreter.exec(). The script contains calls to classes defined in Java. I'll call these classes "commands" for the discussion here. The commands can also be run on a different machine via RMI.
Since the commands take a while to complete, I want to check the progress of the commands' execution on the caller side, like at what percentage of the execution is complete. I can provide a getProgress() method to the classes but accessing this method seems to be impossible to do because PythonInterpreter doesn't allow the caller access to the command object running inside it.
Any ideas on how to do this? | 0 | [
2,
10106,
14,
5769,
16,
21,
487,
93,
11570,
3884,
37,
8247,
800,
3726,
3726,
31,
22,
79,
749,
20,
569,
14,
5769,
16,
21,
487,
93,
11570,
3884,
37,
363,
8247,
17,
5557,
120,
21,
645,
20,
20059,
22945,
106,
9,
1706,
3319,
5,
6,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Compare two MySQL databases
===
I have a database in MySQL that I am currently developing. I have a copy of this database on my development machine which I modify as fast as I develop and a copy on a test server. My question is:
Is there a way to compare the two instances of the database to see if there was any changes?
Its not a real problem to simply re-deploy the database on the test server but as the end user's start entering test data it could be a bit tricky. A related question is also relevant a little later on in production...
Is there an easy way to incrementally make changes to the production database? That is, suppose I add one new table and modified one existing table, are there tools that will detect the changes and generate scripts that will safely perform the updates on the production copy of the database? | 4 | [
2,
11590,
81,
51,
18,
22402,
6018,
18,
800,
3726,
3726,
31,
57,
21,
6018,
19,
51,
18,
22402,
30,
31,
589,
871,
3561,
9,
31,
57,
21,
4344,
16,
48,
6018,
27,
51,
522,
1940,
56,
31,
17579,
28,
1512,
28,
31,
2803,
17,
21,
4344,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Changing the Text in Internet Explorer (7.0) title bar and Tab
===
When i open some website, can i as a end-user make the Text printed in the IE title bar at top disappear(make it blank or change it to my own text).
e.g. While typing this question my IE title bar says
**Ask a Question - Stack Overflow - Windows Internet Explorer**
I want to make that blank without at my browser end by way of some IE settings/Windows settings/registry settings etc. Is it possible?
Also is it possible to make the text on IE windows Tab to go blank/customize the text in similar ways??
Just want to keep my SO browsing sessions at work, unnoticed as far as possible!!
-AD
| 0 | [
2,
4226,
14,
1854,
19,
2620,
8520,
13,
5,
465,
9,
387,
6,
581,
748,
17,
6523,
800,
3726,
3726,
76,
31,
368,
109,
2271,
15,
92,
31,
28,
21,
241,
8,
16704,
233,
14,
1854,
5317,
19,
14,
13,
660,
581,
748,
35,
371,
10866,
5,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to determine which process is holding a file in Windows
===
Sometimes you cannot delete a file that is used by some other process in Windows. Error can be something like "sharing violation".
Is there any way to determine which process is holding a file?
Is there any utility that can do that (I can use utility call in a program) or is there any other way to get that information?
| 0 | [
2,
184,
20,
3746,
56,
953,
25,
1337,
21,
3893,
19,
1936,
800,
3726,
3726,
1030,
42,
1967,
27448,
21,
3893,
30,
25,
147,
34,
109,
89,
953,
19,
1936,
9,
7019,
92,
44,
301,
101,
13,
7,
25213,
12120,
7,
9,
25,
80,
186,
161,
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... |
Simple Geographic Data Sources for a Web App
===
For a web app I'm working on, I need to know the lat/lon of about 300 US cities. I also need to know the lat/lon for every US zip code.
Does anyone know of a free source to get this information? | 0 | [
2,
1935,
9225,
1054,
2662,
26,
21,
2741,
4865,
800,
3726,
3726,
26,
21,
2741,
4865,
31,
22,
79,
638,
27,
15,
31,
376,
20,
143,
14,
14303,
118,
3226,
16,
88,
3565,
182,
1920,
9,
31,
67,
376,
20,
143,
14,
14303,
118,
3226,
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... |
Save Windows Form Size
===
I'm developing a piece in VB.NET. Inside my primary form, I'm creating a new form to use as a dialog. I was wondering if there was a way to, upon the close of the new dialog, save it's size settings for each user (probably in a file on their machine, through XML or something?) | 0 | [
2,
2079,
1936,
505,
1072,
800,
3726,
3726,
31,
22,
79,
3561,
21,
1855,
19,
13,
20468,
9,
2328,
9,
572,
51,
1256,
505,
15,
31,
22,
79,
2936,
21,
78,
505,
20,
275,
28,
21,
28223,
9,
31,
23,
5712,
100,
80,
23,
21,
161,
20,
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... |
can I put a <style>...</style> tag within the body of an HTML file?
===
Since a lot of email clients ignore the HEAD tag, can I embed an inline stylesheet in the body? | 0 | [
2,
92,
31,
442,
21,
13,
1,
4381,
1,
9,
9,
9,
1,
118,
4381,
1,
3383,
363,
14,
358,
16,
40,
13,
15895,
3893,
60,
800,
3726,
3726,
179,
21,
865,
16,
8517,
7421,
7174,
14,
157,
3383,
15,
92,
31,
11911,
69,
40,
19,
1143,
1034,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Syntax highlighting when pasting into emails
===
Im in the situation that I often send small codesnippets and xml-snippets to coworkers and partners via my outlook.
Has anyone got a good idea or tool that I can use to have my pastes syntaxhighlighted before I paste them into an email.
I was thinking of an intermediate paste to "$fancytool" and then I would have something to copy that will htmlified so I can copy paste it into the "compose email" window. | 0 | [
2,
22649,
23102,
76,
640,
68,
77,
8517,
18,
800,
3726,
3726,
797,
19,
14,
1858,
30,
31,
478,
2660,
284,
1797,
29061,
18,
17,
23504,
8,
29061,
18,
20,
326,
16355,
17,
4724,
1197,
51,
19837,
9,
63,
1276,
330,
21,
254,
882,
54,
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... |
Validating and Extracing XML record by record into Database
===
Here's the deal. I have an XML document with a lot of records. Something like this:
print("<?xml version="1.0" encoding="utf-8" ?>
<Orders>
<Order>
<Phone>1254</Phone>
<City>City1</City>
<State>State</State>
</Order>
<Order>
<Phone>98764321</Phone>
<City>City2</City>
<State>State2</State>
</Order>
</Orders>");
There's also an XSD schema file. I would like to extract data from this file and insert these records into a database table. First of course I would like to validate each order record. For example if there are 5 orders in the file and 2 of them fail validation I would like to insert the 3 that passed validation into the db and left the other 2. There can be thousands of records in one xml file. What would be the best approach here. And how would the validation go for this since I need to discard the failed records and only use the ones that passed validation. At the moment I'm using <b>XmlReaderSettings</b> to validate the XML document records. Should I extract these records into another XML file or a Dataset or a custom object before I insert into a DB. I'm using .Net 3.5. Any code or link is welcome. | 0 | [
2,
7394,
1880,
17,
2230,
6302,
23504,
571,
34,
571,
77,
6018,
800,
3726,
3726,
235,
22,
18,
14,
1183,
9,
31,
57,
40,
23504,
4492,
29,
21,
865,
16,
742,
9,
301,
101,
48,
45,
4793,
5,
7,
1,
60,
396,
8184,
615,
3726,
7,
165,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.