unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Toggle a CSS property in nested elements
===
Without using Javascript, is there a way to make a CSS property toggle on and off through nested elements.
The problem I'm trying to solve is that I have a number of tags and classes which make some text italic (`<em>`, `<blockquote>`, `<cite>`, `<q>`, `<dfn>`, and some other classes), and when one of these is inside another one of these, the italicisation needs to toggle.
<pre>
<blockquote>
And so the man said, <q>That's not from <cite>Catcher In The Rye</cite>, dear
fellow!</q>, can you believe that?!
</blockquote>
</pre>
Should render as:
> *And so the man said,* "That's not from *Catcher In The Rye*, dear fellow!"*, can you believe that?!*
The CSS I've got for this is getting a bit messy:
q, em, dfn, cite, blockquote {
font-style: italic;
}
q q, q em, q dfn, q cite,
em q, em em, em dfn, em cite,
dfn q, dfn em, dfn dfn, dfn cite,
cite q, cite em, cite dfn, cite cite,
blockquote q, blockquote em, blockquote dfn, blockquote cite {
font-style: normal;
}
...and I'm pretty sure that won't even work past one level of nesting (as in my example).
Is there a way I can do this without have to list every permutation of the tags? | 0 | [
2,
20,
263,
4875,
21,
272,
18,
18,
1354,
19,
5618,
69,
2065,
800,
3726,
3726,
366,
568,
8247,
8741,
15,
25,
80,
21,
161,
20,
233,
21,
272,
18,
18,
1354,
20,
263,
4875,
27,
17,
168,
120,
5618,
69,
2065,
9,
14,
1448,
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... |
Is it common to have no control over your work computer?
===
I posted a comment on /. the other day, and somebody responded with something along the lines that people may be browsing at work where they have no control over which browser they are using.
This struck me as kind of odd, as at work, I'm allowed to install whichever software I want, so long as there is nothing without proper licensing. Maybe I'm just part of the minority, because I work for a small company, and I'm a web developer, so installing lots of different pieces of software is part of my job. However, even when I worked for the government, I never had a computer so locked down that I couldn't install the web browser of my choice on it, and I've never seen a policy which would want to stop me from doing so.
Is is common for computer professionals (which I imagine a large number of /. users are), to have absolutely no control over the software running on their computer, the software they need to get their job done well and efficiently? I could understand for office secretaries and stuff, who would be more likely to install screen savers and smileys (aka viruses), but for computer professionals, it just seems like completely over the top.
What are your experiences with restrictions of what can be installed on your work computer? | 0 | [
2,
25,
32,
757,
20,
57,
90,
569,
84,
154,
170,
1428,
60,
800,
3726,
3726,
31,
6054,
21,
6484,
27,
13,
118,
9,
14,
89,
208,
15,
17,
8861,
4567,
29,
301,
303,
14,
1560,
30,
148,
123,
44,
10175,
68,
35,
170,
113,
59,
57,
90,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I capture modifier keys while starting a Delphi app to force some behavior
===
I'm writing an application in Delphi which uses an SQLite3 database. I'd like to be able to start the application while holding some modifier keys, such as CTRL + SHIFT, to signal reinitialization of the database.
How can I capture that the application was started while these keys were held?
| 0 | [
2,
184,
92,
31,
3683,
7226,
16292,
5534,
133,
1422,
21,
23030,
4865,
20,
558,
109,
3257,
800,
3726,
3726,
31,
22,
79,
1174,
40,
3010,
19,
23030,
56,
2027,
40,
4444,
10601,
240,
6018,
9,
31,
22,
43,
101,
20,
44,
777,
20,
799,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PHP Dynamic Pagination Without SQL
===
I've got a script that dynamically calls and displays images from a directory, what would be the best way to paginate this? I'd like to be able to control the number of images that are displayed per page through a variable within the script. I'm thinking of using URL varriables (ie - http://domain.com/page.php?page=1) but am unsure how to go about this.
Thanks for the help. | 0 | [
2,
13,
26120,
7782,
19006,
108,
857,
366,
4444,
255,
800,
3726,
3726,
31,
22,
195,
330,
21,
3884,
30,
7782,
1326,
3029,
17,
9412,
3502,
37,
21,
16755,
15,
98,
83,
44,
14,
246,
161,
20,
19006,
17939,
48,
60,
31,
22,
43,
101,
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... |
Hooking up GUI interface with asynchronous (s)ftp operation
===
Trying to implement a progress dialog window for file uploads that look like a cross between <a href="http://www.codinghorror.com/blog/images/ie6-download-ui.png">IE download dialog</a> and <a href="http://www.codinghorror.com/blog/images/firefox2-download-ui.png">Firefox download dialog</a> with a python GUI library on Windows.
1. What asynchronous (S)FTP libraries are there for python? Ideally I should be able to do file upload resumes and track the progress of each parallel file uploads.
2. If I'm running each file upload in a separate process each, how would I get the upload status and display it in a progress bar dialog? | 0 | [
2,
5559,
68,
71,
9457,
6573,
29,
21,
16023,
1291,
13,
5,
18,
6,
3072,
306,
1453,
800,
3726,
3726,
749,
20,
8713,
21,
3455,
28223,
1463,
26,
3893,
71,
8294,
18,
30,
361,
101,
21,
919,
128,
13,
1,
58,
746,
14057,
3726,
7,
21127,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
List of ip addresses/hostnames from local network in python
===
How can i get a list of the ip address or host names from a local network easily in python?
It would be best if it was multi-platform, but it needs to work on OS X first, then others follow. | 0 | [
2,
968,
16,
15735,
12636,
118,
11694,
7259,
18,
37,
375,
982,
19,
20059,
800,
3726,
3726,
184,
92,
31,
164,
21,
968,
16,
14,
15735,
3218,
54,
2015,
1817,
37,
21,
375,
982,
2351,
19,
20059,
60,
32,
83,
44,
246,
100,
32,
23,
188... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Microsoft alternative to Jabber?
===
My organization is considering using Jabber as an agnostic device to device to application messaging protocol.
Does anyone know of the best practice existing Microsoft competitor to Jabber? Or, an emerging competitor? And, if so, a good URL reference to get a jump start?
Website for Jabber:
http://www.jabber.org/web/Main_Page
| 0 | [
2,
7099,
2676,
20,
11284,
2102,
60,
800,
3726,
3726,
51,
1165,
25,
5154,
568,
11284,
2102,
28,
40,
21,
21944,
3646,
20,
3646,
20,
3010,
26437,
8494,
9,
630,
1276,
143,
16,
14,
246,
1345,
3149,
7099,
13638,
20,
11284,
2102,
60,
54,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Real world cost to run WinForm apps on mono?
===
My company has an existing established WinForm application which in running on WinXP. The application does alot of sound processing using DirectSound.
My company would like to evaluate Mono, as an alternative on a per workstation cost to Vista/Win Server 2008.
I've heard that different estimates, ranging from 'it will work easily on Mono' to 'it could take months of recoding in certain cases to get a WinForm app to run with Mono on Linux'.
Does anyone have a good real world experience with this?
A good link reference?
I would like to get a better idea before I commit to testing. | 0 | [
2,
683,
126,
1516,
20,
485,
628,
4190,
4865,
18,
27,
4129,
60,
800,
3726,
3726,
51,
237,
63,
40,
3149,
613,
628,
4190,
3010,
56,
19,
946,
27,
628,
396,
306,
9,
14,
3010,
630,
21,
5639,
16,
646,
5511,
568,
1744,
8489,
9,
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... |
Regex Help
===
I've created the following regex pattern in an attempt to match a string 6 characters in length ending in either "PRI" or "SEC", unless the string = "SIGSEC". For example, I want to match ABCPRI, XYZPRI, ABCSEC and XYZSEC, but not SIGSEC.
(\w{3}PRI$|[^SIG].*SEC$)
It is very close and sort of works (if I pass in "SINSEC", it returns a partial match on "NSEC"), but I don't have a good feeling about it in its current form. Also, I may have a need to add more exclusions besides "SIG" later and realize that this probably won't scale too well. Any ideas?
BTW, I'm using System.Text.RegularExpressions.Regex.Match() in C#
Thanks,
Rich
| 0 | [
2,
7953,
1706,
448,
800,
3726,
3726,
31,
22,
195,
679,
14,
249,
7953,
1706,
3732,
19,
40,
1735,
20,
730,
21,
3724,
400,
1766,
19,
1476,
3119,
19,
694,
13,
7,
6944,
7,
54,
13,
7,
14332,
7,
15,
4003,
14,
3724,
800,
13,
7,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
firefox 3 favicons - how to make them?
===
i noticed that paypal displays a very different favicon,
one that's not just a simple 16x16 icon and is lengthy?
anyone can teach me? | 0 | [
2,
535,
18219,
203,
398,
5271,
12124,
13,
8,
184,
20,
233,
105,
60,
800,
3726,
3726,
31,
2711,
30,
1372,
6720,
9412,
21,
253,
421,
1399,
6199,
218,
15,
53,
30,
22,
18,
52,
114,
21,
1935,
347,
396,
1091,
9801,
17,
25,
13885,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Where next, after Haskell?
===
I tend to have a stereotype of Haskell as the most "advanced" (high-level, sophisticated, powerful, abstract) language. One which has lots of weird features that, if I could grasp them, would make me a super-hero programmer.
But what comes *after* Haskell? What languages and new kinds of abstraction are being invented now in academia which make even Haskell look like Blub? | 4 | [
2,
113,
328,
15,
75,
63,
16507,
60,
800,
3726,
3726,
31,
5480,
20,
57,
21,
18296,
16,
63,
16507,
28,
14,
127,
13,
7,
1283,
2686,
11014,
7,
13,
5,
4542,
8,
3906,
15,
13388,
15,
2177,
15,
8502,
6,
816,
9,
53,
56,
63,
7503,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Code Coverage Analysis for Embedded C++ projects
===
I have recently started working on a very large C++ project that, after completing 90% of the implementation, has determined that they need to demonstrate 100% branch coverage during testing. The project is hosted on an embedded platform (Green Hills Integrity). I'm looking for suggestions and experiences from others on StackOverflow that have used code coverage products in similar environments. I'm interested in both positive and negative comments regarding these types of tools. | 0 | [
2,
1797,
5245,
2495,
26,
12138,
272,
20512,
2314,
800,
3726,
3726,
31,
57,
1989,
373,
638,
27,
21,
253,
370,
272,
20512,
669,
30,
15,
75,
6869,
16370,
16,
14,
6123,
15,
63,
2734,
30,
59,
376,
20,
10847,
12849,
1686,
5245,
112,
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... |
How to get the Silverlight XAP copied to the clientbin on build
===
I am just getting started with Silverlight and have recently added a Silverlight project to an established solution. In this particular scenario my solution included an existing ASP.NET web site (not application) which Visual Studio kindly offered to integrated my Silverlight application into, which I accepted.
So everything is fine and all, and the Silverlight XAP is being copied to the web site's ClientBin directory. Now I have decided to start a new ASP.NET MVC web application that will eventually replace the older (non-MVC) web site. But I cannot for the life of me figure out what Visual Studio modified to get the XAP to automatically appear in the web site's ClientBin on build, so that I can reproduce that on my MVC site.
So my question is essential, what are the manually steps for getting Visual Studio to autocopy a Silverlight application's XAP to a newly added ASP.NET MVC web application? | 0 | [
2,
184,
20,
164,
14,
1172,
3130,
993,
2552,
18225,
20,
14,
6819,
4772,
27,
1895,
800,
3726,
3726,
31,
589,
114,
1017,
373,
29,
1172,
3130,
17,
57,
1989,
905,
21,
1172,
3130,
669,
20,
40,
613,
4295,
9,
19,
48,
1498,
12705,
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 is the difference between "mvn deploy" to a local repo and "mvn install"?
===
My team uses an internal team maven repo that is shared from a development server using Apache. We also run the Continuum CI server on the same machine. Maven builds in Continuum are run with the "install" goal, which copies the final artifact directly into the shared directory.
The question is, what is the difference between adding files to the shared repo using mvn install and using the deploy goal (mvn-deploy plugin)?
It seems to me that using mvn deploy creates additional configuration hassles, but I have read somewhere that installing files into a shared repo is a bad idea for some reason related to the internal workings of maven. | 0 | [
2,
98,
25,
14,
2841,
128,
13,
7,
79,
16578,
17617,
7,
20,
21,
375,
302,
1638,
17,
13,
7,
79,
16578,
16146,
7,
60,
800,
3726,
3726,
51,
173,
2027,
40,
3117,
173,
1216,
3124,
302,
1638,
30,
25,
2592,
37,
21,
522,
8128,
568,
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... |
Command/Powershell script to reset a network adapter
===
OS: Vista enterprise
When i switch between my home and office network, i always face issues with getting connected to the network. Almost always I have to use the diagnostic service in 'Network and sharing center' and the problem gets solved when i use the reset network adapter option.
This takes a lot of time (3-4 min) and so i was trying to find either a command or a powershell script/cmdlet which i can use directly to reset the network adapter and save myself these 5 mins every time i have to switch between the networks. Any pointers? | 0 | [
2,
1202,
118,
5484,
15984,
3884,
20,
23422,
21,
982,
9924,
106,
800,
3726,
3726,
13,
759,
45,
13520,
6002,
76,
31,
5521,
128,
51,
213,
17,
488,
982,
15,
31,
550,
276,
1549,
29,
1017,
2587,
20,
14,
982,
9,
557,
550,
31,
57,
20,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does C++ still matter?
===
I am a CS student currently learning C. I'd like to get into low level programming, whether as a hobby or career and may contribute to some open source projects down the line. So far I really enjoy C and think I will continue down the abstraction level and take ASM next semester.
The question I have is this, is knowing C enough to be a complete programmer at this level (meaning closer to the machine than managed languages like C#, Java and all the scripting languages) or is it really needed to know C++ as well.
Also, considering that I will have the fundamentals of C and a strong background in OOP with java and php how much of a leap is being a decent C++ programmer and is it worth it. | 0 | [
2,
630,
272,
20512,
174,
1161,
60,
800,
3726,
3726,
31,
589,
21,
272,
18,
1209,
871,
2477,
272,
9,
31,
22,
43,
101,
20,
164,
77,
708,
662,
3143,
15,
1472,
28,
21,
18229,
54,
545,
17,
123,
8606,
20,
109,
368,
1267,
2314,
125,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
extracting a parenthesized Python expression from a string
===
I've been wondering about how hard it would be to write some Python code to search a string for the index of a substring of the form `${`*expr*`}`, for example, where *expr* is meant to be a Python expression or something resembling one. Given such a thing, one could easily imagine going on to check the expression's syntax with `compile()`, evaluate it against a particular scope with `eval()`, and perhaps even substitute the result into the original string. People must do very similar things all the time.
I could imagine solving such a problem using a third-party parser generator [oof], or by hand-coding some sort of state machine [eek], or perhaps by convincing Python's own parser to do the heavy lifting somehow [hmm]. Maybe there's a third-party templating library somewhere that can be made to do exactly this. Maybe restricting the syntax of *expr* is likely to be a worthwhile compromise in terms of simplicity or execution time or cutting down on external dependencies -- for example, maybe all I really need is something that matches any *expr* that has balanced curly braces.
What's your sense? | 0 | [
2,
10962,
68,
21,
4766,
438,
6560,
20059,
1803,
37,
21,
3724,
800,
3726,
3726,
31,
22,
195,
74,
5712,
88,
184,
552,
32,
83,
44,
20,
2757,
109,
20059,
1797,
20,
2122,
21,
3724,
26,
14,
4348,
16,
21,
972,
11130,
16,
14,
505,
13,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to read from a memory mapped I/O port in .Net?
===
Can standard pointers in .Net do this? Or does one need to resort to P/invoke?
Note that I'm not talking about object references; I'm talking about actual C# pointers in unsafe code. | 0 | [
2,
184,
20,
1302,
37,
21,
1912,
20877,
31,
118,
111,
1295,
19,
13,
9,
2328,
60,
800,
3726,
3726,
92,
1236,
454,
445,
19,
13,
9,
2328,
107,
48,
60,
54,
630,
53,
376,
20,
4765,
20,
351,
118,
108,
2625,
1048,
60,
1945,
30,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best multiple file JavaScript / Flash file uploader?
===
Specifically, I'm looking for a client-side, JavaScript and / or Flash based multiple file uploader. The closest thing I've found is [FancyUpload](http://digitarald.de/project/fancyupload/). Anyone have experience with it? If not, what else is out there? | 0 | [
2,
98,
25,
14,
246,
1886,
3893,
8247,
8741,
13,
118,
4433,
3893,
71,
8294,
106,
60,
800,
3726,
3726,
3524,
15,
31,
22,
79,
699,
26,
21,
6819,
8,
1416,
15,
8247,
8741,
17,
13,
118,
54,
4433,
432,
1886,
3893,
71,
8294,
106,
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... |
Install [java library] in Eclipse
===
I just downloaded Eclipse several hours ago, and needed to add Java3D to the classpath. Installing it went without a hitch, but Eclipse can't seem to find the documentation folders so that it can give super-IDE functionality, such as autocomplete and method signatures.
While I know how I would add them individually, this lead me to the question; what is the "correct" way to install a Java library in Eclipse? Is there a special directory format I should follow? Is there a plugin that already did this for me? (The answer to that is <a href="http://java3d-eclipse.sourceforge.net/">yes</a>, but I don't know how to use it, or whether or not it's appropriate).
Thanks! | 0 | [
2,
16146,
636,
1004,
1385,
1248,
500,
19,
11652,
800,
3726,
3726,
31,
114,
23887,
11652,
238,
974,
1464,
15,
17,
851,
20,
3547,
8247,
240,
43,
20,
14,
718,
8353,
9,
25429,
32,
296,
366,
21,
16962,
15,
47,
11652,
92,
22,
38,
2260... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MonthCalendar control selection range with EnableVisualStyles?
===
I'm using the MonthCalendar control and want to programmatically select a date range. When I do so the control doesn't paint properly if `Application.EnableVisualStyles()` has been called. This is a known issue according to MSDN.
> Using the MonthCalendar with visual
> styles enabled will cause a selection
> range for the MonthCalendar control to
> not paint correctly
(from: http://msdn.microsoft.com/en-us/library/system.windows.forms.monthcalendar.aspx)
Is there really no fix for this other than not calling `EnableVisualStyles`? This seems to make that particular control entirely useless for a range of applications and a rather glaring oversight from my perspective. | 0 | [
2,
1617,
3430,
219,
2542,
569,
3155,
978,
29,
9240,
20893,
4381,
18,
60,
800,
3726,
3726,
31,
22,
79,
568,
14,
1617,
3430,
219,
2542,
569,
17,
259,
20,
625,
6732,
1326,
5407,
21,
1231,
978,
9,
76,
31,
107,
86,
14,
569,
1437,
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... |
SQL Query for Parent Child Relationship
===
I have db table with parent child relationship as:
NodeId NodeName ParentId
------------------------------
1 Node1 0
2 Node2 0
3 Node3 1
4 Node4 1
5 Node5 3
6 Node6 5
7 Node7 2
Here parentId = 0 means that it is a root level node. Now I want to write an SQL Query which will return child at all level of a parent category.
e.g. for nodeId = 1, it should return 3, 4, 5, 6.
I am using MS SQL Server 2005
| 0 | [
2,
4444,
255,
25597,
26,
4766,
850,
1429,
800,
3726,
3726,
31,
57,
13,
9007,
859,
29,
4766,
850,
1429,
28,
45,
15421,
1340,
15421,
7259,
4766,
1340,
13,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C++ Recursive Traversals with Function Pointers
===
template <class T>
void BT<T>::inOrder(void (*inOrderPtr)(T&))
{
inOrderPtr(inOrder(this->root));
}
template <class T>
void BT<T>::inOrder(Node<T>* root) const
{
if (root->left != NULL)
inOrder(root->left);
//something here
if (root->right != NULL)
inOrder(root->right);
}
Ok I am trying to create this Traversal via recursion. I actually posted this problem before but I was going about it wrong due to me having to use a function pointer. I don't understand what I'm suppose to do. I've got the public wrapper that calls on the private one... but the public one is the one with the function being passed in so what do I even do with it?? I feel retarded so even if someone were to give me a small hint I'm sure I'd get it. I just don't know where to go from here.
an example of a code that calls on it is this:
first.inOrder(print_val)
| 0 | [
2,
272,
20512,
302,
24244,
19501,
192,
18,
29,
1990,
454,
445,
800,
3726,
3726,
22894,
13,
1,
1898,
13,
38,
1,
11364,
334,
38,
1,
38,
1,
45,
45,
108,
7861,
5,
2625,
1340,
13,
5,
2483,
108,
7861,
4417,
139,
6,
5,
38,
1569,
6,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What type is the application file in a call to COMAdminCatalog.InstallApplication
===
Has anyone used COMAdminCatalog.InstallApplication to successfully install an application into COM+? If so what type of file to you need to pass as the bstrApplicationFile parameter?
| 0 | [
2,
98,
1001,
25,
14,
3010,
3893,
19,
21,
645,
20,
13987,
43,
2160,
9709,
5567,
9,
108,
21300,
2552,
20669,
800,
3726,
3726,
63,
1276,
147,
13987,
43,
2160,
9709,
5567,
9,
108,
21300,
2552,
20669,
20,
3673,
16146,
40,
3010,
77,
13,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I make part of a Joomla template editable via the CMS interface?
===
Title says most of it.
I have inherited a Joomla site and the client wants part of the main template (a feature-type box) to be editable via the Joomla backend.
I guess really it is a content item that never gets displayed as its own page, but as a part of all pages.
Is that possible?
Thanks. | 0 | [
2,
184,
92,
31,
233,
141,
16,
21,
2640,
2636,
531,
22894,
9392,
579,
1197,
14,
2390,
18,
6573,
60,
800,
3726,
3726,
581,
898,
127,
16,
32,
9,
31,
57,
7179,
21,
2640,
2636,
531,
689,
17,
14,
6819,
2846,
141,
16,
14,
407,
22894,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Oracle V$OSSTAT
===
The Oracle view V$OSSTAT holds a few operating statistics, including:
* IDLE_TICKS Number of hundredths of a second that a processor has been idle, totalled over all processors
* BUSY_TICKS Number of hundredths of a second that a processor has been busy executing user or kernel code, totalled over all processors
The documentation I've read has not been clear as to whether these are ever reset. Does anyone know?
Another question I have is that I'd like to work out the average CPU load the system is experiencing. To do so I expect I have to go:
busy_ticks / (idle_ticks + busy_ticks)
Is this correct? | 0 | [
2,
15759,
566,
4403,
759,
10631,
800,
3726,
3726,
14,
15759,
1418,
566,
4403,
759,
10631,
2763,
21,
310,
2455,
5818,
15,
215,
45,
1637,
18652,
1,
1786,
4020,
234,
16,
1874,
96,
18,
16,
21,
153,
30,
21,
14762,
63,
74,
18652,
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... |
Unit Testing a Data Structure
===
I'm writing a data structure in C# (a priority queue using a [fibonacci heap][1]) and I'm trying to use it as a learning experience for TDD which I'm quite new to.
I understand that each test should only test one piece of the class so that a failure in one unit doesn't confuse me with multiple test failures, but I'm not sure how to do this when the state of the data structure is important for a test.
For example,
[Test]
public void PeekShouldReturnMinimumItem()
{
this.queue.Enqueue(2);
this.queue.Enqueue(1);
Assert.That(this.queue.Peek(), Is.EqualTo(1));
}
This test would break if either Enqueue *or* Peek broke.
I was thinking that I could somehow have the test manually set up the underlying data structure's heap, but I'm not sure how to do that without exposing the implementation to the world.
Is there a better way to do this? Is relying on other parts ok?
[1]: http://en.wikipedia.org/wiki/Fibonacci_heap | 0 | [
2,
1237,
4431,
21,
1054,
1411,
800,
3726,
3726,
31,
22,
79,
1174,
21,
1054,
1411,
19,
272,
5910,
13,
5,
58,
9857,
22521,
568,
21,
636,
1707,
5566,
17177,
15414,
500,
2558,
165,
500,
6,
17,
31,
22,
79,
749,
20,
275,
32,
28,
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... |
Card Wall + online card wall = duplication?
===
I'm not a great fan of duplicating effort. I do find, however, that there are benefits to tracking agile iteration progress on both a physical card wall and an online "calculator" (Excel, some scrum tools) or an online card wall (e.g. Mingle).
I find that a physical card wall in the team space provides a visceral kind of connection to the status of the cards... and that moving a card physically when you finish something provides a level of satisfaction that can't be duplicated online. I can feel the card... and people can see me walk up to the wall to move something.
Online tools provide great capabilities to share remotely and to calculate progress (e.g. in Mingle, you can use the built-in tools to automatically calculate burn-ups or burn-downs from the real data, saving lots of administrative time in doing those things manually).
I'm curious if agile practitioners maintain two tracking media like I do, and how do you present the benefits of the physical wall to those who say "I can do it online... why would I want to do it on a card wall instead?". | 0 | [
2,
2056,
769,
2754,
2087,
2056,
769,
800,
1052,
20669,
60,
800,
3726,
3726,
31,
22,
79,
52,
21,
374,
2514,
16,
1052,
25971,
1203,
2150,
9,
31,
107,
477,
15,
207,
15,
30,
80,
50,
5800,
20,
10353,
27475,
23534,
3455,
27,
156,
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... |
Designing a personal finance app
===
As a side project, I am looking at creating a personal finance program. I have tried using Money and Excel to keep track of my finances but have either been unhappy with the stability or lack of features. My question is this, what tools have you used to keep track of your personal finances? Here are some requirements I would like to achieve:
1. Stable
2. Can automatically download data from banks for free
3. Customizable enough to easily create a total balance from selected accounts
I was thinking of using a python script, but really haven't thought it out further than that. What interfaces are available to automatically download account information?
| 0 | [
2,
15026,
21,
1319,
3711,
4865,
800,
3726,
3726,
28,
21,
270,
669,
15,
31,
589,
699,
35,
2936,
21,
1319,
3711,
625,
9,
31,
57,
794,
568,
875,
17,
20700,
20,
643,
792,
16,
51,
3711,
18,
47,
57,
694,
74,
14325,
29,
14,
9307,
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... |
VBA for MS word
===
There are a lot of free sources to learn about the object model of MSExcel but I failed to find any comprehensive source for a similar source for MS word.
Can You suggest a free and comprehensive source for the same? | 0 | [
2,
566,
969,
26,
4235,
833,
800,
3726,
3726,
80,
50,
21,
865,
16,
551,
2662,
20,
2484,
88,
14,
3095,
1061,
16,
307,
6353,
11040,
47,
31,
1702,
20,
477,
186,
7041,
1267,
26,
21,
835,
1267,
26,
4235,
833,
9,
92,
42,
5601,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What's the best way to get Eclipse users to regularly update a plugin?
===
I'm going to be distributing a plugin that will be routinely updated with features, bug fixes, and updates to downloadable corpuses.
The usual update site mechanism can do the update ok - when the user asks it to.
The problem is that as far as I know, Eclipse doesn't include an annoying MS windows style "automatic updater" or something that would prompt the user to update.
Can I write something that occasionally checks for updates? Or prompt the user regularly? What's bad form and what's acceptable ?
| 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
164,
11652,
3878,
20,
4217,
11100,
21,
10922,
108,
60,
800,
3726,
3726,
31,
22,
79,
228,
20,
44,
23125,
21,
10922,
108,
30,
129,
44,
22388,
6372,
29,
967,
15,
6256,
6098,
160,
15,
17,
16779,
20... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the most wanted SharePoint feature?
===
Are you the one that thinks: "Only if I had this thing available for me, I'll use SharePoint solution to solve my day-to-day problems?"
What do you miss in the SharePoint functionality that can make you happy?
What are the use cases that you think that SharePoint can solve for you but you miss something to make that happen?
Is it a web part? Component? Functionality? Integration option? Development complexity?
[I'll solve the most interesting ones and will make the solution available] | 0 | [
2,
98,
25,
14,
127,
417,
1891,
3132,
1580,
60,
800,
3726,
3726,
50,
42,
14,
53,
30,
7973,
45,
13,
7,
4965,
100,
31,
41,
48,
584,
904,
26,
55,
15,
31,
22,
211,
275,
1891,
3132,
4295,
20,
8402,
51,
208,
8,
262,
8,
1185,
1716... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Rollback a changeset from the command-line only in TFS?
===
I'm building an automated promotion utility for TFS. One of the features I'd like to support is rolling back the latest change. I'm quite aware of the Rollback Power Tool, but my understanding is that even if you pass a changeset in through the command line, it still brings up the GUI interface for other operations.
My thought is to walk the changeset history of the branch I want to rollback, create a new workspace, get the specific version of the changeset before the last one, then merge it to the current workspace, forcing conflicts to be resolved from the previous version. This all runs on a server in an automated fashion and the workspaces are created and deleted on the fly.
Any other suggestions for a better way to do this? | 0 | [
2,
3001,
1958,
21,
1693,
1198,
37,
14,
1202,
8,
1143,
104,
19,
13,
11720,
18,
60,
800,
3726,
3726,
31,
22,
79,
353,
40,
14904,
2733,
10082,
26,
13,
11720,
18,
9,
53,
16,
14,
967,
31,
22,
43,
101,
20,
555,
25,
3929,
97,
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... |
iphone crash reporter
===
Is it possible to access the crash log over the application? The last.fm client showed me today a "we found a crash log" altert with the option to send it, so I think it must be possible. | 0 | [
2,
21024,
4597,
5357,
800,
3726,
3726,
25,
32,
938,
20,
1381,
14,
4597,
6738,
84,
14,
3010,
60,
14,
236,
9,
5223,
6819,
1908,
55,
786,
21,
13,
7,
458,
216,
21,
4597,
6738,
7,
7835,
38,
29,
14,
4255,
20,
2660,
32,
15,
86,
31,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Feed paper on POS Printer C#
===
I've been trying to programatically feed the paper on a pos printer (Epson TM-U220D). The problem I have is that the last line of the document don't get printed, instead, it is printed as the first line of the next document printed. I tried POS for .NET sending the "ESC|flF" command, also tried to send the raw esc/pos command using the serial port, but it doesn't work. Any ideas? | 0 | [
2,
4063,
1397,
27,
12928,
12925,
272,
5910,
800,
3726,
3726,
31,
22,
195,
74,
749,
20,
625,
721,
8438,
4063,
14,
1397,
27,
21,
12928,
12925,
13,
5,
3492,
528,
13,
38,
79,
8,
291,
18411,
43,
6,
9,
14,
1448,
31,
57,
25,
30,
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... |
Asp.net Deployment Related
===
when you deploy application on web(IIS) you remove all files that contains code(VB/C#) then
how exactly events & all things are handled ? | 0 | [
2,
28,
306,
9,
2328,
10475,
1597,
800,
3726,
3726,
76,
42,
17617,
3010,
27,
2741,
5,
2865,
18,
6,
42,
4681,
65,
6488,
30,
1588,
1797,
5,
20468,
118,
150,
5910,
6,
94,
184,
1890,
963,
279,
65,
564,
50,
9006,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Need help choosing a name for an interface
===
I'm refactoring a number of classes in an application to use interfaces instead of base classes. Here's the interfaces I created so far:
- ICarryable implemented by all Item objects
- IActable implemented by all Actor objects
- IUseable implemented by some Item sub-classes
- IWieldable implemented by some Item sub-classes
You can see the major base-classes are still Item and Actor. These have a common interface in that they both are located on a Map, so they have a Location property. The Map shouldn't care whether the object is an Actor or an Item, so I want to create an interface for it. Here's what the interface would look like
public interface IUnnameable {
event EventHandler<LocationChangedEventArgs> LocationChanged;
Location Location { get; set; }
}
That's no problem, but I can't think of what to call this interface. IMappable comes to mind by seems a bit lame. Any ideas? | 0 | [
2,
376,
448,
10883,
21,
204,
26,
40,
6573,
800,
3726,
3726,
31,
22,
79,
302,
17455,
68,
21,
234,
16,
2684,
19,
40,
3010,
20,
275,
6573,
18,
700,
16,
1000,
2684,
9,
235,
22,
18,
14,
6573,
18,
31,
679,
86,
463,
45,
13,
8,
31... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
RESTful URL design for search
===
I'm looking for a reasonable way to represent searches as a RESTful URLs.
The setup: I have two models, Cars and Garages, where Cars can be in Garages. So my urls look like:
/car/xxxx
xxx == car id
returns car with given id
/garage/yyy
yyy = garage id
returns garage with given id
A Car can exist on its own (hence the /car), or it can exist in a garage. What's the right way to represent, say, all the cars in a given garage? Something like:
/garage/yyy/cars ?
How about the union of cars in garage yyy and zzz?
What's the right way to represent a search for cars with certain attributes? Say: show me all blue sedans with 4 doors :
/car/search?color=blue&type=sedan&doors=4
or should it be /cars instead?
The use of "search" seems inappropriate there - what's a better way / term? Should it just be:
/cars/?color=blue&type=sedan&doors=4
Should the search parameters be part of the PATHINFO or QUERYSTRING?
In short, I'm looking for a good guide/tutorial for cross-model REST url design, and for search. | 0 | [
2,
760,
1566,
287,
6362,
704,
26,
2122,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
9954,
161,
20,
3501,
19994,
28,
21,
760,
1566,
13,
911,
7532,
9,
14,
18161,
45,
31,
57,
81,
2761,
15,
2137,
17,
6242,
18,
15,
113,
2137,
92,
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... |
Plot a data series beneath another one
===
When you plot things in Matlab, the most recently plotted data series is placed on top of whatever's already there. For example:
figure; hold on
plot(sin(linspace(0,pi)),'linewidth',4,'color',[0 0 1])
plot(cos(linspace(0,pi)),'linewidth',4,'color',[1 0 0])
Here, the red line is shown on top of the blue line (where they intersect). Is there any way to set "how deep" a line is drawn, so that you can plot things *beneath* what's already there? | 0 | [
2,
3798,
21,
1054,
231,
2550,
226,
53,
800,
3726,
3726,
76,
42,
3798,
564,
19,
4277,
9086,
15,
14,
127,
1989,
28759,
1054,
231,
25,
1037,
27,
371,
16,
2099,
22,
18,
614,
80,
9,
26,
823,
45,
1465,
73,
1027,
27,
3798,
5,
18,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Updated Firefox Extension - Still says "No updates were found."
===
I am working on a new version of a firefox extension, but after releasing it, and incrementing the em:version in install.rdf and update.rdf, when I click "Find updates" Firefox reports that "No updates were found." When I run it with debugging on, the output in the console is actually identical to what I see when I don't put the update live.
It starts with RDFItemUpdater:checkForUpdates with all of the parameters, and returns with Addon Update Ended and status: 8.
I verified with McCoy tool that the extension is signed, and has the same Id as the old one, etc. I'm not sure what else to try. Any advice would be appreciated. This is with Firefox 3 (and the extension is marked as compatible with it... that didn't change).
| 0 | [
2,
6372,
535,
18219,
3896,
13,
8,
174,
898,
13,
7,
251,
16779,
46,
216,
9,
7,
800,
3726,
3726,
31,
589,
638,
27,
21,
78,
615,
16,
21,
535,
18219,
3896,
15,
47,
75,
8054,
32,
15,
17,
13,
28461,
68,
14,
3579,
45,
10898,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What exactly does var:* mean in actionscript ?
===
Its a little tricky to search for 'var:*' because most search engines wont find it.
I'm not clear exactly what var:* means, compared to say var:Object
I thought it would let me set arbitrary properties on an object like :
var:* x = myObject;
x.nonExistantProperty = "123";
but this gives me an error :
Property nonExistantProperty not found on x
What does * mean exactly? | 0 | [
2,
98,
1890,
630,
4033,
45,
2483,
884,
19,
1028,
8741,
13,
60,
800,
3726,
3726,
82,
21,
265,
5514,
93,
20,
2122,
26,
13,
22,
3311,
45,
2483,
22,
185,
127,
2122,
4016,
7290,
477,
32,
9,
31,
22,
79,
52,
1207,
1890,
98,
4033,
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... |
C++ Binary Search Tree Insert via Recursion
===
So my code is below. I'm not getting any errors and it places everything in the node just fine. But based on my debug statements Everytime anything is inserted it's finding the root. I'm not sure if that is right. But according to output file for the assignment, my answers are different when it comes to the height of the tree, the traversals, and I just flat am still having troubles with my leaf count function. Another story though.
Based on the debug statements it looks like everything is going right where they should. But I figure I might need fresh eyes. I don't see how my traversals could change at all since it is really only a matter of where I'm proccessing the node that should effect the Inorder, preorder, and postorder.
template <class T>
void BT<T>::insert(const T& item)
{
Node<T>* newNode;
newNode = new Node<T>(item);
insert(root, newNode);
}
template <class T>
void BT<T>::insert(struct Node<T> *&root, struct Node<T> *newNode)
{
if (root == NULL)
{
cout << "Root Found" << newNode->data << endl;
root = newNode;
}
else
{
if (newNode->data < root->data)
{
insert(root->left, newNode);
cout << "Inserting Left" << newNode-> data << endl;
}
else
{
insert(root->right, newNode);
cout << "Inserting Right" << newNode->data << endl;
}
}
}
My height function is as follows just in case my insert is actually fine.
template <class T>
int BT<T>::height() const
{
return height(root);
}
template <class T>
int BT<T>::height(Node<T>* root) const
{
if (root == NULL)
return 0;
else
{
if (height(root->right) > height(root->left))
return 1 + height(root-> right);
return 1 + height(root->left);
}
} | 0 | [
2,
272,
20512,
14171,
2122,
1541,
14692,
1197,
26604,
5991,
800,
3726,
3726,
86,
51,
1797,
25,
1021,
9,
31,
22,
79,
52,
1017,
186,
11908,
17,
32,
1489,
796,
19,
14,
15421,
114,
1123,
9,
47,
432,
27,
51,
121,
16254,
9015,
352,
89... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I set full trust for a single Web Part in SharePoint?
===
I am looking to set full trust for a single web part, is this possible? manifest.xml maybe? | 0 | [
2,
184,
107,
31,
309,
503,
1527,
26,
21,
345,
2741,
141,
19,
1891,
3132,
60,
800,
3726,
3726,
31,
589,
699,
20,
309,
503,
1527,
26,
21,
345,
2741,
141,
15,
25,
48,
938,
60,
13160,
9,
396,
8184,
913,
60,
3,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is there a way to tell maven where to place the artifacts ?
===
I am running both maven inside the m2eclipse plugin, windows command line and my cygwin command line.
cygwin's bash shell dumps artifacts into the cygwin /home/me/.m2 directory
but m2eclipse & windows shell (on vista) uses /Users/me/Documents/.m2
Is it possible to tell the mvn command to use one central .m2 directory ?
Thanks | 0 | [
2,
25,
80,
21,
161,
20,
494,
1216,
3124,
113,
20,
209,
14,
10996,
13,
60,
800,
3726,
3726,
31,
589,
946,
156,
1216,
3124,
572,
14,
307,
135,
3319,
6013,
870,
10922,
108,
15,
1936,
1202,
293,
17,
51,
6728,
263,
4181,
1202,
293,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
DataGridView locked on a inherited UserControl
===
I have a UserControl with some predefined controls (groupbox,button,datagridview) on it, these controls are marked as protected and the components variable is also marked as protected.
I then want to inherit from this base UserControl to another UserControl, however the DataGridView is always locked in the designer.
I suspect it may have something to do with the DataGridView implementing ISupportInitilize.
public class BaseGridDetail : UserControl
Has a DataGridView control (et al) defined.
<br>
public class InheritedDetail : BaseGridDetail
The DataGridView control is locked
<br>Does anyone have any ideas how to make this control available in the designer after inheritenace?
| 0 | [
2,
1054,
16375,
4725,
4011,
27,
21,
7179,
4155,
12898,
800,
3726,
3726,
31,
57,
21,
4155,
12898,
29,
109,
782,
13439,
8671,
13,
5,
8024,
5309,
15,
811,
444,
15,
18768,
16375,
4725,
6,
27,
32,
15,
158,
8671,
50,
2739,
28,
3803,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the key sequence for closing the current buffer in EMACS?
===
If I click on File -> Close, it closes the buffer like I want, but doesn't list a key mapping. What is the key mapping? | 0 | [
2,
98,
25,
14,
1246,
4030,
26,
4239,
14,
866,
17497,
19,
13,
62,
6893,
18,
60,
800,
3726,
3726,
100,
31,
10840,
27,
3893,
13,
8,
1,
543,
15,
32,
543,
18,
14,
17497,
101,
31,
259,
15,
47,
1437,
22,
38,
968,
21,
1246,
13305,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Staff Rostering algorithms
===
We are embarking on some R&D for a staff rostering system, and I know that there are some suggested algorithms such as the memetic algorithm etc., but I cannot find any additional information on the web.
Does anyone know any research journals, or pseudocode out there which better explains these algorithms?
Thanks,
Devan
| 0 | [
2,
1138,
8699,
68,
15935,
800,
3726,
3726,
95,
50,
20116,
68,
27,
109,
761,
1569,
43,
26,
21,
1138,
8699,
68,
329,
15,
17,
31,
143,
30,
80,
50,
109,
2347,
15935,
145,
28,
14,
55,
79,
9329,
9083,
2722,
9,
15,
47,
31,
1967,
47... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a way to "hot swap" JavaScript code within the browser?
===
Is there any tool that enables you to "hot swap" JavaScript contents while executing a webpage?
I am looking for something similar to what HotSport does for Java, a way to "hot deploy" new JS code without having to reload the whole page.
Is there anything like that out there? | 0 | [
2,
25,
80,
21,
161,
20,
13,
7,
7010,
17150,
7,
8247,
8741,
1797,
363,
14,
16495,
60,
800,
3726,
3726,
25,
80,
186,
5607,
30,
14645,
42,
20,
13,
7,
7010,
17150,
7,
8247,
8741,
8478,
133,
25836,
21,
2741,
6486,
60,
31,
589,
699,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 did you start using Python?
===
Why did you start using Python?
---
I was using perl for my programming needs, and was often frustrated.
I hated reading other peoples perl code and basically would often result to re-writting entire functions rather than trying to debug someone elses code.
Also, coming back to code I'd written months before was a headache.
(admittidly I was still pretty much a beginning programmer)
I first ran across python when reading this article:
http://www.wired.com/culture/education/news/2002/09/54916
> The team chose Python as their
> programming language because they
> could write cleaner, faster code more
> easily in it. But Haynes was the only
> one in the group who had coded in that
> language before, so the other four
> students had to learn Python as well
> as solve the various technical and
> interface problems.
This quote got my attention, and I gradually picked up python.
Almost 6 years of python and I have yet to feel the frustration that drove me from perl. | 0 | [
2,
483,
144,
42,
799,
568,
20059,
60,
800,
3726,
3726,
483,
144,
42,
799,
568,
20059,
60,
13,
8,
8,
8,
31,
23,
568,
416,
255,
26,
51,
3143,
2274,
15,
17,
23,
478,
10645,
9,
31,
5285,
1876,
89,
148,
18,
416,
255,
1797,
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 can I shutdown a Windows Mobile device programatically
===
I would like to programatically shutdown a Windows Mobile device using Compact framework 2.0, Windows mobile 5.0 SDK.
Regards, | 0 | [
2,
184,
92,
31,
28450,
21,
1936,
3241,
3646,
625,
721,
8438,
800,
3726,
3726,
31,
83,
101,
20,
625,
721,
8438,
28450,
21,
1936,
3241,
3646,
568,
8285,
6596,
172,
9,
387,
15,
1936,
3241,
331,
9,
387,
13,
18,
43,
197,
9,
14179,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Best practices for getting cross-site JSON responses to POST?
===
I'm working on an intranet with several subdomains. I have control over each subdomain, so security of cross-site requests is not a concern. I have PHP scripts with JSON responses I'd like to call from multiple subdomains without duplication. For GET requests, I can do this with AJAX and JSONP, but that doesn't work with POST requests. Some alternatives I see, none of which seem very good:
- POST to a copy on local subdomain with minimal response, then GET full response from central location with JSONP
- Both POST and GET to a copy on local subdomain with JSON
- Use mod_rewrite to use local URLs with a central script on back end with JSON
- Use symlinks to use local URLs with a central script on back end with JSON
Am I missing something simpler? What would you do here? | 0 | [
2,
246,
5242,
26,
1017,
919,
8,
9097,
487,
528,
13231,
20,
678,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
40,
14369,
2328,
29,
238,
972,
537,
6232,
18,
9,
31,
57,
569,
84,
206,
972,
537,
6232,
15,
86,
1221,
16,
919,
8,
9097,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 add a self-update feature to a Java Swing application?
===
I'm trying to figure out a way to add a self-update feature to a Java/Swing application I'm working on.
Basically I've got a bunch of jar files with extra functionality to be re-deployed to the installed users when they change. Nothing complicated, just check if a new version has been released, download them over HTTP, and then optionally offer to restart the app to the user.
I had a look at webstart, and it could work. But this particular app does some funky stuff with classloading and GC memory settings that don't look like they are supported via webstart, or will at least complicate matters.
I also went down the road of adding in this plugin handler <http://swing-fx.blogspot.com/2008/06/add-auto-update-and-plugins-to-your.html>, but it is very alpha, and tries to do too much with the usual bugs you get with alpha stuff. | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
3547,
21,
1119,
8,
576,
8209,
1580,
20,
21,
8247,
5587,
3010,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
1465,
70,
21,
161,
20,
3547,
21,
1119,
8,
576,
8209,
1580,
20,
21,
8247,
118,
18,
3546,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Eclipse & JSP: java.lang.NoSuchMethodError: javax.servlet.jsp.tagext.TagAttributeInfo.<init>(Ljava/lang/String;ZLjava/lang/String;ZZ)V
===
I'm using Eclipse 3.4 with WTP 3.0.2 and running a fairly large Dynamic Web Project. I've set up the project so that I can access it at http://127.0.0.1:8080/share/ but whenever I do, I get the following error:
java.lang.NoSuchMethodError: javax.servlet.jsp.tagext.TagAttributeInfo.<init>(Ljava/lang/String;ZLjava/lang/String;ZZ)V
at org.apache.jasper.compiler.TagLibraryInfoImpl.createAttribute(TagLibraryInfoImpl.java:572)
at org.apache.jasper.compiler.TagLibraryInfoImpl.createTagInfo(TagLibraryInfoImpl.java:401)
at org.apache.jasper.compiler.TagLibraryInfoImpl.parseTLD(TagLibraryInfoImpl.java:248)
at org.apache.jasper.compiler.TagLibraryInfoImpl.<init>(TagLibraryInfoImpl.java:162)
at org.apache.jasper.compiler.Parser.parseTaglibDirective(Parser.java:423)
at org.apache.jasper.compiler.Parser.parseDirective(Parser.java:492)
at org.apache.jasper.compiler.Parser.parseElements(Parser.java:1552)
at org.apache.jasper.compiler.Parser.parse(Parser.java:126)
at org.apache.jasper.compiler.ParserController.doParse(ParserController.java:211)
at org.apache.jasper.compiler.ParserController.parse(ParserController.java:100)
at org.apache.jasper.compiler.Compiler.generateJava(Compiler.java:155)
at org.apache.jasper.compiler.Compiler.compile(Compiler.java:295)
at org.apache.jasper.compiler.Compiler.compile(Compiler.java:276)
at org.apache.jasper.compiler.Compiler.compile(Compiler.java:264)
at org.apache.jasper.JspCompilationContext.compile(JspCompilationContext.java:563)
at org.apache.jasper.servlet.JspServletWrapper.service(JspServletWrapper.java:303)
at org.apache.jasper.servlet.JspServlet.serviceJspFile(JspServlet.java:314)
at org.apache.jasper.servlet.JspServlet.service(JspServlet.java:264)
at javax.servlet.http.HttpServlet.service(HttpServlet.java:853)
at org.apache.catalina.core.ApplicationFilterChain.internalDoFilter(ApplicationFilterChain.java:269)
at org.apache.catalina.core.ApplicationFilterChain.doFilter(ApplicationFilterChain.java:188)
at org.apache.catalina.core.StandardWrapperValve.invoke(StandardWrapperValve.java:213)
at org.apache.catalina.core.StandardContextValve.invoke(StandardContextValve.java:172)
at org.apache.catalina.core.StandardHostValve.invoke(StandardHostValve.java:127)
at org.apache.catalina.valves.ErrorReportValve.invoke(ErrorReportValve.java:117)
at org.apache.catalina.core.StandardEngineValve.invoke(StandardEngineValve.java:108)
at org.apache.catalina.connector.CoyoteAdapter.service(CoyoteAdapter.java:174)
at org.apache.coyote.http11.Http11Processor.process(Http11Processor.java:875)
at org.apache.coyote.http11.Http11BaseProtocol$Http11ConnectionHandler.processConnection(Http11BaseProtocol.java:665)
at org.apache.tomcat.util.net.PoolTcpEndpoint.processSocket(PoolTcpEndpoint.java:528)
at org.apache.tomcat.util.net.LeaderFollowerWorkerThread.runIt(LeaderFollowerWorkerThread.java:81)
at org.apache.tomcat.util.threads.ThreadPool$ControlRunnable.run(ThreadPool.java:689)
at java.lang.Thread.run(Unknown Source)
As none of the above files is my own, pointing out the cause of the problem is quite hard. Any ideas where to start looking? | 0 | [
2,
11652,
279,
487,
3401,
45,
8247,
9,
9949,
9,
251,
4289,
5909,
1807,
43,
29992,
45,
8247,
396,
9,
10321,
1336,
9,
728,
3401,
9,
8628,
1706,
38,
9,
536,
8778,
14755,
108,
4120,
9,
1,
108,
242,
1,
5,
15664,
4961,
118,
9949,
11... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Prevent Visual Studio from automatically creating "Mixed Platforms" solution configuration
===
How do I prevent Visual Studio 2008 from automatically creating the "Mixed Platforms" and "Any CPU" solution configurations? We have "Win32" and "x64" configurations and a developer needs to choose between them. However, as soon as anyone makes any changes to the solution VS automatically creates "Mixed Platforms" and it seems to be the default configuration. This causes a lot of issues, because it turns out some new projects are not selected in this configuration or the wrong project configuration is selected, etc. I just want to stop it doing that and manage the solution configurations myself. | 0 | [
2,
2501,
3458,
1120,
37,
7499,
2936,
13,
7,
21049,
6843,
7,
4295,
8091,
800,
3726,
3726,
184,
107,
31,
2501,
3458,
1120,
570,
37,
7499,
2936,
14,
13,
7,
21049,
6843,
7,
17,
13,
7,
6001,
17578,
7,
4295,
8091,
18,
60,
95,
57,
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... |
Moving directories in subversion
===
I have inherited a subversion repo which looks like this:
https://foo/product/src
I want to make it more like:
- https://foo/product/trunk/src
- https://foo/product/tags
- https://foo/product/branches
Will moving ./src to ./trunk/src retain history ?
I also want to make sure the other developers don't curse me for doing this .. are there unintended consequences from doing this ? I want the developers to just do a simple repo directory relocate.
Thanks | 0 | [
2,
1219,
559,
1596,
19,
972,
10898,
800,
3726,
3726,
31,
57,
7179,
21,
972,
10898,
302,
1638,
56,
1879,
101,
48,
45,
7775,
18,
6903,
4120,
111,
118,
14086,
118,
18,
5453,
31,
259,
20,
233,
32,
91,
101,
45,
13,
8,
7775,
18,
690... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Error when trying to deploy web part
===
I just wrote a new web part and now I am getting this error when I try to deploy them on my non-dev servers:
> the default namespace
> 'http://schemas.microsoft.com/WebPart/v2'
> is a reserved namespace for base Web
> Part propertiees. Custom Web Part
> properties require a unique namespace
> (specified through an
> XmlElementAttribute on the property ,
> or an XmlRootAttribute on the class).
I am writing the web parts into CAB files and deploying them with this:
stsadm -o addwppack -filename web_part_name.CAB -url http://your_url_here -globalinstall -force
Everything works fine until I try to add the web part, then I get this error in a popup. It works just fine on my dev VM...?
Any ideas would be appreciate, thank you. | 0 | [
2,
7019,
76,
749,
20,
17617,
2741,
141,
800,
3726,
3726,
31,
114,
738,
21,
78,
2741,
141,
17,
130,
31,
589,
1017,
48,
7019,
76,
31,
1131,
20,
17617,
105,
27,
51,
538,
8,
14438,
17595,
45,
13,
1,
14,
12838,
204,
5582,
13,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
what are CONOPs?
===
I have tried my best but have not been able to wrap my head around the concept of CONOPs. Can someone help with examples? | 0 | [
2,
98,
50,
1065,
11314,
60,
800,
3726,
3726,
31,
57,
794,
51,
246,
47,
57,
52,
74,
777,
20,
8118,
51,
157,
140,
14,
2420,
16,
1065,
11314,
9,
92,
737,
448,
29,
3770,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
wrapped exception from a component
===
There is this style of exception system where a component throws component-specific exception. For example, all data access classes throw `DataAccessException`.
In this style, I often find myself having to catch and rethrow the component specific exception:
try {
int foo = foo();
if (foo != expectedValue) {
throw new ComponentException("bad result from foo(): " + foo);
}
bar();
}
catch (ComponentException e) {
throw e;
}
catch (SomeOtherException e) {
throw new ComponentException(e);
}
Do you find yourself doing the same? Do you find it ugly?
This question is not about validity of this style, but something within the constraints of this style. | 0 | [
2,
3684,
5391,
37,
21,
5912,
800,
3726,
3726,
80,
25,
48,
1034,
16,
5391,
329,
113,
21,
5912,
13566,
5912,
8,
9219,
5391,
9,
26,
823,
15,
65,
1054,
1381,
2684,
3814,
13,
1,
18768,
20604,
10066,
872,
1,
9,
19,
48,
1034,
15,
31,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's your favorite prototype compatible, javascript date picker?
===
Please one library per answer so that people can vote for the individually. | 0 | [
2,
98,
22,
18,
154,
3839,
7063,
14961,
15,
8247,
8741,
1231,
2036,
106,
60,
800,
3726,
3726,
2247,
53,
1248,
416,
1623,
86,
30,
148,
92,
2018,
26,
14,
16579,
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,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
writing Code::Blocks plugin
===
where will I find **documentation for developing plug-in for Code::Blocks**?
Also, is there a comprehensive **documentation for the Code::Blocks source code** which I can use to modify the source and to add desirable functionalities to the Code::Blocks IDE | 0 | [
2,
1174,
1797,
45,
45,
12048,
18,
10922,
108,
800,
3726,
3726,
113,
129,
31,
477,
13,
1409,
28132,
857,
26,
3561,
10922,
8,
108,
26,
1797,
45,
45,
12048,
18,
1409,
60,
67,
15,
25,
80,
21,
7041,
13,
1409,
28132,
857,
26,
14,
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 to diagnose IIS fatal communication error problem
===
I've a a customer using IIS and an application, developed by us, in Asp.NET 1.1. Monday, for 4 times in a row the error “A process serving application pool 'xxxx' suffered a fatal communication error with the World Wide Web Publishing Service. The process id was 'yyyy'. The data field contains the error number.” appeared.
Any idea about how to diagnose this? The only link I've found (http://blogs.msdn.com/david.wang/archive/2005/08/29/HOWTO_Understand_and_Diagnose_an_AppPool_Crash.aspx) talks about installing low level debug tools but before proceeding in this kind of low level analysis I would know if someone has a better idea or a suitable alternative.
The problem (from what I can see) is something in the customer environment, because the same application it's installed at other customer sites on at least 20 or 30 different servers and the problem do not happen.
Regards
Massimo | 0 | [
2,
184,
20,
28438,
595,
18,
8773,
3291,
7019,
1448,
800,
3726,
3726,
31,
22,
195,
21,
21,
7705,
568,
595,
18,
17,
40,
3010,
15,
885,
34,
182,
15,
19,
28,
306,
9,
2328,
137,
9,
165,
9,
5745,
15,
26,
268,
436,
19,
21,
3131,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 .Net application immune from low level errors???
===
Has someone some article or proof that .Net application are immune to low level errors? I'm talking about classical pointer errors we can see in a C++ application, memory overflow, problems from the Intel DEP and so on.
I'm talking about .Net applications that do not use "unsafe" code, from what is my experience in this case only problems can be that of a memory leak or classical coding errors (like stack overflows) but I've never seen low level errors.
Could someone comment on this? | 0 | [
2,
50,
13,
9,
2328,
3010,
12458,
37,
708,
662,
11908,
60,
60,
60,
800,
3726,
3726,
63,
737,
109,
2002,
54,
6070,
30,
13,
9,
2328,
3010,
50,
12458,
20,
708,
662,
11908,
60,
31,
22,
79,
1582,
88,
3089,
454,
106,
11908,
95,
92,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Workflow RuleSetDialog
===
Can we somehow extend the RuleSetDialog class and host in our windows application? | 0 | [
2,
170,
9990,
1761,
1198,
4286,
5567,
800,
3726,
3726,
92,
95,
3625,
7206,
14,
1761,
1198,
4286,
5567,
718,
17,
2015,
19,
318,
1936,
3010,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 unit test a Java method which uses ProcessBuilder and Process?
===
I have a Java method which starts up a Process with ProcessBuilder, and pipes its output into a byte array, and then returns its byte array when the process is finished.
Pseudo-code:
ProcessBuilder b = new ProcessBuilder("my.exe")
Process p = b.start();
... // get output from process, close process
What would be the best way to go about unit testing this method? I haven't found a way to mock ProcessBuilder (it's final), even with the incredibly awesome [JMockit][1], it gives me a NoClassDefFoundError:
java.lang.NoClassDefFoundError: test/MockProcessBuilder
at java.lang.ProcessBuilder.<init>(ProcessBuilder.java)
at mypackage.MyProcess.start(ReportReaderWrapperImpl.java:97)
at test.MyProcessTest.testStart(ReportReaderWrapperImplTest.java:28)
Any thoughts?
[1]: http://jmockit.dev.java.net
| 0 | [
2,
184,
107,
31,
1237,
1289,
21,
8247,
2109,
56,
2027,
953,
20904,
17,
953,
60,
800,
3726,
3726,
31,
57,
21,
8247,
2109,
56,
3244,
71,
21,
953,
29,
953,
20904,
15,
17,
14104,
82,
5196,
77,
21,
34,
591,
7718,
15,
17,
94,
4815,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 handle errors in VB Script
===
I am having an VB Script. I need to log the error information in a file. I need to log every information like error number error description and in which sub routine does the error occured.
Please provide some code | 0 | [
2,
184,
20,
3053,
11908,
19,
13,
20468,
3884,
800,
3726,
3726,
31,
589,
452,
40,
13,
20468,
3884,
9,
31,
376,
20,
6738,
14,
7019,
676,
19,
21,
3893,
9,
31,
376,
20,
6738,
352,
676,
101,
7019,
234,
7019,
5318,
17,
19,
56,
972,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Loggin Library for .NET Compact Framework?
===
Any good logging libraries that supports .NET compact framework? | 0 | [
2,
6738,
5831,
1248,
26,
13,
9,
2328,
8285,
6596,
60,
800,
3726,
3726,
186,
254,
13,
13919,
8649,
30,
6747,
13,
9,
2328,
8285,
6596,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do commercial Java static analysis tools compare with the free ones?
===
I'm familiar with a handful of the free static analysis tools available for Java, such as FindBugs and PMD. What I'd like to know is how the commercial products stack up against these. What are their strengths and weaknesses? | 4 | [
2,
184,
107,
1439,
8247,
12038,
2495,
4672,
11590,
29,
14,
551,
53,
18,
60,
800,
3726,
3726,
31,
22,
79,
3694,
29,
21,
8893,
16,
14,
551,
12038,
2495,
4672,
904,
26,
8247,
15,
145,
28,
477,
16254,
18,
17,
6736,
43,
9,
98,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Writing utf16 to file in binary mode
===
I'm trying to write a wstring to file with ofstream in binary mode, but I think I'm doing something wrong. This is what I've tried:
ofstream outFile("test.txt", std::ios::out | std::ios::binary);
wstring hello = L"hello";
outFile.write((char *) hello.c_str(), hello.length() * sizeof(wchar_t));
outFile.close();
Opening test.txt in for example Firefox with encoding set to UTF16 it will show as:
h�e�l�l�o�
Could anyone tell me why this happens?
| 0 | [
2,
1174,
287,
11720,
1091,
20,
3893,
19,
14171,
3740,
800,
3726,
3726,
31,
22,
79,
749,
20,
2757,
21,
619,
11130,
20,
3893,
29,
16,
11260,
19,
14171,
3740,
15,
47,
31,
277,
31,
22,
79,
845,
301,
1389,
9,
48,
25,
98,
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... |
ExpressionType.Quote
===
What is the purpose of this UnaryExpression, and how should it be used? | 0 | [
2,
1803,
4474,
9,
8970,
591,
800,
3726,
3726,
98,
25,
14,
2131,
16,
48,
367,
1857,
28993,
15,
17,
184,
378,
32,
44,
147,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Best mobile application development tool/environment?
===
I would like to develop a mobile application that is able to access all the features of the mobile device it runs on (camera, files, phone and network connectivity). I intend to build a series of applications that each have a specific function to perform, rather than a single application with a large feature set. My programming background is C, C# and web applications.
What would be the best tool set to use to do this? I have looked at using the NetBeansIDE to create a Java ME applications using LWUIT - this looks promising, but what are the caveat's?
I want to target the largest universe of mobile devices possible. | 4 | [
2,
246,
3241,
3010,
522,
5607,
118,
28976,
60,
800,
3726,
3726,
31,
83,
101,
20,
2803,
21,
3241,
3010,
30,
25,
777,
20,
1381,
65,
14,
967,
16,
14,
3241,
3646,
32,
1461,
27,
13,
5,
24636,
15,
6488,
15,
1132,
17,
982,
24026,
6,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Great Eclipse Set-up for PHP Development
===
I use Eclipse PDT, Subclipse, viPlugin and JSEclipse for my PHP and JavaScript development. This gives me quite a nice environment, but I wonder what else is out there that might be even better.
What plug-ins have you installed into Eclipse to create your great set-up for developing using PHP and JavaScript? Which features do you find most useful? Which aren't so good, and what would fix them? | 0 | [
2,
374,
11652,
309,
8,
576,
26,
13,
26120,
522,
800,
3726,
3726,
31,
275,
11652,
13,
9251,
38,
15,
972,
150,
6013,
870,
15,
1790,
18527,
5831,
17,
487,
14332,
6013,
870,
26,
51,
13,
26120,
17,
8247,
8741,
522,
9,
48,
2352,
55,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Python tutorial for total beginners?
===
I've recently been given a group of five 16/17 year old students to mentor through a extra-curricular software project. The only trouble is, they have *never* done any form of coding / scripting. This in itself makes me feel nervous. After much agonising I settled on getting them to use Python as its free and there appears to be a lot of useful information online.
I myself have never used any python or even done any scripting, so I'll be learning it alongside the students. This fact doesn't really bother me so much as Im a professional and what kind of pro can't learn a new language ?! ... right! What does concern me is that the students have no rounding in software theory, techniques or practices so Ill have to point them in the direction of a good tutorial.
Does anyone know of a good python tutorial for (total) beginners that contains elements of theory and software techniques? | 0 | [
2,
20059,
29724,
26,
600,
26931,
18,
60,
800,
3726,
3726,
31,
22,
195,
1989,
74,
504,
21,
214,
16,
355,
347,
118,
1053,
159,
315,
573,
20,
7656,
120,
21,
2230,
8,
4734,
139,
17996,
2306,
669,
9,
14,
104,
2572,
25,
15,
59,
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... |
Show a PDF document in a browser without the menu bar
===
I have a touch screen kiosk that displays a webpage and a pdf document. Can I remove the menu bar? Users must not have "save", "print" and other such features. | 0 | [
2,
298,
21,
13,
11124,
4492,
19,
21,
16495,
366,
14,
11379,
748,
800,
3726,
3726,
31,
57,
21,
1723,
2324,
28092,
30,
9412,
21,
2741,
6486,
17,
21,
13,
11124,
4492,
9,
92,
31,
4681,
14,
11379,
748,
60,
3878,
491,
52,
57,
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,
0,
0,
0,
0,
0... |
Best SQL book or web tutorial?
===
Just a quick question:
> I'm looking for the best **SQL book** or **free tutorial on the web**.
I know i can google the tutorial but picking your brains is easier and it always produce better results.
***All suggestions are welcome***
***And free is always better***
Many Thanks. | 0 | [
2,
246,
4444,
255,
360,
54,
2741,
29724,
60,
800,
3726,
3726,
114,
21,
2231,
1301,
45,
13,
1,
31,
22,
79,
699,
26,
14,
246,
13,
1409,
18,
22402,
360,
1409,
54,
13,
1409,
4639,
29724,
27,
14,
2741,
1409,
9,
31,
143,
31,
92,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you debug a series of Aspect in eclipse?
===
I've got a chain of aspects that are being executed in some cases but not in others. The stack typically looks something like this w/o giving an context information. There doesn't appear to be any logging that I can enable either. Thanks for any help on this.
GeneratedMethodAccessor163.invoke(Object, Object[]) line: not available
DelegatingMethodAccessorImpl.invoke(Object, Object[]) line: 25
Method.invoke(Object, Object...) line: 585
AspectJAroundAdvice(AbstractAspectJAdvice).invokeAdviceMethodWithGivenArgs(Object[]) line: 566
AspectJAroundAdvice(AbstractAspectJAdvice).invokeAdviceMethod(JoinPoint, JoinPointMatch, Object, Throwable) line: 556
AspectJAroundAdvice.invoke(MethodInvocation) line: 57
Cglib2AopProxy$CglibMethodInvocation(ReflectiveMethodInvocation).proceed() line: 173
ExposeInvocationInterceptor.invoke(MethodInvocation) line: 89
Cglib2AopProxy$CglibMethodInvocation(ReflectiveMethodInvocation).proceed() line: 185
Cglib2AopProxy$DynamicAdvisedInterceptor.intercept(Object, Method, Object[], MethodProxy) line: 652
| 0 | [
2,
184,
107,
42,
121,
16254,
21,
231,
16,
7289,
19,
11652,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
2858,
16,
4842,
30,
50,
142,
5557,
19,
109,
1871,
47,
52,
19,
654,
9,
14,
7566,
2442,
1879,
301,
101,
48,
619,
118,
111,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
computing a cross-browser iframe height
===
One of the most difficult problems in my javascript experience has been the correct (that is "cross-browser") computing of a **iframe height**.
In my applications I have a lot of dinamically generated iframe and I want that all do a sort of autoresize at the end of load event to adjust their height and width.
In the case of **height** computing my best solution is the following (with the help of jquery):
function getDocumentHeight(doc) {
var mdoc = doc || document;
if (mdoc.compatMode=='CSS1Compat') {
return mdoc.body.offsetHeight;
}
else {
if ($.browser.msie)
return mdoc.body.scrollHeight;
else
return Math.max($(mdoc).height(), $(mdoc.body).height());
}
}
I searched in the internet without success. I also tested Yahoo library that have some methods for document and viewport dimensions, but it's not satisfactory.
My solution works decently, but sometimes it calculates a taller height.
I've studied and tested tons of property regarding document height in Firefox/IE/Safari: documentElement.clientHeight, documentElement.offsetHeight, documentElement.scrollHeight, body.offsetHeight, body.scrollHeight, ...
Also jquery doesn't have a coherent behavior in various browser with the calls $(document.body).height(), $('html', doc).height(), $(window).height()
I call the above function not only at the end of load event, but also in the case of dynamically inserted DOM elements or elements hidden or showed. This is a case that sometimes breaks the code that works only in the load event.
There is someone on earth that have a real cross-browser (at least Firefox/IE/Safari) solution? Some tips or hints? | 0 | [
2,
10626,
21,
919,
8,
25699,
4104,
31,
8361,
2947,
800,
3726,
3726,
53,
16,
14,
127,
1956,
1716,
19,
51,
8247,
8741,
1496,
63,
74,
14,
4456,
13,
5,
887,
25,
13,
7,
7703,
8,
25699,
4104,
7,
6,
10626,
16,
21,
13,
1409,
49,
836... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Combining two interfaces into one
===
As I mention in an earlier question, I'm refactoring a project I'm working on. Right now, everything depends on everything else. Everything is separated into namespaces I created early on, but I don't think my method of separtion was very good. I'm trying to eliminate cases where an object depends on another object in a different namespace that depends on the other object.
The way I'm doing this, is by partitioning my project (a game) into a few assemblies:
GameName.Engine
GameName.Rules
GameName.Content
GameName.Gui
The GameName.Engine assembly contains a bunch of interfaces, so other parts of the program don't need to depend on any particular implementation. For instance, I have a GameName.Engine.ICarryable interface that is primarily implemented by GameName.Content.Item class (and its sub-classes). I also have an object to allow an Actor to pickup an ICarryable; PickupAction. Previously, it required an Item, but this exposes unneccessary methods and properties, where it really only needed the methods required to pick it up and carry it. That's why I've created the ICarryable interface.
Now that's all good, so to my question. GameName.Gui should only depend on GameName.Engine, not any implementation. Inside GameName.Gui I have a MapView object that displays a Map and any IRenderable objects on it.
IRenderable is basically just an interface that exposes an image and some strings describing the object. But, the MapView also needs the object to implement ILocateable, so it can see its location and know when its changed via an event, LocationChanged, inside ILocateable.
These two interfaces are implemented by both Item and Actor objects. Which, again are defined in GameName.Content. Since it needs both interfaces, I have two choices:
1. Make GameName.Gui depend on GameName.Content and require an Entity (base-class of Item and Actor).
2. Make an interface inside GameName.Engine that looks like this:
interface ILocateableRenderable : ILocateable, IRenderable
{
}
And then make my Actor and Item objects implement that interface instead of the two individually.
Anyone have any suggestions on which method is the best? Is it appropriate to create an interface with no methods or properties, that only enforces implementing two other interfaces?
| 0 | [
2,
12803,
81,
6573,
18,
77,
53,
800,
3726,
3726,
28,
31,
3794,
19,
40,
1201,
1301,
15,
31,
22,
79,
302,
17455,
68,
21,
669,
31,
22,
79,
638,
27,
9,
193,
130,
15,
796,
9597,
27,
796,
962,
9,
796,
25,
4196,
77,
204,
5582,
18... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Looking for a recommendation on record-locking within a distributed system
===
We're trying to come up with a recommended design pattern for our team when it comes to record locking. The typical school of thought goes something like this:
1. User picks a record from a list
2. Lock the record with the user id
3. Load the locked record record (no lock, then someone beat ya to it).
Am I missing something, or does this appear to be the only way to do this? ((In our case Optimistic locking would prove cumbersome and confusing for the end users. Edits are often quite substantial.)) | 0 | [
2,
699,
26,
21,
14066,
27,
571,
8,
3966,
68,
363,
21,
4387,
329,
800,
3726,
3726,
95,
22,
99,
749,
20,
340,
71,
29,
21,
5773,
704,
3732,
26,
318,
173,
76,
32,
1624,
20,
571,
17538,
9,
14,
3874,
116,
16,
289,
1852,
301,
101,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Templated superclass linking problem
===
I'm trying to create a C++ class, with a templated superclass. The idea being, I can easily create lots of similar subclasses from a number of superclasses which have similar characteristics.
I have distilled the problematic code as follows:
`template_test.h`:
template<class BaseClass>
class Templated : public BaseClass
{
public:
Templated(int a);
virtual int Foo();
};
class Base
{
protected:
Base(int a);
public:
virtual int Foo() = 0;
protected:
int b;
};
`template_test.cpp`:
#include "template_test.h"
Base::Base(int a)
: b(a+1)
{
}
template<class BaseClass>
Templated<BaseClass>::Templated(int a)
: BaseClass(a)
{
}
template<class BaseClass>
int Templated<BaseClass>::Foo()
{
// have to explicitly scope all references to
// member variables and functions in superclass.
return BaseClass::b;
}
template<> Templated<Base>::Templated(int a);
template<> int Templated<Base>::Foo();
`main.cpp`:
#include "template_test.h"
int main()
{
Templated<Base> test(1);
return test.Foo();
}
When I build the code, I get linker errors, saying that the symbols `Templated<Base>::Templated(int)` and `Templated<Base>::Foo()` cannot be found.
A quick Google suggests that adding the following to `main.cpp` will solve the problem:
template<> Templated<Base>::Templated(int a);
template<> int Templated<Base>::Foo();
But this does not solve the problem. Adding the lines to `main.cpp` does not work either. (Though, interestingly, adding them to both gives 'multiply defined symbol' errors from the linker, so they must be doing something...)
*However*, putting all the code in one source file does solve the problem. While this would be ok for the noddy example above, the real application I'm looking at would become unmanageable very fast if I was forced to put the whole lot in one cpp file.
Does anyone know if what I'm doing is even possible? (How) can I solve my linker errors?
I would assume that I could make all the methods in `class Templated` inline and this would work, but this doesn't seem ideal either. | 0 | [
2,
22894,
43,
1026,
1898,
12585,
1448,
800,
3726,
3726,
31,
22,
79,
749,
20,
1600,
21,
272,
20512,
718,
15,
29,
21,
22894,
43,
1026,
1898,
9,
14,
882,
142,
15,
31,
92,
2351,
1600,
7503,
16,
835,
972,
1898,
160,
37,
21,
234,
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... |
equivalent of time for memory checking
===
we can use `time` in a unix environment to see how long something took...
shell> time some_random_command
real 0m0.709s
user 0m0.008s
sys 0m0.012s
is there an equivalent for recording memory usage of the process(es)?
in particular i'm interested in peak allocation. | 0 | [
2,
4602,
16,
85,
26,
1912,
9886,
800,
3726,
3726,
95,
92,
275,
13,
1,
891,
1,
19,
21,
22540,
2307,
20,
196,
184,
175,
301,
199,
9,
9,
9,
3593,
1,
85,
109,
1,
2195,
5555,
1,
16239,
683,
713,
79,
387,
9,
465,
2545,
18,
4155,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP.NET authentication mode=Forms - so why am I getting a Windows Login prompt?
===
I have authentication mode set to forms in my asp.net web.config but am still getting a windows login prompt when i browse to the website.
Could authentication mode be set elsewhere, in IIS for example? My site runs on IIS 6.
Thanks. | 0 | [
2,
28,
306,
9,
2328,
27963,
3740,
3726,
4190,
18,
13,
8,
86,
483,
589,
31,
1017,
21,
1936,
6738,
108,
11443,
4417,
60,
800,
3726,
3726,
31,
57,
27963,
3740,
309,
20,
1997,
19,
51,
28,
306,
9,
2328,
2741,
9,
14093,
2816,
47,
58... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Algorithm for unique find edges from polygon mesh
===
I'm looking for a good algorithm that can give me the unique edges from a set of polygon data. In this case, the polygons are defined by two arrays. One array is the number of points per polygon, and the other array is a list of vertex indices.
I have a version that is working, but performance gets slow when reaching over 500,000 polys. My version walks over each face and adds each edge's sorted vertices to an stl::set. My data set will be primarily triangle and quad polys, and most edges will be shared.
Is there a smarter algorithm for this? | 0 | [
2,
9083,
26,
2619,
477,
7840,
37,
21309,
55,
1635,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
254,
9083,
30,
92,
590,
55,
14,
2619,
7840,
37,
21,
309,
16,
21309,
1054,
9,
19,
48,
610,
15,
14,
21309,
18,
50,
2811,
34,
81,
7718... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Data Mapper Pattern
===
Up until now i've been using Active records in all my c# database driven applications. But now my application requires my persistance code being split from my business objects. I have read a lot of posts regarding Martin Fowler's data mapping pattern, but my knowledge of this pattern is still very limited.
Let's use the following example :
If I have 2 tables - Customer and CustomerParameters. The CustomerParameters table contains default Customer values for creating a new Customer.
I will then have to create a CustomersMapper class to handle all of the Customer persistance. My Customer and CustomersList class will then collaborate with this mapper class in order to persist customer data.
I have the following questions :
1. How would I transfer raw data TO & FROM my Customer class to the mapper without breaking certain business rules? DTO's ?
2. Is it acceptable to have a SaveAll and LoadAll method in my Mapper class for updating and loading multiple customers' data? If so, in case of SaveAll, how will the mapper know when to update or insert data?
3. Will the Customer mapper class be responsible for retrieving the default values from the CustomerParameters table as well, or will it be better to create a CustomerParameters mapper ?
Any ideas and comments will be greatly appreciated. | 0 | [
2,
1054,
2942,
1432,
3732,
800,
3726,
3726,
71,
163,
130,
31,
22,
195,
74,
568,
1348,
742,
19,
65,
51,
272,
5910,
6018,
5355,
3767,
9,
47,
130,
51,
3010,
4781,
51,
22084,
2416,
1797,
142,
2132,
37,
51,
508,
3916,
9,
31,
57,
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... |
Architectural comments for queueing with RabbitMQ ?
===
I basically need a queueing technology that will enable to queue messages. These messages will then later be transmitted as SMS texts. RabbitMQ seems to be quite a good fit after I glossed over the apis.
My current architecture plans:
1. clients queue messages in RabbitMQ.
2. Another daemon will reads messages off RabbitMQ and sends those off to a 3rd party SMS gateway. The daemon should be able to spawn multiple listener threads.
3. I plan to host everything on slicehost.com using an Ubuntu Hardy.
Do you forsee any problems with this design? Since I have cursory knowledge of Erlang, I have no ideas on how to run it in a production environment. If you have any experience with Erlang or RabbitMQ, I'd like to hear your war stories.
| 0 | [
2,
5350,
7534,
26,
22521,
68,
29,
8335,
79,
1251,
13,
60,
800,
3726,
3726,
31,
11374,
376,
21,
22521,
68,
1099,
30,
129,
9240,
20,
22521,
7561,
9,
158,
7561,
129,
94,
138,
44,
13377,
28,
7613,
18,
6381,
9,
8335,
79,
1251,
2206,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 IDE's that support Python 3?
===
I recently saw an announcement and [article][1] outlining the release of the first [Python 3.0][2] release candidate. I was wondering whether there were any commercial, free, open source etc. IDE's that support its syntax.
[1]: http://www.linux.com/feature/150399
[2]: http://www.python.org/download/releases/3.0/ | 0 | [
2,
50,
80,
186,
13,
3448,
22,
18,
30,
555,
20059,
203,
60,
800,
3726,
3726,
31,
1989,
441,
40,
7435,
17,
636,
20360,
500,
2558,
165,
500,
70,
8930,
14,
830,
16,
14,
64,
636,
6448,
11570,
203,
9,
387,
500,
2558,
135,
500,
830,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 fill a vector with sequence numbers
===
I know how to fill an std::vector with sequence numbers:
void IndexArray( unsigned int length, std::vector<unsigned int>& v )
{
v.resize(length);
for ( unsigned int i = 0; i < length; ++i )
{
v[i] = i;
}
}
But this is a for-loop. Is there an elegant way to do this with less lines of code using stl functionality (and **not** using Boost)?
| 0 | [
2,
184,
20,
3509,
21,
7497,
29,
4030,
2116,
800,
3726,
3726,
31,
143,
184,
20,
3509,
40,
354,
43,
45,
45,
28033,
29,
4030,
2116,
45,
11364,
4348,
8576,
93,
5,
28839,
19,
38,
1476,
15,
354,
43,
45,
45,
28033,
1,
1020,
13472,
19... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best rich textarea editor for jQuery?
===
Something like this one on the Stackoverflow site would be nice!
Or something non-jQuery that doesn't conflict with jQuery $() tags would be great.
| 0 | [
2,
98,
25,
14,
246,
2042,
1854,
17760,
1835,
26,
487,
8190,
93,
60,
800,
3726,
3726,
301,
101,
48,
53,
27,
14,
7566,
2549,
9990,
689,
83,
44,
2210,
187,
54,
301,
538,
8,
728,
8190,
93,
30,
1437,
22,
38,
2930,
29,
487,
8190,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0... |
How do you setup Eclipse to work on iPhone development (instead of XCode)?
===
Although I've been getting more and more familiar with XCode while developing for the iPhone, there are times I just wished I had a better IDE, something like Eclipse.
So I was wondering does anyone know how to migrate iPhone projects to Eclipse, and if its worth it?
Thanks | 0 | [
2,
184,
107,
42,
18161,
11652,
20,
170,
27,
21024,
522,
13,
5,
108,
6849,
16,
993,
9375,
6,
60,
800,
3726,
3726,
419,
31,
22,
195,
74,
1017,
91,
17,
91,
3694,
29,
993,
9375,
133,
3561,
26,
14,
21024,
15,
80,
50,
436,
31,
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... |
Stop password prompt on MAMP startup
===
I develop using MAMP pro on my Mac. When I start MAMP it prompts me for a password if I use port 80. If I use a higher port it doesn't prompt me, but I have to append the port number in the URL ( eg dev.local:8888 ).
Does anyone know how to make it not prompt for password when using standard ports?
Thank you. | 0 | [
2,
747,
20884,
11443,
4417,
27,
1216,
2554,
20205,
800,
3726,
3726,
31,
2803,
568,
1216,
2554,
895,
27,
51,
1572,
9,
76,
31,
799,
1216,
2554,
32,
11443,
13531,
55,
26,
21,
20884,
100,
31,
275,
1295,
2972,
9,
100,
31,
275,
21,
11... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
using entity framework/nhibernate with sql2008 geography datatype
===
I am using sql express 2008 and vs2008, writing in c#.
I have a db table with a Geography column in it, into which I need to put gps data I collected. When I tried creating an Entity-Framework mapping for this table, it just ignored the column with some warning about not being able to map such column types.
I then looked at nHibernate.Spatial project, but it seems like it only translates the Geometry types, not the Geography. No luck there.
I've been told I can use a view with casting the Geography to VarBinary, and then in the created entity class add another Property that deserializes the binary back into Geography. I guess that will work for reading the data from the db, but I also need to insert those rows into my db, and I can't add rows to the view.
Is there some other trick I can use in order to easily read and write Geography data from my db, in my c# code? | 0 | [
2,
568,
9252,
6596,
118,
13880,
15191,
8820,
29,
4444,
255,
2753,
11320,
1054,
4474,
800,
3726,
3726,
31,
589,
568,
4444,
255,
2999,
570,
17,
4611,
2753,
15,
1174,
19,
272,
5910,
9,
31,
57,
21,
13,
9007,
859,
29,
21,
11320,
4698,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP.Net AJAX uses syntax like $get('myId'), is this standard javascript or JQuery?
===
It doesn't look like basic javascript but nor can I use JQuery commands like `$('myId')`. Is this or similar functions documented anywhere?
For reason I don't want to go into, I am not able to use 3rd party libraries like JQuery but if some powerful javascript extensions come with asp the I would like to know about them. | 0 | [
2,
28,
306,
9,
2328,
20624,
2027,
22649,
101,
5579,
3060,
5,
22,
915,
1340,
22,
6,
15,
25,
48,
1236,
8247,
8741,
54,
487,
8190,
93,
60,
800,
3726,
3726,
32,
1437,
22,
38,
361,
101,
2125,
8247,
8741,
47,
2127,
92,
31,
275,
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... |
Can you recommend a Shockwave Flash (SWF) to "movie" converter for OS X?
===
I've Googled this in various ways, and there's no shortage of software to do it. Since this is something I'm unlikely ever to do again, I'd prefer a free solution, but I'm also willing to pay if the best solution requires it.
I'm a fairly skilled software developer in multiple languages, so if anyone knows of a library that will do it (and is available for OS X), I have no problem "rolling my own".
I have a large number of SWF files for a training course I'm taking, and I want to convert them to H.264 for use on my Apple TV so I can watch them on my television more easily. This must be **Mac OS X** software, compatible with an Intel Leopard machine.
I don't mind having to convert to an intermediate format, but it sure would be nice to go directly to H.264.
Thanks in advance for your help! | 0 | [
2,
92,
42,
12360,
21,
3400,
10134,
4433,
13,
5,
18,
15263,
6,
20,
13,
7,
22607,
7,
25893,
26,
13,
759,
993,
60,
800,
3726,
3726,
31,
22,
195,
8144,
43,
48,
19,
617,
2847,
15,
17,
80,
22,
18,
90,
12847,
16,
2306,
20,
107,
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... |
Best Practice for Database Encryption in SQL Server 2005
===
I need to develop an application which stores data in a SQL Server 2005 database (the app itself will be either a WCF Service or an Asp.Net Web Service).
Now, this data is supremely confidential, and I need to have it stored in an encrypted form in the database.
So, I am wondering what the best practices are around this. I know that there is some encryption capabilities that SQL Server has in-built. Is there a 'for dummies' type of resource for this so that I can quickly get going.
Alternatively I was thinking that I could encrypt/decrypt in my C# code and not in the database - maybe have a layer which handles this just above the data access layer (is that a good idea)? | 0 | [
2,
246,
1345,
26,
6018,
24420,
19,
4444,
255,
8128,
812,
800,
3726,
3726,
31,
376,
20,
2803,
40,
3010,
56,
4134,
1054,
19,
21,
4444,
255,
8128,
812,
6018,
13,
5,
124,
4865,
1145,
129,
44,
694,
21,
11801,
410,
365,
54,
40,
28,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
As a Programmer, what specific problems have you faced with Windows Vista?
===
Please share problems faced by you as
[1] A Developer writing software FOR Vista.
[2] A Developer writing software ON Vista. | 0 | [
2,
28,
21,
17968,
15,
98,
1903,
1716,
57,
42,
3110,
29,
1936,
13520,
60,
800,
3726,
3726,
2247,
1891,
1716,
3110,
34,
42,
28,
636,
165,
500,
21,
10058,
1174,
2306,
26,
13520,
9,
636,
135,
500,
21,
10058,
1174,
2306,
27,
13520,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to Forcefully Rollback a Setup from Custom Actions?
===
I am creating a installer in .NET and using custom actions for controlling installation. Now there is certain conditions which I need to check and based on those I have to continue install OR rollback the installation.
How can I forcefully rollback the Setup from custom actions? | 0 | [
2,
184,
20,
25830,
3001,
1958,
21,
18161,
37,
5816,
3078,
60,
800,
3726,
3726,
31,
589,
2936,
21,
16146,
106,
19,
13,
9,
2328,
17,
568,
5816,
3078,
26,
10106,
7758,
9,
130,
80,
25,
1200,
2039,
56,
31,
376,
20,
2631,
17,
432,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to indicate public/protected/private members in JSDT outline view?
===
[Javascript Developer Tools][1] (JSDT) for Eclipse provides a nice outline view of Javascript classes, with a little symbol next to them to indicate visibility.
Looking at *Preferences->Javascript->Appearance->Members Sort Order*, it seems able to indicate whether a method is public, private or protected, but all of my use the "default" marker, a blue triangle.
Does anyone know how it determines which symbol to use? I've tried using Javadoc and JSDoc formatted comments. My private methods start with a leading underscore, and that doesn't give it a hint either.
Not a big deal, just would be nice to know...
[1]: http://wiki.eclipse.org/index.php/ATF/JSDT | 0 | [
2,
184,
20,
4342,
317,
118,
16265,
69,
118,
20181,
443,
19,
487,
18,
43,
38,
11160,
1418,
60,
800,
3726,
3726,
636,
1004,
1385,
8741,
10058,
4672,
500,
2558,
165,
500,
13,
5,
728,
18,
43,
38,
6,
26,
11652,
1927,
21,
2210,
11160,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 good documentation on the VB.Net Project file structure?
===
I need to start messing with a vb.net project file and I'd like a reference to, ideally, it's specification.
Any links would be very helpful | 0 | [
2,
25,
80,
186,
254,
13945,
27,
14,
13,
20468,
9,
2328,
669,
3893,
1411,
60,
800,
3726,
3726,
31,
376,
20,
799,
3957,
68,
29,
21,
13,
20468,
9,
2328,
669,
3893,
17,
31,
22,
43,
101,
21,
2801,
20,
15,
5628,
102,
15,
32,
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,
0,
0,
0,
0,
0,
0,
0... |
Best approach to use in Java 6 for a List being accessed concurrently
===
I have a List object being accessed by multiple threads. There is mostly one thread, and in some conditions two threads, that updates the list. There are one to five threads that can read from this list, depending on the number of user requests being processed.
The list is not a queue of tasks to perform, it is a list of domain objects that are being retrieved and updated concurrently.
Now there are several ways to make the access to this list thread-safe:
-use synchronized block
-use normal *Lock* (i.e. read and write ops share same lock)
-use *ReadWriteLock*
-use one of the new *ConcurrentBLABLBA* collection classes
**My question:**
What is the optimal approach to use, given that the cricital sections typically do not contain a lot of operations (mostly just adding/removing/inserting or getting elements from the list)?
Can you recommend another approach, not listed above? | 0 | [
2,
246,
2141,
20,
275,
19,
8247,
400,
26,
21,
968,
142,
12904,
17651,
800,
3726,
3726,
31,
57,
21,
968,
3095,
142,
12904,
34,
1886,
20396,
9,
80,
25,
1555,
53,
9322,
15,
17,
19,
109,
2039,
81,
20396,
15,
30,
16779,
14,
968,
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... |
Redirect to a link using the default broswser in Windows Form based application
===
I am not use: Process.Start (String, String) to open a link. But every time the browser open a new tab or new window to open the link.
Is there a way that to open the link in the latest opened page? Just redirection, no new tab or new window?
Thanks! | 0 | [
2,
302,
14706,
20,
21,
3508,
568,
14,
12838,
9184,
10268,
106,
19,
1936,
505,
432,
3010,
800,
3726,
3726,
31,
589,
52,
275,
45,
953,
9,
13680,
13,
5,
11130,
15,
3724,
6,
20,
368,
21,
3508,
9,
47,
352,
85,
14,
16495,
368,
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... |
What is the best way of parsing many complex command-line arguments in Java?
===
I have used getopt in Python and was hoping there would be something similar in Java. | 0 | [
2,
98,
25,
14,
246,
161,
16,
2017,
18,
68,
151,
1502,
1202,
8,
1143,
10553,
19,
8247,
60,
800,
3726,
3726,
31,
57,
147,
164,
2594,
38,
19,
20059,
17,
23,
3935,
80,
83,
44,
301,
835,
19,
8247,
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,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.