unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
What in-app advertising framework should I use?
===
I'm a little confused about what in-app advertising model to use in my Android app. I've Googled, searched stackoverflow, but no definitive answer. There seems to be a few solutions out there but AdSense, AdMob generation one and generation two seems to be most popular. Could someone with knowledge explain the difference between them and when to use one or the other although I'm open to other solutions to. For the record I'm developing an app with streamed video. | 0 | [
2,
98,
19,
8,
7753,
5620,
6596,
378,
31,
275,
60,
800,
3726,
3726,
31,
22,
79,
21,
265,
4230,
88,
98,
19,
8,
7753,
5620,
1061,
20,
275,
19,
51,
13005,
4865,
9,
31,
22,
195,
8144,
43,
15,
9036,
7566,
2549,
9990,
15,
47,
90,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
BCrypt very slow in app engine application
===
I'm developing a GWT/app engine application, using Eclipse. The below problem occurred after upgrading to app engine 1.6.4 from 1.6.3. After the upgrade, I my application would not work at all. Unfortunately, I had deleted my old app engine plugins, so I was unable to rollback to 1.6.3. After 2 hours of banging my head against the wall, I decided to recreate my Eclipse project. The project worked again, except for the following anomaly:
I'm using BCrypt to implement one-way hash encoding of passwords. Before yesterday, this worked fine, with password encodes and checks occurring very fast -- probably in a few milliseconds. Now these operations take on the order of 2 minutes! Using the debugger, I paused the application to see if I could figure out what was going on. Each time I pause, I get a stack trace such as the following:
Thread [798744730@qtp-2080190228-3] (Suspended)
Class<T>.forName0(String, boolean, ClassLoader) line: not available [native method]
Class<T>.forName(String) line: 186
RuntimeHelper.checkRestricted(boolean, String, String, String) line: 63
Runtime.checkRestricted(boolean, String, String, String) line: 63
BCrypt.encipher(int[], int) line: 496
BCrypt.key(byte[]) line: 558
BCrypt.crypt_raw(byte[], byte[], int) line: 622
BCrypt.hashpw(String, String) line: 681
BCrypt.checkpw(String, String) line: 749
BCrypt.encipher() is as follows: (line 496 is shown below in a line comment)
private final void encipher(int lr[], int off) {
int i, n, l = lr[off], r = lr[off + 1];
l ^= P[0];
for (i = 0; i <= BLOWFISH_NUM_ROUNDS - 2;) {
// Feistel substitution on left word
n = S[(l >> 24) & 0xff];
n += S[0x100 | ((l >> 16) & 0xff)];
n ^= S[0x200 | ((l >> 8) & 0xff)];
n += S[0x300 | (l & 0xff)];
r ^= n ^ P[++i]; //*** LINE 496 *****
// Feistel substitution on right word
n = S[(r >> 24) & 0xff];
n += S[0x100 | ((r >> 16) & 0xff)];
n ^= S[0x200 | ((r >> 8) & 0xff)];
n += S[0x300 | (r & 0xff)];
l ^= n ^ P[++i];
}
lr[off] = r ^ P[BLOWFISH_NUM_ROUNDS + 1];
lr[off + 1] = l;
}
Depending on when I pause the debugger, different lines in BCrypt are the caller to Runtime.checkRestricted(), but it appears that Runtime.checkRestricted() is called continuously. Since this is called in embedded loops, I'm thinking that this is the cause. I then went on a hunt as to how to avoid this checkRestricted() call from happening. No luck.
I have a somewhat complicated application structure that contains three Google web applications (Eclipse projects). I'll call them:
Base
Store
App
where Store depends upon Base, and App depends upon both Store and Base. I use an Ant task to build the Base and Store projects into JAR files and copy them to the App/war/WEB-INF/lib folder.
Originally, I had BCrypt in its own Eclipse project and my ANT task would also JAR this and copy it to App/war/WEB-INF/lib. This was working fine for the past few months until now. To try to work around the current problem, I tried moving the BCrypt class (it contains only 1 class) directly into the Base project, with the same result, then into the Store project, again with the same result. Since my app currently calls BCrypt methods only from the Store project, I figured either of this might work. They did, functionally, but still taking 2 minutes to complete an encipher() call.
From the stack trace, Runtime or RuntimeHelper return Source Not Found when I click on them, and I can find nothing about them in Google searches.
Questions:
Why is every line in BCrypt subjected to a checkRestricted() call? This doesn't seem normal.
More importantly, any idea on how to fix this problem?
I don't know what to look at next. Any ideas would be very welcome, even if you don't know the ultimate solution.
Thanks very much.
Rick | 0 | [
2,
334,
11435,
253,
2276,
19,
4865,
1406,
3010,
800,
3726,
3726,
31,
22,
79,
3561,
21,
14094,
38,
118,
7753,
1406,
3010,
15,
568,
11652,
9,
14,
1021,
1448,
2437,
75,
26939,
20,
4865,
1406,
137,
9,
379,
9,
300,
37,
137,
9,
379,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why when i add an item in bag collection nhibernate automatically insert in database?
===
I'm working with NHibernate. My A class have a bag of B objects. so when i try:
var A = new A();
var B = new B();
A.Bs.Add(B); // Here NHibernate insert in database
The Nhibernate automatically insert in relationship table on database. But i want to NHibernate insert when i save or update the A object:
var A = new A();
var B = new B();
A.Bs.Add(B);
session.saveOrUpdate(A); // Here i want to NHibernate insert in database
It's possible or this is how NHibernate works?
Thanks.
| 0 | [
2,
483,
76,
31,
3547,
40,
9101,
19,
1910,
1206,
12109,
15191,
8820,
7499,
14692,
19,
6018,
60,
800,
3726,
3726,
31,
22,
79,
638,
29,
12109,
15191,
8820,
9,
51,
21,
718,
57,
21,
1910,
16,
334,
3916,
9,
86,
76,
31,
1131,
45,
403... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why do I have a slow initial response using by the Active Directory server?
===
Connecting to a named Active Directory server over port 636 using `DirectoryEntry` then pulling attributes using `DirectorySearcher`.
var searchRoot = new DirectoryEntry(serverPath, User, Pass, AuthenticationTypes.Secure);
The first query is very slow, around 22-25 seconds. It was explained to me that this may because IIS 7.5 may be doing a look up of the certificate on the AD server against a CRL, but not getting a response. Then, subsequent queries accept that answer until the process times out, so that the next query will again take 22-25 seconds.
Is the type of connection that I've described in my code example actually pull the certificate, or is the traffic simply sent over the port in an encrypted state, without a handshake between servers relative to the cert?
Is it mandatory that I IIS have a certificate as well for this to work? I should say that I am using this pattern: [http://forums.asp.net/p/907421/1007517.aspx][1].
[1]: http://forums.asp.net/p/907421/1007517.aspx | 0 | [
2,
483,
107,
31,
57,
21,
2276,
2104,
1627,
568,
34,
14,
1348,
16755,
8128,
60,
800,
3726,
3726,
6440,
20,
21,
377,
1348,
16755,
8128,
84,
1295,
400,
3775,
568,
13,
1,
10197,
93,
18195,
1,
94,
3303,
13422,
568,
13,
1,
10197,
93,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 XML do I send for a field thats declared as nillable?
===
I have an application with a REST style inerface that takes XML documents via POST from clients. This application is written in Java and uses XML beans to process the posted message.
Now, the XML schema definition for a field in the message looks like this:
<xs:element name="value" type="xs:string" nillable="true" / >
How do I send a null value that meets this spec?
I sent <value xsi:nil="true" />
but this caused the CML parser to barf.
| 0 | [
2,
98,
23504,
107,
31,
2660,
26,
21,
575,
30,
18,
2482,
28,
1781,
211,
579,
60,
800,
3726,
3726,
31,
57,
40,
3010,
29,
21,
760,
1034,
19,
106,
6413,
30,
1384,
23504,
4374,
1197,
678,
37,
7421,
9,
48,
3010,
25,
642,
19,
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... |
Is there any way to enable the mousewheel (for scrolling) in Java apps?
===
Ideally I'd like a way to enable the mousewheel for scrolling in old compiled java runtime apps, but java code to explicitly utilize it for an individual app would suffice. | 0 | [
2,
25,
80,
186,
161,
20,
9240,
14,
7567,
8229,
13,
5,
1106,
13,
28166,
6,
19,
8247,
4865,
18,
60,
800,
3726,
3726,
5628,
102,
31,
22,
43,
101,
21,
161,
20,
9240,
14,
7567,
8229,
26,
13,
28166,
19,
315,
9316,
8247,
485,
891,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Making a beta code for a public django site
===
I'm about to put a beta version of the site I'm working on up on the web. It needs to have a beta code to restrict access. The site is written in django.
I don't want to change the fundamental Auth system to accommodate a beta code, and I don't care particularly that the security of the beta code is iron-clad, just that it's a significant stumbling block.
How should I do this? It's a fairly large project (based on pinax) so adding code to every view is far from ideal. | 0 | [
2,
544,
21,
8434,
1797,
26,
21,
317,
3857,
14541,
689,
800,
3726,
3726,
31,
22,
79,
88,
20,
442,
21,
8434,
615,
16,
14,
689,
31,
22,
79,
638,
27,
71,
27,
14,
2741,
9,
32,
2274,
20,
57,
21,
8434,
1797,
20,
15436,
1381,
9,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is a good functional language on which to build a web service?
===
Is there a functional language that has good support and tools for building web services? I've been looking at Scala (which compiles to the JVM and can use the Java libraries) and F# (which is .NET), but these are young and have some inefficiencies. Scala in particular doesn't support tail-call elimination except in self-recursive functions, which limits the kinds of composition you can do (this is a fundamental limitation of the JVM). F# is very new and doesn't seem to be fully supported yet, which makes it riskier than a more conventional language.
Is it possible to build a web service using Haskell, ML, or any of the other more traditional functional languages, or would it be better to go with Scala or F#? Any other suggestions? | 0 | [
2,
98,
25,
21,
254,
7652,
816,
27,
56,
20,
1895,
21,
2741,
365,
60,
800,
3726,
3726,
25,
80,
21,
7652,
816,
30,
63,
254,
555,
17,
4672,
26,
353,
2741,
687,
60,
31,
22,
195,
74,
699,
35,
25975,
13,
5,
2140,
26561,
18,
20,
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 are some excellent examples of user sign-up forms on the web?
===
I'm trying to get a sampling of what people think are the best sign-up forms. Good design, usability. Smart engineering. Helpful feedback. Etc. | 0 | [
2,
98,
50,
109,
5977,
3770,
16,
4155,
1676,
8,
576,
1997,
27,
14,
2741,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
164,
21,
19030,
16,
98,
148,
277,
50,
14,
246,
1676,
8,
576,
1997,
9,
254,
704,
15,
182,
4091,
9,
3978,
1552,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to move to end of line in vim
===
I am somewhat clumsy in my vi knowledge. I know how to generally move around in command mode, specifically, jumping to lines, etc. But what is the command to jump to the end of the line that I am currently on? | 0 | [
2,
184,
20,
780,
20,
241,
16,
293,
19,
1790,
79,
800,
3726,
3726,
31,
589,
4131,
25184,
19,
51,
1790,
1918,
9,
31,
143,
184,
20,
1469,
780,
140,
19,
1202,
3740,
15,
3524,
15,
8759,
20,
1560,
15,
2722,
9,
47,
98,
25,
14,
1202... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0... |
Can't figure out what this SubString.PadLeft is doing.
===
In this code I am debugging, I have this code snipit:
ddlExpYear.SelectedItem.Value.Substring(2).PadLeft(2, '0');
What does this return? I really can't run this too much as it is part of a live credit card application. The DropDownList as you could imagine from the name contains the 4-digit year. | 0 | [
2,
92,
22,
38,
1465,
70,
98,
48,
972,
11130,
9,
8240,
9742,
25,
845,
9,
800,
3726,
3726,
19,
48,
1797,
31,
589,
121,
16254,
2762,
15,
31,
57,
48,
1797,
13,
18,
889,
7328,
45,
13,
12312,
396,
306,
731,
9,
18,
7138,
2119,
79,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to write a self reproducing code ?
===
I have seen a lot of C/C++ based solutions to this problem where we have to write a program that upon execution prints its own source.
some solutions --
http://www.cprogramming.com/challenges/solutions/self_print.html
**[Quine Page solution in many languages][1]**
There are many more solutions on the net, each different from the other. I wonder how do we approach to such a problem, what goes inside the mind of the one who solves it. Lend me some insights into this problem...
[1]: http://www.nyx.net/~gthompso/quine.htm | 0 | [
2,
184,
20,
2757,
21,
1119,
302,
22067,
1797,
13,
60,
800,
3726,
3726,
31,
57,
541,
21,
865,
16,
272,
118,
150,
20512,
432,
6776,
20,
48,
1448,
113,
95,
57,
20,
2757,
21,
625,
30,
685,
5769,
12202,
82,
258,
1267,
9,
109,
6776,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I use the softkeys with a CDialog based application in windows mobile 6 via MFC?
===
How do I use the softkeys with a CDialog based application in windows mobile 6 via MFC?
I have a CDialog based Windows Mobile 6 (touchscreen) Professional app that I am workign on.
The default behavior of a CDialog based app in WM6 Professional is to not use any softkeys by default... I want to map the softkeys to "Cancel" and "OK" functionality that sends IDOK and IDCANCEL to my Main Dialog class.
I have been trying to work with CCommandBar with no luck, and SHCreateMenuBar was not working out for me either.
Does anyone have a sample of how to get this to work?
Thanks. | 0 | [
2,
184,
107,
31,
275,
14,
1856,
4237,
18,
29,
21,
1745,
549,
5567,
432,
3010,
19,
1936,
3241,
400,
1197,
307,
7061,
60,
800,
3726,
3726,
184,
107,
31,
275,
14,
1856,
4237,
18,
29,
21,
1745,
549,
5567,
432,
3010,
19,
1936,
3241,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Project Framework / Management certifications
===
So there's ITIL, and PMP, and Project+, and etc. etc.
What are your preferences? I heard that PMP and ITIL can perhaps allow you to make more money. Project+ is cheaper. Has anybody actually gotten usage out of any of these certificates? | 2 | [
2,
669,
6596,
13,
118,
1097,
10439,
18,
800,
3726,
3726,
86,
80,
22,
18,
32,
947,
15,
17,
351,
2554,
15,
17,
669,
2430,
15,
17,
2722,
9,
2722,
9,
98,
50,
154,
9808,
18,
60,
31,
752,
30,
351,
2554,
17,
32,
947,
92,
1774,
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... |
What's a good book to learn Javascript DOM manipulation?
===
I'm looking for a book I could use to learn the subject of DOM scripting. So far I just have been learning only the things I needed for my given projects online, but I would like to buy a book on the topic so I can fully learn the material as a whole. Any suggestions? | 0 | [
2,
98,
22,
18,
21,
254,
360,
20,
2484,
8247,
8741,
11859,
17561,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
360,
31,
110,
275,
20,
2484,
14,
1550,
16,
11859,
3884,
68,
9,
86,
463,
31,
114,
57,
74,
2477,
104,
14,
564,
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... |
Best practictes for configuring Apache / Tomcat
===
We are currently using Apache 2.2.3 and Tomcat 5 (Embedded in JBoss 4.2.2) using `mod_proxy_jk` as the connector.
Can someone shed some light on the the correct way to calculate / configure the values below (as well as anything else that may be relevant). Both Apache and Tomcat are running on separate machines and have copious amounts of ram (4gb each).
Relevant server.xml portions:
<Connector port="8009"
address="${jboss.bind.address}"
protocol="AJP/1.3"
emptySessionPath="true"
enableLookups="false"
redirectPort="8443"
maxThreads="320"
connectionTimeout="45000"
/>
Relevant httpd.conf portions:
<IfModule prefork.c>
StartServers 8
MinSpareServers 5
MaxSpareServers 20
ServerLimit 256
MaxClients 256
MaxRequestsPerChild 0
</IfModule>
| 0 | [
2,
246,
3865,
150,
1786,
3231,
26,
1065,
13549,
68,
17140,
13,
118,
2067,
5782,
800,
3726,
3726,
95,
50,
871,
568,
17140,
172,
9,
135,
9,
240,
17,
2067,
5782,
331,
13,
5,
1503,
4283,
7424,
19,
487,
10349,
18,
268,
9,
135,
9,
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... |
.NET String.Format() to add commas in thousands place for a number
===
I want to add a comma in the thousands place for a number. String.Format()? | 0 | [
2,
13,
9,
2328,
3724,
9,
23588,
5,
6,
20,
3547,
11951,
472,
19,
3805,
209,
26,
21,
234,
800,
3726,
3726,
31,
259,
20,
3547,
21,
11951,
58,
19,
14,
3805,
209,
26,
21,
234,
9,
3724,
9,
23588,
5,
6,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Detecting when ChucK child shred has finished
===
Is it possible to determine when a ChucK child shred has finished executing if you have a reference to the child shred? For example, in this code:
// define function go()
fun void go()
{
// insert code
}
// spork another, store reference to new shred in offspring
spork ~ go() => Shred @ offspring;
Is it possible to determine when `offspring` is done executing?
| 0 | [
2,
9092,
68,
76,
6513,
850,
21045,
63,
842,
800,
3726,
3726,
25,
32,
938,
20,
3746,
76,
21,
6513,
850,
21045,
63,
842,
25836,
100,
42,
57,
21,
2801,
20,
14,
850,
21045,
60,
26,
823,
15,
19,
48,
1797,
45,
12894,
9267,
1990,
162... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I restore a MySQL .dump file?
===
I was given a .dump MySQL database file that I need to restore as a database on my Windows Server 2008 machine.
I tried using MySQL Administrator, but I got the following error:
> The selected file was generated by
> mysqldump and cannot be restored by
> this application.
How do I get this working? | 0 | [
2,
184,
107,
31,
8454,
21,
51,
18,
22402,
13,
9,
43,
11134,
3893,
60,
800,
3726,
3726,
31,
23,
504,
21,
13,
9,
43,
11134,
51,
18,
22402,
6018,
3893,
30,
31,
376,
20,
8454,
28,
21,
6018,
27,
51,
1936,
8128,
570,
1940,
9,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why won't an Ajax Script Work Locally?
===
I've an issue with the same piece of code running fine on my live website but not on my local development server.
I've an Ajax function that updates a div. The following code works on the live site:
<pre>self.xmlHttpReq.open("POST", PageURL, true);
self.xmlHttpReq.setRequestHeader("Content-type", "application/x-www-form-urlencoded");
self.xmlHttpReq.setRequestHeader("Content-length", QueryString.length);
//..update div stuff...
self.xmlHttpReq.send(QueryString);</pre>
When I try to run this on my local machine, nothing is passed to the QueryString.
However, to confuse matters, the following code **does** work locally:
<pre>self.xmlHttpReq.open("POST", PageURL+"?"+QueryString, true);
self.xmlHttpReq.setRequestHeader('Content-Type', 'application/x-www-form-urlencoded; charset=UTF-8');
//..div update stuff..
self.xmlHttpReq.send(QueryString);</pre>
But, I can't use the code that works on my local machine as it doesn't work on the live server (they've changed their policy on querystrings for security reasons)!
I can alert the Querystring out so I know it's passed into the function on my local machine. The only thing I can think of is that it's a hardware/update issue.
Live Site is running IIS 6 (on a WIN 2003 box I think)
Local Site is running IIS 5.1 (On XP Pro)
Are there some updates or something I'm missing or something?
Thanks in advance
KT | 0 | [
2,
483,
230,
22,
38,
40,
20624,
3884,
170,
6680,
60,
800,
3726,
3726,
31,
22,
195,
40,
1513,
29,
14,
205,
1855,
16,
1797,
946,
1123,
27,
51,
515,
2271,
47,
52,
27,
51,
375,
522,
8128,
9,
31,
22,
195,
40,
20624,
1990,
30,
167... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 ultimate program to make a drawing of a database model?
===
One of the first things I do when I'm on a new project, is designing a database model. To visualize the model I use I use a 7 year old version of Smartdraw. Maybe it's time for something new. What is the ultimate program to make a drawing of a database model. Smartdraw is for Windows only. Is there something that can be used on unix as well? | 0 | [
2,
98,
25,
14,
6612,
625,
20,
233,
21,
3533,
16,
21,
6018,
1061,
60,
800,
3726,
3726,
53,
16,
14,
64,
564,
31,
107,
76,
31,
22,
79,
27,
21,
78,
669,
15,
25,
15026,
21,
6018,
1061,
9,
20,
3458,
2952,
14,
1061,
31,
275,
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... |
good postgresql client for windows?
===
coming back to postgresql after several years of oracle ...
what are the state-of-the art postgresql frontends on windows? it would be nice if it had integration for postgis as well.
thinking back, all the windows programs specific for postgresql i have used were crap. | 0 | [
2,
254,
678,
6879,
18,
22402,
6819,
26,
1936,
60,
800,
3726,
3726,
880,
97,
20,
678,
6879,
18,
22402,
75,
238,
122,
16,
15759,
13,
9,
9,
9,
98,
50,
14,
146,
8,
1041,
8,
124,
415,
678,
6879,
18,
22402,
431,
2451,
18,
27,
1936... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a string type of a hex value that represents an upper ascii value character
===
Part of our app parses RTF documents and we've come across a special character that is not translating well. When viewed in Word the character is an elipsis (...), and it's encoded in the RTF as ('85).
In our vb code we converted the hex (85) to int(133) and then did Chr(133) to return (...)
Here's the code in C# - problem is this doesn't work for values above 127. Any ideas?
Calling code :
// S is Hex number!!!
return Convert.ToChar(HexStringToInt(s)).ToString();
Helper method:
private static int HexStringToInt(string hexString)
{
int i;
try
{
i = Int32.Parse(hexString, NumberStyles.HexNumber);
}
catch (Exception ex)
{
throw new ApplicationException("Error trying to convert hex value: " + hexString, ex);
}
return i;
}
| 0 | [
2,
184,
107,
31,
164,
21,
3724,
1001,
16,
21,
24,
396,
1923,
30,
4719,
40,
1508,
28,
1892,
49,
1923,
925,
800,
3726,
3726,
141,
16,
318,
4865,
2017,
7202,
761,
11720,
4374,
17,
95,
22,
195,
340,
464,
21,
621,
925,
30,
25,
52,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I access a char ** through ffi in plt-scheme?
===
I'm mocking about with plt-scheme's ffi and I have a C-function that returns a char ** (array of strings). If I declare my function as `(_fun _pointer -> _pointer)`, how do I convert the result to a list of strings in scheme?
Here are the relevant C-declarations:
typedef char **MYSQL_ROW; /* return data as array of strings */
// ...
MYSQL_ROW STDCALL mysql_fetch_row(MYSQL_RES *result); | 0 | [
2,
184,
107,
31,
1381,
21,
4892,
13,
1409,
120,
398,
1707,
19,
12443,
38,
8,
7526,
790,
60,
800,
3726,
3726,
31,
22,
79,
18446,
88,
29,
12443,
38,
8,
7526,
790,
22,
18,
398,
1707,
17,
31,
57,
21,
272,
8,
22359,
30,
4815,
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... |
SEO and hard links with dynamic URLs
===
With ASP.NET MVC (or using HttpHandlers) you can dynamically generate URLs, like the one in this question, which includes the title.
What happens if the title changes (for example, editing it) and there's a link pointing to the page from another site, or Google's Pagerank was calculated for that URL?
I guess it's all lost right? (The link points to nowhere and the pagerank calculated is lost)
If so, is there a way to avoid it? | 0 | [
2,
13,
18,
3894,
17,
552,
6271,
29,
7782,
13,
911,
7532,
800,
3726,
3726,
29,
28,
306,
9,
2328,
307,
8990,
13,
5,
248,
568,
7775,
3203,
1252,
18,
6,
42,
92,
7782,
1326,
7920,
13,
911,
7532,
15,
101,
14,
53,
19,
48,
1301,
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... |
Does the JVM prevent tail call optimizations?
===
I saw this on a [question][1]:
> Scala in particular doesn't support tail-call elimination except in self-recursive functions, which limits the kinds of composition you can do (this is a fundamental limitation of the JVM).
Is this true? If so, what is it about the JVM that creates this fundamental limitation?
[1]: http://stackoverflow.com/questions/105710 | 0 | [
2,
630,
14,
487,
20147,
2501,
3424,
645,
21597,
18,
60,
800,
3726,
3726,
31,
441,
48,
27,
21,
636,
24652,
500,
2558,
165,
500,
45,
13,
1,
25975,
19,
1498,
1437,
22,
38,
555,
3424,
8,
9200,
10528,
1613,
19,
1119,
8,
99,
24244,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
perl JOIN-like behavior in Oracle?
===
I have two tables, let's call them PERSON and NAME.
PERSON
person_id
dob
NAME
name_id
person_id
name
And say that the NAME table has data like:
name_id person_id name
1 1 Joe
2 1 Fred
3 1 Sam
4 2 Jane
5 2 Kim
I need a query (Oracle 10g) that will return
name_id names
1 Joe, Fred, Sam
2 Jane, Kim
Is there a simple way to do this?
| 0 | [
2,
416,
255,
1865,
8,
1403,
3257,
19,
15759,
60,
800,
3726,
3726,
31,
57,
81,
7484,
15,
408,
22,
18,
645,
105,
840,
17,
204,
9,
840,
840,
1,
1340,
107,
220,
204,
204,
1,
1340,
840,
1,
1340,
204,
17,
395,
30,
14,
204,
859,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Real-world examples of recursion
===
Can anyone suggest **real-world** problems where a recursive approach is the natural solution besides DFS?
(I don't consider towers-of-Hanoi, fibonacci sequence, or factorial real-world problems. They are a bit contrived in my mind.)
| 0 | [
2,
683,
8,
4423,
3770,
16,
26604,
5991,
800,
3726,
3726,
92,
1276,
5601,
13,
1409,
7467,
8,
4423,
1409,
1716,
113,
21,
302,
24244,
2141,
25,
14,
1112,
4295,
3410,
13,
8736,
18,
60,
13,
5,
49,
221,
22,
38,
3563,
7557,
8,
1041,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 deal with conditionnal logging when trying to respect a limited cyclomatic complexity ?
===
After reading "[What’s your/a good limit for cyclomatic complexity?][1]", I realize many of my colleagues were quite annoyed with this new [QA][2] policy on our project: no more 10 [cyclomatic complexity][3] per function.
Meaning: no more than 10 'if', 'else', 'try', 'catch' and other code workflow branching statement. Right. As I explained in '[Do you test private method?][4]', such a policy has many good side-effects.
But: At the beginning of our (200 people - 7 years long) project, we were happily logging (and no, we can not easily delegate that to some kind of '[Aspect-oriented programming][5]' approach for logs).
myLogger.info("A String");
myLogger.fine("A more complicated String");
...
And when the first versions of our System went live, we experienced huge memory problem not because of the logging (which was at one point turned off), but because of the _log parameters_ (the strings), which are always calculated, then passed to the 'info()' or 'fine()' functions, only to discover that the level of logging was 'OFF', and that no logging were taking place!
So QA came back and urged our programmers to do conditional logging. Always.
if(myLogger.isLoggable(Level.INFO) { myLogger.info("A String");
if(myLogger.isLoggable(Level.INFO) { myLogger.fine("A more complicated String");
...
But now, with that 'can-not-be-moved' 10 cyclomatic complexity level per function limit, they argue that the various logs they put in their function is felt as a burden, because each "if(isLoggable())" is counted as +1 cyclomatic complexity!
So if a function has 8 'if', 'else' and so on, in one tightly-coupled not-easily-shareable algorithm, and 3 critical log actions... they breach the limit even though the conditional logs may not be _really_ part of said complexity of that function...
How would you address this situation ?
I have seen a couple of interesting coding evolution (due to that 'conflict') in my project, but I just want to get your thoughts first.
[1]: http://stackoverflow.com/questions/20702/whats-youra-good-limit-for-cyclomatic-complexity
[2]: http://en.wikipedia.org/wiki/Quality_assurance
[3]: http://en.wikipedia.org/wiki/Cyclomatic_complexity
[4]: http://stackoverflow.com/questions/105007/do-you-test-private-method#105114
[5]: http://en.wikipedia.org/wiki/Aspect-oriented_programming | 0 | [
2,
184,
107,
42,
1183,
29,
2874,
5025,
13,
13919,
76,
749,
20,
2873,
21,
1317,
12833,
6732,
12745,
13,
60,
800,
3726,
3726,
75,
1876,
13,
7,
2558,
608,
1,
18,
154,
118,
58,
254,
4496,
26,
12833,
6732,
12745,
60,
500,
2558,
165,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Running an MVC application through IIS results in "Directory listing denied"
===
I have an .Net MVC application which runs fine if I use the build in Visual Studio Webserver. If I use the projects property pages to switch to IIS as the webserver and create a virtual directory for my project, any request I send to the server results in a "Directory listing denied" failure.
Does anyone know a solution for this? | 0 | [
2,
946,
40,
307,
8990,
3010,
120,
595,
18,
1736,
19,
13,
7,
10197,
93,
9554,
5265,
7,
800,
3726,
3726,
31,
57,
40,
13,
9,
2328,
307,
8990,
3010,
56,
1461,
1123,
100,
31,
275,
14,
1895,
19,
3458,
1120,
2741,
10321,
106,
9,
100,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Implementing IntelliSense-like behavior in custom editors for domain-specific languages
===
I'm creating a DSL with a template-like editor, much like the rule systems in [Alice][1]. Users will be able to select relationships from a list as well as the objects to apply the relation to. These two lists should be filtered based on the acceptable types -- for instance, if the relationship is "greater than" then the available objects must be of a type that "greater than" is implemented for.
Similarly, if an object is selected that is *not* comparable with greater than, then that relation should not be in the list of potential relations. I think the heart of this problem is a type checker, but I'm not certain of the best way to incorporate that type of logic in my application. Is anyone aware of existing type checking libraries for DSLs?
I am specifically interested in open-source and cross-platform technologies. Java is probably the language we will end up using, but that is not fixed.
[1]: http://www.allice.org | 0 | [
2,
17333,
14635,
3159,
6498,
8,
1403,
3257,
19,
5816,
12149,
26,
4603,
8,
9219,
2556,
800,
3726,
3726,
31,
22,
79,
2936,
21,
13,
43,
18,
255,
29,
21,
22894,
8,
1403,
1835,
15,
212,
101,
14,
1828,
1242,
19,
636,
58,
11909,
500,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to record window position in WinForms application settings
===
It seems like a standard requirement: next time the user launches the app, open the window in the same position and state as it was before. Here's my wish list:
* Window position same as it was
* Unless the screen has resized and the old position is now off screen.
* Splitters should retain their position
* Tab containers should retain their selection
* Some dropdowns should retain their selection
* Window state (maximize, minimize, normal) is the same as it was.
* Maybe you should never start minimized, I haven't decided.
I'll add my current solutions as an answer along with the limitations. | 0 | [
2,
184,
20,
571,
1463,
649,
19,
628,
4190,
18,
3010,
12410,
800,
3726,
3726,
32,
2206,
101,
21,
1236,
8981,
45,
328,
85,
14,
4155,
22933,
14,
4865,
15,
368,
14,
1463,
19,
14,
205,
649,
17,
146,
28,
32,
23,
115,
9,
235,
22,
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... |
Most efficient way to see if an item is or is not in a listbox control
===
This request is based in MS Access VBA. I would like to see what is efficient way to see if an item exists in a listbox control. | 0 | [
2,
127,
8243,
161,
20,
196,
100,
40,
9101,
25,
54,
25,
52,
19,
21,
968,
5309,
569,
800,
3726,
3726,
48,
3772,
25,
432,
19,
4235,
1381,
566,
969,
9,
31,
83,
101,
20,
196,
98,
25,
8243,
161,
20,
196,
100,
40,
9101,
5636,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Simple VB.NET using Google Search API?
===
Can anyone point me to a good, simple, example of a Google API (AJAX Search API I suppose?) that can be implemented in VB.net (2008)? I have tried to sign up for a Google API key but it wants a URL from which the search will be executed from. I dont have a URL for this example. I tried http://localhost but then was told by a colleague that she got a "Invalid Key" error. A simple working example would be awesome. Thank you. | 0 | [
2,
1935,
13,
20468,
9,
2328,
568,
8144,
2122,
21,
2159,
60,
800,
3726,
3726,
92,
1276,
454,
55,
20,
21,
254,
15,
1935,
15,
823,
16,
21,
8144,
21,
2159,
13,
5,
6881,
7522,
2122,
21,
2159,
31,
5787,
60,
6,
30,
92,
44,
6807,
19... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I set the default database in Sql Server from code?
===
I can't seem to figure out how to set the default database in Sql Server from code. This can be either .Net code or T-Sql (T-Sql would be nice since it would be easy to use in any language). I searched Google and could only find how to do it in Sql Server Management Studio. | 0 | [
2,
184,
107,
31,
309,
14,
12838,
6018,
19,
4444,
255,
8128,
37,
1797,
60,
800,
3726,
3726,
31,
92,
22,
38,
2260,
20,
1465,
70,
184,
20,
309,
14,
12838,
6018,
19,
4444,
255,
8128,
37,
1797,
9,
48,
92,
44,
694,
13,
9,
2328,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's a Good Resource for Learning XNA?
===
I've been considering experimenting with game development and XNA. I'm already an expert C/C++ programmer. I read through some C# books, but haven't done any development in C# yet.
What's a good resource for learning XNA, from the point of view of someone who's already an expert programmer? | 0 | [
2,
98,
22,
18,
21,
254,
6577,
26,
2477,
993,
325,
60,
800,
3726,
3726,
31,
22,
195,
74,
5154,
5737,
68,
29,
250,
522,
17,
993,
325,
9,
31,
22,
79,
614,
40,
5390,
272,
118,
150,
20512,
17968,
9,
31,
1302,
120,
109,
272,
5910,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I pass an arbitrary block of commands to a bash function?
===
I am working on a bash script where I need to conditionally execute some things if a particular file exists. This is happening multiple times, so I abstracted the following function:
function conditional-do {
if [ -f $1 ]
then
$2
else
echo "File doesn't exist!"
end
}
Now, when I want to execute this, I do something like:
function exec-stuff {
echo "do some command"
echo "do another command"
}
conditional-do /path/to/file exec-stuff
The problem is, I am bothered that I am defining 2 things: the function of a group of commands to execute, and then invoking my first function.
I would like to pass this block of commands (often 2 or more) directly to "conditional-do" in a clean manner, but I have no idea how this is doable (or if it is even possible)... does anyone have any ideas?
Note, I need it to be a readable solution... otherwise I would rather stick with what I have. | 0 | [
2,
92,
31,
1477,
40,
17237,
1921,
16,
14294,
20,
21,
13158,
1990,
60,
800,
3726,
3726,
31,
589,
638,
27,
21,
13158,
3884,
113,
31,
376,
20,
2874,
1326,
15644,
109,
564,
100,
21,
1498,
3893,
5636,
9,
48,
25,
4942,
1886,
436,
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... |
In OOP, In what cases do you act on an object instead of letting the object act ?
===
In what cases,or for what kind of algorithms, do you start using your objects as data structure with methodes outside of the objects (ie : Tree Walking, etc...).
What scheme do you use ? (Visitor ? pattern-matching ?)
Or do you think an object should always be the only one allowed to act on its own data ?
| 0 | [
2,
19,
13,
21709,
15,
19,
98,
1871,
107,
42,
601,
27,
40,
3095,
700,
16,
4252,
14,
3095,
601,
13,
60,
800,
3726,
3726,
19,
98,
1871,
15,
248,
26,
98,
825,
16,
15935,
15,
107,
42,
799,
568,
154,
3916,
28,
1054,
1411,
29,
2109... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get scientific results from non-experimental data (datamining?)
===
- I want to obtain maximum performance out of a process with many variables, many of which cannot be controlled.
- I cannot run thousands of experiments, so it'd be nice if I could run hundreds of experiments and
- vary many controllable parameters
- collect data on many parameters indicating performance
- 'correct,' as much as possible, for those parameters I couldn't control
- Tease out the 'best' values for those things I can control, and start all over again
It feels like this would be called data mining, where you're going through tons of data which doesn't immediately appear to relate, but does show correlation after some effort.
So... Where do I start looking at algorithms, concepts, theory of this sort of thing? Even related terms for purposes of search would be useful.
-Adam
Background: I like to do ultra-marathon cycling, and keep logs of each ride. I'd like to keep more data, and after hundreds of rides be able to pull out information about how I perform.
However, everything varies - routes, environment (temp, pres., hum., sun load, wind, precip., etc), fuel, attitude, weight, water load, etc, etc, etc. I can control a few things, but running the same route 20 times to test out a new fuel regime would just be depressing, and take years to perform all the experiments that I'd like to do. I can, however, record all these things and more(telemetry on bicycle FTW). | 0 | [
2,
184,
20,
164,
2272,
1736,
37,
538,
8,
6899,
6137,
19854,
1054,
13,
5,
18768,
2160,
68,
60,
6,
800,
3726,
3726,
13,
8,
31,
259,
20,
5545,
2979,
956,
70,
16,
21,
953,
29,
151,
12157,
15,
151,
16,
56,
1967,
44,
3959,
9,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get the value of the jdbc.batch_size property at runtime for a Web application using Spring MVC and Hibernate?
===
According to what I have found so far, I can use the following code:
<pre>
LocalSessionFactoryBean sessionFactory = (LocalSessionFactoryBean)super.getApplicationContext().getBean("&sessionFactory");
System.out.println(sessionFactory.getConfiguration().buildSettings().getJdbcBatchSize());
</pre>
but then I get a Hibernate Exception:
org.hibernate.HibernateException: No local DataSource found for configuration - dataSource property must be set on LocalSessionFactoryBean
Can somebody shed some light?
| 0 | [
2,
184,
107,
31,
164,
14,
1923,
16,
14,
487,
43,
7229,
9,
4900,
673,
1,
10454,
1354,
35,
485,
891,
26,
21,
2741,
3010,
568,
1573,
307,
8990,
17,
4148,
2102,
8820,
60,
800,
3726,
3726,
496,
20,
98,
31,
57,
216,
86,
463,
15,
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... |
Which SharePoint 2007 features are not available to Office 2003 users?
===
I have been tasked with coming up with a compatibility guide for SharePoint 2007 comparing Office 2003 and Office 2007. Does anyone know where to find such a list?
I have been searching for awhile but I cannot seem to find a comprehensive list.
Thanks :) | 0 | [
2,
56,
1891,
3132,
624,
967,
50,
52,
904,
20,
488,
973,
3878,
60,
800,
3726,
3726,
31,
57,
74,
14605,
29,
880,
71,
29,
21,
13,
21618,
3378,
26,
1891,
3132,
624,
15047,
488,
973,
17,
488,
624,
9,
630,
1276,
143,
113,
20,
477,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Parameterized SQL Columns?
===
I have some code which utilizes parameterized queries to prevent against injection, but I also need to be able to dynamically construct the query regardless of the structure of the table. What is the proper way to do this?
Here's an example, say I have a table with columns Name, Address, Telephone. I have a web page where I run <b>Show Columns</b> and populate a select drop-down with them as options.
Next, I have a textbox called <b>Search</b>. This textbox is used as the parameter.
Currently my code looks something like this:
<pre>
result = pquery('SELECT * FROM contacts WHERE `' + escape(column) + '`=?', search);
</pre>
I get an icky feeling from it though. The reason I'm using parameterized queries is to avoid using <b>escape</b>. Also, <b>escape</b> is likely not designed for escaping column names.
How can I make sure this works the way I intend?
| 0 | [
2,
18906,
1333,
4444,
255,
7498,
60,
800,
3726,
3726,
31,
57,
109,
1797,
56,
13151,
18,
18906,
1333,
9386,
2829,
20,
2501,
149,
13646,
15,
47,
31,
67,
376,
20,
44,
777,
20,
7782,
1326,
6960,
14,
25597,
7148,
16,
14,
1411,
16,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I call a .NET assembly from C/C++?
===
Suppose I am writing an application in C++ and C#. I want to write the low level parts in C++ and write the high level logic in C#. How can I load a .NET assembly from my C++ program and start calling methods and accessing the properties of my C# classes? | 0 | [
2,
184,
107,
31,
645,
21,
13,
9,
2328,
1475,
37,
272,
118,
150,
20512,
60,
800,
3726,
3726,
5787,
31,
589,
1174,
40,
3010,
19,
272,
20512,
17,
272,
5910,
9,
31,
259,
20,
2757,
14,
708,
662,
1341,
19,
272,
20512,
17,
2757,
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 do I Yield to the UI thread to update the UI while doing batch processing in a WinForm app?
===
I have a WinForms app written in C# with .NET 3.5. It runs a lengthy batch process. I want the app to update status of what the batch process is doing. What is the best way to update the UI? | 0 | [
2,
184,
107,
31,
11537,
20,
14,
13,
5661,
9322,
20,
11100,
14,
13,
5661,
133,
845,
13064,
5511,
19,
21,
628,
4190,
4865,
60,
800,
3726,
3726,
31,
57,
21,
628,
4190,
18,
4865,
642,
19,
272,
5910,
29,
13,
9,
2328,
203,
9,
264,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 debug exe with soem switch flags from command prompt
===
for e.g from command prompt I need to launch the exe with some switch flags under debugger. How do I do it?
This is an exe from c/c++ and built using VS2005 environment that I need debug. I pass some flags to this exe to perform some stuff. | 0 | [
2,
184,
92,
31,
121,
16254,
1396,
62,
29,
86,
1503,
5521,
9318,
37,
1202,
11443,
4417,
800,
3726,
3726,
26,
13,
62,
9,
263,
37,
1202,
11443,
4417,
31,
376,
20,
3394,
14,
1396,
62,
29,
109,
5521,
9318,
131,
121,
2345,
11356,
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... |
Best approach to web service powered by a daemon
===
I am relatively new to web services and am wondering what the standard "best approach" is. Basically, the way things work is I need to have a task running the background constantly.
The the web service will connect to the daemon and return with an appropriate response. Currently, the communication is over unix domain sockets (Linux is the expected server platform).
Is this the "right" way to do this? Or is there a more proper way to have a background task that your web-server is based on? | 0 | [
2,
246,
2141,
20,
2741,
365,
7462,
34,
21,
13127,
800,
3726,
3726,
31,
589,
3109,
78,
20,
2741,
687,
17,
589,
5712,
98,
14,
1236,
13,
7,
4936,
2141,
7,
25,
9,
11374,
15,
14,
161,
564,
170,
25,
31,
376,
20,
57,
21,
3005,
946,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
QDrag destroyed while dragging
===
I have a Windows/Linux Qt 4.3 application that uses drag and drop in a QTreeView. I have two very similar applications which use the same set of Qt libraries. Drag and drop works in both on Linux but only in one on Windows.
In the application that does not work the QDrag object gets deleted as soon as the mouse is moved. It is deleted by a DeferredDelete event from the event queue which is still processed in Qt during a drag. I do not know how to see what is causing the QDrag object to get deleted prematurely.
I can not figure out a good way to debug this problem. I have compared the source and cannot find anything obvious. I have tried using the code from one of the applications in the other application.
Any suggestions? | 0 | [
2,
2593,
43,
11208,
2183,
133,
13052,
800,
3726,
3726,
31,
57,
21,
1936,
118,
1226,
7147,
2593,
38,
268,
9,
240,
3010,
30,
2027,
5501,
17,
2804,
19,
21,
2593,
8101,
4725,
9,
31,
57,
81,
253,
835,
3767,
56,
275,
14,
205,
309,
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... |
Practical example of Lisp's flexibility?
===
Someone is trying to sell Lisp to me, as a super powerful language that can do everything ever, and then some.
Can anyone provide a <em>practical</em> code example of Lisp's power?<br/>(Preferably alongside equivalent logic coded in a regular language.) | 4 | [
2,
5713,
823,
16,
2093,
3401,
22,
18,
19401,
60,
800,
3726,
3726,
737,
25,
749,
20,
3344,
2093,
3401,
20,
55,
15,
28,
21,
1026,
2177,
816,
30,
92,
107,
796,
462,
15,
17,
94,
109,
9,
92,
1276,
1181,
21,
13,
1,
1503,
1,
7310,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
regular expression to replace two (or more) consecutive characters by only one?
===
In java, which regular expression can be used to replace these,
for example:
before:
aaabbb
after:
ab
before:
14442345
after:
142345
thanks! | 0 | [
2,
1290,
1803,
20,
3934,
81,
13,
5,
248,
91,
6,
4195,
1766,
34,
104,
53,
60,
800,
3726,
3726,
19,
8247,
15,
56,
1290,
1803,
92,
44,
147,
20,
3934,
158,
15,
26,
823,
45,
115,
45,
15916,
220,
3490,
75,
45,
5941,
115,
45,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0... |
How to create an AxHost solely in code [C#]
===
I'm using a COM Wrapper to interact with Windows Media Player.
The it is using an AxHost to somehow wrap the player, for me it's all just magic under the hood^^
The AxHost.AttachInterfaces looks like this
protected override void AttachInterfaces()
{
try
{
//Get the IOleObject for Windows Media Player.
IOleObject oleObject = this.GetOcx() as IOleObject;
//Set the Client Site for the WMP control.
oleObject.SetClientSite(this as IOleClientSite);
Player = this.GetOcx() as WMPLib.WindowsMediaPlayer;
...
Everything is working find as long as I host this AxHost in a Windows Forms control. But I can't hook up the events in a constructor.
This for example doesn't work:
public WMPMediaRating()
{
var remote = new WMPRemote.RemotedWindowsMediaPlayer();
_WMP = remote.Player;
_WMP.MediaChange += new _WMPOCXEvents_MediaChangeEventHandler(_WMP_MediaChange);
}
remote.Player is always null and the program crashes with a NullReferencesException.
The code in AttachInterfaces() is somehow only executed after the Form has been drawn, or after everything else is done.
I tried calling AttachInterfaces() by hand, but that didn't work either because GetOcx() returns nothing.
----------
So how can I instantiate my AxHost-inherited control without Windows Forms, to use it for example in a console application?
**Thanks**
| 0 | [
2,
184,
20,
1600,
40,
21,
396,
11694,
9748,
19,
1797,
636,
150,
5910,
500,
800,
3726,
3726,
31,
22,
79,
568,
21,
13,
960,
28051,
20,
10001,
29,
1936,
941,
517,
9,
14,
32,
25,
568,
40,
21,
396,
11694,
20,
3625,
8118,
14,
517,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Popup Window similar to Modal Window
===
I need to open a popup Window to a cross domain content. I should not allow the user either to access or close the parent window, till i am done with Child window.
The main issue with Modal window is that stops any asynchrnous process running on the main window. For example, timers and auto refresh wont be working in the parent window.
Is there any perfect way to do the above said.
Thanks in advance | 0 | [
2,
1675,
576,
1463,
835,
20,
13,
20756,
1463,
800,
3726,
3726,
31,
376,
20,
368,
21,
1675,
576,
1463,
20,
21,
919,
4603,
2331,
9,
31,
378,
52,
1655,
14,
4155,
694,
20,
1381,
54,
543,
14,
4766,
1463,
15,
3924,
31,
589,
677,
29,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
GCC - "expected unqualified-id before ')' token"
===
Please bear with me, I'm just learning C++.
I'm trying to write my header file (for class) and I'm running into an odd error.
cards.h:21: error: expected unqualified-id before ')' token
cards.h:22: error: expected `)' before "str"
cards.h:23: error: expected `)' before "r"
What does "expected unqualified-id before ')' token" mean? And what am I doing wrong?
Edit: Sorry, I didn't post the entire code.
/*
Card header file
[Author]
*/
// NOTE: Lanugage Docs here http://www.cplusplus.com/doc/tutorial/
#define Card
#define Hand
#define AppError
#include <string>
using namespace std;
// TODO: Docs here
class Card { // line 17
public:
enum Suit {Club, Diamond, Spade, Heart};
enum Rank {Two, Three, Four, Five, Six, Seven, Eight, Nine,
Ten, Jack, Queen, King, Ace};
Card(); // line 22
Card(string str);
Card(Rank r, Suit s);
Edit: I'm just trying to compile the header file by itself using "g++ file.h". | 0 | [
2,
489,
3384,
13,
8,
13,
7,
6899,
11557,
69,
367,
22120,
8,
1340,
115,
13,
22,
6,
22,
20,
2853,
7,
800,
3726,
3726,
2247,
2746,
29,
55,
15,
31,
22,
79,
114,
2477,
272,
20512,
9,
31,
22,
79,
749,
20,
2757,
51,
157,
106,
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... |
Tools to enable translation of A-Box ontology data
===
Does anyone know of any tools capable of defining a declarative mapping from T-Box structures from one ontology to another, which when executed can effect translation of A-Box instance data from one ontology's form to another's?
I have recently written such a tool to meet my needs, but I was wondering if I reinvented the wheel. | 0 | [
2,
4672,
20,
9240,
4064,
16,
21,
8,
5309,
27,
17810,
1054,
800,
3726,
3726,
630,
1276,
143,
16,
186,
4672,
3868,
16,
14684,
21,
121,
12078,
3366,
13305,
37,
13,
38,
8,
5309,
3815,
37,
53,
27,
17810,
20,
226,
15,
56,
76,
5557,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where do you put your CSS Margins?
===
When you want to add whitespace between HTML elements (using CSS), to which element do you attach it?
I'm regularly in situations along these lines:
<body>
<h1>This is the heading</h1>
<p>This is a paragraph</p>
<h1>Here's another heading</h1>
<div>This is a footer</div>
</body>
Now, say I wanted 1em of space between each of these elements, but none above the first h1 or below the last div. To which elements would I attach it?
Obviously, there's no real __technical__ difference between this:
h1, p { margin-bottom: 1em; }
...and this...
div { margin-top: 1em; }
p { margin-top: 1em; margin-bottom: 1em }
What I'm interested is secondary factors:
1. Consistency
1. Applicability to all situations
1. Ease / Simplicity
1. Ease of making changes
For example: in this particular scenario, I'd say that the first solution is better than the second, as it's simpler; you're only attaching a margin-bottom to two elements in a single property definition. However, I'm looking for a more general-purpose solution. Every time I do CSS work, I get the feeling that there's a good rule of thumb to apply... but I'm not sure what it is. Does anyone have a good argument? | 0 | [
2,
113,
107,
42,
442,
154,
272,
18,
18,
5440,
18,
60,
800,
3726,
3726,
76,
42,
259,
20,
3547,
359,
5582,
128,
13,
15895,
2065,
13,
5,
12655,
272,
18,
18,
6,
15,
20,
56,
4520,
107,
42,
19514,
32,
60,
31,
22,
79,
4217,
19,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ClickOnce Online-Only Application as a TS RemoteApp
===
I've attempted just about everything to get our ClickOnce VB.NET app to run under Terminal Services as a RemoteApp. I have a batch file that runs the SETUP.EXE file for the app, which verifies/installs prerequisites and then launches the .application file
This works fine over a mapped drive (or UNC) from a normal workstation on the network or even via RDP desktop session on the terminal server. As a TS RemoteApp, however, well... not so much.
I get a quick flash of command prompt (the batch file), the "Setup is initializing components" message from setup.exe and then... nothing...
I found a [technet.microsoft.com][1] discussion about the issue, but there's no resolution to it listed.
For anyone who has run into this before and got it working, what did you have to do?
Having the remote users log into a desktop session is a possible (last resort) solution, but they currently use RemoteApp's for just about everything else, so I'm hoping to stick with that if possible.
[1]: http://social.technet.microsoft.com/forums/en-US/winserverTS/thread/0226cf94-133c-4b22-9800-942e7d091c71/ | 0 | [
2,
10840,
13120,
2087,
8,
4965,
3010,
28,
21,
13,
38,
18,
5388,
7753,
800,
3726,
3726,
31,
22,
195,
3066,
114,
88,
796,
20,
164,
318,
10840,
13120,
13,
20468,
9,
2328,
4865,
20,
485,
131,
3855,
687,
28,
21,
5388,
7753,
9,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
VS/vb.net: How to get the instance used by a With statement in the immediate window
===
VB.Net has a the very handy "with" statement, but it also lets you use it on an unnamed variable, like this:
With New FancyClass()
.Level = "SuperSpiffy"
.Style = Slimming
.Execute()
End With
Is there a way to get at the "hidden" instance, so I can view it's properties in the Immeidate window? I doubt I'll get it in the watch windows, so immediate is fine.
If you try to access the instance the same way (say, when .Execute() throws an exception) from the Immediate window, you get an error:
? .Style
'With' contexts and statements are not valid in debug windows.
Is there any trick that can be used to get this, or should I just convert the code to another style? If With functioned more like a Using statement, eg. "With v = New FancyClass()", this wouldn't pose a problem. | 0 | [
2,
4611,
118,
20468,
9,
2328,
45,
184,
20,
164,
14,
4851,
147,
34,
21,
29,
3331,
19,
14,
5231,
1463,
800,
3726,
3726,
13,
20468,
9,
2328,
63,
21,
14,
253,
20277,
13,
7,
1410,
7,
3331,
15,
47,
32,
67,
6884,
42,
275,
32,
27,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Regular expression to match hostname or IP Address?
===
Does anyone have a regular expression handy that will match any legal DNS hostname or IP address?
It's easy to write one that works 95% of the time, but I'm hoping to get something that's well tested to exactly match the latest RFC specs for hostnames.
| 0 | [
2,
1290,
1803,
20,
730,
2015,
7259,
54,
15735,
3218,
60,
800,
3726,
3726,
630,
1276,
57,
21,
1290,
1803,
20277,
30,
129,
730,
186,
1517,
13,
43,
2172,
2015,
7259,
54,
15735,
3218,
60,
32,
22,
18,
2010,
20,
2757,
53,
30,
693,
13,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I run an OpenGL application installed on a linux machine from my windows machine?
===
In the spirit of being helpful, this is a problem I had and solved, so I will answer the question here.
**Problem**
I have:
An application that has to be installed on on Redhat or SuSE enterprise.
It has huge system requirements and requires OpenGL.
It is part of a suite of tools that need to operate together on one machine.
This application is used for a time intensive task in terms of man hours.
I don't want to sit in the server room working on this application.
So, the question came up... how do I run this application from a remote windows machine?
I'll outline my solution. Feel free to comment on alternatives. This solution should work for simpler environments as well. My case is somewhat extreme.
| 0 | [
2,
184,
92,
31,
485,
40,
368,
8430,
3010,
4066,
27,
21,
13024,
1940,
37,
51,
1936,
1940,
60,
800,
3726,
3726,
19,
14,
2659,
16,
142,
15600,
15,
48,
25,
21,
1448,
31,
41,
17,
15091,
15,
86,
31,
129,
1623,
14,
1301,
235,
9,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Fastest way to remove non-numeric characters from a VARCHAR in SQL Server
===
I'm writing an import utility that is using phone numbers as a unique key within the import.
I need to check that the phone number does not already exist in my DB. The problem is that phone numbers in the DB could have things like dashes and parenthesis and possibly other things. I wrote a function to remove these things, the problem is that it is **slow** and with thousands of records in my DB and thousands of records to import at once, this process can be unacceptably slow. I've already made the phone number column an index.
I tried using the script from this post:
[http://stackoverflow.com/questions/52315/t-sql-trim-nbsp-and-other-non-alphanumeric-characters][1]
But that didn't speed it up any.
Is there a faster way to remove non-numeric characters? Something that can perform well when 10,000 to 100,000 records have to be compared.
Whatever is done needs to perform **fast**.
[1]: http://stackoverflow.com/questions/52315/t-sql-trim-nbsp-and-other-non-alphanumeric-characters | 0 | [
2,
7518,
161,
20,
4681,
538,
8,
6336,
14744,
1766,
37,
21,
4033,
5433,
19,
4444,
255,
8128,
800,
3726,
3726,
31,
22,
79,
1174,
40,
9010,
10082,
30,
25,
568,
1132,
2116,
28,
21,
2619,
1246,
363,
14,
9010,
9,
31,
376,
20,
2631,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why isn't LISP more widely used?
===
I've heard a lot of people espouse the capabilities of LISP and its omnipotent macros. If LISP is such a great language, why isn't it being adopted more? What problems is LISP facing that is holding it back from (re)emerging as popular language? Is it something about LISP itself ("those brackets!" is a poor answer, IMHO), or its competitors (e.g. the dominance of Java, .NET)? | 4 | [
2,
483,
2532,
22,
38,
2093,
3401,
91,
2525,
147,
60,
800,
3726,
3726,
31,
22,
195,
752,
21,
865,
16,
148,
9867,
1291,
62,
14,
10209,
16,
2093,
3401,
17,
82,
14677,
4296,
2291,
9069,
18,
9,
100,
2093,
3401,
25,
145,
21,
374,
81... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Does OSGi Solve?
===
I've read on wikipedia and other sites about OSGi, but I don't really see the big picture. It says that it's a component based platform, and that you can reload modules at runtime. Also the "practical example" given everywhere is the Eclipse Plugin Framework.
My questions are:
1) What is the CLEAR and SIMPLE definition of OSGi?
2) What COMMON PROBLEMS does it solve?
By "common problems" I mean problems we face everyday, like "what can OSGi do for making our jobs more efficient/fun/simple"
Thanks. | 0 | [
2,
98,
630,
13,
759,
2234,
8402,
60,
800,
3726,
3726,
31,
22,
195,
1302,
27,
20169,
17,
89,
3259,
88,
13,
759,
2234,
15,
47,
31,
221,
22,
38,
510,
196,
14,
580,
2151,
9,
32,
898,
30,
32,
22,
18,
21,
5912,
432,
2452,
15,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Calculate the Hilbert value of a point for use in a Hilbert R-Tree?
===
I have an application where a Hilbert R-Tree [(wikipedia)][wikipedia] [(citeseer)][citeseer] would seem to be an appropriate data structure. Specifically, it requires reasonably fast spatial queries over a data set that will experience a lot of updates.
However, as far as I can see, none of the descriptions of the algorithms for this data structure even *mention* how to actually calculate the requisite **Hilbert Value**; which is the distance along a [Hilbert Curve][curve] to the point.
So any suggestions for how to go about calculating this?
[wikipedia]: http://en.wikipedia.org/wiki/Hilbert_R-tree
[citeseer]: http://citeseer.comp.nus.edu.sg/84580.html
[curve]: http://en.wikipedia.org/wiki/Hilbert_curve | 0 | [
2,
18469,
14,
28059,
1923,
16,
21,
454,
26,
275,
19,
21,
28059,
761,
8,
8101,
60,
800,
3726,
3726,
31,
57,
40,
3010,
113,
21,
28059,
761,
8,
8101,
636,
5,
17375,
26132,
6,
500,
2558,
17375,
26132,
500,
636,
5,
10424,
18,
7911,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 synchronize the address book in my app using MAPI?
===
The system I'm working on contains an address book. I am looking for sample code that will synchronize addresses with the current users address book through MAPI. I need two-way sync.
If you know of any open-source library with easy to use functions for this, I'd be glad to hear about it. If you know of a library that is not open-source, well, that is fine too.
And if you, god forbid, know of a library that will make it *easy* for me to publish my address book in a MAPI provider - well, then I'm dying to hear about it!
Using an external address book and ditching our own is not an option that would serve our customers.
A good, working code sample using vanilla MAPI is of course also acceptable. ;-) | 0 | [
2,
184,
107,
31,
13,
16023,
2952,
14,
3218,
360,
19,
51,
4865,
568,
2942,
49,
60,
800,
3726,
3726,
14,
329,
31,
22,
79,
638,
27,
1588,
40,
3218,
360,
9,
31,
589,
699,
26,
5717,
1797,
30,
129,
13,
16023,
2952,
12636,
29,
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 do I write a custom validation method with parameters for my ActiveRecord model?
===
In my model I have:
> validate :my_custom_validation
>
> def my_custom_validation
>> errors.add_to_base("error message") if condition.exists?
>
>end
I would like to add some parameters to mycustomer vaildation like so:
> validate :my_custom_validation, :parameter1 => x, :parameter2 => y
How do I write the mycustomvalidation function to account for parameters? | 0 | [
2,
184,
107,
31,
2757,
21,
5816,
27999,
2109,
29,
12905,
26,
51,
1348,
14953,
1061,
60,
800,
3726,
3726,
19,
51,
1061,
31,
57,
45,
13,
1,
7394,
1373,
13,
45,
915,
1,
4636,
6015,
1,
18506,
43,
857,
13,
1,
13,
1,
6312,
51,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get a distinct list of words used in all Field Records using MS SQL?
===
If I have a table field named 'description', what would be the SQL (using MS SQL) to get a list of records of all distinct words used in this field.
For example:
If the table contains the following for the 'description' field:
Record1 "The dog jumped over the fence."
Record2 "The giant tripped on the fence."
...
The SQL record output would be:
"The","giant","dog","jumped","tripped","on","over","fence"
| 0 | [
2,
184,
20,
164,
21,
4421,
968,
16,
715,
147,
19,
65,
575,
742,
568,
4235,
4444,
255,
60,
800,
3726,
3726,
100,
31,
57,
21,
859,
575,
377,
13,
22,
546,
8741,
872,
22,
15,
98,
83,
44,
14,
4444,
255,
13,
5,
12655,
4235,
4444,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 most stable, least intrusive way to track web traffic between two sites?
===
I need to track traffic between a specific set of web sites. I would then store the number of clicks in a database table with the fields **fromSite**, **toSite**, **day**, **noOfClicks**. The complete urls are unimportant - only web site identity is needed.
I've ruled out *redirects* since I don't want my server to be a single point of failure. I want the links to work even if the tracking application or server is down or overloaded.
Another goal is to minimize the work each participating site has to do in order for the tracking to work.
What would be the best way to solve this problem? | 0 | [
2,
98,
25,
14,
127,
4521,
15,
639,
19,
8989,
18,
1284,
161,
20,
792,
2741,
2227,
128,
81,
3259,
60,
800,
3726,
3726,
31,
376,
20,
792,
2227,
128,
21,
1903,
309,
16,
2741,
3259,
9,
31,
83,
94,
1718,
14,
234,
16,
10840,
18,
19... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I plan an enterprise level web application?
===
So, I'm at a point in my freelance career where I've developed several web applications for small to medium sized businesses that support things such as project management, booking/reservations, and email management.
I like the work but find that eventually my applications get to a point where the overhear for maintenance is very high. I look back at code I wrote 6 months ago and find I have to spend a while just relearning how I originally coded it before I can make a fix or feature additions. I do try to practice using frameworks (I've used Zend Framework before, and am considering Django for my next project)
What techniques or strategies do you use to plan out an application that is capable of handling a lot of users without breaking and still keeping the code clean enough to maintain easily?
If anyone has any books or articles they could recommend, that would be greatly appreciated as well. | 0 | [
2,
184,
107,
31,
944,
40,
6002,
662,
2741,
3010,
60,
800,
3726,
3726,
86,
15,
31,
22,
79,
35,
21,
454,
19,
51,
16043,
545,
113,
31,
22,
195,
885,
238,
2741,
3767,
26,
284,
20,
4152,
13,
6560,
4426,
30,
555,
564,
145,
28,
669... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 best connect Seam and GWT in a stateful web application?
===
We have a web application that was implemented using GWT. What it presents is fetched from a Jboss/Seam server using the remoting mechanism, and this works fine. However, the application is now extended to support sessions and users. The Seam GWT service doesn't seem to provide a way to let me log in such that Seam can return restricted data back to the GWT application, and so it looks to me that I will have to wrap the GWT application in facelets.
It is not obvious to me that a login using the Seam session mechanism will help me get correct data into the GWT application however, so my question is whether I will be lucky and it will just work, or if I need to do some client side magic, server side magic or if my perception of missing login functionality in the Seam GWT service actually is wrong.
Bonus points to anyone that can provide me with a complete example showing something similar. | 0 | [
2,
184,
92,
31,
246,
6379,
13927,
17,
14094,
38,
19,
21,
146,
1566,
2741,
3010,
60,
800,
3726,
3726,
95,
57,
21,
2741,
3010,
30,
23,
6807,
568,
14094,
38,
9,
98,
32,
7992,
25,
13,
28998,
37,
21,
487,
10349,
18,
118,
6858,
79,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQLPlus settings to generate tab-separated data file
===
Anyone have a good set of sqlplus configuration directives to help transform a given sql query into nicely tab separated output for pulling into a spreadsheet or further processing? | 0 | [
2,
4444,
255,
13349,
12410,
20,
7920,
6523,
8,
18,
14189,
7432,
1054,
3893,
800,
3726,
3726,
1276,
57,
21,
254,
309,
16,
4444,
255,
13349,
8091,
15626,
18,
20,
448,
8007,
21,
504,
4444,
255,
25597,
77,
24050,
6523,
4196,
5196,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Anonymous methods/delegates and lambda expressions
===
With the advent of new features like lambda expressions (inline code), does it mean we dont have to use delegates or anonymous methods anymore? In almost all the samples I have seen, it is for rewriting using the new syntax.
Any place where we still have to use delegates and lambda expressions won't work? | 0 | [
2,
10364,
3195,
118,
24249,
3322,
18,
17,
13,
24187,
13832,
800,
3726,
3726,
29,
14,
14707,
16,
78,
967,
101,
13,
24187,
13832,
13,
5,
108,
1143,
1797,
6,
15,
630,
32,
884,
95,
1049,
57,
20,
275,
10845,
54,
10364,
3195,
3375,
60... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you programmatically identify the number of references to a method with C#
===
I've recently inherited C# console application that is in need of some pruning and clean up. Long story short, the app consists of a single class containing over 110,000 lines of code. Yup, over 110,000 lines in a single class. And, of course, the app is core to our business, running 'round the clock updating data used on a dynamic website. Although I'm told my predecessor was "a really good programmer", it obvious he was not at all into OOP (or version control).
Anyway... while familiarizing myself with the code I've found plenty of methods that are declared, but never referenced. It looks as if copy/paste was used to version the code, for example say I have a method called getSomethingImportant(), chances are there is another method called getSomethingImortant_July2007() (the pattern is functionName_[datestamp] in most cases). It looks like when the programmer was asked to make a change to getSomethingImportant() he would copy/paste then rename to getSomethingImortant_[Date](), make changes to getSomethingImortant_[Date](), then change any method calls in the code to the new method name, leaving the old method in the code but never referenced.
I'd like to write a simple console app that crawls through the one huge class and returns a list of all methods with the number of times each method was referenced. By my estimates there are well over 1000 methods, so doing this by hand would take a while.
Are there classes within the .NET framework that I can use to examine this code? Or any other usefull tools that may help identify methods that are declared but never referenced?
(Side question: Has anyone else ever seen a C# app like this, one reeeealy big class? It's more or less one huge procedural process, I know this is the first I've seen, at least of this size.) | 0 | [
2,
184,
107,
42,
625,
6732,
1326,
5808,
14,
234,
16,
7231,
20,
21,
2109,
29,
272,
5910,
800,
3726,
3726,
31,
22,
195,
1989,
7179,
272,
5910,
8650,
3010,
30,
25,
19,
376,
16,
109,
10688,
2981,
17,
2745,
71,
9,
175,
609,
502,
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... |
How do I find out what type each object is in a ArrayList<Object>?
===
I have a ArrayList<Object> made up of different elements imported from a db, made up of strings, numbers, doubles and ints. Is there a way to use a reflection type technique to find out what each type of data each element holds?
FYI: The reason that there is so many types of data is that this is a piece of java code being written to be implemented with different DB's. | 0 | [
2,
184,
107,
31,
477,
70,
98,
1001,
206,
3095,
25,
19,
21,
7718,
5739,
1,
23793,
1,
60,
800,
3726,
3726,
31,
57,
21,
7718,
5739,
1,
23793,
1,
117,
71,
16,
421,
2065,
11808,
37,
21,
13,
9007,
15,
117,
71,
16,
7887,
15,
2116,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is your favorite Visual Studio add-in/setting.
===
What add-in/setting in Visual Studio can you not live without? Which one improves your productivity or fixes something you can't stand in Visual Studio? Why is it your favorite?
My favorite is [aspx edit helper][1] because it does really improve my productivity when working with ASP.NET applications. What it does is provide a quick way to type out server side controls, it automatically fills in runat="server" and id="" and puts your cursor in between the quotes of ID so you can type it in.
[1]: http://www.ardentdev.com/blog/index.php/aspxedithelper | 4 | [
2,
98,
25,
154,
3839,
3458,
1120,
3547,
8,
108,
118,
19831,
9,
800,
3726,
3726,
98,
3547,
8,
108,
118,
19831,
19,
3458,
1120,
92,
42,
52,
515,
366,
60,
56,
53,
3545,
18,
154,
18211,
54,
6098,
160,
301,
42,
92,
22,
38,
1261,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Secure DLL with license file
===
What is the best way to secure the use/loading of a DLL with a license file? | 0 | [
2,
4315,
13,
43,
211,
29,
3962,
3893,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
4315,
14,
275,
118,
16866,
16,
21,
13,
43,
211,
29,
21,
3962,
3893,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Add non-ASCII file names to zip in Java
===
What is the best way to add **non-ASCII** file names to a **zip file** using **Java**, in such a way that the files can be properly read in both **Windows** and **Linux?**
Here is one attempt, adapted from <https://truezip.dev.java.net/tutorial-6.html#Example>, which works in Windows Vista but fails in Ubuntu Hardy. In Hardy the file name is shown as abc-ЖДФ.txt in file-roller.
import java.io.IOException;
import java.io.PrintStream;
import de.schlichtherle.io.File;
import de.schlichtherle.io.FileOutputStream;
public class Main {
public static void main(final String[] args) throws IOException {
try {
PrintStream ps = new PrintStream(new FileOutputStream(
"outer.zip/abc-åäö.txt"));
try {
ps.println("The characters åäö works here though.");
} finally {
ps.close();
}
} finally {
File.umount();
}
}
}
| 0 | [
2,
3547,
538,
8,
472,
1892,
49,
3893,
1817,
20,
12133,
19,
8247,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
3547,
13,
1409,
3951,
8,
472,
1892,
49,
1409,
3893,
1817,
20,
21,
13,
1409,
2553,
306,
3893,
1409,
568,
13,
1409,
1004,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# - Can publicly inherited methods be hidden (e.g. made private to derived class)
===
Suppose I have BaseClass with public methods A and B, and I create DerivedClass through inheritance.
e.g.
public DerivedClass : BaseClass {}
Now I want to develop a method C in DerivedClass that uses A and B. Is there a way I can override methods A and B to be private in DerivedClass so that only method C is exposed to someone who wants to use my DerivedClass? | 0 | [
2,
272,
5910,
13,
8,
92,
6713,
7179,
3195,
44,
3689,
13,
5,
62,
9,
263,
9,
117,
932,
20,
3981,
718,
6,
800,
3726,
3726,
5787,
31,
57,
1000,
1898,
29,
317,
3195,
21,
17,
334,
15,
17,
31,
1600,
3981,
1898,
120,
13852,
9,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to detect 32 bit vs 64 bit in a bash script?
===
I am writing a bash script to deal with some installations in an automated way... I have the possibility of getting one such program in 32 or 64 bit binary... is it possible to detect the machine architecture from bash so I can select the correct binary?
This will be for Ubuntu machines. | 0 | [
2,
25,
32,
938,
20,
9092,
2512,
1142,
4611,
4384,
1142,
19,
21,
13158,
3884,
60,
800,
3726,
3726,
31,
589,
1174,
21,
13158,
3884,
20,
1183,
29,
109,
16885,
19,
40,
14904,
161,
9,
9,
9,
31,
57,
14,
4813,
16,
1017,
53,
145,
625,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Flash toggle snapping
===
long, long ago in a galaxy far far away, You used to be able to toggle snapping in Flash with the ctrl key. Let's say you were dragging the end of a line very close to another object. You could very easily hold the ctrl key down to shut off the snapping and get it in there nice and close without the snap. At some point, Macromedia removed this functionality.
I'm wondering if that single-key-toggle-snapping functionality has gone somewhere else within the app or do I have to click through the menus every time? | 0 | [
2,
4433,
20,
263,
4875,
17890,
800,
3726,
3726,
175,
15,
175,
1464,
19,
21,
9358,
463,
463,
229,
15,
42,
147,
20,
44,
777,
20,
20,
263,
4875,
17890,
19,
4433,
29,
14,
13,
4812,
6362,
1246,
9,
408,
22,
18,
395,
42,
46,
13052,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Accessing an image in the projects resources?
===
How do I access an image during run time that I have added to the projects resources? | 0 | [
2,
1381,
68,
40,
1961,
19,
14,
2314,
2566,
60,
800,
3726,
3726,
184,
107,
31,
1381,
40,
1961,
112,
485,
85,
30,
31,
57,
905,
20,
14,
2314,
2566,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Fetch top X users, plus a specific user (if they're not in the top X)
===
I have a list of ranked users, and would like to select the top 50. I also want to make sure one particular user is in this result set, even if they aren't in the top 50. Is there a sensible way to do this in a single mysql query? Or should I just check the results for the particular user and fetch him separately, if necessary?
Thanks! | 0 | [
2,
18312,
371,
993,
3878,
15,
3123,
21,
1903,
4155,
13,
5,
821,
59,
22,
99,
52,
19,
14,
371,
993,
6,
800,
3726,
3726,
31,
57,
21,
968,
16,
2989,
3878,
15,
17,
83,
101,
20,
5407,
14,
371,
1222,
9,
31,
67,
259,
20,
233,
562,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Validate an incoming SOAP request to the WSDL in PHP
===
The built-in PHP extension for SOAP doesn't validate everything in the incoming SOAP request against the WSDL. It does check for the existence of basic entities, but when you have something complicated like simpleType restrictions the extension pretty much ignores their existence.
What is the best way to validate the SOAP request against 100% of the WSDL? | 0 | [
2,
7394,
1373,
40,
17126,
6447,
3772,
20,
14,
619,
18,
8643,
19,
13,
26120,
800,
3726,
3726,
14,
392,
8,
108,
13,
26120,
3896,
26,
6447,
1437,
22,
38,
7394,
1373,
796,
19,
14,
17126,
6447,
3772,
149,
14,
619,
18,
8643,
9,
32,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can Spring Parse and Inject Properties Files?
===
I already know how to:
Load properties files into my Spring configuration using:
<context:property-placeholder location="aaa/bbb/ccc/stuff.properties"/>
Build properties objects on the fly using:
<props><prop key="abc">some value</prop></props>
But what I cant do, and would be really useful, is to have Spring load a properties file and then build the matching properties object. I could then inject this into a bean in the normal way.
I've searched for this elsewhere without success. Any ideas? | 0 | [
2,
92,
1573,
2017,
870,
17,
20316,
3704,
6488,
60,
800,
3726,
3726,
31,
614,
143,
184,
20,
45,
6305,
3704,
6488,
77,
51,
1573,
8091,
568,
45,
13,
1,
1126,
11969,
45,
10890,
106,
1084,
8,
5119,
12427,
1474,
3726,
7,
22160,
118,
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... |
What is the recommended version of GNU autotools?
===
We maintain a RPM based software distribution at work so that we have a common set of software across all the platforms that we support. As a result we have to build a lot of third party software, and frequently find situations where we need to run autoconf/automake/libtoolize/etc to get it to build on Solaris or another platform.
I've had very mixed results with this. It seems that these tools are fairly brittle and frequently the files only work with the version of autoconf/automake/etc that they were originally written for.
Ideally I'd like to only have to support one version of the GNU autotools, but I get the impression that I'm really going to end up having to have a copy of every version lying around.
Is this unusual, or do other people have the same problems? Is there a subset of the versions of autotools that will cover all cases? | 0 | [
2,
98,
25,
14,
5773,
615,
16,
26092,
3108,
20799,
18,
60,
800,
3726,
3726,
95,
4027,
21,
12936,
432,
2306,
2523,
35,
170,
86,
30,
95,
57,
21,
757,
309,
16,
2306,
464,
65,
14,
6843,
30,
95,
555,
9,
28,
21,
829,
95,
57,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a good general method for debugging C++ macros?
===
In general, I occasionally have a chain of nested macros with a few preprocessor conditional elements in their definitions. These can be painful to debug since it's hard to directly see the actual code being executed.
A while ago I vaguely remember finding a compiler (gcc) flag to expand them, but I had trouble getting this to work in practice. | 0 | [
2,
25,
80,
21,
254,
297,
2109,
26,
121,
16254,
2762,
272,
20512,
9069,
18,
60,
800,
3726,
3726,
19,
297,
15,
31,
4533,
57,
21,
2858,
16,
5618,
69,
9069,
18,
29,
21,
310,
782,
16835,
248,
21206,
2065,
19,
66,
18544,
9,
158,
92,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 refer to the path to an assembly in the GAC within registry entries added by a Windows Installer package?
===
I have a .NET assembly that contains classes to be registered as ServicedComponent through EnterpriseServices (COM+) and invoked through COM RPC by a third-party application. Therefore, I need to both add it to the GAC and add a registry entry under `HKEY_CLASSES_ROOT\CLSID\{clsid}\CodeBase` with the path to the assembly DLL within the GAC folder. (I can't rely on regsvcs to do it, because this is a 32-bit assembly --- it relies on 32-bit third-party components --- and the third-party application I referred to before cannot see classes in Wow6432Node)
So the question is:
Are paths to assemblies to be created in the GAC, or at least the path to the GAC folder itself, available in Windows Installer as properties that can be used in values of registry keys etc.? | 0 | [
2,
184,
20,
5017,
20,
14,
2013,
20,
40,
1475,
19,
14,
4369,
150,
363,
18269,
11399,
905,
34,
21,
1936,
16146,
106,
6030,
60,
800,
3726,
3726,
31,
57,
21,
13,
9,
2328,
1475,
30,
1588,
2684,
20,
44,
3801,
28,
365,
43,
11103,
218... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a good source code search engine?
===
The codebase I work on is huge, and grepping it takes about 20 minutes. I'm looking for a good web-based source code search engine.. something like an intranet version of koders.com.
The only thing I've found is Krugle Enterprise Edition, which doesn't post its prices... and if you have to ask, you can't afford it.
I'd really prefer a plain old search engine, without a lot of other bells and whistles.
| 2 | [
2,
98,
22,
18,
21,
254,
1267,
1797,
2122,
1406,
60,
800,
3726,
3726,
14,
1797,
8436,
31,
170,
27,
25,
2329,
15,
17,
5604,
5574,
32,
1384,
88,
434,
902,
9,
31,
22,
79,
699,
26,
21,
254,
2741,
8,
1281,
1267,
1797,
2122,
1406,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Load external JS from bookmarklet?
===
How can I load an external Javascript file using a bookmarklet? This would overcome the URL length limitations of IE and generally keep things cleaner. | 0 | [
2,
6305,
4886,
487,
18,
37,
360,
4527,
1336,
60,
800,
3726,
3726,
184,
92,
31,
6305,
40,
4886,
8247,
8741,
3893,
568,
21,
360,
4527,
1336,
60,
48,
83,
9059,
14,
287,
6362,
1476,
14070,
16,
13,
660,
17,
1469,
643,
564,
19585,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What makes Ometa special?
===
[Ometa](http://www.cs.ucla.edu/~awarth/ometa/) is "a new object-oriented language for pattern matching." I've encountered pattern matching in languages like Oz tools to parse grammars like Lexx/Yacc or Pyparsing before. Despite looking at example code, reading discussions, and talking to a friend, I still am not able to get a real understanding of what makes Ometa special (or at least, why some people think it is). Any explanation? | 0 | [
2,
98,
1364,
13,
6651,
536,
621,
60,
800,
3726,
3726,
636,
6651,
536,
500,
5,
21127,
6903,
6483,
9,
6824,
9,
22618,
58,
9,
69,
291,
118,
1,
3885,
15444,
118,
6651,
536,
118,
6,
25,
13,
7,
58,
78,
3095,
8,
6800,
816,
26,
3732... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
EJB3 Transaction Propogation
===
I have a stateless bean something like:
@Stateless
public class MyStatelessBean implements MyStatelessLocal, MyStatelessRemote {
@PersistenceContext(unitName="myPC")
private EntityManager mgr;
@TransationAttribute(TransactionAttributeType.NEVER)
public void processObjects(List<Object> objs) {
// this method just processes the data; no need for a transaction
for(Object obj : objs) {
this.process(obj);
}
}
@TransationAttribute(TransactionAttributeType.REQUIRED)
public void process(Object obj) {
// do some work with obj that must be in the scope of a transaction
this.mgr.merge(obj);
// ...
this.mgr.merge(obj);
// ...
this.mgr.merge(obj);
}
}
Basically I have one method that doesn't interact with the entity manager at all, which calls another method in the same class to do the work that requires a transaction. I've tried a number of different transaction types but I get TransactionRequiredException every time merge() is called. I've done (very) little reading on the subject and I suspect I can make this work by splitting up the methods into two different beans, which would be okay for me at the moment. I would really like to understand better why it's not working as-is though.
I'm using JBoss Application Server 4.2.1.GA, but non-specific answers are welcome / preferred. | 0 | [
2,
13,
10022,
220,
240,
12799,
9476,
5598,
857,
800,
3726,
3726,
31,
57,
21,
146,
923,
15322,
301,
101,
45,
13,
1,
3859,
923,
317,
718,
51,
3859,
923,
863,
210,
8713,
18,
51,
3859,
923,
15580,
15,
51,
3859,
923,
99,
20209,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Requiring users to update .NET
===
I'm working on some production software, using C# on the .NET framework. I really would like to be able to use LINQ on the project. I believe it requires .NET version 3.5 (correct me if I'm wrong). This application is a commercial software app, required to run on a client's work PC. Is it reasonable to assume they have .NET 3.5, or assume that they won't mind upgrading to the latest version?
I just wanted to feel out what the consensus was as far as mandating framework upgrades to run apps. | 0 | [
2,
9052,
3878,
20,
11100,
13,
9,
2328,
800,
3726,
3726,
31,
22,
79,
638,
27,
109,
637,
2306,
15,
568,
272,
5910,
27,
14,
13,
9,
2328,
6596,
9,
31,
510,
83,
101,
20,
44,
777,
20,
275,
6294,
1251,
27,
14,
669,
9,
31,
985,
32... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Enabling editing of primary key field in ASP.NET Dynamic Data / LINQ to SQL
===
If you have a table with a compound primary key that is composed of a foreign key and other table columns, how do you get ASP.NET Dynamic Data to allow the non-foreign primary key table columns to be editable? | 0 | [
2,
13168,
9510,
16,
1256,
1246,
575,
19,
28,
306,
9,
2328,
7782,
1054,
13,
118,
6294,
1251,
20,
4444,
255,
800,
3726,
3726,
100,
42,
57,
21,
859,
29,
21,
6089,
1256,
1246,
30,
25,
1869,
16,
21,
1228,
1246,
17,
89,
859,
7498,
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... |
using JTables with netbeans 6.1 aka Matisse
===
**Before you answer: Yes I have read the jtable tutorial over at Sun**. No, it did not help me. Yes, I am a dolt. **Please don't answer with a reference to that document**. What I am specifically interested in is how to dynamically add rows and columns to my Jtable via the Netbeans IDE. I already have an object that contains a hashmap with my data. I can't figure out where or what object I should be passing that object to. Thanks for your time!
I have a vector that contains a series (of length l) of objects (each one corresponding to a row). How do I get that vector object to display on the JTable? | 0 | [
2,
568,
487,
5924,
18,
29,
4275,
863,
5950,
400,
9,
165,
20892,
4277,
11001,
800,
3726,
3726,
13,
1409,
12750,
42,
1623,
45,
1643,
31,
57,
1302,
14,
487,
5924,
29724,
84,
35,
939,
1409,
9,
90,
15,
32,
144,
52,
448,
55,
9,
1643... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 redirect Tornado / VXWorks shell output?
===
I've been working on an embedded C/C++ project recently using the shell in Tornado 2 as a way of debugging what's going on in our kit. The only problem with this approach is that it's a complicated system and as a result, has a fair bit of output. Tornado 'helpfully' scrolls the window every time some new information arrives which means that if you spot an error, it disappears out of site too quickly to see. Each time you scroll up to look, the system adds more information, so the only way to view it is to disconnect the hardware.
I'd love to know if anyone has a way of redirecting the output from Tornado?
I was hoping there might be a way to log it all from a small python app so that I can apply filters to the incoming information. I've tried connecting into the Tornado process, but the window with the information isn't a standard CEditCtrl so extracting the text that way was a dead end.
Any ideas anyone? | 0 | [
2,
184,
107,
31,
302,
14706,
12306,
13,
118,
566,
396,
7684,
3593,
5196,
60,
800,
3726,
3726,
31,
22,
195,
74,
638,
27,
40,
12138,
272,
118,
150,
20512,
669,
1989,
568,
14,
3593,
19,
12306,
172,
28,
21,
161,
16,
121,
16254,
2762... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Changing the default settings for a console application
===
I would prefer that a console app would default to
multithreaded debug.
warning level 4.
build browse information.
no resource folder.
Does anyone know of any technique that would allow me to create a console app, with my desired options, without manually setting it. | 0 | [
2,
4226,
14,
12838,
12410,
26,
21,
8650,
3010,
800,
3726,
3726,
31,
83,
6369,
30,
21,
8650,
4865,
83,
12838,
20,
1889,
96,
10647,
69,
121,
16254,
9,
3590,
662,
268,
9,
1895,
10175,
62,
676,
9,
90,
6577,
19294,
9,
630,
1276,
143,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 debug stored procedures (and write sprocs that are easier to debug)?
===
What are good methodologies for creating sprocs that reduce the pain of debugging? And what tools are out there for debugging stored procedures?
Perhaps most importantly, what are indications to look out for that errors are happening in a sproc and not in the code? I hope I'm not all over the board too terribly bad here. Votes for answers to any of the above. Thanks.
For what it's worth, I work in a .NET environment, SQL servers. | 0 | [
2,
98,
25,
14,
246,
161,
20,
121,
16254,
8214,
8876,
13,
5,
290,
2757,
13,
18,
15617,
18,
30,
50,
4950,
20,
121,
16254,
6,
60,
800,
3726,
3726,
98,
50,
254,
2109,
13331,
18,
26,
2936,
13,
18,
15617,
18,
30,
4136,
14,
1257,
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... |
Is there a way to debug Velocity templates in the traditional code debugging sense?
===
We make heavy use of Velocity in our web application. While it is easy to debug the Java side of things and ensure the Velocity Context is populated correctly, it would be extremely valuable to be able to step through the parsing of the VTL on the merge step, set breakpoints, etc. Are there any tools or IDEs/IDE plugins that would make this kind of thing possible with VTL (Velocity Template Language)? | 0 | [
2,
25,
80,
21,
161,
20,
121,
16254,
10700,
22894,
18,
19,
14,
1361,
1797,
121,
16254,
2762,
1259,
60,
800,
3726,
3726,
95,
233,
1278,
275,
16,
10700,
19,
318,
2741,
3010,
9,
133,
32,
25,
2010,
20,
121,
16254,
14,
8247,
270,
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... |
Javascript with embedded ruby - How to make sure the string does not break?
===
I have this line in a javascript block in a page:
res = foo('<%= @ruby_var %>');
What is the best way to handle the case where @ruby_var has a single-quote in it? Else it will break the js code. | 0 | [
2,
8247,
8741,
29,
12138,
10811,
13,
8,
184,
20,
233,
562,
14,
3724,
630,
52,
1442,
60,
800,
3726,
3726,
31,
57,
48,
293,
19,
21,
8247,
8741,
1921,
19,
21,
2478,
45,
10719,
800,
4310,
111,
5,
22,
1,
11881,
3726,
13,
1,
1820,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
sorting hashes/arrays in awk
===
Is there an easy way to do any of the following things in awk?
- Sorting array/hash by it's data
- Sorting a hash by it's string key | 0 | [
2,
2058,
68,
63,
438,
18,
118,
8576,
93,
18,
19,
13,
3885,
197,
800,
3726,
3726,
25,
80,
40,
2010,
161,
20,
107,
186,
16,
14,
249,
564,
19,
13,
3885,
197,
60,
13,
8,
2058,
68,
7718,
118,
25436,
34,
32,
22,
18,
1054,
13,
8,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0... |
What is a smart pointer and when should I use one?
===
What is a smart pointer and when should I use one? | 0 | [
2,
98,
25,
21,
3978,
454,
106,
17,
76,
378,
31,
275,
53,
60,
800,
3726,
3726,
98,
25,
21,
3978,
454,
106,
17,
76,
378,
31,
275,
53,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Disable button on form submission
===
I have a button that I would like to disable when the form submits to prevent the user submitting multiple times.
I have tried naively disabling the button with javascript onclick but then if a client side validation that fails the button remains disabled.
How do I disable the button when the form successfully submits not just when the user clicks? | 0 | [
2,
1460,
579,
5167,
27,
505,
10923,
800,
3726,
3726,
31,
57,
21,
5167,
30,
31,
83,
101,
20,
1460,
579,
76,
14,
505,
12298,
18,
20,
2501,
14,
4155,
28848,
1886,
436,
9,
31,
57,
794,
16288,
102,
1460,
58,
8599,
14,
5167,
29,
824... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.