unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
How do the equality (==) and identity (===) comparison operators differ?
===
Can you explain the difference between `==` and `===`, giving some useful examples? | 0 | [
2,
184,
107,
14,
10337,
13,
5,
3726,
3726,
6,
17,
3270,
13,
5,
3726,
3726,
3726,
6,
6050,
9475,
11394,
60,
800,
3726,
3726,
92,
42,
3271,
14,
2841,
128,
13,
1,
3726,
3726,
1,
17,
13,
1,
3726,
3726,
3726,
1,
15,
1438,
109,
48... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I register a custom URL protocol in Windows?
===
How do I register a custom protocol with Windows so that when clicking a link in an email or on a web page my application is opened and the parameters from the URL are passed to it? | 0 | [
2,
184,
107,
31,
2243,
21,
5816,
287,
6362,
8494,
19,
1936,
60,
800,
3726,
3726,
184,
107,
31,
2243,
21,
5816,
8494,
29,
1936,
86,
30,
76,
25590,
21,
3508,
19,
40,
8517,
54,
27,
21,
2741,
2478,
51,
3010,
25,
520,
17,
14,
12905... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
SmtpClient.SendAsync bug in ASP.NET 2.0
===
I may be wrong, but if you are working with SmtpClient.SendAsync in ASP.NET
2.0 and it throws an exception, the thread processing the request waits
indefinitely for the operation to complete.
To reproduce this problem, simply use an invalid SMTP address for the host
that could not be resolved when sending an email.
Note that you should set Page.Async = true to use SendAsync.
If Page.Async is set to false and SendAsync throws an exception the thread
does not block, and the page is processed correctly.
TIA.
| 0 | [
2,
7613,
38,
5779,
18513,
38,
9,
18,
16776,
9507,
150,
6256,
19,
28,
306,
9,
2328,
172,
9,
387,
800,
3726,
3726,
31,
123,
44,
1389,
15,
47,
100,
42,
50,
638,
29,
7613,
38,
5779,
18513,
38,
9,
18,
16776,
9507,
150,
19,
28,
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 program call divert settings on Windows Mobile?
===
Does anyone know how to get/set the call divert settings in codes running on Windows mobile 5/6? I am new to windows mobile development and wonder if there is anyway to do it using C# and .NET CF? | 0 | [
2,
184,
20,
625,
645,
19610,
12410,
27,
1936,
3241,
60,
800,
3726,
3726,
630,
1276,
143,
184,
20,
164,
118,
3554,
14,
645,
19610,
12410,
19,
11358,
946,
27,
1936,
3241,
13,
10551,
379,
60,
31,
589,
78,
20,
1936,
3241,
522,
17,
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,
0,
0... |
Exchange drop support for SMTP?
===
I want to send email with Exchange by using telnet to port 25. Until two week ago I was able to, but now a "security fix" from Microsoft has removed this possibility.
When I try, I get this message:
421 4.3.2 Service not available, closing transmission channel
What can I do? | 0 | [
2,
1950,
2804,
555,
26,
7613,
13726,
60,
800,
3726,
3726,
31,
259,
20,
2660,
8517,
29,
1950,
34,
568,
6757,
2328,
20,
1295,
771,
9,
163,
81,
877,
1464,
31,
23,
777,
20,
15,
47,
130,
21,
13,
7,
17749,
6098,
7,
37,
7099,
63,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the difference between <C-C> and <C-[> in vim?
===
One of the best tips for using vim that I have learned so far has been that one can press <C-C> (i.e. CTRL+C) or <C-[> (ie. CTRL+[) instead of the ESC(ape) key. However I use a dvorak keyboard so <C-[> is a little out of reach for me as well so I mostly use <C-C>. Now I've read somewhere that these two key combinations don't actually have exactly the same behaviour and that it is better to use <C-[>. I haven't come across any problems so far though so I'd like to know what exactly is the difference between the two? | 0 | [
2,
98,
25,
14,
2841,
128,
13,
1,
150,
8,
150,
1,
17,
13,
1,
150,
8,
2558,
1,
19,
1790,
79,
60,
800,
3726,
3726,
53,
16,
14,
246,
11034,
26,
568,
1790,
79,
30,
31,
57,
2691,
86,
463,
63,
74,
30,
53,
92,
901,
279,
255,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Orthogonal variables code duplication problem
===
I've started refactoring some legacy code recently and came across two functions for drawing a coordinate grid, the problem is that these functions differ only in orthogonal variables they treat, something like that
void DrawScaleX(HDC dc, int step, int x0, int x1, int y0, int y1)
{
for(int x = x0; x < x1; x += step)
{
MoveToEx(dc, x, y0, NULL);
LineTo(dc, x, y1);
}
}
void DrawScaleY(HDC dc, int step, int x0, int x1, int y0, int y1)
{
for(int y = y0; y < y1; y += step)
{
MoveToEx(dc, x0, y, NULL);
LineTo(dc, x1, y);
}
}
So if I decide to add some fancy stuff, like antialiasing or merely change drawing pencil or whatever I'll have to put the same code in both of them and it's code duplication and it's bad we all know why.
My question is how would you rewrite these two functions into a single one to avoid this problem?
| 0 | [
2,
27252,
12157,
1797,
1052,
20669,
1448,
800,
3726,
3726,
31,
22,
195,
373,
302,
17455,
68,
109,
7780,
1797,
1989,
17,
281,
464,
81,
3719,
26,
3533,
21,
15154,
7354,
15,
14,
1448,
25,
30,
158,
3719,
11394,
104,
19,
27252,
12157,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 logger that knows the class name
===
public static Logger getLogger() {
final Throwable t = new Throwable();
final StackTraceElement methodCaller = t.getStackTrace()[1];
final Logger logger = Logger.getLogger(methodCaller.getClassName());
logger.setLevel(ResourceManager.LOGLEVEL);
return logger;
}
This method would return a logger that knows the class it's logging for. | 0 | [
2,
8247,
13,
29480,
30,
3620,
14,
718,
204,
800,
3726,
3726,
317,
12038,
13,
29480,
164,
29480,
5,
6,
13,
1,
426,
3814,
579,
13,
38,
800,
78,
3814,
579,
5,
6,
73,
426,
7566,
38,
7367,
27567,
2109,
9200,
106,
800,
13,
38,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What type of application/utilization is YAML best suited for?
===
Why would one choose YAML over XML or any other formats? | 0 | [
2,
98,
1001,
16,
3010,
118,
14255,
1829,
25,
2167,
8184,
246,
12949,
26,
60,
800,
3726,
3726,
483,
83,
53,
3538,
2167,
8184,
84,
23504,
54,
186,
89,
13767,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Hibernate Tools and the ever changing database
===
I am currently using Hibernate Tools 3.1; I customized naming convention and DAO templates. The database (SQL Server 2005) in early development phase and I'm in charge of rebuilding the mappings, entities, DAOs, configuration, whatever. Each time I have to reverse-engineer the tables and so I lose every customization I made on the mappings (*.hbm.xml files) like adjusting the **identity** columns, picking the fields used in **equals** and **toString**. I was considering to write the diff XML in a file and the "merge" that onto the generated mapping (see [my related question][1]) but I was wondering... is there any best practice/tool for dealing with these annoying, unavoidable, critical tasks?
[1]: http://stackoverflow.com/questions/80609/merge-xml-documents | 0 | [
2,
4148,
2102,
8820,
4672,
17,
14,
462,
4226,
6018,
800,
3726,
3726,
31,
589,
871,
568,
4148,
2102,
8820,
4672,
203,
9,
165,
73,
31,
28779,
10929,
3087,
17,
13,
17104,
22894,
18,
9,
14,
6018,
13,
5,
18,
22402,
8128,
812,
6,
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... |
what is the best control suite for winforms applications?
===
i know devexpress have some more intuitive controls over infragistics, but what about component factory or telerik? What winforms controls would you recommend? | 0 | [
2,
98,
25,
14,
246,
569,
6160,
26,
628,
4190,
18,
3767,
60,
800,
3726,
3726,
31,
143,
9664,
21230,
57,
109,
91,
13,
24392,
8671,
84,
19,
22133,
3771,
18,
15,
47,
98,
88,
5912,
3129,
54,
4338,
6639,
60,
98,
628,
4190,
18,
8671,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Query to find nth max value of a column
===
I want to find 2nd,3rd..nth maximum value of a column | 0 | [
2,
25597,
20,
477,
13,
103,
96,
2049,
1923,
16,
21,
4698,
800,
3726,
3726,
31,
259,
20,
477,
172,
706,
15,
240,
897,
9,
9,
103,
96,
2979,
1923,
16,
21,
4698,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to sync a database that exists in various (not networked) SQL Server 2005 instances
===
I am working on a database application that runs on various independent servers.
Each server runs an Instance of SQL Server 2005 with the same database. We would have a Master Server where that would be the definitive source of information and various "Client" Servers that would be distributed around (with no network connection of any kind). This Client Servers would return from time to time (lets say once a week) to be synchronized with the Master) Simply put the process would be.
1) Update the database on the master server with all the modifications from a client server (taking into account not overwriting changes made by the update process of a different client server [that would update the same master server])
2) Copy an updated version of the master server database to the client server.
Thanks for any help | 0 | [
2,
184,
20,
6063,
150,
21,
6018,
30,
5636,
19,
617,
13,
5,
1270,
982,
69,
6,
4444,
255,
8128,
812,
13946,
800,
3726,
3726,
31,
589,
638,
27,
21,
6018,
3010,
30,
1461,
27,
617,
1124,
17595,
9,
206,
8128,
1461,
40,
4851,
16,
444... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Problem installing warbler gem on linux
===
<pre>> jruby -S gem install warbler
JRuby limited openssl loaded. gem install jruby-openssl for full support.
Successfully installed warbler-0.9.11
1 gem installed
Installing ri documentation for warbler-0.9.11...
Installing RDoc documentation for warbler-0.9.11...
> jruby -S warble
<snip>/jruby-1.1.4/bin/warble:1: undefined method `warble' for JRuby::Commands:Class (NoMethodError)</pre>
Any ideas why I don't get a warbler command in my jruby bin directory?
Thanks,
| 0 | [
2,
1448,
25429,
28574,
8551,
27,
13024,
800,
3726,
3726,
13,
1,
3515,
1,
2000,
291,
779,
13,
8,
18,
8551,
16146,
28574,
2000,
291,
779,
1317,
8965,
18,
255,
8572,
9,
8551,
16146,
2000,
291,
779,
8,
10157,
18,
18,
255,
26,
503,
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... |
.NET Domain-Driven Design with C#
===
Has anyone read the book ".NET Domain-Driven Design with C#: Problem - Design - Solution" ? How is the book? | 0 | [
2,
13,
9,
2328,
4603,
8,
14489,
704,
29,
272,
5910,
800,
3726,
3726,
63,
1276,
1302,
14,
360,
13,
7,
9,
2328,
4603,
8,
14489,
704,
29,
272,
5910,
45,
1448,
13,
8,
704,
13,
8,
4295,
7,
13,
60,
184,
25,
14,
360,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Windows Server 2003 - Share current Desktop via RDP like in Windows XP?
===
Unfortunately I have to use Windows Server 2003 on my 32 bit workstation due to memory constraints of Windows XP.
In Windows XP, when you connect via Remote Desktop the current session I am logged in is instantly shared on the Remote Desktop. I can see all the applications I have opened on my workstation and can continue to work on my open applications.
On Windows 2003 Server however, each Remote Desktop connection gets a new session. With no applications opened. So I have to use the Task Manager and connect to my existing session manually to see the opened applications.
Can this be changed so that Windows 2003 Servers acts exactly as Windows XP? I do not need to allow multiple users to connect to the box simultaneously. I would even like to prevent that, since it is used as a workstation and do not want to allow other domain users to start applications on my workstation. | 0 | [
2,
1936,
8128,
973,
13,
8,
1891,
866,
17404,
1197,
13,
897,
306,
101,
19,
1936,
23045,
60,
800,
3726,
3726,
6200,
31,
57,
20,
275,
1936,
8128,
973,
27,
51,
2512,
1142,
170,
10839,
397,
20,
1912,
16747,
16,
1936,
23045,
9,
19,
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... |
Best approach to write/read binary data in Little or Big Endian with C#?
===
Ok, if i've got a binary file encoded either in little endian or big endian under .NET, what is the best way to read / write to it?
In the .NET framework i've only managed to found BinaryWritters / BinaryReaders which use little endian as default, so my approach was implement my own BinaryReader / BinaryWritter for reading / writting data in big endian, but I wonder if there is a better aproach. | 0 | [
2,
246,
2141,
20,
2757,
118,
10647,
14171,
1054,
19,
265,
54,
580,
241,
806,
29,
272,
5910,
60,
800,
3726,
3726,
5854,
15,
100,
31,
22,
195,
330,
21,
14171,
3893,
13665,
694,
19,
265,
241,
806,
54,
580,
241,
806,
131,
13,
9,
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... |
Active threads in ExecutorService
===
Any ideas how to determine the number of active threads running in ExecutorService? | 0 | [
2,
1348,
20396,
19,
1396,
17194,
2153,
11449,
800,
3726,
3726,
186,
3478,
184,
20,
3746,
14,
234,
16,
1348,
20396,
946,
19,
1396,
17194,
2153,
11449,
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... | [
1,
1,
1,
1,
1,
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... |
Fatal Error C1083 - Cannot open include file: "windows.h": No such file or directory
===
I'm trying to get IKVM to build (see [this question][1]) but now have encountered a problem not having to do with IKVM so I'm opening up a new question:
When running nant on the IKVM directory with the Visual Studio 2008 Command Prompt (from the Start Menu), I get the following error:
> ikvm-native-win32:
>
> [cl] Compiling 2 files to C:\ikvm-0.36.0.11\native\Release'.
>
> [cl] jni.c
> [cl] os.c
> [cl] C:\ikvm-0.36.0.11\native\os.c(25) : fatal error C1083: Cannot open include file: 'windows.h': No such
> file or directory
> [cl] Generating Code...
>
> BUILD FAILED
>
> C:\ikvm-0.36.0.11\native\native.build(17,10):
> External Program Failed: cl (return code was 2)
I have the Platform SDK installed. What am I missing? I'm sure it's something simple...
[1]: http://stackoverflow.com/questions/71599/how-to-get-ikvm-to-build-in-visual-studio-2008 | 0 | [
2,
8773,
7019,
272,
1036,
4736,
13,
8,
1967,
368,
468,
3893,
45,
13,
7,
27508,
18,
9,
252,
7,
45,
90,
145,
3893,
54,
16755,
800,
3726,
3726,
31,
22,
79,
749,
20,
164,
13,
2883,
20147,
20,
1895,
13,
5,
1798,
636,
1565,
1301,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JAX-RS Frameworks
===
I've been doing some work with the JAX-RS reference implementation (Jersey).
I know of at least two other frameworks (Restlet & Apache CXF).
My question is: Has anyone did some comparison between those frameworks and if so, which framework do you recommend and why? | 0 | [
2,
11712,
8,
1224,
6596,
18,
800,
3726,
3726,
31,
22,
195,
74,
845,
109,
170,
29,
14,
11712,
8,
1224,
2801,
6123,
13,
5,
8273,
4228,
6,
9,
31,
143,
16,
35,
639,
81,
89,
6596,
18,
13,
5,
11466,
1336,
279,
17140,
272,
396,
410... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 merge many SQLite databases?
===
If I have a large number of SQLite databases, all with the same schema, what is the best way to merge them together in order to perform a query on all databases?
I know it is possible to use [ATTACH][1] to do this but it has [a limit][2] of 32 and 64 databases depending on the memory system on the machine.
[1]: http://www.sqlite.org/lang_attach.html
[2]: http://www.sqlite.org/limits.html#max_attached | 0 | [
2,
184,
92,
31,
12666,
151,
4444,
10601,
6018,
18,
60,
800,
3726,
3726,
100,
31,
57,
21,
370,
234,
16,
4444,
10601,
6018,
18,
15,
65,
29,
14,
205,
23874,
15,
98,
25,
14,
246,
161,
20,
12666,
105,
429,
19,
389,
20,
2985,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does use of anonymous functions affect performance?
===
I've been wondering, is there a performance difference between using named functions and anonymous functions in Javascript?
for (var i = 0; i < 1000; ++i) {
myObjects[i].onMyEvent = function() {
// do something
};
}
vs
function myEventHandler() {
// do something
}
for (var i = 0; i < 1000; ++i) {
myObjects[i].onMyEvent = myEventHandler;
}
The first is tidier since it doesn't clutter up your code with rarely-used functions, but does it matter that you're re-declaring that function multiple times? | 0 | [
2,
630,
275,
16,
10364,
3719,
6245,
956,
60,
800,
3726,
3726,
31,
22,
195,
74,
5712,
15,
25,
80,
21,
956,
2841,
128,
568,
377,
3719,
17,
10364,
3719,
19,
8247,
8741,
60,
26,
13,
5,
3311,
31,
800,
713,
73,
31,
13,
1,
6150,
73... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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: Pass an ampersand in a lousy filename to a flash object on a webpage
===
Argghh. I have a site that offers audio previews of songs hosted elsewhere. Some file names have an ampersand in them - see below where it passes "soundFile." Anytime there's an ampersand, Flash can't get the file - I think it drops the filename after the ampersand. It doesn't matter if I pass it as an "&" or an HTML entity ("& a m p ;") Any help out there? Thanks in advance!
<pre><code>
<object type="application/x-shockwave-flash" data="includes/player.swf" id="audioplayer" height="24" width="290">
<param name="movie" value="includes/player.swf"><param name="FlashVars" value="playerID=1&soundFile=http://www.divideandkreate.com/mp3/Divide_&_Kreate_-_Party_Kisser.mp3">
<param name="quality" value="high"><param name="menu" value="false"><param name="wmode" value="transparent">
</object>
</code></pre> | 0 | [
2,
184,
20,
45,
1477,
40,
589,
7490,
290,
19,
21,
6118,
4980,
3893,
7259,
20,
21,
4433,
3095,
27,
21,
2741,
6486,
800,
3726,
3726,
13,
10663,
4780,
252,
9,
31,
57,
21,
689,
30,
2486,
4023,
16121,
18,
16,
916,
2812,
6040,
9,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
OpenFileDialog. How about "Specify Directory Dialog"?
===
On a file path field, I want to capture the directory path like:
textbox1.Text = directory path
Anyone? | 0 | [
2,
368,
16877,
4286,
5567,
9,
184,
88,
13,
7,
18,
12610,
8612,
16755,
28223,
7,
60,
800,
3726,
3726,
27,
21,
3893,
2013,
575,
15,
31,
259,
20,
3683,
14,
16755,
2013,
101,
45,
1854,
5309,
165,
9,
11969,
800,
16755,
2013,
1276,
60... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to find out the distinguished name of the information store to feed to IExchangeManageStore::GetMailboxTable?
===
There is a [Microsoft knowledge base article][1] with sample code to open all mailboxes in a given information store. It works so far (requires a bit of [copy & pasting][2] on compilers newer than VC++ 6.0).
At one point it calls IExchangeManageStore::GetMailboxTable with the distinguished name of the information store. For the Exchange 2007 Trial Virtual Server image it has to look like this: "/o=Litware Inc/ou=Exchange Administrative Group (FYDIBOHF23SPDLT)/cn=Configuration/cn=servers/cn=DC1".
Using [OutlookSpy][3] and clicking on IMsgStore and IExchangeManageStore reveals the desired string next to "Server DN:".
I want to avoid forcing the user to put this into a config file. So if OutlookSpy can do it, how can my application find out the distinguished name of the information store where the currently open mailbox is on?
[1]: http://support.microsoft.com/?scid=194627
[2]: http://blogs.msdn.com/jasonjoh/archive/2004/08/01/204585.aspx
[3]: http://www.dimastr.com/outspy/
| 0 | [
2,
184,
20,
477,
70,
14,
3842,
204,
16,
14,
676,
1718,
20,
4063,
20,
31,
1706,
16229,
177,
1303,
16828,
45,
45,
3060,
8079,
5309,
5924,
60,
800,
3726,
3726,
80,
25,
21,
636,
22019,
12980,
1918,
1000,
2002,
500,
2558,
165,
500,
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... |
Rebind Access combo box
===
I have an Access 2007 form that is searchable by a combobox. When I add a new record, I need to update the combobox to include the newly added item.
I assume that something needs to be done in AfterInsert event of the form but I can't figure out what.
How can I rebind the combobox after inserting so that the new item appears in the list? | 0 | [
2,
302,
4772,
43,
1381,
22621,
1649,
800,
3726,
3726,
31,
57,
40,
1381,
624,
505,
30,
25,
2122,
579,
34,
21,
22621,
5309,
9,
76,
31,
3547,
21,
78,
571,
15,
31,
376,
20,
11100,
14,
22621,
5309,
20,
468,
14,
2771,
905,
9101,
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... |
Nuking huge file in svn repository
===
As the local subversion czar i explain to everyone to keep only source code and non-huge text files in the repository, not huge binary data files. Smaller binary files that are parts of tests, maybe.
Unfortunately i work with *humans*! Someone is likely to someday accidentally commit a 800MB binary hulk. This slows down repository operations.
Last time i checked, you can't delete a file from the repository; only make it not part of the latest revision. The repository keeps the monster for all eternity, in case anyone ever wants to recall the state of the repository for that date or revision number.
Is there a way to really delete that monster file and end up with a decent sized repository? I've tried the svnadmin dump/load thing but it was a pain.
| 0 | [
2,
3152,
1581,
2329,
3893,
19,
13,
18,
16578,
24869,
800,
3726,
3726,
28,
14,
375,
972,
10898,
25909,
31,
3271,
20,
1266,
20,
643,
104,
1267,
1797,
17,
538,
8,
2242,
834,
1854,
6488,
19,
14,
24869,
15,
52,
2329,
14171,
1054,
6488,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there another way to do screen scaping apart from regular expressions?
===
I'm doing a personal, just for fun, project that is using screen scraping to give me a System Tray notification in case another line on an HTML table is added, modified or deleted.
Having done this before I thought: well let's go with the regular expression thing and that's it, but being a curious person, made me think that there could be something else out there that could have another paradigm but be as simple to use.
I know about DOM and X-Path and all the xml'ish approaches. I'm looking for something outside the box, something that can even be defined in a set of rules so you can make a plugin system to aggregate various sites. | 0 | [
2,
25,
80,
226,
161,
20,
107,
2324,
11583,
3181,
2629,
37,
1290,
13832,
60,
800,
3726,
3726,
31,
22,
79,
845,
21,
1319,
15,
114,
26,
2414,
15,
669,
30,
25,
568,
2324,
25611,
20,
590,
55,
21,
329,
10121,
52,
4634,
19,
610,
226,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 LogParser to find out the LENGTH of a field in an IIS Log?
===
I'm trying to find LONG UserAgent strings with LogParser.exe in my IIS logs. This example searches for entries with the string 'poo' in them.
LogParser.exe" -i:IISW3C "SELECT COUNT(cs(User-Agent)) AS Client FROM *.log WHERE cs(User-Agent) LIKE '%poo%'
I'm trying to say "How many entries have a User-Agent that is longer than 'x'". | 0 | [
2,
184,
107,
31,
275,
6738,
3574,
4104,
20,
477,
70,
14,
1476,
16,
21,
575,
19,
40,
595,
18,
6738,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
477,
175,
275,
525,
7685,
7887,
29,
6738,
3574,
4104,
9,
1706,
62,
19,
51,
595,
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... |
Zend Framework Select Operator Precedence
===
I am trying to use Zend_Db_Select to write a select query that looks somewhat like this:
SELECT * FROM bar WHERE a = 1 AND (b = 2 OR b = 3)
However, when using a combination of where() and orWhere(), it seems impossible to use condition grouping like the above.
Are there any native ways in Zend Framework to achieve the above (without writing the actual query?) | 0 | [
2,
10526,
43,
6596,
5407,
6022,
24720,
800,
3726,
3726,
31,
589,
749,
20,
275,
10526,
43,
1,
9007,
1,
18,
16964,
20,
2757,
21,
5407,
25597,
30,
1879,
4131,
101,
48,
45,
5407,
1637,
37,
748,
113,
21,
800,
137,
17,
13,
5,
220,
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... |
In Visual Studio 2008, how can I make control+click do a "Go To Definition"?
===
I know this is not strictly about programming, but it's pretty close.
Anyway, in Delphi, you can hold control and click on a method to jump to its definition. In VS2008, you have to right-click and select "Go To Definition".
I use this function quite often, so I'd really like to get VS to behave like delphi in this regard - its so much quicker to ctrl+click.
I don't think there's a way to get this working in base VS2008 - am I wrong? Or maybe there's a plugin I could use?
| 0 | [
2,
19,
3458,
1120,
570,
15,
184,
92,
31,
233,
569,
2430,
150,
10129,
107,
21,
13,
7,
839,
20,
5465,
7,
60,
800,
3726,
3726,
31,
143,
48,
25,
52,
10369,
88,
3143,
15,
47,
32,
22,
18,
1772,
543,
9,
2774,
15,
19,
23030,
15,
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... |
in Rails, how do I execute direct SQL code on a different database?
===
Here is the case.
I'm writing a Rails application which will monitor data quality over some specific databases. In order to do that, I need to be able to execute direct SQL queries over these databases - which of course are not the same as the one used to drive the Rails application models. In short, this means I can't use the trick of going through the ActiveRecord base connection.
How can I do that?
Thanks,
Rollo
| 0 | [
2,
19,
2240,
18,
15,
184,
107,
31,
15644,
1744,
4444,
255,
1797,
27,
21,
421,
6018,
60,
800,
3726,
3726,
235,
25,
14,
610,
9,
31,
22,
79,
1174,
21,
2240,
18,
3010,
56,
129,
7626,
1054,
2190,
84,
109,
1903,
6018,
18,
9,
19,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to handle errors loading with the Flex Sound class
===
I am seeing strange behaviour with the flash.media.Sound class in Flex 3.
var sound:Sound = new Sound();
try{
sound.load(new URLRequest("directory/file.mp3"))
} catch(e:IOError){
...
}
However this isn't helping. I'm getting a stream error, and it actually sees to be in the Sound constructor.
> Error #2044: Unhandled IOErrorEvent:.
> text=Error #2032: Stream Error. at... ]
I saw one example in the Flex docs where they add an event listener for IOErrorEvent, SURELY I don't have to do this, and can simply use try-catch? | 0 | [
2,
184,
20,
3053,
11908,
12797,
29,
14,
14409,
646,
718,
800,
3726,
3726,
31,
589,
2078,
2578,
7727,
29,
14,
4433,
9,
8260,
9,
8489,
718,
19,
14409,
203,
9,
4033,
646,
45,
8489,
800,
78,
646,
5,
6,
73,
1131,
1,
646,
9,
8294,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the Bash command to create a hardlink to a directory in OS X?
===
How do you create a hardlink (as opposed to a symlink or a Mac OS alias) in OS X that points to a directory? I already know the command "ln target destination" but that only works when the target is a file. I know that Mac OS, unlike other Unix environments, does allow hardlinking to folders (this is used for Time Machine, for example) but I don't know how to do it myself. | 0 | [
2,
98,
25,
14,
13158,
1202,
20,
1600,
21,
552,
6258,
20,
21,
16755,
19,
13,
759,
993,
60,
800,
3726,
3726,
184,
107,
42,
1600,
21,
552,
6258,
13,
5,
472,
3499,
20,
21,
13,
7261,
6258,
54,
21,
1572,
13,
759,
15794,
6,
19,
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... |
Dynamic contact information data/desing pattern: Is this in any way feasible?
===
I'm currently working on a web business application that has many entities (people,organizations) with lots of contact information ie. multiple postal addresses, email addresses, phone numbers etc.
At the moment the database schema is such that persons table has postal address columns, phone number columns as does organizations table. This is not a good way to handle this.
I've read the c2 Wiki on this and there's some good discussion regarding <a href="http://c2.com/cgi-bin/wiki?ContactAndAddressModels">Contact and address models (http://c2.com/cgi-bin/wiki?ContactAndAddressModels)</a> and wheter or not <a href="http://c2.com/cgi-bin/wiki?ArePhysicalPostalAddressesArchaic">physical addresses are archaic (http://c2.com/cgi-bin/wiki?ArePhysicalPostalAddressesArchaic)</a>. These two discussions really opened my eyes on the scope of this problem.
I'm thinking about separating <b>contact information fields to separate table(s)</b>. But what's the best way to do this. At the moment the application mainly handles Finnish addresses but it's on the horizon that it needs also to handle international addresses.
I could define an "addresses" -table, a "phone numbers" -table, an "email addresses" -table and so on and these would be linked to people and organizations. But this just feels too much like the previous solution: it's inevitable that the predefined database schema isn't sufficient.
What I'm proposing is to create a contact information schema/program logic that is <b>dynamic</b>:
<ul>
<li>There are no predefined contact information fields/field sets</li>
<li>Users can define new contact information types and required fields at any time like
<ul>
<li>Finnish postal address</li>
<li>Swedish postal address</li>
<li>... postal address</li>
<li>Phone number</li>
<li>Email address</li>
<li>ICQ-number</li>
</ul>
</li>
</ul>
<b>Is this feasible?</b> Has anyone done anything like this?
There could be a table that defines contact information types:
<h3>contact information types</h3>
<ul>
<li>Id: Identifier</li>
<li>Name: "Finnish postal address"</li>
<li>Description: "Use this contact information type for finnish postal addresses"</li>
</ul>
<br/>
Then there could be a table that defines what fields are used per contact information type:
<h3>contact information type fields</h3>
<ul>
<li>Id: Identifier</li>
<li>Contact_information_type_id: References the previous table</li>
<li>Field title: "Address line 1"</li>
<li>Field description: "Use this line for postal addresses' first line"</li>
<li>Field type: String/Integer/etc.</li>
<li>Field format: Regular expression for validating field data</li>
<li>Field order: In which order should this field appear when displaying/using this contact information type</li>
</ul>
<br/>
Then we'd have a "contact information table" that just is used to map contact information fields together:
<h3>contact information</h3>
<ul>
<li>Id: Identifier</li>
<li>Contact_information_type_id: References the contact information type table</li>
</ul>
<br/>
Then we'd have a "contact information of person" -table mapping different contact information to persons:
<table style="border:1px solid #000; width:100%;">
<tr><th colspan="2">contact information of person</th></tr>
<tr><td>Id:</td><td>Identifier</td></tr>
<tr><td>Contact_information_id</td><td>References the contact information table</td></tr>
<tr><td>Person id</td><td>References the person</td></tr>
</table>
<br/>
Then we'd need tables per contact information field type like:
<table style="border:1px solid #000; width:100%;">
<tr><th colspan="2">contact information integer fields</th></tr>
<tr><td>Id:</td><td>Identifier</td></tr>
<tr><td>Contact_information_id</td><td>References the contact information table</td></tr>
<tr><td>Value</td><td>The value of this field</td></tr>
</table>
<br/>
<table style="border:1px solid #000; width:100%;">
<tr><th colspan="2">contact information String fields</th></tr>
<tr><td>Id:</td><td>Identifier</td></tr>
<tr><td>Contact_information_id</td><td>References the contact information table</td></tr>
<tr><td>Value</td><td>The value of this field</td></tr>
</table>
and so on...
Finally when displaying different contact information of a given person this would happen through <b>person's contact information</b> -table whis looks up what fields are used to form this contact information from <b>contact information type fields</b> -table through <b>contact information</b> -table. After determining what fields are used all the necessary tables would be joined together.
I'm having doubts about the feasibility of in SQL. Any thoughts?
In Java I probably could program some logic to determine what tables are neede to form a contact information entity and then i could use some sort of dynamic beans to represent this data in Java. But that's a bit foggy to me too. Anyt thoughts on this too?
| 0 | [
2,
7782,
2203,
676,
1054,
118,
3196,
68,
3732,
45,
25,
48,
19,
186,
161,
13,
23707,
60,
800,
3726,
3726,
31,
22,
79,
871,
638,
27,
21,
2741,
508,
3010,
30,
63,
151,
12549,
13,
5,
10171,
15,
6826,
1829,
18,
6,
29,
7503,
16,
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 Crack Google?
===
I am planning to apply for Google? What kind of questions is asked by Google? How to crack it? Can you suggest some books, interview questions etc etc to crack the Google?
| 4 | [
2,
184,
20,
6058,
8144,
60,
800,
3726,
3726,
31,
589,
2334,
20,
5645,
26,
8144,
60,
98,
825,
16,
2346,
25,
411,
34,
8144,
60,
184,
20,
6058,
32,
60,
92,
42,
5601,
109,
964,
15,
2421,
2346,
2722,
2722,
20,
6058,
14,
8144,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Get Methods: One vs Many
===
getEmployeeNameByBatchId(int batchID)<BR>
getEmployeeNameBySSN(Object SSN)<BR>
getEmployeeNameByEmailId(String emailID)<BR>
getEmployeeNameBySalaryAccount(SalaryAccount salaryAccount)<BR>
or
getEmployeeName(int typeOfIdentifier, byte[] identifier) -> In this methods the typeOfIdentifier tells if identifier is batchID/SSN/emailID/salaryAccount
Which one of the above is better way implement a get method?
These methods would be in a Servlet and calls would be made from an API which would be provided to the customers. | 0 | [
2,
164,
3195,
45,
53,
4611,
151,
800,
3726,
3726,
3168,
9577,
10892,
2851,
7259,
779,
4900,
1594,
43,
5,
6391,
13064,
1340,
6,
1,
5145,
1,
3168,
9577,
10892,
2851,
7259,
779,
18,
18,
103,
5,
23793,
13,
18,
18,
103,
6,
1,
5145,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.Net 2.0: How to subscribe to a event publisher on a remote computer using transient subscriptions?
===
My problem is that I want to have a server application (on a remote computer) to publish certain events to several client computers. The server and client communicate using .Net-Remoting so currently I am using remoted .Net-Events to get the functionality. But there is one drawback: when the server (the event publisher) comes offline and is restarted, the clients lose the connection since the remote object references become invalid.
I am looking into Loosely Coupled Events and Transient COM Subscriptions to solve this issue. I put together a small demo application with one publisher and two subscribers. It works beautifully on one computer.
I am using the COMAdmin-Libraries to create a transient subscription for the event subscribers. The code looks like this:
MyEventHandler handler = new MyEventHandler();
ICOMAdminCatalog catalog;
ICatalogCollection transientCollection;
ICatalogObject subscription;
catalog = (ICOMAdminCatalog)new COMAdminCatalog();
transientCollection = (ICatalogCollection)catalog.GetCollection("TransientSubscriptions");
subscription = (ICatalogObject)transientCollection.Add();
subscription.set_Value("Name", "SubTrans");
subscription.set_Value("SubscriberInterface", handler);
string eventClassString = "{B57E128F-DB28-451b-99D3-0F81DA487EDE}";
subscription.set_Value("EventCLSID", eventClassString);
string sinkString = "{9A616A06-4F8D-4fbc-B47F-482C24A04F35}";
subscription.set_Value("InterfaceID", sinkString);
subscription.set_Value("FilterCriteria", "");
subscription.set_Value("PublisherID", "");
transientCollection.SaveChanges();
handler.Event1 += OnEvent1;
handler.Event2 += OnEvent2;
My question now is: what do I have to change in the subscription to make this work over a network? Is it even possible? | 0 | [
2,
13,
9,
2328,
172,
9,
387,
45,
184,
20,
13,
20330,
20,
21,
807,
5916,
27,
21,
5388,
1428,
568,
26008,
14213,
18,
60,
800,
3726,
3726,
51,
1448,
25,
30,
31,
259,
20,
57,
21,
8128,
3010,
13,
5,
218,
21,
5388,
1428,
6,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Adding my own application events in Control Panel -> Sounds...
===
I have just read [this question][1] and I really loved [this answer][2] to the question. Naturally, an interesting question popped in my head...
How to add my own events (of my own applications) in the Control Panel -> Sounds and Audio Devices -> Sounds -> Program Events?
And another related question, that I suppose should be answered here as well is...
How do I play those sounds specified in the Control Panel, when the event in my application occurs?
[1]: http://stackoverflow.com/questions/80564/visual-studio-how-to-trigger-an-alarm-when-a-breakpoint-is-hit
[2]: http://stackoverflow.com/questions/80564/visual-studio-how-to-trigger-an-alarm-when-a-breakpoint-is-hit#80587 | 0 | [
2,
4721,
51,
258,
3010,
963,
19,
569,
4113,
13,
8,
1,
2795,
9,
9,
9,
800,
3726,
3726,
31,
57,
114,
1302,
636,
1565,
1301,
500,
2558,
165,
500,
17,
31,
510,
2199,
636,
1565,
1623,
500,
2558,
135,
500,
20,
14,
1301,
9,
8000,
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 find header dependencies for large scale projects on linux
===
I'm working an a very large scale projects, where the compilation time is **very** long. What tools can I use (preferably open source) on Linux, to find the most heavily included files and that optimize their useages? | 0 | [
2,
184,
20,
477,
157,
106,
29411,
26,
370,
3464,
2314,
27,
13024,
800,
3726,
3726,
31,
22,
79,
638,
40,
21,
253,
370,
3464,
2314,
15,
113,
14,
4868,
85,
25,
13,
1409,
7864,
1409,
175,
9,
98,
4672,
92,
31,
275,
13,
5,
3515,
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... |
Is anyone using XForms in their web applications?
===
A few years ago we started playing around with [XForms][1] from the W3C for a web app which required hundreds of custom forms.
As they aren't currently supported natively by the major browsers, what parsers/tools are you using on your projects today?
I'm not really interested in plugins - this needs to be something server side that emulates XForms.
[1]: http://www.w3.org/MarkUp/Forms/ | 0 | [
2,
25,
1276,
568,
993,
4190,
18,
19,
66,
2741,
3767,
60,
800,
3726,
3726,
21,
310,
122,
1464,
95,
373,
791,
140,
29,
636,
396,
4190,
18,
500,
2558,
165,
500,
37,
14,
619,
240,
150,
26,
21,
2741,
4865,
56,
1390,
4541,
16,
5816,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to store a knowladge base of business rules for helpdesk?
===
Does anyone know of any software or a good way for developers to build up a knowledge base of business rules that are built in to the software for help desk to use?
We already have a helpdesk software but we are not looking to replace this. | 0 | [
2,
98,
25,
14,
246,
161,
20,
1718,
21,
143,
531,
43,
834,
1000,
16,
508,
1761,
26,
448,
3196,
197,
60,
800,
3726,
3726,
630,
1276,
143,
16,
186,
2306,
54,
21,
254,
161,
26,
10168,
20,
1895,
71,
21,
1918,
1000,
16,
508,
1761,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Processing Javascript RegEx submatches
===
I am trying to write some JavaScript RegEx to replace user inputed tags with real html tags, so [b] will become <b> and so forth. the RegEx i am using looks like so
var exptags = /\[(b|u|i|s|center|code){1}]((.){1,}?)\[\/(\1){1}]/ig;
with the following JavaScript
s.replace(exptags,"<$1>$2</$1>");
this works fine for single nested tags, for example
[b]hello[/b] [u]world[/u]
but if the tags are nested inside each other it will only match the outer tags, for example
[b]foo [u]to the[/u] bar[/b]
this will only match the b tags. how can I fix this? should i just loop until the starting string is the same as the outcome? I have a feeling that the ((.){1,}?) patten is wrong also?
Thanks
| 0 | [
2,
5511,
8247,
8741,
7953,
1706,
972,
12280,
160,
800,
3726,
3726,
31,
589,
749,
20,
2757,
109,
8247,
8741,
7953,
1706,
20,
3934,
4155,
6367,
69,
3383,
18,
29,
683,
13,
15895,
3383,
18,
15,
86,
636,
220,
500,
129,
533,
279,
255,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Creating/modifying images in JavaScript
===
Is it possible to **dynamically create and modify images** on a **per pixel level** in JavaScript (on client side)? Or has this to be done with server based languaged, such as PHP?
My use case is as follows:
* The user opens webpage and loads locally stored image
* A preview of the image is displayed
* The user can modify the image with a set of sliders (pixel level operations)
* In the end he can download the image to his local HDD
When searching in the web I just found posts about using IE's filtering method, but didn't find anything about image editing functions in JavaScript.
| 0 | [
2,
2936,
118,
13670,
10874,
3502,
19,
8247,
8741,
800,
3726,
3726,
25,
32,
938,
20,
13,
1409,
20985,
1326,
1600,
17,
17579,
3502,
1409,
27,
21,
13,
1409,
1432,
18146,
662,
1409,
19,
8247,
8741,
13,
5,
218,
6819,
270,
6,
60,
54,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 skip sys.exitfunc when unhandled exceptions occur
===
As you can see, even after the program should have died it speaks from the grave. Is there a way to "deregister" the exitfunction in case of exceptions?
import atexit
def helloworld():
print "Hello World!"
atexit.register(helloworld)
raise Exception("Good bye cruel world!") | 0 | [
2,
184,
20,
12532,
10315,
18,
9,
1706,
242,
16638,
150,
76,
367,
3203,
1294,
13392,
3744,
800,
3726,
3726,
28,
42,
92,
196,
15,
166,
75,
14,
625,
378,
57,
440,
32,
9381,
37,
14,
4784,
9,
25,
80,
21,
161,
20,
13,
7,
1157,
152... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which factors determine the success of an open source project?
===
We have a series of closed source applications and libraries, for which we think it would make sense opening up the source code.
What has been blocking us, so far, is the effort needed to clean up the code base and documenting the source before opening up.
We want to open up the source only if we have a reasonable chance of the projects being successful -- i.e. having contributors. We are convinced that the code would be interesting to a large base of developers.
**Which factors,** excluding the "interestingness" and "usefulness" of the project, **determine the success of an open source project?**
Examples:
- Cleanliness of code
- Availability of source code comments
- Fully or partially documented APIs
- Choice of license (GPL vs. LGPL vs. BSD, etc...)
- Choice of public repository
- Investment in a public website
| 0 | [
2,
56,
4776,
3746,
14,
1280,
16,
40,
368,
1267,
669,
60,
800,
3726,
3726,
95,
57,
21,
231,
16,
827,
1267,
3767,
17,
8649,
15,
26,
56,
95,
277,
32,
83,
233,
1259,
1214,
71,
14,
1267,
1797,
9,
98,
63,
74,
11828,
182,
15,
86,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 your development setup? (Talking right now to my boss)
===
How do I tell my boss, that I need endless cpu power to automate my daily job?
By the way, what's your setup, now in sep, 2008.
How fast disks?
How much memory?
How many cores?
How big screen?
Thanks!
(Ok, what the hell are you doing, you may ask. I'm working in multiple environments, vmware. Have couple of build-systems running, for compatibility tests. These build systems are automated. The setup of the build system is also. Is there an another way?)
| 0 | [
2,
98,
22,
18,
154,
522,
18161,
60,
13,
5,
9718,
68,
193,
130,
20,
51,
4054,
6,
800,
3726,
3726,
184,
107,
31,
494,
51,
4054,
15,
30,
31,
376,
11340,
17578,
414,
20,
3108,
5281,
51,
1954,
1205,
60,
34,
14,
161,
15,
98,
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... |
Spelling Alternatives based on a Database?
===
I'm looking for an efficient way (using PHP with a Mysql Database) to suggest alternative spelling for a query.
I know I can use services such as [Yahoo's Spelling Suggestion][1] but I want the suggestions to be based on what is currently available in the database.
For example: The user has to fill a form with a "City" field, and I want to make sure that everyone will use the same spelling for said city, (so I don't end up with people filling in "Pitsburgh" when what they mean is "Pittsburgh" ).
This was only an example but, basically I want to search what is already in the database for entries where the spelling is really close to what the user entered...
Any algorithm, tutorials or ideas on how to achieve this?
[1]: http://developer.yahoo.com/search/web/V1/spellingSuggestion.html | 0 | [
2,
11292,
2676,
18,
432,
27,
21,
6018,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
40,
8243,
161,
13,
5,
12655,
13,
26120,
29,
21,
51,
18,
22402,
6018,
6,
20,
5601,
2676,
11292,
26,
21,
25597,
9,
31,
143,
31,
92,
275,
687,
145... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 autocomplete at the Korn shell command line with the vi editor
===
In the Korn shell on <b>AIX UNIX</b> with the editor mode set to vi using:
set -o vi
What are the key-strokes at the shell command line to autocomplete a file or directory name ?
I've tried using the following:
<Esc>\
but that moves the cursor to the end character and does not autocomplete with the appropriate directory or filename I am expecting.
Any ideas ? | 0 | [
2,
184,
20,
3108,
15990,
35,
14,
4435,
103,
3593,
1202,
293,
29,
14,
1790,
1835,
800,
3726,
3726,
19,
14,
4435,
103,
3593,
27,
13,
1,
220,
1,
58,
4028,
22540,
1,
118,
220,
1,
29,
14,
1835,
3740,
309,
20,
1790,
568,
45,
309,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When should a class member be declared virtual (C#)/Overridable (VB.NET)?
===
Why wouldn't I choose abstract? What are the limitations to declaring a class member virtual? Can only methods be declared virtual? | 0 | [
2,
76,
378,
21,
718,
322,
44,
2482,
6599,
13,
5,
150,
5910,
6,
118,
2549,
5175,
579,
13,
5,
20468,
9,
2328,
6,
60,
800,
3726,
3726,
483,
1265,
22,
38,
31,
3538,
8502,
60,
98,
50,
14,
14070,
20,
15594,
21,
718,
322,
6599,
60,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is there a more efficient text spooler than TextWriter/StringBuilder
===
For a situation like capturing text incrementally, for example if you were receiving all of the output.write calls when a page was rendering, and those were being appended into a textwriter over a stringbuilder.
Is there a more efficient way to do this? Something that exists in dotnet already preferably? Especially if there's a total size over a hundred k. Maybe something more like an array of pages rather than contiguous memory?
| 0 | [
2,
25,
80,
21,
91,
8243,
1854,
13,
18,
13378,
106,
119,
1854,
9657,
118,
11130,
20904,
800,
3726,
3726,
26,
21,
1858,
101,
12859,
1854,
29977,
102,
15,
26,
823,
100,
42,
46,
3396,
65,
16,
14,
5196,
9,
23716,
3029,
76,
21,
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... |
Access denied error when building solution in Visual Studio 2005
===
I get the following error in Visual Studio 2005 when doing a build:
> Error 9 Cannot register assembly
> "E:\CSharp\project\Some.Assembly.dll"
> - access denied. Access is denied. (Exception from HRESULT: 0x80070005
> (E_ACCESSDENIED)) project
It happens only intermittantly and does go away if I restart the IDE, however this is incredibly annoying and I would like to put a stop to it happening permanently, if I can. I've checked the assembly itself, and it is not set to read only, so I've no idea why Visul Studio is getting a lock on it. I am working in Debug mode.
I've had a look around google, but can't seem to find anything other than "restart VS". Does anyone have any suggestions as to how I can resolve this annoying problem? | 0 | [
2,
1381,
5265,
7019,
76,
353,
4295,
19,
3458,
1120,
812,
800,
3726,
3726,
31,
164,
14,
249,
7019,
19,
3458,
1120,
812,
76,
845,
21,
1895,
45,
13,
1,
7019,
561,
1967,
2243,
1475,
13,
1,
13,
7,
62,
45,
1,
150,
23646,
1,
21011,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Safe feature-based way for detecting Google Chrome with Javascript?
===
As the title states, I'd be interested to find a safe feature-based (that is, without using navigator.appName or navigator.appVersion) way to detect Google Chrome.
By feature-based I mean, for example:
if(window.ActiveXObject) {
// internet explorer!
} | 0 | [
2,
1834,
1580,
8,
1281,
161,
26,
9092,
68,
8144,
13,
12985,
29,
8247,
8741,
60,
800,
3726,
3726,
28,
14,
581,
202,
15,
31,
22,
43,
44,
3158,
20,
477,
21,
1834,
1580,
8,
1281,
13,
5,
887,
25,
15,
366,
568,
21432,
9,
7753,
725... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.NET NumericTextBox
===
Does anyone know why Microsoft does not ship a numeric text box with its .NET framework e.g. a text box which would ensure that the characters entered are always a valid number? It's something which is commonly used across applications of different flavours and indeed something which most GUI libraries (well, those that I know) deliver in some way. While it's not *that* difficult to write your own, it's not trivial either.
So, I'm interested in finding out if anyone can rationalise this omission. | 0 | [
2,
13,
9,
2328,
15764,
596,
11969,
5309,
800,
3726,
3726,
630,
1276,
143,
483,
7099,
630,
52,
995,
21,
15764,
596,
1854,
1649,
29,
82,
13,
9,
2328,
6596,
13,
62,
9,
263,
9,
21,
1854,
1649,
56,
83,
4062,
30,
14,
1766,
1297,
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... |
Runtime Page Optimizer for ASP.net - Any comments?
===
RPO 1.0 (Runtime Page Optimizer) is a recently (today?) released component for ASP and Sharepoint that compresses, combines and minifies (I can’t believe that is a real word) Javascript, CSS and other things.
What is interesting is that it was developed for ActionThis.com a NZ shop that saw at TechEd last year. They built a site that quickly needed to be trimmed down due to the deployment scale and this seems to be the result of some of that effort.
Anyone have any comments? Is it worthwhile evaluating this?
[http://www.getrpo.com/Product/HowItWorks][1]
[1]: http://www.getrpo.com/Product/HowItWorks | 0 | [
2,
485,
891,
2478,
22864,
139,
26,
28,
306,
9,
2328,
13,
8,
186,
7534,
60,
800,
3726,
3726,
761,
1638,
137,
9,
387,
13,
5,
3169,
891,
2478,
22864,
139,
6,
25,
21,
1989,
13,
5,
15260,
60,
6,
261,
5912,
26,
28,
306,
17,
1891,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where to lokk in which encoding is my ACCESS database
===
I have ACCESS database, where can I look in ehich encoding character is database? | 0 | [
2,
113,
20,
12929,
197,
19,
56,
19608,
25,
51,
1381,
6018,
800,
3726,
3726,
31,
57,
1381,
6018,
15,
113,
92,
31,
361,
19,
16177,
3870,
19608,
925,
25,
6018,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Files on XP: Is turning off "last access time" safe?
===
I'm desperately looking for cheap ways to lower the build times on my home PC. I just read an [article about disabling the Last Access Time attribute][1] of a file on Windows XP, so that simple reads don't write anything back to disk.
> It's really simple too. At a DOS-prompt write:
> `fsutil behavior set disablelastaccess 1`
Has anyone ever tried it in the context of building C++ projects? Any drawbacks?
[1]: http://www.axantum.com/Blog/post/How-to-make-a-file-read-in-Windows-not-become-a-write.aspx | 0 | [
2,
6488,
27,
23045,
45,
25,
2101,
168,
13,
7,
8558,
1381,
85,
7,
1834,
60,
800,
3726,
3726,
31,
22,
79,
9832,
699,
26,
9148,
2847,
20,
987,
14,
1895,
436,
27,
51,
213,
5168,
9,
31,
114,
1302,
40,
636,
20360,
88,
1460,
58,
85... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Auto-generating Unit-Tests for legacy Java-code
===
What is the best, preferably free/open source tool for auto-generating Java unit-tests? I know, the unit-tests cannot really serve the same purpose as normal TDD Unit-Tests which document and drive the design of the system. However auto-generated unit-tests can be useful if you have a huge legacy codebase and want to know whether the changes you are required to make will have unwanted, obscure side-effects. | 0 | [
2,
3108,
8,
17083,
1880,
1237,
8,
10543,
18,
26,
7780,
8247,
8,
9375,
800,
3726,
3726,
98,
25,
14,
246,
15,
6369,
4801,
551,
118,
10157,
1267,
5607,
26,
3108,
8,
17083,
1880,
8247,
1237,
8,
10543,
18,
60,
31,
143,
15,
14,
1237,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In Rails, What's the Best Way to Get Autocomplete that Shows Names but Uses IDs?
===
I want to have a text box that the user can type in that shows an Ajax-populated list of my model's names, and then when the user selects one I want the HTML to save the model's ID, and use that when the form is submitted.
I've been poking at the auto_complete plugin that got excised in Rails 2, but it seems to have no inkling that this might be useful. There's a [Railscast episode][1] that covers using that plugin, but it doesn't touch on this topic. The comments [point out that it could be an issue][2], and [point to `model_auto_completer` as a possible solution][3], which seems to work if the viewed items are simple strings, but the inserted text includes lots of junk spaces if (as I would like to do) you include a picture into the list items, [despite what the documentation says][4].
I could probably hack `model_auto_completer` into shape, and I may still end up doing so, but I am eager to find out if there are better options out there.
[1]: http://railscasts.com/episodes/102-auto-complete-association
[2]: http://railscasts.com/episodes/102-auto-complete-association#comment_37039
[3]: http://model-ac.rubyforge.org/
[4]: http://model-ac.rubyforge.org/classes/ModelAutoCompleterHelper.html#M000003 | 0 | [
2,
19,
2240,
18,
15,
98,
22,
18,
14,
246,
161,
20,
164,
3108,
15990,
30,
1285,
1817,
47,
2027,
13,
9178,
60,
800,
3726,
3726,
31,
259,
20,
57,
21,
1854,
1649,
30,
14,
4155,
92,
1001,
19,
30,
1285,
40,
20624,
8,
27459,
968,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get the file path from HTML input form in Firefox 3
===
We have simple HTML form with `<input type="file">`, like shown below:
<form><label for="attachment">Attachment:</label> <input type="file"
name="attachment" id="attachment"><input type="submit"></form>
In IE7 (and probably all famous browsers, including old Firefox 2), if we submit a file like '//server1/path/to/file/filename' it works properly and gives the full path to the
file and the filename.
In Firefox 3, it returns only 'filename', because of their new 'security feature' to truncate the path, as explained in Firefox bug tracking system (https://bugzilla.mozilla.org/show_bug.cgi?id=143220)
I have no clue how to overcome this 'new feature' because it causes all upload forms in my webapp to stop working on Firefox 3.
Can anyone help to find a single solution to get the file path both on Firefox 3 and IE7? | 0 | [
2,
184,
20,
164,
14,
3893,
2013,
37,
13,
15895,
6367,
505,
19,
535,
18219,
203,
800,
3726,
3726,
95,
57,
1935,
13,
15895,
505,
29,
13,
1,
108,
4881,
1001,
3726,
7,
16877,
7,
1,
15,
101,
1721,
1021,
45,
13,
1,
4190,
1,
21018,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PythonWin's python interactive shell calling constructors twice?
===
While answering [http://stackoverflow.com/questions/68645/python-static-variable#81002][1]
I noticed that PythonWin PyWin32 build 209.2 interpreter seems to evaluate twice?
PythonWin 2.5 (r25:51908, Mar 9 2007, 17:40:28) [MSC v.1310 32 bit (Intel)] on win32.
Portions Copyright 1994-2006 Mark Hammond - see 'Help/About PythonWin' for further copyright information.
>>> class X:
... l = []
... def __init__(self):
... self.__class__.l.append(1)
...
>>> X().l
[1, 1]
>>>
while the python interpreter does the right thing
C:\>python
ActivePython 2.5.0.0 (ActiveState Software Inc.) based on
Python 2.5 (r25:51908, Mar 9 2007, 17:40:28) [MSC v.1310 32 bit (Intel)] on win32
Type "help", "copyright", "credits" or "license" for more information.
>>> class X:
... l = []
... def __init__(self):
... self.__class__.l.append(1)
...
>>> X().l
[1]
>>>
[1]: http://stackoverflow.com/questions/68645/python-static-variable#81002 | 0 | [
2,
20059,
4181,
22,
18,
20059,
9194,
3593,
2555,
6960,
248,
18,
2088,
60,
800,
3726,
3726,
133,
11777,
636,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
4279,
3470,
10551,
6448,
11570,
8,
18077,
8,
8220,
579,
5910,
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... |
Remote debugging with Eclipse CDT
===
We're using the Eclipse CDT 5 C++ IDE on Windows to develop a C++ application on a remote AIX host.
Eclipse CDT has the ability to perform remote debugging using gdbserver. Unfortunately, gdbserver is not supported on AIX.
Is anyone familiar with a way to debug remotely using Eclipse CDT without gdbserver? Perhaps using an SSH shell connection to gdb?
| 0 | [
2,
5388,
121,
16254,
2762,
29,
11652,
1745,
38,
800,
3726,
3726,
95,
22,
99,
568,
14,
11652,
1745,
38,
331,
272,
20512,
13,
3448,
27,
1936,
20,
2803,
21,
272,
20512,
3010,
27,
21,
5388,
21,
4028,
2015,
9,
11652,
1745,
38,
63,
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... |
Can I call an external script or program when building a SWF file in Flash CS3?
===
Is there a way to call an external script or program from Flash CS3 every time it builds a SWF file? I'd like to add subversion information using subwcrev - the SVN keywords don't work because they only update when the version class file is updated. | 0 | [
2,
92,
31,
645,
40,
4886,
3884,
54,
625,
76,
353,
21,
13,
18,
15263,
3893,
19,
4433,
272,
18,
240,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
645,
40,
4886,
3884,
54,
625,
37,
4433,
272,
18,
240,
352,
85,
32,
1895,
18,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Lighttpd and WebDAV for serving a Subversion repo
===
I've configured (at least I've tried to configure) Lighty to enable the WebDAV plugin when I go to a certain URL. I don't get any errors, so it seems to be working. How, then, do I configure it to serve my subversion repositories (of which I have many)? | 0 | [
2,
471,
38,
9251,
17,
2741,
43,
5214,
26,
1799,
21,
972,
10898,
302,
1638,
800,
3726,
3726,
31,
22,
195,
28895,
13,
5,
721,
639,
31,
22,
195,
794,
20,
1065,
15951,
6,
471,
93,
20,
9240,
14,
2741,
43,
5214,
10922,
108,
76,
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 can I block mp3 crawlers from my website under Apache?
===
Is there some way to block access from a referrer using a .htaccess file or similar? My bandwidth is being eaten up by people referred from http://www.dizzler.com which is a flash based site that allows you to browse a library of crawled publicly available mp3s. | 0 | [
2,
184,
92,
31,
1921,
4628,
240,
12392,
445,
37,
51,
2271,
131,
17140,
60,
800,
3726,
3726,
25,
80,
109,
161,
20,
1921,
1381,
37,
21,
5017,
99,
139,
568,
21,
13,
9,
9020,
20604,
3893,
54,
835,
60,
51,
23392,
25,
142,
8792,
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 to open mutliple HTMLHelp files at the same time using Delphi.
===
In Delphi, the application's main help file is assigned through the TApplication.HelpFile property. All calls to the application's help system then use this property (in conjunction with CurrentHelpFile) to determine the help file to which help calls should be routed.
In addition to TApplication.HelpFile, each form also has a TForm.HelpFile property which can be used to specify a different (separate) help file for help calls originating from that specific form.
If an application's main help window is already open however, and a help call is made display help from a secondary help file, both help windows hang. Neither of the help windows can now be accessed, and neither can be closed. The only way to get rid of the help windows is to close the application, which results in both help windows being automatically closed as well.
Example:
Application.HelpFile := 'Main Help.chm'; //assign the main help file name
Application.HelpContext(0); //dispays the main help window
Form1.HelpFile := 'Secondary Help.chm'; //assign a different help file
Application.HelpContext(0); //should display a second help window
The last line of code above opens the secondary help window (but with no content) and then both help windows hang.
My Question is this:
1. Is it possible to display two HTMLHelp windows at the same time, and if so, what is the procedure to be followed?
2. If not, is there a way to tell whether or not an application's help window is already open, and then close it programatically before displaying a different help window?
(I am Using Delphi 2007 with HTMLHelp files on Windows Vista)
| 0 | [
2,
184,
20,
368,
13,
7903,
6013,
413,
13,
15895,
14593,
6488,
35,
14,
205,
85,
568,
23030,
9,
800,
3726,
3726,
19,
23030,
15,
14,
3010,
22,
18,
407,
448,
3893,
25,
2467,
120,
14,
5526,
20669,
9,
14593,
16877,
1354,
9,
65,
3029,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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: Easiest way to merge a release into one jar-file
===
I wonder if someone knows of a tool or script which easily merges a bunch of jar-files into one .jar. A bonus would be to easily set the main-file manifest and make it executable.
The concrete case is a java restructured text tool:
[http://jrst.labs.libre-entreprise.org/en/user/functionality.html][1]
I would like to run it with something like
<pre>
java -jar rst.jar
</pre>
As far as I can tell it no dependencies which indicates that it shouldn't be an easy single-file tool, but the downloaded zip-file contains a lot of libs.
<pre>
0 11-30-07 10:01 jrst-0.8.1/
922 11-30-07 09:53 jrst-0.8.1/jrst.bat
898 11-30-07 09:53 jrst-0.8.1/jrst.sh
2675 11-30-07 09:42 jrst-0.8.1/readmeEN.txt
108821 11-30-07 09:59 jrst-0.8.1/jrst-0.8.1.jar
2675 11-30-07 09:42 jrst-0.8.1/readme.txt
0 11-30-07 10:01 jrst-0.8.1/lib/
81508 11-30-07 09:49 jrst-0.8.1/lib/batik-util-1.6-1.jar
2450757 11-30-07 09:49 jrst-0.8.1/lib/icu4j-2.6.1.jar
559366 11-30-07 09:49 jrst-0.8.1/lib/commons-collections-3.1.jar
83613 11-30-07 09:49 jrst-0.8.1/lib/commons-io-1.3.1.jar
207723 11-30-07 09:49 jrst-0.8.1/lib/commons-lang-2.1.jar
52915 11-30-07 09:49 jrst-0.8.1/lib/commons-logging-1.1.jar
260172 11-30-07 09:49 jrst-0.8.1/lib/commons-primitives-1.0.jar
313898 11-30-07 09:49 jrst-0.8.1/lib/dom4j-1.6.1.jar
1994150 11-30-07 09:49 jrst-0.8.1/lib/fop-0.93-jdk15.jar
55147 11-30-07 09:49 jrst-0.8.1/lib/activation-1.0.2.jar
355030 11-30-07 09:49 jrst-0.8.1/lib/mail-1.3.3.jar
77977 11-30-07 09:49 jrst-0.8.1/lib/servlet-api-2.3.jar
226915 11-30-07 09:49 jrst-0.8.1/lib/jaxen-1.1.1.jar
153253 11-30-07 09:49 jrst-0.8.1/lib/jdom-1.0.jar
50789 11-30-07 09:49 jrst-0.8.1/lib/jewelcli-0.41.jar
324952 11-30-07 09:49 jrst-0.8.1/lib/looks-1.2.2.jar
121070 11-30-07 09:49 jrst-0.8.1/lib/junit-3.8.1.jar
358085 11-30-07 09:49 jrst-0.8.1/lib/log4j-1.2.12.jar
72150 11-30-07 09:49 jrst-0.8.1/lib/logkit-1.0.1.jar
342897 11-30-07 09:49 jrst-0.8.1/lib/lutinwidget-0.9.jar
2160934 11-30-07 09:49 jrst-0.8.1/lib/docbook-xsl-nwalsh-1.71.1.jar
301249 11-30-07 09:49 jrst-0.8.1/lib/xmlgraphics-commons-1.1.jar
68610 11-30-07 09:49 jrst-0.8.1/lib/sdoc-0.5.0-beta.jar
3149655 11-30-07 09:49 jrst-0.8.1/lib/xalan-2.6.0.jar
1010675 11-30-07 09:49 jrst-0.8.1/lib/xercesImpl-2.6.2.jar
194205 11-30-07 09:49 jrst-0.8.1/lib/xml-apis-1.3.02.jar
78440 11-30-07 09:49 jrst-0.8.1/lib/xmlParserAPIs-2.0.2.jar
86249 11-30-07 09:49 jrst-0.8.1/lib/xmlunit-1.1.jar
108874 11-30-07 09:49 jrst-0.8.1/lib/xom-1.0.jar
63966 11-30-07 09:49 jrst-0.8.1/lib/avalon-framework-4.1.3.jar
138228 11-30-07 09:49 jrst-0.8.1/lib/batik-gui-util-1.6-1.jar
216394 11-30-07 09:49 jrst-0.8.1/lib/l2fprod-common-0.1.jar
121689 11-30-07 09:49 jrst-0.8.1/lib/lutinutil-0.26.jar
76687 11-30-07 09:49 jrst-0.8.1/lib/batik-ext-1.6-1.jar
124724 11-30-07 09:49 jrst-0.8.1/lib/xmlParserAPIs-2.6.2.jar
</pre>
As you can see, it somewhat desirable, not having to dothis manually.
Thank you.
[1]: http://jrst.labs.libre-entreprise.org/en/user/functionality.html | 0 | [
2,
8247,
45,
27237,
161,
20,
12666,
21,
830,
77,
53,
5112,
8,
16877,
800,
3726,
3726,
31,
2666,
100,
737,
3620,
16,
21,
5607,
54,
3884,
56,
2351,
12666,
18,
21,
7653,
16,
5112,
8,
16877,
18,
77,
53,
13,
9,
6300,
9,
21,
5708,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Case insensitive search on Sybase
===
I have been sick and tired Googling the solution for doing case-insensitive search on Sybase ASE (Sybase data/column names are case sensitive). The Sybase documentation proudly says that there is only one way to do such search which is using the Upper and Lower functions, but the adage goes, it has performance problems. And believe me they are right, if your table has huge data the performance is so awkward you are never gonna use Upper and Lower again. My question to fellow developers is: how do you guys tackle this?
P.S. Don't advise to change the sort-order or move to any other Database please, in real world developers don't control the databases. | 0 | [
2,
610,
19,
19435,
2122,
27,
10315,
8436,
800,
3726,
3726,
31,
57,
74,
3352,
17,
4117,
162,
5598,
802,
14,
4295,
26,
845,
610,
8,
108,
19435,
2122,
27,
10315,
8436,
28,
62,
13,
5,
4980,
8436,
1054,
118,
716,
4404,
103,
1817,
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... |
Ways to avoid eager spool operations on SQL Server
===
I have an ETL process that involves a stored procedure that makes heavy use of SELECT INTO statements (minimally logged and therefore faster as they generate less log traffic). Of the batch of work that takes place in one particular stored the stored procedure several of the most expensive operations are eager spools that appear to just buffer the query results and then copy them into the table just being made.
The MSDN documentation on eager spools is quite sparse - does anyone have a deeper insight into whether these are really necessary (and under what circumstances). I have a few theories that may or may not make sense, but no success in eliminating these from the queries.
The .sqlplan files are quite large (160kb) so I guess it's probably not reasonable to post them directly to a forum.
So, here are some theories that may be amenable to specific answers:
o The query uses some UDF's for data transformation, such as parsing formatted dates. Does this data transformation necessitate the use of eager spools to allocate sensible types (e.g. varchar lengths) to the table before it constructs it?
o As an extension of the question above, does anyone have a deeper view of what does or does not drive this operation in a query?
Nigel
| 0 | [
2,
2847,
20,
2658,
8705,
13,
18,
13378,
1311,
27,
4444,
255,
8128,
800,
3726,
3726,
31,
57,
40,
2133,
255,
953,
30,
6569,
21,
8214,
7004,
30,
1364,
1278,
275,
16,
5407,
77,
9015,
13,
5,
6840,
79,
1326,
13,
19287,
17,
1793,
4233,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 listen to a RoutedEvent from a class that doesn't derive from FrameworkElement ? Can it be done ?
===
The question says it all basically.
I want in a
class MyClass
to listen to a routed event. Can it be done ? | 0 | [
2,
184,
92,
31,
3834,
20,
21,
858,
546,
6645,
37,
21,
718,
30,
1437,
22,
38,
20576,
37,
6596,
27567,
13,
60,
92,
32,
44,
677,
13,
60,
800,
3726,
3726,
14,
1301,
898,
32,
65,
11374,
9,
31,
259,
19,
21,
718,
51,
1898,
20,
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,
0,
0,
0... |
ASP.NET : How to detect file upload Mime type?
===
How do people usually detect mime type once file uploaded using asp.net? | 0 | [
2,
28,
306,
9,
2328,
13,
45,
184,
20,
9092,
3893,
71,
8294,
26193,
1001,
60,
800,
3726,
3726,
184,
107,
148,
951,
9092,
26193,
1001,
382,
3893,
23782,
568,
28,
306,
9,
2328,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Windows Vista Programatically remap user directories
===
I re-image one of my machines regularly; and have a script that I run after the OS install completes to configure my machine; such that it works how I like.
I happen to have my data on another drive...and I'd like to add code to my script to change the location of the Documents directory from "C:\Users\bryansh\Documents" to "D:\Users\bryansh\Documents".
Does anybody have any insight, before I fire up regmon and really roll up my sleeves? | 0 | [
2,
1936,
13520,
625,
721,
8438,
302,
15022,
4155,
559,
1596,
800,
3726,
3726,
31,
302,
8,
22039,
53,
16,
51,
6035,
4217,
73,
17,
57,
21,
3884,
30,
31,
485,
75,
14,
13,
759,
16146,
1279,
18,
20,
1065,
15951,
51,
1940,
73,
145,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Pattern for saving and writing to different file formats
===
Is there a pattern that is good to use when saving and loading different file formats?
For example, I have a complicated class hierarchy for the document, but I want to support a few different file formats.
I thought about the Strategy pattern, but I'm not convinced because of the need to access every part of the object in order to save and load it. | 0 | [
2,
3732,
26,
7599,
17,
1174,
20,
421,
3893,
13767,
800,
3726,
3726,
25,
80,
21,
3732,
30,
25,
254,
20,
275,
76,
7599,
17,
12797,
421,
3893,
13767,
60,
26,
823,
15,
31,
57,
21,
8343,
718,
14417,
26,
14,
4492,
15,
47,
31,
259,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Custom X509SecurityTokenManager ignored
===
I have a webservice that that uses message layer security with X.509 certificates in WSE 3.0. The service uses a X509v3 policy to sign various elements in the soapheader.
I need to do some custom checks on the certificates so I've tried to implement a custom X509SecurityTokenManager and added a section in web.config.
When I call the service with my Wseproxy I would expect a error (NotImplementedException) but the call goes trough and, in the example below, "foo" is printed at the console.
The question is: What have missed? The binarySecurityTokenManager type in web.config matches the full classname of RDI.Server.X509TokenManager. X509TokenManager inherits from
X509SecurityTokenManager (altough methods are just stubs).
using System;
using System.Xml;
using System.Security.Permissions;
using System.Security.Cryptography;
using Microsoft.Web.Services3;
using Microsoft.Web.Services3.Security.Tokens;
namespace RDI.Server
{
[SecurityPermissionAttribute(SecurityAction.Demand,Flags = SecurityPermissionFlag.UnmanagedCode)]
public class X509TokenManager : Microsoft.Web.Services3.Security.Tokens.X509SecurityTokenManager
{
public X509TokenManager() : base()
{
throw new NotImplementedException("Stub");
}
public X509TokenManager(XmlNodeList configData) : base(configData)
{
throw new NotImplementedException("Stub");
}
protected override void AuthenticateToken(X509SecurityToken token)
{
base.AuthenticateToken(token);
throw new NotImplementedException("Stub");
}
}
}
The first few lines of my web.config, edited for brevity
`<?xml version="1.0"?>
<configuration><configSections><section name="microsoft.web.services3" type="..." />
</configSections><microsoft.web.services3><policy fileName="wse3policyCache.config" />
<security><binarySecurityTokenManager><add type="RDI.Server.X509TokenManager" valueType="http://docs.oasis-open.org/..." /></binarySecurityTokenManager></security></microsoft.web.services3>`
(Btw, how do one format xml nicely here at stackoverflow?)
Administration.AdministrationWse test = new TestConnector.Administration.AdministrationWse();
X509Certificate2 cert = GetCert("RDIDemoUser2");
X509SecurityToken x509Token = new X509SecurityToken(cert);
test.SetClientCredential(x509Token);
string message = test.Ping("foo");
Console.WriteLine(message);
| 0 | [
2,
5816,
993,
264,
2545,
17749,
262,
2853,
22256,
5424,
800,
3726,
3726,
31,
57,
21,
2741,
11449,
30,
30,
2027,
2802,
5385,
1221,
29,
993,
9,
264,
2545,
6259,
18,
19,
619,
870,
203,
9,
387,
9,
14,
365,
2027,
21,
993,
264,
2545,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where to put the dependency injection framework config file?
===
I've got a solution with several different projects in it, some are pure class libraries and some are web app projects. If I want my default types to be available to all projects, where should I put the config file for the container? | 0 | [
2,
113,
20,
442,
14,
26835,
13646,
6596,
13,
14093,
2816,
3893,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
4295,
29,
238,
421,
2314,
19,
32,
15,
109,
50,
4267,
718,
8649,
17,
109,
50,
2741,
4865,
2314,
9,
100,
31,
259,
51,
128... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WCF - Faults / Exceptions versus Messages
===
We're currently having a debate whether it's better to throw Faults over a WCF channel, versus passing a message indicating the status or the response from a service.
Faults come with built in support from WCF where by you can utilize the built in error handlers and react accordingly. This however carries overhead as throwing exceptions in .NET can be quite costly.
Messages can contain neccesary information to determine what happened with your service call without the overhead of throwing an exception. It does however need several lines of repetitive code to analyze the message and determine actions following it's contents.
We took a stab at creating a generic message object we could utilize in our services, and this is what we came up with:
public class ReturnItemDTO<T>
{
[DataMember]
public bool Success { get; set; }
[DataMember]
public string ErrorMessage { get; set; }
[DataMember]
public T Item { get; set; }
}
If all my service calls return this item, I can consistently check the "Success" property to determine if all went well. I then have a Error Message string in the event something went wrong, and a generic item containing a Dto if needed.
Exception information will have to be logged away to a central logging service and not passed back from the service.
Thoughts? Comments? Ideas? Suggestions? | 0 | [
2,
11801,
410,
13,
8,
4173,
18,
13,
118,
13392,
5706,
7561,
800,
3726,
3726,
95,
22,
99,
871,
452,
21,
4503,
1472,
32,
22,
18,
574,
20,
3814,
4173,
18,
84,
21,
11801,
410,
1318,
15,
5706,
2848,
21,
2802,
7950,
14,
1782,
54,
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... |
DataGridView : How to can I do multimine data entry in a usable way?
===
With the DataGridView it is possible to display cells containing some long text. The grid just increases the row height to display all the text, taking care of word wrap and linefeeds.
Data entry is possible as well. Control+Return inserts a line feed.
But: if the cell only has one line of text initially, the row height is just the height of one line. When I enter text, I always see only one line. Ctrl+Return scrolls the text up, and I can enter a new line. But the last line is not visible any more, only the line I just enter.
How can I tell the DataGridView to increase the line heigth automatically while I enter text? | 0 | [
2,
1054,
16375,
4725,
13,
45,
184,
20,
92,
31,
107,
1889,
7640,
1054,
2792,
19,
21,
182,
579,
161,
60,
800,
3726,
3726,
29,
14,
1054,
16375,
4725,
32,
25,
938,
20,
3042,
2934,
3503,
109,
175,
1854,
9,
14,
7354,
114,
7104,
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... |
Using the same test suite on various implementations of a repository interface.
===
I have been making a little toy web application in C# along the lines of Rob Connery's Asp.net MVC storefront.
I find that I have a repository interface, call it IFooRepository, with methods, say
IQueryable<Foo> GetFoo();
void PersistFoo(Foo foo);
And I have three implementations of this: ISqlFooRepository, IFileFooRepostory, and IMockFooRepository.
I also have some test cases. What I would like to do, and haven't worked out how to do yet, is to run the test cases against each of these three implementations, and have a green tick for each test pass on each interface type.
e.g.
[TestMethod]
Public void GetFoo_NotNull_Test()
{
IFooRepository repository = GetRepository();
var results = repository. GetFoo();
Assert.IsNotNull(results);
}
I want this test method to be run three times, with some variation in the environment that allows it to get three different kinds of repository. At present I have three cut-and-pasted test classes that differ only in the implementation of private IFooRepository GetRepository(); Obviously, this is smelly.
I am using the Microsoft testing framework. But a suggestion of how to do this in, say, MBUnit would also be of some interest.
| 0 | [
2,
568,
14,
205,
1289,
6160,
27,
617,
6123,
18,
16,
21,
24869,
6573,
9,
800,
3726,
3726,
31,
57,
74,
544,
21,
265,
20,
93,
2741,
3010,
19,
272,
5910,
303,
14,
1560,
16,
3830,
18384,
93,
22,
18,
28,
306,
9,
2328,
307,
8990,
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... |
Changing the default encoding for String(byte[])
===
Is there a way to change the encoding used by the String(byte[]) constructor ?
In my own code I use String(byte[],String) to specify the encoding but I am using an external library that I cannot change.
String src = "with accents: é à";
byte[] bytes = src.getBytes("UTF-8");
System.out.println("UTF-8 decoded: "+new String(bytes,"UTF-8"));
System.out.println("Default decoded: "+new String(bytes));
The output for this is :
<pre>UTF-8 decoded: with accents: é à
Default decoded: with accents: é Ã
</pre>
I have tried changing the system property `file.encoding` but it does not work.
| 0 | [
2,
4226,
14,
12838,
19608,
26,
3724,
5,
23246,
2558,
500,
6,
800,
3726,
3726,
25,
80,
21,
161,
20,
753,
14,
19608,
147,
34,
14,
3724,
5,
23246,
2558,
500,
6,
6960,
248,
13,
60,
19,
51,
258,
1797,
31,
275,
3724,
5,
23246,
2558,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to blog code at wordpress.com
===
got a new blog at wordpress few days ago (http://ghads.wordpress.com) and I want to post some code snippets now or then. Is there anyway to make it look like code without paying for extra plugins? Thanks a lot! | 0 | [
2,
184,
20,
8146,
1797,
35,
833,
5890,
9,
960,
800,
3726,
3726,
330,
21,
78,
8146,
35,
833,
5890,
310,
509,
1464,
13,
5,
21127,
6903,
12203,
43,
18,
9,
9587,
5890,
9,
960,
6,
17,
31,
259,
20,
678,
109,
1797,
13,
29061,
18,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Compare Quagga to XORP
===
What do you think of <a href="http://quagga.net">Quagga</a> compared to <a href="www.xorp.org">XORP</a> as a dynamic software routing engine? What are the technical merits of each engine comparatively? Additionally, what do most people think of them from a programming view. Who has manipulated networks using these enginers? I was wondering from an OSPF, routing, BGP protocol user's perpspective. | 0 | [
2,
11590,
7131,
4572,
58,
20,
13,
13955,
6952,
800,
3726,
3726,
98,
107,
42,
277,
16,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
5418,
4572,
58,
9,
2328,
7,
1,
5418,
4572,
58,
1,
118,
58,
1,
2428,
20,
13,
1,
58,
746,
14057... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Most efficient way to increment a Map value in Java
===
I hope this question is not considered too basic for this forum, but we'll see. I'm wondering how to refactor some code for better performance that is getting run a bunch of times.
Say I'm creating a word frequency list, using a Map (probably a HashMap), where each key is a String with the word that's being counted and the value is an Integer that's incremented each time a token of the word is found.
In Perl, incrementing such a value would be trivially easy:
$map{$word}++;
But in Java, it's much more complicated. Here the way I'm currently doing it:
int count = map.containsKey(word) ? map.get(word) : 0;
map.put(word, count + 1);
Which of course relies on the autoboxing feature in the newer Java versions. I wonder if you can suggest a more efficient way of incrementing such a value. Are there even good performance reasons for eschewing the Collections framework and using a Hashtable instead?
| 0 | [
2,
127,
8243,
161,
20,
13,
28461,
21,
2942,
1923,
19,
8247,
800,
3726,
3726,
31,
1376,
48,
1301,
25,
52,
724,
266,
2125,
26,
48,
5691,
15,
47,
95,
22,
211,
196,
9,
31,
22,
79,
5712,
184,
20,
302,
17455,
109,
1797,
26,
574,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Getting windows/domain credentials in asp.net while allowing anonymous access in IIS
===
I have an asp.NET webapplication running in our datacenter in which we want the customer to logon with single sign-on. This would be very easy if we could use the IIS integrated security. However we can't do this. We don't have a trust to the domain controller of the customer. ANd we want to website to be available to the general internet. Only when people are connecting from within the clients network they should automatically login.
What we have is a list of domain accounts and a way to query the DC via LDAP in asp.net code. When anonymous access is allowed in IIS, IIS never challenges the browser for credentials. And thus our application never gets the users credentials.
Is there a way to force the browser into sending the credentials (and thus be able to use single sign-on) with IIS accepting anonymous request. I tried sending 401 headers myself. However IIS takes complete control of the chain of requests, not executing my asp.net code. | 0 | [
2,
1017,
1936,
118,
537,
6232,
5059,
43,
10107,
18,
19,
28,
306,
9,
2328,
133,
2719,
10364,
1381,
19,
595,
18,
800,
3726,
3726,
31,
57,
40,
28,
306,
9,
2328,
2741,
2552,
20669,
946,
19,
318,
1054,
12641,
19,
56,
95,
259,
14,
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... |
private IP address ranges
===
What are the private IP address ranges? | 0 | [
2,
932,
15735,
3218,
9230,
800,
3726,
3726,
98,
50,
14,
932,
15735,
3218,
9230,
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,
0,
0,
0,
0,
0,
0... | [
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,
0,
0,
0,
0,
0... |
How to retrieve stored procedure return values from a TableAdapter
===
I cannot find an elegant way to get the return value from a stored procedure when using TableAdapters.
It appears the TableAdapter does not support SQL stored procedure return values when using a non-scalar stored procedure call. You'd expect the return value from the auto-generated function would be the return value from the stored procedure but it isn't (it is actually the number of rows affected). Although possible to use 'out' parameters and pass a variable as a ref to the auto generated functions it isn't a very clean solution.
I have seen some ugly hacks on the web to solve this, but no decent solution. Any help would be appreciated. | 0 | [
2,
184,
20,
11917,
8214,
7004,
788,
4070,
37,
21,
859,
27576,
106,
800,
3726,
3726,
31,
1967,
477,
40,
11614,
161,
20,
164,
14,
788,
1923,
37,
21,
8214,
7004,
76,
568,
859,
27576,
445,
9,
32,
1780,
14,
859,
27576,
106,
630,
52,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to setup access control in SVN?
===
I have setup a repository using SVN and uploaded projects. There are multiple users working on these projects. But, not everyone is working on all projects and require access. I want to setup permissioning for each of the projects with users.
How to achieve this? | 0 | [
2,
184,
20,
18161,
1381,
569,
19,
13,
18,
16578,
60,
800,
3726,
3726,
31,
57,
18161,
21,
24869,
568,
13,
18,
16578,
17,
23782,
2314,
9,
80,
50,
1886,
3878,
638,
27,
158,
2314,
9,
47,
15,
52,
1266,
25,
638,
27,
65,
2314,
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... |
Connecting Outlook 2007 to Domino 6.5 ?
===
Outlook (2007 now) is my favorite mail client and I would like to keep using it for both private and work emails. But with my new work, I discovered (with horror) that we have to use Lotus Domino and Lotus Notes 6.5 as client.
Is it possible to get my Lotus mails inside Outlook while maintaining my private POP mails in their existing PST ?
Here is the configuration:
- Lotus Domino server version is 6.5
- Outlook 2007 (fully patched) with a pst file created to handle private POP mail accounts.
- MS Office Outlook Connector for IBM Lotus Domino v2.0.4007.0
(This also my first question to StackOverflow so it is my way to test the return of this site.)
| 0 | [
2,
6440,
19837,
624,
20,
23320,
400,
9,
264,
13,
60,
800,
3726,
3726,
19837,
13,
5,
2727,
130,
6,
25,
51,
3839,
4216,
6819,
17,
31,
83,
101,
20,
643,
568,
32,
26,
156,
932,
17,
170,
8517,
18,
9,
47,
29,
51,
78,
170,
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... |
Should I start using LINQ?
===
Currently I am using NetTiers to generate my data access layer and service layer. I have been using NetTiers for over 2 years and have found it to be very useful. At some point I need to look at LINQ so my questions are...
1. Has anyone else gone from NetTiers to LINQ?
2. Was this switch over a good or bad thing?
3. Is there anything that I should be aware of?
4. Would you recommend this switch?
Basically I would welcome any thoughts...
thanks
Rippo
| 0 | [
2,
378,
31,
799,
568,
6294,
1251,
60,
800,
3726,
3726,
871,
31,
589,
568,
4275,
5259,
18,
20,
7920,
51,
1054,
1381,
5385,
17,
365,
5385,
9,
31,
57,
74,
568,
4275,
5259,
18,
26,
84,
172,
122,
17,
57,
216,
32,
20,
44,
253,
481... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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: why do I receive the error message "Type mismatch: cannot convert int to byte"
===
If you declare variables of type byte or short and attempt to perform arithmetic operations on these, you receive the error "Type mismatch: cannot convert int to short" (or correspondingly "Type mismatch: cannot convert int to byte").
<pre>byte a = 23;
byte b = 34;
byte c = a + b;</pre>
In this example, the compile error is on the third line. | 0 | [
2,
8247,
45,
483,
107,
31,
2588,
14,
7019,
2802,
13,
7,
4474,
2462,
12280,
45,
1967,
8406,
19,
38,
20,
34,
591,
7,
800,
3726,
3726,
100,
42,
10123,
12157,
16,
1001,
34,
591,
54,
502,
17,
1735,
20,
2985,
21211,
1311,
27,
158,
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... |
Postgres replication
===
Right now I have a database (about 2-3 GB) in PostgreSQL, which serves as a data storage to RoR/Python LAMP-like application.
What kind tools are there that are simple and robust enough for replication of the main database to a second machine?
I looked through some packages (Slony-I and etc.) but it would be great to hear real-life stories as well.
Right now I'm not concerned with load balancing and etc. I am thinking about using simple Write-Ahead-Log strategy for now. | 0 | [
2,
678,
6879,
18,
23841,
800,
3726,
3726,
193,
130,
31,
57,
21,
6018,
13,
5,
6901,
172,
8,
240,
14857,
6,
19,
678,
6879,
18,
22402,
15,
56,
2589,
28,
21,
1054,
4326,
20,
761,
248,
118,
6448,
11570,
6792,
8,
1403,
3010,
9,
98,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Parser for C#
===
Which parsers are available for parsing C# code?
I'm looking for a C# parser that can be used in C# and give me access to line and file informations about each artefact of the analysed code. | 0 | [
2,
2017,
4104,
26,
272,
5910,
800,
3726,
3726,
56,
2017,
18,
445,
50,
904,
26,
2017,
18,
68,
272,
5910,
1797,
60,
31,
22,
79,
699,
26,
21,
272,
5910,
2017,
4104,
30,
92,
44,
147,
19,
272,
5910,
17,
590,
55,
1381,
20,
293,
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,
0... |
How do you add a JavaScript widget to a Wordpress.com hosted blog?
===
I've got a [site][1] that provides blog-friendly widgets via JavaScript. These work fine in most circumstances, including self-hosted Wordpress blogs. With blogs hosted at Wordpress.com, however, JavaScript isn't allowed in sidebar text modules. Has anyone seen a workaround for this limitation?
[1]: http://notebooks.readerville.com/ | 0 | [
2,
184,
107,
42,
3547,
21,
8247,
8741,
4807,
43,
3060,
20,
21,
833,
5890,
9,
960,
2812,
8146,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
636,
9097,
500,
2558,
165,
500,
30,
1927,
8146,
8,
15950,
4807,
43,
3060,
18,
1197,
8247,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Enabling single sign-on between Desktop Application and Website
===
We have a client/server application with a rich client front end (in .Net) and also an administration portal (Asp.Net). Currently users have to sign on in both the rich client and on the website. We'd like to enable them to sign into the rich client, but not have to sign on to the website if they launch it from within the client. How can we do that?
Going the other way is less important, but would be nice if possible: signing on to the website, then not having to sign into the rich client. | 0 | [
2,
13168,
345,
1676,
8,
218,
128,
17404,
3010,
17,
2271,
800,
3726,
3726,
95,
57,
21,
6819,
118,
10321,
106,
3010,
29,
21,
2042,
6819,
431,
241,
13,
5,
108,
13,
9,
2328,
6,
17,
67,
40,
1603,
8281,
13,
5,
472,
306,
9,
2328,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Multi-user Snippet Manager
===
Currently, we're using a wiki at work to share insights, tips and information. But somehow, people aren't sharing snippets that way. It's probably too inconvenient to write and too difficult to find snippets there.
So, is there a multi-user/collaborative snippets manager around? Something like [Snippely][1]. (Has anyone tried Snippely in multi-user mode?)
- Since we're all on the same site, it would probably be best if it used mapped network drives or ODBC instead of its own server process.
- Oh, and it has to support Unicode and let us choose any truetype font. We're using the hideous APL language, which uses [special characters][2].
- It would be nice if it didn't cost money, so I wouldn't have to convince management to pay for it as well as the other developers to use it.
[1]: http://code.google.com/p/snippely/
[2]: http://en.wikipedia.org/wiki/APL_(programming_language)#APL_symbols_and_keyboard_layout | 0 | [
2,
1889,
8,
16704,
13,
29061,
1382,
800,
3726,
3726,
871,
15,
95,
22,
99,
568,
21,
13,
17375,
35,
170,
20,
1891,
9239,
18,
15,
11034,
17,
676,
9,
47,
3625,
15,
148,
4847,
22,
38,
6126,
13,
29061,
18,
30,
161,
9,
32,
22,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Difference between VARCHAR2(11 BYTE) and VARCHAR2(11 CHAR),
===
In Oracle, what is the difference between :
CREATE TABLE CLIENT
(
NAME VARCHAR2(11 BYTE),
ID_CLIENT NUMBER
)
and
CREATE TABLE CLIENT
(
NAME VARCHAR2(11 CHAR), -- or even VARCHAR2(11)
ID_CLIENT NUMBER
)
Thank you.
| 0 | [
2,
2841,
128,
4033,
5433,
135,
5,
1306,
34,
591,
6,
17,
4033,
5433,
135,
5,
1306,
4892,
6,
15,
800,
3726,
3726,
19,
15759,
15,
98,
25,
14,
2841,
128,
13,
45,
1600,
859,
6819,
13,
5,
204,
4033,
5433,
135,
5,
1306,
34,
591,
6,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to avoid temporary file creation on server-side when pushing back full HTML content to clients?
===
In a server-side application running on Tomcat, I am generating full HTML pages (with header) based on random user-requested sites pulled down from the Internet. The client-side application uses asynchronous callbacks for requesting processing of a particular web page. Since processing can take a while, I want to inform the user about progress via polling, hence the callbacks.
On server-side, after the web page is retrieved, it is processed and an "enhanced" version is created. Then this version has to go back to the user.
Displaying the page as part of the page of the client-side application is not an option.
Currently, the server generates a temporary file and sends back a link to it. This is clearly suboptimal.
The next best solution I can come up with inolves creating a caching-DB that stores the HTML content together with its md5-sums or sha1-ids and then sends back a link to a servlet, with the hash-ID as an argument. The servlet then requests the site from the caching-DB.
Is there any better solution? If not, which DB-backend would you propose? I'm thinking of SQLite.
| 0 | [
2,
184,
20,
2658,
4700,
3893,
2502,
27,
8128,
8,
1416,
76,
5076,
97,
503,
13,
15895,
2331,
20,
7421,
60,
800,
3726,
3726,
19,
21,
8128,
8,
1416,
3010,
946,
27,
2067,
5782,
15,
31,
589,
13500,
503,
13,
15895,
4434,
13,
5,
1410,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Upload files in Google App Engine
===
I am planning to create a web app that allows users to downgrade their visual studio project files. However, I am not very sure whether Google App Engine accepts files uploading and flat file storing on the Google Server.
Anyone knows about this? | 0 | [
2,
71,
8294,
6488,
19,
8144,
4865,
1406,
800,
3726,
3726,
31,
589,
2334,
20,
1600,
21,
2741,
4865,
30,
2965,
3878,
20,
125,
8031,
66,
3458,
1120,
669,
6488,
9,
207,
15,
31,
589,
52,
253,
562,
1472,
8144,
4865,
1406,
16548,
6488,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0... |
How do I check ClickOnce prerequisites after first install?
===
If I understand correctly, ClickOnce only checks for prerequisites with the first install of an application through the setup.exe file that contains the prerequisite information. If the user opens the app in the future it will check for new versions, but it does not launch the setup.exe again, thus not checking for any NEW prerequisites that might have been added.
Is there any way to force ClickOnce to check the prerequisites again or does anyone have an good solution?
| 0 | [
2,
184,
107,
31,
2631,
10840,
13120,
782,
99,
16756,
6359,
75,
64,
16146,
60,
800,
3726,
3726,
100,
31,
1369,
12044,
15,
10840,
13120,
104,
16602,
26,
782,
99,
16756,
6359,
29,
14,
64,
16146,
16,
40,
3010,
120,
14,
18161,
9,
1706,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to do manual form authentication for ASP.NET mobile page
===
I ma developing a ASP.NET mobile website using .NET 3.5 and mobile controls that come with the framework. I have a login form where the system will authenticate the user so he/she can access certain restricted pages.
In a standard ASP.NET website, I can use session to store some flag after a user had logined, but I wonder can I do the same for the mobile version? Is session variable (or cookies) being support by those mobile device's browser? Is there any standard pratice also on doing authentication for mobile pages?
Pls help, thanks. | 0 | [
2,
184,
20,
107,
5132,
505,
27963,
26,
28,
306,
9,
2328,
3241,
2478,
800,
3726,
3726,
31,
1216,
3561,
21,
28,
306,
9,
2328,
3241,
2271,
568,
13,
9,
2328,
203,
9,
264,
17,
3241,
8671,
30,
340,
29,
14,
6596,
9,
31,
57,
21,
673... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
when using a FTPS connection to transfer a file, what is the difference between a 'Binary mode taransfer' and 'ASCII mode transfer' ?
===
I am using a <B> FTPS </b> connection to send a text file
<i>[this file will contain EDI(Electronic Data Interchange) information]</i>to a mailbox INOVIS.I have configured the system to open a FTPS connection and using the PUT command I write the file to a folder on the FTP server.
The problem is: what mode of file transfer should I use? How do I switch between modes?
Moreover which mode is the 'best-practice' to use when transferring file over FTPS connection.
If some one can provide me a small ftp script it would be helpful.
Waiting for your comments
Shaleen mohan
| 0 | [
2,
76,
568,
21,
1187,
1919,
2760,
20,
2617,
21,
3893,
15,
98,
25,
14,
2841,
128,
21,
13,
22,
4772,
1857,
3740,
2475,
5950,
2407,
22,
17,
13,
22,
472,
1892,
49,
3740,
2617,
22,
13,
60,
800,
3726,
3726,
31,
589,
568,
21,
13,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.