unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
How deep is the Win32 message queue?
===
How many messages does the queue for a standard window hold? What happens when the queue overflows?
The documentation for `GetMessage` and relatives doesn't say anything about this, and `PeekMessage` only gives you a yes/no for certain classes of messages, not a message count.
[This page](http://msdn.microsoft.com/en-us/library/aa925082.aspx) says that the queues are implemented using memory-mapped files, and that there is no message count limit, but that page is about WinCE. Does this apply to desktop Win32 as well? | 0 | [
2,
184,
855,
25,
14,
628,
3125,
2802,
22521,
60,
800,
3726,
3726,
184,
151,
7561,
630,
14,
22521,
26,
21,
1236,
1463,
1027,
60,
98,
5531,
76,
14,
22521,
20285,
18,
60,
14,
13945,
26,
13,
1,
3060,
3845,
18,
1303,
1,
17,
9216,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best practice for creating an ASP.NET MVC control or helper?
===
I'm looking to build an reusable control or custom helper for my MVC project. I'm sure there is a best practice for this. Any help is appreciated. | 0 | [
2,
98,
25,
14,
246,
1345,
26,
2936,
40,
28,
306,
9,
2328,
307,
8990,
569,
54,
448,
106,
60,
800,
3726,
3726,
31,
22,
79,
699,
20,
1895,
40,
302,
267,
579,
569,
54,
5816,
448,
106,
26,
51,
307,
8990,
669,
9,
31,
22,
79,
562... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Can I use RegEx and VI to autofill some text for me?
===
I have a form with nearly 100 fields that I would like to auto-fill with PHP. I know how to do the autofill, but I would like to avoid manually adding the needed text to 100 fields.
Is there an automated way I can take the text:
<input name="riskRating" id="riskRating" type="text" />
and change it to:
<input name="riskRating" id="riskRating" type="text" value="<?php echo $data riskRating]; ?>" />
I'm hoping some VI guru out there knows off the top of his/her head.
| 0 | [
2,
92,
31,
275,
7953,
1706,
17,
1790,
20,
3108,
19971,
109,
1854,
26,
55,
60,
800,
3726,
3726,
31,
57,
21,
505,
29,
1212,
808,
2861,
30,
31,
83,
101,
20,
3108,
8,
19971,
29,
13,
26120,
9,
31,
143,
184,
20,
107,
14,
3108,
199... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 causes java.lang.IllegalStateException: Post too large in tomcat / mod_jk
===
what configuration needs to be tweaked, and where does it live, in order to increase the maximum allowed post size? | 0 | [
2,
98,
4047,
8247,
9,
9949,
9,
5564,
4941,
3859,
10066,
872,
45,
678,
266,
370,
19,
2067,
5782,
13,
118,
7226,
1,
16455,
800,
3726,
3726,
98,
8091,
2274,
20,
44,
28769,
69,
15,
17,
113,
630,
32,
515,
15,
19,
389,
20,
1839,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How can you strip non-ASCII characters from a string? (in C#)
===
How can you strip non-ASCII characters from a string? (in C#) | 0 | [
2,
184,
92,
42,
4998,
538,
8,
472,
1892,
49,
1766,
37,
21,
3724,
60,
13,
5,
108,
272,
5910,
6,
800,
3726,
3726,
184,
92,
42,
4998,
538,
8,
472,
1892,
49,
1766,
37,
21,
3724,
60,
13,
5,
108,
272,
5910,
6,
3,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Restart IIS if new dll dropped in bin?
===
Do I have to restart IIS if I drop a new DLL in the bin of my virtual directory? | 0 | [
2,
22767,
595,
18,
100,
78,
13,
43,
211,
1539,
19,
4511,
60,
800,
3726,
3726,
107,
31,
57,
20,
22767,
595,
18,
100,
31,
2804,
21,
78,
13,
43,
211,
19,
14,
4511,
16,
51,
6599,
16755,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Command-line Unix ASCII-based charting / plotting tool
===
Is there a good command-line UNIX charting / graphing / plotting tool out there? I'm looking for something that will plot xy points on an ASCII graph. | 0 | [
2,
1202,
8,
1143,
22540,
28,
1892,
49,
8,
1281,
22544,
13,
118,
22716,
5607,
800,
3726,
3726,
25,
80,
21,
254,
1202,
8,
1143,
22540,
22544,
13,
118,
7210,
68,
13,
118,
22716,
5607,
70,
80,
60,
31,
22,
79,
699,
26,
301,
30,
129... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0... |
IIS performance problem trying to implement an XMPP-like protocol
===
we're have a client that needs to get interactive messages from a server, from clients that are distributed around the world behind all kinds of firewalls with all kinds of ports closed. The only thing we can rely on is HTTP port 80 (and HTTPS 443).
The design is basically modeled after XMPP (the Jabber protocol), using our client and IIS. The client issues GET requests to a .NET Handler; the handler holds the request open for a while looking for messages. If any messages arrive, they are immediately sent to the client; if not, after a timeout the connection is closed with a "no-data" response. The client immediately reopens the communication.
Well, theoretically.
What's actually happening is first, IIS can't handle more than about 100 simultaneous requests - others are all queued, and there can be a several minute lag between "connected" and IIS recognizing that the client called in. Second, about half the time the client times out without any response from the server (the client timeout is five minutes longer than the server's).
POST always works. Other data served on the same web server works. Web services on the same server work. This is an out-of-the-box installation on Windows 2K3 Server.
Is there a configuration option we're missing, or is there something else I should look at to address this?
Thanks. | 0 | [
2,
595,
18,
956,
1448,
749,
20,
8713,
40,
993,
79,
3421,
8,
1403,
8494,
800,
3726,
3726,
95,
22,
99,
57,
21,
6819,
30,
2274,
20,
164,
9194,
7561,
37,
21,
8128,
15,
37,
7421,
30,
50,
4387,
140,
14,
126,
439,
65,
8623,
16,
535... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 unload an assembly from the primary AppDomain
===
I would like to know how to unload an assembly that is loaded into the main appdomain.
I have the following code:
var assembly = Assembly.LoadFrom( FilePathHere );
I need/want to be able to unload this assembly when i am done.
Thanks for your help. | 0 | [
2,
184,
20,
367,
8294,
40,
1475,
37,
14,
1256,
4865,
537,
6232,
800,
3726,
3726,
31,
83,
101,
20,
143,
184,
20,
367,
8294,
40,
1475,
30,
25,
8572,
77,
14,
407,
4865,
537,
6232,
9,
31,
57,
14,
249,
1797,
45,
4033,
1475,
800,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Rhino Mocks: Re-assign a new result for a method on a stub
===
I know I can do this:
ISomething s = MockRepository.GenerateStub<ISomething>();
s.Something = "ABC";
DoStuff(s);
s.Something = "XYZ";
DoStuff(s);
How do I do the same thing if instead of **ISomething.Something** being a property it is a method **string ISomething.GetSomething()** I had assumed it would be SetupResult.For() but I cannot re-assign a result once I've already assigned it once.
| 0 | [
2,
18642,
10506,
18,
45,
302,
8,
472,
11255,
21,
78,
829,
26,
21,
2109,
27,
21,
21354,
800,
3726,
3726,
31,
143,
31,
92,
107,
48,
45,
31,
9099,
13,
18,
800,
10506,
99,
14882,
14599,
9,
17083,
7759,
38,
4502,
1,
49,
9099,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Image database build in Oracle - Is an e-commerce style interface workable?
===
## Question ##
Can I build a image database/library that has an e-commerce style checkout system and a powerful search in Oracle/Java? Are there existing elements out there I should be aware of? Or, is this better in another dev environment like PHP/MySQL?
## Overview ##
I am working on an image database/library dev team on the UI side of things, but I can't help but feel the team is tracking a bit off course on this one.
Ordinarily, I would look to see this entirely within an open-source, license-free environment like a PHP/MySQL/Apache server environment, however strict IT approvals processes have limited the areas of exploration to Oracle as the DB component with Java then making the likely programming environment.
With that noted, I have never worked with either, and don't know how complicated it would be to put the following features together:
- keyword and metadata based search
- e-commerce style checkout system (no payment methods or infrastructure required)
- gallery groupings of images (edited by a central editor)
- tag cloud generation and search
- component to parse metadata from embedded metadata (in XMP) to the database
- web-based back end for database management, maintenance of controlled keyword lists and administration of content
I've uploaded a pdf of screenshots of the UI I've developed for the web side of things.
[UI Sceenshots][1]
Sorry for the complicated Q, having a hard time with it myself.
[1]: http://www.chlorophylldesign.com/mambo/MMLPreviews%5bscreen%5d.pdf | 0 | [
2,
1961,
6018,
1895,
19,
15759,
13,
8,
25,
40,
13,
62,
8,
26470,
1034,
6573,
170,
579,
60,
800,
3726,
3726,
6926,
5910,
1301,
6926,
5910,
92,
31,
1895,
21,
1961,
6018,
118,
1210,
2559,
622,
30,
63,
40,
13,
62,
8,
26470,
1034,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do you leave historical code commented out in classes that you update?
===
When you need to obsolete a section of code (say either the business rules changed, or the old system has been reworked to use a new framework or something) do you delete it from the file or do you comment it out and then put in the new functionality? If you comment it out, do you leave a note stating why it was removed and what it was originally intended to do?
I ask mainly because I've done a lot of contract work for different places over the years and sometimes it's like excavating a tomb to find the actual code that is still being used. Why comment it out and leave it in the file if source control has a record of what used to be there? If you comment out a method do you also comment out/delete any methods that were exclusively used by that method?
What do you think the best practices for this should be? | 0 | [
2,
107,
42,
767,
1668,
1797,
5973,
70,
19,
2684,
30,
42,
11100,
60,
800,
3726,
3726,
76,
42,
376,
20,
18562,
21,
1050,
16,
1797,
13,
5,
6366,
694,
14,
508,
1761,
1015,
15,
54,
14,
315,
329,
63,
74,
27888,
20,
275,
21,
78,
65... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Installing TFS 2008 Workgroup Edition on Windows Server 2003 with SQL Server 2008
===
I ran into an issue when installing Team Foundation Server 2008 Workgroup Edition. I have a Windows Server 2003 SP2 machine that's practically new. I have installed SQL Server 2008 with almost all of the options. When I run through the TFS installation, it allows me to enter my SQL instance name and then goes through the verification process to ensure I have everything I need. However, I receive an error stating that
> A compatible version of SQL Server is not installed.
I verified and I do have SQL Server 2008 running just fine. It's Standard edition and does have Full Text, Reporting, and Analysis services installed. The other errors I receive are with Full Text not being installed, running, or enabled.
Any help is appreciated. | 0 | [
2,
25429,
13,
11720,
18,
570,
170,
8024,
1322,
27,
1936,
8128,
973,
29,
4444,
255,
8128,
570,
800,
3726,
3726,
31,
717,
77,
40,
1513,
76,
25429,
173,
1304,
8128,
570,
170,
8024,
1322,
9,
31,
57,
21,
1936,
8128,
973,
3782,
135,
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... |
Progress Reports
===
I'm not talking about the kind you get in college, but rather implementing progress reports on the Job for developers.
My thoughts in organizing a development team is encouraging and, to some extend, requiring regular progress updates were developers would report on what they did in the last hour or few hours and how long tasks took. Below I listed a few of the pros that come to my mind
- Allowing me to go back and see were I might have made a mistake and allow myself a starting point when working to solve a problem that I created.
- Gives teams a good understanding of were they are on the project and regular updates
- For future projects, the ability to go back and see how long a certain task took and create an accurate estimate
- Encouraging a greater amount of communication among a team
What I would not want to see happen is it become a way for breathing down a developers back, and I think it could easily become a distraction if one felt pressured submit updates every hour.
- What are you thoughts?
- Pros and Cons.
- Have you ever experienced this first hand? How did it make you feel? | 0 | [
2,
3455,
2813,
800,
3726,
3726,
31,
22,
79,
52,
1582,
88,
14,
825,
42,
164,
19,
314,
15,
47,
864,
17333,
3455,
2813,
27,
14,
1205,
26,
10168,
9,
51,
3064,
19,
11725,
21,
522,
173,
25,
11764,
17,
15,
20,
109,
7206,
15,
9052,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 TDD Work in a Designer/Implementer Environment?
===
This has been on my mind lately as I can clearly see the benefits of TDD. I can very easily see how tests could drive a good design if the developer has an idea of what the functionality should be. This may be an overly simplistic statement, but from everything that I’ve read, TDD advocates that you have no design beyond your project architecture and framework choices. That being said, I’d have to guess that even the most hardcore TDDers don’t have a completely blank mental design slate when they start working
My question is this: Can TDD be used in an environment where a senior programmer/designer/architect does a class and/or component design and then hands that design off to a junior developer to implement? In this case the tests would not be the primary driver of the design. I suppose the implementing programmer could implement that design using a test first approach. In that case is it still TDD, or is it something that would be better called Test Driven Implementation? Would something like this work in the real world, or do you think you'd end up with the worst parts of TDD and design up front?
| 2 | [
2,
92,
15596,
43,
170,
19,
21,
4742,
118,
8983,
10388,
13679,
2307,
60,
800,
3726,
3726,
48,
63,
74,
27,
51,
594,
10434,
28,
31,
92,
2885,
196,
14,
5800,
16,
15596,
43,
9,
31,
92,
253,
2351,
196,
184,
4894,
110,
1493,
21,
254,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
debug JSP from eclipse
===
Does anyone know of a good tool for debugging JSPs from within Eclipse? I'd like to be able to set and watch breakpoints, step through the Java code/tags, etc within Eclipse while the app is running (under JBoss in my case).
Cheers,
Don
| 0 | [
2,
121,
16254,
487,
3401,
37,
11652,
800,
3726,
3726,
630,
1276,
143,
16,
21,
254,
5607,
26,
121,
16254,
2762,
487,
18,
1919,
37,
363,
11652,
60,
31,
22,
43,
101,
20,
44,
777,
20,
309,
17,
1455,
1442,
3132,
18,
15,
1424,
120,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Zabbix: is it possible to monitor arbitrary string variable?
===
We are using Zabbix for services monitoring.
There are some essential monitoring configured.
I want to have timeline of version strings of my service along with this monitorings. That would give me opportunity to see that upgrading to this version altered overall error-count.
Is it possible? | 0 | [
2,
2236,
3490,
4028,
45,
25,
32,
938,
20,
7626,
17237,
3724,
7612,
60,
800,
3726,
3726,
95,
50,
568,
2236,
3490,
4028,
26,
687,
8984,
9,
80,
50,
109,
5832,
8984,
28895,
9,
31,
259,
20,
57,
18398,
16,
615,
7887,
16,
51,
365,
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... |
Weird Output on SQL REPLACE
===
I am using REPLACE in an SQL view to remove the spaces from a property number. The function is setup like this REPLACE(pin, ' ', ''). On the green-screen the query looked fine. In anything else we get the hex values of the characters in the field. I am sure it is an encoding thing, but how do I fix it?
Here is the statement I used to create the view:
CREATE VIEW RLIC2GIS AS SELECT REPLACE(RCAPIN, ' ', '') AS
RCAPIN13 , RLICNO, RONAME, ROADR1, ROADR2, ROCITY, ROSTAT, ROZIP1,
ROZIP2, RGRID, RRADR1, RRADR2, RANAME, RAADR1, RAADR2, RACITY,
RASTAT, RAZIP1, RAZIP2, REGRES, RPENDI, RBLDGT, ROWNOC, RRCODE,
RROOMS, RUNITS, RTUNIT, RPAID, RAMTPD, RMDYPD, RRFUSE, RNUMCP,
RDATCP, RINSP, RCAUKY, RCAPIN, RAMTYR, RYREXP, RDELET, RVARIA,
RMDYIN, RDTLKI, ROPHN1, ROPHN2, ROCOM1, ROCOM2, RAPHN1, RAPHN2,
RACOM1, RACOM2, RNOTES FROM RLIC2 | 0 | [
2,
5455,
5196,
27,
4444,
255,
3934,
800,
3726,
3726,
31,
589,
568,
3934,
19,
40,
4444,
255,
1418,
20,
4681,
14,
7644,
37,
21,
1354,
234,
9,
14,
1990,
25,
18161,
101,
48,
3934,
5,
3489,
15,
13,
22,
13,
22,
15,
13,
7,
6,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's Your Favourite IRB Trick?
===
What's your favourite IRB tip or trick? It could be a handy shortcut within the IRB console itself or maybe a .irbrc customization.
I really like that you can type an underscore to retrieve the result of the last expression. | 4 | [
2,
98,
22,
18,
154,
7740,
31,
7549,
5514,
60,
800,
3726,
3726,
98,
22,
18,
154,
7740,
31,
7549,
4265,
54,
5514,
60,
32,
110,
44,
21,
20277,
502,
4118,
363,
14,
31,
7549,
8650,
1145,
54,
913,
21,
13,
9,
1523,
5145,
150,
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... |
Passing apache2 digest authentication information to a wsgi script run by mod_wsgi
===
I've got the directive
<VirtualHost *>
<Location />
AuthType Digest
AuthName "global"
AuthDigestDomain /
AuthUserFile /root/apache_users
<Limit GET>
Require valid-user
</Limit>
</Location>
WSGIScriptAlias / /some/script.wsgi
WSGIDaemonProcess mywsgi user=someuser group=somegroup processes=2 threads=25
WSGIProcessGroup mywsgi
ServerName some.example.org
</VirtualHost>
I'd like to know in the /some/script.wsgi
def application(environ, start_response):
start_response('200 OK', [
('Content-Type', 'text/plain'),
])
return ['Hello']
What user is logged in.
How do I do that? | 0 | [
2,
2848,
17140,
135,
14779,
27963,
676,
20,
21,
619,
18,
2234,
3884,
485,
34,
7226,
1,
10268,
2234,
800,
3726,
3726,
31,
22,
195,
330,
14,
15626,
13,
1,
8145,
38,
6948,
11694,
1637,
1,
13,
1,
19032,
13,
118,
1,
10343,
96,
4474,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Finding pixels per inch in wxDC
===
In wxWidgets, how can you find the pixels per inch on a wxDC? I'd like to be able to scale things by a real world number like inches. That often makes it easier to use the same code for printing to the screen and the printer. | 0 | [
2,
3007,
18146,
18,
416,
7353,
19,
619,
396,
7201,
800,
3726,
3726,
19,
619,
396,
3976,
43,
3060,
18,
15,
184,
92,
42,
477,
14,
18146,
18,
416,
7353,
27,
21,
619,
396,
7201,
60,
31,
22,
43,
101,
20,
44,
777,
20,
3464,
564,
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... |
C# Compiler Incorrectly Optimizes Code
===
I have a ASP.NET application running on a remote web server and I just started getting this error:
Method not found: 'Void System.Collections.Generic.ICollection`1..ctor()'.
I disassembled the code in the DLL and it seems like the compiler is incorrectly optimizing the code. (Note that Set<T> is a class that implements a set of unique objects. It inherits from IEnumerable<T>.) This line:
Set<int> set = new Set<int>();
Is compiled into this line:
Set<int> set = (Set<int>) new ICollection<CalendarModule>();
The Calendar class is a totally unrelated class!! Has anyone ever noticed .NET incorrectly compiling code like this before? | 0 | [
2,
272,
5910,
21486,
22870,
22864,
18,
1797,
800,
3726,
3726,
31,
57,
21,
28,
306,
9,
2328,
3010,
946,
27,
21,
5388,
2741,
8128,
17,
31,
114,
373,
1017,
48,
7019,
45,
2109,
52,
216,
45,
13,
22,
2625,
1340,
329,
9,
15015,
5757,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 use .NET 3.0 with Visual Studio 2005?
===
My Google-fu is failing me on this question.
I have a coworker who has Visual Studio 2005 on his machine. I have Visual Studio 2008. He wants to open a project I wrote in C# 3.0, and we've gotten that far, but VS2005 barfs on the 3.0 code, like `var`.
He has the 3.0 and 3.5 frameworks installed, as well as the Visual Studio 2005 Extensions for Windows Workflow. What else does he need? Or are we pursuing a lost cause, a wild goose chase spurred by my thinking that I heard this was possible somewhere one time?
Please don't suggest he install VS2008 or the Express edition. That simply isn't possible at this time. :( | 0 | [
2,
184,
20,
275,
13,
9,
2328,
203,
9,
387,
29,
3458,
1120,
812,
60,
800,
3726,
3726,
51,
8144,
8,
4096,
25,
7250,
55,
27,
48,
1301,
9,
31,
57,
21,
326,
22560,
72,
63,
3458,
1120,
812,
27,
33,
1940,
9,
31,
57,
3458,
1120,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I place HTML content above a Flash movie?
===
A site I'm working on has Flash headers (using [swfobject][] to embed them). Now I'm required to code in a bit of HTML that's supposed to overlap the Flash movie.
I've tried setting z-index on the Flash element's container and the (absolutely positioned) div but it keeps "vanishing" behind the Flash movie.
I'm hoping for a CSS solution, but if there's a bit of JS magic that will do the trick, I'm up for it.
[swfobject]: http://code.google.com/p/swfobject/ | 0 | [
2,
184,
107,
31,
209,
13,
15895,
2331,
784,
21,
4433,
1308,
60,
800,
3726,
3726,
21,
689,
31,
22,
79,
638,
27,
63,
4433,
157,
445,
13,
5,
12655,
636,
18,
15263,
23793,
500,
2558,
500,
20,
11911,
69,
105,
6,
9,
130,
31,
22,
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... |
Washed out user interface - is there any way to correct for it?
===
This is an interesting conundrum.
We have a WPF app that has a Vista-like theme using soft pastels, Aero control templates, etc. What we've noticed is that this UI appears incredibly washed out on low quality LCDs. Is there a way to boost color saturation application-wide or are we at the mercy of bad monitors? Can we even tell, programmatically if we're being displayed on a low quality monitor? | 0 | [
2,
8928,
70,
4155,
6573,
13,
8,
25,
80,
186,
161,
20,
4456,
26,
32,
60,
800,
3726,
3726,
48,
25,
40,
4883,
1065,
1020,
17500,
9,
95,
57,
21,
619,
7721,
4865,
30,
63,
21,
13520,
8,
1403,
3184,
568,
1856,
640,
6798,
15,
8914,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Modifying Existing .NET Assembles
===
Is there a way to modify existing .NET assembles without resorting to 3rd party tools? I know that [PostSharp][postsharp] makes this possible but I find it incredibly wasteful that the developler of PostSharp basically had to rewrite the functionality of the whole `System.Reflection` namespace in order to make existing assemblies modifiable.
`System.Reflection.Emit` only allows the creation of new, dynamic assemblies. However, all the builder classes used here inherit from the basic reflection classes (e.g. `TypeBuilder` inherits from `System.Type`). Unfortunately, there doesn't seem to be a way to coerce an existing, dynamically loaded type into a type builder. At least, there's no official, supported way.
So what about unsupported? Does anyone know of backdoors that allow to load existing assemblies or types into such builder classes?
Mind, I am **not** searching for ways to modify the current assembly (this *may* even be an unreasonable request) but just to modify existing assemblies loaded from disc. I fear there's no such thing but I'd like to ask anyway.
In the worst case, one would have to resort to `ildasm.exe` to disassemble the code and then to `ilasm.exe` for reassembly but there's no toolchain (read: IL reader) contained in .NET to work with IL data (or is there?).
[postsharp]: http://www.postsharp.org/ | 0 | [
2,
17579,
68,
3149,
13,
9,
2328,
13,
13736,
18,
800,
3726,
3726,
25,
80,
21,
161,
20,
17579,
3149,
13,
9,
2328,
13,
13736,
18,
366,
4765,
68,
20,
203,
897,
346,
4672,
60,
31,
143,
30,
636,
6962,
23646,
500,
2558,
6962,
23646,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 MS-SQL, how do I INSERT INTO a temp table, and have an IDENTITY field created, without first declaring the temp table?
===
I need to select a bunch of data into a temp table to then do some secondary calculations; To help make it work more efficiently, I would like to have an IDENTITY column on that table. I know I could declare the table first with an identity, then insert the rest of the data into it, but is there a way to do it in 1 step? | 0 | [
2,
19,
4235,
8,
18,
22402,
15,
184,
107,
31,
14692,
77,
21,
13,
9577,
859,
15,
17,
57,
40,
3270,
575,
679,
15,
366,
64,
15594,
14,
13,
9577,
859,
60,
800,
3726,
3726,
31,
376,
20,
5407,
21,
7653,
16,
1054,
77,
21,
13,
9577,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL Server 2005: T-SQL to temporarily disable a trigger
===
Is it possible to disable a trigger for a batch of commands and then enable it when the batch is done?
I'm sure I could drop the trigger and re-add it but I was wondering if there was another way. | 0 | [
2,
4444,
255,
8128,
18228,
13,
38,
8,
18,
22402,
20,
7866,
1460,
579,
21,
7286,
800,
3726,
3726,
25,
32,
938,
20,
1460,
579,
21,
7286,
26,
21,
13064,
16,
14294,
17,
94,
9240,
32,
76,
14,
13064,
25,
677,
60,
31,
22,
79,
562,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
A comprehensive regex for phone number validation
===
I'm trying to put together a comprehensive regex to validate phone numbers. Ideally it would handle international formats, but it must handle US formats, including the following:
- 1-234-567-8901
- 1-234-567-8901 x1234
- 1-234-567-8901 ext1234
- 1 (234) 567-8901
- 1.234.567.8901
- 1/234/567/8901
- 12345678901
I'll answer with my current attempt, but I'm hoping somebody has something better and/or more elegant.
| 0 | [
2,
21,
7041,
7953,
1706,
26,
1132,
234,
27999,
800,
3726,
3726,
31,
22,
79,
749,
20,
442,
429,
21,
7041,
7953,
1706,
20,
7394,
1373,
1132,
2116,
9,
5628,
102,
32,
83,
3053,
294,
13767,
15,
47,
32,
491,
3053,
182,
13767,
15,
215,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WebResource.asd giving 403 error in ASP.Net Post backs using IIS7
===
I installed a ASP.Net website on a Windows 2008 server, which is by default using IIS7. The website seems to work fine, but the post backs on my forms do not work. After a few hours of debugging, I realized that when I manually try to hit the WebResource.axd file in my browser (e.g. I type http://www.domain.com/WebResource.axd in the address bar), I get a HTTP 403 error (Access Denied).
I'm not quite sure where to look next and my Windows 2008 security knowledge is limited. How do I go about giving access to that file? | 0 | [
2,
2741,
99,
12097,
9,
472,
43,
1438,
13,
25821,
7019,
19,
28,
306,
9,
2328,
678,
97,
18,
568,
595,
18,
465,
800,
3726,
3726,
31,
4066,
21,
28,
306,
9,
2328,
2271,
27,
21,
1936,
570,
8128,
15,
56,
25,
34,
12838,
568,
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... |
Access Enum value using EL with JSTL
===
I have an Enum called Status defined as such:
public enum Status{
VALID("valid"),OLD("old");
private final String val;
Status(String val){
this.val = val;
}
public String getStatus(){
return val;
}
I would like to access the value of VALID from a JSTL tag. specifically the test attribute of the WHEN tag. (e.g. _c:when test="${dp.status eq Status.VALID" /_..._/c:when_
I'm not even sure this is possible... so any help would be much appreciated.
THanks
| 0 | [
2,
1381,
1957,
723,
1923,
568,
931,
29,
487,
18,
7786,
800,
3726,
3726,
31,
57,
40,
1957,
723,
227,
1782,
2811,
28,
145,
45,
317,
1957,
723,
1782,
1,
7394,
5,
7,
18506,
43,
7,
6,
15,
1218,
5,
7,
1218,
7,
6,
73,
932,
426,
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 do you build an ASP.NET custom control with a collection property ?
===
I'm looking to do something akin to
<cstm:MyControl runat="server">
<myItem attr="something" />
<myItem attr="something" />
</cstm:MyControl>
What's the bare bones code needed to pull this off?
*Note: Feel free to suggest a better title or description. Even if you don't have edit rights, I'm glad to edit the entry for the sake of the community.* | 0 | [
2,
184,
107,
42,
1895,
40,
28,
306,
9,
2328,
5816,
569,
29,
21,
1206,
1354,
13,
60,
800,
3726,
3726,
31,
22,
79,
699,
20,
107,
301,
21,
1767,
20,
13,
1,
150,
384,
79,
45,
915,
12898,
485,
721,
3726,
7,
10321,
106,
7,
1,
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... |
VSTS Code Coverage bug?
===
Has anyone experienced [this VSTS Code Coverage "bug?][1]" Do you have any suggestions?
[1]: http://tinyurl.com/4pgxee
I am doing code coverage analysis with Visual Studio, which is generally an easy task now with the tools that are included. However, I have an issue that I can't overcome. Let's say I have assemblies A, B, C, and D and have marked them all for coverage analysis. I run the tests and look at the results and find a report that contains A, B, and C - but not D. I investigate and find that no tests actually execute any code in D (let's say it's the asp.net front end and I don't leverage UI testing yet). Because there are no tests for D causing D to be missing from the report the total code coverage percentage and "blocks not covered" are incorrect.
Does anyone know how I can do either of the following?
* Calculate the total "number of blocks" in D so that I can manually adjust the coverage report to be correct?
* Get the Coverage report to automatically show the number of blocks not covered for assemblies that are instrumented for coverage but are not tested at all?
While I do want test coverage to improve I am analyzing coverage reports saved at historic points in time in the code base. Thus I don't want to create a test that simply executes at least 1 block of code in each assembly and the re-calculate test coverage by running the tests. That would be a pretty time consuming work-around to something that seems like a simple problem. | 0 | [
2,
566,
10044,
1797,
5245,
6256,
60,
800,
3726,
3726,
63,
1276,
3882,
636,
1565,
566,
10044,
1797,
5245,
13,
7,
16254,
60,
500,
2558,
165,
500,
7,
107,
42,
57,
186,
18389,
60,
636,
165,
500,
45,
7775,
6903,
2864,
4703,
6362,
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... |
IIS site on UNC share: is it problematic?
===
I am working with a legacy ASP Classic solution which is load balanced (via external hardware and has an IIS site the home directory of which is an UNC path. I've been told that the following issues with this setup currently exist:
1. When using an UNC path as home directory, there is an "index" somewhere in IIS which "caches" up to a certain amount of files of certain types, and when the limit, which defaults to 50, has been reached, subsequent requests to pages not in the cache will return 404.
2. When using an UNC path as home directory, when starting the IIS site, the aforementioned "cache" will start filling, which will bog down the site IIS until the cache is filled, meaning that huge sites (15,000 .asp files) are unavailable for up to 30 minutes after the IIS site starts.
3. When using an UNC path as home directory, if more than a certain number of simultaneous requests are made to the site, Windows will reach the "Network BIOS command limit per server", and all requests above the limit will have to wait until IIS "closes the session" to the server. I am told the limit is 100 files and not configurable.
Now, all this sounds a bit weird. If I set up a new Windows 2003 server with default settings, and use it to host an ASP Classic application with 15,000 .asp files, using a share on a server as the home directory for the IIS site, **will I actually run into these problems? And if so, is there a way to counter them without changing the architecture?**
(To clarify, the only reason the "load balancing" is important is that load balancing is the reason the files are on a share on a server. If no load balancing was needed, the files could be on the local disk.) | 0 | [
2,
595,
18,
689,
27,
16061,
1891,
45,
25,
32,
21070,
60,
800,
3726,
3726,
31,
589,
638,
29,
21,
7780,
28,
306,
2732,
4295,
56,
25,
6305,
13966,
13,
5,
5034,
4886,
7610,
17,
63,
40,
595,
18,
689,
14,
213,
16755,
16,
56,
25,
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... |
Any way to do Visual Studio "project only" build from command line?
===
devenv mysolution.sln /build "Release|Win32" /project myproject
When building from the command line, it seems I have the option of doing a <code>/build</code> or <code>/rebuild</code>, but no way of saying I want to do "project only" (i.e. not build or rebuild the specified project's dependencies as well). Does anyone know of a way? | 0 | [
2,
186,
161,
20,
107,
3458,
1120,
13,
7,
21011,
104,
7,
1895,
37,
1202,
293,
60,
800,
3726,
3726,
121,
3124,
710,
51,
18,
18687,
3309,
9,
18,
16600,
13,
118,
29361,
13,
7,
15202,
1,
4181,
3125,
7,
13,
118,
21011,
51,
21011,
76... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does versioning work with Flex remote objects and AMF?
===
Suppose I use the [Remote Object] tag to endow a custom Flex class with serialization intelligence.
What happens when I need to change my object (add a new field, remove a field, rename a field, etc)?
Is there a design pattern for handling this in an elegant way? | 0 | [
2,
184,
630,
615,
68,
170,
29,
14409,
5388,
3916,
17,
21,
13235,
60,
800,
3726,
3726,
5787,
31,
275,
14,
636,
99,
20209,
3095,
500,
3383,
20,
241,
3581,
21,
5816,
14409,
718,
29,
5956,
1829,
2872,
9,
98,
5531,
76,
31,
376,
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... |
Extending MSSQL full-text index to search through foriegn keys
===
I know that a MSSQL full text index can not index more than one table. But, I have relationships in tables that I would like to implement full text indexes on.
Take the 3 tables below...
Vehicle
Veh_ID - int (Primary Key)
FK_Atr_VehicleColor - int
Veh_Make - nvarchar(20)
Veh_Model - nvarchar(50)
Veh_LicensePlate - nvarchar(10)
Attributes
Atr_ID - int (Primary Key)
FK_Aty_ID - int
Atr_Name - nvarchar(50)
AttributeTypes
Aty_ID - int (Primary key)
Aty_Name - nvarchar(50)
The Attributes and AttributeTypes tables hold values that can be used in drop down lists throughout the application being built. For example, Attribute Type of "Vehicle Color" with Attributes of "Black", "Blue", "Red", etc...
Ok, so the problem comes when a user is trying to search for a "Blue Ford Mustang". So what is the best solution considering that tables like Vehicle will get rather large?
Do I create another field in the "Vehicle" table that is "Veh Color" that holds the text value of what is selected in the drop down in addition to "FK Atr VehicleColor"?
Or, do I drop "FK Atr VehicleColor" altogether and add "Veh Color"? I can use text value of "Veh Color" to match against "Atr Name" when the drop down is populated in an update form. With this approach I will have to handle if Attributes are dropped from the database.
-- Note: could not use underscore outside of code view as everything between two underscores is _italicized_. | 0 | [
2,
8176,
4235,
18,
22402,
503,
8,
11969,
4348,
20,
2122,
120,
26,
660,
9776,
5534,
800,
3726,
3726,
31,
143,
30,
21,
4235,
18,
22402,
503,
1854,
4348,
92,
52,
4348,
91,
119,
53,
859,
9,
47,
15,
31,
57,
5833,
19,
7484,
30,
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 share a variable or object between two or more Servlets?
===
I would like to know if there is some way to share a variable or an object between two or more Servlets, I mean some "standard" way. I suppose that this is not a good practice but is a easier way to build a prototype.
I don't know if it depends on the technologies used, but I'll use Tomcat 5.5
Thanks.
| 0 | [
2,
184,
92,
31,
1891,
21,
7612,
54,
3095,
128,
81,
54,
91,
13,
10321,
11045,
60,
800,
3726,
3726,
31,
83,
101,
20,
143,
100,
80,
25,
109,
161,
20,
1891,
21,
7612,
54,
40,
3095,
128,
81,
54,
91,
13,
10321,
11045,
15,
31,
884,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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: How to wait for a BackgroundWorker to complete?
===
Consider a *hypothetical* method of an object th does stuff for you:
public class DoesStuff
{
BackgroundWorker _worker = new BackgroundWorker();
...
public void CancelDoingStuff()
{
_worker.CancelAsync();
//todo: Figure out a way to wait for it to be cancelled
}
}
How can one wait for a BackgroundWorker to be done? In the past people have tried:
while (!_worker.IsDone)
{
Sleep(100);
}
But [this is a deadlock][1], since the IsBusy is not cleared until after the RunWorkerCompleted event is handled, and that event won't get handled until the application goes idle. (Plus, it's a busy loop - and how disgusting is that)
Others have add suggested kludging it into:
while (!_worker.IsDone)
{
Application.DoEvents();
}
Problem with that is that is `Application.DoEvents()` causes messages currently in the queue to be processed, which cause reentrantcy problems.
i would hope to use some solution involving Event synchronization objects, where the code waits for an event that the worker's RunWorkerCompleted event handlers sets, something like:
Event _workerDoneEvent = new WaitHandle();
public void CancelDoingStuff()
{
_worker.CancelAsync();
_workerDoneEvent.WaitOne();
}
private void RunWorkerCompletedEventHandler(sender object, RunWorkerCompletedEventArgs e)
{
_workerDoneEvent.SetEvent();
}
But i'm back to the deadlock: the event handler can't run until the application goes idle, and the application won't go idle because it's waiting for an Event.
So how can you wait for an BackgroundWorker to finish?
[1]: http://forums.microsoft.com/MSDN/ShowPost.aspx?PostID=1819196&SiteID=1
| 0 | [
2,
13,
9,
2328,
45,
184,
20,
1760,
26,
21,
2395,
22560,
20,
1279,
60,
800,
3726,
3726,
3563,
21,
1637,
5608,
1638,
124,
18142,
2483,
2109,
16,
40,
3095,
13,
96,
630,
3217,
26,
42,
45,
317,
718,
630,
384,
5386,
13,
1,
2395,
225... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does OpenID work?
===
I realize this question is somewhat of a [duplicate][1], and yes, I have read [the spec][2] and the [wikipedia article][3].
After reading the materials mentioned above, I still don't have a complete picture in my head of how each step in the process is handled. Maybe what's missing is a good workflow diagram for how an implementation of OpenID works.
I'm considering incorporating OpenID into one of my applications to accomodate a B2B single-sign-on scenario, and I will probably go with DotNetOpenID instead of trying to implement it myself, but I still want a better grasp of the particulars before I get started.
[1]: http://stackoverflow.com/questions/69076/openid-login-workflow
[2]: http://openid.net/specs/openid-authentication-2_0.html
[3]: http://en.wikipedia.org/wiki/OpenID | 0 | [
2,
184,
630,
368,
1340,
170,
60,
800,
3726,
3726,
31,
4007,
48,
1301,
25,
4131,
16,
21,
636,
2323,
26811,
500,
2558,
165,
500,
15,
17,
1643,
15,
31,
57,
1302,
636,
124,
12737,
500,
2558,
135,
500,
17,
14,
636,
17375,
26132,
2002... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Exporting tab-delimited files in SSRS 2005
===
In this MSDN article, MS explains how to specify other delimiters besides commas for csv-type exports from SSRS 2005:
http://msdn.microsoft.com/en-us/library/ms155365(SQL.90).aspx
...however, literal tab characters are stripped by the config file parser, and it doesn't appear that MS has provided a workaround. This entry on Microsoft Connect seems to confirm this:
http://connect.microsoft.com/SQLServer/feedback/ViewFeedback.aspx?FeedbackID=357527
...has anyone developed a way to export tab-delimited files from SSRS 2005? Or perhaps developed an open-source custom renderer to get the job done?
Note: I've heard of manually appending &rc:FieldDelimiter=%09 via URL access, but that's not an acceptable workaround for my users and doesn't appear to work anyways. | 0 | [
2,
7487,
68,
6523,
8,
546,
23012,
6488,
19,
22118,
18,
812,
800,
3726,
3726,
19,
48,
4235,
43,
103,
2002,
15,
4235,
7346,
184,
20,
19077,
89,
121,
20565,
445,
3410,
11951,
472,
26,
272,
18,
710,
8,
4474,
16716,
37,
22118,
18,
18... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should I be more concerned with coupling between packages or between units of distribution?
===
I have been looking at metrics for [coupling][1] and also look at [DSM][2].
One of the tools I've been using looks at coupling between 'modules' with a module being a unit of distribution (in this case a .net assembly).
I feel that I should be more interested in looking at coupling between packages (or namespaces) than with units of distribution.
Should I be more concerned with coupling between packages/namespaces (ensure that abstractions only depend on abstractions, concrete types depend on abstractions and their are no cycles in the dependencies so that refactoring and extending is easy) or should I be concerned with whether I can deploy new versions without needing to update unchanged units of distribution?
What does anyone else measure?
For what it's worth, my guy feel is that if I focus on the package/namespace coupling then the unit of distribution coupling will come for free or at least be easier.
[1]: http://www.ibm.com/developerworks/java/library/j-cq04256/
[2]: http://en.wikipedia.org/wiki/Dependency_Structure_Matrix | 0 | [
2,
378,
31,
44,
91,
3518,
29,
20920,
128,
16875,
54,
128,
1398,
16,
2523,
60,
800,
3726,
3726,
31,
57,
74,
699,
35,
11544,
18,
26,
636,
17856,
802,
500,
2558,
165,
500,
17,
67,
361,
35,
636,
43,
18,
79,
500,
2558,
135,
500,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can a modeless VB6 application do cleanup when the application is shuting down?
===
A VB6 application is using the Interop Forms Toolkit to work with forms written in .NET. The documentation for the toolkit advises calling a method on the toolkit to advise the toolkit when the VB6 application is shutting down.
The VB6 application uses a Sub Main procedure that loads a splash screen, then displays several modeless forms. When Sub Main completes, the application is still running. How can the application detect that it is shutting down and call the cleanup method on the Toolkit? | 0 | [
2,
184,
92,
21,
3740,
923,
13,
20468,
379,
3010,
107,
26862,
76,
14,
3010,
25,
2218,
68,
125,
60,
800,
3726,
3726,
21,
13,
20468,
379,
3010,
25,
568,
14,
1480,
2594,
1997,
5607,
13703,
20,
170,
29,
1997,
642,
19,
13,
9,
2328,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What CLR/.NET bytecode tools exist?
===
I'm well aware of Java tools for manipulating, generating, decompiling JVM bytecode (ASM, cglib, jad, etc). What similar tools exist for the CLR bytecode? Do people do bytecode manipulation for the CLR? | 0 | [
2,
98,
10842,
139,
118,
9,
2328,
34,
591,
9375,
4672,
3182,
60,
800,
3726,
3726,
31,
22,
79,
134,
3854,
16,
8247,
4672,
26,
27799,
15,
13500,
15,
121,
11103,
49,
802,
487,
20147,
34,
591,
9375,
13,
5,
472,
79,
15,
13,
15123,
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... |
Use continue or Checked Exceptions when checking and processing objects
===
I'm processing, let's say a list of "Document" objects. Before I record the processing of the document successful I first want to check a couple of things. Let's say, the file referring to the document should be present and something in the document should be present. Just two simple checks for the example but think about 8 more checks before I have successfully processed my document.
What would have your preference?
for (Document document : List<Document> documents) {
if (!fileIsPresent(document)) {
doSomethingWithThisResult("File is not present");
continue;
}
if (!isSomethingInTheDocumentPresent(document)) {
doSomethingWithThisResult("Something is not in the document");
continue;
}
doSomethingWithTheSucces();
}
Or
for (Document document : List<Document> documents) {
try {
fileIsPresent(document);
isSomethingInTheDocumentPresent(document);
doSomethingWithTheSucces();
} catch (ProcessingException e) {
doSomethingWithTheExceptionalCase(e.getMessage());
}
}
public boolean fileIsPresent(Document document) throws ProcessingException {
... throw new ProcessingException("File is not present");
}
public boolean isSomethingInTheDocumentPresent(Document document) throws ProcessingException {
... throw new ProcessingException("Something is not in the document");
}
What is more readable. What is best? Is there even a better approach of doing this (maybe using a design pattern of some sort)?
As far as readability goes my preference currently is the Exception variant...
What is yours? | 0 | [
2,
275,
1816,
54,
6505,
13392,
76,
9886,
17,
5511,
3916,
800,
3726,
3726,
31,
22,
79,
5511,
15,
408,
22,
18,
395,
21,
968,
16,
13,
7,
28132,
7,
3916,
9,
115,
31,
571,
14,
5511,
16,
14,
4492,
1300,
31,
64,
259,
20,
2631,
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... |
Elide Text
===
I've got a Label with a user-selected directory path. Of course some paths are longer than others. I'm using a [Resizer]<http://kentb.blogspot.com/2007/04/resizer-wpf-control.html> on the control the Label lives in, and would love it if I could have variable eliding of the path.
_c:\very\long\path\to\a\filename.txt_ collapsing to _c:\...\filename.txt_ or _c:\very\...\filename.txt._ You get the picture. I'd love it if I didn't have to have a custom control, but I can live with it.
<http://stackoverflow.com/questions/108689/custom-text-wrapping-in-wpf> seems like it might do the job, but I'm hoping for something simpler. | 0 | [
2,
931,
3448,
1854,
800,
3726,
3726,
31,
22,
195,
330,
21,
1899,
29,
21,
4155,
8,
18,
7138,
16755,
2013,
9,
16,
674,
109,
12074,
50,
1045,
119,
654,
9,
31,
22,
79,
568,
21,
636,
99,
18,
11907,
500,
1,
21127,
6903,
2853,
11872,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Php Check If a Static Class is Declared
===
How can i check to see if a static class has been declared?
ex
Given the class
class bob {
function yippie() {
echo "skippie";
}
}
later in code how do i check:
if(is_a_valid_static_object(bob)) {
bob::yippie();
}
so i don't get:
Fatal error: Class 'bob' not found in file.php on line 3
| 0 | [
2,
13,
26120,
2631,
100,
21,
12038,
718,
25,
2482,
800,
3726,
3726,
184,
92,
31,
2631,
20,
196,
100,
21,
12038,
718,
63,
74,
2482,
60,
1396,
504,
14,
718,
718,
1909,
13,
1,
1990,
7679,
20212,
62,
5,
6,
13,
1,
8117,
13,
7,
24... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
401 response code for json requests with ASP.NET MVC
===
How to disable standard ASP.NET handling of 401 response code (redirecting to login page) for AJAX/JSON requests?
For web-pages it's okay, but for AJAX I need to get right 401 error code instead of good looking 302/200 for login page. | 0 | [
2,
13,
20658,
1627,
1797,
26,
487,
528,
12279,
29,
28,
306,
9,
2328,
307,
8990,
800,
3726,
3726,
184,
20,
1460,
579,
1236,
28,
306,
9,
2328,
7988,
16,
13,
20658,
1627,
1797,
13,
5,
99,
14706,
68,
20,
6738,
108,
2478,
6,
26,
20... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I remove code duplication between similar const and non-const member functions?
===
Let's say I have the following class X where I want to return access to an internal member:
class X
{
int z;
public:
int& Z()
{
return z;
}
const int& Z() const
{
// identical to non-const X::Z()
return z;
}
};
The two member functions 'X::Z()' and 'X::Z() const' have identical code inside the braces. This is duplicate code and can cause maintainance problems -- especially for long functions.
Is there a way to avoid this code duplication?
| 0 | [
2,
184,
107,
31,
4681,
1797,
1052,
20669,
128,
835,
11608,
38,
17,
538,
8,
12124,
38,
322,
3719,
60,
800,
3726,
3726,
408,
22,
18,
395,
31,
57,
14,
249,
718,
993,
113,
31,
259,
20,
788,
1381,
20,
40,
3117,
322,
45,
718,
993,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you manage web developers remotely?
===
I'm the leader of a small web development team, and I have a feeling that we will have a couple telecommuters joining the team pretty soon (either new employees, or existing employees that will begin telecommuting). Any idea how to effectively manage and collaborate with developers working remotely?
Most of the work we do is client-driven. We're doing agile development (or our version of it, anyway), but since it's mostly client work, we can't really assign a feature to a developer and set them lose for a week or two like we might be able to with a desktop app or something like that. The biggest problem we have when people occasionally work from home is collaborating - it's tough to work together without the benefit of a whiteboard and hand-waving.
It seems like software development is perfect for telecommuting, but I haven't been able to find many good resources about the practical aspects of working remotely within a development team. Has anyone else had any experience with this? | 0 | [
2,
184,
107,
42,
4705,
2741,
10168,
23288,
60,
800,
3726,
3726,
31,
22,
79,
14,
1156,
16,
21,
284,
2741,
522,
173,
15,
17,
31,
57,
21,
1249,
30,
95,
129,
57,
21,
1335,
18712,
7903,
445,
3765,
14,
173,
1772,
651,
13,
5,
18840,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 OOP & completely avoiding implementation inheritance possible?
===
I will choose Java as an example, most people know it, though every other OO language was working as well.
Java, like many other languages, has interface inheritance and implementation inheritance. E.g. a Java class can inherit from another one and every method that has an implementation there (assuming the parent is not abstract) is inherited, too. That means the interface is inherited and the implementation for this method as well. I can overwrite it, but I don't have to. If I don't overwrite it, I have inherited the implementation.
However, my class can also "inherit" (not in Java terms) just an interface, without implementation. Actually interfaces are really named that way in Java, they provide interface inheritance, but without inheriting any implementation, since all methods of an interface have no implementation.
Now there was this [article, saying it's better to inherit interfaces than implementations][1], you may like to read it (at least the first half of the first page), it's pretty interesting. It avoids issues like the [fragile base class problem][2]. So far this makes all a lot of sense and many other things said in the article make a lot of sense to me.
What bugs me about this, is that implementation inheritance means **code reuse**, one of the most important properties of OO languages. Now if Java had no classes (like James Gosling, the godfather of Java has wished according to this article), it solves all problems of implementation inheritance, but how would you make code reuse possible then?
E.g. if I have a class Car and Car has a method move(), which makes the Car move. Now I can sub-class Car for different type of cars, that are all cars, but are all specialized versions of Car. Some may move in a different way, these need to overwrite move() anyway, but most would simply keep the inherited move, as they move alike just like the abstract parent Car. Now assume for a second that there are only interfaces in Java, only interfaces may inherit from each other, a class may implement interfaces, but all classes are always final, so no class can inherit from any other class.
How would you avoid that when you have an Interface Car and hundred Car classes, that you need to implement an identical move() method for each of them? What concepts for code reuse other than implementation inheritance exist in the the OO world?
Some languages have Mixins. Are Mixins the answer to my question? I read about them, but I cannot really imagine how Mixins would work in a Java world and if they can really solve the problem here.
Another idea was that there is a class that only implements the Car interface, let's call it AbstractCar, and implements the move() method. Now other cars implement the Car interface as well, internally they create an instance of AbstractCar and they implement their own move() method by calling move() on their internal abstract Car. But wouldn't this be wasting resources for nothing (a method calling just another method - okay, JIT could inline the code, but still) and using extra memory for keeping internal objects, you wouldn't even need with implementation inheritance? (after all every object needs more memory than just the sum of the encapsulated data) Also isn't it awkward for a programmer to write dummy methods like
public void move() {
abstractCarObject.move();
}
?
Anyone can imagine a better idea how to avoid implementation inheritance and still be able to re-use code in an easy fashion?
[1]: http://www.javaworld.com/javaworld/jw-08-2003/jw-0801-toolbox.html
[2]: http://en.wikipedia.org/wiki/Fragile_base_class | 0 | [
2,
25,
13,
21709,
279,
1524,
10298,
6123,
13852,
938,
60,
800,
3726,
3726,
31,
129,
3538,
8247,
28,
40,
823,
15,
127,
148,
143,
32,
15,
362,
352,
89,
13,
4328,
816,
23,
638,
28,
134,
9,
8247,
15,
101,
151,
89,
2556,
15,
63,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Parent.FindControl() not working?
===
I have a page that has an iframe
From one of the pages within the iframe I want to look back and make a panel on the default page invisible because it is overshadowing a popup
I tried using Parent.FindControl but it does not seem to be working. I am positive I have the right id in the findcontrol because I used Firebug to inspect the panel and I copied the id from there
Does anyone know what I am missing? | 0 | [
2,
4766,
9,
19811,
12898,
5,
6,
52,
638,
60,
800,
3726,
3726,
31,
57,
21,
2478,
30,
63,
40,
31,
8361,
37,
53,
16,
14,
4434,
363,
14,
31,
8361,
31,
259,
20,
361,
97,
17,
233,
21,
4113,
27,
14,
12838,
2478,
8874,
185,
32,
25... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Logging ALL Queries on a SQL Server 2008 Express Database?
===
noob question, but: Is there a way to tell SQL Server 2008 Express to log every query (including each and every SELECT Query!) into a file?
It's a Development machine, so the negative side effects of logging Select-Queries are not an issue.
Before someone suggests using the SQL Profiler: This is not available in Express (does anyone know if it's available in the Web Edition?) and i'm looking for a way to log queries even when I am away. | 0 | [
2,
13,
13919,
65,
9386,
2829,
27,
21,
4444,
255,
8128,
570,
2999,
6018,
60,
800,
3726,
3726,
90,
4995,
1301,
15,
47,
45,
25,
80,
21,
161,
20,
494,
4444,
255,
8128,
570,
2999,
20,
6738,
352,
25597,
13,
5,
3970,
206,
17,
352,
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... |
Design question: How would you design a messaging/inbox system?
===
Many websites have the concept of sending messages from user to user. When you send a message to another user, the message would show up in their inbox. You could respond to the message, and it would show up as a new entry in that message thread.
How would you design the classes (or tables or whatever) to support such a system? | 0 | [
2,
704,
1301,
45,
184,
83,
42,
704,
21,
26437,
118,
108,
5309,
329,
60,
800,
3726,
3726,
151,
13931,
57,
14,
2420,
16,
4907,
7561,
37,
4155,
20,
4155,
9,
76,
42,
2660,
21,
2802,
20,
226,
4155,
15,
14,
2802,
83,
298,
71,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to make my core run on multiple core?
===
I have build an application in C# that I would like to be optimized for multiple core. I have some thread, what should I do more? | 0 | [
2,
184,
20,
233,
51,
2884,
485,
27,
1886,
2884,
60,
800,
3726,
3726,
31,
57,
1895,
40,
3010,
19,
272,
5910,
30,
31,
83,
101,
20,
44,
22864,
43,
26,
1886,
2884,
9,
31,
57,
109,
9322,
15,
98,
378,
31,
107,
91,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Design question: How would you design a recurring event system?
===
If you were tasked to build an event scheduling system that supported recurring events, how would you do it?
i.e. When creating an event, you could pick "repeating daily" (or weekly, yearly, etc).
One design per response please.
I was asked this at an interview, and couldn't come up with a really good response that I liked. | 0 | [
2,
704,
1301,
45,
184,
83,
42,
704,
21,
11344,
807,
329,
60,
800,
3726,
3726,
100,
42,
46,
14605,
20,
1895,
40,
807,
23096,
329,
30,
1827,
11344,
963,
15,
184,
83,
42,
107,
32,
60,
31,
9,
62,
9,
76,
2936,
40,
807,
15,
42,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Setting placeholder properties from the controller?
===
I have an if/else statement in the controller and 2 different types of views to display depending on the outcome.
So I have my 2 views in a .aspx page with a placeholder around each.
How do I set the property placeholder.Visible from the controller? Or by the theory of MVC should I even be doing that sort of presentation in the controller? It sounds like I would be blurring the seperation of front-end output. | 0 | [
2,
2697,
209,
12427,
3704,
37,
14,
9919,
60,
800,
3726,
3726,
31,
57,
40,
100,
118,
6798,
62,
3331,
19,
14,
9919,
17,
172,
421,
2551,
16,
4146,
20,
3042,
4758,
27,
14,
9774,
9,
86,
31,
57,
51,
172,
4146,
19,
21,
13,
9,
472,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Visual Studio Freezing/TFS Window Might be off screen
===
I am using Visual Studio 2005 with Team Foundation Server.
When I right click a file under the source control and choose "compare" VS appears to freeze until I hit escape. My guess is that the window that is supposed to be popping up is somewhere I can't get to. I tried minimizing all the windows that I can and it is nowhere to be found. | 0 | [
2,
3458,
1120,
14278,
118,
11720,
18,
1463,
530,
44,
168,
2324,
800,
3726,
3726,
31,
589,
568,
3458,
1120,
812,
29,
173,
1304,
8128,
9,
76,
31,
193,
10840,
21,
3893,
131,
14,
1267,
569,
17,
3538,
13,
7,
18415,
99,
7,
4611,
1780,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Easy Flash Tools
===
Can anyone recommend a tool that makes generating Flash programs easy to use? I've played with a handful of tools but I've never found anything particularly easy to use. I'm looking for something that has the ease of MS PowerPoint.
Thanks. | 0 | [
2,
2010,
4433,
4672,
800,
3726,
3726,
92,
1276,
12360,
21,
5607,
30,
1364,
13500,
4433,
1726,
2010,
20,
275,
60,
31,
22,
195,
257,
29,
21,
8893,
16,
4672,
47,
31,
22,
195,
243,
216,
602,
1653,
2010,
20,
275,
9,
31,
22,
79,
699... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Blank Page in JSF
===
If my code throws an exception, sometimes - not everytime - the jsf presents a blank page. I´m using facelets for layout.
A similar error were reported at this [Sun forumn´s post][1], but without answers.
Anyone else with the same problem, or have a solution?
;)
[1]: http://forums.sun.com/thread.jspa?messageID=10237827 | 0 | [
2,
6463,
2478,
19,
487,
18,
410,
800,
3726,
3726,
100,
51,
1797,
13566,
40,
5391,
15,
1030,
13,
8,
52,
352,
891,
13,
8,
14,
487,
18,
410,
7992,
21,
6463,
2478,
9,
31,
307,
568,
276,
11045,
26,
9106,
9,
21,
835,
7019,
46,
111... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 JMS implementation do you use?
===
We are using [ActiveMQ][1] as our implementation of choice and we picked it a while ago. It performs well enough for our use right now. Since its been a while, I was wondering what other Java Message Service implementations are in use and why? Surely there are more than a few.
[1]: http://activemq.apache.org/ | 4 | [
2,
56,
487,
79,
18,
6123,
107,
42,
275,
60,
800,
3726,
3726,
95,
50,
568,
636,
7889,
79,
1251,
500,
2558,
165,
500,
28,
318,
6123,
16,
1837,
17,
95,
2114,
32,
21,
133,
1464,
9,
32,
11563,
134,
511,
26,
318,
275,
193,
130,
9,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using mercurial's mq for managing local changes
===
I have a local mercurial repository with some site-specific changes in it. What I would like to do is set a couple files to be un-commitable so that they aren't automatically committed when I do an `hg commit` with no arguments.
Right now, I'm doing complicated things with `mq` and guards to achieve this, pushing and popping and selecting guards to prevent my changes (which are checked into an mq patch) from getting committed.
Is there an easier way to do this? I'm sick of reading the help for all the `mq` commands every time I want to commit a change that doesn't include my site-specific changes.
| 0 | [
2,
568,
9046,
3594,
192,
22,
18,
307,
1251,
26,
5616,
375,
1693,
800,
3726,
3726,
31,
57,
21,
375,
9046,
3594,
192,
24869,
29,
109,
689,
8,
9219,
1693,
19,
32,
9,
98,
31,
83,
101,
20,
107,
25,
309,
21,
1335,
6488,
20,
44,
36... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 much process should a single developer follow? Is a formal process too much?
===
Since I didn't do a good job writing the last question, and most of the answers were good, but not at all in the direction I intended for the question to go in, I deleted it and remade it as this question.
I'm a solo developer on my own projects, generally very small things, but I have a few ideas that might turn into FOSS projects. I believe in documentation (to varying degrees, depending on the specific project and the end user), source control, and project management (including bug tracking, time management, and so on). However, I'm not sure how much of a [formal process][1] I should be following.
Perhaps just keeping a README, associated design/requirements documents, and in-code comments under source control is sufficient. Or maybe there's an agile process that is suitable for a single developer to follow. Or maybe I should take an old-school waterfall model for each project.
What kinds of processes exist for or can be adopted to a solo developer, if I even need a formal process?
[1]: http://en.wikipedia.org/wiki/Software_development_process | 0 | [
2,
184,
212,
953,
378,
21,
345,
10058,
1740,
60,
25,
21,
3337,
953,
266,
212,
60,
800,
3726,
3726,
179,
31,
223,
22,
38,
107,
21,
254,
1205,
1174,
14,
236,
1301,
15,
17,
127,
16,
14,
6709,
46,
254,
15,
47,
52,
35,
65,
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... |
Get the resolution of a jpeg image using C# and the .NET Environment?
===
Our clients will be uploading images to be printed on their documents and we have been asked to come up with a way to get the resolution of the image in order to warn them if the image has too low of a resolution and will look pixalated in the end-product
If it comes to it we could also go with the dimensions if anyone knows how to get those but the resolution would be preferred
Thank you | 0 | [
2,
164,
14,
4302,
16,
21,
487,
20427,
1961,
568,
272,
5910,
17,
14,
13,
9,
2328,
2307,
60,
800,
3726,
3726,
318,
7421,
129,
44,
71,
16866,
3502,
20,
44,
5317,
27,
66,
4374,
17,
95,
57,
74,
411,
20,
340,
71,
29,
21,
161,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there an alternative to SVCUTIL.EXE for generating WCF Web service proxies?
===
Am I missing something or is there truly no alternative (yet, I hope) to SVCUTIL.EXE for generating WCF Web service proxies? | 0 | [
2,
25,
80,
40,
2676,
20,
13,
18,
8990,
14255,
9,
1706,
62,
26,
13500,
11801,
410,
2741,
365,
895,
396,
1596,
60,
800,
3726,
3726,
589,
31,
2863,
301,
54,
25,
80,
4574,
90,
2676,
13,
5,
16480,
15,
31,
1376,
6,
20,
13,
18,
899... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0... |
What's the best way to develop against WordPress on Windows when you already have IIS/SQL Server installed?
===
If you want to develop against WordPress (i.e., have a local instance running on your machine so you can develop themes, get blogs and sites laid out, etc.) and you're running Windows on your development machine with IIS and SQL Server already installed, what's the best way to do it?
I found a method online which sets up a little "mini" server on Windows running instances of Apache and MySQL but they didn't advise using it on a machine with IIS already installed. Obviously one could install Apache and MySQL and do it that way but given what Windows affords you (i.e., methods of running PHP in IIS - I think Windows Server 2008 is even optimized for this), is that the best way? Are there ways to run WordPress with SQL Server as the backend? (I wouldn't think so but I thought I'd throw that out there).
And are there methods differing on the version of Windows (i.e., XP, Vista, Vista64) | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
2803,
149,
833,
5890,
27,
1936,
76,
42,
614,
57,
595,
18,
118,
18,
22402,
8128,
4066,
60,
800,
3726,
3726,
100,
42,
259,
20,
2803,
149,
833,
5890,
13,
5,
49,
9,
62,
9,
15,
57,
21,
375,
4851... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Delaying an exception
===
I have a method that periodically (e.g. once in every 10 secs) try to connect to a server and read some data from it. The server might not be available all the time. If the server is not available the method throws an exception.
What would be the best way to implement a wrapper method that doesn't throw an exception except if the server wasn't available for at least one minute? | 0 | [
2,
7255,
68,
40,
5391,
800,
3726,
3726,
31,
57,
21,
2109,
30,
19886,
13,
5,
62,
9,
263,
9,
382,
19,
352,
332,
9265,
18,
6,
1131,
20,
6379,
20,
21,
8128,
17,
1302,
109,
1054,
37,
32,
9,
14,
8128,
530,
52,
44,
904,
65,
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... |
Where can I find good Domain Driven Design resources?
===
What are the best places to find out everything there is to know about Domain-Driven Design, from beginner to advanced.
- Books
- Websites
- Mailing lists
- User groups
- Conferences
- etc | 0 | [
2,
113,
92,
31,
477,
254,
4603,
5355,
704,
2566,
60,
800,
3726,
3726,
98,
50,
14,
246,
1489,
20,
477,
70,
796,
80,
25,
20,
143,
88,
4603,
8,
14489,
704,
15,
37,
26931,
20,
2255,
9,
13,
8,
964,
13,
8,
13931,
13,
8,
4216,
68... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... |
Ways to do "related searches" functionality
===
I've seen a few sites that list related searches when you perform a search, namely they suggest other search queries you may be interested in.
I'm wondering the best way to model this in a medium-sized site (not enough traffic to rely on visitor stats to infer relationships). My initial thought is to store the top 10 results for each unique query, then when a new search is performed to find all the historical searches that match some amount of the top 10 results but ideally not matching all of them (matching all of them might suggest an equivalent search and hence not that useful as a suggestion).
I imagine that some people have done this functionality before and may be able to provide some ideas of different ways to do this. I'm not necessarily looking for one winning idea since the solution will no doubt vary substantially depending on the size and nature of the site. | 0 | [
2,
2847,
20,
107,
13,
7,
6203,
19994,
7,
18548,
800,
3726,
3726,
31,
22,
195,
541,
21,
310,
3259,
30,
968,
1597,
19994,
76,
42,
2985,
21,
2122,
15,
8525,
59,
5601,
89,
2122,
9386,
2829,
42,
123,
44,
3158,
19,
9,
31,
22,
79,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I sign a Java applet using a certificate in my Mac keychain?
===
I have a self-signed root certificate with just the code signing extension (no other extensions) in my Mac keychain; I use it to sign all code coming out of ∞labs using Apple's codesign tool and it works great.
I was looking to expand myself a little and doing some Java development. I know Apple provides a KeyStore implementation that reads from the Keychain, and I can list all certificates I have in the 'chain with:
keytool -list -provider com.apple.crypto.provider.Apple -storetype KeychainStore -keystore NONE -v
However, whenever I try to use jarsigner to sign a simple test JAR file, I end up with:
$ jarsigner -keystore NONE -storetype KeychainStore -providerName Apple a.jar infinitelabs_codesigning_2
Enter Passphrase for keystore: <omitted>
jarsigner: Certificate chain not found for: infinitelabs_codesigning_2. infinitelabs_codesigning_2 must reference a valid KeyStore key entry containing a private key and corresponding public key certificate chain.
What am I doing wrong?
(The certificate was created following [Apple's instructions for obtaining a signing identity](http://developer.apple.com/documentation/Security/Conceptual/CodeSigningGuide/Procedures/chapter_3_section_2.html#//apple_ref/doc/uid/TP40005929-CH4-SW1).) | 0 | [
2,
184,
107,
31,
1676,
21,
8247,
4037,
38,
568,
21,
6259,
19,
51,
1572,
1246,
17317,
60,
800,
3726,
3726,
31,
57,
21,
1119,
8,
13472,
5900,
6259,
29,
114,
14,
1797,
5479,
3896,
13,
5,
251,
89,
17529,
6,
19,
51,
1572,
1246,
173... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can one simplify network byte-order conversion from a BinaryReader?
===
System.IO.BinaryReader reads values in a little-endian format.
I have a C# application connecting to a proprietary networking library on the server side. The server-side sends everything down in network byte order, as one would expect, but I find that dealing with this on the client side is awkward, particularly for unsigned values.
UInt32 length = (UInt32)IPAddress.NetworkToHostOrder(reader.ReadInt32());
is the only way I've come up with to get a correct unsigned value out of the stream, but this seems both awkward and ugly, and I have yet to test if that's just going to clip off high-order values so that I have to do fun BitConverter stuff.
Is there some way I'm missing short of writing a wrapper around the whole thing to avoid these ugly conversions on every read? It seems like there should be an endian-ness option on the reader to make things like this simpler, but I haven't come across anything. | 0 | [
2,
184,
92,
53,
28257,
982,
34,
591,
8,
7861,
6263,
37,
21,
14171,
10647,
106,
60,
800,
3726,
3726,
329,
9,
1963,
9,
4772,
1857,
10647,
106,
11137,
4070,
19,
21,
265,
8,
2451,
806,
2595,
9,
31,
57,
21,
272,
5910,
3010,
6440,
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 find usb drive letter?
===
is it possible to determine drive letter of USB Flash drive on windows using .NET? how? | 0 | [
2,
184,
20,
477,
182,
220,
1493,
1748,
60,
800,
3726,
3726,
25,
32,
938,
20,
3746,
1493,
1748,
16,
182,
220,
4433,
1493,
27,
1936,
568,
13,
9,
2328,
60,
184,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What causes "Invalid advise flags" run-time error in Excel VBA?
===
I have a Excel macro that generates a this error whenever it gets input of a specific format. Does anyone knows **in general** what an *advise flag* is OR where can I find information on this type of error? Thanks
> Runtime error -2147221503
> (80040001): Automation error, Invalid
> advise flags | 0 | [
2,
98,
4047,
13,
7,
108,
18506,
43,
14640,
9318,
7,
485,
8,
891,
7019,
19,
20700,
566,
969,
60,
800,
3726,
3726,
31,
57,
21,
20700,
9069,
30,
7920,
18,
21,
48,
7019,
6634,
32,
3049,
6367,
16,
21,
1903,
2595,
9,
630,
1276,
3620... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WPF to PDF
===
I have a WPF application and I want to be able to save the output of the application to a PDF document, the item I want to save can be a Visual a Drawing or a FixedDocument (I can create it as any of those options, and it's easy to convert between them).
Is there any library that can convert directly from WPF to PDF (without writing code to walk the visual tree and recreate it using PDF primitives). | 0 | [
2,
619,
7721,
20,
13,
11124,
800,
3726,
3726,
31,
57,
21,
619,
7721,
3010,
17,
31,
259,
20,
44,
777,
20,
2079,
14,
5196,
16,
14,
3010,
20,
21,
13,
11124,
4492,
15,
14,
9101,
31,
259,
20,
2079,
92,
44,
21,
3458,
21,
3533,
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... |
Who is responsible for your UI / User Experience?
===
Looking for input from all, though mostly interested in small engineering teams / small companies (10 - 20 people) that develop web applications:
1. Who is responsible for the overall look and feel of your UI (i.e. setting standards)? Is this person a dedicated resource or does he / she have other responsibilities? What type of background does this person have?
2. What about the look / feel of individual features? The BA's that design the features? The engineers that implement them? A combination of both? Somebody completely separate (i.e. engineer codes core functionality and passes it on to somebody else to "pretty it up")? | 4 | [
2,
72,
25,
1864,
26,
154,
13,
5661,
13,
118,
4155,
1496,
60,
800,
3726,
3726,
699,
26,
6367,
37,
65,
15,
362,
1555,
3158,
19,
284,
1552,
952,
13,
118,
284,
1532,
13,
5,
1036,
13,
8,
434,
148,
6,
30,
2803,
2741,
3767,
45,
137... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get/set logical directory path in python.
===
In python is it possible to get or set a logical directory (as opposed to an absolute one).
For example if I have:
/real/path/to/dir
and I have
/linked/path/to/dir
linked to the same directory.
using os.getcwd and os.chdir will always use the absolute path
>>> import os
>>> os.chdir('/linked/path/to/dir')
>>> print os.getcwd()
/real/path/to/dir
The only way I have found to get around this at all is to launch 'pwd' in another process and read the output. However, this only works until you call os.chdir for the first time.
| 0 | [
2,
184,
20,
164,
118,
3554,
11545,
16755,
2013,
19,
20059,
9,
800,
3726,
3726,
19,
20059,
25,
32,
938,
20,
164,
54,
309,
21,
11545,
16755,
13,
5,
472,
3499,
20,
40,
7070,
53,
6,
9,
26,
823,
100,
31,
57,
45,
13,
118,
7467,
11... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
URL Encryption in Java
===
What is the best way to encrypt an URL with parameters in Java? | 0 | [
2,
287,
6362,
24420,
19,
8247,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
1957,
11435,
40,
287,
6362,
29,
12905,
19,
8247,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is there a better way to get hold of a reference to a movie clip in actionscript using a string without eval
===
I have created a bunch of movie clips which all have similar names and then after some other event I have built up a string like:
var clipName = "barLeft42"
which is held inside another movie clip called 'thing'.
I have been able to get hold of a reference using:
var movieClip = Eval( "_root.thing." + clipName )
But that feels bad - is there a better way?
| 0 | [
2,
25,
80,
21,
574,
161,
20,
164,
1027,
16,
21,
2801,
20,
21,
1308,
12229,
19,
1028,
8741,
568,
21,
3724,
366,
13,
62,
3377,
800,
3726,
3726,
31,
57,
679,
21,
7653,
16,
1308,
17270,
56,
65,
57,
835,
1817,
17,
94,
75,
109,
89... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
how to determine USB Flash drive manufacturer?
===
I need my program to work only with certain USB Flash drives (from a single manufacturer) and ignore all other USB Flash drives (from any other manufacturers).
is it possible to check that specific USB card is inserted on windows using .NET 2.0? how? | 0 | [
2,
184,
20,
3746,
182,
220,
4433,
1493,
7094,
60,
800,
3726,
3726,
31,
376,
51,
625,
20,
170,
104,
29,
1200,
182,
220,
4433,
10396,
13,
5,
2665,
21,
345,
7094,
6,
17,
7174,
65,
89,
182,
220,
4433,
10396,
13,
5,
2665,
186,
89,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
QueryString malformed after URLDecode
===
I'm trying to pass in a Base64 string into a C#.Net web application via the QueryString. When the string arrives the "+" (plus) sign is being replaced by a space. It appears that the automatic URLDecode process is doing this. I have no control over what is being passed via the QueryString. Is there any way to handle this server side?
Example:
http://localhost:3399/Base64.aspx?VLTrap=VkxUcmFwIHNldCB0byAiRkRTQT8+PE0iIHBsdXMgb3IgbWludXMgNSBwZXJjZW50Lg==
Produces:
VkxUcmFwIHNldCB0byAiRkRTQT8 PE0iIHBsdXMgb3IgbWludXMgNSBwZXJjZW50Lg== | 0 | [
2,
25597,
11130,
2814,
12609,
75,
287,
6362,
546,
9375,
800,
3726,
3726,
31,
22,
79,
749,
20,
1477,
19,
21,
1000,
3470,
3724,
77,
21,
272,
5910,
9,
2328,
2741,
3010,
1197,
14,
25597,
11130,
9,
76,
14,
3724,
8394,
14,
13,
7,
2430... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 tell if a DOM element is visible?
===
Is there an efficient way to tell if a DOM element (in an HTML document) is currently visible?
(The question regards Firefox) | 0 | [
2,
184,
20,
494,
100,
21,
11859,
4520,
25,
4560,
60,
800,
3726,
3726,
25,
80,
40,
8243,
161,
20,
494,
100,
21,
11859,
4520,
13,
5,
108,
40,
13,
15895,
4492,
6,
25,
871,
4560,
60,
13,
5,
124,
1301,
14179,
535,
18219,
6,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Why is software support for Bidirectional text (Hebrew,Arabic) so poor?
===
While most operating systems and web browsers have very good support for [bidirectional text][1] such as Hebrew and Arabic, most commercial and open-source software does not:
- Most text editors, besides the original notepad and the visual studio editor, does a very poor job. (And I tried dozens of them).
- I could not find any file compare tool doing a decent job - No even Beyond-Compare.
- Same thing for software and packages dealing with charting and reporting.
Some questions I have:
- Do you share the same pain I do?
- Is the software you write bidirectional compliant? Do you have bug reports about it?
- Do you even know what are the issues involved? Do you test for them?
- Any suggestions on how to make the software world a better place for bidirectional language speakers?
[1]: http://en.wikipedia.org/wiki/Bi-directional_text | 0 | [
2,
483,
25,
2306,
555,
26,
1732,
19393,
1854,
13,
5,
16774,
15,
9812,
6,
86,
1696,
60,
800,
3726,
3726,
133,
127,
2455,
1242,
17,
2741,
16495,
18,
57,
253,
254,
555,
26,
636,
2161,
19393,
1854,
500,
2558,
165,
500,
145,
28,
7438... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Server Management Studio - Change Default Directory for Backup Location
===
Using MS SQL Server Management Studio - To Restore a Database:
* Restore Database
* `(*) From Device:`
* Click "`...`" Button
* `Backup media: File`
* Click "`Add`" Button
* Popup Window: "`Locate Backup File`"
That window Defaults to `C:\Program Files\Microsoft SQL Server\MSSQL.1\Backup`
How do I configure MS SQL Server Management Studio to look in `D:\data\databases\`
instead of looking in `C:\Program Files\Microsoft SQL Server\MSSQL.1\Backup` ? | 0 | [
2,
8128,
1097,
1120,
13,
8,
753,
12838,
16755,
26,
10119,
1474,
800,
3726,
3726,
568,
4235,
4444,
255,
8128,
1097,
1120,
13,
8,
20,
8454,
21,
6018,
45,
1637,
8454,
6018,
1637,
13,
1,
5,
2483,
6,
37,
3646,
45,
1,
1637,
10840,
13,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is MEF a replacement for System.Addin?
===
Is the Managed Extensibility Framework a replacement for System.Addin? Or are they complementary? | 0 | [
2,
25,
55,
410,
21,
4610,
26,
329,
9,
14854,
108,
60,
800,
3726,
3726,
25,
14,
1471,
1396,
8710,
14264,
6596,
21,
4610,
26,
329,
9,
14854,
108,
60,
54,
50,
59,
24654,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
sql datetime format confusion
===
I've found a similar question on stack overflow, but it didn't really answer the question I have. I need to make sure that my asp.net application is formatting the date dd/mm/yyyy the same as my sql 2005 server.
How do I verify the date culture (if that's what it's called) of the server matches how I've programmed my app? Are there specific database settings and OS settings? Is it table-specific? I don't want to transpose my days and months.
thank you | 0 | [
2,
4444,
255,
1231,
891,
2595,
5677,
800,
3726,
3726,
31,
22,
195,
216,
21,
835,
1301,
27,
7566,
20285,
15,
47,
32,
223,
22,
38,
510,
1623,
14,
1301,
31,
57,
9,
31,
376,
20,
233,
562,
30,
51,
28,
306,
9,
2328,
3010,
25,
2595... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
php String Concatenation, Performance
===
In languages like Java and C#, strings are immutable and it can be computationally expensive to build a string one character at a time. In said languages, there are library classes to reduce this cost such as C# `System.Text.StringBuilder` and Java `java.lang.StringBuilder`.
Does php (4 or 5; I'm interested in both) share this limitation? If so, are there similar solutions to the problem available? | 0 | [
2,
13,
26120,
3724,
1065,
9530,
7914,
15,
956,
800,
3726,
3726,
19,
2556,
101,
8247,
17,
272,
5910,
15,
7887,
50,
797,
7903,
579,
17,
32,
92,
44,
16439,
102,
5381,
20,
1895,
21,
3724,
53,
925,
35,
21,
85,
9,
19,
87,
2556,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What do these abbreviations in network hostnames mean?
===
When I use traceroute, I often see abbreviations in the hostnames along the route, such as "ge", "so", "ic", "gw", "bb" etc. I can guess "bb" means backbone.
Does anyone know what any these strings abbreviate, or know any other common abbreviations? | 0 | [
2,
98,
107,
158,
5941,
3692,
1755,
7504,
19,
982,
2015,
7259,
18,
884,
60,
800,
3726,
3726,
76,
31,
275,
5565,
20179,
15,
31,
478,
196,
5941,
3692,
1755,
7504,
19,
14,
2015,
7259,
18,
303,
14,
858,
15,
145,
28,
13,
7,
834,
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... |
How do I quickly slice and dice large data files in Ruby?
===
I'd like to slice and dice large datafiles, up to a gig, in a fairly quick and efficient manner. If I use something like UNIX's "CUT", it's extremely fast, even in a CYGWIN environment.
I've tried developing and benchmarking various Ruby scripts to process these files, and always end up with glacial results.
What would you do in Ruby to make this not so dog slow? | 0 | [
2,
184,
107,
31,
976,
12982,
17,
13,
8779,
370,
1054,
6488,
19,
10811,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
12982,
17,
13,
8779,
370,
1054,
16877,
18,
15,
71,
20,
21,
7175,
15,
19,
21,
6647,
2231,
17,
8243,
3832,
9,
100,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best way to implement clean UI functionality in WinForms while maintaining a decent decoupled architecture?
===
I tend to implement UI functionality using fairly self-documenting void doSomething() methods, i.e. if the user presses this button then perform this action then enable this list box, disable that button, etc. Is this the best approach? Is there a better pattern for general UI management i.e. how to control when controls are enabled/disabled/etc. etc. depending on user input?
Often I feel like I'm veering towards the 'big class that does everything' anti-pattern as so much seems to interact with the 'main' form class. Often, even if I'm including private state variables in the class that have been implemented using a relatively modular design, I'm still finding it grows so quickly it's ridiculous.
So could people give me some good advice towards producing quality, testable, decoupled WinForms design without falling into these traps? | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
8713,
2745,
13,
5661,
18548,
19,
628,
4190,
18,
133,
8215,
21,
12238,
121,
17856,
1294,
2607,
60,
800,
3726,
3726,
31,
5480,
20,
8713,
13,
5661,
18548,
568,
6647,
1119,
8,
28132,
68,
11364,
107,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Passing around urls between applications in the same project
===
I am trying to mock-up an API and am using separate apps within Django to represent different web services. I would like App A to take in a link that corresponds to App B and parse the response (json).
Is there a way to dynamically construct the url to App B so that I can test the code in development and not change to much before going into production? The problem is that I can't use localhost as part of a link.
I am currently using urllib, but eventually I would like to do something less hacky and better fitting with the web services (REST) paradigm. | 0 | [
2,
2848,
140,
13,
911,
7532,
128,
3767,
19,
14,
205,
669,
800,
3726,
3726,
31,
589,
749,
20,
10506,
8,
576,
40,
21,
2159,
17,
589,
568,
1725,
4865,
18,
363,
3857,
14541,
20,
3501,
421,
2741,
687,
9,
31,
83,
101,
4865,
21,
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... |
Is it worth learning Java when you already know C# fairly well?
===
Since C# is in many ways a direct derivative of Java I wondered whether there was any advantage to learning Java after the fact of having learnt quite a reasonable about about C#?
**Note:** Please provide clear, direct advice rather than discussion in order to kee[ in line with SO guidelines. | 0 | [
2,
25,
32,
2715,
2477,
8247,
76,
42,
614,
143,
272,
5910,
6647,
134,
60,
800,
3726,
3726,
179,
272,
5910,
25,
19,
151,
2847,
21,
1744,
15776,
16,
8247,
31,
3519,
1472,
80,
23,
186,
3314,
20,
2477,
8247,
75,
14,
837,
16,
452,
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... |
.NET + Copying large amounts of memory tricks
===
Back in the olden days, there were tricks used (often for blitting offscreen framebuffers), to copy large chunks of memory from one location to another.
Now that I'm working in C#, I've found the need to move an array of bytes (roughly 32k in size) from one memory location to another approximately 60 times per second.
Somehow, I don't think a byte by byte copy in a for loop is optimal here.
Does anyone know a good trick to do this kinda of work while still staying in purely managed code?
If not, I'm willing to do some P/Invoking or go into unsafe mode, but I'd like to stay managed if I can for cross platform reasons. | 0 | [
2,
13,
9,
2328,
2754,
4344,
68,
370,
8545,
16,
1912,
13747,
800,
3726,
3726,
97,
19,
14,
315,
219,
509,
15,
80,
46,
13747,
147,
13,
5,
14855,
26,
334,
23956,
68,
168,
7187,
3523,
2345,
6866,
18,
6,
15,
20,
4344,
370,
15009,
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... |
IIS 6.0 on Enterprise Server - Memory Limit
===
We want to switch a web server from Windows 2003 to Windows 2003 Enterprise (64 bits) to use 8GB of RAM. Will IIS 6.0 and an ASPNET 1.1 application be able to benefit from the change? | 0 | [
2,
595,
18,
400,
9,
387,
27,
6002,
8128,
13,
8,
1912,
4496,
800,
3726,
3726,
95,
259,
20,
5521,
21,
2741,
8128,
37,
1936,
973,
20,
1936,
973,
6002,
13,
5,
3470,
10181,
6,
20,
275,
469,
11400,
16,
2843,
9,
129,
595,
18,
400,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to create Excel 2003 UDF with a C# Excel add-in using vsto 2005 SE
===
I have seen this http://blogs.msdn.com/pstubbs/archive/2004/12/31/344964.aspx.
However i want to get this working in C# Excel add-in using vsto 2005 SE, can any one help? | 0 | [
2,
184,
20,
1600,
20700,
973,
287,
8736,
29,
21,
272,
5910,
20700,
3547,
8,
108,
568,
4611,
262,
812,
1353,
800,
3726,
3726,
31,
57,
541,
48,
7775,
6903,
7091,
5447,
9,
79,
18,
43,
103,
9,
960,
118,
1919,
2473,
3490,
18,
118,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Moving the child nodes of an XML node upwards
===
Imagine I have the folling XML file:
<a>before<b>middle</b>after</a>
I want to convert it into something like this:
<a>beforemiddleafter</a>
In other words I want to get all the child nodes of a certain node, and move them to the parent node in order. This is like doing this command: "mv ./directory/* .", but for xml nodes.
I'd like to do this in using unix command line tools. I've been trying with xmlstarlet, which is a powerful command line XML manipulator. I tried doing something like this, but it doesn't work
echo "<a>before<b>middle</b>after</a>" | xmlstarlet ed -m "//b/*" ".."
| 0 | [
2,
1219,
14,
850,
16272,
16,
40,
23504,
15421,
16686,
800,
3726,
3726,
4382,
31,
57,
14,
8938,
802,
23504,
3893,
45,
279,
255,
38,
73,
58,
1569,
263,
38,
73,
12750,
1569,
255,
38,
73,
220,
1569,
263,
38,
73,
17927,
1569,
255,
38... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should I never use primitive types again?
===
Mixing the use of primitive data types and their respective wrapper classes, in Java, can lead to a lot of bugs. The following example illustrates the issue:
int i = 4;
...
if (i == 10)
doCrap();
Later on you figure that you want the variable *i* to be either defined or undefined, so you change the above instantiation to:
Integer i == null;
Now the equality check fails.
Is it good Java practise to always use the primitive wrapper classes? It obviously would get some bugs out of the way early, but what are the downsides to this? Does it impact performance or the application's memory footprint? Are there any sneaky gotchas? | 0 | [
2,
378,
31,
243,
275,
11473,
2551,
188,
60,
800,
3726,
3726,
5826,
14,
275,
16,
11473,
1054,
2551,
17,
66,
7390,
28051,
2684,
15,
19,
8247,
15,
92,
672,
20,
21,
865,
16,
13925,
9,
14,
249,
823,
15620,
18,
14,
1513,
45,
19,
38,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Make a <div> fade away nicely after a given amount of time
===
What is the best way to make a <div> fade away after a given amount of time (without using some of the javascript libraries available). I'm looking for a very lightweight solution here not requiring a huge javascript library to be send to the browser. | 0 | [
2,
233,
21,
13,
1,
12916,
1,
11381,
229,
24050,
75,
21,
504,
2006,
16,
85,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
233,
21,
13,
1,
12916,
1,
11381,
229,
75,
21,
504,
2006,
16,
85,
13,
5,
14506,
568,
109,
16,
14,
8247,
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... |
Bash variable scope
===
Please explain to me why the very last "echo" statement is blank? I expect that it was incremented in the while loop to a value of 1:
#!/bin/bash
OUTPUT="name1 ip ip status"
if [ -z "$OUTPUT" ]
then
echo "Status WARN: No messages from SMcli"
exit $STATE_WARNING
else
echo "$OUTPUT"|while read NAME IP1 IP2 STATUS
do
if [ "$STATUS" != "Optimal" ]
then
echo "CRIT: $NAME - $STATUS"
echo $((++XCODE))
else
echo "OK: $NAME - $STATUS"
fi
done
fi
echo $XCODE
I've tried using the following statement instead of the ++XCODE method
XCODE=`expr $XCODE + 1`
and it too wont print outside of the while statement. I think I'm missing something about variable scope here but the ol' man page isnt showing it to me. | 0 | [
2,
13158,
7612,
9914,
800,
3726,
3726,
2247,
3271,
20,
55,
483,
14,
253,
236,
13,
7,
62,
2613,
7,
3331,
25,
6463,
60,
31,
4186,
30,
32,
23,
13,
28461,
69,
19,
14,
133,
5293,
20,
21,
1923,
16,
6352,
6926,
187,
118,
4772,
118,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
A Delphi/FreePascal lib or function that emulates the PHP's function parse_url
===
I'm doing a sitemap producer in Object Pascal and need a good function or lib to emulate the parse_url function on PHP.
Does anyone know of any good ones? | 0 | [
2,
21,
23030,
118,
4639,
11722,
3430,
13,
8326,
54,
1990,
30,
23804,
18,
14,
13,
26120,
22,
18,
1990,
2017,
870,
1,
911,
255,
800,
3726,
3726,
31,
22,
79,
845,
21,
689,
15022,
1421,
19,
3095,
18661,
17,
376,
21,
254,
1990,
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... |
Comparison of Python and Perl solutions to Wide Finder challenge
===
I'd be very grateful if you could compare the winning [O’Rourke's Perl solution](http://www.cs.ucsd.edu/~sorourke/wf.pl) to [Lundh's Python solution](http://effbot.org/zone/wide-finder.htm), as I don't know Perl good enough to understand what's going on there. More specifically I'd like to know what gave Perl version 3x advantage: algorithmic superiority, quality of C extensions, other factors?
[Wide Finder: Results](http://www.tbray.org/ongoing/When/200x/2007/10/30/WF-Results) | 0 | [
2,
6050,
16,
20059,
17,
416,
255,
6776,
20,
1051,
13,
18639,
2404,
800,
3726,
3726,
31,
22,
43,
44,
253,
8083,
100,
42,
110,
11590,
14,
1414,
636,
111,
1,
24321,
22,
18,
416,
255,
4295,
500,
5,
21127,
6903,
6483,
9,
6824,
9,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.