unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Ruby: How to break a potentially unicode string into bytes
===
I'm writing a game which is taking user input and rendering it on-screen. The engine I'm using for this is entirely unicode-friendly, so I'd like to keep that if at all possible. The problem is that the rendering loop looks like this:
"string".each_byte do |c|
render_this_letter(c)
end
I don't know a whole lot about i18n, but I know enough to know the above code is only ever going to work for me and people who speak my language. I'd prefer something like:
"unicode string".each_unicode_letter do |u|
render_unicode_letter(u)
end
Does this exist in the core distribution? I'm somewhat averse to adding additional requirements to the install, but if it's the only way to do it, I'll live.
For extra fun, I have no way of knowing if the string is, in fact, a unicode string. | 0 | [
2,
10811,
45,
184,
20,
1442,
21,
9465,
28010,
3724,
77,
34,
3231,
800,
3726,
3726,
31,
22,
79,
1174,
21,
250,
56,
25,
741,
4155,
6367,
17,
15307,
32,
27,
8,
7187,
9,
14,
1406,
31,
22,
79,
568,
26,
48,
25,
2894,
28010,
8,
159... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 languages feature (1 per answer please) should be added to VB.Net in future versions
===
What languages feature (1 per answer please) should be added to VB.Net in future versions? | 0 | [
2,
98,
2556,
1580,
13,
5,
165,
416,
1623,
2247,
6,
378,
44,
905,
20,
13,
20468,
9,
2328,
19,
1022,
3281,
800,
3726,
3726,
98,
2556,
1580,
13,
5,
165,
416,
1623,
2247,
6,
378,
44,
905,
20,
13,
20468,
9,
2328,
19,
1022,
3281,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Is there a tool that will look at my Java code, and suggest a good package structure?
===
I have a large codebase, and I'd like to refactor the package structure so that classes which interact heavily go in the same package.
It seems that it should be possible to create a tool that could look at the interactions between classes, and then group together those classes that interact heavily. These groupings might then suggest a good hierarchy for packages.
Does such a tool exist? (open source is preferred). | 0 | [
2,
25,
80,
21,
5607,
30,
129,
361,
35,
51,
8247,
1797,
15,
17,
5601,
21,
254,
6030,
1411,
60,
800,
3726,
3726,
31,
57,
21,
370,
1797,
8436,
15,
17,
31,
22,
43,
101,
20,
302,
17455,
14,
6030,
1411,
86,
30,
2684,
56,
10001,
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... |
What are the best prctices for handling unicode strings in C#?
===
Can somebody please provide me some important aspects I should be aware of while handling Unicode strings in C#? | 0 | [
2,
98,
50,
14,
246,
5396,
14468,
5052,
26,
7988,
28010,
7887,
19,
272,
5910,
60,
800,
3726,
3726,
92,
8861,
2247,
1181,
55,
109,
681,
4842,
31,
378,
44,
3854,
16,
133,
7988,
28010,
7887,
19,
272,
5910,
60,
3,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Do you know a good Java RSS/Feed Generator?
===
I'm searching a small **Java** based RSS/Feed Generator, something like the [FeedCreator.class.php](http://www.bitfolge.de/rsscreator-en.html) library, any suggestions?, thanks! | 0 | [
2,
107,
42,
143,
21,
254,
8247,
13,
1224,
18,
118,
20954,
15286,
60,
800,
3726,
3726,
31,
22,
79,
5792,
21,
284,
13,
1409,
1004,
1385,
1409,
432,
13,
1224,
18,
118,
20954,
15286,
15,
301,
101,
14,
636,
20954,
26438,
9,
1898,
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... |
Collapsable Drop Dow List Box in HTML
===
Is there any sort of free control which does what the Occupation field does on <http://monster.ca>? That is allow for grouping of the options in a drop down box with expandable sections? I just learned about the optgroup tag (<http://www.braintrove.com/article/18") which is close to what I want, but not quite. | 0 | [
2,
9470,
2552,
18,
579,
2804,
14103,
968,
1649,
19,
13,
15895,
800,
3726,
3726,
25,
80,
186,
2058,
16,
551,
569,
56,
630,
98,
14,
4517,
575,
630,
27,
13,
1,
21127,
6903,
2111,
1911,
9,
793,
1,
60,
30,
25,
1655,
26,
19288,
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... |
Up-To-Date Libnet Tutorials
===
I've googled around for a while trying to find a good libnet tutorial but most of them appear to be out of date or lacking on good code examples. What do you recommend for learning libnet?
I'm also having problems compiling programs using the libnet headers; what's the flag(s) needed for this? | 0 | [
2,
71,
8,
262,
8,
8209,
13,
8326,
2328,
29724,
18,
800,
3726,
3726,
31,
22,
195,
8144,
43,
140,
26,
21,
133,
749,
20,
477,
21,
254,
13,
8326,
2328,
29724,
47,
127,
16,
105,
1893,
20,
44,
70,
16,
1231,
54,
11690,
27,
254,
179... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best way to serialize data in a language-independent binary format?
===
I'm looking into a mechanism for serialize data to be passed over a socket or shared-memory in a language-independent mechanism. I'm reluctant to use XML since this data is going to be very structured, and encoding/decoding speed is vital. Having a good C API that's liberally licensed is important, but ideally there should be support for a ton of other languages. I've looked at [google's protocol buffers](http://code.google.com/apis/protocolbuffers/) and [ASN.1](http://en.wikipedia.org/wiki/ASN.1). Am I on the right track? Is there something better? Should I just implement my own packed structure and not look for some standard? | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
5956,
2952,
1054,
19,
21,
816,
8,
17390,
14171,
2595,
60,
800,
3726,
3726,
31,
22,
79,
699,
77,
21,
6534,
26,
5956,
2952,
1054,
20,
44,
1100,
84,
21,
18482,
54,
2592,
8,
790,
5171,
93,
19,
21... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Building a directory string from component parts in C#
===
If i have lots of directory names either as literal strings or contained in variables, what is the easiest way of combining these to make a complete path?
I know of <pre>Path.Combine</pre> but this only takes 2 string parameters, i need a solution that can take any number number of directory parameters.
e.g:
<pre>
string folder1 = "foo";
string folder2 = "bar";
CreateAPath("C:", folder1, folder2, folder1, folder1, folder2, "MyFile.txt")
</pre>
Any ideas?
Does C# support unlimited args in methods? | 0 | [
2,
353,
21,
16755,
3724,
37,
5912,
1341,
19,
272,
5910,
800,
3726,
3726,
100,
31,
57,
7503,
16,
16755,
1817,
694,
28,
20665,
7887,
54,
3437,
19,
12157,
15,
98,
25,
14,
27237,
161,
16,
12803,
158,
20,
233,
21,
1279,
2013,
60,
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... |
Python PostgreSQL modules. Which is best?
===
I've seen a number of postgresql modules for python like pygresql, pypgsql, psyco. Most of them are Python DB API 2.0 compliant, some are not being actively developed anymore.
Which module do you recommend? | 0 | [
2,
20059,
678,
6879,
18,
22402,
17113,
9,
56,
25,
246,
60,
800,
3726,
3726,
31,
22,
195,
541,
21,
234,
16,
678,
6879,
18,
22402,
17113,
26,
20059,
101,
7103,
6879,
18,
22402,
15,
7103,
9623,
18,
22402,
15,
13,
16033,
716,
9,
127... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 convert an M4A file to an MP3 or WMA file programmatically?
===
Greetings,
I'm trying to find either a free .NET library or a command-line executable that lets me convert M4A files to either MP3s or WMA files. Please help :). | 0 | [
2,
184,
107,
31,
8406,
40,
307,
300,
58,
3893,
20,
40,
4628,
240,
54,
619,
540,
3893,
625,
6732,
1326,
60,
800,
3726,
3726,
13769,
18,
15,
31,
22,
79,
749,
20,
477,
694,
21,
551,
13,
9,
2328,
1248,
54,
21,
1202,
8,
1143,
139... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tracking changes in Windows registry
===
Is there a way to track changes in Windows registry? I'd like to see what changes in the registry are made during installation of various programs. | 0 | [
2,
10353,
1693,
19,
1936,
18269,
800,
3726,
3726,
25,
80,
21,
161,
20,
792,
1693,
19,
1936,
18269,
60,
31,
22,
43,
101,
20,
196,
98,
1693,
19,
14,
18269,
50,
117,
112,
7758,
16,
617,
1726,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Java: Arrays & Vectors
===
I'm used to working with PHP but lately I've been working with Java and I'm having a headache trying to figure this out. I want to save this representation in Java:
<pre>
Array (
["col_name_1"] => Array (
1 => ["col_value_1"],
2 => ["col_value_2"],
... ,
n => ["col_value_n"]
),
["col_name_n"] => Array (
1 => ["col_value_1"],
2 => ["col_value_2"],
... ,
n => ["col_value_n"]
)
)
</pre>
Is there a clean way (i.e. no dirty code) to save this thing in Java? Note; I would like to use Strings as array indexes (in the first dimension) and I don't know the definite size of the arrays.. | 0 | [
2,
8247,
45,
7718,
18,
279,
7497,
18,
800,
3726,
3726,
31,
22,
79,
147,
20,
638,
29,
13,
26120,
47,
10434,
31,
22,
195,
74,
638,
29,
8247,
17,
31,
22,
79,
452,
21,
14276,
749,
20,
1465,
48,
70,
9,
31,
259,
20,
2079,
48,
54... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I inject a form value with jQuery?
===
I am working with jQuery Form and ASP.NET MVC. Preview 5 of ASP.NET MVC has an Extension Method on HttpRequest called "IsAjaxMvcRequest" that detects if the POST was an Ajax request. This Extension Method basically "sniffs" for a form value called "__MVCASYNCPOST" and (basically) returns true if it sees this element.
What I want to do is inject this value using script (I can't use a hidden field as it defeats the purpose) into the form post - and I don't know how to do that with jQuery.
Here's my code:
<script type="text/javascript">
$(document).ready(function() {
$('#jform').submit(function() {
//add a flag for asynch submit
//" __MVCASYNCPOST
$('#jform').ajaxSubmit({ target: '#results2' });
return false;
});
});
</script>
I really should know how to do this :) but I don't! Also - an economy of code is required here so less LOC is appreciated.
| 0 | [
2,
184,
107,
31,
20316,
21,
505,
1923,
29,
487,
8190,
93,
60,
800,
3726,
3726,
31,
589,
638,
29,
487,
8190,
93,
505,
17,
28,
306,
9,
2328,
307,
8990,
9,
16121,
331,
16,
28,
306,
9,
2328,
307,
8990,
63,
40,
3896,
2109,
27,
77... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can you recommend a PostgreSQL Visual Database Designer for Linux?
===
When I'm in Windows, I use the **excellent** [MicroOLAP](http://www.microolap.com/products/database/postgresql-designer/) Database Designer for PostgreSQL, but its not open source or multiplataform.
Do you know or can recommend me an alternative to this software, that I can use in Linux?
_EDIT: Just to clarify, I don't want to use wine to emulate MicroOlap for PostgreSQL, it doesn't work too well, I would prefer something native, or Java based._ | 0 | [
2,
92,
42,
12360,
21,
678,
6879,
18,
22402,
3458,
6018,
4742,
26,
13024,
60,
800,
3726,
3726,
76,
31,
22,
79,
19,
1936,
15,
31,
275,
14,
13,
1409,
28022,
1409,
636,
22019,
2268,
306,
500,
5,
21127,
6903,
6483,
9,
22019,
2268,
30... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the techniques for face recognition on a bitmap?
===
I'm quite curious about this since it's quite a leap in image processing.
In a broad way, how would one do face recognition on a bitmap? | 0 | [
2,
98,
50,
14,
4212,
26,
276,
3514,
27,
21,
1142,
15022,
60,
800,
3726,
3726,
31,
22,
79,
1450,
7686,
88,
48,
179,
32,
22,
18,
1450,
21,
10336,
19,
1961,
5511,
9,
19,
21,
2748,
161,
15,
184,
83,
53,
107,
276,
3514,
27,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How should the Data Access Layer be structured?
===
I initially designed my system following the s# architecture example [outlined in this codeproject article][1] (Unfortunately, I am not using NHibernate). The basic idea is that for each domain object that would need to communicate with the persistence layer you would have a corresponding Data Access Object in a different library. Each Data Access Object implements an interface and when a domain object needs access to a data access method it always codes against an interface and never against the DAOs themselves.
At the time, and still, I thought this design very flexible. However, as the amount of objects in my domain model has grown I am finding myself questioning if there isn't an organizational problem here. For example, almost every object in the domain ends up with a corresponding Data Access Object and Data Access Object interface. Not only that, but each one of these is in a different place which is more difficult to maintain if I want to do something simple like shift around some namespaces.
Interestingly enough, many of these DAOs (and their corresponding interfaces) are very simple creatures - the most common has only a single GetById() method. I end up with a whole bunch of objects such as
public interface ICustomerDao {
Customer GetById(int id);
}
public interface IProductDao {
Product GetById(int id);
}
public interface IAutomaticWeaselDao {
AutomaticWeasel GetById(int id);
}
Where their implementors are usually very trivial too. This has me wondering if it wouldn't be simpler to go in a different direction, maybe switching my strategy by having a single object for simple data access tasks, and reserving the creation of dedicated Data Access Objects for those that need something a little more complicated.
public interface SimpleObjectRepository {
Customer GetCustomerById(int id);
Product GetProductById(int id);
AutomaticWeasel GetAutomaticWeaselById(int id);
Transaction GetTransactioinById(int id);
}
public interface TransactionDao {
Transaction[] GetAllCurrentlyOngoingTransactionsInitiatedByASweatyGuyNamedCarl();
}
Does anyone has any experience with an architecture like this? Overall I am very happy with the set-up as it is now my only concern being management of all these little files. I am still wondering however what other approaches toward structuring the Data Access Layer exist.
[1]: http://wwww.codeproject.com/KB/architecture/NHibernateBestPractices.aspx
| 0 | [
2,
184,
378,
14,
1054,
1381,
5385,
44,
17784,
60,
800,
3726,
3726,
31,
1537,
1006,
51,
329,
249,
14,
13,
18,
5910,
2607,
823,
636,
1320,
15875,
19,
48,
1797,
21011,
2002,
500,
2558,
165,
500,
13,
5,
1020,
6469,
1020,
1373,
102,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
IDictionary<string, string> or NameValueCollection
===
I'm currently writing an interface to allow applications to send exception data to a central repository for support purposes. I'm at a quandary about how to pass extra contextual data:
public interface IExceptionNotifier
{
void Notify(Exception ex, NameValueCollection context); //this
void Notify(Exception ex, IDictionary<string, string> context); //or this
}
I've often found myself is a similar position when creating lookups. Ignoring whether or not the exception notifier concept is good, is it be best to use an `IDictionary<string, string>` or `NameValueCollection`? Why would you pick one over the other? | 0 | [
2,
31,
22595,
1857,
1,
11130,
15,
3724,
1,
54,
204,
15165,
15015,
872,
800,
3726,
3726,
31,
22,
79,
871,
1174,
40,
6573,
20,
1655,
3767,
20,
2660,
5391,
1054,
20,
21,
521,
24869,
26,
555,
4612,
9,
31,
22,
79,
35,
21,
9836,
43,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
== or .equals()
===
Why use one over the other? | 0 | [
2,
800,
3726,
54,
13,
9,
62,
14512,
18,
5,
6,
800,
3726,
3726,
483,
275,
53,
84,
14,
89,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
StringCollection or an Object container?
===
I recently built an API and was often asked to replace the StringCollections i was returning by objects containing a single property, The reason being that it was easier to bind with a listview or other controls in ASP.Net.
Since the API was used by the web application, the Web service and the dataloader I decided on keeping the StringCollection as my return type.
The methods returned labels for groups or report names.
Did I make the right choice? In such a situation how do you go about justifying your choice? | 0 | [
2,
3724,
15015,
872,
54,
40,
3095,
12147,
60,
800,
3726,
3726,
31,
1989,
392,
40,
21,
2159,
17,
23,
478,
411,
20,
3934,
14,
3724,
15015,
5757,
31,
23,
2485,
34,
3916,
3503,
21,
345,
1354,
15,
14,
1215,
142,
30,
32,
23,
4950,
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 are some good WPF grid controls?
===
We use a grid control from Infragistics at work. Are there others? Pay or free? | 0 | [
2,
98,
50,
109,
254,
619,
7721,
7354,
8671,
60,
800,
3726,
3726,
95,
275,
21,
7354,
569,
37,
19,
22133,
3771,
18,
35,
170,
9,
50,
80,
654,
60,
1372,
54,
551,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What are your strategies to keep the memory usage low?
===
[Ruby](http://www.ruby-lang.org) is truly memory-hungry - but also worth every single bit.
What do you do to keep the memory usage low? Do you avoid big strings and use smaller arrays/hashes instead or is it no problem to concern about for you and let the garbage collector do the job? | 0 | [
2,
98,
50,
154,
10272,
20,
643,
14,
1912,
7514,
708,
60,
800,
3726,
3726,
636,
1820,
779,
500,
5,
21127,
6903,
6483,
9,
1820,
779,
8,
9949,
9,
5583,
6,
25,
4574,
1912,
8,
16087,
622,
13,
8,
47,
67,
2715,
352,
345,
1142,
9,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL Server: Dynamic where-clause
===
**Problem:**
Ajax suggest-search on [*n*] ingredients in recipes. Performance-demanding.
**Tables:**
Ingredients [
IngredientsID INT PK,
IngredientsName VARCHAR
]
Recipes [
RecipesID INT PK,
RecipesName VARCHAR
]
IngredientsRecipes [
IngredientsRecipesID INT PK,
IngredientsID INT,
RecipesID INT
]
**Query:**
SELECT
Recipes.RecipesID,
Recipes.RecipesName,
Ingredients.IngredientsID,
Ingredients.IngredientsName
FROM
IngredientsRecipes
INNER JOIN Ingredients ON
IngredientsRecipes.IngredientsID = Ingredients.IngredientsID
INNER JOIN Recipes ON
IngredientsRecipes.RecipesID = Recipes.RecipesID
WHERE
Ingredients.IngredientsName IN ('salt', 'water', 'flower')
I am currently constructing my query using ASP.NET C# because of the dynamic nature of the `WHERE` clause.
I bites that I have to construct the query in my code-layer instead of using a stored procedure/pure SQL, which in theory should be much faster.
Have you guys got any thoughts on how I would move all of the logic from my code-layer to pure SQL, or at least how I can optimize performance of what I'm doing?
I am thinking along the lines of temporary tables:
**Step one**: `SELECT IngredientsID FROM Ingredients` and `INSERT INTO temp-table`
**Step two**: `SELECT RecipesName FROM Recipes` joined with `temp-table.IngredientsID`
| 0 | [
2,
4444,
255,
8128,
45,
7782,
113,
8,
7232,
3699,
800,
3726,
3726,
13,
1409,
2740,
2854,
79,
45,
1409,
20624,
5601,
8,
25136,
27,
636,
2483,
103,
2483,
500,
14129,
19,
22229,
9,
956,
8,
25358,
68,
9,
13,
1409,
5924,
18,
45,
1409... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the techniques for word recognition in a sound stream?
===
I'm quite curious about this.
In a broad way, how does one go about doing the following:
* Detection of word separations.
* Detection of syllables.
* Compensate for normal speech word connections.
| 0 | [
2,
98,
50,
14,
4212,
26,
833,
3514,
19,
21,
646,
3766,
60,
800,
3726,
3726,
31,
22,
79,
1450,
7686,
88,
48,
9,
19,
21,
2748,
161,
15,
184,
630,
53,
162,
88,
845,
14,
249,
45,
1637,
11643,
16,
833,
8312,
18,
9,
1637,
11643,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Giving an ArrayList a type
===
I thought that there was some way in .net 3.0 to give an array list a type so that it didnt just return Object's but I'm having trouble doing so. Is it possible? If so, how? | 0 | [
2,
1438,
40,
7718,
5739,
21,
1001,
800,
3726,
3726,
31,
289,
30,
80,
23,
109,
161,
19,
13,
9,
2328,
203,
9,
387,
20,
590,
40,
7718,
968,
21,
1001,
86,
30,
32,
1182,
114,
788,
3095,
22,
18,
47,
31,
22,
79,
452,
2572,
845,
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... |
Windows C++ dialog resizer class
===
I'm looking for a really good dialog resizer class that will stretch and shrink individual items as needed as the screen is resized. Stephan Keil has a good one (DlgResizeHelper) which basically resizes everything by a set ratio, but I'm looking for something smarter.
For example:
* Icons should not resize
* Single-line text boxes should not be stretched vertically
* Buttons should probably stay the same size
Basically I'm looking for something to look at all of the controls, figure out that a static text field is related to a control next/below it and anchor the two together, and resize large controls in a 'smart' way so it looks good.
Are there such frameworks out there? I've been working on one but something ready-made would probably be better.
| 0 | [
2,
1936,
272,
20512,
28223,
10719,
11907,
718,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
510,
254,
28223,
10719,
11907,
718,
30,
129,
6363,
17,
16269,
1359,
3755,
28,
851,
28,
14,
2324,
25,
302,
6560,
9,
11987,
2270,
947,
63,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Robust and easy to implement serial bus (automotive application)
===
What serial communication bus would you use in a automotive embedded system if your main selection criteria were:
* Electrically robust
* Slow speed (32 kb/s)
* Easy to program
* Easy to interface with microcontrollers
It won't be transferring much data, but it will need to be transferred periodically at high speed (100 - 500 Hz). I find that RS-232 is just not reliable enough if you have noise in your ground line. CAN-bus seems interesting, but I have to experience with it.
We are currently interested in a combination of AVR AT90CAN128 microcontrollers. | 2 | [
2,
15313,
17,
2010,
20,
8713,
5956,
1683,
13,
5,
18042,
24271,
62,
3010,
6,
800,
3726,
3726,
98,
5956,
3291,
1683,
83,
42,
275,
19,
21,
14699,
12138,
329,
100,
154,
407,
3155,
9157,
46,
45,
1637,
4618,
102,
15313,
1637,
2276,
1362... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Grails - Acegi: Customize Authentication Method
===
I want to change the authentication process that is used by the Acegi - Plugin. It should be a completly customized process. Cusotm login form + custom auth method.
Obviously there is only few documentation regarding this topic.
In the book "The Definitive Guide to Grails" it is described for an older version of grails. There the spring/resources.xml is used.
In the new version is a spring/resources.groovy file, where a DSL is used. I don't know how to configure a new AuthenticationManager.
How can i do this?
Thanks for your help | 0 | [
2,
489,
7301,
18,
13,
8,
7878,
2234,
45,
5816,
2952,
27963,
2109,
800,
3726,
3726,
31,
259,
20,
753,
14,
27963,
953,
30,
25,
147,
34,
14,
7878,
2234,
13,
8,
10922,
108,
9,
32,
378,
44,
21,
6479,
1336,
102,
28779,
953,
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... |
What are good application servers for LAMP stacks?
===
I need recommendations for good application servers for monitoring and debugging PHP and Mysql running on linux. It should have a GUI, query profiling (log slow queries etc.) and capture PHP errors with environment coniditions.
I am aware only of the Zend Platform that provides those features and I'm looking for alternatives. | 0 | [
2,
98,
50,
254,
3010,
17595,
26,
6792,
7566,
18,
60,
800,
3726,
3726,
31,
376,
12121,
26,
254,
3010,
17595,
26,
8984,
17,
121,
16254,
2762,
13,
26120,
17,
51,
18,
22402,
946,
27,
13024,
9,
32,
378,
57,
21,
9457,
15,
25597,
8721,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 allowing user to use their own domain name for a hosted service
===
I am working on an ASP.NET MVC web app that allows people to publish contents, but other than publish the contents to a remote server, I want to allow people to use their domain name directly. For example, the user "Tom" can have his domain name TomSite.com point to http://www.mywebapp.com/user/tom, but the sub path will also be mapped. For example, TomSite.com/path will be mapped to www.mywebapp.com/user/tom/path, and this is transparent to the web visitor. The visitor will never see "mywebapp.com" anywhere on TomSite.com.
I think Smugmug.com provides such service, to allow people to use their own domain name for the photo portfolio. I want to achieve the same result.
How can I do this? Thanks! | 0 | [
2,
184,
20,
2719,
4155,
20,
275,
66,
258,
4603,
204,
26,
21,
2812,
365,
800,
3726,
3726,
31,
589,
638,
27,
40,
28,
306,
9,
2328,
307,
8990,
2741,
4865,
30,
2965,
148,
20,
10824,
8478,
15,
47,
89,
119,
10824,
14,
8478,
20,
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... |
How do I order citations by appearance using BibTeX?
===
By default (using th `plain` style) BibTeX orders citations alphabetically. How do I order the citations by order of appearance in the document? | 0 | [
2,
184,
107,
31,
389,
9715,
18,
34,
1468,
568,
13,
16930,
38,
1706,
60,
800,
3726,
3726,
34,
12838,
13,
5,
12655,
13,
96,
13,
1,
9897,
108,
1,
1034,
6,
13,
16930,
38,
1706,
3204,
9715,
18,
27169,
102,
9,
184,
107,
31,
389,
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,
0,
0,
0,
0,
0,
0... |
Tree (connected acyclic graph) implementation
===
*Sorry about the title-- I have no idea what this type of tree is called. If anyone knows I can edit the title to be less vague.*
I require a tree / connected acyclic graph implementation something like this:
public class TreeNode<K, V> {
private K key; // 'key' for this node, always present
private V value; // 'value' for this node, doesn't have to be set
private TreeNode<K, V> parent;
private Set<TreeNode<K, V>> children;
}
- There is no sorting of any kind.
- The `TreeNode` is just a wrapper around the key and a possible value (nodes don't have to have values set).
- I require links to both the parent and the children.
Is there anything out there in the standard APIs or Commons etc that will do this for me?
I don't mind writing it myself (and I'm certainly **not** asking you folks to) I just don't want to re-invent the wheel. | 0 | [
2,
1541,
13,
5,
23520,
21,
15888,
7210,
6,
6123,
800,
3726,
3726,
1637,
8959,
88,
14,
581,
8,
8,
31,
57,
90,
882,
98,
48,
1001,
16,
1541,
25,
227,
9,
100,
1276,
3620,
31,
92,
9392,
14,
581,
20,
44,
787,
14800,
9,
2483,
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... |
Can I make Hibernate transparently avoid string duplication in the database?
===
I have a Java program that uses Hibernate and MySQL to store a lot of tracing data about the use of the Eclipse IDE. This data contains a lot of strings such as method names, directories, perspective name, etc.
For example, an event object (which is then reflected in a record) can specify the source file and the current method, the user name, etc. Obviously, string data can repeat itself.
As long as it's in memory, much of it is internalized so all repeated string instances point to the same object (I make sure of that). However, with @Basic (I use annotations), Hibernate maps it into a VARCHAR(255), which means a lot of wasted space.
If I was coding the SQL myself, I could have replaced the VARCHAR with an index to a manually-managed string lookup table and saved the space (at the cost of extra lookups).
Is there some way to get Hibernate to do this for me? I'm willing to pay the performance hit for the space.
| 0 | [
2,
92,
31,
233,
4148,
2102,
8820,
14862,
102,
2658,
3724,
1052,
20669,
19,
14,
6018,
60,
800,
3726,
3726,
31,
57,
21,
8247,
625,
30,
2027,
4148,
2102,
8820,
17,
51,
18,
22402,
20,
1718,
21,
865,
16,
20005,
1054,
88,
14,
275,
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... |
jQuery jWYSIWYG inside jquery.ui.tab
===
So I managed to get a page with Ajax [ui.tab][1] and in one of the tab I put [jWYSIWYG][2] textarea plugin. Unfortunately, I can only see normal textarea.
However, accessing the page directly (ie. not using the ajax tab) works.
What happened?
p/s: I'm new to jQuery / JavaScript / AJAX / CSS (if that even matter)
[1]: http://docs.jquery.com/UI/Tabs
[2]: http://projects.bundleweb.com.ar/jWYSIWYG/ | 0 | [
2,
487,
8190,
93,
487,
7913,
18,
49,
7913,
263,
572,
487,
8190,
93,
9,
5661,
9,
15783,
800,
3726,
3726,
86,
31,
1471,
20,
164,
21,
2478,
29,
20624,
636,
5661,
9,
15783,
500,
2558,
165,
500,
17,
19,
53,
16,
14,
6523,
31,
442,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Python Vs. Ruby for Metaprogramming
===
I'm currently primarily a D programmer and am looking to add another language to my toolbox, preferably one that supports the metaprogramming hacks that just can't be done in a statically compiled language like D. I've read up on Lisp a little and I would love to find a language that allows some of the cool stuff that Lisp does, but without the strange syntax, etc. of Lisp. I don't want to start a language flame war, and I'm sure both Ruby and Python have their tradeoffs, so I'll list what's important to me personally. Please tell me whether Ruby, Python, or some other language would be best for me.
Important:
1. Good metaprogramming. Ability to create classes, methods, functions, etc. at runtime. Preferably, minimal distinction between code and data, Lisp style.
2. Nice, clean, sane syntax and consistent, intuitive semantics. Basically a well thought-out, fun to use, modern language.
3. Multiple paradigms. No one paradigm is right for every project, or even every small subproblem within a project.
4. An interesting language that actually affects the way one thinks about programming.
Somewhat important:
1. Performance. It would be nice if performance was decent, but when performance is a real priority, I'll use D instead.
2. Well-documented.
Not important:
1. Community size, library availability, etc. None of these are characteristics of the language itself, and all can change very quickly.
2. Job availability. I am not a full-time, professional programmer. I am a grad student and programming is tangentially relevant to my research.
3. Any features that are primarily designed with very large projects worked on by a million code monkeys in mind. | 4 | [
2,
20059,
4611,
9,
10811,
26,
7618,
19746,
3863,
800,
3726,
3726,
31,
22,
79,
871,
2257,
21,
13,
43,
17968,
17,
589,
699,
20,
3547,
226,
816,
20,
51,
5607,
5309,
15,
6369,
4801,
53,
30,
6747,
14,
7618,
19746,
3863,
11835,
18,
30... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I restore a deleted file in CVS?
===
I've removed a checked in file from the CVS branch, i.e.:
cvs remove -f file.txt
cvs commit
How do I restore the file? | 0 | [
2,
184,
107,
31,
8454,
21,
19584,
3893,
19,
13,
12732,
18,
60,
800,
3726,
3726,
31,
22,
195,
1974,
21,
6505,
19,
3893,
37,
14,
13,
12732,
18,
1686,
15,
31,
9,
62,
9,
45,
13,
12732,
18,
4681,
13,
8,
410,
3893,
9,
38,
396,
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,
0,
0,
0,
0... |
Problem with update site categories in Eclipse 3.4
===
I am using Eclipse 3.4 (ganymede official, not the service pack).
I have an update site that organizes features into categories; everything looks great in the editor and in the XML.
Once the site is online, accessing it in the usual manner tells me that all the features are "uncategorized". I've tried from multiple computers running 3.4 and the same problem persists.
What is curious is that I used Eclipse 3.3, and it saw the categories well, though of course it wasn't able to instlal the plugins which are made from 3.4.
Am I doing something wrong or is this a known problem? | 0 | [
2,
1448,
29,
11100,
689,
6422,
19,
11652,
203,
9,
300,
800,
3726,
3726,
31,
589,
568,
11652,
203,
9,
300,
13,
5,
2342,
93,
4688,
62,
989,
15,
52,
14,
365,
3607,
6,
9,
31,
57,
40,
11100,
689,
30,
9213,
18,
967,
77,
6422,
73,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to capture an anchor value from url in Ruby on Rails?
===
After updating or creating a record I use url helper to redirect to the part on the page where the record happened to be located:
if record.save
....
redirect_to records_url, :anchor => "record_" + record_id.to_s
end
the resulting url will be something like
http://localhost:3000/records#record_343242
I want to highlight the record using jquery or prototype, and the anchor is the exact id that I am looking for. Can I capture it?
| 0 | [
2,
184,
20,
3683,
40,
6265,
1923,
37,
287,
6362,
19,
10811,
27,
2240,
18,
60,
800,
3726,
3726,
75,
71,
43,
1880,
54,
2936,
21,
571,
31,
275,
287,
6362,
448,
106,
20,
302,
14706,
20,
14,
141,
27,
14,
2478,
113,
14,
571,
1190,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 point of using a Logging framework?
===
I think I might be missing the point of having a logging framework for your application. In all the small apps I've always written a small "Logging" class and just pass log messages to a method in it which is written to a file.
What is the purpose of a 3rd party logging framework like log4net? Is it thread safety with logging write operations or am I missing something? | 0 | [
2,
98,
25,
14,
454,
16,
568,
21,
13,
13919,
6596,
60,
800,
3726,
3726,
31,
277,
31,
530,
44,
2863,
14,
454,
16,
452,
21,
13,
13919,
6596,
26,
154,
3010,
9,
19,
65,
14,
284,
4865,
18,
31,
22,
195,
550,
642,
21,
284,
13,
7,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Size-coding competitions
===
What are your preferred size-coding (competitions for the smallest program that does something, or for the smallest source code) oriented sites?
There was a really nice python site, I can't remember where it is.
[Hugi size-coding compo][1] comes to my mind and it's also nice.
[1]: http://www.hugi.scene.org/compo/ | 0 | [
2,
1072,
8,
15458,
5868,
800,
3726,
3726,
98,
50,
154,
5981,
1072,
8,
15458,
13,
5,
960,
6240,
9861,
18,
26,
14,
11056,
625,
30,
630,
301,
15,
54,
26,
14,
11056,
1267,
1797,
6,
13,
6800,
3259,
60,
80,
23,
21,
510,
2210,
20059,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 choose what programming language to use?
===
At work, the decision is generally driven by what the team knows (which for web projects ends up being PHP/MySQL/JavaScript in my current job) and cost of the tools. But when you are writing all the code yourself, how do you make the decision? When do you pull out the trusted tool (and how do you choose which trusted tool if you have multiple) or when do you decide that a new language or tool is better and start to learn that?
Related: [Which language to choose and when?][1]
[1]: http://stackoverflow.com/questions/93890/which-language-to-choose-and-when | 0 | [
2,
184,
107,
42,
3538,
98,
3143,
816,
20,
275,
60,
800,
3726,
3726,
35,
170,
15,
14,
1401,
25,
1469,
5355,
34,
98,
14,
173,
3620,
13,
5,
2140,
26,
2741,
2314,
3451,
71,
142,
13,
26120,
118,
915,
18,
22402,
118,
1004,
1385,
874... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Eclipse start up menu
===
How do I get Eclipse's start up Linux looking desktop thing back?
(Sorry for the idiocy, the last time I did Java development was in '96 and all I used was vi. Once I know what it is called I will edit the question.) | 0 | [
2,
11652,
799,
71,
11379,
800,
3726,
3726,
184,
107,
31,
164,
11652,
22,
18,
799,
71,
13024,
699,
17404,
584,
97,
60,
13,
5,
8959,
26,
14,
13,
20347,
2731,
15,
14,
236,
85,
31,
144,
8247,
522,
23,
19,
13,
22,
4060,
17,
65,
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... |
Is exposing a session's CSRF-protection token safe?
===
Django comes with [CSRF protection middleware](http://code.djangoproject.com/browser/django/trunk/django/contrib/csrf/middleware.py), which generates a unique per-session token for use in forms. It scans all incoming `POST` requests for the correct token, and rejects the request if the token is missing or invalid.
I'd like to use AJAX for some POST requests, but said requests don't have the CSRF token availabnle. The pages have no `<form>` elements to hook into and I'd rather not muddy up the markup inserting the token as a hidden value. I figure a good way to do this is to expose a vew like `/get-csrf-token/` to return the user's token, relying on browser's cross-site scripting rules to prevent hostile sites from requesting it.
Is this a good idea? Are there better ways to protect against CSRF attacks while still allowing AJAX requests? | 0 | [
2,
25,
17302,
21,
3723,
22,
18,
272,
18,
8291,
8,
16265,
872,
20,
2853,
1834,
60,
800,
3726,
3726,
3857,
14541,
1624,
29,
636,
6824,
8291,
2057,
772,
5011,
500,
5,
21127,
6903,
9375,
9,
14365,
14541,
21011,
9,
960,
118,
25699,
410... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Teaching: Describing the Relationship between Packages, Classes & Fields
===
In general I think I can convey most programming related concepts quite well.
Yet, I still find it hard to summarise the relationship between Packages, Classes and Fields.
<br>
**How do you summarise "Fields", "Classes" and "Packages" and their "Their Relationship" ?**
<br>
> ***I will add an Answer below as an example only:*** . . . *Please add
> your own summaries.* <br>
> *A few points each perhaps?*
| 0 | [
2,
2540,
45,
7153,
14,
1429,
128,
16875,
15,
2684,
279,
2861,
800,
3726,
3726,
19,
297,
31,
277,
31,
92,
11266,
127,
3143,
1597,
8700,
1450,
134,
9,
768,
15,
31,
174,
477,
32,
552,
20,
18074,
11864,
14,
1429,
128,
16875,
15,
268... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 convert a .NET console application to a Winforms or WPF application
===
I frequently start with a simple console application to try out an idea, then create a new GUI based project and copy the code in. Is there a better way? Can I convert my existing console application easily? | 0 | [
2,
184,
107,
31,
8406,
21,
13,
9,
2328,
8650,
3010,
20,
21,
628,
4190,
18,
54,
619,
7721,
3010,
800,
3726,
3726,
31,
3086,
799,
29,
21,
1935,
8650,
3010,
20,
1131,
70,
40,
882,
15,
94,
1600,
21,
78,
9457,
432,
669,
17,
4344,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Fuse bindings for php.
===
I am writing an application that thus far has been written in PHP, from the interface to the daemons. I have a need to use [fuse][1] and would like to continue to use PHP just for consistency. However, there doesn't seem to be bindings for PHP. Python, Java etc have bindings, and I can code in those languages I just dont want the additional dependencies in this project. I have seen a project on google code, but nothing complete. Anyone know if these have been written?
[1]: http://fuse.sourceforge.net/ | 0 | [
2,
13,
13072,
8728,
18,
26,
13,
26120,
9,
800,
3726,
3726,
31,
589,
1174,
40,
3010,
30,
1086,
463,
63,
74,
642,
19,
13,
26120,
15,
37,
14,
6573,
20,
14,
13127,
18,
9,
31,
57,
21,
376,
20,
275,
636,
13072,
500,
2558,
165,
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... |
Add a namespace to elements using XSLT
===
I have an XML document with un-namespaced elements, and I want to use XSLT to add namespaces to them. Most elements will be in namespace A; a few will be in namespace B. How do I do this? | 0 | [
2,
3547,
21,
204,
5582,
20,
2065,
568,
993,
18,
255,
38,
800,
3726,
3726,
31,
57,
40,
23504,
4492,
29,
367,
8,
7259,
18,
15265,
2065,
15,
17,
31,
259,
20,
275,
993,
18,
255,
38,
20,
3547,
204,
5582,
18,
20,
105,
9,
127,
2065... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
With what GUI framework is the Mono .NET Windows.Forms implemented?
===
With what GUI framework is the Mono .NET Windows.Forms implemented?
Example: KDE, Gnome, X11 itself? | 0 | [
2,
29,
98,
9457,
6596,
25,
14,
4129,
13,
9,
2328,
1936,
9,
4190,
18,
6807,
60,
800,
3726,
3726,
29,
98,
9457,
6596,
25,
14,
4129,
13,
9,
2328,
1936,
9,
4190,
18,
6807,
60,
823,
45,
680,
546,
15,
24117,
15,
993,
1306,
1145,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
ASP.NET MVC and...YUI? jQuery? Other
===
After the last project I've done using WebForms, I've decided to pass on using that framework in the future. It's great for getting your basic features out there...not so great when you have more complex UI logic.
I'm looking at ASP.NET MVC, and like what I see so far. Of course the issue is that you lose the server side controls when you make that change. I've been looking for an Ajax Library that will a good replacement for the Web Forms widgets and like YUI right now.
Not having a lot of experience in this area, I'd like to ask someone who has more knowledge. Which Ajax toolkit offers the most complete widget library? Is it possible to combine two or more toolkits to provide supplement to each other (e.g YUI has a great Grid, Scriptaculous has a great Calendar, let's use the best of both worlds)? Or are you more or less tied to one once you choose? | 0 | [
2,
28,
306,
9,
2328,
307,
8990,
17,
9,
9,
9,
4703,
49,
60,
487,
8190,
93,
60,
89,
800,
3726,
3726,
75,
14,
236,
669,
31,
22,
195,
677,
568,
2741,
4190,
18,
15,
31,
22,
195,
868,
20,
1477,
27,
568,
30,
6596,
19,
14,
1022,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Things to consider when writing for touch screen?
===
I'm starting a new project which involves developing an interface for a machine that measures wedge and roundness of lenses and stores the information in a database and reports on it. There's a decent change we're going to be putting a touch screen on this machine so that it doesn't need to have a mouse or keyboard...
I don't have any experience developing for full size touch screens, so I'm looking for advice/tips/info from you guys...
I can imagine you want to make the elements a little larger than normal... space buttons out a bit more.... things like that... anyone have anything else to add? | 0 | [
2,
564,
20,
3563,
76,
1174,
26,
1723,
2324,
60,
800,
3726,
3726,
31,
22,
79,
1422,
21,
78,
669,
56,
6569,
3561,
40,
6573,
26,
21,
1940,
30,
4699,
14674,
17,
560,
720,
16,
17717,
17,
4134,
14,
676,
19,
21,
6018,
17,
2813,
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... |
How do you store request URL's in Javascript to satisfy the DRY principal?
===
Are there any commonly used patterns in Javascript for storing the URL's of endpoints that will be requested in an AJAX application?
For example would you create a "Service" class to abstract the URL's away? | 0 | [
2,
184,
107,
42,
1718,
3772,
287,
6362,
22,
18,
19,
8247,
8741,
20,
14711,
14,
2273,
2279,
60,
800,
3726,
3726,
50,
80,
186,
2524,
147,
6282,
19,
8247,
8741,
26,
25615,
14,
287,
6362,
22,
18,
16,
241,
3132,
18,
30,
129,
44,
66... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When is it good (if ever) to scrap production code and start over?
===
We have a software product that was written by a single programmer who is no longer with the company, and have we even have a few customers running the software. I was asked to do a code review and report on the feasibility of adding a new feature to the product. The code (written in VB.NET) was an awful mess, and my boss tells me he has been noticing similarly poor code in other projects from this former developer. I know it's easy to nitpick someone else's code, but I'd say it's pretty bad. Some choice bits from my code review:
- Abuse of threads: `QueueUserWorkItem` shows up a lot and is definitely over-used, and Thread-pool delegates have uninformative names such as `PoolStart` and `PoolStart2`.
- Magic numbers and magic stings...everywhere. Almost as if someone didn't know that `Const` and `Enum` exist.
- Global variables: Most variables are declared global and may or not be initialized depending on what code paths get followed and what order things occur in (all the threads running makes this worse)
- Compiler warnings: the main solution file contains 500+ warnings.
- Duplicate classes as well as seemingly half-finished classes.
- Duplicating our existing core libraries (data access layer, error logging,etc.) with subtle modifications (such as changing parameter data types to suit his preferences) because he wanted a "static" unchanging copy of the core code.
- Despite duplicating our data access layer code, failed to use it when he actually needed access to the database from his code. Instead, he created a new `OleDbReader` object every time he needed to query the database.
I'm just scratching the surface here, but my question is simple enough: Would it make more sense to take the time to refactor the existing codebase, focusing on one issue at a time, or would you consider rewriting the entire thing from scratch?
| 4 | [
2,
76,
25,
32,
254,
13,
5,
821,
462,
6,
20,
10241,
637,
1797,
17,
799,
84,
60,
800,
3726,
3726,
95,
57,
21,
2306,
2374,
30,
23,
642,
34,
21,
345,
17968,
72,
25,
90,
1045,
29,
14,
237,
15,
17,
57,
95,
166,
57,
21,
310,
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... |
Best way to get started with programming other things than your computer?
===
What is the best way to get started with programming things outside of your computer?
I don't mean mainstream things like cell phones with APIs.
Please assume working knowledge of C/C++ | 0 | [
2,
246,
161,
20,
164,
373,
29,
3143,
89,
564,
119,
154,
1428,
60,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
164,
373,
29,
3143,
564,
719,
16,
154,
1428,
60,
31,
221,
22,
38,
884,
7469,
564,
101,
1667,
14830,
29,
21,
8954,
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,
0,
0,
0,
0,
0,
0,
0... |
How to install/register more than one instances in SqlServer
===
Is it possible to install/register another server instance in any SqlServer version, besides the default instance? | 0 | [
2,
184,
20,
16146,
118,
12463,
9959,
91,
119,
53,
13946,
19,
4444,
255,
10321,
106,
800,
3726,
3726,
25,
32,
938,
20,
16146,
118,
12463,
9959,
226,
8128,
4851,
19,
186,
4444,
255,
10321,
106,
615,
15,
3410,
14,
12838,
4851,
60,
3,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I install the D programming language into C:\Program Files?
===
The prompt says that if I install the software into a directory with spaces:
>the rebuild build tool used by the D Shared Source System will fail to build
and that I will be
>forced to reinstall in a different location
However, I don't like random things in my C:\ drive. D, IMO, belongs in Program Files with PHP and MinGW and so on. How can I get it here?
If it matters, I'm using the Easy D installer package. | 0 | [
2,
184,
107,
31,
16146,
14,
13,
43,
3143,
816,
77,
272,
45,
1,
19746,
6488,
60,
800,
3726,
3726,
14,
11443,
4417,
898,
30,
100,
31,
16146,
14,
2306,
77,
21,
16755,
29,
7644,
45,
13,
1,
124,
16128,
1895,
5607,
147,
34,
14,
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 to remove accents and tilde in a C++ std::string
===
I have a problem with a string in C++ which has several words in spanish. This means that I have a lot of words with accents and tildes. I want to replace them for their not accented counterparts. Example: I want to replace this word: "había" for habia. I tried replace it directely but with replace method of string class but I could not get that to work.
I'm using this code:
for (it= dictionary.begin(); it != dictionary.end(); it++) <br>
{<br>
strMine=(it->first);<br>
found=toReplace.find_first_of(strMine);<br>
while (found!=std::string::npos)<br>
{<br>
strAux=(it->second);<br>
toReplace.erase(found,strMine.length());<br>
toReplace.insert(found,strAux);<br>
found=toReplace.find_first_of(strMine,found+1);<br>
}<br>
}<br>
<br>
Where dictionary is a map like this (with more entries):
dictionary.insert ( std::pair<std::string,std::string>("á","a") );
dictionary.insert ( std::pair<std::string,std::string>("é","e") );
dictionary.insert ( std::pair<std::string,std::string>("í","i") );
dictionary.insert ( std::pair<std::string,std::string>("ó","o") );
dictionary.insert ( std::pair<std::string,std::string>("ú","u") );
dictionary.insert ( std::pair<std::string,std::string>("ñ","n") );
and toReplace strings is:
std::string toReplace="á-é-í-ó-ú-ñ-á-é-í-ó-ú-ñ";
I obviously must be missing something. I can't figure it out.
Is there any library I can use?.
Thanks,
| 0 | [
2,
184,
20,
4681,
7980,
18,
17,
9189,
546,
19,
21,
272,
20512,
354,
43,
45,
45,
11130,
800,
3726,
3726,
31,
57,
21,
1448,
29,
21,
3724,
19,
272,
20512,
56,
63,
238,
715,
19,
1273,
9,
48,
1108,
30,
31,
57,
21,
865,
16,
715,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 essential topics to have in a Web Services (semester) course?
===
I am in the process of designing a Web Services course for students in an Information Technology program. Some students stop after getting a two-year associates degree, but other students in the program go on to a four-year bachelor's degree. This course would be for students going on to the four-year degree.
My initial thoughts for the course would be that it would cover:
- Some simple database concepts, with enough command line practice to allow students to create simple relational database backends.
- Enough PHP so students can create a web-interface that allows user to enter new data into the database backend, edit data in the database, and display fixed views of the database.
- Basic security practices for PHP and web services in general.
- Writing a barebones content management system using PHP and a database backend.
- Learning about and using existing content management software such as Zope/Plone or Drupal.
- Discuss feasibility of using existing content management software to provide ADA section 508 compliance for web pages. Contrast this with coming up with a simple framework to make ADA compliant pages using PHP.
Our semesters are 16 weeks long. Are there other topics that you cover instead of the ones listed? If you had a chance to design such a course, what would be the most pragmatic things to cover? | 0 | [
2,
98,
50,
5832,
7569,
20,
57,
19,
21,
2741,
687,
13,
5,
18,
1503,
6930,
6,
674,
60,
800,
3726,
3726,
31,
589,
19,
14,
953,
16,
15026,
21,
2741,
687,
674,
26,
573,
19,
40,
676,
1099,
625,
9,
109,
573,
747,
75,
1017,
21,
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... |
GetWindowRegion on Vista
===
I'm writing a program that uses SetWindowRgn to make transparent holes in a window that belongs to another process. (This is done only when the user explicitly requests it.)
The program has to assume that the target window may already have holes which need to be preserved, so before it calls SetWindowRgn, it calls GetWindowRgn to get the current region, then combines the current region with the new one and calls SetWindowRgn.
This works fine in XP, but the call to GetWindowRgn fails in Vista. I've tried turning off Aero and elevating my thread's priority to SE\_DEBUG\_NAME with AdjustTokenPrivileges, but neither helps.
GetLastError() doesn't seem to return a valid value for GetWindowRgn -- it returns 0 on one machine and 5 (Access denied) on another.
Can anyone tell me what I'm doing wrong or suggest a different approach? Here's my code:
HRGN rgnOld = CreateRectRgn ( 0, 0, 0, 0 );
int regionType = GetWindowRgn ( hwnd, rgnOld ); | 0 | [
2,
164,
27508,
18790,
27,
13520,
800,
3726,
3726,
31,
22,
79,
1174,
21,
625,
30,
2027,
309,
27508,
8911,
103,
20,
233,
14862,
8486,
19,
21,
1463,
30,
7034,
20,
226,
953,
9,
13,
5,
1565,
25,
677,
104,
76,
14,
4155,
13108,
12279,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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# classes in separate files?
===
Should each class in my C# project get its own file (in your opinion)? | 0 | [
2,
272,
5910,
2684,
19,
1725,
6488,
60,
800,
3726,
3726,
378,
206,
718,
19,
51,
272,
5910,
669,
164,
82,
258,
3893,
13,
5,
108,
154,
4052,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
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... |
Is there one API to handle the Task Scheduler in XP and Vista?
===
I have a couple applications that I would like to be able to add scheduled tasks from within them. I've been Googling for how to add tasks in both XP and Vista. Apparently, Vista has a new Task Scheduler that is very different from the one in XP.
Does anybody know if there is a single API to tackle both of them, or do I have to code for both in my apps? | 2 | [
2,
25,
80,
53,
21,
2159,
20,
3053,
14,
3005,
4345,
139,
19,
23045,
17,
13520,
60,
800,
3726,
3726,
31,
57,
21,
1335,
3767,
30,
31,
83,
101,
20,
44,
777,
20,
3547,
3758,
8674,
37,
363,
105,
9,
31,
22,
195,
74,
162,
5598,
802,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Java Log Viewer
===
Unfortunately, sometimes the only way to debug a program is by going through its long log files.
I searched for a decent log viewer for a while now, and haven't found a real solution. The only program that seemed to be most appropriate was [Chainsaw][1] with its Socket connector but after a few short uses the program proved to be buggy and unresponsive at best.
Is there any other (free) log viewer? I'm looking for anything that could work well with log4j.
Thanks in advance!
[1]: http://logging.apache.org/chainsaw/download.html | 0 | [
2,
8247,
6738,
16812,
800,
3726,
3726,
6200,
15,
1030,
14,
104,
161,
20,
121,
16254,
21,
625,
25,
34,
228,
120,
82,
175,
6738,
6488,
9,
31,
9036,
26,
21,
12238,
6738,
16812,
26,
21,
133,
130,
15,
17,
2933,
22,
38,
216,
21,
683... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
jQuery get textarea text
===
Recently I have started playing with jQuery, and have been following a couple of tutorials. Now I feel slightly competent with using it (it's pretty easy), and I thought it would be cool if I were able to make a 'console' on my webpage (as in, you press the ` key like you do in FPS games etc), and then have it ajax itself back to the server in-order to do stuff.
I originally thought the best way would be to just get the text inside the textarea, and then split it, or should I use the keyup event, convert the keycode returned to an ASCII character, append the character to a string and send the string to the server (then empty the string).
I couldn't find any information on getting text from a textarea, all I got was keyup info. Also, how can I convert the keycode returned to an ASCII character? | 0 | [
2,
487,
8190,
93,
164,
1854,
17760,
1854,
800,
3726,
3726,
1989,
31,
57,
373,
791,
29,
487,
8190,
93,
15,
17,
57,
74,
249,
21,
1335,
16,
29724,
18,
9,
130,
31,
583,
1847,
19895,
29,
568,
32,
13,
5,
242,
22,
18,
1772,
2010,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
is bash getopts function destructive to the command-line options?
===
Can you use the bash "getopts" function twice in the same script?
I have a set of options that would mean different things depending on the value of a specific option. Since I can't guarantee that getopts will evaluate that specific option first, I would like to run getopts one time, using only that specific option, then run it a second time using the other options. | 0 | [
2,
25,
13158,
164,
111,
13531,
1990,
19439,
20,
14,
1202,
8,
1143,
6368,
60,
800,
3726,
3726,
92,
42,
275,
14,
13158,
13,
7,
834,
262,
13531,
7,
1990,
2088,
19,
14,
205,
3884,
60,
31,
57,
21,
309,
16,
6368,
30,
83,
884,
421,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Useful Attributes in C#
===
I know that attributes are an extremely useful. There are some predefined ones such as `[Browsable(false)]` which allows you to hide properties in the properties tab. Here is a good question explaining attributes: http://stackoverflow.com/questions/20346/c-what-are-attributes
**What are the predefined attributes (and their namesapce) you actually use in your projects?**
| 0 | [
2,
127,
4811,
13422,
19,
272,
5910,
800,
3726,
3726,
31,
143,
30,
13422,
50,
40,
3898,
4811,
9,
80,
50,
109,
782,
13439,
53,
18,
145,
28,
13,
1,
2558,
25699,
18,
579,
5,
13192,
870,
6,
500,
1,
56,
2965,
42,
20,
3077,
3704,
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... |
Bluetooth APIs in Windows/.Net?
===
I am in the process of writing a Bluetooth scanner that locates and identifies mobile devices in the local vicinity. Is this something that I can accomplish using C#, or do I need to drop down into the C/C++ APIs? My application is targeting Windows XP and Vista. Pointers are appreciated.
Thanks! | 0 | [
2,
705,
15808,
21,
8954,
19,
1936,
118,
9,
2328,
60,
800,
3726,
3726,
31,
589,
19,
14,
953,
16,
1174,
21,
705,
15808,
23195,
30,
12717,
18,
17,
17165,
3241,
4690,
19,
14,
375,
10162,
9,
25,
48,
301,
30,
31,
92,
14570,
568,
272... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 distribute and administer opensource-projects?
===
There are a lot of websites offering free hosting of opensource projects with bug tracker, version control, discussion boards, ...:
- Codeplex
- Sourceforge
- Codeproject
- Google Code
- ...?
How would you administer and develop your own projects? When choosing one of those sites what benefits can you get from it? Is it even better to host it on your own? | 0 | [
2,
184,
20,
14751,
17,
14839,
368,
12097,
8,
21011,
18,
60,
800,
3726,
3726,
80,
50,
21,
865,
16,
13931,
4090,
551,
10637,
16,
368,
12097,
2314,
29,
6256,
792,
106,
15,
615,
569,
15,
5460,
8755,
15,
13,
9,
9,
9,
45,
13,
8,
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... |
JFreeChart XYPlot with labels
===
I'm using an XYPlot in JFreeChart. All the lines on it are XYSeries objects. Both axes are NumberAxis objects. The Y-Axis range is from 0-1, with ticks every .1. Along with displaying the numbers though, I'd like to display text on the Y-Axis, like High/Medium/Low. High would cover .7-1, etc. What is the best way to go about doing this? | 0 | [
2,
487,
4639,
5433,
38,
993,
12228,
5639,
29,
13173,
800,
3726,
3726,
31,
22,
79,
568,
40,
993,
12228,
5639,
19,
487,
4639,
5433,
38,
9,
65,
14,
1560,
27,
32,
50,
13,
15161,
8231,
3916,
9,
156,
10398,
18,
50,
234,
19676,
3916,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 browse other peoples (Apple) bug reports?
===
When I log into the Bug Reporter tool that Apple has, I can only see my bugs. I normally like to search the system to see if other people have filed a bug before posting, but I can't see any way to do this. I can only see my bugs, and post new bugs, but I can't see any way to browse or search the whole bug system.
Is this an Apple restriction, or am I missing something? | 0 | [
2,
92,
31,
10175,
62,
89,
148,
18,
13,
5,
24212,
6,
6256,
2813,
60,
800,
3726,
3726,
76,
31,
6738,
77,
14,
6256,
5357,
5607,
30,
4037,
63,
15,
31,
92,
104,
196,
51,
13925,
9,
31,
4147,
101,
20,
2122,
14,
329,
20,
196,
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... |
Reading call history in iPhone OS
===
I'm doing some research on the feasibility of an iPhone application, and can't find any indication in Apple's documentation that an iPhone app can read the call history of the phone, specifically the number/address book entry called, when, and the duration.
Does anyone know if this is possible, and how? | 0 | [
2,
1876,
645,
447,
19,
21024,
13,
759,
800,
3726,
3726,
31,
22,
79,
845,
109,
527,
27,
14,
26022,
16,
40,
21024,
3010,
15,
17,
92,
22,
38,
477,
186,
11290,
19,
4037,
22,
18,
13945,
30,
40,
21024,
4865,
92,
1302,
14,
645,
447,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 centre a Window in Java?
===
What's the easiest way to centre a <code>java.awt.Window</code>, such as a <code>JFrame</code> or a <code>JDialog</code>? | 0 | [
2,
184,
20,
861,
21,
1463,
19,
8247,
60,
800,
3726,
3726,
98,
22,
18,
14,
27237,
161,
20,
861,
21,
13,
1,
9375,
1,
1004,
1385,
9,
3885,
38,
9,
27508,
1,
118,
9375,
1,
15,
145,
28,
21,
13,
1,
9375,
1,
728,
8361,
1,
118,
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... |
How to detect design time in a VS.NET 2003 control library project
===
Code below is not working as expected to detect if it is in design mode (VS.Net 2003 - Control Library):
if (this.Site != null && this.Site.DesignMode == true) <br>
{<br>
// Design Mode<br>
}<br>
else<br>
{<br>
// Run-time<br>
}<br>
It is used in a complex user control, deriving from another user control and including other user controls on it.<br>
Is there another way to detect design time in a VS.NET 2003 or what is the problem with the code above? | 0 | [
2,
184,
20,
9092,
704,
85,
19,
21,
4611,
9,
2328,
973,
569,
1248,
669,
800,
3726,
3726,
1797,
1021,
25,
52,
638,
28,
1727,
20,
9092,
100,
32,
25,
19,
704,
3740,
13,
5,
710,
18,
9,
2328,
973,
13,
8,
569,
1248,
6,
45,
100,
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... |
system wide keyboard hook on X under linux
===
What would be the best approach to install a keyboard hook on Linux (X-windows) in order to trigger some application when some key-combo is pressed?? Is there a way to do this regardless of which window manager is running? The idea is to have an application being called ( or brought to foreground ) when some key is pressed in a way similar that Google Desktop does to Ctrl-Ctrl.
| 0 | [
2,
329,
1051,
8896,
5559,
27,
993,
131,
13024,
800,
3726,
3726,
98,
83,
44,
14,
246,
2141,
20,
16146,
21,
8896,
5559,
27,
13024,
13,
5,
396,
8,
27508,
18,
6,
19,
389,
20,
7286,
109,
3010,
76,
109,
1246,
8,
960,
1192,
25,
2931,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Speed of DataSet row/column lookups?
===
Recently I had to do some very processing heavy stuff with data stored in a DataSet. It was heavy enough that I ended up using a tool to help identify some bottlenecks in my code. When I was analyzing the bottlenecks, I noticed that although DataSet lookups were not terribly slow (they weren't the bottleneck), it was slower than I expected. I always assumed that DataSets used some sort of HashTable style implementation which would make lookups O(1) (or at least thats what I think HashTables are). The speed of my lookups seemed to be significantly slower than this.
I was wondering if anyone who knows anything about the implementation of .NET's DataSet class would care to share what they know.
If I do something like this :
DataTable dt = new DataTable();
if(dt.Columns.Contains("SomeColumn"))
{
object o = dt.Rows[0]["SomeColumn"];
}
How fast would the lookup time be for the `Contains(...)` method, and for retrieving the value to store in `Object o`? I would have thought it be very fast like a HashTable (assuming what I understand about HashTables is correct) but it doesn't seem like it...
I wrote that code from memory so some things may not be "syntactically correct".
| 0 | [
2,
1362,
16,
1054,
3554,
3131,
118,
716,
4404,
103,
361,
15699,
60,
800,
3726,
3726,
1989,
31,
41,
20,
107,
109,
253,
5511,
1278,
3217,
29,
1054,
8214,
19,
21,
1054,
3554,
9,
32,
23,
1278,
511,
30,
31,
1272,
71,
568,
21,
5607,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 display the global variables of a RTP in the shell?
===
In VxWorks, I can display global variables in the shell like so:
<pre>
-> my_global
my_global = 0x103c4110: value = 4 = 0x4
</pre>
Is there a way to do the same with a RTP global variable? | 0 | [
2,
92,
31,
3042,
14,
2062,
12157,
16,
21,
761,
13726,
19,
14,
3593,
60,
800,
3726,
3726,
19,
566,
396,
7684,
15,
31,
92,
3042,
2062,
12157,
19,
14,
3593,
101,
86,
45,
13,
1,
3515,
1,
13,
8,
1,
51,
1,
26763,
51,
1,
26763,
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... |
When Using Dynamic Proxies, how do I access the underlying object's Annotations?
===
When Using Dynamic Proxies, how do I access the underlying object's Annotations?
Specifically I'm annotating settings of a ORM object with @Column("client_id") and then making a Dynamic Proxy keep track of when the annotated setters are called, but...
It doesn't seem that the annotated proxy keeps any of the underlying annotations so short of performing reflection on every invocation, how do I make the proxy have the annotations of the class it's Proxying?
Thank you,
Allain | 0 | [
2,
76,
568,
7782,
895,
396,
1596,
15,
184,
107,
31,
1381,
14,
10974,
3095,
22,
18,
40,
1270,
7504,
60,
800,
3726,
3726,
76,
568,
7782,
895,
396,
1596,
15,
184,
107,
31,
1381,
14,
10974,
3095,
22,
18,
40,
1270,
7504,
60,
3524,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Exception.Data
===
How have you used the Exception.Data property in C# projects that you've worked on? I'd like answers that suggest a pattern, rather than those that are very specific to your app.
Thanks! | 0 | [
2,
568,
5391,
9,
18768,
800,
3726,
3726,
184,
57,
42,
147,
14,
5391,
9,
18768,
1354,
19,
272,
5910,
2314,
30,
42,
22,
195,
577,
27,
60,
31,
22,
43,
101,
6709,
30,
5601,
21,
3732,
15,
864,
119,
273,
30,
50,
253,
1903,
20,
154... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Ruby. How can I copy and paste in irb on Windows?
===
How can I copy and paste in irb (Interactive Ruby Shell) on Windows? | 0 | [
2,
10811,
9,
184,
92,
31,
4344,
17,
640,
62,
19,
31,
7549,
27,
1936,
60,
800,
3726,
3726,
184,
92,
31,
4344,
17,
640,
62,
19,
31,
7549,
13,
5,
6280,
7889,
10811,
3593,
6,
27,
1936,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Can I get the current page sourcecode from a firefox extension?
===
Can this be done? How? | 0 | [
2,
92,
31,
164,
14,
866,
2478,
1267,
9375,
37,
21,
535,
18219,
3896,
60,
800,
3726,
3726,
92,
48,
44,
677,
60,
184,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Cannot find the Create GUID tool in VS2005
===
I have Visual Studio 2005 Professional ENU installed and want to create GUIDs using its Create GUIDs utility. However, I cannot find it under the Tools menu. What should I do to get this utility? Thanks | 0 | [
2,
1967,
477,
14,
1600,
9457,
43,
5607,
19,
4611,
2835,
800,
3726,
3726,
31,
57,
3458,
1120,
812,
736,
1957,
291,
4066,
17,
259,
20,
1600,
9457,
43,
18,
568,
82,
1600,
9457,
43,
18,
10082,
9,
207,
15,
31,
1967,
477,
32,
131,
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,
0,
0,
0,
0... |
Implementing multithreading in C# (code review)
===
Greetings.
I'm trying to implement some multithreaded code in an application. The purpose of this code is to validate items that the database gives it. Validation can take quite a while (a few hundred ms to a few seconds), so this process needs to be forked off into its own thread for each item.
The database may give it 20 or 30 items a second in the beginning, but that begins to decline rapidly, eventually reaching about 65K items over 24 hours, at which point the application exits.
I'd like it if anyone more knowledgeable could take a peek at my code and see if there's any obvious problems. No one I work with knows multithreading, so I'm really just on my own, on this one.
Here's the code. It's kinda long but should be pretty clear. Let me know if you have any feedback or advice. Thanks!
public class ItemValidationService
{
/// <summary>
/// The object to lock on in this class, for multithreading purposes.
/// </summary>
private static object locker = new object();
/// <summary>Items that have been validated.</summary>
private HashSet<int> validatedItems;
/// <summary>Items that are currently being validated.</summary>
private HashSet<int> validatingItems;
/// <summary>Remove an item from the index if its links are bad.</summary>
/// <param name="id">The ID of the item.</param>
public void ValidateItem(int id)
{
lock (locker)
{
if
(
!this.validatedItems.Contains(id) &&
!this.validatingItems.Contains(id)
){
ThreadPool.QueueUserWorkItem(sender =>
{
this.Validate(id);
});
}
}
} // method
private void Validate(int itemId)
{
lock (locker)
{
this.validatingItems.Add(itemId);
}
// *********************************************
// Time-consuming routine to validate an item...
// *********************************************
lock (locker)
{
this.validatingItems.Remove(itemId);
this.validatedItems.Add(itemId);
}
} // method
} // class | 0 | [
2,
17333,
1889,
96,
22883,
19,
272,
5910,
13,
5,
9375,
1487,
6,
800,
3726,
3726,
13769,
18,
9,
31,
22,
79,
749,
20,
8713,
109,
1889,
96,
10647,
69,
1797,
19,
40,
3010,
9,
14,
2131,
16,
48,
1797,
25,
20,
7394,
1373,
3755,
30,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I make Emacs start without so much fanfare?
===
Every time I start Emacs I see a page of help text and a bunch of messages suggesting that I try the tutorial. How do I stop this from happening? | 0 | [
2,
184,
107,
31,
233,
13,
62,
6893,
18,
799,
366,
86,
212,
29315,
60,
800,
3726,
3726,
352,
85,
31,
799,
13,
62,
6893,
18,
31,
196,
21,
2478,
16,
448,
1854,
17,
21,
7653,
16,
7561,
8946,
30,
31,
1131,
14,
29724,
9,
184,
107,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Programming on a Nintendo DS
===
I was reading [this](http://stackoverflow.com/questions/144735/best-way-to-get-started-with-programming-other-things-than-your-computer#144843) answer previously and it got me interested in purchasing a Nintendo DS for learning to program embedded devices. Before I go out and splurge on a DS I had a few questions:
1. Are there any restrictions on what you can program? The post I indicated earlier seemed to say there weren't, but clarification would be nice.
2. Would I be better off buying an arduino (or similar) and going that route? I like the DS because it already has a lot of hardware built in.
3. I'm thinking of getting a CycloDS Evo card, is there a better option for homebrew?
4. What are the best resources to learn about DS development?
Thanks for your time, If you have a DS and program on it, I'd love you hear your opinion, or alternatively if you have a better idea, I'd like to hear it too.
Thanks =]
| 0 | [
2,
3143,
27,
21,
10562,
13,
43,
18,
800,
3726,
3726,
31,
23,
1876,
636,
1565,
500,
5,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
13365,
4440,
10551,
4936,
8,
1443,
8,
262,
8,
3060,
8,
13680,
69,
8,
1410,
8,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the future of the web? XHTML 2, HTML 5, or something else?
===
I'm confused by the discussion and advancement both of a new version of HTML and a new version of XHTML. Are they competitors? If so, what is likeliest to be the adopted future of the web? If not, what is the differing non-competing purpose for each? | 0 | [
2,
98,
22,
18,
14,
1022,
16,
14,
2741,
60,
993,
15895,
172,
15,
13,
15895,
331,
15,
54,
301,
962,
60,
800,
3726,
3726,
31,
22,
79,
4230,
34,
14,
5460,
17,
12624,
156,
16,
21,
78,
615,
16,
13,
15895,
17,
21,
78,
615,
16,
99... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 web server should I use with NetBeans?
===
I haven't been around Java development for 8 years, but am starting to build a NetBeans Web Application. When I walk through the Web Application wizard, it asks for the server I'm going to be using.
What would be the best and simplest server for me to start using with NetBeans? | 0 | [
2,
98,
2741,
8128,
378,
31,
275,
29,
4275,
863,
5950,
60,
800,
3726,
3726,
31,
2933,
22,
38,
74,
140,
8247,
522,
26,
469,
122,
15,
47,
589,
1422,
20,
1895,
21,
4275,
863,
5950,
2741,
3010,
9,
76,
31,
1466,
120,
14,
2741,
3010,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WCF Service authorization patterns
===
I'm implementing a secure WCF service. Authentication is done using username / password or Windows credentials. The service is hosted in a Windows Service process. Now, I'm trying to find out the best way to implement *authorization* for each service operation.
For example, consider the following method:
public EntityInfo GetEntityInfo(string entityId);
As you may know, in WCF, there is an OperationContext object from which you can retrieve the security credentials passed in by the caller/client. Now,*authentication* would have already finished by the time the first line in the method is called. However, how do we implement authorization if the decision depends on the input data itself? For example, in the above case, say 'admin' users(whose permissions etc are stored in a database), are allowed to get entity info, and other users should not be allowed... where do we put the authorization checks?
Say we put it in the first line of the method like so:
CheckAccessPermission(PermissionType.GetEntity, user, entityId) //user is pulled from the current OperationContext
Now, there are a couple of questions:
1. Do we validate the entityId (for example check null / empty value etc) BEFORE the authorization check or INSIDE the authorization check? In other words, if authorization checks should be included in every method, is that a good pattern? Which should happen first - argument validation or authorization?
2. How do we unit test a WCF service when authorization checks are all over the place like this, and we don't have an OperationContext in the unit test!? (Assuming I'm tryin to test this service class implementation directly without any of the WCF setup).
Any ideas guys? | 0 | [
2,
11801,
410,
365,
22677,
6282,
800,
3726,
3726,
31,
22,
79,
17333,
21,
4315,
11801,
410,
365,
9,
27963,
25,
677,
568,
4155,
7259,
13,
118,
20884,
54,
1936,
5059,
43,
10107,
18,
9,
14,
365,
25,
2812,
19,
21,
1936,
365,
953,
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... |
Are there any considerations needed to be taken running your .net program on x64 vs x86?
===
I believe the architecture type (x86 vs x64) is abstracted away for you when making .Net programs, but are there any other considerations that can cause problems? | 0 | [
2,
50,
80,
186,
20478,
851,
20,
44,
658,
946,
154,
13,
9,
2328,
625,
27,
993,
3470,
4611,
993,
3274,
60,
800,
3726,
3726,
31,
985,
14,
2607,
1001,
13,
5,
396,
3274,
4611,
993,
3470,
6,
25,
8502,
69,
229,
26,
42,
76,
544,
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,
0... |
192.168.0.71... What is this special address used for?
===
I have some accesses from 192.168.0.71 on my apache logs. I looked up this IP (because my server almost exclusively takes requests from 127.0.0.1, and I saw that it's reserved for "special purposes." What types of purposes might those be? | 0 | [
2,
13,
19532,
9,
13434,
9,
387,
9,
4241,
9,
9,
9,
98,
25,
48,
621,
3218,
147,
26,
60,
800,
3726,
3726,
31,
57,
109,
1381,
160,
37,
13,
19532,
9,
13434,
9,
387,
9,
4241,
27,
51,
17140,
18893,
9,
31,
292,
71,
48,
15735,
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 stop Emacs from automatically editing my startup file?
===
Emacs edits my `.emacs` file whenever I use the customization facility, or when I type a command that is disabled by default. Any automatic editing of my configuration makes me nervous. How can I stop Emacs from ever editing my `.emacs`. file? | 0 | [
2,
184,
107,
31,
747,
13,
62,
6893,
18,
37,
7499,
9510,
51,
20205,
3893,
60,
800,
3726,
3726,
13,
62,
6893,
18,
9392,
18,
51,
13,
1,
9,
62,
6893,
18,
1,
3893,
6634,
31,
275,
14,
5816,
1829,
2646,
15,
54,
76,
31,
1001,
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... |
YUV Conversion via a fragment shader...
===
I have implemented a YUV to RGB conversion via a fragment shader written in Nvidia's shader language. (Y, U and V are stored in separate textures that are combined via multi texturing in my fragment shader). It works great under OpenGL, but under Direct3D I just can't get the output image to look right. I'm starting to suspect that Direct3D is somehow modifying the Y, U and V samples before I get a chance to do my YUV conversion thing. Does anyone know if Direct3D makes any modifications to the values stored in textures before the fragment shader is run and how to disable them>? | 0 | [
2,
2600,
710,
6263,
1197,
21,
14847,
7546,
139,
9,
9,
9,
800,
3726,
3726,
31,
57,
6807,
21,
2600,
710,
20,
761,
11400,
6263,
1197,
21,
14847,
7546,
139,
642,
19,
13,
20763,
18175,
22,
18,
7546,
139,
816,
9,
13,
5,
93,
15,
287,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Distributing iPhone applications 2.1 vs 2.0
===
Can iPhone applications compiled against 2.1 be successfully installed via iTunes on a 2.0 device?
I know iPhone applications compiled with 2.1 can _run_ on a 2.0 device (assuming they're not using anything new from 2.1). But am not sure if iTunes will let the install take place.
Does anyone have concrete information on this?
I have not seen any apps on the AppStore that are 2.1+ only. | 0 | [
2,
23125,
21024,
3767,
172,
9,
165,
4611,
172,
9,
387,
800,
3726,
3726,
92,
21024,
3767,
9316,
149,
172,
9,
165,
44,
3673,
4066,
1197,
12952,
27,
21,
172,
9,
387,
3646,
60,
31,
143,
21024,
3767,
9316,
29,
172,
9,
165,
92,
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 C++ actually a superset of C?
===
I am taking a class in C++ programming and the professor told us that there is no need to learn C because C++ contains everything in C plus object-oriented features. However, some others have told me that this is not necessarily true. Can anyone shed some light on this? | 0 | [
2,
25,
272,
20512,
1121,
21,
1026,
3554,
16,
272,
60,
800,
3726,
3726,
31,
589,
741,
21,
718,
19,
272,
20512,
3143,
17,
14,
1032,
470,
182,
30,
80,
25,
90,
376,
20,
2484,
272,
185,
272,
20512,
1588,
796,
19,
272,
3123,
3095,
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... |
What's the best way to benchmark programs in Windows?
===
I need to do some performance benchmarks on .NET programs (C#) in Windows, but I haven't done benchmarking much in the Windows world. I've looked into using the Windows 2000/XP Performance monitor with custom counters for this, but I don't think this is quite what I want.
Are there any good system facilities for this in Windows XP, or do I need to just use System.Timer and write text logs for manual interpretation, or is there something else? | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
25324,
1726,
19,
1936,
60,
800,
3726,
3726,
31,
376,
20,
107,
109,
956,
25324,
18,
27,
13,
9,
2328,
1726,
13,
5,
150,
5910,
6,
19,
1936,
15,
47,
31,
2933,
22,
38,
677,
25324,
68,
212,
19,
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 coding languages should a web developer know?
===
As the title asks, what coding languages should a web developer know? I know xHTML, CSS, PHP, and mySQL but I know that isn't enough. What else do you suggest?
Thanks,
-Marcus | 0 | [
2,
98,
13,
15458,
2556,
378,
21,
2741,
10058,
143,
60,
800,
3726,
3726,
28,
14,
581,
3913,
15,
98,
13,
15458,
2556,
378,
21,
2741,
10058,
143,
60,
31,
143,
993,
15895,
15,
272,
18,
18,
15,
13,
26120,
15,
17,
51,
18,
22402,
47,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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++ performance vs. Java/C#
===
My understanding is that C/C++ produces native code to run on a particular machine architecture. Conversely, languages like Java and C# run atop a virtual machine which abstracts away the native architecture. Logically it would seem impossible for Java or C# to match the speed of C++ because of this intermediate step, however I've been told that the latest compilers ("hot spot") can attain this speed or even exceed it.
Perhaps this is more of a compiler question than a language question, but can anyone explain in plain English how it is possible for one of these virtual machine languages to perform better than a native language? | 0 | [
2,
272,
20512,
956,
4611,
9,
8247,
118,
150,
5910,
800,
3726,
3726,
51,
3260,
25,
30,
272,
118,
150,
20512,
6700,
1275,
1797,
20,
485,
27,
21,
1498,
1940,
2607,
9,
21058,
15,
2556,
101,
8247,
17,
272,
5910,
485,
11010,
21,
6599,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best strategy for unit-testing database-driven applications?
===
I work with a lot of web applications that are driven by databases of varying complexity on the backend. Typically, there's an <a href="http://en.wikipedia.org/wiki/Object-relational_mapping">ORM</a> layer separate from the business and presentation logic. This makes unit-testing the business logic fairly straightforward; things can be implemented in discrete modules and any data needed for the test can be faked through object mocking.
But testing the ORM and database itself has always been fraught with problems and compromises.
Over the years, I have tried a few strategies, none of which completely satisfied me.
- Load a test database with known data. Run tests against the ORM and confirm that the right data comes back. The disadvantage here is that your test DB has to keep up with any schema changes in the application database, and might get out of sync. It also relies on artificial data, and may not expose bugs that occur due to stupid user input. Finally, if the test database is small, it won't reveal inefficiencies like a missing index. (OK, that last one isn't really what unit testing should be used for, but it doesn't hurt.)
- Load a copy of the production database and test against that. The problem here is that you may have no idea what's in the production DB at any given time; your tests may need to be rewritten if data changes over time.
Some people have pointed out that both of these strategies rely on specific data, and a unit test should test only functionality. To that end, I've seen suggested:
- Use a mock database server, and check only that the ORM is sending the correct queries in response to a given method call.
What strategies have you used for testing database-driven applications, if any? What has worked the best for you? | 0 | [
2,
98,
22,
18,
14,
246,
4427,
26,
1237,
8,
10543,
68,
6018,
8,
14489,
3767,
60,
800,
3726,
3726,
31,
170,
29,
21,
865,
16,
2741,
3767,
30,
50,
5355,
34,
6018,
18,
16,
9852,
12745,
27,
14,
97,
2451,
9,
2442,
15,
80,
22,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What does your Objective-C singleton look like?
===
Mine is merely (or a close variant thereof):
static MyClass *gInstance = NULL;
+ (MyClass *)instance
{
@synchronized(self)
{
if (gInstance == NULL)
gInstance = [[self alloc] init];
}
return(self);
} | 4 | [
2,
98,
630,
154,
7038,
8,
150,
345,
444,
361,
101,
60,
800,
3726,
3726,
1114,
25,
5494,
13,
5,
248,
21,
543,
8320,
80,
1041,
6,
45,
12038,
51,
1898,
1637,
17040,
38,
2416,
800,
16203,
73,
2754,
13,
5,
915,
1898,
1637,
6,
108,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Recreate explorer window in Python gui
===
I am making a Python gui project that needs to duplicate the look of a Windows gui environment (ie Explorer). I have my own custom icons to draw but they should be selectable by the same methods as usual; click, ctrl-click, drag box etc. Are any of the gui toolkits going to help with this or will I have to implement it all myself. If there aren't any tools to help with this advice would be greatly appreciated. | 0 | [
2,
21119,
8520,
1463,
19,
20059,
9457,
800,
3726,
3726,
31,
589,
544,
21,
20059,
9457,
669,
30,
2274,
20,
19429,
14,
361,
16,
21,
1936,
9457,
2307,
13,
5,
660,
8520,
6,
9,
31,
57,
51,
258,
5816,
9801,
18,
20,
2003,
47,
59,
378... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Nintendo DS homebrew with Ada?
===
Note: I know very little about the GCC toolchain, so this question may not make much sense.
Since GCC includes an Ada front end, and it can emit ARM, and devKitPro is based on GCC, is it possible to use Ada instead of C/C++ for writing code on the DS? | 0 | [
2,
10562,
13,
43,
18,
213,
13712,
29,
13,
4405,
60,
800,
3726,
3726,
1945,
45,
31,
143,
253,
265,
88,
14,
489,
3384,
5607,
17317,
15,
86,
48,
1301,
123,
52,
233,
212,
1259,
9,
179,
489,
3384,
1103,
40,
13,
4405,
431,
241,
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... |
Inadvertent Session Hijacking Issue With Restful Authentication
===
I'm using the current version of restful_authentication that is found on github and I'm having a bunch of strange session issues. The server seems to be somehow assigning sessions to users it shouldn't be. This only happens when crossing the logged out/logged in barrier.
Here's an example. With no sessions active on the server, I log in to an account with user A. On another machine, I log in with user B. Then when logging out of user B, sometime after the logout redirect happens, I will be logged in as user A. From this point, I can continue to navigate the site as if I had logged in as that user! Something I've observed via the logs is that when this hijack happens, the session IDs are not the same. User A is logged in in both sessions, but the session ID's are completely different. This is just one example of what might happen. I can't reproduce the issue reliably as it is seemingly random.
It doesn't seem to be a symptom of the environment or the server it's running on. I can reproduce the problem using both mongrel and passenger. I've also seen it in development and production. I am using db-based sessions in this application and it is running on Rails 2.1.1. I applied the stateful option when calling the generator. Otherwise no other modifications have been made to how sessions are handled. | 0 | [
2,
19,
22898,
2291,
3723,
21691,
68,
1513,
29,
760,
1566,
27963,
800,
3726,
3726,
31,
22,
79,
568,
14,
866,
615,
16,
760,
1566,
1,
1346,
2504,
1786,
857,
30,
25,
216,
27,
13,
10404,
20926,
17,
31,
22,
79,
452,
21,
7653,
16,
25... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to invoke an interactive elisp interpreter in Emacs?
===
Right now I write expressions in the `*scratch*` buffer and test them by evaluating with C-x C-e. I would really appreciate having an interactive interpreter like SLIME or irb, in which I could test Emacs Lisp expressions. | 0 | [
2,
184,
20,
28371,
40,
9194,
8161,
3401,
19336,
19,
13,
62,
6893,
18,
60,
800,
3726,
3726,
193,
130,
31,
2757,
13832,
19,
14,
13,
1,
2483,
18,
7519,
9744,
2483,
1,
17497,
17,
1289,
105,
34,
26764,
29,
272,
8,
396,
272,
8,
62,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.