unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Ultra-Portable Laptop or Tablet Pcs for Development and Sketching
===
I am a software developer that primarily writes in PHP, [X]HTML, CSS, Javascript, C# and C++. I use Eclipse for web development, Visual Studio 2008 for C++ and C# work, TortoiseSVN, Subversion server for local repositories, SQL Server Express, Apache and MYSQL. I also use Office 2007 for word processing and spreadsheets and use Vista Ultimate 64 as my primary operating system. The only other things I do on my laptop are watch movies, surf the internet and listen to music.
I currently have a Acer Aspire 5100 (1.4 GHz AMD Turion X2, 2 GB of RAM and a 15.4" screen). This thing does not cut it in performance or portability, and in addition, my DVD drive failed. And before anybody posts about vista: I have had XP Professional 32 on it for the last two years, and recently upgraded to Vista 64. It is actually faster (with areo disabled) then XP; so it is not the OS that is causing the laptop to be slow.
I usually sketch a lot, for explaining things, developing user interfaces and software architecture.
Because of my requirements, I was thinking about a Lenovo X61 Tablet PC. It outperforms my current laptop, is significantly more portable, and... is a tablet.
My question is: do any other software developers use this (or other tablets) for programming? Does it help to be able to sketch on the computer itself? And is it capable of being a good development machine? Will it handle the above software listed?
If not, what is the best ultra-portable laptop that is good for programming? Or are ultra-portable laptops even good for programming? I could manage with my 15.4" screen, but am spoiled by my two 19" at my home desktop and my job's workstation. | 0 | [
2,
6885,
8,
1993,
579,
12294,
54,
16394,
5168,
18,
26,
522,
17,
8998,
68,
800,
3726,
3726,
31,
589,
21,
2306,
10058,
30,
2257,
6215,
19,
13,
26120,
15,
636,
396,
500,
15895,
15,
272,
18,
18,
15,
8247,
8741,
15,
272,
5910,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How often to commit changes to source control ?
===
How often should I commit changes to source control ? After every small feature, or only for large features ?
I'm working on a project and have a long-term feature to implement. Currently, I'm committing after every chunk of work, i.e. every sub-feature implemented and bug fixed. I even commit after I've added a new chunk of tests for some feature after discovering a bug.
However, I'm concerned about this pattern. In a productive day of work I might make 10 commits. Given that I'm using Subversion, these commits affect the whole repository, so I wonder if it indeed is a good practice to make so many ?
| 0 | [
2,
184,
478,
20,
9686,
1693,
20,
1267,
569,
13,
60,
800,
3726,
3726,
184,
478,
378,
31,
9686,
1693,
20,
1267,
569,
13,
60,
75,
352,
284,
1580,
15,
54,
104,
26,
370,
967,
13,
60,
31,
22,
79,
638,
27,
21,
669,
17,
57,
21,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is QuickSilver dead?
===
After having read that QuickSilver was no longer supported by BlackTree and has since gone open source, I noticed more and more people switching to/suggesting other app launchers i.e. Buttler and LaunchBar.
Is QuickSilver still relevant? Has anyone experienced any instability since it's gone open source?
| 0 | [
2,
25,
2231,
16782,
828,
60,
800,
3726,
3726,
75,
452,
1302,
30,
2231,
16782,
23,
90,
1045,
1827,
34,
319,
8101,
17,
63,
179,
1042,
368,
1267,
15,
31,
2711,
91,
17,
91,
148,
13027,
20,
118,
18,
21606,
1430,
68,
89,
4865,
19755,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 optimal way to organize shared .net assemblies in SVN?
===
We are starting a new SOA project with a lot of shared .net assemblies that will be stored in SVN.
In development phase, we would like to be able to work on these assemblies as an entire solution with as little SVN 'friction' as possible.
When the project enters more of a maintenance mode, the assemblies will be maintained on an individual level.
Without making Branching, Tagging, and Automated Builds a maintenance nightmare, what's the best way to organize these libraries in SVN that also works well with the VS 2008 IDE?
Do you setup Trunk/Branches/Tags at each library level and try to spaghetti it all together somehow at compile time, or is it better to keep it all as one big project with code replicated here and there for simplicity? Is there a solution using externs? | 0 | [
2,
98,
25,
14,
17586,
161,
20,
9213,
2592,
13,
9,
2328,
21066,
19,
13,
18,
16578,
60,
800,
3726,
3726,
95,
50,
1422,
21,
78,
86,
58,
669,
29,
21,
865,
16,
2592,
13,
9,
2328,
21066,
30,
129,
44,
8214,
19,
13,
18,
16578,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Pointers and Reference
===
I understand the overall meaning of pointers and references(or at least I think i do), I also understand that when I use <b>new</b> I am dynamically allocating memory. My question is the following, if i were to use <b>cout << &p</b> it would display the "virtual memory location" of p. Is there a way in which I could manipulate the "virtual memory location?" The following code shows an array of ints, if I wanted to show the value of p[1] and I knew the "virtual memory location" of p, could I hypothetically do <b>&p + 1</b> and obtain the value of p[1] by doing <b>cout << *p</b>, since *p is now a pointer to the second element in the array.
int *p;
p = new int[3];
p[0] = 13;
p[1] = 54;
p[2] = 42;
| 0 | [
2,
454,
445,
17,
2801,
800,
3726,
3726,
31,
1369,
14,
1677,
1813,
16,
454,
445,
17,
7231,
5,
248,
35,
639,
31,
277,
31,
107,
6,
15,
31,
67,
1369,
30,
76,
31,
275,
13,
1,
220,
1,
2681,
1,
118,
220,
1,
31,
589,
7782,
1326,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 suggestions for testing extjs code in a browser, preferably with selenium?
===
We've been using selenium with great success to handle high-level website testing (in addition to extensive python doctests at a module level). However now we're using extjs for a lot of pages and its proving difficult to incorporate Selenium tests for the complex components like grids.
Has anyone had success writing automated tests for extjs-based web pages? Lots of googling finds people with similar problems, but few answers. Thanks! | 0 | [
2,
186,
18389,
26,
4431,
1396,
38,
728,
18,
1797,
19,
21,
16495,
15,
6369,
4801,
29,
23027,
14311,
60,
800,
3726,
3726,
95,
22,
195,
74,
568,
23027,
14311,
29,
374,
1280,
20,
3053,
183,
8,
3906,
2271,
4431,
13,
5,
108,
848,
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 get the value of a JSObject property from C?
===
In SpiderMonky, how do I get the value of a property of a JSObject from within my C code? | 0 | [
2,
184,
107,
31,
164,
14,
1923,
16,
21,
487,
18,
23793,
1354,
37,
272,
60,
800,
3726,
3726,
19,
5650,
2111,
3329,
15,
184,
107,
31,
164,
14,
1923,
16,
21,
1354,
16,
21,
487,
18,
23793,
37,
363,
51,
272,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Using a USB controller as auxiliary keyboard for Visual Studio
===
Our family no longer uses our [Mixman DM2][1] USB conbtroller for making music. This frees it up for me to use as an auxiliary keyboard with 31 "keys" (and a few "sliders"). I had the crazy idea to use these buttons to send keyboard shortcuts to Visual Studio. It just seems easier pressing one key than some of the finger-bending ctrl double-key combos.
I tried a couple utilities like JoyToKey and XPadder but they only recognize game controllers and the DM2 falls into the more generic "USB Controller" category.
Have you ever heard of such nonsense?
[1]: http://www.mixman.com/products/dm2.html | 0 | [
2,
568,
21,
182,
220,
9919,
28,
10059,
8896,
26,
3458,
1120,
800,
3726,
3726,
318,
190,
90,
1045,
2027,
318,
636,
15743,
177,
15728,
135,
500,
2558,
165,
500,
182,
220,
1065,
220,
38,
8694,
106,
26,
544,
232,
9,
48,
551,
18,
32,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
I need populate a repeater with pseudo-related data
===
Before I do this I figured I would ask if it was the best way. Each "Vendor" object has a "Bucket" object. In my repeater I need to display some properties from Vendor and some from Bucket, also some images populated by FileSystem that are linked to the vendor. I figured the best way to do this is bind the repeater with the vendor object, then on ItemDataBound I would populate the images and the buckets based on the vendor that is bound to that particular Items[e.Item.ItemIndex].
Is this the best way to go about this? Thanks. | 0 | [
2,
31,
376,
1675,
12383,
21,
6830,
106,
29,
8452,
8,
6203,
1054,
800,
3726,
3726,
115,
31,
107,
48,
31,
5700,
31,
83,
1349,
100,
32,
23,
14,
246,
161,
9,
206,
13,
7,
3124,
5290,
7,
3095,
63,
21,
13,
7,
11925,
1198,
7,
3095,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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# Regex index in matching string where the match failed
===
I am wondering if it is possible to extract the index position in a given string where a Regex failed when trying to match it?
For example, if my regex was "abc" and I tried to match that with "abd" the match would fail at index 2.
Thanks | 0 | [
2,
272,
5910,
7953,
1706,
4348,
19,
10120,
3724,
113,
14,
730,
1702,
800,
3726,
3726,
31,
589,
5712,
100,
32,
25,
938,
20,
10962,
14,
4348,
649,
19,
21,
504,
3724,
113,
21,
7953,
1706,
1702,
76,
749,
20,
730,
32,
60,
26,
823,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the difference between a POST and a PUT HTTP REQUEST?
===
They both seem to be sending data to the server inside the body, so what makes them different? | 0 | [
2,
98,
22,
18,
14,
2841,
128,
21,
678,
17,
21,
442,
7775,
3772,
60,
800,
3726,
3726,
59,
156,
2260,
20,
44,
4907,
1054,
20,
14,
8128,
572,
14,
358,
15,
86,
98,
1364,
105,
421,
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... |
best ways to use cygwin
===
when i have to use MSwindows i always open a cygwin window so would like to know
whats your favourite commands when using cygwin ?
some of mine are :
tail -c anylog //to wathc logs file continuously
locate somefile //find file
alias longCommand ='tail -c anylog |grep --color "term1\|term2\|term3"'
cat *.txt //print all content of every txt file in directory
mv p2p/*.mp3 myDocs/myMusic // :D self explanatory
| 0 | [
2,
246,
2847,
20,
275,
6728,
263,
4181,
800,
3726,
3726,
76,
31,
57,
20,
275,
4235,
27508,
18,
31,
550,
368,
21,
6728,
263,
4181,
1463,
86,
83,
101,
20,
143,
98,
18,
154,
7740,
14294,
76,
568,
6728,
263,
4181,
13,
60,
109,
16,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the down sides of using a composite/compound primary key?
===
What are the down sides of using a composite/compound primary key? | 0 | [
2,
98,
50,
14,
125,
2570,
16,
568,
21,
12639,
118,
960,
12420,
1256,
1246,
60,
800,
3726,
3726,
98,
50,
14,
125,
2570,
16,
568,
21,
12639,
118,
960,
12420,
1256,
1246,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
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 do you send a HEAD HTTP request in Python?
===
So what I'm trying to do here is get the headers of a given URL so I can determine the mime-type. I want to be able to see if http://somedomain/foo/ will return an html document or a jpg image for example. | 0 | [
2,
184,
107,
42,
2660,
21,
157,
7775,
3772,
19,
20059,
60,
800,
3726,
3726,
86,
98,
31,
22,
79,
749,
20,
107,
235,
25,
164,
14,
157,
445,
16,
21,
504,
287,
6362,
86,
31,
92,
3746,
14,
26193,
8,
4474,
9,
31,
259,
20,
44,
77... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's your best trick to break out of an unbalanced quote condition in BASE SAS?
===
As a base SAS programmer, you know the drill:
You submit your SAS code, which contains an unbalanced quote, so now you've got not only and unclosed quote, but also unclosed comments, macro function definitions, and a missing run; or quit; statement.
What's your best trick for not having those unbalanced quotes bother you?
| 0 | [
2,
98,
22,
18,
154,
246,
5514,
20,
1442,
70,
16,
40,
367,
24140,
43,
16371,
2874,
19,
1000,
9233,
60,
800,
3726,
3726,
28,
21,
1000,
9233,
17968,
15,
42,
143,
14,
10495,
45,
42,
12298,
154,
9233,
1797,
15,
56,
1588,
40,
367,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best way to do a mapping application for the iPhone.
===
So I'm looking at writing an iPhone application that shows things on a map. What frameworks/methodologies are out there for doing this?
Searching around on Google, I could only find this one:
[http://code.google.com/p/iphone-google-maps-component/][1]
Which according to the issues list is slow, and stops working after a while. Does anyone know of something better, or have any experience with the library above?
[1]: http://code.google.com/p/iphone-google-maps-component/ | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
107,
21,
13305,
3010,
26,
14,
21024,
9,
800,
3726,
3726,
86,
31,
22,
79,
699,
35,
1174,
40,
21024,
3010,
30,
1285,
564,
27,
21,
2942,
9,
98,
6596,
18,
118,
5909,
1807,
43,
13331,
18,
50,
70,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are the licenses of the Apache Commons and OpenJDK compatible enough to merge them for OpenJDK 8?
===
Now that Java is OpenSource does anyone know how these licenses would enable or encumber a merge? | 0 | [
2,
50,
14,
3962,
18,
16,
14,
17140,
8322,
17,
368,
728,
43,
197,
14961,
511,
20,
12666,
105,
26,
368,
728,
43,
197,
469,
60,
800,
3726,
3726,
130,
30,
8247,
25,
368,
12097,
630,
1276,
143,
184,
158,
3962,
18,
83,
9240,
54,
195... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Is JavaScript object oriented?
===
There have been some questions about whether or not JavaScript is an object-oriented language. Even a statement, "just becuase a language has objects doesn't make it OO ".
Is JavaScript and object oriented language? | 0 | [
2,
25,
8247,
8741,
3095,
13,
6800,
60,
800,
3726,
3726,
80,
57,
74,
109,
2346,
88,
1472,
54,
52,
8247,
8741,
25,
40,
3095,
8,
6800,
816,
9,
166,
21,
3331,
15,
13,
7,
2759,
44,
3987,
6105,
21,
816,
63,
3916,
1437,
22,
38,
233... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Open Source CMS without front end?
===
In many projects we are developing we need to have CMS functionalities in the back end of the site. On the other end we don't want to or can't commit to a complete front end solution.
To explain this better:
- CMSes like [Joomla][1] or [DotNetNuke][2] are complete web site solutions, they let you store and publish data. They are not friendly at all if you just need to store data and retrieve it in a custom way. They are not what we are looking for -- and I think they should not be called CMS at all, because they are much more!
- CMSes like [Umbraco][3] look nice, but again, they are not very versatile at all if you want to use the data in a custom way. Umbraco gives you APIs to access the data at run-time, whereas I am also interested in having static publishing features for scalability concerns.
To give a couple more indications:
- If it has a plug-in system, it's probably not what I am looking for...
- If it cannot publish statically and dynamically (think XML files or HTML files AND APIs), it's probably not what I am looking for...
- Cross DB would be great, but it's not strictly necessary
The CMS does not need to be free, but we must be able to have the full source code. As for platform, we need solutions mainly for .NET and LAMP.
I already know the [CMS Matrix][4] site, but its definition of CMS includes too many web site solutions so I don't get enough signal-to-noise to find what I need.
[1]: http://www.joomla.org/
[2]: http://www.dotnetnuke.com/
[3]: http://www.umbraco.org/
[4]: http://www.cmsmatrix.org/ | 0 | [
2,
368,
1267,
2390,
18,
366,
431,
241,
60,
800,
3726,
3726,
19,
151,
2314,
95,
50,
3561,
95,
376,
20,
57,
2390,
18,
7652,
3808,
19,
14,
97,
241,
16,
14,
689,
9,
27,
14,
89,
241,
95,
221,
22,
38,
259,
20,
54,
92,
22,
38,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XML based website - how to create?
===
I would like to create an xml based website. I want to use xml files as datasources since it is a kind of online directory site. Can someone please give me a starting point? Are there any good online resources that I can refer to? I am pretty confortable with ASP and Javascript. Thank you in advance.
Best regards,
Aravind | 0 | [
2,
23504,
432,
2271,
13,
8,
184,
20,
1600,
60,
800,
3726,
3726,
31,
83,
101,
20,
1600,
40,
23504,
432,
2271,
9,
31,
259,
20,
275,
23504,
6488,
28,
1054,
12097,
18,
179,
32,
25,
21,
825,
16,
2087,
16755,
689,
9,
92,
737,
2247,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 prototype?
===
We prototype a design, GUI, just to analyze a particular problem, proof of concept, etc. Sometimes we throw away the prototype, and sometimes it ends up in the production code. We use different languages, technologies, strategies, and styles to prototype.
What are the different situations you prototype usually and how do you prototype? Any good resource out there to master the craft? | 0 | [
2,
184,
107,
42,
7063,
60,
800,
3726,
3726,
95,
7063,
21,
704,
15,
9457,
15,
114,
20,
16051,
21,
1498,
1448,
15,
6070,
16,
2420,
15,
2722,
9,
1030,
95,
3814,
229,
14,
7063,
15,
17,
1030,
32,
3451,
71,
19,
14,
637,
1797,
9,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is your single favorite book for getting started with unit testing?
===
I am looking for a book that gives a good overview of the subject, and is also practical for **implementing** unit testing. The book should be useful for users of different programming languages. | 4 | [
2,
98,
25,
154,
345,
3839,
360,
26,
1017,
373,
29,
1237,
4431,
60,
800,
3726,
3726,
31,
589,
699,
26,
21,
360,
30,
2352,
21,
254,
21598,
16,
14,
1550,
15,
17,
25,
67,
5713,
26,
13,
1409,
8983,
413,
1130,
68,
1409,
1237,
4431,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How would you implement auto-capitalization in JavaScript/HTML.
===
I need to implement auto-capitalization inside of a Telerik RadEditor control on an ASPX page as a user types.
This can be an IE specific solution (IE6+).
I currently capture every keystroke (down/up) as the user types to support a separate feature called "macros" that are essentially short keywords that expand into formatted text. i.e. the macro "so" could auto expand upon hitting spacebar to "stackoverflow".
That said, I have access to the keyCode information, as well I am using the TextRange methods to select a word ("so") and expanding it to "stackoverflow". Thus, I have some semblence of context.
However, I need to check this context to know whether I should auto-capitalize. This also needs to work regardless of whether a macro is involved.
Since I'm monitoring keystrokes for the macros, should I just monitor for punctuation (it's more than just periods that signal a capital letter) and auto-cap the next letter typed, or should I use TextRange and analyze context? | 0 | [
2,
184,
83,
42,
8713,
3108,
8,
21316,
1829,
19,
8247,
8741,
118,
15895,
9,
800,
3726,
3726,
31,
376,
20,
8713,
3108,
8,
21316,
1829,
572,
16,
21,
4338,
6639,
4944,
13401,
569,
27,
40,
28,
306,
396,
2478,
28,
21,
4155,
2551,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
GCC compiling a dll with __stdcall
===
When we compile a dll using __stdcall inside visual studio 2008 the compiled function names inside the dll are.
FunctionName
Though when we compile the same dll using GCC using wx-dev-cpp GCC appends the number of paramers the function has, so the name of the function using Dependency walker looks like.
FunctionName@numberOfParameters or == FunctionName@8
How do you tell GCC compiler to remove @nn from exported symbols in the dll?
| 0 | [
2,
489,
3384,
24378,
21,
13,
43,
211,
29,
13,
1,
384,
43,
9200,
800,
3726,
3726,
76,
95,
26561,
21,
13,
43,
211,
568,
13,
1,
384,
43,
9200,
572,
3458,
1120,
570,
14,
9316,
1990,
1817,
572,
14,
13,
43,
211,
50,
9,
1990,
7259,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Whats the best way to get started with server virtualization?
===
We recently bought a new rack and set of servers for it, we want to be able to redeploy these boxes as build servers, QA regression test servers, lab re-correlation servers, simulation servers, etc.
We have played a bit with VMWare, VirtualPC, VirtualBox etc, creating a virtual build server, but we came across a lot of issues when we tried to copy it for others to use, having to reconfigure every new copy of the VM.
We are using Windows XP x86/x64 and Windows Vista x86/x64, so I had to rename the machine, join the domain etc for every new copy.
Ideally we just want to be able to add a new box, deploy a thin boot strap OS (Linux is fine here) to get the VM up an running, then use it.
One other thing we have limited to no budget, so free is best.
I would like to understand others experiences in doing the same thing.
FYI, I am not in systems IT, this we are group of software engineers trying to set this up.
Any likes to good tutorials would be great. | 0 | [
2,
98,
18,
14,
246,
161,
20,
164,
373,
29,
8128,
6599,
1829,
60,
800,
3726,
3726,
95,
1989,
2448,
21,
78,
10257,
17,
309,
16,
17595,
26,
32,
15,
95,
259,
20,
44,
777,
20,
402,
3492,
10892,
158,
8120,
28,
1895,
17595,
15,
7234,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 should you enable SSL?
===
My last couple of projects have involved websites that sell a product/service and require a 'checkout' process in which users put in their credit card information and such. Obviously we got SSL certificates for the security of it plus giving peace of mind to the customers. I am, however, a little clueless as to the subtleties of it, and most importantly as to which parts of the website should 'use' the certificate.
For example, I've been to websites where the moment you hit the homepage you are put in https - mostly banking sites - and then there are websites where you are only put in https when you are finally checking out. Is it overkill to make the entire website run through https if it doesn't deal with something on the level of banking? Should I only make the checkout page https? What is the performance hit on going all out? | 0 | [
2,
113,
378,
42,
9240,
13,
18,
18,
255,
60,
800,
3726,
3726,
51,
236,
1335,
16,
2314,
57,
1013,
13931,
30,
3344,
21,
2374,
118,
11449,
17,
4077,
21,
13,
22,
12542,
1320,
22,
953,
19,
56,
3878,
442,
19,
66,
3251,
2056,
676,
17,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Problem calling stored procedure from another stored procedure via classic ASP
===
We have a classic ASP application that simply works and we have been loathe to modify the code lest we invoke the wrath of some long-dead Greek gods.
We recently had the requirement to add a feature to an application. The feature implementation is really just a database operation requires minimal change to the UI.
I changed the UI and made the minor modification to submit a new data value to the sproc call (sproc1).
In sproc1 that is called directly from ASP, we added a new call to another sproc that happens to be located on another server, sproc2.
Somehow, this does not work via our ASP app, but works in SQL Management Studio.
Here's the technical details:
1. SQL 2005 on both database servers.
2. Sql Login is authenticating from the ASP application to SQL 2005 Server 1.
3. Linked server from Server 1 to Server 2 is working.
4. When executing sproc1 from SQL Management Studio - works fine. Even when credentialed as the same user our code uses (the application sql login).
5. sproc2 works when called independently of sproc1 from SQL Management Studio.
6. VBScript (ASP) captures an error which is emitted in the XML back to the client. Error number is 0, error description is blank. Both from the ADODB.Connection object and from whatever Err.Number/Err.Description yields in VBScript from the ASP side.
So without any errors, nor any reproducibility (i.e. through SQL Mgmt Studio) - does anyone know the issue?
Our current plan is to break down and dig into the code on the ASP side and make a completely separate call to Server 2.sproc2 directly from ASP rather than trying to piggy-back through sproc1. | 0 | [
2,
1448,
2555,
8214,
7004,
37,
226,
8214,
7004,
1197,
2732,
28,
306,
800,
3726,
3726,
95,
57,
21,
2732,
28,
306,
3010,
30,
1659,
693,
17,
95,
57,
74,
2205,
58,
124,
20,
17579,
14,
1797,
3921,
38,
95,
28371,
14,
16677,
16,
109,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Unit testing MFC UI applications?
===
How do you unit test a large MFC UI application?
We have a few large MFC applications that have been in development for many years, we use some standard automated QA tools to run basic scripts to check fundamentals, file open etc. These are run by the QA group post the daily build.
But we would like to introduce procedures such that individual developers can build and run tests against dialogs, menus, and other visual elements of the application before submitting code to the daily build.
I have heard of such techniques as hidden test buttons on dialogs that only appear in debug builds, are there any standard toolkits for this.
Environment is C++/C/FORTRAN, MSVC 2005, Intel FORTRAN 9.1, Windows XP/Vista x86 & x64. | 0 | [
2,
1237,
4431,
307,
7061,
13,
5661,
3767,
60,
800,
3726,
3726,
184,
107,
42,
1237,
1289,
21,
370,
307,
7061,
13,
5661,
3010,
60,
95,
57,
21,
310,
370,
307,
7061,
3767,
30,
57,
74,
19,
522,
26,
151,
122,
15,
95,
275,
109,
1236,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Point Sequence Interpolation
===
Given an arbitrary sequence of points in space, how would you produce a smooth continuous interpolation between them?
2D and 3D solutions are welcome. Solutions that produce a list of points at arbitrary granularity and solutions that produce control points for bezier curves are also appreciated. | 0 | [
2,
454,
4030,
23336,
857,
800,
3726,
3726,
504,
40,
17237,
4030,
16,
819,
19,
726,
15,
184,
83,
42,
2213,
21,
3905,
6357,
23336,
857,
128,
105,
60,
172,
43,
17,
203,
43,
6776,
50,
5575,
9,
6776,
30,
2213,
21,
968,
16,
819,
35,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tools to annotate images
===
What tools do you use to annotate images?
I mean, for example, placing a screenshot into documentation with some text bubbles, arrows, numbers for references in text and so on.
Sure, you can do all of these in general graphics editor, but a specialized tool (or plugin for a generic editor) would be so much nicer and should produce more consistent results. | 0 | [
2,
4672,
20,
40,
1270,
1373,
3502,
800,
3726,
3726,
98,
4672,
107,
42,
275,
20,
40,
1270,
1373,
3502,
60,
31,
884,
15,
26,
823,
15,
5861,
21,
2324,
7868,
77,
13945,
29,
109,
1854,
20743,
15,
13912,
15,
2116,
26,
7231,
19,
1854,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 still any reason to learn AWK ?
===
I am constantly learning new tools, even old fashion ones, because I like to use the right solution for the right problem.
Nevertheless, I wonder if there is still any reason to learn some of them. AWK for example, is interresting me, but for simple text processing, I can use grep / cut / sed / whatever, while for complex ones, I´ll go for Python.
Now I don´t mean that´s it´s not a powerful and handy tool. But since it takes time and energy to learn a new tool, **is it worth is** ? | 0 | [
2,
25,
80,
174,
186,
1215,
20,
2484,
13,
3885,
197,
13,
60,
800,
3726,
3726,
31,
589,
7545,
2477,
78,
4672,
15,
166,
315,
3161,
53,
18,
15,
185,
31,
101,
20,
275,
14,
193,
4295,
26,
14,
193,
1448,
9,
5715,
15,
31,
2666,
100,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can i temporarily load a font?
===
I need to load some fonts temporarily in my program. Preferably from a dll resource file. | 0 | [
2,
184,
92,
31,
7866,
6305,
21,
9978,
60,
800,
3726,
3726,
31,
376,
20,
6305,
109,
9978,
18,
7866,
19,
51,
625,
9,
6369,
4801,
37,
21,
13,
43,
211,
6577,
3893,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
XML-RPC: best way to handle 64-bit values?
===
So the official XML-RPC standard doesn't support 64-bit values. But in these modern times, 64-bit values are increasingly common.
How do you handle these? What XML-RPC extensions are the most common? What language bindings are there? I'm especially interested in Python and C++, but all information is appreciated. | 0 | [
2,
23504,
8,
139,
5779,
45,
246,
161,
20,
3053,
4384,
8,
3326,
4070,
60,
800,
3726,
3726,
86,
14,
989,
23504,
8,
139,
5779,
1236,
1437,
22,
38,
555,
4384,
8,
3326,
4070,
9,
47,
19,
158,
773,
436,
15,
4384,
8,
3326,
4070,
50,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best or cheapest library for creating PDF files i Delphi?
===
As the title states:
What is the best or cheapest library for creating PDF files i Delphi? | 4 | [
2,
98,
25,
14,
246,
54,
9148,
1430,
1248,
26,
2936,
13,
11124,
6488,
31,
23030,
60,
800,
3726,
3726,
28,
14,
581,
202,
45,
98,
25,
14,
246,
54,
9148,
1430,
1248,
26,
2936,
13,
11124,
6488,
31,
23030,
60,
3,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to compute the critical path of a directional acyclic graph?
===
What is the best (regarding performance) way to compute the critical path of a directional acyclic graph when the nodes of the graph have weight?
For example, if I have the following structure:
Node A (weight 3)
/ \
Node B (weight 4) Node D (weight 7)
/ \
Node E (weight 2) Node F (weight 3)
The critical path should be A->B->F (total weight: 10)
| 0 | [
2,
184,
20,
23909,
14,
2507,
2013,
16,
21,
13,
19393,
21,
15888,
7210,
60,
800,
3726,
3726,
98,
25,
14,
246,
13,
5,
99,
7632,
68,
956,
6,
161,
20,
23909,
14,
2507,
2013,
16,
21,
13,
19393,
21,
15888,
7210,
76,
14,
16272,
16,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What do you use when you need reliable UDP?
===
If you have a situation where a TCP connection is potentially too slow and a UDP 'connection' is potentially too unreliable what do you use? There are various standard reliable UDP protocols out there, what experiences do you have with them?
Please discuss one protocol per reply and if someone else has already mentioned the one you use then consider voting them up and using a comment to elaborate if required. | 0 | [
2,
98,
107,
42,
275,
76,
42,
376,
11398,
287,
7431,
60,
800,
3726,
3726,
100,
42,
57,
21,
1858,
113,
21,
13,
38,
7439,
2760,
25,
9465,
266,
2276,
17,
21,
287,
7431,
13,
22,
25996,
872,
22,
25,
9465,
266,
26313,
98,
107,
42,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Backend Administration in rails
===
I'd like to build a real quick and dirty administrative backend for a rails app I have been attached to at the last minute. I've looked at activescaffold and streamlined and think they are both very attractive and they should be simple to get running but I don't quite understand how to set up either one as a backend admin page. They seem designed to work like standard rails generators/scaffolds for creating visible front ends with model-view-controller-table name correspondence.
How do you create a admin_players interface when players is already in use and you want to avoid, as much as possible, affecting any of its related files? | 0 | [
2,
97,
2451,
1603,
19,
2240,
18,
800,
3726,
3726,
31,
22,
43,
101,
20,
1895,
21,
683,
2231,
17,
6121,
2168,
97,
2451,
26,
21,
2240,
18,
4865,
31,
57,
74,
3638,
20,
35,
14,
236,
2038,
9,
31,
22,
195,
292,
35,
1348,
3862,
6752... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 and why should $_REQUEST be used instead of $_GET / $_POST / $_COOKIE?
===
Question in the title | 0 | [
2,
76,
17,
483,
378,
5579,
1,
99,
10351,
44,
147,
700,
16,
5579,
1,
3060,
13,
118,
5579,
1,
6962,
13,
118,
5579,
1,
716,
17391,
60,
800,
3726,
3726,
1301,
19,
14,
581,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
global variables in php not working as expected
===
I'm having trouble with global variables in php. I have a $screen var set in one file, which requires another file that calls an initSession() defined in yet another file. The initSession() declares "global $screen" and then processes $screen further down using the value set in the very first script.
How is this possible?
To make things more confusing, if you try to set $screen again then call the initSession(), it uses the value first used once again. The following code will describe the process. Could someone have a go at explaining this?
$screen = "list1.inc"; // From model.php
require "controller.php"; // From model.php
initSession(); // From controller.php
global $screen; // From Include.Session.inc
echo $screen; // prints "list1.inc" // From anywhere
$screen = "delete1.inc"; // From model2.php
require "controller2.php"
initSession();
global $screen;
echo $screen; // prints "list1.inc"
| 0 | [
2,
2062,
12157,
19,
13,
26120,
52,
638,
28,
1727,
800,
3726,
3726,
31,
22,
79,
452,
2572,
29,
2062,
12157,
19,
13,
26120,
9,
31,
57,
21,
5579,
7187,
4033,
309,
19,
53,
3893,
15,
56,
4781,
226,
3893,
30,
3029,
40,
19,
7363,
160... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Remove .DS_Store Files From A Git Repository?
===
How can I remove those annoying Mac OS X .DS_Store files from a Git repository? | 0 | [
2,
184,
92,
31,
4681,
13,
9,
43,
18,
1,
16828,
6488,
37,
21,
13,
10404,
24869,
60,
800,
3726,
3726,
184,
92,
31,
4681,
273,
17610,
1572,
13,
759,
993,
13,
9,
43,
18,
1,
16828,
6488,
37,
21,
13,
10404,
24869,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Python output buffering
===
Is output buffering enabled by default in Python's interpreter for `sys.stdout` ?
If the answer is positive, what are all the ways to disable it ?
| 0 | [
2,
20059,
5196,
17497,
68,
800,
3726,
3726,
25,
5196,
17497,
68,
9338,
34,
12838,
19,
20059,
22,
18,
19336,
26,
13,
1,
4980,
18,
9,
384,
43,
1320,
1,
13,
60,
100,
14,
1623,
25,
2221,
15,
98,
50,
65,
14,
2847,
20,
1460,
579,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What are the encumberances in changing a piece of GPLv2 licensed code into a piece of GPLv3 licensed code?
===
I would like to start a project using the GPLv3 license; utilising existing GPLv2 code *and Apache License, Version 2.0 code.*
Please keep answers here specific to GPLv2 licensed code transitioning into a piece of GPLv3 licensed code. Thanks. | 0 | [
2,
98,
50,
14,
1957,
8086,
2102,
2416,
18,
19,
4226,
21,
1855,
16,
10538,
8916,
135,
6392,
1797,
77,
21,
1855,
16,
10538,
8916,
240,
6392,
1797,
60,
800,
3726,
3726,
31,
83,
101,
20,
799,
21,
669,
568,
14,
10538,
8916,
240,
3962... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 encumberances in changing a piece of Apache License, Version 2.0 licensed code into a piece of GPLv3 licensed code?
===
I would like to start a project using the GPLv3 license; *utilising existing GPLv2 code and* Apache License, Version 2.0 code.
Please keep answers here specific to Apache License, Version 2.0 licensed code transitioning into a piece of GPLv3 licensed code. Thanks.
| 0 | [
2,
98,
50,
14,
1957,
8086,
2102,
2416,
18,
19,
4226,
21,
1855,
16,
17140,
3962,
15,
615,
172,
9,
387,
6392,
1797,
77,
21,
1855,
16,
10538,
8916,
240,
6392,
1797,
60,
800,
3726,
3726,
31,
83,
101,
20,
799,
21,
669,
568,
14,
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... |
StackOverflowException in .Net
===
After hitting a few StackOverflowExceptions in .Net I noticed they completely bypass the Unhandled exception handlers that .Net offers (Application.ThreadException / AppDomain.UnhandledException).
This is very disturbing since we have critical cleanup code in those exception handlers.
Anyway to overcome this ? | 0 | [
2,
7566,
2549,
9990,
10066,
872,
19,
13,
9,
2328,
800,
3726,
3726,
75,
6687,
21,
310,
7566,
2549,
9990,
10066,
5757,
19,
13,
9,
2328,
31,
2711,
59,
1524,
8900,
14,
367,
3203,
1294,
5391,
24641,
18,
30,
13,
9,
2328,
2486,
13,
5,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# libraries for internationalization?
===
I am looking for libraries to write C# internationalized applications. Typical functionalities I am looking for:
- Validation of country specific data (VAT numbers, phone numbers, addresses,...)
- Validation of bank and financial coordinates (Credit Card numbers, IBAN,...)
- Language-specific functionalities (numbers to words to numbers, summarize,...)
- Language specific content filtering (swearword filtering...)
An example of such library in Perl would be the Lingua series of modules -- but I need C#/dotNet solutions. | 0 | [
2,
272,
5910,
8649,
26,
294,
1829,
60,
800,
3726,
3726,
31,
589,
699,
26,
8649,
20,
2757,
272,
5910,
294,
1333,
3767,
9,
3874,
7652,
3808,
31,
589,
699,
26,
45,
13,
8,
27999,
16,
475,
1903,
1054,
13,
5,
8112,
2116,
15,
1132,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are good sources to study the threading implementation of a XMPP application?
===
From my understanding the XMPP protocol is based on an always-on connection where you have no, immediate, indication of when an XML message ends.
This means you have to evaluate the stream as it comes. This also means that, probably, you have to deal with asynchronous connections since the socket can block in the middle of an XML message, either due to message length or a connection being slow.
I would appreciate one source per answer so we can mod them up and see what's the favourite. | 0 | [
2,
98,
50,
254,
2662,
20,
949,
14,
9322,
68,
6123,
16,
21,
993,
79,
3421,
3010,
60,
800,
3726,
3726,
37,
51,
3260,
14,
993,
79,
3421,
8494,
25,
432,
27,
40,
550,
8,
218,
2760,
113,
42,
57,
90,
15,
5231,
15,
11290,
16,
76,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Importing/exporting history in Team System
===
Are there any import and export tools that would let us move projects into and out of team system **with full history and log**? Our current SCM is SVN.
PS - Sorry, I know it's a repost, but I didn't get an answer before... :) | 0 | [
2,
9010,
68,
118,
1706,
1993,
68,
447,
19,
173,
329,
800,
3726,
3726,
50,
80,
186,
9010,
17,
7487,
4672,
30,
83,
408,
182,
780,
2314,
77,
17,
70,
16,
173,
329,
13,
1409,
1410,
503,
447,
17,
6738,
1409,
60,
318,
866,
4729,
79,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can Flash save content without server-side help?
===
As far as I know, Flash has to pass info off to another external process in order to save files - POSTing to PHP or talking to an executable, right? But every once in a while I hear rumors that Flash is able to open a file, make changes, then save/write those changes, all on its own - is it possible? | 0 | [
2,
92,
4433,
2079,
2331,
366,
8128,
8,
1416,
448,
60,
800,
3726,
3726,
28,
463,
28,
31,
143,
15,
4433,
63,
20,
1477,
15404,
168,
20,
226,
4886,
953,
19,
389,
20,
2079,
6488,
13,
8,
15669,
20,
13,
26120,
54,
1582,
20,
40,
1396,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 is my Java program leaking memory when I call run() on a Thread object?
===
(Jeopardy-style question, I wish the answer had been online when I had this issue)
I have a method that I want to run as a thread some of the time, but not at others. So I declared it as a subclass of Thread, then either called start() or run() depending on what I needed.
But I found that my program would leak memory over time. What am I doing wrong? | 0 | [
2,
483,
25,
51,
8247,
625,
26334,
1912,
76,
31,
645,
485,
5,
6,
27,
21,
9322,
3095,
60,
800,
3726,
3726,
13,
5,
1969,
2594,
1514,
93,
8,
4381,
1301,
15,
31,
2536,
14,
1623,
41,
74,
2087,
76,
31,
41,
48,
1513,
6,
31,
57,
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... |
Why Can't I Have "public static const string S = "STUFF"; In My Class
===
I'm sure this already exists here...but I couldn't find it....
When trying to compile my class I get an error:
The constant 'NamespaceName.ClassName.CONST_NAME' cannot be marked static.
at the line:
public static const string CONST_NAME = "blah";
I could do this all of the time in Java. What am I doing wrong? And why doesn't it let me do this?
| 0 | [
2,
483,
92,
22,
38,
31,
57,
13,
7,
12259,
12038,
11608,
38,
3724,
13,
18,
800,
13,
7,
384,
5386,
7,
73,
19,
51,
718,
800,
3726,
3726,
31,
22,
79,
562,
48,
614,
5636,
235,
9,
9,
9,
811,
31,
711,
22,
38,
477,
32,
9,
9,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Catch MainLoop exceptions and displaying them in MessageDialogs
===
I have a wxPython application that relies on an external config file. I want provide friendly message dialogs that show up if there are any config errors. I've tried to make this work by wrapping my app.MainLoop() call in a try/except statement.
The code below works for the init code in my MainWindow frame class, but doesn't catch any exceptions that occur within the MainLoop. How can I catch these exceptions as well?
if __name__ == '__main__':
app = MyApp(0)
try:
MainWindow(None, -1, 'My Cool App')
app.MainLoop()
except ConfigParser.Error, error_message:
messagebox = wx.MessageDialog(None, error_message, 'Configuration Error', wx.OK | wx.ICON_ERROR)
messagebox.ShowModal()
I've read some mention of an OnExceptionInMainLoop method that can be overridden in the wx.App class, but the source I read must be out of date (2004) since wx.App no longer seems to have a method by that name. | 0 | [
2,
2949,
407,
18786,
13392,
17,
17418,
105,
19,
2802,
4286,
5567,
18,
800,
3726,
3726,
31,
57,
21,
619,
396,
6448,
11570,
3010,
30,
19272,
27,
40,
4886,
13,
14093,
2816,
3893,
9,
31,
259,
1181,
4753,
2802,
28223,
18,
30,
298,
71,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 display latest revision in a file?
===
I'm wondering how do you deal with displaying release revision number when pushing live new versions of your app?
You can use $Rev$ in a file to get latest revision, but only after you update the file.
What if I want to update a string in one file every time I change any file in the repository/directory?
Is there a way? | 0 | [
2,
184,
20,
3042,
5736,
11323,
19,
21,
3893,
60,
800,
3726,
3726,
31,
22,
79,
5712,
184,
107,
42,
1183,
29,
17418,
830,
11323,
234,
76,
5076,
515,
78,
3281,
16,
154,
4865,
60,
42,
92,
275,
5579,
14587,
4403,
19,
21,
3893,
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... |
Converting eps to png
===
What is the best way to convert a eps image to a png while preserving the vector information? | 0 | [
2,
19583,
2579,
18,
20,
351,
2723,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
8406,
21,
2579,
18,
1961,
20,
21,
351,
2723,
133,
17936,
14,
7497,
676,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Connectionstring error after encypted using aspnet_regiis.exe
===
I've encrypted the connectionstring in my web.config file using the steps in the link below:
[http://www.codeproject.com/KB/database/WebFarmConnStringsNet20.aspx][1]
However, whenever I call my application, it will give the following error:
> Failed to decrypt using provider
> 'CustomProvider'. Error message from
> the provider: The RSA key container
> could not be opened.
The server where I perform the encryption is a 64-bit Windows Server 2003 R2 SP2. Because of that I assign the ACL to "NT Authority\Network Service". Yet it still doesn't work.
Hope someone has some ideas what else do I need to check to get this working.
PS. If I used the default rsa key "NetFrameworkConfigurationKey" for encryption, then the connectionstring will not have an access problem.
[1]: http://www.codeproject.com/KB/database/WebFarmConnStringsNet20.aspx | 0 | [
2,
2760,
11130,
7019,
75,
13,
8883,
4417,
69,
568,
28,
306,
2328,
1,
99,
2234,
403,
9,
1706,
62,
800,
3726,
3726,
31,
22,
195,
29403,
14,
2760,
11130,
19,
51,
2741,
9,
14093,
2816,
3893,
568,
14,
2382,
19,
14,
3508,
1021,
45,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there any 'no of lines code' limit for a java class ?
===
How many lines of code can we write in any java file ? Does it depend on JVM ? | 0 | [
2,
25,
80,
186,
13,
22,
251,
16,
1560,
1797,
22,
4496,
26,
21,
8247,
718,
13,
60,
800,
3726,
3726,
184,
151,
1560,
16,
1797,
92,
95,
2757,
19,
186,
8247,
3893,
13,
60,
630,
32,
12547,
27,
487,
20147,
13,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How can I integrate Laconi.ca update stream into SharePoint?
===
I have [laconi.ca][1] (self hosted [twitter][2]) configured on my local intranet and would like to integrate the public stream into SharePoint site with a web part. How can I do this?
[1]: http://laconi.ca/trac/
[2]: http://twitter.com/home | 0 | [
2,
184,
92,
31,
18399,
8213,
5995,
9,
793,
11100,
3766,
77,
1891,
3132,
60,
800,
3726,
3726,
31,
57,
636,
9439,
5995,
9,
793,
500,
2558,
165,
500,
13,
5,
8411,
2812,
636,
38,
13098,
106,
500,
2558,
135,
500,
6,
28895,
27,
51,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best source-level debugger for ColdFusion MX 2004?
===
I have a legacy web site in ColdFusion MX 2004. I'm re-writing it in .Net, so I don't want to pay $600+ for an upgrade to the latest version of ColdFusion, nor do I want to go through the (very large) site fixing version incompatibilities.
I often have to track down and fix bugs in the site.
A source-level debugger that would let me step through the code line-by-line and examine variables would be a HUGE time-saver.
Does anyone have experience using any of the third-party ColdFusion source-level debuggers?
Thanks very much in advance for any recommendations. | 4 | [
2,
98,
22,
18,
14,
246,
1267,
8,
3906,
121,
2345,
11356,
26,
1191,
9818,
307,
396,
894,
60,
800,
3726,
3726,
31,
57,
21,
7780,
2741,
689,
19,
1191,
9818,
307,
396,
894,
9,
31,
22,
79,
302,
8,
12646,
32,
19,
13,
9,
2328,
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 to create a zip file in the same format as the Finder's "Compress" menu item?
===
On Mac OS X, you can create a zip archive from the Finder by selecting some files and selecting "Compress" from the contextual menu or the File menu. Unfortunately, the resulting file is not identical to the archive created by the `zip` command (with the default options).
This distinction matters to at least one service operated by Apple, which fails to accept archives created with the `zip` command. Having to create archives manually is preventing me from fully automating my release build process.
How can I create a zip archive in the correct format within a shell script? | 0 | [
2,
184,
20,
1600,
21,
12133,
3893,
19,
14,
205,
2595,
28,
14,
13,
18639,
22,
18,
13,
7,
960,
5890,
7,
11379,
9101,
60,
800,
3726,
3726,
27,
1572,
13,
759,
993,
15,
42,
92,
1600,
21,
12133,
9250,
37,
14,
13,
18639,
34,
20764,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 feasible to introduce Test Driven Development (TDD) in a mature project?
===
- Say we have realized a value of TDD too late. Project is already matured, good deal of customers started using it.
- Say automated testing used are mostly functional/system testing and there is a good deal of automated GUI testing.
- Say we have new feature requests, and new bug reports (!). So good deal of development still goes on.
- Note there would already be plenty of business object with no or little unit testing.
- Too much collaboration/relationships between them, which again is tested only through higher level functional/system testing. No integration testing per se.
- Big databases in place with plenty of tables, views, etc. Just to instantiate a single business object there already goes good deal of database round trips.
How can we introduce TDD at this stage?
Mocking seems to be the way to go. But the amount of mocking we need to do here seems like too much. Sounds like elaborate infrastructure needs to be developed for the mocking system working for existing stuff (BO, databases, etc.).
Does that mean TDD is a suitable methodology only when starting from scratch? I am interested to hear about the feasible strategies to introduce TDD in an already mature product. | 0 | [
2,
25,
32,
13,
23707,
20,
8500,
1289,
5355,
522,
13,
5,
38,
8096,
6,
19,
21,
8615,
669,
60,
800,
3726,
3726,
13,
8,
395,
95,
57,
1896,
21,
1923,
16,
15596,
43,
266,
456,
9,
669,
25,
614,
8615,
43,
15,
254,
1183,
16,
5279,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which is the Best Book for .NET coding guidelines?
===
Which is the best book for .NET coding guidelines? | 4 | [
2,
56,
25,
14,
246,
360,
26,
13,
9,
2328,
13,
15458,
12629,
60,
800,
3726,
3726,
56,
25,
14,
246,
360,
26,
13,
9,
2328,
13,
15458,
12629,
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... | [
1,
1,
1,
1,
1,
1,
1,
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... |
How to add some non standard font to website?
===
Is there any way to add some custom font on website, without using images, flash or some other graphics. For example, I was working on some wedding website, and I was found a lot of nice fonts with that subject, but I'm not find the right way how to add that font on the server and how to include that font with css into html, so is there any chache to do this without graphics? | 0 | [
2,
184,
20,
3547,
109,
538,
1236,
9978,
20,
2271,
60,
800,
3726,
3726,
25,
80,
186,
161,
20,
3547,
109,
5816,
9978,
27,
2271,
15,
366,
568,
3502,
15,
4433,
54,
109,
89,
8351,
9,
26,
823,
15,
31,
23,
638,
27,
109,
3349,
2271,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CSS list-style
===
I am using YUI reset/base, after the reset it sets the ul and li tags to list-style: disc outside;
My markup looks like this:
<div id="nav">
<ul class="links">
<li><a href="">Testing</a></li>
</ul>
</div>
My CSS is:
#nav {}
#nav ul li {
list-style: none;
}
Now that makes the small disc beside each li disappear.
Why doesn't this work though?
#nav {}
#sidenav ul.links
{
list-style: none;
}
It works if I remove the link to the base.css file, why?. | 0 | [
2,
272,
18,
18,
968,
8,
4381,
800,
3726,
3726,
31,
589,
568,
2600,
49,
23422,
118,
8436,
15,
75,
14,
23422,
32,
3415,
14,
13,
1287,
17,
2093,
3383,
18,
20,
968,
8,
4381,
45,
3626,
719,
73,
51,
943,
576,
1879,
101,
48,
45,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
A Firefox javascript bookmarking problem
===
I'm using the following JavaScript code:
<script language="JavaScript1.2" type="text/javascript">
function CreateBookmarkLink(title, url) {
if (window.sidebar) {
window.sidebar.addPanel(title, url,"");
} else if( window.external ) {
window.external.AddFavorite( url, title); }
else if(window.opera && window.print) {
return true; }
}
</script>
This will create a bookmark for Firefox and IE. But the link for Firefox will show up in the sidepanel of the browser, instead of being displayed in the main screen. I personally find this very annoying and am looking for a better solution. It is of course possible to edit the bookmark manually to have it *not* show up in the side panel, but that requires extra steps. I just want to be able to have people bookmark a page (that has a lot of GET information in the URL which is used to build a certain scheme) the easy way.
I'm afraid that it might not be possible to have Firefox present the page in the main screen at all (as Googling this subject resulted in practically nothing worth using), but I might have missed something. If anyone has an idea if this is possible, or if there's a workaround, I'd love to hear about it.
| 0 | [
2,
21,
535,
18219,
8247,
8741,
360,
4527,
68,
1448,
800,
3726,
3726,
31,
22,
79,
568,
14,
249,
8247,
8741,
1797,
45,
13,
1,
8741,
816,
3726,
7,
1004,
1385,
8741,
165,
9,
135,
7,
1001,
3726,
7,
11969,
118,
1004,
1385,
8741,
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... |
Calling C# events from outside the owning class?
===
Is it possible under any set of circumstances to be able to accomplish this?
My current circumstances are this:
public class CustomForm : Form
{
public class CustomGUIElement
{
...
public event MouseEventHandler Click;
// etc, and so forth.
...
}
private List<CustomGUIElement> _elements;
...
public void CustomForm_Click(object sender, MouseEventArgs e)
{
// we might want to call one of the _elements[n].Click in here
// but we can't because we aren't in the same class.
}
}
My first thought was to have a function similar to:
internal enum GUIElementHandlers { Click, ... }
internal void CustomGUIElement::CallHandler(GUIElementHandler h, object[] args) {
switch (h) {
case Click:
this.Click(this, (EventArgs)args[0]);
break;
... // etc and so forth
}
}
It's a horribly ugly kludge, but it should work... There must be a more elegant solution though? The .NET library does this all the time with message handlers and calling events in Control's. Does anyone else have any other/better ideas? | 0 | [
2,
2555,
272,
5910,
963,
37,
719,
14,
258,
68,
718,
60,
800,
3726,
3726,
25,
32,
938,
131,
186,
309,
16,
5072,
20,
44,
777,
20,
14570,
48,
60,
51,
866,
5072,
50,
48,
45,
317,
718,
5816,
4190,
13,
45,
505,
13,
1,
317,
718,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Toad unicode input problem
===
In toad, I can see unicode characters that are coming from oracle db. But when I click one of the fields in the data grid into the edit mode, the unicode characters are converted to meaningless symbols, but this is not the big issue.
While editing this field, the unicode characters are displayed correctly as I type. But as soon as I press enter and exit edit mode, they are converted to the nearest (most similar) non-unicode character. So I cannot type unicode characters on data grids. Copy & pasting one of the unicode characters also does not work.
How can I solve this?
Edit: I am using toad 9.0.0.160. | 0 | [
2,
20,
1283,
28010,
6367,
1448,
800,
3726,
3726,
19,
20,
1283,
15,
31,
92,
196,
28010,
1766,
30,
50,
880,
37,
15759,
13,
9007,
9,
47,
76,
31,
10840,
53,
16,
14,
2861,
19,
14,
1054,
7354,
77,
14,
9392,
3740,
15,
14,
28010,
1766... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 recursively unzip archives in a directory and its subdirectories from the Unix command-line?
===
The <code>unzip</code> command doesn't have an option for recursively unzipping archives.
If I have the following directory structure and archives:
<pre>
/Mother/Loving.zip
/Scurvy/Sea Dogs.zip
/Scurvy/Cures/Limes.zip
</pre>
And I want to unzip all of the archives into directories with the same name as each archive:
<pre>
/Mother/Loving/1.txt
/Mother/Loving.zip
/Scurvy/Sea Dogs/2.txt
/Scurvy/Sea Dogs.zip
/Scurvy/Cures/Limes/3.txt
/Scurvy/Cures/Limes.zip
</pre>
What command or commands would I issue?
It's important that this doesn't choke on filenames that have spaces in them. | 0 | [
2,
184,
107,
42,
302,
24244,
102,
367,
2553,
306,
8111,
19,
21,
16755,
17,
82,
972,
10197,
1596,
37,
14,
22540,
1202,
8,
1143,
60,
800,
3726,
3726,
14,
13,
1,
9375,
1,
1020,
2553,
306,
1,
118,
9375,
1,
1202,
1437,
22,
38,
57,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Optimal multiplayer maze generation algorithm
===
I'm working on a simple multiplayer game in which 2-4 players are placed at separate entrypoints in a maze and need to reach a goal point. Generating a maze in general is very easy, but in this case the goal of the game is to reach the goal before everyone else and I don't want the generation algorithm to drastically favor one player over others.
So I'm looking for a maze generation algorithm where the optimal path for each player from the startpoint to the goal is no more than 10% more steps than the average path. This way the players are on more or less an equal playing field. Can anyone think up such an algorithm?
(I've got one idea as it stands, but it's not well thought out and seems far less than optimal -- I'll post it as an answer.) | 0 | [
2,
17586,
20262,
14576,
2782,
9083,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
1935,
20262,
250,
19,
56,
172,
8,
300,
1007,
50,
1037,
35,
1725,
2792,
3132,
18,
19,
21,
14576,
17,
376,
20,
1470,
21,
1195,
454,
9,
13500,
21,
14576,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 get the filetype icon that Windows Explorer shows?
===
first question here. I'm developing a program in C# (.NET 3.5) that displays files in a listview. I'd like to have the "large icon" view display the icon that Windows Explorer uses for that filetype, otherwise I'll have to use some existing code like this:
private int getFileTypeIconIndex(string fileName)
{
string fileLocation = Application.StartupPath + "\\Quarantine\\" + fileName;
FileInfo fi = new FileInfo(fileLocation);
switch (fi.Extension)
{
case ".pdf":
return 1;
case ".doc": case ".docx": case ".docm": case ".dotx":case ".dotm": case ".dot":case ".wpd": case ".wps":
return 2;
default:
return 0;
}
}
The above code returns an integer that is used to select an icon from an imagelist that I populated with some common icons. It works fine but I'd need to add every extension under the sun! Is there a better way? Thanks! | 0 | [
2,
184,
92,
31,
164,
14,
3893,
4474,
9801,
30,
1936,
8520,
1285,
60,
800,
3726,
3726,
64,
1301,
235,
9,
31,
22,
79,
3561,
21,
625,
19,
272,
5910,
13,
5,
9,
2328,
203,
9,
264,
6,
30,
9412,
6488,
19,
21,
968,
4725,
9,
31,
22... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PLY: Token shifting problem in C parser
===
I'm writing a C parser using PLY, and recently ran into a problem.
This code:
typedef int my_type;
my_type x;
Is correct C code, because my_type is defined as a type previously to
being used as such. I handle it by filling a type symbol table in the
parser that gets used by the lexer to differentiate between types and
simple identifiers.
However, while the type declaration rule ends with SEMI (the ';' token), PLY shifts the token `my_type` from the second line before deciding it's done with the first one. Because of this, I have no chance to pass the update in the type symbol table to the lexer and it
sees my_type as an identifier and not a type.
Any ideas for a fix ?
The full code is at: http://code.google.com/p/pycparser/source/browse/trunk/src/c_parser.py
Not sure how I can create a smaller example out of this. | 0 | [
2,
351,
102,
45,
20,
2853,
10255,
1448,
19,
272,
2017,
4104,
800,
3726,
3726,
31,
22,
79,
1174,
21,
272,
2017,
4104,
568,
351,
102,
15,
17,
1989,
717,
77,
21,
1448,
9,
48,
1797,
45,
1001,
13862,
19,
38,
51,
1,
4474,
73,
51,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Parse multiple XML files with ASP.NET (C#) and return those with particular element
===
Greetings.
I'm looking for a way to parse a number of XML files in a particular directory with ASP.NET (C#). I'd like to be able to return content from particular elements, but before that, need to find those that have a certain value between an element.
Example XML file 1:
<file>
<title>Title 1</title>
<someContent>Content</someContent>
<filter>filter</filter>
</file>
Example XML file 2:
<file>
<title>Title 2</title>
<someContent>Content</someContent>
<filter>filter, different filter</filter>
</file>
Example case 1:
Give me all XML that has a filter of 'filter'.
Example case 2:
Give me all XML that has a title of 'Title 1'.
Looking, it seems this should be possible with LINQ, but I've only seen examples on how to do this when there is one XML file, not when there are multiples, such as in this case.
Thanks!
~James | 0 | [
2,
2017,
870,
1886,
23504,
6488,
29,
28,
306,
9,
2328,
13,
5,
150,
5910,
6,
17,
788,
273,
29,
1498,
4520,
800,
3726,
3726,
13769,
18,
9,
31,
22,
79,
699,
26,
21,
161,
20,
2017,
870,
21,
234,
16,
23504,
6488,
19,
21,
1498,
16... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Weather web service for Europe?
===
We are looking for a reliable "current weather" web service for Europe, with city resolution. We only need the current weather.
Since it is for a commercial web site, we don't mind paying a reasonable fee for the service.
What are our options? What service would you recommend or avoid based on previous experience?
Note: SOAP Web Service, XML RPC, REST, all are fine. | 4 | [
2,
2580,
2741,
365,
26,
1002,
60,
800,
3726,
3726,
95,
50,
699,
26,
21,
11398,
13,
7,
17657,
2580,
7,
2741,
365,
26,
1002,
15,
29,
136,
4302,
9,
95,
104,
376,
14,
866,
2580,
9,
179,
32,
25,
26,
21,
1439,
2741,
689,
15,
95,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Cloud computing.
===
Could anybody explain in plain words how Cloud computing works.
I have read the wikipedia article, but still not sure that I understand how Cloud is actually works. | 0 | [
2,
98,
25,
4005,
10626,
9,
800,
3726,
3726,
110,
11181,
3271,
19,
3748,
715,
184,
4005,
10626,
693,
9,
31,
57,
1302,
14,
20169,
2002,
15,
47,
174,
52,
562,
30,
31,
1369,
184,
4005,
25,
1121,
693,
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... |
Closing/cleaning up "mixed" file descriptors / sockets.
===
When I create a socket using accept() and make a FILE out of it using fdopen(), what do I have to do to clean everything up? Do I need to do fclose() on the FILE, shutdown() and close() on the socket, or only the shutdown() and or close() or fclose()? If I don't do fclose(), do I have to free() the FILE pointer manually? | 0 | [
2,
4239,
118,
20254,
68,
71,
13,
7,
21049,
7,
3893,
121,
8741,
248,
18,
13,
118,
18482,
18,
9,
800,
3726,
3726,
76,
31,
1600,
21,
18482,
568,
3440,
5,
6,
17,
233,
21,
3893,
70,
16,
32,
568,
398,
43,
10157,
5,
6,
15,
98,
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... |
Whats the best Ribbon UI control to retro fit to a legacy MFC application build with VC2005?
===
What expirence have you had with introducing a Ribbon style control to legacy MFC applications?
I know it exists in the new VC2008 Feature Pack, but changing compilers from VC2005 is a big deal for our source base and integration to our environment, Intel FORTRAN, ClearCase, many 3rd libraries.
There are quiet a few different commerical implementations, most focusing on C#/VB .NET, and only a few for native C++ MFC.
I have read all the usual reviews found by Google most are quiet old now, so I am interested to here from people who have actually done it, been through the pain barrier, released a legacy application with VC2005 and a Ribbon UI.
We currently use a very old version of Stingray Objective Toolkit to provide our MFC extensions like customizable toolbars and docking windows etc. | 0 | [
2,
98,
18,
14,
246,
9162,
13,
5661,
569,
20,
13534,
2742,
20,
21,
7780,
307,
7061,
3010,
1895,
29,
13,
8990,
2835,
60,
800,
3726,
3726,
98,
25910,
6175,
57,
42,
41,
29,
11442,
21,
9162,
1034,
569,
20,
7780,
307,
7061,
3767,
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... |
MOSS 2007: BDC permisson problem - no BDC application is listed in the web part's configuration menu
===
I'm actually working at MOSS 2007 project where I have to import data from an external data source (WebService) via an application in the Business Data Catalog. The application definition was created with BDC Meta Man and was imported successfully into the Business Data Catalog without any errors.
I've first tested the external data source through the option "Edit profile page template" where a BDC-Webpart is already located on a site. In the preferences menu of the web part I could selected the new BDC application with the "Typ"-Picker and everything works fine.
Unfortunately it doesn't work with BDC web parts on other MOSS applications which uses the same SSP. Every time I placed a BDC web part on a site and try to configure it. The "Typ"-Picker in the web part's menu remains empty and no application from BDC is listed.
I then checked the permission settings in the BDC menu of the SSP where I experimentally granted all rights to every user account so I could see if it was permission problem. Unfortunately it didn't change anything and the BDC application is still not visible in the "Typ"-Picker.
So perhaps someone had a similar problem and know what the problem is!
Bye,
Flo | 0 | [
2,
8188,
16025,
334,
7201,
416,
7292,
218,
1448,
13,
8,
90,
334,
7201,
3010,
25,
1510,
19,
14,
2741,
141,
22,
18,
8091,
11379,
800,
3726,
3726,
31,
22,
79,
1121,
638,
35,
8188,
624,
669,
113,
31,
57,
20,
9010,
1054,
37,
40,
48... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you diagnose a leak in C memory caused by a Java program?
===
I'm working on a large application (300K LOC) that is causing a memory leak in the Sun 1.6 JVM (1.6_05). Profiling the Java shows no leak. Are there any diagnostics available from the JVM that might detect the cause of the leak?
I haven't been able to create a simple, isolated Java test case. Is the only way to figure this out by using a C heap analyzer on the JVM?
The application creates a pool of sockets and does a significant amount of network I/O.
| 0 | [
2,
184,
107,
42,
28438,
21,
11724,
19,
272,
1912,
1497,
34,
21,
8247,
625,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
370,
3010,
13,
5,
6571,
197,
13,
10799,
6,
30,
25,
3242,
21,
1912,
11724,
19,
14,
939,
137,
9,
379,
487... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
struts action controller - multithreaded?
===
when they say the action controller in the struts framework is multi threaded, does it mean that there are multiple instances of the servlet taking the request and forwarding it to the model. OR does it mean that there is one single instance taking all the requests? Any visuals will be appreciated | 0 | [
2,
18316,
18,
1028,
9919,
13,
8,
1889,
96,
10647,
69,
60,
800,
3726,
3726,
76,
59,
395,
14,
1028,
9919,
19,
14,
18316,
18,
6596,
25,
1889,
9322,
69,
15,
630,
32,
884,
30,
80,
50,
1886,
13946,
16,
14,
13,
10321,
1336,
741,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best way to track and submit a timesheet?
===
I work for a small-ish company, 70 people or so, 10 of us are developers. Every month we submit a timesheet tracking the hours spent on the projects we're involved in. Because we leave this until the last minute, we spent up to an hour going through our daily svn commits to reconstruct the hours spent.
This is clearly a waste of time, I'd be interested to hear of a "system" that works in other organizations. Maybe it's just a case of being disciplined to complete a paper timesheet every day, but I'd prefer something electronic and unobtrusive.
| 2 | [
2,
98,
22,
18,
14,
246,
161,
20,
792,
17,
12298,
21,
85,
17627,
60,
800,
3726,
3726,
31,
170,
26,
21,
284,
8,
1595,
237,
15,
3201,
148,
54,
86,
15,
332,
16,
182,
50,
10168,
9,
352,
1617,
95,
12298,
21,
85,
17627,
10353,
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... |
Are there any High Level, easy to install GUI libraries for Common Lisp?
===
Are there any good, cross platform (SBCL and CLISP at the very least) easy to install GUI libraries? | 0 | [
2,
50,
80,
186,
183,
662,
15,
2010,
20,
16146,
9457,
8649,
26,
757,
2093,
3401,
60,
800,
3726,
3726,
50,
80,
186,
254,
15,
919,
2452,
13,
5,
18,
220,
5316,
17,
19391,
3401,
35,
14,
253,
639,
6,
2010,
20,
16146,
9457,
8649,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do you convince your boss not to jump on every hype?
===
Guess you know what I mean? Your boss read this article about a certain shiny new and fancy technique like e.g. Ajax and is now an expert in everything related to it. He now wants to use this cool new thing on nearly everything.. What now? How do you avoid this kind of stuff? | 0 | [
2,
184,
107,
42,
6218,
154,
4054,
52,
20,
3936,
27,
352,
29278,
60,
800,
3726,
3726,
2321,
42,
143,
98,
31,
884,
60,
154,
4054,
1302,
48,
2002,
88,
21,
1200,
13091,
78,
17,
12251,
4873,
101,
13,
62,
9,
263,
9,
20624,
17,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best practices for detecting DOS (denial of service) attacks?
===
I am looking for best practices for detecting and preventing DOS in the service implementation (not external network monitoring). The service handles queries for user, group and attribute information.
What is your favorite source of information on dealing with DOS?
| 0 | [
2,
246,
5242,
26,
9092,
68,
107,
18,
13,
5,
817,
2815,
16,
365,
6,
3080,
60,
800,
3726,
3726,
31,
589,
699,
26,
246,
5242,
26,
9092,
68,
17,
11520,
107,
18,
19,
14,
365,
6123,
13,
5,
1270,
4886,
982,
8984,
6,
9,
14,
365,
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... |
Disabling single line copy in Visual Studio
===
Is there anyway to disable the rather annoying feature that Visual Studio (2008 in my case) has of copying the line the cursor is on when CTRL-C is pressed and no selection is made?
I know of the option to disable copying blank lines. But this is driving me crazy as well. | 0 | [
2,
1460,
58,
8599,
345,
293,
4344,
19,
3458,
1120,
800,
3726,
3726,
25,
80,
2774,
20,
1460,
579,
14,
864,
17610,
1580,
30,
3458,
1120,
13,
5,
2753,
19,
51,
610,
6,
63,
16,
4344,
68,
14,
293,
14,
29588,
25,
27,
76,
13,
4812,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does VxWorks deal with priority inheritance?
===
We have 3 tasks running at different priorities: A (120), B (110), C (100).
A takes a mutex semaphore with the Inversion Safe flag.
Task B does a semTake, which causes Task A's priority to be elevated to 110.
Later, task C does a semTake. Task A's priority is now 100.
At this point, A releases the semaphore and C grabs it.
We notice that A's priority did not go back down to its original priority of 120.
Shouldn't A's priority be restored right away?
Note: I have the answer, I will be posting it shortly, feel free to answer as yours might be better than mine but please don't be offended by this population of the SO knowledgebase. | 0 | [
2,
184,
630,
566,
396,
7684,
1183,
29,
9857,
13852,
60,
800,
3726,
3726,
95,
57,
203,
8674,
946,
35,
421,
20872,
45,
21,
13,
5,
12054,
6,
15,
334,
13,
5,
11472,
6,
15,
272,
13,
5,
4031,
6,
9,
21,
1384,
21,
20562,
396,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I convert a System.Type to it's nullable version?
===
Once again one of those: "Is there an easier built-in way of doing things instead of my helper method?"
So it's easy to get the underlying type from a nullable type, but how do I get the nullable version of a .NET type?
So I have
typeof(int)
typeof(DateTime)
System.Type t = something;
and I want
int?
DateTime?
or
Nullable<int> (which is the same)
if t is primitive then Nullable<T> else just T
Any suggestions? (Is there something built in.)
Thanks in advance. | 0 | [
2,
184,
107,
31,
8406,
21,
329,
9,
4474,
20,
32,
22,
18,
16203,
579,
615,
60,
800,
3726,
3726,
382,
188,
53,
16,
273,
45,
13,
7,
403,
80,
40,
4950,
392,
8,
108,
161,
16,
845,
564,
700,
16,
51,
448,
106,
2109,
60,
7,
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... |
MEF vs IoC/DI
===
What problems does MEF (Microsoft Extensibility Framework) solves that cannot be solved by existing IoC/DI containers? | 0 | [
2,
55,
410,
4611,
31,
2499,
118,
1115,
800,
3726,
3726,
98,
1716,
630,
55,
410,
13,
5,
22019,
12980,
1396,
8710,
14264,
6596,
6,
8402,
18,
30,
1967,
44,
15091,
34,
3149,
31,
2499,
118,
1115,
18988,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
InstallShiled: FilterProperty column of ISComponentExtended table?
===
Anybody has an idea what this custom table is used for and what is the meaning of this column in particular? Documentation is silent about it and the info on the Net is scarce. | 0 | [
2,
16146,
3528,
1294,
45,
11945,
10890,
106,
1084,
4698,
16,
25,
11103,
218,
2291,
25138,
859,
60,
800,
3726,
3726,
11181,
63,
40,
882,
98,
48,
5816,
859,
25,
147,
26,
17,
98,
25,
14,
1813,
16,
48,
4698,
19,
1498,
60,
13945,
25,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0... |
What is the bast way to replace browse button in html?
===
I know that it's possible to replace browse button, which is generated in html, when you use input tag with type="file".
I'm not sure what is the best way, so if someone have experience with these please contribute. | 0 | [
2,
98,
25,
14,
16198,
161,
20,
3934,
10175,
62,
5167,
19,
13,
15895,
60,
800,
3726,
3726,
31,
143,
30,
32,
22,
18,
938,
20,
3934,
10175,
62,
5167,
15,
56,
25,
6756,
19,
13,
15895,
15,
76,
42,
275,
6367,
3383,
29,
1001,
3726,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 convince your boss to jump on the right hypes?
===
You read the best blogs, follow the new trends and, from time to time, you find something that is worth trying. You try it. You like it. You know it's a good idea. You want to adopt it.
But your boss doesn't even know about the new thing because he only reads those mainstream slow-to-catch-up magazines. You are sure that you found a good thing, but it won't even get into his radar and anything that doesn't get into his radar "is just another hype". How do you make him notice the new thing? | 0 | [
2,
184,
107,
42,
6218,
154,
4054,
20,
3936,
27,
14,
193,
29278,
18,
60,
800,
3726,
3726,
42,
1302,
14,
246,
8146,
18,
15,
1740,
14,
78,
14947,
17,
15,
37,
85,
20,
85,
15,
42,
477,
301,
30,
25,
2715,
749,
9,
42,
1131,
32,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I take a slice of a list (A sublist) in scheme?
===
Given a list, how would I select a new list, containing a slice of the original list (Given offset and number of elements) ? | 0 | [
2,
184,
107,
31,
247,
21,
12982,
16,
21,
968,
13,
5,
58,
972,
5739,
6,
19,
4276,
60,
800,
3726,
3726,
504,
21,
968,
15,
184,
83,
31,
5407,
21,
78,
968,
15,
3503,
21,
12982,
16,
14,
501,
968,
13,
5,
8448,
103,
17493,
17,
23... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Hibernate 3: unable to query PostgreSQL database
===
I am setting up a project using Hibernate 3.3.1 GA and PostgreSQL 8.3. I've just created a database, the first table, added one row there and now configuring Hibernate.
However, even the simplest query:
Criteria criteria = session.createCriteria(Place.class);
List result = criteria.list();
could not be executed (empty list is returned though there is one record in the database). I looked to the PostgreSQL logs and could see:
2008-09-17 22:52:59 CEST LOG: connection received: host=192.168.175.1 port=2670
2008-09-17 22:52:59 CEST LOG: connection authorized: user=... database=...
2008-09-17 22:53:00 CEST LOG: execute <unnamed>: SHOW TRANSACTION ISOLATION LEVEL
2008-09-17 22:53:02 CEST LOG: could not receive data from client: Connection reset by peer
2008-09-17 22:53:02 CEST LOG: unexpected EOF on client connection
2008-09-17 22:53:02 CEST LOG: disconnection: session time: 0:00:03.011 user=... database=... host=192.168.175.1 port=2670
I wrote a simple program using plain JDBC to fetch the same data and it worked. PostgreSQL logs in this case look like this (for comparison):
2008-09-17 22:52:24 CEST LOG: connection received: host=192.168.175.1 port=2668
2008-09-17 22:52:24 CEST LOG: connection authorized: user=... database=...
2008-09-17 22:52:25 CEST LOG: execute <unnamed>: SELECT * from PLACE
2008-09-17 22:52:25 CEST LOG: disconnection: session time: 0:00:00.456 user=... database=... host=192.168.175.1 port=2668
Hibernate debug log does not indicate any errors. If I take the query listed in the logs:
<pre>
15:17:01,859 DEBUG org.hibernate.loader.entity.EntityLoader: Static select for entity com.example.data.Place: select place0_.ID as ID0_0_, place0_.NAME as NAME0_0_, place0_.LATITUDE as LATITUDE0_0_, place0_.LONGITUDE as LONGITUDE0_0_ from PLACE place0_ where place0_.ID=?
</pre>
and execute it agains the database in the psql, it works (this means that Hibernate has generated a proper SQL).
Googling for "unexpected EOF" log entry was not friutful. Any ideas, community? | 0 | [
2,
4148,
2102,
8820,
2635,
2343,
20,
25597,
678,
6879,
18,
22402,
6018,
800,
3726,
3726,
31,
589,
2697,
71,
21,
669,
568,
4148,
2102,
8820,
203,
9,
240,
9,
165,
4369,
17,
678,
6879,
18,
22402,
469,
9,
240,
9,
31,
22,
195,
114,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 prevent SIGPIPEs (or handle them properly).
===
I have a small server program that accepts connections on a TCP or local UNIX socket, reads a simple command and, depending on the command, sends a reply. The problem is that the client may have no interest in the answer sometimes and exits early, so writing to that socket will cause a SIGPIPE and make my server crash. What's the best practice to prevent the crash here? Is there a way to check if the other side of the line is still reading? (select() doesn't seem to work here as it always says the socket is writable). Or should I just catch the SIGPIPE with a handler and ignore it? | 0 | [
2,
184,
20,
2501,
8858,
15185,
18,
13,
5,
248,
3053,
105,
7428,
6,
9,
800,
3726,
3726,
31,
57,
21,
284,
8128,
625,
30,
16548,
6760,
27,
21,
13,
38,
7439,
54,
375,
22540,
18482,
15,
11137,
21,
1935,
1202,
17,
15,
4758,
27,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Many to many relationships in Django
===
class Tag(models.Model):
name = models.CharField(maxlength=100)
class Blog(models.Model):
name = models.CharField(maxlength=100)
tags = models.ManyToManyField(Tag)
Simple models just to ask my question.
I wonder how can i query blogs using tags in two different ways.
- Blog entries that are tagged with "tag1" or "tag2":
`Blog.objects.filter(tags_in=[1,2]).distinct()`
- Blog objects that are tagged with exactly both "tag1" and "tag2" : This is what i could not figure out
| 0 | [
2,
151,
20,
151,
5833,
19,
3857,
14541,
800,
3726,
3726,
718,
3383,
5,
13998,
18,
9,
13998,
6,
45,
204,
800,
2761,
9,
5433,
1109,
5,
8304,
6325,
3726,
4031,
6,
718,
8146,
5,
13998,
18,
9,
13998,
6,
45,
204,
800,
2761,
9,
5433,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way to extract a timezone from a mail Date header in Java?
===
I need to store the timezone an email was sent from. Which is the best way to extract it from the email's 'Date:' header (an RFC822 date)? And what is the recommended format to store it in the database (I'm using hibernate)? | 0 | [
2,
246,
161,
20,
10962,
21,
85,
11661,
37,
21,
4216,
1231,
157,
106,
19,
8247,
60,
800,
3726,
3726,
31,
376,
20,
1718,
14,
85,
11661,
40,
8517,
23,
795,
37,
9,
56,
25,
14,
246,
161,
20,
10962,
32,
37,
14,
8517,
22,
18,
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... |
Common Lisp or Scheme?
===
Which would you recommend learning, CL or Scheme? What are the pros and cons of each, compared to eachother? | 4 | [
2,
757,
2093,
3401,
54,
4276,
60,
800,
3726,
3726,
56,
83,
42,
12360,
2477,
15,
10842,
54,
4276,
60,
98,
50,
14,
895,
18,
17,
11608,
16,
206,
15,
2428,
20,
206,
9539,
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 do I make an HTML text box show a hint when empty?
===
I want the search box on my web page to display the word "Search" in gray italics. When the box receives focus, it should look just like an empty text box. If there is already text in it, it should display the text normally (black, non-italics). This will help me avoid clutter by removing the label.
BTW, this is an on-page AJAX search, so it has no button. | 0 | [
2,
184,
107,
31,
233,
40,
13,
15895,
1854,
1649,
298,
21,
6382,
76,
2424,
60,
800,
3726,
3726,
31,
259,
14,
2122,
1649,
27,
51,
2741,
2478,
20,
3042,
14,
833,
13,
7,
25136,
7,
19,
2030,
21620,
9,
76,
14,
1649,
8359,
1776,
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 could be the causes of "permission denied" for tty1?
===
On my VPS server (Fedora 9), mingetty keeps respawning itself because of a "permission denied" error on tty[1-6], even though:
<pre>
root# ls -la /dev/tty1
crw------- 1 root root 4, 1 Sep 19 14:22 /dev/tty1
</pre>
Even weirder, this doesn't work:
<pre>
root# cat </dev/tty1
bash: /dev/tty1: Permission denied
</pre>
I am guessing this has something to do with the VM host, but both my VPS provider and I are out of ideas, and so is Google... Any clue as to why root cannot access a character device with root rw privileges?
| 0 | [
2,
98,
110,
44,
14,
4047,
16,
13,
7,
1432,
12385,
5265,
7,
26,
13,
12007,
165,
60,
800,
3726,
3726,
27,
51,
13,
10924,
18,
8128,
13,
5,
3739,
12578,
561,
6,
15,
12069,
3317,
93,
8968,
302,
22860,
68,
1145,
185,
16,
21,
13,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Booting order with SATA disks and "Dynamic Partitions"
===
Some time ago (the last time I had to care about this was a few years back), booting a PC worked kind of like this:
- There was an ORDER to disks (primary Master, primary slave, secondary master & slave)
- The PC would take them in order, and look for an "active partition" (which was set with FDISK)
- It'd boot from the first active partition it could found.
Now this is not how it works anymore, and I'm completely clueless about it (and this time, I do need to understand it)
I currently have 4 SATA disks (no masters, slaves, or priorities of any kind)
Inside, they are Windows 2003 "dynamic disks" (whatever that's supposed to mean), and have partitions, one of them Windows "knows" is the booting one, but i'm not sure it's the same as the good old active partition.
My situation is the following:
1. My C drive has started failing. It kinda works, just not all the time. I really need to get this fixed without reinstalling Windows, I can't afford the huge time loss that'd mean.
2. I bought a new drive to replace it, plugged it in next to the existing one, and made a mirror of the C partition on the new drive.
3. So, in this new drive, I have an EXACT bit-by-bit copy of the original C partition, right? Or am I missing something?
4. Also, if I unplug the old drive, and plug this new one in the same cable as the broken one, it should boot, right?
Now, I know it's not that simple, because it doesn't really boot.
I'm obviously missing some step, which in the old days would be setting the new disk as master, and the new mirrored partition as "active", but I have no idea how to do this.
I've tried a few things with the recovery CD (fixmbr, fixboot), but my general impression is that it's not working because it's not finding something it's looking for. (for example, i can't go through the disks and look at their contents, and things like that)
Any ideas?
I'm extremely desperate here, I need to get my machine running on the new disk ASAP.
Thanks!! | 0 | [
2,
6801,
68,
389,
29,
847,
58,
8582,
18,
17,
13,
7,
20985,
10711,
18,
7,
800,
3726,
3726,
109,
85,
1464,
13,
5,
124,
236,
85,
31,
41,
20,
781,
88,
48,
23,
21,
310,
122,
97,
6,
15,
6801,
68,
21,
5168,
577,
825,
16,
101,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subclassed form not behaving properly in Designer view (VS 2008)
===
I have subclassed `Form` to include some extra functionality, which boils down to a `List<Image>` which displays in a set of predefined spots on the form. I have the following:
public class ButtonForm : Form
{
public class TitleButton
{
public TitleButton() { /* does stuff here */ }
// there's other stuff too, just thought I should point out there's
// a default constructor.
}
private List<TitleButton> _buttons = new List<TitleButton>();
public List<TitleButton> TitleButtons
{
get { return _buttons; }
set { _buttons = value; }
}
// Other stuff here
}
Then my actual form that I want to use is a subclass of `ButtonForm` instead of `Form`. This all works great, Designer even picks up the new property and shows it up on the property list. I thought this would be great! It showed the collection, I could add the buttons into there and away I would go. So I opened the collection editor, added in all the objects, and lo and behold, there sitting in the designer was a picture perfect view of what I wanted.
This is where it starts to get ugly. For some reason or another, Designer refuses to actually generate code to create the objects and attach them to the collection, so while it looks great in Design mode, as soon as I compile and run it, it all disappears again and I'm back to square one. I'm at a total loss as to why this would happen; if the Designer can generate it well enough to get a picture perfect view of my form with the extra behaviour, why can't/won't it generate the code into the actual code file? | 0 | [
2,
972,
1898,
69,
505,
52,
44,
13693,
7428,
19,
4742,
1418,
13,
5,
710,
18,
570,
6,
800,
3726,
3726,
31,
57,
972,
1898,
69,
13,
1,
4190,
1,
20,
468,
109,
2230,
18548,
15,
56,
22941,
18,
125,
20,
21,
13,
1,
5739,
1,
22039,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should a novice programmer spend time learning to write "desktop" applications these days, or is the web where it's at?
===
As a novice, I've spent time learning a smattering of C and a fair bit of PHP. I've looked at writing desktop applications for Windows, but there seems to be a fair barrier to entry due to complexity of APIs. Is it worth learning this, or will native applications become less common in the future?
The way I see it, the only desktop application I ever use is a web browser and a text editor as well as the obviously the OS itself. Everything I need is online now.
Is learning to write non-web applications a useful skill going forwards? If so, what should I learn? | 0 | [
2,
378,
21,
21999,
17968,
3256,
85,
2477,
20,
2757,
13,
7,
3196,
197,
3880,
7,
3767,
158,
509,
15,
54,
25,
14,
2741,
113,
32,
22,
18,
35,
60,
800,
3726,
3726,
28,
21,
21999,
15,
31,
22,
195,
1111,
85,
2477,
21,
13,
18,
24700... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 play a sound in Actionscript 3 that is not in the same directory as the SWF?
===
I have a project with a bunch of external sounds to a SWF. I want to play them, but any time I attempt load a new URL into the sound object it fails with either "Error #2068: Invalid Sound" or raises an ioError with "Error #2032 Stream Error".
// Tried with path prefixed with "http://.." "file://.." "//.." and "..")
var path:String = "http://../assets/the_song.mp3";
var url:URLRequest = new URLRequest( path );
var sound:Sound = new Sound();
sound.addEventListener( IOErrorEvent.IO_ERROR, ioErrorHandler);
sound.addEventListener( SecurityErrorEvent.SECURITY_ERROR, secHandler);
sound.load(url);
| 0 | [
2,
184,
20,
418,
21,
646,
19,
1028,
8741,
203,
30,
25,
52,
19,
14,
205,
16755,
28,
14,
13,
18,
15263,
60,
800,
3726,
3726,
31,
57,
21,
669,
29,
21,
7653,
16,
4886,
2795,
20,
21,
13,
18,
15263,
9,
31,
259,
20,
418,
105,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.