unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Is there a deconstructor for Java?
===
Is there a deconstructor for Java? I don't seem to be able to find any documentation on this. If there isn't, how can I achieve the same effect?
Thank you in advance. | 0 | [
2,
25,
80,
21,
121,
1126,
10346,
248,
26,
8247,
60,
800,
3726,
3726,
25,
80,
21,
121,
1126,
10346,
248,
26,
8247,
60,
31,
221,
22,
38,
2260,
20,
44,
777,
20,
477,
186,
13945,
27,
48,
9,
100,
80,
2532,
22,
38,
15,
184,
92,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0... |
AG_E_PARSER_BAD_PROPERTY_VALUE for StaticResource in Silverlight
===
I'm storing all localizable strings in a `ResourceDictionary` (in `App.xaml`) and assign those via the `StaticResource` markup extension to `TextBlock.Text`, `Button.Content` etc.
In Beta 2 and RC0, _sometimes_ parsing the XAML in `InitializeComponent()` will fail with an `AG_E_PARSER_BAD_PROPERTY_VALUE` on the line and position where I set the attribute value to the `StaticResource`.
It only happens sometimes: When restarting the app, it parses and displays without any problems. The same interface code works for days or weeks, then it happens again.
Any ideas? | 0 | [
2,
11342,
1,
62,
1,
3574,
4104,
1,
5989,
1,
10890,
106,
1084,
1,
15165,
26,
12038,
99,
12097,
19,
1172,
3130,
800,
3726,
3726,
31,
22,
79,
25615,
65,
375,
3186,
579,
7887,
19,
21,
13,
1,
99,
12097,
22595,
1857,
1,
13,
5,
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... |
Stick with PHP or learn Ruby(on rails)
===
I am a CS student and I wanted to get some more experieced folks opinion o the following. I have a strong background in the curly bracket languages, particular C and Java, and have been working with php for about year now and again.I am also currently interning at a php shop.
My goal is to hopefully get a job in web development, maybe contracting for small companies or something while I finish up school.
So what is best? to stick with php and be come an expert? as I already have a strong basis or to go ahead and put some serious time into learning ruby on rails over the next few months.
Here are the reason I am considering learning Ruby:
1. Since I am so used to languages with C still syntax learning on with a different way of doing things might be helpful.
2. Rails make web development so easy compared to all things you have to built up using php, ie I often try to implement a MVC approach myself on php projects.
3. I tried working with CakePHP and symfony but I could tell pretty quickly that they were knock-offs of rails, the php syntax just doesn't work quiet as you would hope with.
| 0 | [
2,
5258,
29,
13,
26120,
54,
2484,
10811,
5,
218,
2240,
18,
6,
800,
3726,
3726,
31,
589,
21,
272,
18,
1209,
17,
31,
417,
20,
164,
109,
91,
13,
6899,
8337,
11014,
14563,
4052,
635,
14,
249,
9,
31,
57,
21,
966,
2395,
19,
14,
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 can I find the method that called the current method?
===
When logging in C#, how can I learn the name of the method that called the current method? I know all about System.Reflection.MethodBase.GetCurrentMethod(), but I want to go one step beneath this in the stack trace. I've considered parsing the stack trace, but I am hoping to find a cleaner more explicit way, something like Assembly.GetCallingAssembly() but for methods. | 0 | [
2,
184,
92,
31,
477,
14,
2109,
30,
227,
14,
866,
2109,
60,
800,
3726,
3726,
76,
13,
13919,
19,
272,
5910,
15,
184,
92,
31,
2484,
14,
204,
16,
14,
2109,
30,
227,
14,
866,
2109,
60,
31,
143,
65,
88,
329,
9,
27977,
872,
9,
59... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 updating a whole project's root, how to exclude svn externals from being updated?
===
Is there a way to exclude all svn externals when doing a recursive update?
Is there a way to exclude only 1 of all of the svn externals when doing a recursive update?
Basically I'd like to cut down the svn update time, and a couple of the SVN externals that I have will just about never get updated. | 0 | [
2,
76,
71,
43,
1880,
21,
979,
669,
22,
18,
5900,
15,
184,
20,
21077,
13,
18,
16578,
4886,
18,
37,
142,
6372,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
21077,
65,
13,
18,
16578,
4886,
18,
76,
845,
21,
302,
24244,
11100,
60,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you develop against OpenID locally
===
I'm developing a website (in Django) that uses OpenID to authenticate users. As I'm currently only running on my local machine I can't authenticate using one of the OpenID providers on the web. So I figure I need to run a local OpenID server that simply lets me type in a username and then passes that back to my main app.
Does such an OpenID dev server exist? Is this the best way to go about it? | 0 | [
2,
184,
107,
42,
2803,
149,
368,
1340,
6680,
800,
3726,
3726,
31,
22,
79,
3561,
21,
2271,
13,
5,
108,
3857,
14541,
6,
30,
2027,
368,
1340,
20,
14351,
1373,
3878,
9,
28,
31,
22,
79,
871,
104,
946,
27,
51,
375,
1940,
31,
92,
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... |
GPSID - Poll Driver V2.0
===
On the page
[http://msdn.microsoft.com/en-us/library/bb202066.aspx][1]
If references something called "POLL Driver V2" however this is the only
place I can see that talks about this. I'm extermely interested in the
`GPSSetDeviceParam: GPS_QUERY_FIX` call but after searching for about 2 hours
on this, I couldn't find any information.
Can someone point me in the right direction on this?
[1]: http://msdn.microsoft.com/en-us/library/bb202066.aspx | 0 | [
2,
18298,
1340,
13,
8,
4994,
2425,
566,
135,
9,
387,
800,
3726,
3726,
27,
14,
2478,
636,
21127,
6903,
79,
18,
43,
103,
9,
22019,
12980,
9,
960,
118,
219,
8,
267,
118,
1210,
2559,
622,
118,
3490,
1323,
1323,
3526,
9,
472,
306,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Looking for tools to export data, creating insert scripts
===
I'm looking for a good tool to script specific data from my database.
In phpmyadmin I was able to write a query and just hit the "export" button to generate insert scripts. I have not yet found anything for MS SQL server that will do this.
It would be great if the tool also offered me the option to do identity inserts or even do delete before insert, check if the record exists and update it, and so on. | 0 | [
2,
699,
26,
4672,
20,
7487,
1054,
15,
2936,
14692,
17505,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
254,
5607,
20,
3884,
1903,
1054,
37,
51,
6018,
9,
19,
13,
26120,
915,
1283,
2160,
31,
23,
777,
20,
2757,
21,
25597,
17,
114,
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... |
Why does FileSystemWatcher create multiple change events when I copy a file to the directory
===
I've written a small test application using the .Net FileSystemWatcher to keep an eye on a directory. When I copy a large-ish (a few Mb) file into that directory I get the following events listed (see screenshot - and ignore the Delete event to begin with).
![alt text][1]
I get a created event (as expected), but then two changed events (about 0.7 seconds apart). Why is this? This would cause major problems in the application I am planning to develop - as I'd try and do things with the file twice (presumably once before it has finished being written to!). Is there anything I can do to stop this happening? From what I've read on StackOverflow and elsewhere, you should just get one changed event once the file has been changed and then closed. Why am I getting two?
[1]: http://robinwilson.homelinux.com/FSW.png | 0 | [
2,
483,
630,
3893,
10724,
9054,
106,
1600,
1886,
753,
963,
76,
31,
4344,
21,
3893,
20,
14,
16755,
800,
3726,
3726,
31,
22,
195,
642,
21,
284,
1289,
3010,
568,
14,
13,
9,
2328,
3893,
10724,
9054,
106,
20,
643,
40,
1356,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Downgrading from ClearCase to SVN/Mercurial
===
At work, we're using ClearCase right now. However, there's a lot of overhead required, especially when someone does something stupid (like erase a view with multiple reserved check-outs on the trunk...). Since we're trying to lower our overhead and be as lightweight as possible, we've through about the possibility of ditching CC and going for something lighter (Subversion or Mercurial), seeing as how we don't use 90% of CC's features anyway. Does this sound reasonable or will we be trading our Ferrari in for a station wagon?
All answers are appreciated!! | 0 | [
2,
125,
7691,
68,
37,
1207,
10325,
20,
13,
18,
16578,
118,
1263,
4734,
2815,
800,
3726,
3726,
35,
170,
15,
95,
22,
99,
568,
1207,
10325,
193,
130,
9,
207,
15,
80,
22,
18,
21,
865,
16,
8860,
1390,
15,
1118,
76,
737,
630,
301,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Django UserProfile... without a password
===
I'd like to create a subset of Users that don't have a login... basically as a way to add a photographer field to photos without having a full blown account associated with that person (since in many cases, they'll never actually log in to the site). A caveat is that I'd also like to be able to enable an account for them later.
So, I think the question becomes what's the best way to set up a "People" table that ties to the User table without actually extending the User table with UserProfile. | 0 | [
2,
3857,
14541,
4155,
14503,
9,
9,
9,
366,
21,
20884,
800,
3726,
3726,
31,
22,
43,
101,
20,
1600,
21,
16622,
16,
3878,
30,
221,
22,
38,
57,
21,
6738,
108,
9,
9,
9,
11374,
28,
21,
161,
20,
3547,
21,
5980,
575,
20,
7064,
366,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to generate a database from the Entity Data Model (edmx) file?
===
In Linq to SQL it is possible to generate the database from the dbml file.
Is it possible to generate a database from the Entity Data Model ? I wish to accomplish the same thing using the edmx file. | 0 | [
2,
25,
32,
938,
20,
7920,
21,
6018,
37,
14,
9252,
1054,
1061,
13,
5,
69,
79,
396,
6,
3893,
60,
800,
3726,
3726,
19,
6294,
1251,
20,
4444,
255,
32,
25,
938,
20,
7920,
14,
6018,
37,
14,
13,
9007,
8184,
3893,
9,
25,
32,
938,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 resources for learning data mining?
===
I'd like to get fluent enough in the data mining domain to be able to use the features of the [Orange][1] framework to classify photos of fish.
[1]: http://magix.fri.uni-lj.si/orange/ | 0 | [
2,
98,
50,
109,
254,
2566,
26,
2477,
1054,
4243,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
164,
19252,
511,
19,
14,
1054,
4243,
4603,
20,
44,
777,
20,
275,
14,
967,
16,
14,
636,
24304,
500,
2558,
165,
500,
6596,
20,
25117,
706... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Slow SoapHttpClientProtocol
===
I'm doing some experiments with Microsoft Dynamics CRM. You interact with it through web services and I have added a Web Reference my project. The web service interface is very rich, and the generated "Reference.cs" is some 90k loc.
I'm using the web reference in a console application. I often change something, recompile and run. Compilation is fast, but newing up the web service reference is very slow, taking some 15-20 seconds:
<code>
CrmService service = new CrmService();
</code>
Profiling reveals that all time is spent in the SoapHttpClientProtocol constructor.
The culprit is apparently the fact that the XML serialization code (not included in the 90k loc mentioned above) is generated at run time, before being JIT'ed. This happens during the constructor call. The wait is rather frustrating when playing around and trying things out.
I've tried various combinations of sgen.exe, ngen and XGenPlus (which takes several hours and generates 500MB of additional code) but to no avail. I've considered implementing a Windows service that have few CrmService instances ready to dish out when needed but that seems excessive.
Any ideas? | 0 | [
2,
2276,
6447,
21127,
150,
18513,
38,
2740,
262,
7771,
800,
3726,
3726,
31,
22,
79,
845,
109,
7715,
29,
7099,
12289,
6186,
79,
9,
42,
10001,
29,
32,
120,
2741,
687,
17,
31,
57,
905,
21,
2741,
2801,
51,
669,
9,
14,
2741,
365,
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... |
Deserialize jSON Google AJAX Translation API
===
I've got the JSON coming back like this:
{"responseData": [{"responseData":{"translatedText":"elefante"},"responseDetails":null,"responseStatus":200},{"responseData":{"translatedText":"Burro"},"responseDetails":null,"responseStatus":200}], "responseDetails": null, "responseStatus": 200}
And I need to parse it into a ResponseData object I have set-up:
public class ResponseData
{
public string translatedText = string.Empty;
public object responseDetails = null;
public HttpStatusCode responseStatus = HttpStatusCode.OK;
public List<ResponseData> responseData { get; set; }
}
I Deserialize it like this:
JavaScriptSerializer serializer = new JavaScriptSerializer();
ResponseData translation =
serializer.Deserialize<ResponseData>(responseJson);
But no matter what the translated text is always empty.
| 0 | [
2,
1746,
106,
2815,
2952,
487,
528,
8144,
20624,
4064,
21,
2159,
800,
3726,
3726,
31,
22,
195,
330,
14,
487,
528,
880,
97,
101,
48,
45,
13,
1,
7,
99,
18,
8782,
18,
69,
4375,
7,
45,
636,
1,
7,
99,
18,
8782,
18,
69,
4375,
7,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to elegantly print the date in RFC822 format in PERL
===
How can I elegantly print the date in RFC822 format in perl?
| 0 | [
2,
184,
20,
11614,
102,
4793,
14,
1231,
19,
17492,
4075,
135,
2595,
19,
416,
255,
800,
3726,
3726,
184,
92,
31,
11614,
102,
4793,
14,
1231,
19,
17492,
4075,
135,
2595,
19,
416,
255,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to get notified when a drive letter becomes available
===
Is it possible to get notified (without polling, but via an event) when a drive letter becomes accessible. For example if you have an external hard drive that always appears as drive F - is it possible to have an event raised when that is connected and F becomes accessible? | 0 | [
2,
184,
20,
164,
22904,
76,
21,
1493,
1748,
2633,
904,
800,
3726,
3726,
25,
32,
938,
20,
164,
22904,
13,
5,
14506,
20734,
15,
47,
1197,
40,
807,
6,
76,
21,
1493,
1748,
2633,
7342,
9,
26,
823,
100,
42,
57,
40,
4886,
552,
1493,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Avoiding, finding and removing memory leaks in Cocoa
===
Memory (and resource) leaks happen. How do you make sure they don't?
What tips & techniques would you suggest to help avoid creating memory leaks in first place?
Once you have an application that is leaking how do you track down the source of leaks? | 0 | [
2,
10298,
15,
3007,
17,
9096,
1912,
11724,
18,
19,
24507,
800,
3726,
3726,
1912,
13,
5,
290,
6577,
6,
11724,
18,
2384,
9,
184,
107,
42,
233,
562,
59,
221,
22,
38,
60,
98,
11034,
279,
4212,
83,
42,
5601,
20,
448,
2658,
2936,
19... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to remove paths from tabs in Visual Studio 2008?
===
Is there a way to stop the path showing in a source code tab in Visual Studio 2008?
Currently when developing an ASP.NET site, I get the path from the root plus the filename - truncated when it gets too long. So something like:
> MyDir/MyPage.aspx
for a short path and filename, or:
> MyDir/MyLong...yPage.aspx
for a longer path and filename.
I'd prefer to just see the filename, allowing more tabs to show at once and making it easier to see which files I have open without using the drop-down list or Crtl-Tab to show the full set.
In VS2005, I just get the filename - no path however long it is. Oddly in VS2003 I get the path and filename. I've scoured the options and I can't find a setting that lets me change what appears in the tabs. Searching suggests that other people have similar issues (although which version it occurs in appears to differ) but no-one could point to an option to change what appears.
Can anyone point me in the right direction to get rid of the paths in the tabs (or confirm that it can't be changed to save me wasting more time searching)? | 0 | [
2,
184,
20,
4681,
12074,
37,
6523,
18,
19,
3458,
1120,
570,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
747,
14,
2013,
3187,
19,
21,
1267,
1797,
6523,
19,
3458,
1120,
570,
60,
871,
76,
3561,
40,
28,
306,
9,
2328,
689,
15,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
UTF8 vs. UTF16 vs. char* vs. what? Someone explain this mess to me!
===
I've managed to mostly ignore all this multi-byte character stuff, but now I need to do some UI work and I know my ignorance in this area is going to catch up with me! Can anyone explain in a few paragraphs or less just what I need to know so that I can localize my applications? What types should I be using (I use both .Net and C/C++, and I need this answer for both Unix and Windows). | 0 | [
2,
287,
11720,
457,
4611,
9,
287,
11720,
1091,
4611,
9,
4892,
2483,
4611,
9,
98,
60,
737,
3271,
48,
3957,
20,
55,
187,
800,
3726,
3726,
31,
22,
195,
1471,
20,
1555,
7174,
65,
48,
1889,
8,
23246,
925,
3217,
15,
47,
130,
31,
376... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Setup multi languages wordpress
===
I need to setup a blog using wordpress engine but i need it support multi languages (3 languages), currently i am thinking of using custom field to identify the language of current post though i knew thats not a best practices, does anyone has better suggestions? | 0 | [
2,
18161,
1889,
2556,
833,
5890,
800,
3726,
3726,
31,
376,
20,
18161,
21,
8146,
568,
833,
5890,
1406,
47,
31,
376,
32,
555,
1889,
2556,
13,
5,
240,
2556,
6,
15,
871,
31,
589,
1440,
16,
568,
5816,
575,
20,
5808,
14,
816,
16,
86... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which data structure for linking text with audio in Java
===
I want to write a program in which plays an audio file that reads a text.
I want to highlite the current syllable that the audiofile plays in green and the rest of the current word in red.
What kind of datastructure should I use to store the audio file and the information that tells the program when to switch to the next word/syllable? | 0 | [
2,
56,
1054,
1411,
26,
12585,
1854,
29,
4023,
19,
8247,
800,
3726,
3726,
31,
259,
20,
2757,
21,
625,
19,
56,
1533,
40,
4023,
3893,
30,
11137,
21,
1854,
9,
31,
259,
20,
183,
10601,
14,
866,
13,
18178,
30,
14,
4023,
16877,
1533,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 "Total Length of columns in constaint is too long" err mean in Informix?
===
I get the Total length of columns in constraint is too long. erro from the following
sql] Failed to execute: CREATE TABLE GTW_WORKFLOW_MON ( WORKFLOW_NAME VARCHAR(255) NOT
NULL, WORKFLOW_LOADED NUMERIC(20) NOT NULL, ACTIVITY_NAME VARCHAR(255) NOT NULL, FLAGS
INTEGER NOT NULL, MONITOR_NAME VARCHAR(255) NOT NULL, CLASSNAME VARCHAR(255) NOT NULL, S
TR0 VARCHAR(255), STR1 VARCHAR(255), STR2 VARCHAR(255), NUM0 VARCHAR(255), NUM1
VARCHAR(255), NUM2 VARCHAR(255), DATE0 VARCHAR(255), DATE1 VARCHAR(255), DATE2
VARCHAR(255), PRIMARY KEY (WORKFLOW_NAME,WORKFLOW_LOADED,ACTIVITY_NAME,MONITOR_NAME) )
[sql] java.sql.SQLException: Total length of columns in constraint is too long. | 0 | [
2,
98,
630,
13,
7,
20148,
1476,
16,
7498,
19,
11608,
5851,
38,
25,
266,
175,
7,
13,
106,
139,
884,
19,
10361,
4028,
60,
800,
3726,
3726,
31,
164,
14,
600,
1476,
16,
7498,
19,
28804,
25,
266,
175,
9,
13,
106,
661,
37,
14,
249... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Apache or lighttpd
===
For development, I use a local LAMP stack, for production I'm using [MediaTemple's Django Container](http://mediatemple.net/webhosting/gs/django.html) (which I'm loving BTW). MT's container uses lighthttpd. Honestly I've never had any other experience with it. I've always used Apache. I've been doing some reading:
* [Onlamp](http://www.onlamp.com/pub/a/onlamp/2007/04/05/the-lighttpd-web-server.html)
* [TextDrive](http://weblog.textdrive.com/article/25/should-i-consider-lighttpd)
* [Linux.com](http://www.linux.com/feature/51673)
Here's are questions:
* Would it _benefit_ me to use lighthttpd on my dev setup?
* What's up with using both? The Linux.com article talks about using lighttpd _with_ Apache. | 0 | [
2,
17140,
54,
471,
38,
9251,
800,
3726,
3726,
26,
522,
15,
31,
275,
21,
375,
6792,
7566,
15,
26,
637,
31,
22,
79,
568,
636,
8260,
9577,
413,
22,
18,
3857,
14541,
12147,
500,
5,
21127,
6903,
8260,
9577,
413,
9,
2328,
118,
14113,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ruby on Rails Editor for Windows
===
I love to use Textmate on my Mac at home but have a hard finding somehing to use at work (windows).
What is the best editor to use for Ruby on Rails on windows that get you the closest look and feel to Textmate? | 0 | [
2,
10811,
27,
2240,
18,
1835,
26,
1936,
800,
3726,
3726,
31,
339,
20,
275,
1854,
5281,
27,
51,
1572,
35,
213,
47,
57,
21,
552,
3007,
109,
252,
68,
20,
275,
35,
170,
13,
5,
27508,
18,
6,
9,
98,
25,
14,
246,
1835,
20,
275,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you bind a DropDownList in a GridView in the EditItemTemplate Field?
===
Here's my code in a gridview that is bound at runtime:
...
<asp:templatefield>
<edititemtemplate>
<asp:dropdownlist runat="server" id="ddgvOpp" />
</edititemtemplate>
<itemtemplate>
<%# Eval("opponent.name") %>
</itemtemplate>
</asp:templatefield>
...
I want to bind the dropdownlist "ddgvOpp" but i don't know how. I should, but I don't. Here's what I have, but I keep getting an "Object reference" error, which makes sense:
protected void gvResults_RowDataBound(object sender, GridViewRowEventArgs e)
{
if (e.Row.RowType == DataControlRowType.DataRow) //skip header row
{
DropDownList ddOpp = (DropDownList)e.Row.Cells[5].FindControl("ddgvOpp");
BindOpponentDD(ddOpp);
}
}
Where <code>BindOpponentDD()</code> is just where the DropDownList gets populated. Am I not doing this in the right event? If not, which do I need to put it in?
Thanks so much in advance... | 0 | [
2,
184,
107,
42,
10193,
21,
2804,
2968,
5739,
19,
21,
7354,
4725,
19,
14,
9392,
2119,
79,
9577,
6554,
575,
60,
800,
3726,
3726,
235,
22,
18,
51,
1797,
19,
21,
7354,
4725,
30,
25,
4138,
35,
485,
891,
45,
13,
9,
9,
9,
13,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Indexing URL's in SQL Server 2005
===
What is the best way to deal with storing and indexing URL's in SQL Server 2005?
I have a WebPage table that stores metadata and content about Web Pages. I also have many other tables related to the WebPage table. They all use URL as a key.
The problem is URL's can be very large, and using them as a key makes the indexes larger and slower. How much I don't know, but I have read many times using large fields for indexing is to be avoided. Assuming a URL is nvarchar(400), they are enormous fields to use as a primary key.
What are the alternatives?
How much pain would there likely to be with using URL as a key instead of a smaller field.
I have looked into the WebPage table having a identity column, and then using this as the primary key for a WebPage. This keeps all the associated indexes smaller and more efficient but it makes importing data a bit of a pain. Each import for the associated tables has to first lookup what the id of a url is before inserting data in the tables.
I have also played around with using a hash on the URL, to create a smaller index, but am still not sure if it is the best way of doing things.
There will be millions of records about webpages stored in the database, and there will be a lot of batch updating. Also there will be a quite a lot of activity reading and aggregating the data.
Any thoughts?
| 0 | [
2,
4348,
68,
287,
6362,
22,
18,
19,
4444,
255,
8128,
812,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
1183,
29,
25615,
17,
4348,
68,
287,
6362,
22,
18,
19,
4444,
255,
8128,
812,
60,
31,
57,
21,
2741,
6486,
859,
30,
4134,
28057,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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#/.NET Lexer Generators
===
I'm looking for a decent lexical scanner generator for C#/.NET -- something that supports unicode character classes, and generates somewhat readable & efficient code. Anyone know of one? | 0 | [
2,
272,
5910,
118,
9,
2328,
13492,
106,
20495,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
12238,
29180,
23195,
15286,
26,
272,
5910,
118,
9,
2328,
13,
8,
8,
301,
30,
6747,
28010,
925,
2684,
15,
17,
7920,
18,
4131,
1302,
579,
279,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
HTML: POST for images?
===
I am working on a web-application in which dynamically-created images are used to display information. This data is currently sent to the images using a GET query-string but with more complex images and data I am worried about running into problems with the url character limit.
I could simply pass the record ID to the image and have this query the database but this would obviously increase demand on the server. Is there some way I could add an image retrieved using POST into a HTML document?
Thanks in advance. | 0 | [
2,
13,
15895,
45,
678,
26,
3502,
60,
800,
3726,
3726,
31,
589,
638,
27,
21,
2741,
8,
2552,
20669,
19,
56,
7782,
1326,
8,
18475,
3502,
50,
147,
20,
3042,
676,
9,
48,
1054,
25,
871,
795,
20,
14,
3502,
568,
21,
164,
25597,
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... |
good resource for socket errors?
===
Where can I find a list of all types of bsd style socket errors? | 0 | [
2,
254,
6577,
26,
18482,
11908,
60,
800,
3726,
3726,
113,
92,
31,
477,
21,
968,
16,
65,
2551,
16,
334,
18,
43,
1034,
18482,
11908,
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... | [
1,
1,
1,
1,
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... |
Why does System.Net.Mail fail where System.Web.Mail works.
===
I can get both System.Net.Mail and System.Web.Mail to work with GMail, but I can't get them both to work with smtp.att.yahoo.com.
I get the SMTP settings from my own Web.config keys. These settings work when I send using System.Web.Mail, but fail with System.Net.Mail.
<add key="SmtpServer" value="smtp.att.yahoo.com"/>
<add key="SmtpServerAuthenticateUser" value="ctrager@sbcglobal.net"/>
<add key="SmtpServerPort" value="465"/>
<add key="SmtpUseSSL" value="1"/>
<add key="SmtpServerAuthenticatePassword" value="MY PASSWORD"/>
Here is the code that grabs my settings, and works with GMail, fails with att.yahoo:
SmtpClient smtp;
if (!string.IsNullOrEmpty(Util.get_setting("SmtpServer", "")))
{
smtp = new SmtpClient(Util.get_setting("SmtpServer", ""));
}
else
{
smtp = new SmtpClient();
}
if (!string.IsNullOrEmpty(Util.get_setting("SmtpServerAuthenticatePassword", "")))
smtp.Credentials = new System.Net.NetworkCredential(
Util.get_setting("SmtpServerAuthenticateUser", ""),
Util.get_setting("SmtpServerAuthenticatePassword", ""));
if (!string.IsNullOrEmpty(Util.get_setting("SmtpServerPort", "")))
smtp.Port = int.Parse(Util.get_setting("SmtpServerPort", ""));
if (Util.get_setting("SmtpUseSSL", "0") == "1")
smtp.EnableSsl = true;
smtp.Send(message);
| 0 | [
2,
483,
630,
329,
9,
2328,
9,
8079,
7476,
113,
329,
9,
14113,
9,
8079,
693,
9,
800,
3726,
3726,
31,
92,
164,
156,
329,
9,
2328,
9,
8079,
17,
329,
9,
14113,
9,
8079,
20,
170,
29,
489,
8079,
15,
47,
31,
92,
22,
38,
164,
105,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to get perforce to behave like subversion?
===
Can perforce be adjusted so I don't need to "open files for edit"? Someone told me that this was a "feature", and that s/he guessed it could be turned off. | 0 | [
2,
25,
32,
938,
20,
164,
416,
8774,
20,
14149,
101,
972,
10898,
60,
800,
3726,
3726,
92,
416,
8774,
44,
12155,
86,
31,
221,
22,
38,
376,
20,
13,
7,
10157,
6488,
26,
9392,
7,
60,
737,
470,
55,
30,
48,
23,
21,
13,
7,
26956,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Probability of hardware related disk or memory corruption?
===
I've got a few hundred computers running an app. On one computer, I've seen two instances of a single bit being incorrectly set on some strings that I pull out of SQLite. If this was my dev computer I would assume I have a bug somewhere, but there is certainly some number of installations at which point I'll start seeing rare hardware based errors.
This is certainly dependent on how much IO I do, but are there any rules of thumbs for when there is a decent chance of seeing this kind of thing? For example, for TCP packets, [this paper][1] determined that silent, undetected corruption will occur in "roughly 1 in 16 million to 10 billion packets".
Unfortunately, running a mem/disk checker on the machine in question is not likely to happen.
[1]: http://portal.acm.org/citation.cfm?doid=347059.347561 | 0 | [
2,
10177,
16,
7610,
1597,
8582,
54,
1912,
7858,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
310,
1874,
7774,
946,
40,
4865,
9,
27,
53,
1428,
15,
31,
22,
195,
541,
81,
13946,
16,
21,
345,
1142,
142,
22870,
309,
27,
109,
7887,
30... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to set cookies from outside domains inside iframes in Safari?
===
From the Apple [developer faq][1]
> Safari ships with a conservative
> cookie policy which limits cookie
> writes to only the pages chosen
> ("navigated to") by the user.
By default Safari only allows cookies from sites you navigate to directly. (i.e. if you click on links with the url of that domainname).
This means that if you load a page from your own site with an iFrame with a page from another site, that the other site is not able to set cookies. (for instance, a ticketshop). As soon as you have visited the other domain directly, the other site is able to access and change its own cookies.
Without having access to code on the other site, how can i make the user-experience as inobtrusive as possible?
Is there a (javascript?) way to check if the other site's cookies
are already set, and accordingly, show a direct link to the other site first, if needed?
[1]: http://developer.apple.com/internet/safari/faq.html | 0 | [
2,
184,
20,
309,
19396,
37,
719,
15544,
572,
31,
8361,
18,
19,
25055,
60,
800,
3726,
3726,
37,
14,
4037,
636,
26051,
106,
1399,
1251,
500,
2558,
165,
500,
13,
1,
25055,
2034,
29,
21,
3002,
13,
1,
19980,
1486,
56,
5887,
19980,
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 is the max length of an informix column and can it be increased?
===
I am trying to create a table with the following
CREATE TABLE GTW_WORKFLOW_MON ( WORKFLOW_NAME VARCHAR(255) NOT
NULL, WORKFLOW_LOADED NUMERIC(20) NOT NULL, ACTIVITY_NAME VARCHAR(255)
NOT NULL, FLAGS INTEGER NOT NULL, MONITOR_NAME VARCHAR(255) NOT NULL,
CLASSNAME VARCHAR(255) NOT NULL, STR0 VARCHAR(255), STR1 VARCHAR(255),
STR2 VARCHAR(255), NUM0 VARCHAR(255), NUM1 VARCHAR(255), NUM2 VARCHAR(255),
DATE0 VARCHAR(255),DATE1VARCHAR(255), DATE2 VARCHAR(255), PRIMARY KEY
WORKFLOW_NAME,WORKFLOW_LOADED,ACTIVITY_NAME,MONITOR_NAME) )
It fails due to column length not being large enough | 0 | [
2,
98,
25,
14,
2049,
1476,
16,
40,
10361,
4028,
4698,
17,
92,
32,
44,
1644,
60,
800,
3726,
3726,
31,
589,
749,
20,
1600,
21,
859,
29,
14,
249,
1600,
859,
9509,
499,
1,
3783,
9990,
1,
2111,
13,
5,
170,
9990,
1,
7259,
4033,
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... |
What's a Good Project for an Introduction to A.I.?
===
So I'm just getting started in exploring A.I. a bit and I'm wondering what a good project would be to help introduce me to the field. An example of the level of complexity I'm looking for would be something like tic-tac-toe, or a bayesian spam filter, or...?
For what ever project you suggest it would be helpful if you could also give a brief overview of some common AI strategies that might be used to solve the project you're recommending.
Thanks! | 0 | [
2,
98,
22,
18,
21,
254,
669,
26,
40,
3445,
20,
21,
9,
49,
9,
60,
800,
3726,
3726,
86,
31,
22,
79,
114,
1017,
373,
19,
11748,
21,
9,
49,
9,
21,
1142,
17,
31,
22,
79,
5712,
98,
21,
254,
669,
83,
44,
20,
448,
8500,
55,
20... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I programatically zoom a UIScrollView?
===
I'd like to zoom and unzoom in ways the base class doesn't support.
For instance, upon receiving a double tap.
| 0 | [
2,
184,
107,
31,
625,
721,
8438,
19469,
21,
13,
5661,
3862,
8694,
4725,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
19469,
17,
367,
2500,
2636,
19,
2847,
14,
1000,
718,
1437,
22,
38,
555,
9,
26,
4851,
15,
685,
3396,
21,
1494,
55... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Resetting all items in a TiddlyWiki/CheckboxPlugin checklist
===
I've written up a weekly-review GTD checklist for myself in TiddlyWiki, using [CheckboxPlugin][1]. After I'm finished with it each week, I'd like to click one link to uncheck (reset) all of the items on it, so it's ready for the next use.
I'm storing the check information as tags on a separate tiddler page. I should be able to just erase all the tags on that page and refresh the checklist page, but I haven't been able to work out how to do that yet.
I generally work in C, C++, and Lisp, I'm just learning about Javascript. Can anyone offer some useful pointers?
(And before anyone suggests it, I've looked at the ChecklistScript on the same site. It doesn't use the CheckboxPlugin stuff, and isn't compatible with it.)
[1]: http://www.tiddlytools.com/#CheckboxPlugin | 0 | [
2,
302,
19831,
65,
3755,
19,
21,
13,
13647,
43,
102,
17375,
118,
12542,
5309,
18527,
5831,
2631,
5739,
800,
3726,
3726,
31,
22,
195,
642,
71,
21,
3481,
8,
99,
4725,
9509,
43,
2631,
5739,
26,
992,
19,
13,
13647,
43,
102,
17375,
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... |
C++ include and import difference
===
What is the difference between include and import in C++? | 0 | [
2,
272,
20512,
468,
17,
9010,
2841,
800,
3726,
3726,
98,
25,
14,
2841,
128,
468,
17,
9010,
19,
272,
20512,
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... | [
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,
0,
0,
0... |
How can I control the name of generic WCF return types?
===
I've got a WCF Web Service method whose prototype is:
[OperationContract]
Response<List<Customer>> GetCustomers();
When I add the service reference to a client, Visual Studio (2005) creates a type called "ResponseOfArrayOfCustomerrleXg3IC" that is a wrapper for "Response<List<Customer>>". Is there any way I can control the wrapper name? ResponseOfArrayOfCustomerrleXg3IC doesn't sound very appealing... | 0 | [
2,
184,
92,
31,
569,
14,
204,
16,
12733,
11801,
410,
788,
2551,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
11801,
410,
2741,
365,
2109,
1196,
7063,
25,
45,
636,
11377,
23311,
500,
1627,
1,
5739,
1,
4636,
262,
1263,
1,
164,
4636,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 resources to starting learning Perl?
===
I want to start learning Perl from scratch and I need to find some good tutorials and books to begin with. I found [this tutorial][1] very helpful and I'm wondering if you guys know of some more useful resources to help me learn more about this language.
[1]: http://www.comp.leeds.ac.uk/Perl/start.html | 4 | [
2,
98,
50,
14,
246,
2566,
20,
1422,
2477,
416,
255,
60,
800,
3726,
3726,
31,
259,
20,
799,
2477,
416,
255,
37,
12395,
17,
31,
376,
20,
477,
109,
254,
29724,
18,
17,
964,
20,
2348,
29,
9,
31,
216,
636,
1565,
29724,
500,
2558,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PL/SQL: How to execute an SP which preforms a DML and has a return value?
===
I have a stored procedure with the following header:
FUNCTION SaveShipment (p_user_id IN INTEGER, p_transaction_id IN INTEGER, p_vehicle_code IN VARCHAR2 DEFAULT NULL, p_seals IN VARCHAR2 DEFAULT NULL) RETURN INTEGER;
And I am having trouble running it from TOAD's Editor. I cannot run it as part of a select from dual statement because it preforms DML, but if I try the following syntax which I saw recommended on some forum:
var c integer;
exec :c := orm_helper.orm_helper.SAVESHIPMENT (9999, 31896, NULL, '');
print c;
I get:
ORA-01008: not all variables bound
Details:
BEGIN :c := orm_helper.orm_helper.saveshipment (9999, 31896, null, ''); END;
Error at line 2
ORA-01008: not all variables bound
What's the proper syntax to run this sp manually? | 0 | [
2,
12443,
118,
18,
22402,
45,
184,
20,
15644,
40,
3782,
56,
782,
4190,
18,
21,
13,
43,
8184,
17,
63,
21,
788,
1923,
60,
800,
3726,
3726,
31,
57,
21,
8214,
7004,
29,
14,
249,
157,
106,
45,
1990,
2079,
2418,
1130,
13,
5,
306,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Algorithm for editing a "schedule" most efficiently
===
This is for a small scheduling app. I need an algorithm to efficiently compare two "schedules", find differences, and update only the data rows which have been changed, as well as entries in another table having this table as a foreign key. This is a big question, so I'll say right away I'm looking for either **general advice** or **specific solutions**.
In one table, I associate resources with a span of time when they are used. The start and end dates and times are broken up into four columns:
**Table A:**
<pre>
ID (unique id)
Resource_ID (foreign key)
Start_Date (date)
Start_Time (time)
End_Date (date)
End_Time (time)
</pre>
I also have a second table (Table B) which uses the ID from Table A as a foreign key:
**Table B:**
<pre>
ID (unique id)
Table_A_ID (foreign key)
Start_Date (date)
Start_Time (time)
End_Date (date)
End_Time (time)
..some extra data...
</pre>
The entry from Table A corresponding to Table B will have a span of time which **subsumes** the span of time from Table B. Not all entries in Table A will have an entry in Table B.
For simplicity, lets treat each data row as an "object" in the language of your choice having the given columns as properties.
I'm providing an interface for users to edit the resource schedule in Table A. They can perform any of the following actions, but the changes are applied all at once (not as the user makes them):
1. Add a new span of time for a resource
2. Remove a span of time for a resource (and its entry in Table B)
3. Extend a span of time for a resource
4. Remove a portion of a span of time (including the middle portion)
If they completely remove an object from Table A that is pointed to by Table B, I want to remove the entry from Table B as well.
So, given the following 3 sets:
- The original objects from Table A (from the DB)
- The original objects from Table B (from the DB)
- The edited set of objects from Table A (from the user, so no unique IDs)
I need an algorithm that will:
- Leave rows in Table A and Table B untouched if no changes are needed for those objects.
- Add rows to Table A as needed.
- Remove rows from Table A and Table B as needed.
- Modify rows in Table A and Table B as needed.
Just sorting the objects into an arrangement where I can apply the appropriate database operations is more than adequate for a solution.
Again, please answer as **specifically** or **generally** as you like, I'm looking for advice but if someone has a complete algorithm that would just make my day. :) | 0 | [
2,
9083,
26,
9510,
21,
13,
7,
18,
6261,
9813,
7,
127,
20519,
800,
3726,
3726,
48,
25,
26,
21,
284,
23096,
4865,
9,
31,
376,
40,
9083,
20,
20519,
11590,
81,
13,
7,
18,
6261,
18065,
7,
15,
477,
4921,
15,
17,
11100,
104,
14,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a regular expression to detect a valid regular expressoin?
===
Is is possible to detect a valid regular expression with another regular expression? If so please give example code below. | 0 | [
2,
25,
80,
21,
1290,
1803,
20,
9092,
21,
7394,
1290,
2999,
111,
108,
60,
800,
3726,
3726,
25,
25,
938,
20,
9092,
21,
7394,
1290,
1803,
29,
226,
1290,
1803,
60,
100,
86,
2247,
590,
823,
1797,
1021,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How are you planning on handling the migration to Python 3?
===
I'm sure this is a subject that's on most python developers' minds considering that Python 3 is coming out soon. Some questions to get us going in the right direction:
1. Will you have a python 2 and python 3 version to be maintained concurrently or will you simply have a python 3 version once it's finished?
- Have you already started or plan on starting soon? Or do you plan on waiting until the final version comes out to get into full swing? | 0 | [
2,
184,
50,
42,
2334,
27,
7988,
14,
8443,
20,
20059,
203,
60,
800,
3726,
3726,
31,
22,
79,
562,
48,
25,
21,
1550,
30,
22,
18,
27,
127,
20059,
10168,
22,
11433,
5154,
30,
20059,
203,
25,
880,
70,
651,
9,
109,
2346,
20,
164,
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... |
Same class, different namespaces, a way to simplify?
===
I'm working with a webservice that offers almost duplicated code across two namesspaces. Lets say for example PigFeet and HorseFeet, both namespaces contain a Feet class and other code that works with the Feet class requires it to be part of that same namespace.
Right now In my code I'm forced to do something like this:
if( _animalType == AnimalType.Pig )
{
//namespace is pigfeet
PigFeet.Feet feet = new Feet();
feet.WashFeet();
}
if( _animalType == AnimalType.Horse )
{
//namespace is horsefeet
HorseFeet.Feet feet = new Feet();
feet.WashFeet();
}
This is leaving me with lots of duplicated code. Is there a way to choose a namespace more dynamically?
| 0 | [
2,
205,
718,
15,
421,
204,
5582,
18,
15,
21,
161,
20,
28257,
60,
800,
3726,
3726,
31,
22,
79,
638,
29,
21,
2741,
11449,
30,
2486,
557,
19429,
43,
1797,
464,
81,
1817,
5582,
18,
9,
6884,
395,
26,
823,
7680,
16572,
38,
17,
1729,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 do ALSA in Mono?
===
Does anyone know how to access ALSA (low-level audio API) in Linux using Mono? | 0 | [
2,
184,
107,
42,
107,
493,
1229,
19,
4129,
60,
800,
3726,
3726,
630,
1276,
143,
184,
20,
1381,
493,
1229,
13,
5,
4121,
8,
3906,
4023,
21,
2159,
6,
19,
13024,
568,
4129,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Blackbox type data logging
===
In a Linux embedded application I'm developing, there is the need to record some events that happen from time to time. These records are saved on a MTD flash device and once written there is no need to change them or do efficient searches, but read access is required to show the data back to the user.
A big problem is that power can go away at any time, without a proper shutdown sequence.
The frequency these events occur can be very slow (days/weeks), but several of them will occur at once.
The data to be saved for each event is strongly typed: date, time, a couple of short text strings and several integers.
Currently I inherited a solution based on jffs2 and SQLite that is far from optimal because the DB file sometimes get corrupted. When this happens the whole file gets unreadable and there is no way to understand if it was caused by a bug in jffs2, or in SQLite or if the flash sector was bad, or if the power was cut at the wrong time.
Is there a library or a combination of filesystem/library that can better help me solve this kind of problem ? Or should I just use a text file with a CSV-like format ? | 0 | [
2,
319,
5309,
1001,
1054,
13,
13919,
800,
3726,
3726,
19,
21,
13024,
12138,
3010,
31,
22,
79,
3561,
15,
80,
25,
14,
376,
20,
571,
109,
963,
30,
2384,
37,
85,
20,
85,
9,
158,
742,
50,
4377,
27,
21,
8651,
43,
4433,
3646,
17,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to push a key and release it using C# ?
===
I am writing a C# program which captures signals from a external device, and sends keystrokes to another application. I am using SendKeys and it works fine.
SendKeys does "press" a key by holding and releasing it immediately. I would like to make it push key and release it at will.
My question is : "is there a way to send a "push" signal to a key, then a "release" signal after a certain amount of time ?"
I am not sure SendKeys is able to do this. Any clue ? | 0 | [
2,
184,
20,
3250,
21,
1246,
17,
830,
32,
568,
272,
5910,
13,
60,
800,
3726,
3726,
31,
589,
1174,
21,
272,
5910,
625,
56,
3683,
18,
7616,
37,
21,
4886,
3646,
15,
17,
11350,
1246,
12962,
18,
20,
226,
3010,
9,
31,
589,
568,
2660,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tracing versus Logging and how does log4net fit in?
===
I am wondering about what the difference between logging and tracing is.
Is the difference basically that tracing is more detailed log giving developers a tool to debug applications at runtime?
I have been experimenting with log4net and doing logging. Now I am wondering if I should be doing tracing as well and if I could/should use log4net for that purpose.
Should I be doing tracing with log4net and is there some trace level for log4net loggers?
Can you give a simple example on how I would do logging and tracing for a simple method? | 0 | [
2,
20005,
5706,
13,
13919,
17,
184,
630,
6738,
300,
2328,
2742,
19,
60,
800,
3726,
3726,
31,
589,
5712,
88,
98,
14,
2841,
128,
13,
13919,
17,
20005,
25,
9,
25,
14,
2841,
11374,
30,
20005,
25,
91,
6036,
6738,
1438,
10168,
21,
560... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the difference between an nanokernel and an exokernel?
===
I understand that they are both supposed to be small, but what are the key differences between the two? | 0 | [
2,
98,
25,
14,
2841,
128,
40,
10371,
2429,
7440,
17,
40,
16506,
2429,
7440,
60,
800,
3726,
3726,
31,
1369,
30,
59,
50,
156,
2293,
20,
44,
284,
15,
47,
98,
50,
14,
1246,
4921,
128,
14,
81,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What symmetric cypher to use for encrypting messages?
===
I haven't a clue about encryption at all. But I need it. How?
Say you have a system of nodes communicating with each other on a network via asynchronous messages. The nodes do not maintain session information about other nodes (this is a design restriction).
Say you want to make sure only your nodes can read the messages being sent. I believe encryption is the sollution to that.
Since the nodes are not maintaining a session and communication must work in a stateless, connectionless fashion, I am guessing that asymmetric encryption is ruled out.
So here is what I would like to do:
* messages are sent as UDP datagrams
* each message contains a timestamp to make messages differ (counter replay attacks)
* each message is encrypted with a shared secret symmetric key and sent over the network
* other end can decrypt with shared secret symmetric key
Keys can obviously be compromised by compromising any single node. At the same time, in this scenario, access to any single compromised node reveals all interesting information anyway, so the key is not the weakest link.
What cypher should I use for this encryption? What key length?
I would prefer to use something supported by [ezPyCrypto][1].
[1]: http://www.freenet.org.nz/ezPyCrypto/ | 0 | [
2,
98,
13,
16367,
18619,
1694,
20,
275,
26,
1957,
11435,
68,
7561,
60,
800,
3726,
3726,
31,
2933,
22,
38,
21,
8906,
88,
24420,
35,
65,
9,
47,
31,
376,
32,
9,
184,
60,
395,
42,
57,
21,
329,
16,
16272,
23284,
29,
206,
89,
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 I get the max data size of every column in an IQuerable using LINQ
===
I have a method that takes an IQueryable. Is there a LINQ query that will give me back the size of each column in the IQuerable? | 0 | [
2,
184,
107,
31,
164,
14,
2049,
1054,
1072,
16,
352,
4698,
19,
40,
31,
8190,
579,
568,
6294,
1251,
800,
3726,
3726,
31,
57,
21,
2109,
30,
1384,
40,
13,
5312,
622,
579,
9,
25,
80,
21,
6294,
1251,
25597,
30,
129,
590,
55,
97,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What load-balancing system do you use in production? What do you think of it?
===
There are a lot of different systems for balancing load and achieving redundancy in production servers (Not just web servers)
* Round-robin DNS
* Linux Virtual Server
* Cisco Local Director
* F5 BigIP
* Windows NLB
* etc?
If you use one of these (or another) in production, which one? How well does it work for you? Have you evaluated others? | 0 | [
2,
98,
6305,
8,
3817,
210,
6302,
329,
107,
42,
275,
19,
637,
60,
98,
107,
42,
277,
16,
32,
60,
800,
3726,
3726,
80,
50,
21,
865,
16,
421,
1242,
26,
16416,
6302,
6305,
17,
11784,
402,
8724,
10821,
19,
637,
17595,
13,
5,
1270,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I use BGGA closures prototype on standard Mac JDK6?
===
I am trying to use the BGGA closures prototype with an existing JDK 6 (standard on Mac OS X Leopard). I have tried the following, and none work:
1. Copied closures.jar to /System/Library/Frameworks/JavaVM.framework/Versions/1.6/Home/lib
2. Ran javac with -Xbootclasspath/a:/path/to/closures.jar
3. Tried from eclipse ganymede by defining my own system library and attaching it to my project with code utilizing BGGA.
In all three cases, I get compilation errors, indicating that the compiler did not pick up closures.jar on the bootstrap classpath. I'd really like to get this working from eclipse, or at the very least maven. Thanks! | 0 | [
2,
184,
107,
31,
275,
13,
19924,
1136,
7790,
18,
7063,
27,
1236,
1572,
487,
43,
197,
379,
60,
800,
3726,
3726,
31,
589,
749,
20,
275,
14,
13,
19924,
1136,
7790,
18,
7063,
29,
40,
3149,
487,
43,
197,
400,
13,
5,
15566,
27,
1572... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 DB design to use for collecting configurable demographic data?
===
I'm working on an application for a charitable student organization. The application will track participation and fund-raising for (primarily) student participants in an event. One of the things we'd like to do is collect some demographic information about students who register for the event from our enterprise directory to use in evaluating marketing and to construct reports for the administration on student participation by year, major, college, etc. One of the goals of the project is to market the application to similar organizations at other universities. I'm designing the app with a plugin architecture for authentication and directory access to make it more general.
So far I've come up with a couple of different ways to store demographic information in the database. I can assume that most universities will like to collect (and have sources of information for) similar demographic information. In this case I can keep appropriate parts of the demographic information (those things that change yearly) in columns in the registrations table and the rest in the participants table (those things that are constant for an individual). Alternatively, I've considered keeping a demographics table that holds a registration id, attribute, value triple for each registration and desired attribute. I think that the first option is much easier to query against for reports, whereas the second option is much more flexible.
I'm wondering if there are other alternatives that I haven't considered. Or, if you've faced a similar problem how did you handle it (and how satisfied were you with the result)? | 0 | [
2,
98,
13,
9007,
704,
20,
275,
26,
10079,
1065,
13549,
579,
14220,
1054,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
40,
3010,
26,
21,
11630,
1209,
1165,
9,
14,
3010,
129,
792,
5625,
17,
2780,
8,
22226,
26,
13,
5,
6944,
9408,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.NET Table Adapters: Get vs. Fill?
===
I always seem to use Get when working with data (strongly typed or otherwise) from the database and I have never really needed to use Fill although I just as easily could use Fill instead of get when pulling out and updating data.
Can anyone provide guidance as to the implications and gotchas of each method?
In what situations is it preferable to use one or the other?
Any performance implications?
Thanks in advance for the answers! I love this community! | 0 | [
2,
13,
9,
2328,
859,
9924,
445,
45,
164,
4611,
9,
3509,
60,
800,
3726,
3726,
31,
550,
2260,
20,
275,
164,
76,
638,
29,
1054,
13,
5,
15004,
102,
1001,
43,
54,
3190,
6,
37,
14,
6018,
17,
31,
57,
243,
510,
851,
20,
275,
3509,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 split a mult-line string into multiple lines?
===
I have a multi-line string literal that I want to do an operation on each line, like so.
inputString = """Line 1
Line 2
Line 3"""
I want to do something like the following.
for line in inputString:
doStuff() | 0 | [
2,
184,
107,
31,
2132,
21,
6633,
38,
8,
1143,
3724,
77,
1886,
1560,
60,
800,
3726,
3726,
31,
57,
21,
1889,
8,
1143,
3724,
20665,
30,
31,
259,
20,
107,
40,
1453,
27,
206,
293,
15,
101,
86,
9,
6367,
11130,
800,
13,
7,
7,
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... |
GetOpt library for C#
===
I'm looking for a getopt library for c#. So far I found a few ([phpguru][1], [XGetOptCS][2], [getoptfordotnet][3]) but these look more like unfinished attempts that only support a part of C's getopt.
Is there a full getopt c# implementation?
[1]: http://www.phpguru.org/static/getopt.html
[2]: http://69.10.233.10/KB/cs/XGetoptCS.aspx
[3]: http://www.codeproject.com/KB/cs/geoptfordotnet.aspx | 0 | [
2,
164,
2594,
38,
1248,
26,
272,
5910,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
164,
2594,
38,
1248,
26,
272,
5910,
9,
86,
463,
31,
216,
21,
310,
13,
5,
2558,
26120,
27222,
500,
2558,
165,
500,
15,
636,
396,
834,
3880,
6668,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Palm/Garnet OS Icon format?
===
I have googled around and not seen any info. What format and icon color depths are used for applications? | 0 | [
2,
3044,
118,
2063,
2328,
13,
759,
9801,
2595,
60,
800,
3726,
3726,
31,
57,
8144,
43,
140,
17,
52,
541,
186,
15404,
9,
98,
2595,
17,
9801,
1665,
11898,
50,
147,
26,
3767,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to deal with design-freaks?
===
A workmate of mine really loves designing for each and every use-case, no matter
how unlikely its occurrence will be or if it's even in the scope of the project.
As a result, some of us are having some kind of trouble weeding out unused
interfaces and finding out what data field of an interface is actually used.
Do You know similar cases and how to deal with those guys without demotivating them? | 0 | [
2,
184,
20,
1183,
29,
704,
8,
10185,
1378,
18,
60,
800,
3726,
3726,
21,
170,
5281,
16,
1114,
510,
9330,
15026,
26,
206,
17,
352,
275,
8,
10325,
15,
90,
1161,
184,
10387,
82,
12933,
129,
44,
54,
100,
32,
22,
18,
166,
19,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to ignore gcc compiler pedantic errors in external library headers?
===
I recently added -pedantic and -pedantic-errors to my make gcc compile options to help cleanup my cross platform code. All was fine until it finds errors in external included header files. Is there a way to turn off this error checking in external header files IE:
Keep checking for files included like this:
#include "myheader.h"
Stop checking for include files like this:
#include <externalheader.h>
Here are the errors I am getting:
g++ -Wall -Wextra -Wno-long-long -Wno-unused-parameter -pedantic --pedantic-errors
-O3 -D_FILE_OFFSET_BITS=64 -DMINGW -I"freetype/include" -I"jpeg" -I"lpng128" -I"zlib"
-I"mysql/include" -I"ffmpeg/libswscale" -I"ffmpeg/libavformat" -I"ffmpeg/libavcodec"
-I"ffmpeg/libavutil" -o omingwd/kguimovie.o -c kguimovie.cpp
In file included from ffmpeg/libavutil/avutil.h:41,
from ffmpeg/libavcodec/avcodec.h:30,
from kguimovie.cpp:44:
ffmpeg/libavutil/mathematics.h:32: error: comma at end of enumerator list
In file included from ffmpeg/libavcodec/avcodec.h:30,
from kguimovie.cpp:44:
ffmpeg/libavutil/avutil.h:110: error: comma at end of enumerator list
In file included from kguimovie.cpp:44:
ffmpeg/libavcodec/avcodec.h:277: error: comma at end of enumerator list
ffmpeg/libavcodec/avcodec.h:303: error: comma at end of enumerator list
ffmpeg/libavcodec/avcodec.h:334: error: comma at end of enumerator list
ffmpeg/libavcodec/avcodec.h:345: error: comma at end of enumerator list
ffmpeg/libavcodec/avcodec.h:2249: warning: `ImgReSampleContext' is deprecated
(declared at ffmpeg/libavcodec/avcodec.h:2243)
ffmpeg/libavcodec/avcodec.h:2259: warning: `ImgReSampleContext' is deprecated
(declared at ffmpeg/libavcodec/avcodec.h:2243)
In file included from kguimovie.cpp:45:
ffmpeg/libavformat/avformat.h:262: error: comma at end of enumerator list
In file included from ffmpeg/libavformat/rtsp.h:26,
from ffmpeg/libavformat/avformat.h:465,
from kguimovie.cpp:45:
ffmpeg/libavformat/rtspcodes.h:38: error: comma at end of enumerator list
In file included from ffmpeg/libavformat/avformat.h:465,
from kguimovie.cpp:45:
ffmpeg/libavformat/rtsp.h:32: error: comma at end of enumerator list
ffmpeg/libavformat/rtsp.h:69: error: comma at end of enumerator list
| 0 | [
2,
184,
20,
7174,
489,
3384,
21486,
12855,
210,
1786,
11908,
19,
4886,
1248,
157,
445,
60,
800,
3726,
3726,
31,
1989,
905,
13,
8,
3631,
210,
1786,
17,
13,
8,
3631,
210,
1786,
8,
29992,
18,
20,
51,
233,
489,
3384,
26561,
6368,
20... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What (pure) Python library to use for AES 256 encryption?
===
I am looking for a (preferably pure) python library to do AES 256 encription and decryption.
This library should support the CBC cipher mode and use PKCS7 padding [according to the answer to an earlier question of mine][1].
The library should at least work on Mac OS X (10.4) and Windows XP. Ideally just by dropping it into the source directory of my project. I have seen [this by Josh Davis][2], but am not sure about how good it is and if it does the required CBC cipher mode... Scanning the source suggests it doesn't
[1]: http://stackoverflow.com/questions/172392/what-symmetric-cypher-to-use-for-encrypting-messages
[2]: http://www.josh-davis.org/pythonAES | 0 | [
2,
98,
13,
5,
21059,
6,
20059,
1248,
20,
275,
26,
21,
160,
13,
16910,
24420,
60,
800,
3726,
3726,
31,
589,
699,
26,
21,
13,
5,
3515,
2407,
4801,
4267,
6,
20059,
1248,
20,
107,
21,
160,
13,
16910,
1957,
28215,
3309,
17,
121,
11... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Asp.net Project Ideas?
===
I've recently decided to step-up my knowledge in ASP.NET (I haven't coded in ASP.NET for about 2 years or so, and much has changed since then).
I want to work with the new MVC framework, try jQuery, LINQ to SQL and basically just to catch up with most of the up-to-date features.
To do that, I want to start a nice project in ASP.NET, a serious web application from scratch with the MVC framework.
My only problem is.. what should I build? I hate to code stuff that already exist on the web and I just want to make some nice web application (If it's something useful I might publish it like stuff such as Stackoverflow.com ;) or just share its source.
Any thoughts? | 0 | [
2,
28,
306,
9,
2328,
669,
3478,
60,
800,
3726,
3726,
31,
22,
195,
1989,
868,
20,
1424,
8,
576,
51,
1918,
19,
28,
306,
9,
2328,
13,
5,
49,
2933,
22,
38,
13,
22254,
19,
28,
306,
9,
2328,
26,
88,
172,
122,
54,
86,
15,
17,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
So - which exciting algorithms have you "discovered" recently?
===
I like to read about new and clever algorithms. And I like to think out of the box, so all kinds of algorithms from all fields of computation are welcome.
From time to time I read research papers to keep up with the current research and expand my horizon. I also like to learn new tricks. Unfortunately I tend to concentrate only on my field of interest, so I miss a lot of usefull stuff.
Let's just not post mainstream things. Instead write about something special that made you think: "Wow - now *that's* a clever solution!".
| 0 | [
2,
86,
13,
8,
56,
12028,
15935,
57,
42,
13,
7,
28682,
7,
1989,
60,
800,
3726,
3726,
31,
101,
20,
1302,
88,
78,
17,
11994,
15935,
9,
17,
31,
101,
20,
277,
70,
16,
14,
1649,
15,
86,
65,
8623,
16,
15935,
37,
65,
2861,
16,
216... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 track third-party sources with ClearCase without a headache?
===
First of al: I am not an experienced ClearCase user, but I have lots of experience with other VCS and *nix command-line tools. I use command-line tool ("cleartool")
I have a small set of sources stored in the ClearCase. Once in a while a fresh .tgz with the same sources comes in. Now I do the following:
1. Extract tgz into, say, "~/new_src"
2. "ct setview ..." and cd to the place where the sources are (say, "/vobs/src")
3. I compare the sources with "diff -Naurb . ~/new_src", examine diff's output and:
1. Copy new files to the /vobs/src and do "cleartool mkelem" on them
2. Checkout changed files, copy new sources over and commit them
3. Do "cleartool mkdir" for new dirs and populate them
This process is slowly driving me crazy since in almost any other version control system I would just checkout the sources, copy new sources over, examine diffs, add new files and then commit the whole lot. Or, better yet, use tags/branches, though they are really not needed in this case - I need to have an up-to-date version of the sources in the repo, that's all.
I tried to checkout everything (using "cleartool co -nc `find .`"), copy new sources over, and commit changed files/add new files afterward. But this requires parsing of the "cleartool ls" output and is even messier.
I could miss something obvious, but several forays into Google tell me that I'm not. However, I'd like to hear it from ClearCase powerusers - is there any hope for clueless like me or not? :)
| 0 | [
2,
184,
20,
792,
422,
8,
9635,
2662,
29,
1207,
10325,
366,
21,
14276,
60,
800,
3726,
3726,
64,
16,
493,
45,
31,
589,
52,
40,
3882,
1207,
10325,
4155,
15,
47,
31,
57,
7503,
16,
1496,
29,
89,
13,
8990,
18,
17,
1637,
14064,
1202,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Populate a form with data from an associative array with jQuery
===
Last time I asked about the reverse process, and got some very efficient answers. I'm aiming for least lines of code here. I have a form of fields and associative array in the {fieldname:data} format, I want to populate a coresponding form with it. | 0 | [
2,
1675,
12383,
21,
505,
29,
1054,
37,
40,
28,
18,
16325,
3366,
7718,
29,
487,
8190,
93,
800,
3726,
3726,
236,
85,
31,
411,
88,
14,
7006,
953,
15,
17,
330,
109,
253,
8243,
6709,
9,
31,
22,
79,
15442,
26,
639,
1560,
16,
1797,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Cursors...Any use cases you would defend?
===
I'll go first.
I'm 100% in the set-operations camp. But what happens when the set logic
on the entire desired input domain leads to a such a large retrieval that the query slows down significantly, comes to a crawl, or basically takes infinite time?
That's one case where I'll use a itty-bitty cursor (or a while loop) of perhaps most dozens of rows (as opposed to the millions I'm targeting). Thus, I'm still working in (partitioned sub) sets, but my retrieval runs faster.
Of course, an even faster solution would be to call the partioned input domains in parallel from outside, but that introduces an interaction will an external system, and when "good enough" speed can be achieved by looping in serial, just may not be worth it (epecially during development).
| 0 | [
2,
4444,
255,
29588,
18,
9,
9,
9,
6001,
275,
1871,
42,
83,
5589,
60,
800,
3726,
3726,
31,
22,
211,
162,
64,
9,
31,
22,
79,
12849,
19,
14,
309,
8,
11377,
18,
1232,
9,
47,
98,
5531,
76,
14,
309,
7085,
27,
14,
1078,
9264,
636... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ignore folders/files when Directory.GetFiles() is denied access
===
I am trying to display a list of all files found in the selected directory (and optionally any subdirectories). The problem I am having is that when the GetFiles() method comes across a folder that it cannot access, it throws and exception and the process stops.
How do I ignore this exception (and ignore the protected folder/file) and continue adding accessible files to the list?
try
{
if (cbSubFolders.Checked == false)
{
string[] files = Directory.GetFiles(folderBrowserDialog1.SelectedPath);
foreach (string fileName in files)
ProcessFile(fileName);
}
else
{
string[] files = Directory.GetFiles(folderBrowserDialog1.SelectedPath, "*.*", SearchOption.AllDirectories);
foreach (string fileName in files)
ProcessFile(fileName);
}
lblNumberOfFilesDisplay.Enabled = true;
}
catch (UnauthorizedAccessException)
{}
finally {} | 0 | [
2,
7174,
19294,
18,
118,
16877,
18,
76,
16755,
9,
3060,
16877,
18,
5,
6,
25,
5265,
1381,
800,
3726,
3726,
31,
589,
749,
20,
3042,
21,
968,
16,
65,
6488,
216,
19,
14,
1704,
16755,
13,
5,
290,
12832,
102,
186,
972,
10197,
1596,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to use CMFCListCtrl with CListView?
===
I'd like to use the new <b>CMFCListCtrl</b> features with my <b>CListView</b> class (and, of course, the new CMFCHeaderCtrl inside it). Unfortunately, you can't use <i>Attach()</i> or <i>SubclassWindow()</i> because the SysListView32 window is already associated with a CListView object.
Do I have to override CListView's <i>OnCmdMsg()</i> and route all messages to my own instance of CMFCListCtrl? (Will that even work?) Or is there an easier/cleaner solution? | 0 | [
2,
184,
20,
275,
2390,
7061,
5739,
4812,
6362,
29,
272,
5739,
4725,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
275,
14,
78,
13,
1,
220,
1,
9095,
7061,
5739,
4812,
6362,
1,
118,
220,
1,
967,
29,
51,
13,
1,
220,
1,
150,
5739,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where to create temp files when access to /tmp/ is denied?
===
I wrote a short bash script to complete a task that involves creating a temporary directory and storing various files in it and performing various operations on it.
In my first pass I just created the temp dir at /tmp/$$.$script", but then I tested the script on a computer where I didn't have write access to /tmp/, and I'd like to take that case into account. So my question is where's a good secondary location for this temp dir? Should I just use the current directory? The home directory? ~/tmp/? The output location of the script?
All created files do get cleaned up on script exit.
| 0 | [
2,
113,
20,
1600,
13,
9577,
6488,
76,
1381,
20,
13,
118,
38,
2554,
118,
25,
5265,
60,
800,
3726,
3726,
31,
738,
21,
502,
13158,
3884,
20,
1279,
21,
3005,
30,
6569,
2936,
21,
4700,
16755,
17,
25615,
617,
6488,
19,
32,
17,
2955,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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: Serializing Array of own Objects
===
i have an Array of Objects of my class:
<pre><code>
public class Message implements Serializable{
static final long serialVersionUID = -1L;
private String receiver; //Empfänger
private String sender; //Absender
private String Betreff;
private String content;
private String timestamp;
...} </pre></code>
I am able to safe it with an Object*Stream but if i read it I get an error:"at sotring.storeing.functioname".
Who can help me?
Thanks | 0 | [
2,
8247,
45,
5956,
3335,
7718,
16,
258,
3916,
800,
3726,
3726,
31,
57,
40,
7718,
16,
3916,
16,
51,
718,
45,
13,
1,
3515,
1,
9375,
1,
317,
718,
2802,
8713,
18,
5956,
3186,
579,
1,
12038,
426,
175,
5956,
10898,
5661,
43,
800,
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... |
Most efficient way to index a returned array?
===
function returnsAnArray ()
{
return array ('test');
}
echo returnsAnArray ()[0];
generates a syntax error in PHP. What's the most efficient way to directly obtain an element from a returned array without assigning the result to a temp variable? | 0 | [
2,
127,
8243,
161,
20,
4348,
21,
587,
7718,
60,
800,
3726,
3726,
1990,
4815,
210,
8576,
93,
13,
5,
6,
13,
1,
788,
7718,
13,
5,
22,
10543,
22,
6,
73,
13,
1,
8117,
4815,
210,
8576,
93,
13,
5,
6,
2558,
387,
12660,
7920,
18,
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... |
Any "Computer Language" magazine archive around?
===
Someone might remember the old magazine "Computer Language" published until the 90s from the same editor of "Doctor Dobb's Journal".
I've always found it very ispirational and I still have some issue in my bookshelf.
Does anyone know if there's an archive of the old articles somewhere? I remember there was a CD with several issues digitized but I've found no mention of it on the CMP website. | 0 | [
2,
186,
13,
7,
18448,
816,
7,
1039,
9250,
140,
60,
800,
3726,
3726,
737,
530,
1518,
14,
315,
1039,
13,
7,
18448,
816,
7,
467,
163,
14,
3151,
18,
37,
14,
205,
1835,
16,
13,
7,
19621,
107,
3490,
22,
18,
1680,
7,
9,
31,
22,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a better Java implementation of SSH2 than JSch?
===
I've been using [JSch][1] for a couple of weeks now. It seems to *work* okay, but its API is a little bit cumbersome. I'm also a little off put by its total lack of documentation (not even javadoc style comments). Has anyone used a good Java SSH2 library that they'd recommend. I'm particularly interested in SCP file transfer and issuing commands to a remote Linux box programmatically via the SSH protocol.
[1]: http://www.jcraft.com/jsch/ | 0 | [
2,
25,
80,
21,
574,
8247,
6123,
16,
13,
18,
1635,
135,
119,
487,
2992,
60,
800,
3726,
3726,
31,
22,
195,
74,
568,
636,
728,
2992,
500,
2558,
165,
500,
26,
21,
1335,
16,
1342,
130,
9,
32,
2206,
20,
1637,
3783,
2483,
1705,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the difference between g++ and gcc?
===
What is the difference between g++ and gcc? Which ones should be used for general c++ development? | 0 | [
2,
98,
25,
14,
2841,
128,
489,
20512,
17,
489,
3384,
60,
800,
3726,
3726,
98,
25,
14,
2841,
128,
489,
20512,
17,
489,
3384,
60,
56,
53,
18,
378,
44,
147,
26,
297,
272,
20512,
522,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to discover the type of media inserted in a DVD/CD drive? (java)
===
When I insert a DVD or CD, I want to problematically know what type of media(DVD or CD) is it. | 0 | [
2,
184,
20,
6297,
14,
1001,
16,
941,
14215,
19,
21,
3527,
118,
6324,
1493,
60,
13,
5,
1004,
1385,
6,
800,
3726,
3726,
76,
31,
14692,
21,
3527,
54,
1745,
15,
31,
259,
20,
21070,
1326,
143,
98,
1001,
16,
941,
5,
20318,
54,
1745,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Internal typing with C# generics
===
When I try this with a generic class where this.value is T:
if (this.value.GetType() == typeof(int))
{
((int)this.value)++;
}
else
{
throw new InvalidOperationException("T must be an int to perform this operation");
}
I get a compile-time error: "Cannot convert type 'T' to 'int'"
What should I do to perform an integral operation on this.value when it's an int?
| 0 | [
2,
3117,
25266,
29,
272,
5910,
12733,
18,
800,
3726,
3726,
76,
31,
1131,
48,
29,
21,
12733,
718,
113,
48,
9,
15165,
25,
13,
38,
45,
100,
13,
5,
1565,
9,
15165,
9,
3060,
4474,
5,
6,
800,
3726,
1001,
1041,
5,
6391,
6,
6,
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... |
On OS X is Objective-C / Cocoa native or byte-code?
===
On OS X is Objective-C / Cocoa native or byte-code?
Can objective-c programs be compiled on linux? | 0 | [
2,
27,
13,
759,
993,
25,
7038,
8,
150,
13,
118,
24507,
1275,
54,
34,
591,
8,
9375,
60,
800,
3726,
3726,
27,
13,
759,
993,
25,
7038,
8,
150,
13,
118,
24507,
1275,
54,
34,
591,
8,
9375,
60,
92,
7038,
8,
150,
1726,
44,
9316,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
A platform for easy creation of custom websites?
===
I'm in a small business of hosting my clients' websites, and a lot of times they ask me to create one from scratch. I'm no designer, but I can code CSS/HTML, AJAX, PHP. However, I'm *not* willing to create sites from scratch, knowing how much is involved.
In the past, I've tried using design templates, but they proved to be inefficient - customers would request changes and I'd be unable to assist them, since I didn't write the template. Customers themselves would not be able to make changes.
So, the question is: **Is there web-based software that allows for easy creation of custom websites, with skins/layouts/templates? It should allow non-technical person to add content and make basic modifications.** I've seen a few websites use [Wordpress][1] for that purpose, but don't know if it's a good choice.
[1]: http://codex.wordpress.org/Getting_Started_with_WordPress | 0 | [
2,
21,
2452,
26,
2010,
2502,
16,
5816,
13931,
60,
800,
3726,
3726,
31,
22,
79,
19,
21,
284,
508,
16,
10637,
51,
7421,
22,
13931,
15,
17,
21,
865,
16,
436,
59,
1349,
55,
20,
1600,
53,
37,
12395,
9,
31,
22,
79,
90,
4742,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I store an XML value in my .NET App.Config file
===
I am trying to store an xml value in my app.config file.
The app.config does not like this and I cannot use the `<![CDATA[` construct ignore the XML'ness of my value.
Is there a way to do it?
Value example:`<FieldRef Name='LinkfileName' Nullable='True'/><FieldRef Name='Web' Nullable='True'/>` | 0 | [
2,
184,
107,
31,
1718,
40,
23504,
1923,
19,
51,
13,
9,
2328,
4865,
9,
14093,
2816,
3893,
800,
3726,
3726,
31,
589,
749,
20,
1718,
40,
23504,
1923,
19,
51,
4865,
9,
14093,
2816,
3893,
9,
14,
4865,
9,
14093,
2816,
630,
52,
101,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there an agreed ideal schema for tagging
===
I have a photo website and i want to support tags as my original category bucketing is starting to fail (some pictures are family and vacations, or school and friends). Is there an agreed tagging db schema?
I still want to support having photos as part of an album.
Right now i have a few tables:
**Photos**
<li>PhotoID
<li>PhotoAlbumID
<li>Caption
<li>Date
**Photo Album**
<li>AlbumID
<li>AlbumName
<li>AlbumDate
| 0 | [
2,
25,
80,
40,
1771,
5628,
23874,
26,
3383,
2762,
800,
3726,
3726,
31,
57,
21,
3056,
2271,
17,
31,
259,
20,
555,
3383,
18,
28,
51,
501,
3230,
12433,
68,
25,
1422,
20,
7476,
13,
5,
3220,
3104,
50,
190,
17,
10057,
18,
15,
54,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Design Tab Control with Visual Studio 2008 (without SP1)
===
Is there **any** way (maybe directly editing resource files) to configure a Tab Control (add/remove tabs and their captions and contents) at **design time** with Visual Studio 2008 without SP1 (I heard that SP1 has such feature)?
P.S.: I use c++ with wtl | 0 | [
2,
704,
6523,
569,
29,
3458,
1120,
570,
13,
5,
14506,
3782,
165,
6,
800,
3726,
3726,
25,
80,
13,
1409,
6001,
1409,
161,
13,
5,
5138,
1703,
9510,
6577,
6488,
6,
20,
1065,
15951,
21,
6523,
569,
13,
5,
14854,
118,
99,
16598,
6523,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Operator Overloading with C# Extension Methods
===
I'm attempting to use extension methods to add an operater overload to the C# StringBuilder class. Specifically, given StringBuilder sb, I'd like sb += "text" to become equivalent to sb.Append("text");
Here's the syntax for creating an extension method for StringBuilder:
public static class sbExtensions
{
public static StringBuilder blah(this StringBuilder sb)
{
return sb;
}
}
It successfully adds the "blah" extension method to the StringBuilder.
Unfortunately, operator overloading does not seem to work:
public static class sbExtensions
{
public static StringBuilder operator +(this StringBuilder sb, string s)
{
return sb.Append(s);
}
}
Among other issues, the keyword 'this' is not allowed in this context.
Are adding operator overloads via extension methods possible? If so, what's the proper way to go about it? | 0 | [
2,
6022,
84,
16866,
29,
272,
5910,
3896,
3195,
800,
3726,
3726,
31,
22,
79,
6314,
20,
275,
3896,
3195,
20,
3547,
40,
4055,
139,
84,
8294,
20,
14,
272,
5910,
3724,
20904,
718,
9,
3524,
15,
504,
3724,
20904,
13,
18,
220,
15,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Creating a News Ticker which is updated from an RSS Feed
===
I need to create a news ticker that is updated via an RSS feed. Any ideas on how to implement this?
I would prefer Javascript but any language is acceptable. | 0 | [
2,
2936,
21,
996,
8809,
106,
56,
25,
6372,
37,
40,
13,
1224,
18,
4063,
800,
3726,
3726,
31,
376,
20,
1600,
21,
996,
8809,
106,
30,
25,
6372,
1197,
40,
13,
1224,
18,
4063,
9,
186,
3478,
27,
184,
20,
8713,
48,
60,
31,
83,
6369... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
WCF DataContracts
===
I have a WCF service hosted for internal clients - we have control of all the clients. We will therefore be using a data contracts library to negate the need for proxy generation. I would like to use some readonly properties and have some datacontracts without default constructors. (I realize that the DataContractSerializer does not allow this, but what about other serializers, like the old BinarySerializer? Will WCF use this one like remoting did? )
Thanks for your help... | 0 | [
2,
11801,
410,
1054,
23311,
18,
800,
3726,
3726,
31,
57,
21,
11801,
410,
365,
2812,
26,
3117,
7421,
13,
8,
95,
57,
569,
16,
65,
14,
7421,
9,
95,
129,
1793,
44,
568,
21,
1054,
8712,
1248,
20,
2836,
3322,
14,
376,
26,
27188,
278... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Getting quickly up to speed on ASP.NET for an experience coder
===
I have a contract in the offering from a client to develop an intranet application for capturing/manipulating/displaying a fairly complex set of marketing data. I've done this sort of thing before so the analysis, database etc. holds no issues for me, but the client would most likely prefer ASP.NET as they have some (small) amount of experience with this.
My current default language for web apps is PHP, although I have coded some ASP some time ago. I've been coding for 20 years and have a stack of languages and technologies under my belt - including Perl, Java, VB, Delphi and C - so learning a new one environment doesn't worry me, but nevertheless I'd like to get up to speed with the least effort and as quickly as possible.
What books, websites or other resources would you recommend to most efficiently achieve this?
| 0 | [
2,
1017,
976,
71,
20,
1362,
27,
28,
306,
9,
2328,
26,
40,
1496,
1797,
139,
800,
3726,
3726,
31,
57,
21,
1305,
19,
14,
4090,
37,
21,
6819,
20,
2803,
40,
14369,
2328,
3010,
26,
12859,
118,
177,
4307,
10038,
118,
2906,
10630,
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 to tell if the user's using 24 hour time using Cocoa
===
I'm trying to determine if the user is using 24 hour or 12 hour time, and there doesn't seem to be a good way to figure this out other than creating an NSDateFormatter and searching the format string for the period field ('a' character)
Here's what I'm doing now:
NSDateFormatter *formatter = [[NSDateFormatter alloc] init];
[formatter setTimeStyle:NSDateFormatterShortStyle];
NSRange range = [[formatter dateFormat] rangeOfString:@"a"];
BOOL is24HourFormat = range.location == NSNotFound && range.length == 0;
[formatter release];
Which works, but feels kinda fragile. There has to be a better way, right?
| 0 | [
2,
184,
20,
494,
100,
14,
4155,
22,
18,
568,
937,
1671,
85,
568,
24507,
800,
3726,
3726,
31,
22,
79,
749,
20,
3746,
100,
14,
4155,
25,
568,
937,
1671,
54,
390,
1671,
85,
15,
17,
80,
1437,
22,
38,
2260,
20,
44,
21,
254,
161,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In a project, is there a choice of database systems?
===
In almost all projects, the choice of the database system is 'almost' automatic .. if you're coding "in the Microsoft stack" you'll go with SQLServer, in the Linux world the default is MySQL, and for corporate in-house project most shops have decided on some default like Oracle or IBM DB2.
What are your thoughts? | 0 | [
2,
19,
21,
669,
15,
25,
80,
21,
1837,
16,
6018,
1242,
60,
800,
3726,
3726,
19,
557,
65,
2314,
15,
14,
1837,
16,
14,
6018,
329,
25,
13,
22,
18135,
22,
6715,
13,
9,
9,
100,
42,
22,
99,
13,
15458,
13,
7,
108,
14,
7099,
7566,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Calculating time diff across midnight
===
This is the one thing I could never get to work.
Imagine you want to calculate a pay rate but it has to span across midnight.
It also applies to calculating time to run on timed system, or time diff it should've run. | 0 | [
2,
22937,
85,
20811,
464,
6373,
800,
3726,
3726,
48,
25,
14,
53,
584,
31,
110,
243,
164,
20,
170,
9,
4382,
42,
259,
20,
18469,
21,
1372,
1684,
47,
32,
63,
20,
6289,
464,
6373,
9,
32,
67,
13169,
20,
22937,
85,
20,
485,
27,
85... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... |
Speeding Up Python
===
This is really two questions, but they are so similar, and to keep it simple, I figured I'd just role them together:
- **Firstly**: Given an established python project, what are some decent ways to speed it up beyond just plain in-code optimization?
- **Secondly**: When writing a program from scratch in python, what are some good ways to greatly improve performance?
For the first question, imagine you are handed a decently written project and you need to improve performance, but you can't seem to get much of a gain through refactoring/optimization. What would you do to speed it up in this case short of rewriting it in something like C?
| 0 | [
2,
1362,
68,
71,
20059,
800,
3726,
3726,
48,
25,
510,
81,
2346,
15,
47,
59,
50,
86,
835,
15,
17,
20,
643,
32,
1935,
15,
31,
5700,
31,
22,
43,
114,
597,
105,
429,
45,
13,
8,
13,
1409,
3552,
102,
1409,
45,
504,
40,
613,
2005... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Create/Use User-defined functions in System.Data.SQLite?
===
> User-Defined Functions & Collating Sequences
Full support for user-defined functions and collating sequences means that in many cases if SQLite doesn't have a feature, you can write it yourself in your favorite .NET language. Writing UDF's and collating sequences has never been easier
I spotted this bit on the C# [SQLite ADO.NET][1] provider l found here, and was having problems understanding the documentation on how to implement/use user-defined functions.
Could anyone explain how to, or provide any working examples for this lost newbie?
[1]: http://sqlite.phxsoftware.com/ "SQLite ADO wrapper" | 0 | [
2,
1600,
118,
3699,
4155,
8,
13439,
3719,
19,
329,
9,
18768,
9,
18,
1251,
10601,
60,
800,
3726,
3726,
13,
1,
4155,
8,
13439,
3719,
279,
9470,
1880,
11173,
503,
555,
26,
4155,
8,
13439,
3719,
17,
9470,
1880,
11173,
1108,
30,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
DES tutorial
===
I am studying for cryptography and I somehow stuck on understanding how DES works. Because it is around for a long time there should be nice tutorials like fancy diagrams, videos etc around the net. I searched but with no luck. Has anyone spotted anything "easy-to-digest" for the brain? | 0 | [
2,
1746,
29724,
800,
3726,
3726,
31,
589,
4493,
26,
16277,
15438,
17,
31,
3625,
4549,
27,
3260,
184,
1746,
693,
9,
185,
32,
25,
140,
26,
21,
175,
85,
80,
378,
44,
2210,
29724,
18,
101,
12251,
14161,
18,
15,
6610,
2722,
140,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Play a single note with DirectMusic
===
I'm using DirectMusic for MIDI playback in an application I'm developing. Does anyone know if it's possible to use DirectMusic to play individual notes? Currently, I'm converting an in-memory data structure that represents entire 'songs' into a MIDI buffer and playing it back through DirectMusic. I'd like to be able to play individual notes without having to generate a MIDI buffer for it, loading it and playing it. Is this type of thing even possible with DirectMusic?
This is my first excursion into the world of DirectMusic so hopefully I'm not too uninformed of it's capabilities... | 0 | [
2,
418,
21,
345,
1945,
29,
1744,
7692,
800,
3726,
3726,
31,
22,
79,
568,
1744,
7692,
26,
907,
49,
21306,
19,
40,
3010,
31,
22,
79,
3561,
9,
630,
1276,
143,
100,
32,
22,
18,
938,
20,
275,
1744,
7692,
20,
418,
1359,
2434,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to show fullscreen popup window in javascript?
===
Is there a way to make a popup window maximised as soon as it is opened? If not that, at least make it screen-sized? This:
window.open(src, fullscreen="yes")
apparently only worked for old version of IE. | 0 | [
2,
184,
20,
298,
503,
7187,
1675,
576,
1463,
19,
8247,
8741,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
233,
21,
1675,
576,
1463,
10584,
2541,
28,
651,
28,
32,
25,
520,
60,
100,
52,
30,
15,
35,
639,
233,
32,
2324,
8,
6560,
60... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XML DOM vs ADO DataSet
===
I have the option of storing data in memory either as an XML document or multi-table ADO dataset. The web page utilizing this object will be selectively retrieving data items based on keys.
Does either of these objects have a clear performance advantage over the other?
| 0 | [
2,
23504,
11859,
4611,
21,
537,
1054,
3554,
800,
3726,
3726,
31,
57,
14,
4255,
16,
25615,
1054,
19,
1912,
694,
28,
40,
23504,
4492,
54,
1889,
8,
5924,
21,
537,
1054,
3554,
9,
14,
2741,
2478,
19894,
48,
3095,
129,
44,
14092,
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... |
Embedding JavaScript engine into .NET (C#)
===
just wondering if anyone has ever tried embedding and actually integrating any js engine into the .net environment. I could find and actually use (after a **LOT** of pain and effort, since it's pretty outdated and not quite finished) spidermonkey-dotnet project. Anyone with experience in this area? Engines like SquirrelFish, V8..
Not that I'm not satisfied with Mozilla's Spidermonkey (using it for Rails-like miniframework for custom components inside the core ASP.NET application), but I'd still love to explore a bit further with the options. The command-line solutions are not what I'd need, I cannot rely on anything else than CLR, I need to call methods from/to JavaScript/C# objects.
// c# class
public class A
{
public string Hello(string msg)
{
return msg + " whatewer";
}
}
// js snippet
var a = new A();
console.log(a.Hello('Call me')); // i have a console.log implemented, don't worry, it's not a client-side code :)
Just to clarify - I'm not trying to actually program **the application itself** in server-side javascript. It's used solely for writing custom user subapplications (can be seen as some sort of DSL). It's much easier (and safer) to allow normal people programming in js than C#. | 0 | [
2,
11911,
69,
3258,
8247,
8741,
1406,
77,
13,
9,
2328,
13,
5,
150,
5910,
6,
800,
3726,
3726,
114,
5712,
100,
1276,
63,
462,
794,
11911,
69,
3258,
17,
1121,
24529,
186,
487,
18,
1406,
77,
14,
13,
9,
2328,
2307,
9,
31,
110,
477,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MVC Frameworks for Windows Mobile Native Code
===
Are there any good MVC frameworks for native windows mobile code? | 0 | [
2,
307,
8990,
6596,
18,
26,
1936,
3241,
1275,
1797,
800,
3726,
3726,
50,
80,
186,
254,
307,
8990,
6596,
18,
26,
1275,
1936,
3241,
1797,
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... | [
1,
1,
1,
1,
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... |
Combined post-operators?
===
We're all familiar with the pre- and post-increment operators, e.g.
c++; // c = c + 1
++c; // ditto
and the "combined operators" which extend this principle:
c += 5; // c = c + 5
s .= ", world"; // s = s . ", world"; e.g. PHP
I've often had a need for a 'post-combined operator', which would allow:
s =. "Hello "; // s = "Hello " . s
Obviously, this is only really useful with non-commutable operators and the meaning is altered from pre-/post-increment, even though the syntax is borrowed.
Are you aware of any language that offers such an operator, and why isn't it more common? | 0 | [
2,
2461,
678,
8,
9477,
9922,
60,
800,
3726,
3726,
95,
22,
99,
65,
3694,
29,
14,
782,
8,
17,
678,
8,
28461,
9475,
15,
13,
62,
9,
263,
9,
272,
20512,
73,
12894,
272,
800,
272,
2754,
137,
13,
20512,
150,
73,
12894,
28958,
111,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subversion large repos import/checkout
===
My normal work flow to create a new repository with subversion is to create a new repos, do a checkout of the repos root, create my branches tags and trunk folders and place in the trunk my initial files. Then I do a commit of this "initial import", delete the checked out repos from my hard drive and do a checkout of the trunk. Then I can start working.
However, when dealing with a large import, think hundreds of megs, and off-site version control hosting (http based) this initial import can take quite a while to commit. What's worse, after committing I need to checkout this massive trunk all over again.
Is there a way with subversion to use the local copy of the trunk without doing a checkout all over again of data that is already there?
| 0 | [
2,
972,
10898,
370,
302,
12551,
9010,
118,
12542,
1320,
800,
3726,
3726,
51,
1826,
170,
3312,
20,
1600,
21,
78,
24869,
29,
972,
10898,
25,
20,
1600,
21,
78,
302,
12551,
15,
107,
21,
2631,
1320,
16,
14,
302,
12551,
5900,
15,
1600,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.