unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Linux-based solution for domain management?
===
Using any member of the Windows Server family, I can set up an active directory, and have a single pool of users for a large scale of computers; access can be given / removed for any shared resources in the given domain (including access to client computers, etc).
What similar (and widespread) solutions exist for managing a multi-user, multi-computer environment using Linux? What are their advanteges / disadvanteges? And (how) can they interoperate with Windows? | 0 | [
2,
13024,
8,
1281,
4295,
26,
4603,
1097,
60,
800,
3726,
3726,
568,
186,
322,
16,
14,
1936,
8128,
190,
15,
31,
92,
309,
71,
40,
1348,
16755,
15,
17,
57,
21,
345,
3067,
16,
3878,
26,
21,
370,
3464,
16,
7774,
73,
1381,
92,
44,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get the caller's IP address in a WebMethod?
===
How do I get the caller's IP address in a WebMethod?
[WebMethod]
public void Foo()
{
// HttpRequest... ? - Not giving me any options through intellisense...
}
using C# and ASP.NET | 0 | [
2,
184,
107,
31,
164,
14,
21326,
22,
18,
15735,
3218,
19,
21,
2741,
5909,
1807,
43,
60,
800,
3726,
3726,
184,
107,
31,
164,
14,
21326,
22,
18,
15735,
3218,
19,
21,
2741,
5909,
1807,
43,
60,
636,
14113,
5909,
1807,
43,
500,
317,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 get what a symbolic link points to without grep?
===
Say you have a symbolic link, i.e., a -> b. In *nix, is there a command that will simply output what 'a' points to (i.e., 'b') but with nothing else? Typically we do a ls -l and pipe it to grep or something, but say I don't want to do any parsing. Is there a way to do this?
| 0 | [
2,
184,
107,
42,
164,
98,
21,
12882,
3508,
819,
20,
366,
5604,
306,
60,
800,
3726,
3726,
395,
42,
57,
21,
12882,
3508,
15,
31,
9,
62,
9,
15,
21,
13,
8,
1,
334,
9,
19,
1637,
14064,
15,
25,
80,
21,
1202,
30,
129,
1659,
5196,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 prevent a user from posting data multiple times on a website
===
I am working on a web application (J2EE) and I would like to know the options that are available for handling a double post from the browser.
The solutions that I have seen and used in the past are all client-side:
- Disable the submit button as soon as the user clicks it.
- Follow a POST-Redirect-GET pattern to prevent POSTs when the user clicks the back button.
- Handle the onSubmit event of the form and keep track of the submission status with JavaScript.
I would prefer to implement a server side solution if possible. Are there any better approaches than the ones I have mentioned above, or are client-side solutions best?
| 0 | [
2,
184,
107,
42,
2501,
21,
4155,
37,
15669,
1054,
1886,
436,
27,
21,
2271,
800,
3726,
3726,
31,
589,
638,
27,
21,
2741,
3010,
13,
5,
728,
135,
2851,
6,
17,
31,
83,
101,
20,
143,
14,
6368,
30,
50,
904,
26,
7988,
21,
1494,
678... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Webpart feature not adding Description
===
I am adding a webpart to the webpart gallery as part of a feature within a solution.
When the webpart is added to the gallery, the webparts Description field is being overwritten by an empty string.
I have added a description to everywhere I can think of, including:
1. The webpart itself. myWebpart.webpart `<property name="Description" type="string">my description</property>`
2. The feature.xml `Description="mywebpart description"`
3. The feature.xml `<Property Key="Description" Value="mywebpart description"></Property>`
4. The webpartManifest.xml (specified in the feature) `<File ...><Property Name=Description" Value="mywebpart description">`
I have run out of ideas of where to put the description so it will appear in the Description field of the web part gallery when the solution is deployed.
Do you have any ideas?
| 0 | [
2,
2741,
3091,
1580,
52,
4721,
5318,
800,
3726,
3726,
31,
589,
4721,
21,
2741,
3091,
20,
14,
2741,
3091,
2246,
28,
141,
16,
21,
1580,
363,
21,
4295,
9,
76,
14,
2741,
3091,
25,
905,
20,
14,
2246,
15,
14,
2741,
3091,
18,
5318,
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 simulate a low bandwidth, high latency environment?
===
I need to simulate a low bandwidth, high latency connection to a server in order to emulate the conditions of a VPN at a remote site. The bandwidth and latency should be tweakable so I can discover the best combination in order to run our software package. | 0 | [
2,
184,
107,
31,
24969,
21,
708,
23392,
15,
183,
456,
14386,
2307,
60,
800,
3726,
3726,
31,
376,
20,
24969,
21,
708,
23392,
15,
183,
456,
14386,
2760,
20,
21,
8128,
19,
389,
20,
23804,
14,
2039,
16,
21,
13,
10924,
103,
35,
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... |
Are there constants in Javascript?
===
If not, what's the common practice for specifying variables that are used as constants? | 0 | [
2,
50,
80,
3587,
18,
19,
8247,
8741,
60,
800,
3726,
3726,
100,
52,
15,
98,
22,
18,
14,
757,
1345,
26,
19077,
68,
12157,
30,
50,
147,
28,
3587,
18,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Javascript data formatting/pretty printer
===
I'm trying to find a way to 'pretty print' a Javascript data structure in a human-readable form for debugging.
I have a rather big and complicated data structure being stored in JS and I need to write some code to manipulate it. In order to work out what I'm doing and where I'm going wrong, what I really need is to be able to see the data structure in its entirety, and update it whenever I make changes through the UI.
All of this stuff I can handle myself, apart from finding a nice way to dump a javascript data structure to a human-readable string. JSON would do, but it really needs to be nicely formatted and indented. I'd usually use Firebug's excellent DOM dumping stuff for this, but I really need to be able to see the entire structure at once, which doesn't seem to be possible in Firebug.
Any suggestions welcome, thanks in advance. | 0 | [
2,
8247,
8741,
1054,
2595,
1203,
118,
21542,
12925,
800,
3726,
3726,
31,
22,
79,
749,
20,
477,
21,
161,
20,
13,
22,
21542,
4793,
22,
21,
8247,
8741,
1054,
1411,
19,
21,
585,
8,
10647,
579,
505,
26,
121,
16254,
2762,
9,
31,
57,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Call a certain method before each webservice call
===
Here's the situation. I have a webservice (C# 2.0), which consists of (mainly) a class inheriting from System.Web.Services.WebService. It contains a few methods, which all need to call a method that checks if they're authorized or not.
Basically something like this (pardon the architecture, this is purely as an example ;)):
public class ProductService : WebService
{
public AuthHeader AuthenticationHeader;
[WebMethod(Description="Returns true")]
[SoapHeader("AuthenticationHeader")]
public bool MethodWhichReturnsTrue()
{
if(Validate(AuthenticationHeader))
throw new SecurityException("Access Denied");
return true;
}
[WebMethod(Description="Returns false")]
[SoapHeader("AuthenticationHeader")]
public bool MethodWhichReturnsFalse()
{
if(Validate(AuthenticationHeader))
throw new SecurityException("Access Denied");
return false;
}
private bool Validate(AuthHeader authHeader)
{
return authHeader.Username == "gooduser" && authHeader.Password == "goodpassword";
}
}
As you can see, the method 'Validate' has to be called in each method. I'm looking for a way to be able to call that method, while still being able to access the soap headers in a sane way. I've looked at the events in the global.asax, but I don't think I can access the headers in that class... Can I? | 0 | [
2,
645,
21,
1200,
2109,
115,
206,
2741,
11449,
645,
800,
3726,
3726,
235,
22,
18,
14,
1858,
9,
31,
57,
21,
2741,
11449,
13,
5,
150,
5910,
172,
9,
387,
6,
15,
56,
2043,
16,
13,
5,
6232,
102,
6,
21,
718,
17569,
68,
37,
329,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Auto-organize Visual Studio Tabs?
===
Is there any setting in Visual Studio 2008 to group/organize tabs? For example, I'd prefer to have all code-behind files open in a tab next to its .aspx page if that page is open and vice versa. Dragging tabs around really kills my productivity. | 0 | [
2,
3108,
8,
6826,
2952,
3458,
1120,
6523,
18,
60,
800,
3726,
3726,
25,
80,
186,
2697,
19,
3458,
1120,
570,
20,
214,
118,
6826,
2952,
6523,
18,
60,
26,
823,
15,
31,
22,
43,
6369,
20,
57,
65,
1797,
8,
24878,
6488,
368,
19,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do UTF-8,UTF-16, and UTF-32 Unicode encodings differ in the number of characters they can store?
===
Okay. I know this looks like the typical "Why didn't he just Google it or go to www.unicode.org and look it up?" answer, but for such a simple question the answer still eludes me after checking both sources.
I am pretty sure that all three of these encoding systems support all of the Unicode characters, but I need to confirm it before I make that claim in a presentation I am making about it.
Bonus question: Do these encodings differ in the number of characters they can be extended to support? | 0 | [
2,
107,
287,
11720,
8,
457,
15,
1982,
410,
8,
1091,
15,
17,
287,
11720,
8,
3125,
28010,
19608,
18,
11394,
19,
14,
234,
16,
1766,
59,
92,
1718,
60,
800,
3726,
3726,
1705,
9,
31,
143,
48,
1879,
101,
14,
3874,
13,
7,
2256,
223,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Store all projects in source control or not?
===
I am currently using TortoiseSVN to manage a couple of the projects that I have on the go at the moment. When I first moved everything into source control I wasn't really sure how everything should be laid out so I ended up putting each project into its own repository.
I was wondering would it be a good idea for me just to move them all into one big repository and have them split into project folders? What does everyone else do?
At the moment none of them share common code but they may in the future. Would it make it easier to manage if they where all together.
Thanks. | 0 | [
2,
1718,
65,
2314,
19,
1267,
569,
54,
52,
60,
800,
3726,
3726,
31,
589,
871,
568,
25691,
18,
16578,
20,
4705,
21,
1335,
16,
14,
2314,
30,
31,
57,
27,
14,
162,
35,
14,
688,
9,
76,
31,
64,
385,
796,
77,
1267,
569,
31,
526,
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... |
Really Young Software Architect Question
===
I am a really young software engineer/QA Team leader. I have been developing software for about 2 years and for 1 of those years I have also been the head of the QA team at a software development company. Currently I am still working as the QA team leader/software engineer for QA tools. Recently I have been invited to join a group of friends and associates who would like to start a software company. They want me to be the architect/tech lead of the software (a special chat client written in Java is all I can say about it). I am very good at learning under fire and I learn a great deal by doing. However, I worry that my lack of experience will cause the project to fail (or at least be developed poorly). So I am wondering would you suggest I take the position, do my best and learn as I go? Or would you suggest I refuse?
If you would suggest I take the position would you please provide one or to resources that would be good for a beginning Java Architect?
Thanks, In advanced. | 0 | [
2,
510,
461,
2306,
3338,
1301,
800,
3726,
3726,
31,
589,
21,
510,
461,
2306,
2335,
118,
8681,
173,
1156,
9,
31,
57,
74,
3561,
2306,
26,
88,
172,
122,
17,
26,
137,
16,
273,
122,
31,
57,
67,
74,
14,
157,
16,
14,
7234,
173,
35,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 AOP work in Drupal?
===
How does AOP ( Aspect Oriented Programming ) work in Drupal. I have learned about AOP in terms of using it for logging and security but how does it apply to Druoal? | 0 | [
2,
184,
630,
21,
2594,
170,
19,
15708,
6720,
60,
800,
3726,
3726,
184,
630,
21,
2594,
13,
5,
7289,
13,
6800,
3143,
13,
6,
170,
19,
15708,
6720,
9,
31,
57,
2691,
88,
21,
2594,
19,
1663,
16,
568,
32,
26,
13,
13919,
17,
1221,
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,
0,
0,
0,
0,
0,
0,
0... |
Why is Lisp used for AI?
===
I've been learning Lisp to expand my horizons and because I have heard that it is used in AI programming, yet after doing some exploring, I have yet to find AI examples or anything in the language that would make it more inclined towards it. Was Lisp used in the past because it was available, or is there something that I'm just missing? | 0 | [
2,
483,
25,
2093,
3401,
147,
26,
21,
49,
60,
800,
3726,
3726,
31,
22,
195,
74,
2477,
2093,
3401,
20,
6073,
51,
7530,
18,
17,
185,
31,
57,
752,
30,
32,
25,
147,
19,
21,
49,
3143,
15,
768,
75,
845,
109,
11748,
15,
31,
57,
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... |
Does a hash shrink in Perl as you delete elements?
===
Does a hash shrink in Perl as you delete elements.
More specifically I had a perl program that I inherited that would parse a huge file ( 1 GB ) and load up a hash of hashes. it would do that same for another file and then do a comparison of different elements. The memory consumption was huge during this process and even though I added deleting hash elements has they were used the memory consumption seemed to be unaffected.
The script was extremely slow and such a memory hog. I know it was not well designed but any ideas about the hash memory usage? | 0 | [
2,
630,
21,
19170,
16269,
19,
416,
255,
28,
42,
27448,
2065,
60,
800,
3726,
3726,
630,
21,
19170,
16269,
19,
416,
255,
28,
42,
27448,
2065,
9,
91,
3524,
31,
41,
21,
416,
255,
625,
30,
31,
7179,
30,
83,
2017,
870,
21,
2329,
389... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 .net, what's the best / safest way to add a "end of line" character to a text file?
===
I assume there must be a system and language independent way to just stick the "current" EOL character into a text file, but my MSDN-fu seems to be weak today. Bonus points if there is a way to do this in a web application that will put the correct EOL character for the current client's machine's OS, not the web server's. | 0 | [
2,
19,
13,
9,
2328,
15,
98,
22,
18,
14,
246,
13,
118,
1834,
384,
161,
20,
3547,
21,
13,
7,
2451,
16,
293,
7,
925,
20,
21,
1854,
3893,
60,
800,
3726,
3726,
31,
7158,
80,
491,
44,
21,
329,
17,
816,
1124,
161,
20,
114,
5258,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a source code formatter for Groovy?
===
I use the commercial version of Jalopy for my Java projects but it doesn't work on Groovy files. IntelliJ has a serviceable formatter but I don't like requiring a particular IDE. | 0 | [
2,
25,
80,
21,
1267,
1797,
26,
24700,
26,
3452,
2026,
93,
60,
800,
3726,
3726,
31,
275,
14,
1439,
615,
16,
3009,
11362,
93,
26,
51,
8247,
2314,
47,
32,
1437,
22,
38,
170,
27,
3452,
2026,
93,
6488,
9,
19,
4213,
9999,
63,
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,
0... |
MFC "Warning: skipping non-radio button in group."
===
When running an old MFC application in Visual Studio's debugger I've seen a lot of warnings in the Output window like the following:
> Warning: skipping non-radio button in group.
I understand that in MFC you put radio buttons in groups to indicate which sets of radio buttons go together. If I remember correctly you do this by setting the "group" property of the first radio button to true, and then set the rest of the radio buttons "group" property to false.
I have three questions about this warning.
1. How do you get rid of this warning? Do
you have to set the "group" property of all
non-radio button controls to true to
avoid this, or should you just set
it for the first control after the
last radio button?
2. Is there an easy way to figure
out what controls or dialogs have this problem?
I could open each dialog and
fiddle with it until the warning
pops up. This application has a lot of
dialogs though, so it would be
nice if there was an easier way.
3. What negative behavior can occur if
you don't fix this warning? In other
words, does this even matter? | 0 | [
2,
307,
7061,
13,
7,
1885,
2981,
45,
27225,
538,
8,
11129,
5167,
19,
214,
9,
7,
800,
3726,
3726,
76,
946,
40,
315,
307,
7061,
3010,
19,
3458,
1120,
22,
18,
121,
2345,
11356,
31,
22,
195,
541,
21,
865,
16,
3590,
18,
19,
14,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Oracle load spikes couple hours after startup.
===
We use oracle as the back-end database for our product. I have been running series of stress tests on our system and I have started noticing that oracle is much faster right after the database was restarted. Over time (a couple hours or so) the database seems to get slower and slower and I will see the database machine under more stress.
Running the test right after an oracle restart, i will see a 1 min load average of 5 or so and average CPU around 10-15%. After a few hours, I see the load average at 13 and CPU at 40-70%. (This is red hat linux 2x Quad core xeon, Raid 10 10k rpm sas drives).
My first thought was wouldn't database transactions get faster because those queries are getting cached?
I can't seem to figure out the problem. | 0 | [
2,
15759,
6305,
6734,
18,
1335,
974,
75,
20205,
9,
800,
3726,
3726,
95,
275,
15759,
28,
14,
97,
8,
2451,
6018,
26,
318,
2374,
9,
31,
57,
74,
946,
231,
16,
5384,
4894,
27,
318,
329,
17,
31,
57,
373,
18130,
30,
15759,
25,
212,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How many threads should I use in my Java program?
===
I recently inherited a small Java program that takes information from a large database, does some processing and produces a detailed image regarding the information. The original author wrote the code using a single thread, then later modified it to allow it to use multiple threads.
In the code he defines a constant;
// number of threads
public static final int THREADS = Runtime.getRuntime().availableProcessors();
Which then sets the number of threads that are used to create the image.
I understand his reasoning that the number of threads cannot be greater than the number of available processors, so set it the the amount to get the full potential out of the processor(s). Is this correct? or is there a better way to utilize the full potential of the processor(s)? | 0 | [
2,
184,
151,
20396,
378,
31,
275,
19,
51,
8247,
625,
60,
800,
3726,
3726,
31,
1989,
7179,
21,
284,
8247,
625,
30,
1384,
676,
37,
21,
370,
6018,
15,
630,
109,
5511,
17,
6700,
21,
6036,
1961,
3467,
14,
676,
9,
14,
501,
1314,
738... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 use WPF's D3DImage with managed DirectX or XNA?
===
I'd really like to get into some D3D coding, but I don't have the time lately to learn C++ for what will amount to a hobby project. | 0 | [
2,
184,
92,
31,
275,
619,
7721,
22,
18,
13,
43,
240,
43,
22039,
29,
1471,
1744,
396,
54,
993,
325,
60,
800,
3726,
3726,
31,
22,
43,
510,
101,
20,
164,
77,
109,
13,
43,
240,
43,
13,
15458,
15,
47,
31,
221,
22,
38,
57,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What font size do you use in your code editor?
===
Not really interested in your actual point size as it depends on resolution and font, but rather if you prefer larger text that is easy to read, or small text so you can overview more lines of code.
Personally, I keep bumping up the size the older I get. Is this something that you also have experienced?
Do your IDE support easy zooming the fontsize? If so, do you use it regularly?
| 0 | [
2,
98,
9978,
1072,
107,
42,
275,
19,
154,
1797,
1835,
60,
800,
3726,
3726,
52,
510,
3158,
19,
154,
3463,
454,
1072,
28,
32,
9597,
27,
4302,
17,
9978,
15,
47,
864,
100,
42,
6369,
1662,
1854,
30,
25,
2010,
20,
1302,
15,
54,
284,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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: Current encoding used to send data to the browser
===
How can I know what encoding will be used by PHP when sending data to the browser? I.e. with the Cotent-Type header, for instance: iso-8859-1. | 0 | [
2,
13,
26120,
45,
866,
19608,
147,
20,
2660,
1054,
20,
14,
16495,
800,
3726,
3726,
184,
92,
31,
143,
98,
19608,
129,
44,
147,
34,
13,
26120,
76,
4907,
1054,
20,
14,
16495,
60,
31,
9,
62,
9,
29,
14,
326,
1316,
38,
8,
4474,
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,
0,
0,
0,
0... |
Can anyone recommend a good Hashtable implementation in Javascript?
===
I've found jCache and some other home-grown methods using associative arrays. If you've had experience with jCache, were there any limitations? | 4 | [
2,
92,
1276,
12360,
21,
254,
19170,
5924,
6123,
19,
8247,
8741,
60,
800,
3726,
3726,
31,
22,
195,
216,
13,
15864,
9616,
17,
109,
89,
213,
8,
16347,
3195,
568,
28,
18,
16325,
3366,
7718,
18,
9,
100,
42,
22,
195,
41,
1496,
29,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
In FinalBuilder, how do I use the HTTP Get File action with Windows Authentication?
===
I have a FinalBuilder project where I deploy an ASP.Net website to a remote folder, configured as a website in IIS.
As part of my build script, I want to use the FinalBuilder action **HTTP Get File** to help determine whether my deployment was succesful.
I'm having difficulty, because the website is configured (under IIS 6) to use Integrated Windows Authentication, and anonymous access is not enabled.
Now the HTTP Get File action, has only a handful of properties, one of which is a security section, containing a UserName and Password. Great I thought! I can just put some valid credentials in there, which FinalBuilder will impersonate, whilst retrieving my file.
It turns out I was mistaken. I receive the following error:
> Error retrieving url : Socket Error # 10061
Connection refused.
If I run the action *without* setting the Security Username and Password, I get the following error:
> Error retrieving url : HTTP/1.1 401 Unauthorized Response Code : 401
Here are some facts to help with the context of my problem.
I'm running FinalBuilder 6 Professional, upon a Windows Server 2003 installation, and deploying my ASP.Net website to a remote IIS6 server within our corporate LAN.
If I configure IIS on the remote server to allow Anonymous access, I can run the HTTP Get File action without error. However, running this particular site with anon access is not acceptable in our situation.
Can anyone help suggest a workaround?
Thanks in advance. | 0 | [
2,
19,
426,
20904,
15,
184,
107,
31,
275,
14,
7775,
164,
3893,
1028,
29,
1936,
27963,
60,
800,
3726,
3726,
31,
57,
21,
426,
20904,
669,
113,
31,
17617,
40,
28,
306,
9,
2328,
2271,
20,
21,
5388,
19294,
15,
28895,
28,
21,
2271,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Setting up Rails to work with sqlserver
===
Ok I followed the steps for setting up ruby and rails on my Vista machine and I am having a problem connecting to the database.
Contents of database.yml
----------
development:
adapter: sqlserver
database: APPS_SETUP
Host: WindowsVT06\SQLEXPRESS
Username: se
Password: paswd
Run rake db:migrate from myapp directory
----------
rake aborted!
no such file to load -- deprecated
**ADO**
----------
I have dbi 0.4.0 installed and have created the ADO folder in
C:\Ruby\lib\ruby\site_ruby\1.8\DBD\ADO
I got the ado.rb from the dbi 0.2.2
What else should I be looking at to fix the issue connecting to the database? Please don't tell me to use MySql or Sqlite or Postgres.
| 0 | [
2,
2697,
71,
2240,
18,
20,
170,
29,
4444,
255,
10321,
106,
800,
3726,
3726,
5854,
31,
709,
14,
2382,
26,
2697,
71,
10811,
17,
2240,
18,
27,
51,
13520,
1940,
17,
31,
589,
452,
21,
1448,
6440,
20,
14,
6018,
9,
8478,
16,
6018,
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... |
Example client implementation for the Service Location Protocol?
===
Does anyone know of a good example implementation of the Service Location Protocol that can be build/ran on a windows box? | 0 | [
2,
823,
6819,
6123,
26,
14,
365,
1474,
8494,
60,
800,
3726,
3726,
630,
1276,
143,
16,
21,
254,
823,
6123,
16,
14,
365,
1474,
8494,
30,
92,
44,
1895,
118,
2195,
27,
21,
1936,
1649,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
update page text using web user control
===
I am building an application where a page will load user controls (x.ascx) dynamically based on query string.
I have a validation summary on the page and want to update it from the User Controls. This will allow me to have multiple controls using one Validation Summary. How can I pass data between controls and pages.
I know I can define the control at design time and use events to do that but these controls are loaded dynamically using Page.LoadControl.
Also, I want to avoid using sessions or querystring. | 0 | [
2,
11100,
2478,
1854,
568,
2741,
4155,
569,
800,
3726,
3726,
31,
589,
353,
40,
3010,
113,
21,
2478,
129,
6305,
4155,
8671,
13,
5,
396,
9,
472,
150,
396,
6,
7782,
1326,
432,
27,
25597,
3724,
9,
31,
57,
21,
27999,
14740,
27,
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... |
I need my html table's body to scroll and it's head to stay put
===
I am writing a page where I need an html table to maintain a set size. I need the headers at the top of the table to stay there at all times but I also need the body of the table to scroll no matter how many rows are added to the table. Think a mini version of excel. This seems like a simple task but almost every solution I have found on the web has some drawback. Does someone have a good solution? | 0 | [
2,
31,
376,
51,
13,
15895,
859,
22,
18,
358,
20,
12159,
17,
32,
22,
18,
157,
20,
1179,
442,
800,
3726,
3726,
31,
589,
1174,
21,
2478,
113,
31,
376,
40,
13,
15895,
859,
20,
4027,
21,
309,
1072,
9,
31,
376,
14,
157,
445,
35,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Installshield, what is the best event to use to launch applications only on install, not on uninstall or repair?
===
We have recently moved back to InstallShield 2008 from rolling our own install. So, I am still trying to get up the learning curve on it.
We are using Firebird and a usb driver, that we couldn't find good msi install solutions. So, we have a cmd line to install firebird silently and the usb driver mostly silently.
We have put this code into the event handler DefaultFeatureInstalled. This works really well on the first time install. But, when I do an uninstall it trys to launch the firebird installer again, so it must be sending the DefaultFeatureInstalled event again.
Is their another event to use, or is there a way to detect whether its an install or uninstall in the DefaultFeatureInstalled event? | 0 | [
2,
19,
16146,
29026,
15,
98,
25,
14,
246,
807,
20,
275,
20,
3394,
3767,
104,
27,
16146,
15,
52,
27,
367,
108,
21300,
54,
5612,
60,
800,
3726,
3726,
95,
57,
1989,
385,
97,
20,
16146,
29026,
570,
37,
3929,
318,
258,
16146,
9,
86... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does the windows FILETIME structure include leap seconds?
===
The FILETIME <http://msdn.microsoft.com/en-us/library/ms724284(VS.85).aspx>
structure counts from January 1 1601 (presuemably the start of that day)
according to the microsoft documentation, but does this include leap seconds? | 0 | [
2,
630,
14,
1936,
3893,
891,
1411,
468,
10336,
2582,
60,
800,
3726,
3726,
14,
3893,
891,
13,
1,
21127,
6903,
79,
18,
43,
103,
9,
22019,
12980,
9,
960,
118,
219,
8,
267,
118,
1210,
2559,
622,
118,
79,
18,
465,
1996,
25110,
5,
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 you like the new Ribbon Controls in D2009?
===
How do they compare to the DevXpress ones or the original MSOffice ones.
Are they worth investing time in them (for practical usage now, not academic curiosity which I'll do anyway)? | 0 | [
2,
184,
107,
42,
101,
14,
78,
9162,
8671,
19,
13,
43,
2849,
60,
800,
3726,
3726,
184,
107,
59,
11590,
20,
14,
9664,
396,
5890,
53,
18,
54,
14,
501,
4235,
17047,
53,
18,
9,
50,
59,
2715,
22999,
85,
19,
105,
13,
5,
1106,
5713,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Preferred protocols to upload static files to your Apache server ?
===
<br><br>If you were the administrator of an Apache web server, what protocol(s) would you prefer to provide, for the web developers to upload static files (html/gif/css/...), with the goal of maximum security ?<br>
If you were the web developer/graphic designer, what protocols would you prefer to be available at the Apache server, to upload static files ?<br>
Thanks!
| 0 | [
2,
5981,
19957,
20,
71,
8294,
12038,
6488,
20,
154,
17140,
8128,
13,
60,
800,
3726,
3726,
13,
1,
5145,
1,
5145,
1,
821,
42,
46,
14,
8890,
16,
40,
17140,
2741,
8128,
15,
98,
8494,
5,
18,
6,
83,
42,
6369,
20,
1181,
15,
26,
14,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to use "macros" in VisualStudio 2008 build events?
===
*[NOTE: This questions is similar to but **not the same** as [this one][1].]*
Visual Studio defines several dozen "Macros" which are sort of simulated environment variables (completely unrelated to C++ macros) which contain information about the build in progress. Examples:
<pre>
ConfigurationName Release
TargetPath D:\work\foo\win\Release\foo.exe
VCInstallDir C:\ProgramFiles\Microsoft Visual Studio 9.0\VC\
</pre>
The user can also define "Macros". These "Macros" are useful in setting other build properties.
I use a Post-Build Event to run a python script as part of my C++ build process. I'd like to pass the entire set of "Macros" to my script but I don't know how. Within my script I can access regular environment variables (e.g., Path, SystemRoot) but NOT these "Macros". All I can do now is pass them on-by-one as named options which I then process within my script. For example, this is what my Post-Build Event command line looks like:
<pre>
postbuild.py --t="$(TargetPath)" --c="$(ConfigurationName)"
</pre>
Besides being a pain in the neck, there is a limit on the size of Post-Build Event command line so I can't pass the over forty "Macros" using this method even if I wanted to.
Does anyone know if there is a solution to my problem that does NOT require switching to MSBuild (which I believe is not available for native VC++) or some other make-like build tool?
[1]: http://stackoverflow.com/questions/128634/how-to-use-system-environment-variables-in-vs-2008-post-build-events | 0 | [
2,
184,
20,
275,
13,
7,
6893,
3171,
7,
19,
3458,
21026,
570,
1895,
963,
60,
800,
3726,
3726,
1637,
2558,
10280,
45,
48,
2346,
25,
835,
20,
47,
13,
1409,
1270,
14,
205,
1409,
28,
636,
1565,
53,
500,
2558,
165,
500,
9,
500,
2483... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to implement a company-internal icon gallery
===
I love writing my own web-based applications, but don't want to succumb to the <em>not invented here syndrome.</em> So before I go write this myself, I'm looking for solutions that either do this, or perhaps frameworks (like Django or Joomla, etc.) that give me a starting point fairly close to what I need.
<p>
My company produces software with a large variety of user interfaces. We've decided to keep an <b>icon database</b> where one can search for icons by size, keyword, etc, track there they've been used so far, upload them, browse them, etc.
<p>
I've toyed with the idea of starting with an "image gallery" (Gallery, Coppermine, 4homepages, etc) but I was hoping for something that allows us to track <b>versions</b> of the icons, like we do for all our other source files, and I'm sure the attributes we track alongside each icon will expand over time, so it needs to be easily extensible.
<p>
So what do people suggest I use as a solution or starting point for a solution? | 0 | [
2,
184,
20,
8713,
21,
237,
8,
6280,
5025,
9801,
2246,
800,
3726,
3726,
31,
339,
1174,
51,
258,
2741,
8,
1281,
3767,
15,
47,
221,
22,
38,
259,
20,
26968,
20,
14,
13,
1,
1503,
1,
1270,
8854,
235,
8404,
9,
1,
118,
1503,
1,
86,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is Continuous Integration important for a solo developer?
===
I've never used CI tools before, but from what I've read, I'm not sure it would provide any benefit to a solo developer that isn't writing code every day.
First - what benefits does CI provide to any project?
Second - who should use CI? Does it benefit all developers? | 0 | [
2,
25,
6357,
8078,
681,
26,
21,
2046,
10058,
60,
800,
3726,
3726,
31,
22,
195,
243,
147,
5486,
4672,
115,
15,
47,
37,
98,
31,
22,
195,
1302,
15,
31,
22,
79,
52,
562,
32,
83,
1181,
186,
4234,
20,
21,
2046,
10058,
30,
2532,
22... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Looking for a .NET Function that sums up number and instead of overflowing simply returns int.MaxValue
===
I use int.MaxValue as a penalty and sometimes I am computing the penalties together. Is there a function or how would you create one with the most grace and efficiency that does that.
ie.
50 + 100 = 150
int.Max + 50 = int.Max and not int.Min + 50
| 0 | [
2,
699,
26,
21,
13,
9,
2328,
1990,
30,
3907,
18,
71,
234,
17,
700,
16,
20285,
68,
1659,
4815,
19,
38,
9,
8304,
15165,
800,
3726,
3726,
31,
275,
19,
38,
9,
8304,
15165,
28,
21,
5530,
17,
1030,
31,
589,
10626,
14,
13794,
429,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 LINQ (to SQL) do bitwise queries?
===
I have a table of Users that includes a bitmask of roles that the user belongs to. I'd like to select users that belong to one or more of the roles in a bitmask value. For example:
<pre>select *
from [User]
where UserRolesBitmask | 22 = 22</pre>
This selects all users that have the roles '2', '4' or '16' in their bitmask. Is this possible to express this in a LINQ query? Thanks.
| 0 | [
2,
92,
6294,
1251,
13,
5,
262,
4444,
255,
6,
107,
1142,
10474,
9386,
2829,
60,
800,
3726,
3726,
31,
57,
21,
859,
16,
3878,
30,
1103,
21,
1142,
23265,
16,
2954,
30,
14,
4155,
7034,
20,
9,
31,
22,
43,
101,
20,
5407,
3878,
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... |
Change cardinality of item in C# dictionary
===
I've got a dictionary, something like
Dictionary<Foo,String> fooDict
I step through everything in the dictionary, e.g.
foreach (Foo foo in fooDict.Keys)
MessageBox.show(fooDict[foo]);
It does that in the order the foos were added to the dictionary, so the first item added is the first foo returned.
How can I change the cardinality so that, for example, the third foo added will be the second foo returned? In other words, I want to change its "index." | 0 | [
2,
753,
5967,
856,
16,
9101,
19,
272,
5910,
9186,
800,
3726,
3726,
31,
22,
195,
330,
21,
9186,
15,
301,
101,
9186,
1,
4120,
111,
15,
11130,
1,
950,
596,
38,
31,
1424,
120,
796,
19,
14,
9186,
15,
13,
62,
9,
263,
9,
26,
14322,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Starting service as a user with no password
===
I'm trying to start a service as a user and things work fine, until I try a user that doesn't have a password. Then, it fails to start (due to log-on error).
Am I doing something wrong or is this "by design"?
The code to register this service:
SC_HANDLE schService = CreateService(
schSCManager,
strNameNoSpaces,
strServiceName,
SERVICE_ALL_ACCESS,
SERVICE_WIN32_OWN_PROCESS,
SERVICE_AUTO_START,
SERVICE_ERROR_NORMAL,
szPath,
NULL,
NULL,
NULL,
strUser,
(strPassword.IsEmpty())?NULL:strPassword);
Thanks in advance for any insight into this. | 0 | [
2,
1422,
365,
28,
21,
4155,
29,
90,
20884,
800,
3726,
3726,
31,
22,
79,
749,
20,
799,
21,
365,
28,
21,
4155,
17,
564,
170,
1123,
15,
163,
31,
1131,
21,
4155,
30,
1437,
22,
38,
57,
21,
20884,
9,
94,
15,
32,
13614,
20,
799,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you check for permissions to write to a directory or file
===
I got a program that writes some data to a file using a method like the one below.
<pre><code>
public void ExportToFile(string filename)
{
using(FileStream fstream = new FileStream(filename,FileMode.Create))
using (TextWriter writer = new StreamWriter(fstream))
{
// try catch block for write permissions
writer.WriteLine(text);
}
}
</code></pre>
When running the program I get an error:
<pre>
Unhandled Exception: System.UnauthorizedAccessException: Access to the path 'mypath' is denied.
at System.IO.__Error.WinIOError(Int32 errorCode, String maybeFullPath)
at System.IO.FileStream.Init(String path, FileMode mode, FileAccess access,
nt32 rights, Boolean useRights, FileShare share, Int32 bufferSize, FileOptions
ptions, SECURITY_ATTRIBUTES secAttrs, String msgPath, Boolean bFromProxy)
at System.IO.FileStream..ctor(String path, FileMode mode, FileAccess access
FileShare share, Int32 bufferSize, FileOptions options, String msgPath, Boolea
bFromProxy)
</pre>
Question: What code do I need to catch this and how do I grant the access? | 0 | [
2,
184,
107,
42,
2631,
26,
5572,
18,
20,
2757,
20,
21,
16755,
54,
3893,
800,
3726,
3726,
31,
330,
21,
625,
30,
6215,
109,
1054,
20,
21,
3893,
568,
21,
2109,
101,
14,
53,
1021,
9,
13,
1,
3515,
1,
9375,
1,
317,
11364,
7487,
26... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Python Date Comparisons
===
I would like to find out if a particular python datetime object is older than X hours or minutes. I am trying to do something similar to:
if (datetime.now() - self.timestamp) > 100
# Where 100 is either seconds or minutes
but this obviously gives a type error. So my question is what is the proper way to do date time comparison in python? I already looked at [WorkingWithTime](http://wiki.python.org/moin/WorkingWithTime) which is close but not exactly what I want. I assume I just want the datetime object represented in seconds so that I can do a normal int comparison. Please post lists of datetime best practices as well... | 0 | [
2,
20059,
1231,
6050,
18,
800,
3726,
3726,
31,
83,
101,
20,
477,
70,
100,
21,
1498,
20059,
1231,
891,
3095,
25,
1234,
119,
993,
974,
54,
902,
9,
31,
589,
749,
20,
107,
301,
835,
20,
45,
100,
13,
5,
8209,
891,
9,
1387,
5,
6,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to compile Clisp 2.46?
===
When I try to compile the newest version of Clisp on Ubuntu 8.04 I always get this error after running configure:
Configure findings:
FFI: no (user requested: default)
readline: yes (user requested: yes)
libsigsegv: no, consider installing GNU libsigsegv
./configure: libsigsegv was not detected, thus some features, such as
generational garbage collection and
stack overflow detection in interpreted Lisp code
cannot be provided.
Please do this:
mkdir tools; cd tools; prefix=`pwd`/i686-pc-linux-gnu
wget http://ftp.gnu.org/pub/gnu/libsigsegv/libsigsegv-2.5.tar.gz
tar xfz libsigsegv-2.5.tar.gz
cd libsigsegv-2.5
./configure --prefix=${prefix} && make && make check && make install
cd ../..
./configure --with-libsigsegv-prefix=${prefix} --with-readline --with-unicode --with-module=i18n --with-module=gdbm --with-module=pcre --with-module=readline --with-module=regexp
If you insist on building without libsigsegv, please pass
--ignore-absence-of-libsigsegv
to this script:
./configure --ignore-absence-of-libsigsegv --with-readline --with-unicode --with-module=i18n --with-module=gdbm --with-module=pcre --with-module=readline --with-module=regexp
I've tried doing as requested, but it didn't help: it seems to ignore the `--with-libsigsegv-prefix` option. I also tried putting installing libsigsegv in a standard location (`/usr/local`). Oh, and of course, Ubuntu tells me that libsigsegv and libsigsegv-dev are installed in the system.
I'd really like to be able to compile this version of Clips, as it introduces some serious improvements over the version shipped with Ubuntu (I'd also like to have PCRE). | 0 | [
2,
184,
20,
26561,
19391,
3401,
172,
9,
3516,
60,
800,
3726,
3726,
76,
31,
1131,
20,
26561,
14,
17175,
615,
16,
19391,
3401,
27,
287,
12968,
2473,
469,
9,
3277,
31,
550,
164,
48,
7019,
75,
946,
1065,
15951,
45,
1065,
15951,
10172,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a reasonable way to implement a cd command on VMS?
===
I would like to be able to say things like
**cd [.fred]** and have my default directory go there,
and my prompt change to indicate the full path to my current location. | 0 | [
2,
25,
80,
21,
9954,
161,
20,
8713,
21,
1745,
1202,
27,
13,
20147,
18,
60,
800,
3726,
3726,
31,
83,
101,
20,
44,
777,
20,
395,
564,
101,
13,
1409,
6324,
636,
9,
16724,
500,
1409,
17,
57,
51,
12838,
16755,
162,
80,
15,
17,
51... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0... |
Combining two executables
===
I have a command line executable that alters some bits in a file that i want to use from my program.
Is it possible to create my own executable that uses this tool and distribute only one executable? | 0 | [
2,
12803,
81,
1396,
17194,
5924,
18,
800,
3726,
3726,
31,
57,
21,
1202,
293,
1396,
17194,
5924,
30,
7835,
18,
109,
10181,
19,
21,
3893,
30,
31,
259,
20,
275,
37,
51,
625,
9,
25,
32,
938,
20,
1600,
51,
258,
1396,
17194,
5924,
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,
0,
0,
0,
0,
0,
0... |
How do you protect quotes in a batch file
===
I want to wrap a perl one-liner in a batch file. For (trivial) example, in a unix shell I could quote up a command like this:
perl -e 'print localtime() . "\n"'
But DOS chokes on that with the helpful
> Can't find string terminator "'" anywhere before EOF at -e line 1.
What's the best way to do this within a .bat? | 0 | [
2,
184,
107,
42,
2196,
18901,
19,
21,
13064,
3893,
800,
3726,
3726,
31,
259,
20,
8118,
21,
416,
255,
53,
8,
14813,
19,
21,
13064,
3893,
9,
26,
13,
5,
19712,
6,
823,
15,
19,
21,
22540,
3593,
31,
110,
16371,
71,
21,
1202,
101,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 access Control.ViewState with a dynamically added Control subclass?
===
We have created a control that needs to persist data via the ViewState property of the Control class. Our class subclasses control strictly to get access to the ViewState property (it's protected on the Page object). We are adding the control to Page.Controls in OnInit, and then attempt to set the ViewState property in OnPreLoad.
When we decode and examine the ViewState of the page, our values have not been written out, and are thus not available for later retrieval.
Does anyone know how we can get our control to participate in the ViewState process? | 0 | [
2,
184,
107,
42,
1381,
569,
9,
4725,
3859,
29,
21,
7782,
1326,
905,
569,
972,
1898,
60,
800,
3726,
3726,
95,
57,
679,
21,
569,
30,
2274,
20,
22084,
1054,
1197,
14,
1418,
3859,
1354,
16,
14,
569,
718,
9,
318,
718,
972,
1898,
16... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Expanding a Region will expand children in Visual Studio
===
I am developing an ASP.NET Ajax form, and decided to make most of the site in one page, because it isn't a very involved site (it's more of a form). In the codebehind, I have been making my code more organized by adding regions to it (inside are the click events of the controls, etc).
When I expand a region, all the subroutines and child regions are expanded. Is there an option in Visual Studio to prevent this from happening? I'd like to be able to expand a region, and then expand the region or subroutine I'd like to edit, rather than contracting all the subroutines and child regions to prevent me from getting distracted by my fat code. :) | 0 | [
2,
9393,
21,
632,
129,
6073,
391,
19,
3458,
1120,
800,
3726,
3726,
31,
589,
3561,
40,
28,
306,
9,
2328,
20624,
505,
15,
17,
868,
20,
233,
127,
16,
14,
689,
19,
53,
2478,
15,
185,
32,
2532,
22,
38,
21,
253,
1013,
689,
13,
5,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How long would it take to setup a new CI repository?
===
I wonder how long it would usually take for:
1. Professional
2. Average
3. Beginner
to setup and configure CI for a new project? | 0 | [
2,
184,
175,
83,
32,
247,
20,
18161,
21,
78,
5486,
24869,
60,
800,
3726,
3726,
31,
2666,
184,
175,
32,
83,
951,
247,
26,
45,
137,
9,
736,
172,
9,
862,
203,
9,
26931,
20,
18161,
17,
1065,
15951,
5486,
26,
21,
78,
669,
60,
3,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Flex events when the parent isn't common
===
In certain cases, I can't seem to get components to receive events.
If two components have differing parents, or as in the example below, one is a popup, it would seem the event never reaches the listener (See the method "popUp" for the dispatch that doesn't work):
<?xml version="1.0" encoding="utf-8"?>
<mx:Application xmlns:mx="http://www.adobe.com/2006/mxml"
layout="absolute"
initialize="init()">
<mx:Script>
<![CDATA[
import mx.controls.Menu;
import mx.managers.PopUpManager;
// Add listeners
public function init():void
{
this.addEventListener("child", handleChild);
this.addEventListener("stepchild", handleStepchild);
}
// Handle the no pop button event
public function noPop(event:Event):void
{
dispatchEvent(new Event("child"));
}
// Handle the pop up
public function popUp(event:Event):void
{
var menu:Menu = new Menu();
var btnMenu:Button = new Button();
btnMenu.label = "stepchild";
menu.addChild(btnMenu);
PopUpManager.addPopUp(menu, this);
// neither of these work...
this.callLater(btnMenu.dispatchEvent, [new Event("stepchild", true)]);
btnMenu.dispatchEvent(new Event("stepchild", true));
}
// Event handlers
public function handleChild(event:Event):void
{
trace("I handled child");
}
public function handleStepchild(event:Event):void {
trace("I handled stepchild");
}
]]>
</mx:Script>
<mx:VBox>
<mx:Button label="NoPop" id="btnNoPop" click="noPop(event)"/>
<mx:Button label="PopUp" id="btnPop" click="popUp(event)"/>
</mx:VBox>
</mx:Application>
I can think of work-arounds, but it seems like there ought to be some central event bus...
Am I missing something?
| 0 | [
2,
14409,
963,
76,
14,
4766,
2532,
22,
38,
757,
800,
3726,
3726,
19,
1200,
1871,
15,
31,
92,
22,
38,
2260,
20,
164,
5090,
20,
2588,
963,
9,
100,
81,
5090,
57,
19304,
1144,
15,
54,
28,
19,
14,
823,
1021,
15,
53,
25,
21,
1675,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Impersonating a User in Asp.Net
===
My DBA requires all database access to be done through trusted domain account. This can be done if you set the web.config <identity impersonate="true" /> . This requires the user to login or to be on the domain for IE pass the credentials through. I want to impersonate a user by using code. I am using the code found in this knowledgebase article:
[http://support.microsoft.com/kb/306158][1]
It works great, I pass in the credentials, impersonate the user, then make the call to the database and data is returned.
The problem is if I go to another page, I lose my impersonated credentials. This means every time I make a call to the database I have to run the impersonate code.
If IIS can impersonate a domain user for all pages, then why can I not impersonate a user while using code?
It seems to be something with thread context switching. I have tried setting the alwaysFlowImpersonatingPolicy <alwaysFlowImpersonationPolicy enabled="true"/> in the Aspnet.config file and it did not work.
[http://msdn.microsoft.com/en-us/library/ms229553.aspx][2]
Any suggestion? Is it even possible to do what I want?
[1]: http://support.microsoft.com/kb/306158
[2]: http://msdn.microsoft.com/en-us/library/ms229553.aspx | 0 | [
2,
797,
7276,
1880,
21,
4155,
19,
28,
306,
9,
2328,
800,
3726,
3726,
51,
13,
43,
969,
4781,
65,
6018,
1381,
20,
44,
677,
120,
9968,
4603,
2176,
9,
48,
92,
44,
677,
100,
42,
309,
14,
2741,
9,
14093,
2816,
13,
1,
13384,
856,
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 to unit test immutable class constructors?
===
I have an immutable class with some private fields that are set during the constructor execution. I want to unit test this constructor but I'm not sure the "best practice" in this case.
**Simple Example**
This class is defined in Assembly1:
public class Class2Test
{
private readonly string _StringProperty;
public Class2Test(string stringProperty)
{
_StringProperty = stringProperty;
}
}
This class is defined in Assembly2:
[TestClass]
public class TestClass
{
[TestMethod]
public void Class2Test_Default_Constructor()
{
Class2Test x = new Class2Test("something");
//what do I assert to validate that the field was set properly?
}
}
**EDIT**: I have answered this question with a potential solution but I'm not sure if it's the "right way to go". So if you think you have a better idea please post it. | 0 | [
2,
184,
20,
1237,
1289,
797,
7903,
579,
718,
6960,
248,
18,
60,
800,
3726,
3726,
31,
57,
40,
797,
7903,
579,
718,
29,
109,
932,
2861,
30,
50,
309,
112,
14,
6960,
248,
5769,
9,
31,
259,
20,
1237,
1289,
48,
6960,
248,
47,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can one close html tags in vim quickly
===
It's been a while since I've had to do any html-like code in vim, but recently I came across this again. Say I'm doing a simple bit of a html page:
<html><head><title>This is a title</title></head></html>
How do I write those closing tags for title, head and html down quickly? I feel like I'm missing some really simple way here that does not involve me going through writing them all down one by one. Of course I can use ^P to autocomplete the individual tag names but what gets me on my laptop keyboard is actually getting the brackets and slash right. | 0 | [
2,
184,
92,
53,
543,
13,
15895,
3383,
18,
19,
1790,
79,
976,
800,
3726,
3726,
32,
22,
18,
74,
21,
133,
179,
31,
22,
195,
41,
20,
107,
186,
13,
15895,
8,
1403,
1797,
19,
1790,
79,
15,
47,
1989,
31,
281,
464,
48,
188,
9,
395... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Link error when compiling gcc atomic operation in 32-bit mode
===
I have the following program:
~/test> cat test.cc
int main()
{
int i = 3;
int j = __sync_add_and_fetch(&i, 1);
return 0;
}
I'm compiling this program using GCC 4.2.2 on Linux running on a multi-cpu 64-bit Intel machine:
~/test> uname --all
Linux doom 2.6.9-67.ELsmp #1 SMP Wed Nov 7 13:56:44 EST 2007 x86_64 x86_64 x86_64 GNU/Linux
When I compile the program in 64-bit mode, it compiles and links fine:
~/test> /share/tools/gcc-4.2.2/bin/g++ test.cc
~/test>
When I compile it in 32-bit mode, I get the following error:
~/test> /share/tools/gcc-4.2.2/bin/g++ -m32 test.cc
/tmp/ccEVHGkB.o(.text+0x27): In function `main':
: undefined reference to `__sync_add_and_fetch_4'
collect2: ld returned 1 exit status
~/test>
Although I will never actually run on a 32-bit processor, I do need a 32-bit executable so I can link with some 32-bit libraries.
My 2 questions are:
1. Why do I get a link error when I compile in 32-bit mode?
2. Is there some way to get the program to compile and link, while still being able to link with a 32-bit library?
| 0 | [
2,
3508,
7019,
76,
24378,
489,
3384,
9692,
1453,
19,
2512,
8,
3326,
3740,
800,
3726,
3726,
31,
57,
14,
249,
625,
45,
13,
1,
118,
10543,
1,
2008,
1289,
9,
3384,
19,
38,
407,
5,
6,
13,
1,
19,
38,
31,
800,
203,
73,
19,
38,
48... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way to swap two .NET controls based on radio buttons
===
I've got a form where I have two radio buttons and two interchangeable controls (made up of a ListView and a handful of buttons). Based on which radio button is selected I want to display the proper control to the user.
The way I'm doing this now is just loading both controls and setting up an OnRadioButtonSelectionChanged() method which gets called at form load (to set the initial state) and at any time the selection is changed. This method just sets the visible property on each control to the proper value.
This seems to work well enough, but I was curious as to if there was a better or more common way of doing it? | 0 | [
2,
246,
161,
20,
17150,
81,
13,
9,
2328,
8671,
432,
27,
603,
12861,
800,
3726,
3726,
31,
22,
195,
330,
21,
505,
113,
31,
57,
81,
603,
12861,
17,
81,
6617,
579,
8671,
13,
5,
5781,
71,
16,
21,
968,
4725,
17,
21,
8893,
16,
1286... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Last time a Stored Procedure was executed
===
On Sql Server 2000, is there a way to find out the date and time when a stored procedure was last executed? | 0 | [
2,
236,
85,
21,
8214,
7004,
23,
5557,
800,
3726,
3726,
27,
4444,
255,
8128,
824,
15,
25,
80,
21,
161,
20,
477,
70,
14,
1231,
17,
85,
76,
21,
8214,
7004,
23,
236,
5557,
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,
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... |
Request UAC elevation from within a Python script?
===
I want my Python script to copy files on Vista. When I run it from a normal `cmd.exe` window, no errors are generated, yet the files are NOT copied. If I run `cmd.exe` "as administator" and then run my script, it works fine.
This makes sense since UAC normally prevents many file system actions.
Is there a way I can, from within a Python script, invoke a UAC elevation request (those dialogs that say something like "such and such app needs admin access, is this OK?")
If that's not possible, is there a way my script can at least detect that it is not elevated so it can fail gracefully? | 0 | [
2,
3772,
287,
1738,
4960,
37,
363,
21,
20059,
3884,
60,
800,
3726,
3726,
31,
259,
51,
20059,
3884,
20,
4344,
6488,
27,
13520,
9,
76,
31,
485,
32,
37,
21,
1826,
13,
1,
9095,
43,
9,
1706,
62,
1,
1463,
15,
90,
11908,
50,
6756,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 i unnacceptable?
===
As far as variable naming conventions go, should iterators be named *i* or something more semantic like *count*? If you don't use *i*, why not? | 0 | [
2,
25,
31,
367,
103,
28050,
579,
60,
800,
3726,
3726,
28,
463,
28,
7612,
10929,
15117,
162,
15,
378,
32,
106,
9922,
44,
377,
1637,
49,
2483,
54,
301,
91,
17220,
101,
1637,
16549,
2483,
60,
100,
42,
221,
22,
38,
275,
1637,
49,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Can you use Decision Tables in Relational Databases
===
I heard that decision tables in relational database have been researched a lot in academia. I also know that business rules engines use decision tables and that many BPMS use them as well.
I was wondering if people today use decision tables within their relational databases? | 0 | [
2,
92,
42,
275,
1401,
7484,
19,
5827,
192,
6018,
18,
800,
3726,
3726,
31,
752,
30,
1401,
7484,
19,
5827,
192,
6018,
57,
74,
527,
69,
21,
865,
19,
19450,
9,
31,
67,
143,
30,
508,
1761,
4016,
275,
1401,
7484,
17,
30,
151,
17308,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 dependency injection?
===
There have been several questions already posted with specific questions about dependency injection, such as when to use it, what frameworks are there for it. However, here's the newbie question:
What is dependency injection and when/why should or shouldn't it be used?
Edit: While external links for followup reading are always appreciated, I'd like to encourage people to write as complete an answer here as possible, so that SO itself can be a good source to learn. I believe this is the intent of the site. | 0 | [
2,
98,
25,
26835,
13646,
60,
800,
3726,
3726,
80,
57,
74,
238,
2346,
614,
6054,
29,
1903,
2346,
88,
26835,
13646,
15,
145,
28,
76,
20,
275,
32,
15,
98,
6596,
18,
50,
80,
26,
32,
9,
207,
15,
235,
22,
18,
14,
78,
5893,
1301,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Data visualization in desktop applications
===
I would like to create data visualizations in desktop apps, using frameworks, languages and libraries that help with this kind of task. Visualizations should be interactive: clickable, draggable, customizable, animated...
What I would like to create is something similar to the examples seen here: http://www.visualcomplexity.com/vc/
These are the links I already know: http://delicious.com/laura_laura/visualization?setcount=100
The preferred language is C++/Visual C++ (MFC) because I'm familiar with it, but any other technology is welcome, I would like to make a list from "as similar as possible" to Visual C++ to "very different" from Visual C++.
WPF, flex, Adobe Air, flare, Javascript (running in a browser as client-side apps with access to local files or as desktop apps) are possibilities, post any good links to examples, tutorials, how-tos, etc. that you know of.
What are the learning curves and complexity for the different options? Wich one would you choose and why? Wich one have you already worked with and how was your experience? How would you start with a project of this characteristics? | 0 | [
2,
1054,
28873,
19,
17404,
3767,
800,
3726,
3726,
31,
83,
101,
20,
1600,
1054,
28873,
18,
19,
17404,
4865,
18,
15,
568,
6596,
18,
15,
2556,
17,
8649,
30,
448,
29,
48,
825,
16,
3005,
9,
28873,
18,
378,
44,
9194,
45,
10840,
579,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you create tests for "make check" with GNU autotools
===
I'm using GNU autotools for the build system on a particular project. I want to start writing automated tests for verifcation. I would like to just type "make check" to have it automatically run these. My project is in C++, although I am still curious about writing automated tests for other languages as well.
*Is this compatible with pretty much every unit testing framework out there (I was thinking of using cppunit)? How do I hook these unit testing frameworks into make check? Can I make sure that I don't require the unit test software to be installed to be able to configure and build the rest of the project?* | 0 | [
2,
184,
107,
42,
1600,
4894,
26,
13,
7,
11115,
2631,
7,
29,
26092,
3108,
20799,
18,
800,
3726,
3726,
31,
22,
79,
568,
26092,
3108,
20799,
18,
26,
14,
1895,
329,
27,
21,
1498,
669,
9,
31,
259,
20,
799,
1174,
14904,
4894,
26,
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... |
VB.NET - Application has encountered a user-defined breakpoint
===
I'm not that up on VB.NET, the application I'm working on was not written by myself.
It works fine through the IDE but once I run it from the exe it gives me the above error.
Any clues?
This is really hacking me off! | 0 | [
2,
13,
20468,
9,
2328,
13,
8,
3010,
63,
8208,
21,
4155,
8,
13439,
1442,
3132,
800,
3726,
3726,
31,
22,
79,
52,
30,
71,
27,
13,
20468,
9,
2328,
15,
14,
3010,
31,
22,
79,
638,
27,
23,
52,
642,
34,
992,
9,
32,
693,
1123,
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... |
Performance penalty on putting classes in aspx and ascx codebehinds
===
What's the performance penalty on defining classes in an aspx/ascx codebehind rather than compiling them into a dll beforehand? I know that this isn't a best practice and that there are numerous problems with this (e.g. difficult to unit test, code is not reusable, etc.), but it does come in very handy when you're dealing with classes that need to be modified on the fly several times a day since those modifications will not require any sort of app restart (e.g. App_Code changes, updating dlls in bin folder). | 0 | [
2,
956,
5530,
27,
3873,
2684,
19,
28,
306,
396,
17,
28,
150,
396,
1797,
24878,
18,
800,
3726,
3726,
98,
22,
18,
14,
956,
5530,
27,
14684,
2684,
19,
40,
28,
306,
396,
118,
472,
150,
396,
1797,
24878,
864,
119,
24378,
105,
77,
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... |
Write VB6 on Visual Studio 2008 without Dot Net support?
===
I have to continue to support VB6 applications. I've got both VB6 (Visual Studio 6) installed and Visual Studio 2008 as well. Can I read and write to VB6 projects while in Visual Studio 2008? Will it damage or destroy my VB6 application? It would be very cool if I could free up a lot of space and get rid of VS6. | 0 | [
2,
2757,
13,
20468,
379,
27,
3458,
1120,
570,
366,
14123,
4275,
555,
60,
800,
3726,
3726,
31,
57,
20,
1816,
20,
555,
13,
20468,
379,
3767,
9,
31,
22,
195,
330,
156,
13,
20468,
379,
13,
5,
20893,
1120,
400,
6,
4066,
17,
3458,
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's the (JavaScript) Regular Expression I should use to ensure a string is a valid file name?
===
I'm still learning RegEx at the moment, but for the time being could someone help me out with this? I have a few special requirements for formatting the string:
1. No directories. JUST the file name.
2. File name needs to be all lowercase.
3. Whitespaces need to be replaced with underscores.
Shouldn't be hard, but I'm pressed for time and I'm not sure on the 'correct' way to ensure a valid file name (namely I forget which characters were supposed to be invalid for file names). | 0 | [
2,
98,
22,
18,
14,
13,
5,
1004,
1385,
8741,
6,
1290,
1803,
31,
378,
275,
20,
4062,
21,
3724,
25,
21,
7394,
3893,
204,
60,
800,
3726,
3726,
31,
22,
79,
174,
2477,
7953,
1706,
35,
14,
688,
15,
47,
26,
14,
85,
142,
110,
737,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 add a <table> using Element with Prototype in IE6?
===
Using Prototype 1.6's "new Element(...)" I am trying to create a <table> element with both a <thead> and <tbody> but nothing happens in IE6.
var tableProto = new Element('table').update('<thead><tr><th>Situation Task</th><th>Action</th><th>Result</th></tr></thead><tbody><tr><td>a</td><td>b</td><td>c</td></tr></tbody>');
I'm then trying to inject copies of it like this:
$$('div.question').each(function(o) {
Element.insert(o, { after:$(tableProto.cloneNode(true)) });
});
My current workaround is to create a <div> instead of a <table> element, and then "update" it with all of the table HTML.
How does one successfully do this? | 2 | [
2,
184,
107,
31,
3547,
21,
13,
1,
5924,
1,
568,
4520,
29,
7063,
19,
13,
660,
379,
60,
800,
3726,
3726,
568,
7063,
137,
9,
379,
22,
18,
13,
7,
2681,
4520,
5,
9,
9,
9,
6,
7,
31,
589,
749,
20,
1600,
21,
279,
255,
38,
73,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are some good resource for learning Objective-C?
===
I've been using Objective-C for about 6 months, and have a good grasp on the basic concepts. What are some resources (websites, PDFs, Books, Blogs, etc) to advance past this level? | 0 | [
2,
98,
50,
109,
254,
6577,
26,
2477,
7038,
8,
150,
60,
800,
3726,
3726,
31,
22,
195,
74,
568,
7038,
8,
150,
26,
88,
400,
818,
15,
17,
57,
21,
254,
10677,
27,
14,
2125,
8700,
9,
98,
50,
109,
2566,
13,
5,
14113,
18,
6359,
15... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can PHP handle enterprise level sites as well as Java
===
PLEASE NO FLAMING!
I really would love a few objective opinions about the issue. I have a project that has been strongly developed in PHP but have clients that are concerned that Java would be a better solution. I know sites such as Flickr and Digg are run on PHP, but I am concerned that PHP's lack of a running environment may destroy my project.
Example. PHP (that I know of) does not have an easy way to fork another process, nor is there an easy way to start a deamon to run background processes (cron jobs are a little ugly).
I would hate to rewrite a great piece of software, so I am in need of some solid advice. | 0 | [
2,
92,
13,
26120,
3053,
6002,
662,
3259,
28,
134,
28,
8247,
800,
3726,
3726,
2247,
90,
18525,
187,
31,
510,
83,
339,
21,
310,
7038,
11900,
88,
14,
1513,
9,
31,
57,
21,
669,
30,
63,
74,
5020,
885,
19,
13,
26120,
47,
57,
7421,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 determine Daylight Savings Time in VBA?
===
What function will let us know whether a date in VBA is in DST or not? | 0 | [
2,
184,
107,
42,
3746,
12344,
12135,
85,
19,
566,
969,
60,
800,
3726,
3726,
98,
1990,
129,
408,
182,
143,
1472,
21,
1231,
19,
566,
969,
25,
19,
13,
43,
384,
54,
52,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Global or Singleton for database connection?
===
What is the benefit of using singleton instead of global for database connections in PHP? I feel using singleton instead of global makes the code unnecessarily complex.
Code with Global
----------------
$conn = new PDO(...);
function getSomething()
{
global $conn;
.
.
.
}
Code with Singleton
-------
class DB_Instance
{
private static $db;
public static function getDBO()
{
if (!self::$db)
self::$db = new PDO(...);
return self::$db;
}
}
function getSomething()
{
$conn = DB_Instance::getDBO();
.
.
.
}
| 0 | [
2,
2062,
54,
345,
444,
26,
6018,
2760,
60,
800,
3726,
3726,
98,
25,
14,
4234,
16,
568,
345,
444,
700,
16,
2062,
26,
6018,
6760,
19,
13,
26120,
60,
31,
583,
568,
345,
444,
700,
16,
2062,
1364,
14,
1797,
367,
556,
5052,
18,
1896... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 build a Debian/Ubuntu package from source?
===
I have the source of a program (taken from cvs/svn/git/...) and I'd like to build a Debian/Ubuntu package for it. The package is present in the repositories, but:
* It is an older version (lacking features I need)
* I need slightly different compile options than the default.
What is the easiest way of doing it? I am concerned about a couple of things
* How can I check if I have listed all the dependencies correctly? (I can get some hints by looking on what the older version depended, but new dependencies may have been added.)
* How I can I prevent the update system installing the older version in the repo on an update?
* How I can prevent the system installing a newer version (when its out), overwriting my custom package? | 0 | [
2,
184,
20,
1895,
21,
121,
10035,
118,
4502,
1020,
2473,
6030,
37,
1267,
60,
800,
3726,
3726,
31,
57,
14,
1267,
16,
21,
625,
13,
5,
4386,
103,
37,
13,
12732,
18,
118,
18,
16578,
118,
10404,
118,
9,
9,
9,
6,
17,
31,
22,
43,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Introductiont o C# list comprehensions
===
What is a good introduction or tutorial article for learning how to use list comprehensions in C#? | 0 | [
2,
3445,
38,
635,
272,
5910,
968,
27300,
18,
800,
3726,
3726,
98,
25,
21,
254,
3445,
54,
29724,
2002,
26,
2477,
184,
20,
275,
968,
27300,
18,
19,
272,
5910,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Keeping a file in the OS block buffer
===
I need to keep a special file in the operating system block cache, and making it skip caching a file that I'm streaming from HD. I wonder if this is possible somewhere, or do I have to make my own RAM cache, to keep the filesystem from using up my RAM with useless data? I don't care what OS or language you are using, if you know anyway todo this I'm fine with that.
I'm parsing [Wikipedia][1], and save some things in a lookup DB on disk, and other things in a result file. The lookup DB is around 5GB which I can't fit in memory, but I would like the operating system to cache as much as it can of this file. At the moment I stream the big file gziped from a webserver, and that is consideribly faster than reading it from a local disk. (the cpu and memory is the bottle neck not the bandwidth)
[1]: http://download.wikimedia.org/enwiki/latest/ | 0 | [
2,
2882,
21,
3893,
19,
14,
13,
759,
1921,
17497,
800,
3726,
3726,
31,
376,
20,
643,
21,
621,
3893,
19,
14,
2455,
329,
1921,
16522,
15,
17,
544,
32,
12532,
1658,
7192,
21,
3893,
30,
31,
22,
79,
11920,
37,
8590,
9,
31,
2666,
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... |
Design & Coding - top to bottom or bottom to top?
===
When coding, what in your experience is a better approach?
1. Break the problem down into small enough pieces and then implement each piece.
2. Break the problem down, but then implement using a top-down approach.
3. Any other? | 0 | [
2,
704,
279,
13,
15458,
13,
8,
371,
20,
2129,
54,
2129,
20,
371,
60,
800,
3726,
3726,
76,
13,
15458,
15,
98,
19,
154,
1496,
25,
21,
574,
2141,
60,
137,
9,
1442,
14,
1448,
125,
77,
284,
511,
2491,
17,
94,
8713,
206,
1855,
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... |
.Net Multithreading: SQL ConnectionPool
===
In a VB.Net Windows Service I'm currently pooling units of work with:
ThreadPool.QueueUserWorkItem(operation, nextQueueID)
In each unit of work (or thread I'll use for ease of understanding), it will make a couple MSSQL operations like so:
Using sqlcmd As New SqlCommand("", New SqlConnection(ConnString))
With sqlcmd
.CommandType = CommandType.Text
.CommandText = "UPDATE [some table]"
.Parameters.Add("@ID", SqlDbType.Int).Value = msgID
.Connection.Open()
.ExecuteNonQuery()
.Connection.Close() 'Found connections not closed quick enough'
End With
End Using
When running a `netstat -a -o` on the server I'm seeing about 50 connections to SQL server sitting on `IDLE` or `ESTABLISHED`, this seems excessive to me especially since we have much larger Web Applications that get by with 5-10 connections.
The connection string is global to the application (doesn't change), and has `Pooling=true` defined as well.
Now will each of these threads have their own `ConnectionPool`, or is there one `ConnectionPool` for the entire .EXE process? | 0 | [
2,
13,
9,
2328,
1889,
96,
22883,
45,
4444,
255,
2760,
13378,
800,
3726,
3726,
19,
21,
13,
20468,
9,
2328,
1936,
365,
31,
22,
79,
871,
3067,
68,
1398,
16,
170,
29,
45,
9322,
13378,
9,
2005,
4185,
16704,
3783,
2119,
79,
5,
11377,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ruby - Convert File to String
===
I need an easy way to take a tar file and convert it into a string (and vice versa). Is there a way to do this in Ruby? My best attempt was this:
file = File.open("path-to-file.tar.gz")
contents = ""
file.each {|line|
contents << line
}
I thought that would be enough to convert it to a string, but then when I try to write it back out like this...
newFile = File.open("test.tar.gz", "w")
newFile.write(contents)
It isn't the same file. Doing `ls -l` shows the files are of different sizes, although they are pretty close (and opening the file reveals most of the contents intact). Is there a small mistake I'm making or an entirely different (but workable) way to accomplish this?
| 0 | [
2,
10811,
13,
8,
8406,
3893,
20,
3724,
800,
3726,
3726,
31,
376,
40,
2010,
161,
20,
247,
21,
2475,
3893,
17,
8406,
32,
77,
21,
3724,
13,
5,
290,
1821,
18596,
6,
9,
25,
80,
21,
161,
20,
107,
48,
19,
10811,
60,
51,
246,
1735,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JAXP DocumentBuilder : How to provide customer error messaages.
===
I want to provide my own message from the validation done in DocumentBuilder, rather than the one from XMLMessages.properties.
Now i see that a property "http://apache.org/xml/properties/internal/error-reporter" needs to be set to a class which extends XMLErrorReporter.
However,I've not been able to get ComponentManager from Document/Builder/Factory.
Can any kind soul gimme code to get it ?
Doing parsing of string in SAXParseException is the last option, but I'm just thinking there may be a 'best practice' way of doing it.
TIA,
--Vardhan | 0 | [
2,
11712,
306,
4492,
20904,
13,
45,
184,
20,
1181,
7705,
7019,
3957,
58,
14465,
9,
800,
3726,
3726,
31,
259,
20,
1181,
51,
258,
2802,
37,
14,
27999,
677,
19,
4492,
20904,
15,
864,
119,
14,
53,
37,
23504,
3845,
18,
14465,
9,
1089... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 is the best LINUX distribution for an all time Windows user
===
I want a Linux installation which closely matches with Windows Vista in terms of GPU support and good Desktop experience.
I heard that [Ubuntu][1] is a good choice here. Anybody have thoughts or experience to share.
[1]: http://www.ubuntu.com/getubuntu | 0 | [
2,
56,
25,
14,
246,
13024,
2523,
26,
40,
65,
85,
1936,
4155,
800,
3726,
3726,
31,
259,
21,
13024,
7758,
56,
3368,
1717,
29,
1936,
13520,
19,
1663,
16,
489,
4201,
555,
17,
254,
17404,
1496,
9,
31,
752,
30,
636,
4502,
1020,
2473,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Planning to use PostgreSQL with ASP.NET: bad idea?
===
I'm currently planning the infrastructure for my future web project. I want to go the way Joel went with having one DB per client and now thinking which DB engine will be good for me. The best would be of course SQL Server, but I can't afford a full-blown version at this moment and I don't think SQL Server Express will be a good choice for the loaded service. Now I'm thinking of using PostgreSQL instead. Given that my development environment will be ASP.NET 3.5 with say NHibernate or LINQ to SQL, how much trouble will I have if I use PostgreSQL instead of SQL Server?
Thanks! | 0 | [
2,
2334,
20,
275,
678,
6879,
18,
22402,
29,
28,
306,
9,
2328,
45,
896,
882,
60,
800,
3726,
3726,
31,
22,
79,
871,
2334,
14,
5282,
26,
51,
1022,
2741,
669,
9,
31,
259,
20,
162,
14,
161,
8873,
296,
29,
452,
53,
13,
9007,
416,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
An affordable tool for DB modelling
===
Could you guys recommend some affordable SQL modelling tool which supports SQL Server, PostgreSQL and MySQL? I'm looking into up to $300 per license range. One tool per answer, please!
Thanks! | 0 | [
2,
40,
17792,
5607,
26,
13,
9007,
23089,
800,
3726,
3726,
110,
42,
2776,
12360,
109,
17792,
4444,
255,
23089,
5607,
56,
6747,
4444,
255,
8128,
15,
678,
6879,
18,
22402,
17,
51,
18,
22402,
60,
31,
22,
79,
699,
77,
71,
20,
5341,
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,
0,
0,
0,
0,
0... |
ASP.net MVC HomeController URL
===
By default the MVC Preview 5 web project comes with a HomeController.vb class. This sets the web URL to http://www.mywebsite.com/home/ by default. If I just wanted this to be http://www.mywebsite.com/ by default, how would I accomplish that? | 0 | [
2,
28,
306,
9,
2328,
307,
8990,
213,
12898,
1252,
287,
6362,
800,
3726,
3726,
34,
12838,
14,
307,
8990,
16121,
331,
2741,
669,
1624,
29,
21,
213,
12898,
1252,
9,
20468,
718,
9,
48,
3415,
14,
2741,
287,
6362,
20,
7775,
6903,
6483,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 SQL query to list all rows that have 2 column sub-rows as duplicates?
===
Ok I have a table that has redundant data and I'm trying to identify all rows that have duplicate sub-rows (for lack of a better word). By sub-rows I mean considering COL1 and COL2 only.
So let's say I have something like this:
COL1 COL2 COL3
---------------------
aa 111 blah_x
aa 111 blah_j
aa 112 blah_m
ab 111 blah_s
bb 112 blah_d
bb 112 blah_d
cc 112 blah_w
cc 113 blah_p
I need a SQL query that returns this:
COL1 COL2 COL3
---------------------
aa 111 blah_x
aa 111 blah_j
bb 112 blah_d
bb 112 blah_d
| 0 | [
2,
98,
22,
18,
14,
4444,
255,
25597,
20,
968,
65,
11295,
30,
57,
172,
4698,
972,
8,
5417,
18,
28,
19429,
18,
60,
800,
3726,
3726,
5854,
31,
57,
21,
859,
30,
63,
24295,
1054,
17,
31,
22,
79,
749,
20,
5808,
65,
11295,
30,
57,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Migrations for Java
===
I use both ruby on rails and Java. I really enjoy using migrations when I am working on a rails project. so I am wondering is there a migrations like tool for Java? If there is no such tool is it a good idea to use migrations as a tool to control a database used by a Java project? | 0 | [
2,
8443,
18,
26,
8247,
800,
3726,
3726,
31,
275,
156,
10811,
27,
2240,
18,
17,
8247,
9,
31,
510,
4696,
568,
8443,
18,
76,
31,
589,
638,
27,
21,
2240,
18,
669,
9,
86,
31,
589,
5712,
25,
80,
21,
8443,
18,
101,
5607,
26,
8247,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Backgroundrb scheduled task ending
===
I have a backroundrb scheduled task that takes quite a long time to run. However it seems that the process is ending after only 2.5 minutes.
My background.yml file:
:schedules:
:named_worker:
:task_name:
:trigger_args: 0 0 12 * * * *
:data: input_data
I have zero activity on the server when the process is running. (Meaning I am the only one on the server watching the log files do their thing until the process suddenly stops.)
Any ideas? | 0 | [
2,
2395,
7549,
3758,
3005,
3119,
800,
3726,
3726,
31,
57,
21,
97,
5000,
7549,
3758,
3005,
30,
1384,
1450,
21,
175,
85,
20,
485,
9,
207,
32,
2206,
30,
14,
953,
25,
3119,
75,
104,
172,
9,
264,
902,
9,
51,
2395,
9,
93,
8184,
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... |
List Comprehension Library for Scheme?
===
I know there is a list-comprehension library for common lisp ([incf-cl][1]), I know they're supported natively in various other functional (and some non-functional) languages (F#, Erlang, Haskell and C#) - is there a list comprehension library for Scheme?
incf-cl is implemented in CL as a library using macros - shouldn't it be possible to use the same techniques to create one for Scheme?
[1]: http://superadditive.com/projects/incf-cl/ | 0 | [
2,
968,
27300,
1248,
26,
4276,
60,
800,
3726,
3726,
31,
143,
80,
25,
21,
968,
8,
11103,
99,
6077,
5991,
1248,
26,
757,
2093,
3401,
13,
5,
2558,
108,
8940,
8,
5316,
500,
2558,
165,
500,
6,
15,
31,
143,
59,
22,
99,
1827,
1275,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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/detecting Local Security Policy programmatically
===
Is it possible to do at least one of the following:
1) Detect a setting of a Local Security Policy (Accounts: Limit local account use of blank passwords to console logon only)
2) Modify that setting
Using Win32/MFC?
Thanks in advance. | 0 | [
2,
17579,
68,
118,
28262,
68,
375,
1221,
1486,
625,
6732,
1326,
800,
3726,
3726,
25,
32,
938,
20,
107,
35,
639,
53,
16,
14,
249,
45,
137,
6,
9092,
21,
2697,
16,
21,
375,
1221,
1486,
13,
5,
29148,
18,
45,
4496,
375,
2176,
275,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Good resources to learn the Factor programming language ?
===
I understand that Factor is based on Forth, so I guess resources on Forth would be nice too.
Thanks ! | 4 | [
2,
254,
2566,
20,
2484,
14,
3932,
3143,
816,
13,
60,
800,
3726,
3726,
31,
1369,
30,
3932,
25,
432,
27,
5882,
15,
86,
31,
2321,
2566,
27,
5882,
83,
44,
2210,
266,
9,
3669,
13,
187,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Converting string to uint in actionscript / Flex
===
I am creating a component and want to expose a color property as many flex controls do, lets say I have simple component like this, lets call it foo_label:
<pre>
<code>
<mx:Canvas>
<mx:Script>
[Bindable] public var color:uint;
</mx:Script>
<mx:Label text="foobar" color="{color}" />
</mx:Canvas>
</code>
</pre>
and then add the component in another mxml file, something along the lines of:
<pre>
<code>
<foo:foo_label color="red" />
</code>
</pre>
When I compile the compiler complains: cannot parse value of type uint from text 'red'. However if I use a plain label I can do
<pre><code><mx:Label text="foobar" color="red"></code></pre>
without any problems, and the color property is still type uint.
My question is how can I expose a public property so that I can control the color of my components text? Why can I use the string "red" as a uint field for the mx controls but cannot seem to do the same in a custom component, do I need to do something special?
Thanks. | 0 | [
2,
19583,
3724,
20,
287,
6391,
19,
1028,
8741,
13,
118,
14409,
800,
3726,
3726,
31,
589,
2936,
21,
5912,
17,
259,
20,
13833,
21,
1665,
1354,
28,
151,
14409,
8671,
107,
15,
6884,
395,
31,
57,
1935,
5912,
101,
48,
15,
6884,
645,
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... |
What's the easiest way to add a quote box to mediawiki?
===
I installed mediawiki on my server as my personal knowledge base. Sometimes I copy some stuff from Web and paste to my wiki - such as tips & tricks from somebody's blog. How do I make the copied content appear in a box with border?
For example, the box at the end of this blog post looks pretty nice:
[http://blog.dreamhost.com/2008/03/21/good-reminiscing-friday/][1]
I could use the pre tag, but paragraphs in a pre tag won't wrap automatically.. Any ideas?
[1]: http://blog.dreamhost.com/2008/03/21/good-reminiscing-friday/ | 0 | [
2,
98,
22,
18,
14,
27237,
161,
20,
3547,
21,
16371,
1649,
20,
941,
17375,
60,
800,
3726,
3726,
31,
4066,
941,
17375,
27,
51,
8128,
28,
51,
1319,
1918,
1000,
9,
1030,
31,
4344,
109,
3217,
37,
2741,
17,
640,
62,
20,
51,
13,
1737... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to implement a singleton pattern class in Actionscript 3?
===
Since AS3 does not allow private constructors, it seems the only way to construct a singleton and guarantee the constructor isn't explicitly created via "new" is to pass a single parameter and check it.
I've heard two recommendations, one is to check the caller and ensure it's the static getInstance(), and the other is to have a private/internal class in the same package namespace.
The private object passed on the constructor seems preferable but it does not look like you can have a private class in the same package. Is this true? And more importantly is it the best way to implement a singleton? | 0 | [
2,
98,
25,
14,
246,
161,
20,
8713,
21,
345,
444,
3732,
718,
19,
1028,
8741,
203,
60,
800,
3726,
3726,
179,
28,
240,
630,
52,
1655,
932,
6960,
248,
18,
15,
32,
2206,
14,
104,
161,
20,
6960,
21,
345,
444,
17,
9120,
14,
6960,
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... |
object reference not set to an instance of object
===
I have been getting an error in VB.net "object reference not set to an instance of object". Can you tell me what are the causes of this error? thanks.. | 0 | [
2,
3095,
2801,
52,
309,
20,
40,
4851,
16,
3095,
800,
3726,
3726,
31,
57,
74,
1017,
40,
7019,
19,
13,
20468,
9,
2328,
13,
7,
23793,
2801,
52,
309,
20,
40,
4851,
16,
3095,
7,
9,
92,
42,
494,
55,
98,
50,
14,
4047,
16,
48,
701... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Fetch one row per account id from list, part 2
===
Not sure how to ask a followup on SO, but this is in reference to an earlier question:
<http://stackoverflow.com/questions/94930/fetch-one-row-per-account-id-from-list>
The query I'm working with is:
SELECT *
FROM scores s1
WHERE accountid NOT IN (SELECT accountid FROM scores s2 WHERE s1.score < s2.score)
ORDER BY score DESC
This selects the top scores, and limits results to one row per accountid; their top score.
The last hurdle is that this query is returning multiple rows for accountids that have multiple occurrences of their top score. So if accountid 17 has scores of 40, 75, 30, 75 the query returns both rows with scores of 75.
Can anyone modify this query (or provide a better one) to fix this case, and truly limit it to one row per account id?
Thanks again! | 0 | [
2,
18312,
53,
3131,
416,
2176,
4924,
37,
968,
15,
141,
172,
800,
3726,
3726,
52,
562,
184,
20,
1349,
21,
1740,
576,
27,
86,
15,
47,
48,
25,
19,
2801,
20,
40,
1201,
1301,
45,
13,
1,
21127,
6903,
25325,
2549,
9990,
9,
960,
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... |
Do fancy MVC URLs affect how caching is done?
===
When reading some answers to aquestion on [clearing cache for JS files][1], somebody pointed to this part of the [http spec][2]. It basically says that URLS containing a ? should not be pulled from the cache, unless a specific expiry date is given. How do query string absent URLs which are so common with MVC websites (RoR, ASP.Net MVC, etc.) get cached, and is the behaviour different then with more traditional query string based urls?
[1]: http://stackoverflow.com/questions/118884/what-is-an-elegant-way-to-force-browsers-to-reload-cached-cssjs-files
[2]: http://www.w3.org/Protocols/rfc2616/rfc2616-sec13.html#sec13.9 | 0 | [
2,
107,
12251,
307,
8990,
13,
911,
7532,
6245,
184,
1658,
7192,
25,
677,
60,
800,
3726,
3726,
76,
1876,
109,
6709,
20,
21,
24652,
27,
636,
18600,
68,
16522,
26,
487,
18,
6488,
500,
2558,
165,
500,
15,
8861,
2489,
20,
48,
141,
16... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
iphone viewWillAppear not firing
===
I've read numerous posts about people having problems with viewWillAppear when you do not create your view heirarchy JUST right. My problem is I can't figure out what that means.
If I create a RootViewController and call addSubView on that controller, I would expect the added view(s) to be wired up for viewWillAppear events.
Does anyone have an example of a complex programmatic view heirarchy that successfully recieves viewWillAppear events at every level?
Apple Docs state:
>
Warning: If the view belonging to a view controller is added to a view hierarchy directly, the view controller will not receive this message. If you insert or add a view to the view hierarchy, and it has a view controller, you should send the associated view controller this message directly. Failing to send the view controller this message will prevent any associated animation from being displayed.
The problem is that they don't describe how to do this. What the hell does "directly" mean. How do you "indirectly" add a view.
I am fairly new to Cocoa and iPhone so it would be nice if there were useful examples from Apple besides the basic Hello World crap.
Any help is greatly appreciated... | 0 | [
2,
21024,
1418,
5580,
22306,
512,
52,
7139,
800,
3726,
3726,
31,
22,
195,
1302,
1548,
9868,
88,
148,
452,
1716,
29,
1418,
5580,
22306,
512,
76,
42,
107,
52,
1600,
154,
1418,
7678,
8027,
93,
114,
193,
9,
51,
1448,
25,
31,
92,
22,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In Javascript, is there a source for time with a consistant resolution in milliseconds?
===
The Date object in javascript performs differently machine to machine and browser to browser in respect to the function's resolution in milliseconds. I've found most machines have a resolution of about 16 ms on IE, where Chrome or Firefox may have a resolution as good as 1ms.
Is there another function available to javascript in general or IE specifically that will give a better time resolution? I am trying to trap and record keyDown and keyUp times in milliseconds and need it in the +/- 10 ms range or less. | 0 | [
2,
19,
8247,
8741,
15,
25,
80,
21,
1267,
26,
85,
29,
21,
7929,
1830,
4302,
19,
13436,
5007,
18,
60,
800,
3726,
3726,
14,
1231,
3095,
19,
8247,
8741,
11563,
12670,
1940,
20,
1940,
17,
16495,
20,
16495,
19,
2873,
20,
14,
1990,
22,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the quickest way to dump & load a MySQL InnoDB database using mysqldump?
===
I would like to create a copy of a database with approximately 40 InnoDB tables and around 1.5GB of data with mysqldump and MySQL 5.1.
What are the best parameters (ie: --single-transaction) that will result in the quickest dump and load of the data?
As well, when loading the data into the second DB, is it quicker to:
1) pipe the results directly to the second MySQL server instance and use the --compress option
or
2) load it from a text file (ie: mysql < my_sql_dump.sql) | 0 | [
2,
98,
22,
18,
14,
2231,
1430,
161,
20,
11424,
279,
6305,
21,
51,
18,
22402,
19,
251,
9007,
6018,
568,
51,
18,
22402,
43,
11134,
60,
800,
3726,
3726,
31,
83,
101,
20,
1600,
21,
4344,
16,
21,
6018,
29,
1357,
1417,
19,
251,
9007... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 big of a security risk is checking out an svn project right into production site?
===
Not that I'm doing something like that, but I am kind of interested how bad a practice like that is. | 0 | [
2,
184,
580,
16,
21,
1221,
2029,
25,
9886,
70,
40,
13,
18,
16578,
669,
193,
77,
637,
689,
60,
800,
3726,
3726,
52,
30,
31,
22,
79,
845,
301,
101,
30,
15,
47,
31,
589,
825,
16,
3158,
184,
896,
21,
1345,
101,
30,
25,
9,
3,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
OpenID Over SSL with self signed certificate
===
I setup my own open id provider on my personal server, and added a redirect to https in my apache config file. When not using a secure connection (when I disable the redirect) I can log in fine, but with the redirect I can't log in with this error message:
The underlying connection was closed: Could not establish trust relationship for the SSL/TLS secure channel.
I'm guessing that this is because I am using a self signed certificate.
Can anyone confirm if the self signed certificate is the issue? If not does anyone have any ideas what the problem is? | 0 | [
2,
368,
1340,
84,
13,
18,
18,
255,
29,
1119,
908,
6259,
800,
3726,
3726,
31,
18161,
51,
258,
368,
4924,
11747,
27,
51,
1319,
8128,
15,
17,
905,
21,
302,
14706,
20,
7775,
18,
19,
51,
17140,
13,
14093,
2816,
3893,
9,
76,
52,
568... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.