unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
url rewriting vs url routing
===
I was planning to use url routing for a Web Forms application. But, after reading some [posts][1], I am not sure if it is an easy approach.
Is it better to use the [URL Rewrite module][2] for web forms? But, it is only for IIS7. Initially, there was some buzz that URL routing is totally decoupled from Asp.Net MVC and it could be used for web forms.
Would love to hear any suggestions..
[1]: http://learn.iis.net/page.aspx/496/iis-url-rewriting-and-aspnet-routing/
[2]: http://learn.iis.net/page.aspx/460/using-url-rewrite-module/ | 0 | [
2,
287,
6362,
302,
12646,
4611,
287,
6362,
19880,
800,
3726,
3726,
31,
23,
2334,
20,
275,
287,
6362,
19880,
26,
21,
2741,
1997,
3010,
9,
47,
15,
75,
1876,
109,
636,
6962,
18,
500,
2558,
165,
500,
15,
31,
589,
52,
562,
100,
32,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I use .Net Generics to inherit a template parameter?
===
**I want to be able to do this.**
MyInterface interface = new ServiceProxyHelper<ProxyType>();
**Here's the object structure**
MyTypeThatImplementsMyInterface : MyInterface
**Will this work?**
public class ProxyType : MyInterface {}
public class ServiceProxyHelper<ProxyType> : IDisposable, MyInterface {}
| 0 | [
2,
184,
107,
31,
275,
13,
9,
2328,
12733,
18,
20,
17569,
21,
22894,
18906,
60,
800,
3726,
3726,
13,
1409,
49,
259,
20,
44,
777,
20,
107,
48,
9,
1409,
51,
6280,
6413,
6573,
800,
78,
365,
4899,
9229,
14593,
106,
1,
4899,
9229,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Symlink in windows XP
===
The question is how to make the similar thing like symlink in windows like in *nix. It's really hard to write whole path to the file in console (even using [tab], it's not the way if you need to change language). Adding everything in PATH is tiring too. It'll be great to make a symlink running one command.
Actually I'm looking for console app. | 0 | [
2,
13,
7261,
6258,
19,
1936,
23045,
800,
3726,
3726,
14,
1301,
25,
184,
20,
233,
14,
835,
584,
101,
13,
7261,
6258,
19,
1936,
101,
19,
1637,
14064,
9,
32,
22,
18,
510,
552,
20,
2757,
979,
2013,
20,
14,
3893,
19,
8650,
13,
5,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to Desgin for Saving Incomplete Data entered by user?
===
We have a Dot net Win forms Application which has few Forms with more than 40 fields to fill.
When the User fills say 25 fields and then realizes that he needs to get some more data before he can save the information or He enter all the data but their is some Business validation error on which needs contact someone else before correcting.
In such scenarios, he would like to save the incomplete or Incorrect data to some temporary data storage and retrieve it later when he has the data to complete the save operation.
Please let me know what would be the best way to implement this?
He are few options we considered:
1) create XML blob and save on his local machine (But, user may need it from some other machine)
2) Create duplicate tables to store invalid data (But, I feel Invalid data should never be part of my database)
| 0 | [
2,
184,
20,
1746,
5831,
26,
7599,
14011,
1054,
1297,
34,
4155,
60,
800,
3726,
3726,
95,
57,
21,
14123,
4275,
628,
1997,
3010,
56,
63,
310,
1997,
29,
91,
119,
1417,
2861,
20,
3509,
9,
76,
14,
4155,
3509,
18,
395,
771,
2861,
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... |
http PUT a file to S3 presigned URLs using ruby
===
Anyone got a working example of using ruby to post to a presigned URL on s3
| 0 | [
2,
7775,
442,
21,
3893,
20,
13,
18,
240,
782,
13472,
13,
911,
7532,
568,
10811,
800,
3726,
3726,
1276,
330,
21,
638,
823,
16,
568,
10811,
20,
678,
20,
21,
782,
13472,
287,
6362,
27,
13,
18,
240,
3,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Integrating with Google Docs
===
Has anyone integrated an "Open in Google Docs" in their web app yet? Gmail has this for opening attachments. How about any other sightings of this in a *non-google* web app?
| 0 | [
2,
24529,
29,
8144,
9765,
18,
800,
3726,
3726,
63,
1276,
5547,
40,
13,
7,
10157,
19,
8144,
9765,
18,
7,
19,
66,
2741,
4865,
768,
60,
489,
8079,
63,
48,
26,
1214,
14575,
18,
9,
184,
88,
186,
89,
2064,
68,
18,
16,
48,
19,
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,
0,
0,
0,
0,
0,
0,
0... |
Is there a way to compile C++ code to Microsoft's CIL "bytecode"?
===
i.e., a web browser client would be written in C++ !!! | 0 | [
2,
25,
80,
21,
161,
20,
26561,
272,
20512,
1797,
20,
7099,
22,
18,
13,
12837,
13,
7,
23246,
9375,
7,
60,
800,
3726,
3726,
31,
9,
62,
9,
15,
21,
2741,
16495,
6819,
83,
44,
642,
19,
272,
20512,
13,
28116,
3,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I create a sql dependency ona table in sql server 2000 and asp.net 2.0?
===
I need to create a sql dependency on a table in sql server 2000 in my asp.net 2.0 pages.
What are the required actions and what is the best way? | 0 | [
2,
184,
107,
31,
1600,
21,
4444,
255,
26835,
27,
58,
859,
19,
4444,
255,
8128,
824,
17,
28,
306,
9,
2328,
172,
9,
387,
60,
800,
3726,
3726,
31,
376,
20,
1600,
21,
4444,
255,
26835,
27,
21,
859,
19,
4444,
255,
8128,
824,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Java: How can I see what parts of my code are running the most?
===
I am writing a simple checkers game in Java. When I mouse over the board my processor ramps up to 50% (100% on a core).
I would like to find out what part of my code(assuming its my fault) is executing during this.
I have tried debugging, but step-through debugging doesn't work very well in this case.
Is there any tool that can tell me where my problem lies? | 0 | [
2,
8247,
45,
184,
92,
31,
196,
98,
1341,
16,
51,
1797,
50,
946,
14,
127,
60,
800,
3726,
3726,
31,
589,
1174,
21,
1935,
2631,
445,
250,
19,
8247,
9,
76,
31,
7567,
84,
14,
686,
51,
14762,
9960,
18,
71,
20,
10496,
13,
5,
1036,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Make a div fill the remaining screen space
===
I am currently working on a web application, where I want the content to fill the entire screen. I have a header `div` and a content `div`. At the moment I am using a table for the layout like so:
CSS:
#page {
height: 100%;
}
#tdcontent {
height: 100%;
}
HTML:
<table id="page">
<tr><td id="tdheader">
<div id="header">...</div>
</td></tr>
<tr><td id="tdcontent>
<div id="content">...</div>
</td>
</table>
Which works how I like. The table remains at 100%, and the `tdcontent` element is always less than 100%. Is there a way to achieve the same effect without using the `table`? | 0 | [
2,
233,
21,
13,
12916,
3509,
14,
1846,
2324,
726,
800,
3726,
3726,
31,
589,
871,
638,
27,
21,
2741,
3010,
15,
113,
31,
259,
14,
2331,
20,
3509,
14,
1078,
2324,
9,
31,
57,
21,
157,
106,
13,
1,
12916,
1,
17,
21,
2331,
13,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Width issue with Ext.Panel bbar in IE 6
===
I've just run into a display glitch in IE6 with the ExtJS framework. - Hopefully someone can point me in the right direction.
In the following example, the bbar for the panel is displayed 2ems narrower than the panel it is attached to (it's left aligned) in IE6, where as in Firefox it is displayed as the same width as the panel.
Can anyone suggest how to fix this?
I seem to be able to work around either by specifying the width of the panel in ems or the padding in pixels, but I assume it would be expected to work as I have it below.
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<link rel="stylesheet" type="text/css" href="ext/resources/css/ext-all.css"/>
<script type="text/javascript" src="ext/ext-base.js"></script>
<script type="text/javascript" src="ext/ext-all-debug.js"></script>
<script type="text/javascript">
Ext.onReady(function(){
var main = new Ext.Panel({
renderTo: 'content',
bodyStyle: 'padding: 1em;',
width: 500,
html: "Alignment issue in IE - The bbar's width is 2ems less than the main panel in IE6.",
bbar: [
"->",
{id: "continue", text: 'Continue'}
]
});
});
</script>
</head>
<body>
<div id="content"></div>
</body>
</html>
| 0 | [
2,
9456,
1513,
29,
1396,
38,
9,
3206,
532,
334,
1850,
19,
13,
660,
400,
800,
3726,
3726,
31,
22,
195,
114,
485,
77,
21,
3042,
13,
6441,
9744,
19,
13,
660,
379,
29,
14,
1396,
38,
728,
18,
6596,
9,
13,
8,
13416,
737,
92,
454,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Pseudo random generator, Assembler
===
Which "random" numbers generator algorithm is the best for an assembler program? Something easy, not a long piece of code | 0 | [
2,
8452,
5477,
15286,
15,
13,
13736,
139,
800,
3726,
3726,
56,
13,
7,
2195,
5555,
7,
2116,
15286,
9083,
25,
14,
246,
26,
40,
13,
13736,
139,
625,
60,
301,
2010,
15,
52,
21,
175,
1855,
16,
1797,
3,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Can I merge two Microsoft Word documents reliably with Subversion?
===
We have concurrent edits happening on Word documents and I want to make sure that Subversion can handle merging .doc files. Do you know if Subversion handles merges of Word documents well? | 0 | [
2,
92,
31,
12666,
81,
7099,
833,
4374,
13,
19003,
4801,
29,
972,
10898,
60,
800,
3726,
3726,
95,
57,
19513,
9392,
18,
4942,
27,
833,
4374,
17,
31,
259,
20,
233,
562,
30,
972,
10898,
92,
3053,
18842,
13,
9,
13799,
6488,
9,
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,
0,
0,
0,
0... |
What is the difference between gcc optimization levels?
===
What is the difference between different optimization levels in GCC? Assuming I don't care to have any debug hooks, why wouldn't I just use the highest level of optimization available to me? does a higher level of optimization necessarily (i.e. provably) generate a faster program? | 0 | [
2,
98,
25,
14,
2841,
128,
489,
3384,
21597,
2216,
60,
800,
3726,
3726,
98,
25,
14,
2841,
128,
421,
21597,
2216,
19,
489,
3384,
60,
11704,
31,
221,
22,
38,
781,
20,
57,
186,
121,
16254,
5559,
18,
15,
483,
1265,
22,
38,
31,
114,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why would a region of memory be marked non-cached?
===
In an embedded application, we have a table describing the various address ranges that are valid on out target board. This table is used to setup the MMU.
The RAM address range is marked as cacheable, but other regions are marked at not cacheable. Why is that? | 0 | [
2,
483,
83,
21,
632,
16,
1912,
44,
2739,
538,
8,
793,
6261,
60,
800,
3726,
3726,
19,
40,
12138,
3010,
15,
95,
57,
21,
859,
7153,
14,
617,
3218,
9230,
30,
50,
7394,
27,
70,
2935,
686,
9,
48,
859,
25,
147,
20,
18161,
14,
1620,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 from pdf to word document
===
please can anybody tell me how convert from pdf to word document? | 4 | [
2,
8406,
37,
13,
11124,
20,
833,
4492,
800,
3726,
3726,
2247,
92,
11181,
494,
55,
184,
8406,
37,
13,
11124,
20,
833,
4492,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
BitmapDrawable deprecated alterantive
===
I have the following code that will rotate a drawable by a set amount of degrees.
public Drawable rotateDrawable(float angle, Context context)
{
Bitmap arrowBitmap = BitmapFactory.decodeResource(context.getResources(), R.drawable.generic2rb);
// Create blank bitmap of equal size
Bitmap canvasBitmap = arrowBitmap.copy(Bitmap.Config.ARGB_8888, true);
canvasBitmap.eraseColor(0x00000000);
// Create canvas
Canvas canvas = new Canvas(canvasBitmap);
// Create rotation matrix
Matrix rotateMatrix = new Matrix();
rotateMatrix.setRotate(angle, canvas.getWidth()/2, canvas.getHeight()/2);
//Draw bitmap onto canvas using matrix
canvas.drawBitmap(arrowBitmap, rotateMatrix, null);
return new BitmapDrawable(canvasBitmap);
}
The new SDK says that the
BitmapDrawable(canvasBitmap);
is deprecated. Any alternatives at all?
http://developer.android.com/reference/android/graphics/drawable/BitmapDrawable.html | 0 | [
2,
1142,
15022,
43,
12404,
579,
121,
3515,
150,
1669,
7835,
5578,
195,
800,
3726,
3726,
31,
57,
14,
249,
1797,
30,
129,
21448,
21,
2003,
579,
34,
21,
309,
2006,
16,
4442,
9,
317,
2003,
579,
24107,
12404,
579,
5,
14712,
721,
5334,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Query for null records where filestream is enabled
===
I have a table that we just enabled FileStreams on. We created a new varbinary column and set it to store to a filestream. Then we copied everything from the existing column to the new one in order to get the file data pushed to the file system.
So far so good.
However, we weren't able to take the DB offline while doing this (uptime SLA) and there were 2 records out of 7400 that came in *after* the update statement ran but before we renamed the columns. We currently have 2 columns: `FileData` and `FileDataOld`. Where `FileData` is the one tied to the filestream.
The average file size is a little over 2MB. So, I decided to run a very simple select statement to find the records that didn't go:
select DocumentId, FileName
from docslist
where FileData is null
When I ran this query, the CPU spiked to 80% and sat there for quite a while. Ultimately I killed the select after 2 minutes because that was just insane.
If I run something like:
select DocumentId, FileName from docslist
It returns almost instantly.
However, as soon as I try to query where `FileData` or `FileDataOld` is null it spins off into forever land.
When using Resource Monitor, and I query for 'FileData is null', I can see it pulling every byte from every single document off the file system. Which is pretty odd; you'd think that info would be stored within the table itself.
If I query for `FileDataOld is null`, it looks like it's trying to load the entire table (16GB) in memory.
How can I improve this?? I just need to get the 2 records that happened after the update statement and force those documents to move over.
| 0 | [
2,
25597,
26,
16203,
742,
113,
3893,
11260,
25,
9338,
800,
3726,
3726,
31,
57,
21,
859,
30,
95,
114,
9338,
3893,
11260,
18,
27,
9,
95,
679,
21,
78,
4033,
4772,
1857,
4698,
17,
309,
32,
20,
1718,
20,
21,
3893,
11260,
9,
94,
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... |
Salesforce Java script join or reference queries
===
I am trying to select data from a couple objects at the same time using Javascript.
I want to select the LOB__C, risk_state__c FROM Opportunity and the Contact's firstname and lastname that is related to that Opportunity. I can't figure out how to do that.
Thanks guys. | 0 | [
2,
2598,
8774,
8247,
3884,
1865,
54,
2801,
9386,
2829,
800,
3726,
3726,
31,
589,
749,
20,
5407,
1054,
37,
21,
1335,
3916,
35,
14,
205,
85,
568,
8247,
8741,
9,
31,
259,
20,
5407,
14,
13,
10904,
1,
150,
15,
2029,
1,
3859,
1,
150... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Converting datetime object to timestamp and back gives me a different time
===
I have encountered this problem today and I don't have an explanation for it.
I have a python datetime object:
dt = datetime.datetime(2012, 3, 31, 18, 30, 48, tzinfo=<FixedOffset '-04:00'>)
which, to my understanding is 18:30 in a time zone offset from UTC by 4 hours.
I then tried to convert it to timestamp like so:
epo = time.mktime(dt.timetuple()) and get back 1333247448.0.
However, when I try to convert it back to make sure it's correct using date
time.datetime.fromtimestring(epo),
I get back
datetime.datetime(2012, 3, 31, 19, 30, 48)
Notice that time is 19 not 18.
Can anybody tell me why it's doing that?
Thanks!
Luka | 0 | [
2,
19583,
1231,
891,
3095,
20,
436,
38,
10158,
17,
97,
2352,
55,
21,
421,
85,
800,
3726,
3726,
31,
57,
8208,
48,
1448,
786,
17,
31,
221,
22,
38,
57,
40,
5764,
26,
32,
9,
31,
57,
21,
20059,
1231,
891,
3095,
45,
13,
43,
38,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
match a double quoted-string with double-quote inside
===
I have this python string:
string = '"/dev/null" "" "19/1333329478.9381399" 0 1 "cam-foo" 64 900.0 "Foo x rev scan of test" "/usr/bin/env ""PATH=/bin:/usr/bin:/sbin:/usr/sbin:/usr/local/bin:$PATH"" python app.py" 60.145855 2.034689'
I need a regex that gives me a list of every element in this string.
Element: any number or any string contained in a double quote. A string can contain a double quote.
I've come out with this regex:
import re
p = re.compile(r'"[^"]*"|[-\.\d]+')
p.findall(string)
['"/dev/null"', '""', '"19/1333329478.9381399"', '0', '1', '"cam-foo"', '64', '900.0', '"Foo x rev scan of test"', '"/usr/bin/env "', '"PATH=/bin:/usr/bin:/sbin:/usr/sbin:/usr/local/bin:$PATH"', '" python app.py"', '60.145855', '2.034689']
As you can see I miss the part of double-quote inside the string. **Double-quote inside an element should be ignored.** I'd like to have this result:
['"/dev/null"', '""', '"19/1333329478.9381399"', '0', '1', '"cam-foo"', '64', '900.0', '"Foo x rev scan of test"', '"/usr/bin/env ""PATH=/bin:/usr/bin:/sbin:/usr/sbin:/usr/local/bin:$PATH"" python app.py"', '60.145855', '2.034689']
Instead to have:
['"/usr/bin/env "', '"PATH=/bin:/usr/bin:/sbin:/usr/sbin:/usr/local/bin:$PATH"', '" python app.py"']
I'd like to have only one element:
'"/usr/bin/env ""PATH=/bin:/usr/bin:/sbin:/usr/sbin:/usr/local/bin:$PATH"" python app.py"'
Anyone can help me?
| 0 | [
2,
730,
21,
1494,
9591,
8,
11130,
29,
1494,
8,
8970,
591,
572,
800,
3726,
3726,
31,
57,
48,
20059,
3724,
45,
3724,
800,
13,
22,
7,
118,
14438,
118,
4215,
211,
7,
13,
7,
7,
13,
7,
1433,
118,
1543,
20165,
26082,
4130,
9,
4069,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 would I store a date that can be partial (i.e. just the year, maybe the month too) and output it later with the same specifity?
===
I want to let users specify a date that may or may not include a day and month (but will have at least the year.) The problem is when it is stored as a datetime in the DB; the missing day/month will be saved as default values and I'll lose the original format and meaning of the date.
My idea was to store the real format in a column as a string in addition to the datetime column. Then I could use the string column whenever I have to display the date and the datetime for everything else. The downside is an extra column for every date column in the table I want to display, and printing localized dates won't be as easy since I can't rely on the datetime value... I'll probably have to parse the string.
I'm hoping I've overlooked something and there might be an easier way.
(Note I'm using Rails if it matters for a solution.) | 0 | [
2,
184,
83,
31,
1718,
21,
1231,
30,
92,
44,
7284,
13,
5,
49,
9,
62,
9,
114,
14,
159,
15,
913,
14,
1617,
266,
6,
17,
5196,
32,
138,
29,
14,
205,
12737,
821,
856,
60,
800,
3726,
3726,
31,
259,
20,
408,
3878,
19077,
21,
1231,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 segment my Palm OS 68K application?
===
If you have an 68K application written using CodeWarrior for Palm OS, how do you assign individual functions to different segments without manually moving files around in the segment tab in the IDE? | 0 | [
2,
184,
92,
31,
5631,
51,
3044,
13,
759,
7936,
197,
3010,
60,
800,
3726,
3726,
100,
42,
57,
40,
7936,
197,
3010,
642,
568,
1797,
1885,
928,
248,
26,
3044,
13,
759,
15,
184,
107,
42,
13952,
1359,
3719,
20,
421,
9061,
366,
23671,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
In-house full-text search engine for source code and SQL scripts
===
I like to run search engine on code, and if you aren't I recommend it (especially if you code in a team and you don't have all the lines of code in your head). When I vaguely remember some variable name or class name, but I can't remember where I saw it, I just run the search. Pre-indexed full-text search system is way faster than `grep`ing your entire codebase.
Which full-text search system do you recommend to index source code?
- Easy setup is a plus
- Good literal handling (e.g. "UPPER_CASE" symbols {}#$) is a plus
- Good search options (e.g. AND, OR, -foo, site:thisproject) are plus
- Code formatting is a plus
- Non-ascii encoding handling is a plus
- In-house web-access is required
I use [Hyper Estraier][1], but [Namazu][2] is also well-known.
[1]: http://hyperestraier.sourceforge.net/
[2]: http://www.namazu.org/index.html.en | 0 | [
2,
19,
8,
1682,
503,
8,
11969,
2122,
1406,
26,
1267,
1797,
17,
4444,
255,
17505,
800,
3726,
3726,
31,
101,
20,
485,
2122,
1406,
27,
1797,
15,
17,
100,
42,
4847,
22,
38,
31,
12360,
32,
13,
5,
12183,
100,
42,
1797,
19,
21,
173,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
selling points of Agile practices
===
My company is using waterfall methodologies for software development. I want to convince the senior management about the advantages of agile practices. Which would be the most selling points about the benefits of agile development methodologies and practices? | 4 | [
2,
4355,
819,
16,
27475,
5242,
800,
3726,
3726,
51,
237,
25,
568,
12927,
2109,
13331,
18,
26,
2306,
522,
9,
31,
259,
20,
6218,
14,
1101,
1097,
88,
14,
14683,
16,
27475,
5242,
9,
56,
83,
44,
14,
127,
4355,
819,
88,
14,
5800,
16... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
switch to parallel coding
===
we all writing code for single processor.
i wonder when we all are able to write code on multi processors?
what do we need (software tools, logic, algorithms) for this switching?
| 0 | [
2,
5521,
20,
3821,
13,
15458,
800,
3726,
3726,
95,
65,
1174,
1797,
26,
345,
14762,
9,
31,
2666,
76,
95,
65,
50,
777,
20,
2757,
1797,
27,
1889,
21034,
60,
98,
107,
95,
376,
13,
5,
12980,
5011,
4672,
15,
7085,
15,
15935,
6,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
RDBMS & OOP-friendly Python web app framework?
===
Suppose your boss told you to choose a Python web application framework, and you would be wedded to it for at least the next 3 years.
What would you recommend?
Ground rules:
- **Python**: Yes, required. (Ruby+ not an option for reasons irrelevant. Case
closed.)
- **Custom/Hybrid Setups**: Sure... if they are defensible on technical grounds.
- **Upgrades**: Yes. Upgrades allowed promptly, even for pre-1.0 release software.
Pylons? Django? Mako? Genshi? CherryPy? Cheetah?
| 0 | [
2,
13,
897,
13178,
18,
279,
13,
21709,
8,
15950,
20059,
2741,
4865,
6596,
60,
800,
3726,
3726,
5787,
154,
4054,
470,
42,
20,
3538,
21,
20059,
2741,
3010,
6596,
15,
17,
42,
83,
44,
12914,
7424,
20,
32,
26,
35,
639,
14,
328,
203,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the easiest way to merge (server-side) a collection of PDF documents into one big PDF document in JAVA
===
I have 3 PDF documents that are generated on the fly by a legacy library that we use, and written to disk. What's the easiest way for my JAVA server code to grab these 3 documents and turn them into one long PDF document where it's just all the pages from document #1, followed by all the pages from document #2, etc.
Ideally I would like this to happen in memory so I can return it as a stream to the client, but writing it to disk is also an option. | 0 | [
2,
98,
22,
18,
14,
27237,
161,
20,
12666,
13,
5,
10321,
106,
8,
1416,
6,
21,
1206,
16,
13,
11124,
4374,
77,
53,
580,
13,
11124,
4492,
19,
8247,
800,
3726,
3726,
31,
57,
203,
13,
11124,
4374,
30,
50,
6756,
27,
14,
2855,
34,
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... |
SQL Server sys.databases log_reuse_wait question
===
I was investigating the rapid growth of a SQL Server 2005 transaction log when I found that transaction logs will only truncate correctly - if the sys.databases "log_reuse_wait" column is set to 0 - meaning that nothing is keeping the transaction log from reusing existing space.
One day when I was intending to backup/truncate a log file, I found that this column had a 4, or ACTIVE_TRANSACTION going on in the tempdb. I then checked for any open transactions using DBCC OPENTRAN, and the open_tran column from sysprocesses. The result was that I could find no active transactions anywhere in the system.
Are the settings in the log_reuse_wait column accurate? Are there transactions going on that are not detectable using the methods I described above? Am I just missing something obvious?
| 0 | [
2,
4444,
255,
8128,
10315,
18,
9,
18768,
8436,
18,
6738,
1,
99,
3699,
1,
8195,
1301,
800,
3726,
3726,
31,
23,
12490,
14,
4470,
2232,
16,
21,
4444,
255,
8128,
812,
12799,
6738,
76,
31,
216,
30,
12799,
18893,
129,
104,
22328,
62,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Getting PHP to read .doc files on Linux
===
I'm trying to read a .doc file into a database so that I can index it's contents. Is there an easy way for PHP on Linux to read .doc files? Failing that is it possible to convert .doc files to rtf, pdf or some other 'open' format that is easy to read?
Note, I am not interested in .docx files. | 0 | [
2,
1017,
13,
26120,
20,
1302,
13,
9,
13799,
6488,
27,
13024,
800,
3726,
3726,
31,
22,
79,
749,
20,
1302,
21,
13,
9,
13799,
3893,
77,
21,
6018,
86,
30,
31,
92,
4348,
32,
22,
18,
8478,
9,
25,
80,
40,
2010,
161,
26,
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... |
How to do hierarchical build with rake?
===
I recently started using Rake to build some of my (non-ruby) packages. Rake is nice, but what I found missing is a way to do hierarchical builds (aggregate Rakefiles in subdirectories). Since this is a common feature in most other build tools, I'm wondering if someone more familiar with Rake has a good solution. | 0 | [
2,
184,
20,
107,
21376,
4272,
1895,
29,
21009,
60,
800,
3726,
3726,
31,
1989,
373,
568,
21009,
20,
1895,
109,
16,
51,
13,
5,
3951,
8,
1820,
779,
6,
16875,
9,
21009,
25,
2210,
15,
47,
98,
31,
216,
2863,
25,
21,
161,
20,
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... |
How do I specify multiple data sets to an XY-scatter plot using the Google Chart API?
===
Why doesn't this Google Chart API URL render both data sets on this XY scatter plot?
http://chart.apis.google.com/chart?cht=lxy&chd=t:10,20,30,40,50,60,70,80,90,100,110,120,130,140,150,160,170,180,190,200|0.10,0.23,0.33,0.44,0.56,0.66,0.79,0.90,0.99,1.12,1.22,1.33,1.44,1.56,1.68,1.79,1.90,2.02,2.12,2.22|0.28,0.56,0.85,1.12,1.42,1.68,1.97,2.26,2.54,2.84,3.12,3.40,3.84,4.10,4.53,4.80,5.45,6.02,6.40,6.80&chco=3072F3,ff0000,00aaaa&chls=2,4,1&chs=320x240&chds=0,201,0,7&chm=s,FF0000,0,-1,5|s,0000ff,1,-1,5|s,00aa00,2,-1,5
I've read the <a href="http://code.google.com/apis/chart/">documentation</a> over and over again, and I can't figure it out.
| 0 | [
2,
184,
107,
31,
19077,
1886,
1054,
3415,
20,
40,
13,
15161,
8,
18,
5782,
815,
3798,
568,
14,
8144,
1795,
21,
2159,
60,
800,
3726,
3726,
483,
1437,
22,
38,
48,
8144,
1795,
21,
2159,
287,
6362,
16535,
156,
1054,
3415,
27,
48,
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... |
Exit Shell Script Based on Process Exit Code
===
I have a shell script that executes a number of commands, and if any of the commands exit with a non-zero exit code the shell script should exit. | 0 | [
2,
4350,
3593,
3884,
432,
27,
953,
4350,
1797,
800,
3726,
3726,
31,
57,
21,
3593,
3884,
30,
15644,
18,
21,
234,
16,
14294,
15,
17,
100,
186,
16,
14,
14294,
4350,
29,
21,
538,
8,
15938,
4350,
1797,
14,
3593,
3884,
378,
4350,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How can I know why one of my vxWorks task is pended?
===
In vxWorks, I can issue the "i" command in the shell, and I get the list of tasks in my system along with some information like the following example:
<pre>
NAME ENTRY TID PRI STATUS PC SP ERRNO DELAY
---------- ------------ -------- --- ---------- -------- -------- ------- -----
tJobTask 1005a6e0 103bae00 0 PEND 100e5860 105fffa8 0 0
tExcTask 10059960 10197cbc 0 PEND 100e5860 101a0ef4 0 0
tLogTask logTask 103bed78 0 PEND 100e37cd 1063ff24 0 0
tNbioLog 1005b390 103bf210 0 PEND 100e5860 1067ff54 0 0
</pre>
For the tasks that are pended, I would like to know what they are pended on.
Is there a way to do this? | 0 | [
2,
184,
92,
31,
143,
483,
53,
16,
51,
566,
396,
7684,
3005,
25,
351,
10726,
60,
800,
3726,
3726,
19,
566,
396,
7684,
15,
31,
92,
1513,
14,
13,
7,
49,
7,
1202,
19,
14,
3593,
15,
17,
31,
164,
14,
968,
16,
8674,
19,
51,
329,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Learning PHP for fun and profit
===
I'm currently working as an applications developer, with a Java and C++ background, but I'd like to be able to work on more web-based projects.
I was originally thinking of learning one of the newer languages, but I suspect that there'll be more value to learning php, as that's what most legacy code's written in. Hopefully then moving on from there to the newer, cleaner technologies.
Does anyone have any advice on good ways to learn php, good beginner projects to write in php, or does anyone disagree with my suspicion completely, and have a better technology for me to start with?
Thanks | 0 | [
2,
2477,
13,
26120,
26,
2414,
17,
8583,
800,
3726,
3726,
31,
22,
79,
871,
638,
28,
40,
3767,
10058,
15,
29,
21,
8247,
17,
272,
20512,
2395,
15,
47,
31,
22,
43,
101,
20,
44,
777,
20,
170,
27,
91,
2741,
8,
1281,
2314,
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... |
Why would one use REST instead of Web services?
===
Attended an interesting demo on REST today, however, I couldn't think of a single reason (nor was one presented) why REST is in anyway better or simpler to use and implement than a Web Services stack.
What are some of the reasons Why anyone in the "real world" use REST instead of the Web Services? | 0 | [
2,
483,
83,
53,
275,
760,
700,
16,
2741,
687,
60,
800,
3726,
3726,
1394,
40,
4883,
8376,
27,
760,
786,
15,
207,
15,
31,
711,
22,
38,
277,
16,
21,
345,
1215,
13,
5,
4747,
23,
53,
1831,
6,
483,
760,
25,
19,
2774,
574,
54,
19... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CPU serial number
===
How do I obtain the serial number of the CPU in a PC? | 0 | [
2,
17578,
5956,
234,
800,
3726,
3726,
184,
107,
31,
5545,
14,
5956,
234,
16,
14,
17578,
19,
21,
5168,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Loading .Net Fx query...
===
I have built a simple C#.Net app on a M/C with only .Net FX 1.1 present. Now when I execute this app on a M/C where there is :
Case 1) Only .Net fx 2.0 is installed
Case 2) Both .Net Fx 1.1 amd 2.0 are installed
How is it determined to load the appropriate .Net framework in the above cases. | 0 | [
2,
12797,
13,
9,
2328,
13,
16488,
25597,
9,
9,
9,
800,
3726,
3726,
31,
57,
392,
21,
1935,
272,
5910,
9,
2328,
4865,
27,
21,
307,
118,
150,
29,
104,
13,
9,
2328,
13,
16488,
137,
9,
165,
734,
9,
130,
76,
31,
15644,
48,
4865,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Game Development Sound Frameworks
===
I'm working with a team that's building an engine for a variety of 2D and eventually 3D mini-games. The problem we're facing is a solid, cross-platform, sound API. Obviously, DirectX is out of the question due to our needs for cross-platform capabilities. SDL is nice, and works great, but let's face it SDL_Mixer is a bit limited in what it can do. We're currently using it, but when we eventually expand to 3D, it's going to be a problem.
I've been messing with OpenAL, but most of the documentation I've found is fairly out of date, and doesn't seem to work all that great. I'm willing to learn OpenAL, and fight my way through it, but I'd like to be a bit more certain that I'm not wasting my time. Other than the DevMaster tutorials though, I haven't seen much documentation that's blown me away. If someone has some better material than I've found, that'd be awesome.
I've also seen projects such as FMOD, which seems decent despite the licensing. However, like OpenAL, they have nearly non-existant documentation. Granted, I can pour over the code to deduce my options, but it seems like a bit of a pain considering I might eventually be paying for it.
Anyways, thoughts, comments, concerns? Thanks a lot! | 0 | [
2,
250,
522,
646,
6596,
18,
800,
3726,
3726,
31,
22,
79,
638,
29,
21,
173,
30,
22,
18,
353,
40,
1406,
26,
21,
1747,
16,
172,
43,
17,
878,
203,
43,
4236,
8,
16648,
9,
14,
1448,
95,
22,
99,
4325,
25,
21,
2941,
15,
919,
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... |
How do I access a database in C#
===
Basically, I would like a brief explanation of how I can access a SQL database in C# code. I gather that a connection and a command is required, but what's going on? I guess what I'm asking is for someone to de-mystify the process a bit. Thanks. | 0 | [
2,
184,
107,
31,
1381,
21,
6018,
19,
272,
5910,
800,
3726,
3726,
11374,
15,
31,
83,
101,
21,
2698,
5764,
16,
184,
31,
92,
1381,
21,
4444,
255,
6018,
19,
272,
5910,
1797,
9,
31,
7442,
30,
21,
2760,
17,
21,
1202,
25,
1390,
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... |
Should I mysql_real_escape_string all the cookies I get from the user to avoid mysql injection in php?
===
When a user goes to my site, my script checks for 2 cookies which store the user id + part of the password, to automatically log them in. Its possible to edit contents of cookies via a cookie editor, so I guess its possible to add some malicious content to a written cookie?
Should I add mysql_real_escape_string (or something else) to all my cookie calls or is there some kind of built in procedure that will not allow this to happen? I never really thought about this until just now..... | 0 | [
2,
378,
31,
51,
18,
22402,
1,
7467,
1,
62,
13109,
1,
11130,
65,
14,
19396,
31,
164,
37,
14,
4155,
20,
2658,
51,
18,
22402,
13646,
19,
13,
26120,
60,
800,
3726,
3726,
76,
21,
4155,
1852,
20,
51,
689,
15,
51,
3884,
16602,
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... |
What is your session management strategy for NHibernate in desktop applications?
===
I find it much more difficult to manage your session in a desktop application, because you cannot take advantage of such a clear bondary like HttpContext.
So how do you manage your session lifetime to take advantage of lazy loading but without having one session open for the entire application? | 0 | [
2,
98,
25,
154,
3723,
1097,
4427,
26,
12109,
15191,
8820,
19,
17404,
3767,
60,
800,
3726,
3726,
31,
477,
32,
212,
91,
1956,
20,
4705,
154,
3723,
19,
21,
17404,
3010,
15,
185,
42,
1967,
247,
3314,
16,
145,
21,
1207,
3428,
1857,
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... |
Inheriting Event Handlers in C#
===
I've kind of backed myself into a corner here.
I have a series of UserControls that inherit from a parent, which contains a couple of methods and events to simplify things so I don't have to write lines and lines of near-identical code. As you do.
What I want to do is just have one event handler, in the parent UserControl, which goes and does stuff that only the parent control can do (that is, conditionally calling an event, as the event's defined in the parent). I'd then hook up this event handler to all my input boxes, and the child controls would sort out the task of parsing the input and telling the parent control whether to throw that event. Nice and clean, no repetitive, copy-paste code (which for me *always* results in a bug).
Here's my question. Visual Studio thinks I'm being too clever by half, and warns me that "the method 'CheckReadiness' [the event handler in the parent] cannot be the method for an event because a class this class derives from already defines the method." Yes, Visual Studio, *that's the point*. I'm not sure why Visual Studio has started complaining about this now (as it let me do it before), and I'm not sure how to make it go away. Preferably, I'd like to do it without having to define a method that just calls CheckReadiness. What's causing this warning, what's causing it to come up now when it didn't an hour ago, and how can I make it go away without resorting to brute force? | 0 | [
2,
17569,
68,
807,
24641,
18,
19,
272,
5910,
800,
3726,
3726,
31,
22,
195,
825,
16,
6334,
992,
77,
21,
1531,
235,
9,
31,
57,
21,
231,
16,
4155,
12898,
18,
30,
17569,
37,
21,
4766,
15,
56,
1588,
21,
1335,
16,
3195,
17,
963,
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... |
Good asp.net (C#) apps?
===
Any suggestions for good open source asp.net (C#) apps out there which meet as many of the following:?
1. Designed well and multi tiered
2. Clean & commented code
3. Good use of several design patterns
4. Web pages display properly in all common browsers
5. Produces valid html and has good use of css
6. Use of css themes. Prefer usage of css than tables
7. NOT dependent on third party components (grids, menus, trees, ...etc)
8. Has good unit tests
9. Web pages are not simplistic and look professional
10. Uses newer technologies like MVC, LINQ.. (not important)
11. (Anything else that matters which I couldn't think of right now)
| 0 | [
2,
254,
28,
306,
9,
2328,
13,
5,
150,
5910,
6,
4865,
18,
60,
800,
3726,
3726,
186,
18389,
26,
254,
368,
1267,
28,
306,
9,
2328,
13,
5,
150,
5910,
6,
4865,
18,
70,
80,
56,
1255,
28,
151,
16,
14,
249,
45,
60,
137,
9,
1006,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Lightweight alternatives to NHibernate
===
NHibernate is not really a good fit for our environment due to all the dependencies. (Castle, log4net etc.)
Is there a good lightweight alternative?
Support for simple file based databases such as Access/SQLite/VistaDB is essential.
Ideally, something contained in a single assembly that only references .NET assemblies. If it only requires .NET framework 2.0 or 3.0 that is a bonus.
| 0 | [
2,
13613,
2676,
18,
20,
12109,
15191,
8820,
800,
3726,
3726,
12109,
15191,
8820,
25,
52,
510,
21,
254,
2742,
26,
318,
2307,
397,
20,
65,
14,
29411,
9,
13,
5,
16736,
15,
6738,
300,
2328,
2722,
9,
6,
25,
80,
21,
254,
13613,
2676,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 AD User Groups for user in Asp.Net?
===
I need to be able to get a list of the groups a user is in, but I need to have one/some/all of the following properties visible:
- distinguishedname
- name
- cn
- samaccountname
What I have right now returns some sort of name, but not any of the ones above (the names seem close, but don't all match correctly. This is what I am using:
ArrayList groups = new ArrayList();
foreach (System.Security.Principal.IdentityReference group in System.Web.HttpContext.Current.Request.LogonUserIdentity.Groups)
groups.Add(group.Translate(typeof(System.Security.Principal.NTAccount)));
Like I said, the above works, but will not get me the proper names I need for my program (the ones specified above). I need this to be able to match up with the list I get while calling all of the groups in my domain:
DirectoryEntry dirEnt = new DirectoryEntry("LDAP://my_domain_controller");
DirectorySearcher srch = new DirectorySearcher(dirEnt);
srch.Filter = "(objectClass=Group)";
var results = srch.FindAll();
Thank you.
| 0 | [
2,
184,
20,
164,
21,
43,
4155,
1170,
26,
4155,
19,
28,
306,
9,
2328,
60,
800,
3726,
3726,
31,
376,
20,
44,
777,
20,
164,
21,
968,
16,
14,
1170,
21,
4155,
25,
19,
15,
47,
31,
376,
20,
57,
53,
118,
3220,
118,
1233,
16,
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... |
Best way to really grok Java for a C# guy
===
I've recently started developing applications for the Blackberry. Consequently, I've had to jump to Java and learn that and its associated tools. The syntax is easy, but I keep having issues with various gotchas and the environment.
For instance, something that surprised me and wasted a lot of time is absence of real properties on a class object (something I assumed all OOP languages had). There are many gotchas. I've been to various places where they compare Java syntax vs C#, but there don't seem to be any sites that tell of things to look out for when moving to Java.
The environment is a whole other issue all together. The Blackberry IDE is simply horrible. The look reminds me Borland C++ for Windows 3.1 - it's that outdated. Some of the other issues included spotty intellisense, weak debugging, etc... Blackberry does have a beta of the Eclipse plugin, but without debugging support, it's just an editor with fancy refactoring tools.
So, any advice on how to blend in to Java? | 0 | [
2,
246,
161,
20,
510,
3452,
197,
8247,
26,
21,
272,
5910,
1244,
800,
3726,
3726,
31,
22,
195,
1989,
373,
3561,
3767,
26,
14,
27367,
9,
8730,
15,
31,
22,
195,
41,
20,
3936,
20,
8247,
17,
2484,
30,
17,
82,
1598,
4672,
9,
14,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to center text over an image in a table using javascript, css, and/or html?
===
How to center text over an image in a table cell using javascript, css, and/or html?
I have an HTML table containing images - all the same size - and I want to center a text label over each image. The text in the labels may vary in size. Horizontal centering is not difficult, but vertical centering is. | 0 | [
2,
184,
20,
459,
1854,
84,
40,
1961,
19,
21,
859,
568,
8247,
8741,
15,
272,
18,
18,
15,
17,
118,
248,
13,
15895,
60,
800,
3726,
3726,
184,
20,
459,
1854,
84,
40,
1961,
19,
21,
859,
1667,
568,
8247,
8741,
15,
272,
18,
18,
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... |
Word frequency algorithm for natural language processing
===
Without getting a degree in information retrieval, I'd like to know if there exists any algorithms for counting the frequency that words occur in a given body of text. The goal is to get a "general feel" of what people are saying over a set of textual comments. Along the lines of [Wordle][1].
What I'd like:
* ignore articles, pronouns, etc ('a', 'an', 'the', 'him', 'them' etc)
* preserve proper nouns
* ignore hyphenation, except for soft kind
Reaching for the stars, these would be peachy:
* handling stemming & plurals (e.g. like, likes, liked, liking match the same result)
* grouping of adjectives (adverbs, etc) with their subjects ("great service" as opposed to "great", "service")
I've attempted some basic stuff using Wordnet but I'm just tweaking things blindly and hoping it works for my specific data. Something more generic would be great.
[1]: http://wordle.net/ | 0 | [
2,
833,
5328,
9083,
26,
1112,
816,
5511,
800,
3726,
3726,
366,
1017,
21,
1168,
19,
676,
28419,
15,
31,
22,
43,
101,
20,
143,
100,
80,
5636,
186,
15935,
26,
11195,
14,
5328,
30,
715,
3744,
19,
21,
504,
358,
16,
1854,
9,
14,
119... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Lightweight Search Indexing API/Lbrary
===
I'm looking for an open source search indexing library. It will be used for embedded web application so it should have a small code size. Preferably, written in C, C++ or PHP and does not require any database in storing indexes. I tried to look on some famous search libraries such as xapian and clucene, they're good but have a relatively large code size for an embedded system.
Any thoughts on what would be a good search library/API to use?
Thanks.
| 0 | [
2,
13613,
2122,
4348,
68,
21,
2159,
118,
255,
2559,
622,
800,
3726,
3726,
31,
22,
79,
699,
26,
40,
368,
1267,
2122,
4348,
68,
1248,
9,
32,
129,
44,
147,
26,
12138,
2741,
3010,
86,
32,
378,
57,
21,
284,
1797,
1072,
9,
6369,
480... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 implement a web page that scales when the browser window is resized?
===
How to implement a web page that scales when the browser window is resized?
I can lay out the elements of the page using either a table or CSS float sections, but i want the display to rescale when the browser window is resized
i have a working solution using AJAX PRO and DIVs with overflow:auto and an onwindowresize hook, but it is cumbersome. Is there a better way? | 0 | [
2,
184,
20,
8713,
21,
2741,
2478,
30,
10105,
76,
14,
16495,
1463,
25,
302,
6560,
60,
800,
3726,
3726,
184,
20,
8713,
21,
2741,
2478,
30,
10105,
76,
14,
16495,
1463,
25,
302,
6560,
60,
31,
92,
1815,
70,
14,
2065,
16,
14,
2478,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 get more than 1000 records from a DirectorySearcher in Asp.Net?
===
I just noticed that the return list for results is limited to 1000. I have more than 1000 groups in my domain (HUGE domain). How can I get more than 1000 records? Can I start at a later record? Can I cut it up into multiple searches?
Here is my query:
DirectoryEntry dirEnt = new DirectoryEntry("LDAP://dhuba1kwtn004");
string[] loadProps = new string[] { "cn", "samaccountname", "name", "distinguishedname" };
DirectorySearcher srch = new DirectorySearcher(dirEnt, "(objectClass=Group)", loadProps);
var results = srch.FindAll();
I have tried to set **srch.SizeLimit = 2000;** but that doesn't seem to work. Any ideas? | 0 | [
2,
92,
31,
164,
91,
119,
6150,
742,
37,
21,
16755,
25136,
106,
19,
28,
306,
9,
2328,
60,
800,
3726,
3726,
31,
114,
2711,
30,
14,
788,
968,
26,
1736,
25,
1317,
20,
6150,
9,
31,
57,
91,
119,
6150,
1170,
19,
51,
4603,
13,
5,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Mocking method results
===
I'm trying to find a way to fake the result of a method called from within another method.
I have a "LoadData" method which calls a separate helper to get some data and then it will transform it (I'm interested in testing the transformed result).
So I have code like this:
public class MyClass(){
public void LoadData(){
SomeProperty = Helper.GetSomeData();
}
public object SomeProperty {get;set;}
}
I want to have a known result from the Helper.GetSomeData() method. Can I use a mocking framework (I've got fairly limited experience with Rhino Mocks but am open to anything) to force an expected result? If so, how? | 0 | [
2,
18446,
2109,
1736,
800,
3726,
3726,
31,
22,
79,
749,
20,
477,
21,
161,
20,
7031,
14,
829,
16,
21,
2109,
227,
37,
363,
226,
2109,
9,
31,
57,
21,
13,
7,
8294,
18768,
7,
2109,
56,
3029,
21,
1725,
448,
106,
20,
164,
109,
1054... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Compiling on multiple hosts
===
Say that you're developing code which needs to compile and run on multiple hosts (say Linux and Windows), how would you go about doing that in the most efficient manner given that:
- You have full access to hardware for each host you're compiling for (in my case a Linux host and a Windows host standing on my desk)
- Building over a network drive is too expensive
- No commits to a central repository should be required -- assume that there is a CI engine which tries to build as soon as anything is checked in
"Efficient" means keeping the compile-edit-run cycle as short and simple as possible.
| 0 | [
2,
24378,
27,
1886,
5397,
800,
3726,
3726,
395,
30,
42,
22,
99,
3561,
1797,
56,
2274,
20,
26561,
17,
485,
27,
1886,
5397,
13,
5,
6366,
13024,
17,
1936,
6,
15,
184,
83,
42,
162,
88,
845,
30,
19,
14,
127,
8243,
3832,
504,
30,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to prevent the ObjectDisposedException in C# when drawing and application exits
===
I'm a CompSci student, and fairly new at C#, and I was doing a "Josephus Problem" program for a class, and I created an Exit button that calls Application.Exit() to exit at anytime, but if C# is still working on painting and the button is pressed it throws an ObjectDisposedExeception for the Graphics object. Is there any way to prevent this?. I was thinking of try{}catch or change a boolean to tell the painting process to stop before exiting, but I want to know if there's another solution. | 0 | [
2,
184,
20,
2501,
14,
3095,
2906,
15690,
43,
10066,
872,
19,
272,
5910,
76,
3533,
17,
3010,
4350,
18,
800,
3726,
3726,
31,
22,
79,
21,
6479,
18,
1892,
1209,
15,
17,
6647,
78,
35,
272,
5910,
15,
17,
31,
23,
845,
21,
13,
7,
18... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does a program ask for administrator privileges?
===
I am developing an application using vb.net. For performing some tasks the application needs administrator privileges in the machine. How to ask for the privileges during the execution of the program?
What is the general method of switching user accounts for executing an application? In other words, is there some way for an application to run under an arbitrary user account? | 0 | [
2,
184,
630,
21,
625,
1349,
26,
8890,
15977,
60,
800,
3726,
3726,
31,
589,
3561,
40,
3010,
568,
13,
20468,
9,
2328,
9,
26,
2955,
109,
8674,
14,
3010,
2274,
8890,
15977,
19,
14,
1940,
9,
184,
20,
1349,
26,
14,
15977,
112,
14,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I create a thread dump of a Java Web Start application
===
Is it possible to get a thread dump of a Java Web Start application? And if so, how?
It would be nice if there were a simple solution, which would enable a non-developer (customer) to create a thread dump. Alternatively, is it possible to create a thread dump programmatically?
In the Java Web Start Console I can get a list of threads by pressing 't' but stacktraces are not included.
If answers require certain java versions, please say so. | 0 | [
2,
184,
107,
31,
1600,
21,
9322,
11424,
16,
21,
8247,
2741,
799,
3010,
800,
3726,
3726,
25,
32,
938,
20,
164,
21,
9322,
11424,
16,
21,
8247,
2741,
799,
3010,
60,
17,
100,
86,
15,
184,
60,
32,
83,
44,
2210,
100,
80,
46,
21,
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 create and use resources in C#.NET (VS 2008)
===
How do I create a resource that I can reference and use in various parts of my program easily?
My specific problem is that I have a NotifyIcon that I want to change the icon of depending on the state of the program. A common problem, but one I've been struggling with for a long time. Pointers on where to look are appreciated! | 0 | [
2,
184,
20,
1600,
17,
275,
2566,
19,
272,
5910,
9,
2328,
13,
5,
710,
18,
570,
6,
800,
3726,
3726,
184,
107,
31,
1600,
21,
6577,
30,
31,
92,
2801,
17,
275,
19,
617,
1341,
16,
51,
625,
2351,
60,
51,
1903,
1448,
25,
30,
31,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does a program ask for administrator privileges?
===
I am working on a small application in VB.NET. The program needs administrator privilege for doing some tasks. Is there a way to ask for administrator privileges during the execution if the program?
What is the general way of changing the user account under which the application is running? | 0 | [
2,
184,
630,
21,
625,
1349,
26,
8890,
15977,
60,
800,
3726,
3726,
31,
589,
638,
27,
21,
284,
3010,
19,
13,
20468,
9,
2328,
9,
14,
625,
2274,
8890,
16575,
26,
845,
109,
8674,
9,
25,
80,
21,
161,
20,
1349,
26,
8890,
15977,
112,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the best programing puzzles you came across?
===
Every single programmer worth his salt is inspired by great programming puzzles. Some puzzles are intended to sharpen your analytical abilities while some others make your programming abilities better.
Programming puzzles are the soul of infotainment in the programming community.
What are your favorite programming puzzles?
*For the validity of this question, you may want to check out: [Posting programming/algorithmic puzzles on SO][1]*
[1]: http://stackoverflow.com/questions/34257/posting-programmingalgorithmic-puzzles-on-so | 4 | [
2,
98,
50,
14,
246,
625,
68,
9164,
18,
42,
281,
464,
60,
800,
3726,
3726,
352,
345,
17968,
2715,
33,
2693,
25,
3054,
34,
374,
3143,
9164,
18,
9,
109,
9164,
18,
50,
2081,
20,
2641,
219,
154,
20103,
7009,
133,
109,
654,
233,
154... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Double and floats in C#
===
Are you aware what precision of operations on floating point numbers is different in project compiled in debug mode vs the one compiled in release mode. | 0 | [
2,
1494,
17,
11510,
18,
19,
272,
5910,
800,
3726,
3726,
50,
42,
3854,
98,
13133,
16,
1311,
27,
8319,
454,
2116,
25,
421,
19,
669,
9316,
19,
121,
16254,
3740,
4611,
14,
53,
9316,
19,
830,
3740,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How do I get a list of the active ip-addresses, mac-addresses and netbios names on the LAN?
===
The subjects says it almost all. I'd like to get netbios name, ip and mac addresses for every host on the LAN, preferably not having to walk to every single PC and take note of the stuff myself.
Any idea of to do that with WSH/Powershell/whatever? | 0 | [
2,
184,
107,
31,
164,
21,
968,
16,
14,
1348,
15735,
8,
27950,
160,
15,
1572,
8,
27950,
160,
17,
4275,
10990,
18,
1817,
27,
14,
6178,
60,
800,
3726,
3726,
14,
4739,
898,
32,
557,
65,
9,
31,
22,
43,
101,
20,
164,
4275,
10990,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Fastest way to determine image resolution and file type in PHP?
===
I'm currently using ImageMagick to determine the resolution of images uploaded to the website. By calling ImageMagick's "identify" on the command line it takes about 0.42 seconds to determine a 1MB JPEG's resolution along with the fact that it's a JPEG. I find that a bit slow.
Using the Imagick PHP library is even slower as it attemps to load the whole 1MB in memory before doing any treatment to the image (in this case, simply determining its size and type).
Are there any solutions to speed up this process of determining which file type and which image resolution an arbitrary image file has? I can live with it only supporting JPEG and PNG. It's important to me that the file type is determined by looking at the file's headers and not simply the extension.
**Edit: The solution can be a command-line tool UNIX called by PHP, much like the way I'm using ImageMagick at the moment** | 0 | [
2,
7518,
161,
20,
3746,
1961,
4302,
17,
3893,
1001,
19,
13,
26120,
60,
800,
3726,
3726,
31,
22,
79,
871,
568,
1961,
21200,
197,
20,
3746,
14,
4302,
16,
3502,
23782,
20,
14,
2271,
9,
34,
2555,
1961,
21200,
197,
22,
18,
13,
7,
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... |
SharePoint Event when Permissions of ListItems have been changed ?
===
Hallo, i need to fire an event (or start a workflow) when the permissions of a List-Element (ListItem) have been changed. "ItemUpdating" / "ItemUpdated" won't fire (since the ListItem itself is not updated, i suppose), so how can it be done? Thanks in advance! | 0 | [
2,
1891,
3132,
807,
76,
5572,
18,
16,
968,
2119,
79,
18,
57,
74,
1015,
13,
60,
800,
3726,
3726,
554,
111,
15,
31,
376,
20,
535,
40,
807,
13,
5,
248,
799,
21,
170,
9990,
6,
76,
14,
5572,
18,
16,
21,
968,
8,
27567,
13,
5,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you load an embedded icon from an exe file with PyWin32?
===
I have an exe file generated with py2exe. In the setup.py I specify an icon to be embedded in the exe:
windows=[{'script': 'my_script.py','icon_resources': [(0, 'my_icon.ico')], ...
I tried loading the icon using:
hinst = win32api.GetModuleHandle(None)
hicon = win32gui.LoadImage(hinst, 0, win32con.IMAGE_ICON, 0, 0, win32con.LR_DEFAULTSIZE)
But this produces an (very unspecific) error:
**pywintypes.error: (0, 'LoadImage', 'No error message is available')**
<br>
If I try specifying 0 as a string
hicon = win32gui.LoadImage(hinst, '0', win32con.IMAGE_ICON, 0, 0, win32con.LR_DEFAULTSIZE)
then I get the error:
**pywintypes.error: (1813, 'LoadImage', 'The specified resource type cannot be found in the image file.')**
<br>So, what's the correct method/syntax to load the icon? | 0 | [
2,
184,
107,
42,
6305,
40,
12138,
9801,
37,
40,
1396,
62,
3893,
29,
7103,
4181,
3125,
60,
800,
3726,
3726,
31,
57,
40,
1396,
62,
3893,
6756,
29,
7103,
135,
1706,
62,
9,
19,
14,
18161,
9,
6448,
31,
19077,
40,
9801,
20,
44,
1213... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Modularity in database design
===
Is there a good book/article discussing the modularity in database design? By modularity I mean the keeping the tables belong to individual modules separte. Do not allow join between tables of different modules. And the kind of issues discussed in the question http://stackoverflow.com/questions/69128/saas-database-design-multiple-databases-split | 0 | [
2,
20802,
856,
19,
6018,
704,
800,
3726,
3726,
25,
80,
21,
254,
360,
118,
20360,
10988,
14,
20802,
856,
19,
6018,
704,
60,
34,
20802,
856,
31,
884,
14,
2882,
14,
7484,
6219,
20,
1359,
17113,
10332,
11430,
9,
107,
52,
1655,
1865,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 place EXIF tags into a JPG, having the raw jpeg buffer in C++?
===
I am having a bit of a problem.
I need to embed GPS information in an JPG with EXIF metadata, this is not a problem for a file already on disk.
But I get a RAW char* buffer from a camera and I need to add this tags before I can save it to disk. Writing the file to disk and reading it back again is not an option, as this will happen thousands of times.
Any ideas? (C++) | 0 | [
2,
184,
107,
42,
209,
1396,
821,
3383,
18,
77,
21,
487,
9623,
15,
452,
14,
4333,
487,
20427,
17497,
19,
272,
20512,
60,
800,
3726,
3726,
31,
589,
452,
21,
1142,
16,
21,
1448,
9,
31,
376,
20,
11911,
69,
18298,
676,
19,
40,
487,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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, free PHP blog engine easy to redesign?
===
I am looking for a PHP blog engine which needs to be easy to redesign (CSS, HTML). It also needs to be free and have simple user interface so that the client doesn't struggle to add posts. Any suggestions? | 0 | [
2,
1935,
15,
551,
13,
26120,
8146,
1406,
2010,
20,
23903,
60,
800,
3726,
3726,
31,
589,
699,
26,
21,
13,
26120,
8146,
1406,
56,
2274,
20,
44,
2010,
20,
23903,
13,
5,
6824,
18,
15,
13,
15895,
6,
9,
32,
67,
2274,
20,
44,
551,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 C# 2.0 System.Data.SqlTypes.SqlXml object into a System.Xml.XmlNode
===
I seem to always have problems with converting data to and from XML in C#. It always wants you to create a full XMLDocument object even when you think you shouldn't have to. In this case I have a SQLXML column in a MS SQL 2005 server that I am trying to pull out and push into a function that requires an XMLNode as a parameter. You would think this would be easy, but outside of converting it to a string and creating a new XMLNode object I cannot figure out the right way to do it.
I can use an SqlDataReader, the sqlComm.ExecuteReader() to load the reader, and sqlReader.GetSqlXml(0) to get the SQLXML object,but then how do I convert it to an XmlNode?
Conversely I can use the sqlComm.ExecuteXmlReader() to get an XmlReader, but how do I extract a XmlNode from the reader? http://bytes.com/forum/thread177004.html says it cannot be done with a XmlTextReader, should I use a XmlNodeReader?
Help please! | 0 | [
2,
8406,
272,
5910,
172,
9,
387,
329,
9,
18768,
9,
18,
22402,
4474,
18,
9,
18,
22402,
396,
8184,
3095,
77,
21,
329,
9,
396,
8184,
9,
396,
8184,
251,
546,
800,
3726,
3726,
31,
2260,
20,
550,
57,
1716,
29,
19583,
1054,
20,
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... |
Querying Active Directory with "SQL"?
===
I just wonder if anyone knows or made a wrapper around Active Directory to be able to easily query it in .net? Kind of like "LINQ-to-ActiveDirectory" or some SQL Dialect, i.e. to be able to do "SELECT DISTINCT(DEPARTMENT) FROM /Users/SomeOU/AnotherOU" or "SELECT user FROM domain" or whatever.
As far as I know, it is possible to query WMI and IIS in a "SQLesque" way, i just wonder if something similar is possible for Active Directory as well, without having to learn yet another Query Language (LDAP)? | 0 | [
2,
25597,
68,
1348,
16755,
29,
13,
7,
18,
22402,
7,
60,
800,
3726,
3726,
31,
114,
2666,
100,
1276,
3620,
54,
117,
21,
28051,
140,
1348,
16755,
20,
44,
777,
20,
2351,
25597,
32,
19,
13,
9,
2328,
60,
825,
16,
101,
13,
7,
1226,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Practices for GUI design
===
What is your single best practical user-friendly user-interface design? (One design per answer, please). | 0 | [
2,
246,
5242,
26,
9457,
704,
800,
3726,
3726,
98,
25,
154,
345,
246,
5713,
4155,
8,
15950,
4155,
8,
6280,
6413,
704,
60,
13,
5,
849,
704,
416,
1623,
15,
2247,
6,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Should we write software to be used at work, in our own time?
===
To clarify, I find that there are all sorts of fun, interesting little side-line development projects that get suggested or that we think of that improve the application we're working on, or the processes within the company that, for whatever reason, we aren't able to do at work or during business hours.
Should we create and contribute these by working on them in our own time?
If you've done this (or do this regularly), what's been your experience about how the 'extra' work has been received?
What are the benefits, pitfalls or dangers to doing this?
| 4 | [
2,
378,
95,
2757,
2306,
20,
44,
147,
35,
170,
15,
19,
318,
258,
85,
60,
800,
3726,
3726,
20,
23116,
15,
31,
477,
30,
80,
50,
65,
14357,
16,
2414,
15,
4883,
265,
270,
8,
1143,
522,
2314,
30,
164,
2347,
54,
30,
95,
277,
16,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I detect the encoding/codepage of a text file
===
In our application, we receive text files (.txt, .csv, etc.) from diverse sources. When reading these files sometimes contain garbage, because the codepage these files where created in a different/unknown codepage.
Is there a way to (automatically) detect the codepage of a text file?
(I use .Net / C#). | 0 | [
2,
184,
92,
31,
9092,
14,
19608,
118,
9375,
6486,
16,
21,
1854,
3893,
800,
3726,
3726,
19,
318,
3010,
15,
95,
2588,
1854,
6488,
13,
5,
9,
38,
396,
38,
15,
13,
9,
6824,
710,
15,
2722,
9,
6,
37,
6951,
2662,
9,
76,
1876,
158,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 just me or are interfaces overused?
===
Ok, I may resort to a tad ranting here, so let me apologize in advance, but I'm really curious if others find this pattern annoying too (and I wonder if it is a justifiable pattern)...
So, after just looking at a [particular question][1], I noticed that almost all of the responses suggested creating an interface for injecting a mock in some test code.
I don't mind using interfaces, and sometimes they can really help in static typed languages like C# and Java... but I do mind seeing interfaces for almost every class in a system (or in general being used where they aren't really needed).
I have 2 major problems with using an interface when it isn't called for:
* You abstract away where the implementation is coming from. This problem has a couple consequences... in an IDE, it means that when I try to browse to the source of this method being called... I get taken to an interface instead of some code that I can look at and see what is going on. This bothers me a lot, but also this is a real problem to me to hide where the implementation is coming from (sometimes it can be in non-obvious locations).
* It adds ANOTHER file to the system. I tend to be a minimalist in my programming... if I don't really need another method, or another class, or even another file... not unless that extra thing is justified (flexibility that is going to be used, or makes the design cleaner, or provides some real benefit).
Now... if you are testing something, and you create an interface JUST TO ALLOW MOCKING... this seems to be adding a layer of minor headaches for no real benefit. What does creating the interface do that just overriding the class won't do? What is so bad about having a mock that merely overrides some methods of the single implementation class?
I guess it should be no surprise then that I much prefer Java's default virtual methods (ie requiring a final keyword to have a method that CAN'T be overriden) to C#'s default final methods... and I also tend to avoid the final keyword on methods and classes too.
So is there something to using interfaces that I am missing? Is there some hidden benefit of using an interface when you have 1 version of a class and no immediate need to create an interface?
[1]: http://stackoverflow.com/questions/90657/mocking-method-results | 4 | [
2,
25,
32,
114,
55,
54,
50,
6573,
18,
84,
8795,
60,
800,
3726,
3726,
5854,
15,
31,
123,
4765,
20,
21,
11681,
717,
1203,
235,
15,
86,
408,
55,
12059,
19,
3612,
15,
47,
31,
22,
79,
510,
7686,
100,
654,
477,
48,
3732,
17610,
26... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I tell whether I am on x64 or x86 using .NET?
===
I'd like to offer my users correct links to an upgraded version of my program based on what platform they're running on, so I need to know whether I'm currently running on an x86 OS or an x64 OS.
The best I've found is using `Environment.GetEnvironmentVariable("PROCESSOR_ARCHITECTURE")`, but I would think there would be some built-in facility for this? | 0 | [
2,
184,
92,
31,
494,
1472,
31,
589,
27,
993,
3470,
54,
993,
3274,
568,
13,
9,
2328,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
1994,
51,
3878,
4456,
6271,
20,
40,
9958,
615,
16,
51,
625,
432,
27,
98,
2452,
59,
22,
99,
946,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Excel Macro Language
===
I have an old Excel 4 Macro that I use to run monthly invoices. It is about 3000 lines and has many Excel 5 Dialog Box sheets (for dialog boxes). I would like to know what the easiest way would be to change it into Visual Basic and if it is worth it. I would also like to know how, if once I have converted it to VBA, how to create a standalone application of it. | 0 | [
2,
20700,
9069,
816,
800,
3726,
3726,
31,
57,
40,
315,
20700,
268,
9069,
30,
31,
275,
20,
485,
6460,
19,
13379,
18,
9,
32,
25,
88,
13226,
1560,
17,
63,
151,
20700,
331,
28223,
1649,
8801,
13,
5,
1106,
28223,
8120,
6,
9,
31,
83... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Debug VS Release
===
Continuation to my [previous question](http://stackoverflow.com/questions/90751/double-and-floats-in-c) is any one aware of a comprehensive document what list all available differences between debug and release modes in C# application , and particularly in web application ?
What differences you aware of ?
| 0 | [
2,
121,
16254,
4611,
830,
800,
3726,
3726,
15503,
20,
51,
636,
3515,
1755,
1291,
1301,
500,
5,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
3165,
3283,
8197,
14368,
8,
290,
8,
14712,
721,
18,
8,
108,
8,
150,
6,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
[ASP.NET] How to dynamically generate combination of user controls?
===
I have several user controls, let's say A, B, C and D. Based on some random input, I need to generate a combination of these. For e.g. if input is 2a3d1a2c I need to show two of the A's, 3 D's after that, an A again, etc.
I will also need to stabilize clientid's in order for them to work correctly. Because each of these controls use their own ClientID property to gather the inputs on themselves. For e.g. user control A inernally generates an input named this.ClientID + "$input1", and gathers its input from request like Request[this.ClientID + "$input1"]. Since there can be more than one A, each A needs to have the same (unique) ClientID after postback in order to get correct inputs from request. | 0 | [
2,
636,
472,
306,
9,
2328,
500,
184,
20,
7782,
1326,
7920,
3733,
16,
4155,
8671,
60,
800,
3726,
3726,
31,
57,
238,
4155,
8671,
15,
408,
22,
18,
395,
21,
15,
334,
15,
272,
17,
13,
43,
9,
432,
27,
109,
5477,
6367,
15,
31,
376,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Compound keys in JPA
===
I want to make an entity that has an autogenerated primary key, but also a unique compound key made up of two other fields. How do I do this in JPA?<br>
I want to do this because the primary key should be used as foreign key in another table and making it compound would not be good.
In the following snippet, I need the command and model to be unique. pk is of course the primary key.
@Entity
@Table(name = "dm_action_plan")
public class ActionPlan {
@Id
private int pk;
@Column(name = "command", nullable = false)
private String command;
@Column(name = "model", nullable = false)
String model;
} | 0 | [
2,
6089,
5534,
19,
487,
1060,
800,
3726,
3726,
31,
259,
20,
233,
40,
9252,
30,
63,
40,
3108,
25314,
1256,
1246,
15,
47,
67,
21,
2619,
6089,
1246,
117,
71,
16,
81,
89,
2861,
9,
184,
107,
31,
107,
48,
19,
487,
1060,
60,
1,
514... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WCF REST Caching - Client Side & Server Side
===
I have wirtten a RESTful WCF Service. Incorporating E-Tags, expires headers.
The caching works great when using it from a browser. However how does the caching work when calling it from a WCF Channel Factory or .NET Web Request Objects?
So in the scenario where I have my website calling the WCF restful service when a 304 not modified response is returned to me. How do I handle this. The browser detects this fine and returns the unmodified version from its cache.
However when the client is not the browser do I need to write my own version of the cache similiar to the way the browser caches?
Any help or insight would be much appreciated. | 0 | [
2,
11801,
410,
760,
1658,
7192,
13,
8,
6819,
270,
279,
8128,
270,
800,
3726,
3726,
31,
57,
12701,
38,
1316,
21,
760,
1566,
11801,
410,
365,
9,
15239,
13,
62,
8,
8628,
18,
15,
25910,
18,
157,
445,
9,
14,
1658,
7192,
693,
374,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Unit testing a java servlet
===
I would like to know what would be the best way to do unit testing of a servlet.
Testing internal methods is not a problem as long as they don't refer to the servlet context, but what about testing the doGet/doPost methods as well as the internal method that refer to the context or make use of session parameters?
Is there a way to do this simply using classical tools such as JUnit, or preferrably TestNG? Did I need to embed a tomcat server or something like that? | 0 | [
2,
1237,
4431,
21,
8247,
13,
10321,
1336,
800,
3726,
3726,
31,
83,
101,
20,
143,
98,
83,
44,
14,
246,
161,
20,
107,
1237,
4431,
16,
21,
13,
10321,
1336,
9,
4431,
3117,
3195,
25,
52,
21,
1448,
28,
175,
28,
59,
221,
22,
38,
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... |
Reliable and performant cheap (ish) hosting for ASP.NET 3.5 and mysql
===
I'm looking for someone reasonably cheap but better than the majority of budget hosts out there. I'm currently with brinkster.net and I've become increasingly annoyed at the their immense unreliability and low available resources.
Fasthosts business plan is close, but has no mysql, only has ASP.NET 2.0 and is maybe slightly more expensive than I was hoping for. | 0 | [
2,
11398,
17,
2985,
1830,
9148,
13,
5,
1595,
6,
10637,
26,
28,
306,
9,
2328,
203,
9,
264,
17,
51,
18,
22402,
800,
3726,
3726,
31,
22,
79,
699,
26,
737,
19531,
9148,
47,
574,
119,
14,
1698,
16,
3391,
5397,
70,
80,
9,
31,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Advantages of VS 2008 over VS 2005
===
Could somebody please name a few. I could given time, but this is for somebody else, and I'd also like some community input. | 0 | [
2,
14683,
16,
4611,
570,
84,
4611,
812,
800,
3726,
3726,
110,
8861,
2247,
204,
21,
310,
9,
31,
110,
504,
85,
15,
47,
48,
25,
26,
8861,
962,
15,
17,
31,
22,
43,
67,
101,
109,
514,
6367,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Benefits of SQL Server 2005 over 2000
===
Could somebody please name a few. I could given time, but this is for somebody else, and I'd also like some community input. | 0 | [
2,
5800,
16,
4444,
255,
8128,
812,
84,
824,
800,
3726,
3726,
110,
8861,
2247,
204,
21,
310,
9,
31,
110,
504,
85,
15,
47,
48,
25,
26,
8861,
962,
15,
17,
31,
22,
43,
67,
101,
109,
514,
6367,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How can I report to users what is consuming the process address space of a windows application while they're running it?
===
I'm writing the memory manager for an application, as part of a team of twenty-odd coders. We're running out of memory quota and we need to be able to see what's going on, since we only appear to be using about 700Mb. I need to be able to report where it's all going - fragmentation etc. Any ideas? | 0 | [
2,
184,
92,
31,
1330,
20,
3878,
98,
25,
13,
17601,
14,
953,
3218,
726,
16,
21,
1936,
3010,
133,
59,
22,
99,
946,
32,
60,
800,
3726,
3726,
31,
22,
79,
1174,
14,
1912,
1382,
26,
40,
3010,
15,
28,
141,
16,
21,
173,
16,
1309,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I use the TranslateBehavior in CakePHP?
===
There is no documentation on cakephp.org and I am unable to find one on google. Please link me some documentation or supply one! | 0 | [
2,
184,
107,
31,
275,
14,
20628,
863,
20358,
248,
19,
8390,
26120,
60,
800,
3726,
3726,
80,
25,
90,
13945,
27,
8390,
26120,
9,
5583,
17,
31,
589,
2343,
20,
477,
53,
27,
8144,
9,
2247,
3508,
55,
109,
13945,
54,
2837,
53,
187,
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... |
How do I use INotifyPropertyChanged to update an array binding?
===
Let's say I have a class:
class Foo
{
public string Bar
{
get { ... }
}
public string this[int index]
{
get { ... }
}
}
I can bind to these two properties using "{Binding Path=Bar}" and "{Binding Path=[x]}". Fine.
Now let's say I want to implement INotifyPropertyChanged:
class Foo : INotifyPropertyChanged
{
public string Bar
{
get { ... }
set
{
...
if( PropertyChanged != null )
{
PropertyChanged( this, new PropertyChangedEventArgs( "Bar" ) );
}
}
}
public string this[int index]
{
get { ... }
set
{
...
if( PropertyChanged != null )
{
PropertyChanged( this, new PropertyChangedEventArgs( "????" ) );
}
}
}
public event PropertyChangedEventHandler PropertyChanged;
}
What goes in the part marked ????? (I've tried string.Format("[{0}]", index) and it doesn't work). Is this a bug in WPF, is there an alternative syntax, or is it simply that INotifyPropertyChanged isn't as powerful as normal binding?
| 0 | [
2,
184,
107,
31,
275,
19,
2779,
8612,
10890,
106,
1084,
16229,
43,
20,
11100,
40,
7718,
8728,
60,
800,
3726,
3726,
408,
22,
18,
395,
31,
57,
21,
718,
45,
718,
4310,
111,
13,
1,
317,
3724,
748,
13,
1,
164,
13,
1,
13,
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... |
Can you register an existing instance of a type in the Windsor Container?
===
In the Windsor IOC container is it possible to register a type that I've already got an instance for, instead of having the container create it? | 0 | [
2,
92,
42,
2243,
40,
3149,
4851,
16,
21,
1001,
19,
14,
10784,
12147,
60,
800,
3726,
3726,
19,
14,
10784,
31,
2499,
12147,
25,
32,
938,
20,
2243,
21,
1001,
30,
31,
22,
195,
614,
330,
40,
4851,
26,
15,
700,
16,
452,
14,
12147,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
replace-char in Emacs Lisp ?
===
[I cannot find a question tagged emacs-lisp, so let's start, it will be the first on StackOverflow.]
Emacs Lisp has replace-string but I cannot find a replace-char. If I want to replace "typographic" curly quotes (Emacs code for this character is hexa 53979) with regular ASCII quotes, I write:
(replace-string (make-string 1 ?\x53979) "'")
which would certainly be better with replace-char. Any way to improve my code?
| 0 | [
2,
3934,
8,
5433,
19,
13,
62,
6893,
18,
2093,
3401,
13,
60,
800,
3726,
3726,
636,
49,
1967,
477,
21,
1301,
27945,
13,
62,
6893,
18,
8,
3159,
306,
15,
86,
408,
22,
18,
799,
15,
32,
129,
44,
14,
64,
27,
7566,
2549,
9990,
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... |
Multiple Inheritance in PHP
===
I'm looking for a good, clean way to go around the fact that PHP5 still doesn't support multiple inheritance. Here's the class hierarchy:
Message
-- TextMessage
-------- InvitationTextMessage
-- EmailMessage
-------- InvitationEmailMessage
The two types of Invitation* classes have a lot in common; i'd love to have a common parent class, Invitation, that they both would inherit from. Unfortunately, they also have a lot in common with their current ancestors... TextMessage and EmailMessage. Classical desire for multiple inheritance here.
What's the most light-weight approach to solve the issue?
Thanks! | 0 | [
2,
1886,
13852,
19,
13,
26120,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
254,
15,
2745,
161,
20,
162,
140,
14,
837,
30,
13,
26120,
264,
174,
1437,
22,
38,
555,
1886,
13852,
9,
235,
22,
18,
14,
718,
14417,
45,
2802,
13,
8,
8,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
A visual MySQL tool for Ubuntu
===
I have recently installed Ruby on Rails on my new Ubuntu machine (first time for me) and i was working through a demonstration on setting up a sample blog.
Basically, i came to the part of setting up the mysql database and would rather use a visual MySQL tool to do this rather than command line.
What is best to use? and how do o get it?
Thanks all. | 0 | [
2,
21,
3458,
51,
18,
22402,
5607,
26,
287,
12968,
2473,
800,
3726,
3726,
31,
57,
1989,
4066,
10811,
27,
2240,
18,
27,
51,
78,
287,
12968,
2473,
1940,
13,
5,
3552,
85,
26,
55,
6,
17,
31,
23,
638,
120,
21,
10613,
27,
2697,
71,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 iterate a .Net IList collection in the reverse order?
===
I have an IList that contains items ( parent first ), they need to be added to a Diagram Document in the reverse order so that the parent is added last, drawn on top so that it is the first thing to be selected by the user.
What's the best way to do it? Something better/more elegant than what I am doing currently
which I post below.. | 0 | [
2,
184,
107,
31,
32,
106,
1373,
21,
13,
9,
2328,
31,
5739,
1206,
19,
14,
7006,
389,
60,
800,
3726,
3726,
31,
57,
40,
31,
5739,
30,
1588,
3755,
13,
5,
4766,
64,
13,
6,
15,
59,
376,
20,
44,
905,
20,
21,
14161,
4492,
19,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to create a path to a temporary file on Windows XP/Vista
===
What is the best way of doing this?
tmpnam() returns a path to a file in the root of the drive, which requires administrator privileges on Windows Vista, so this is not an option.
| 0 | [
2,
184,
20,
1600,
21,
2013,
20,
21,
4700,
3893,
27,
1936,
23045,
118,
22034,
800,
3726,
3726,
98,
25,
14,
246,
161,
16,
845,
48,
60,
13,
38,
2554,
6865,
5,
6,
4815,
21,
2013,
20,
21,
3893,
19,
14,
5900,
16,
14,
1493,
15,
56,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to rewrite an URL on a JBoss server?
===
I would like to redirect/rewrite this two kinds of URLs:
- mydomain.com -> newdomain.com
- mydomain.com/specificPage -> newdomain.com/newSpecificPage
- mydomain.com/anyOtherPage -> mydomain.com/anyOtherPage (no redirect here)
So I just want to redirect the root domain to a new domain, and *some* pages from my domain to some pages on a new domain...
How can I do that on a JBoss server ? | 0 | [
2,
184,
20,
27891,
40,
287,
6362,
27,
21,
487,
10349,
18,
8128,
60,
800,
3726,
3726,
31,
83,
101,
20,
302,
14706,
118,
99,
23716,
48,
81,
8623,
16,
13,
911,
7532,
45,
13,
8,
51,
537,
6232,
9,
960,
13,
8,
1,
78,
537,
6232,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
J2EE App Server Hollo World
===
I am fairly comfortable with standalone Java app development, but will soon be working on a project using a J2EE application server.
Does anyone know of a straightforward how-to tutorial to getting a hello-world type application working in an application server? I'm (perhaps naievly) assuming that the overall approach is similar between different frameworks, so I'm more interested in finding out the approach rather than getting bogged down in differences between the different frameworks.
If you are not aware of a good guide, then could you post bullet-point type steps to getting a hello-world running?, i.e.
1. Download XX
2. Write some code to do YY
3. Change file ZZ
4. Other steps...
Note: Just because I have a windows machine at home, I would prefer to run if this could be run on windows, but in the interest of a better answer, linux/mac based implementations are welcome. | 0 | [
2,
487,
135,
2851,
4865,
8128,
16900,
111,
126,
800,
3726,
3726,
31,
589,
6647,
5733,
29,
26986,
8247,
4865,
522,
15,
47,
129,
651,
44,
638,
27,
21,
669,
568,
21,
487,
135,
2851,
3010,
8128,
9,
630,
1276,
143,
16,
21,
22262,
184... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Emacs, switch active window
===
In Emacs, "C-x o" takes me to the next window.
What keyboard macro takes me to the previous window in Emacs? | 0 | [
2,
13,
62,
6893,
18,
15,
5521,
1348,
1463,
800,
3726,
3726,
19,
13,
62,
6893,
18,
15,
13,
7,
150,
8,
396,
635,
7,
1384,
55,
20,
14,
328,
1463,
9,
98,
8896,
9069,
1384,
55,
20,
14,
1158,
1463,
19,
13,
62,
6893,
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,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Totally removing obsolete members - when?
===
When developing an API for some software product/service, many times revisions are made and existing members (properties/methods) are marked as obsolete just because they might already be used by some client and removing them would introduce breaking changes. My question is, how long do you wait before you totally remove such a member? What does it depend on? Time, product version, customer input? The end result I see happening is that obsolete members exist for years. So have you removed them at some point? What is your experience? | 0 | [
2,
5139,
9096,
18562,
443,
13,
8,
76,
60,
800,
3726,
3726,
76,
3561,
40,
21,
2159,
26,
109,
2306,
2374,
118,
11449,
15,
151,
436,
11323,
18,
50,
117,
17,
3149,
443,
13,
5,
10890,
106,
3915,
118,
5909,
1807,
43,
18,
6,
50,
2739... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why easyphp stop all apache processes on severals PC?
===
on some Windows PC, when I have both easyPHP and a standalone apache service configured on another network port and with a specific service name, I have a problem : when I stop easyphp, the other apache is stopped too.
The problem do not occur on all PC I have, but seems very strange to me.
Any idea?
Thanks
Cédric | 0 | [
2,
483,
2010,
26120,
747,
65,
17140,
5102,
27,
238,
18,
5168,
60,
800,
3726,
3726,
27,
109,
1936,
5168,
15,
76,
31,
57,
156,
2010,
26120,
17,
21,
26986,
17140,
365,
28895,
27,
226,
982,
1295,
17,
29,
21,
1903,
365,
204,
15,
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 do I get my c# program to sleep for 50 msec?
===
This might seem an easy question, but Im having a temporary brain failure moment! | 0 | [
2,
184,
107,
31,
164,
51,
272,
5910,
625,
20,
1742,
26,
1222,
307,
14332,
60,
800,
3726,
3726,
48,
530,
2260,
40,
2010,
1301,
15,
47,
797,
452,
21,
4700,
1964,
2990,
688,
187,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to match a single quote in sed
===
How to match a single quote in sed if the expression is enclosed in single quotes:
sed -e '...'
For example need to match this this text:
'foo'
| 0 | [
2,
184,
20,
730,
21,
345,
16371,
19,
13924,
800,
3726,
3726,
184,
20,
730,
21,
345,
16371,
19,
13924,
100,
14,
1803,
25,
12188,
19,
345,
18901,
45,
13924,
13,
8,
62,
13,
22,
9,
9,
9,
22,
26,
823,
376,
20,
730,
48,
48,
1854,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.