unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
interval rails caching
===
I need to cache a single page. I've used ActionController's caches_page for this. But now, I'd like to expire AND regenerate it once in every 10 minutes. What are my options? | 0 | [
2,
14422,
2240,
18,
1658,
7192,
800,
3726,
3726,
31,
376,
20,
16522,
21,
345,
2478,
9,
31,
22,
195,
147,
1028,
12898,
1252,
22,
18,
16522,
18,
1,
6486,
26,
48,
9,
47,
130,
15,
31,
22,
43,
101,
20,
25910,
17,
29608,
32,
382,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 can I choose between GET and POST methods in HTML forms?
===
I wish to know all the pros and contras about using this two methods. In particular the implications on the web security.
Thanks.
| 0 | [
2,
184,
92,
31,
3538,
128,
164,
17,
678,
3195,
19,
13,
15895,
1997,
60,
800,
3726,
3726,
31,
2536,
20,
143,
65,
14,
895,
18,
17,
11805,
18,
88,
568,
48,
81,
3195,
9,
19,
1498,
14,
14747,
27,
14,
2741,
1221,
9,
3669,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Red5: are there any low level tutorials or examples available online?
===
I've been wanting to use Red5 for quite a long time but everytime I set out and try something, I keep getting stuck. The examples that come with the application are informative, but I just can't seem to wrap my mind around everything (especially the Java part, since that is not one of my 'core' languages). Is there anyone who has found a tutorial or site that will help beginners with the Red5 software feel a bit more at ease? Or are there any books on this subject you have found really useful ? | 0 | [
2,
402,
264,
45,
50,
80,
186,
708,
662,
29724,
18,
54,
3770,
904,
2087,
60,
800,
3726,
3726,
31,
22,
195,
74,
4638,
20,
275,
402,
264,
26,
1450,
21,
175,
85,
47,
352,
891,
31,
309,
70,
17,
1131,
301,
15,
31,
643,
1017,
4549,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ZX Spectrum AY-3-8912 playback in XNA Game Studio
===
Are there any libraries, pieces of code or suchlike that'll let me play ZX Spectrum .ay files in my XNA Game Studio games? | 0 | [
2,
2052,
396,
8815,
21,
93,
8,
240,
8,
3877,
918,
21306,
19,
993,
325,
250,
1120,
800,
3726,
3726,
50,
80,
186,
8649,
15,
2491,
16,
1797,
54,
145,
1403,
30,
22,
211,
408,
55,
418,
2052,
396,
8815,
13,
9,
3707,
6488,
19,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Pros and cons of Localisation of technical words ?
===
This question is directed to the non-english speaking people here.
*It is somewhat biased because SO is an "english-speaking" web forum, so... In the other hand, most developers would know english anyway...*
In your locale culture, are technical words translated into locale words ? For example, how "Design Pattern", or "Factory", or whatever are written/said in german, spanish, etc. etc. when used by IT? Are the english words prefered? The local translation? Do the two version (english/locale) are evenly used? | 0 | [
2,
895,
18,
17,
11608,
16,
375,
4330,
16,
2447,
715,
13,
60,
800,
3726,
3726,
48,
1301,
25,
1012,
20,
14,
538,
8,
6024,
3324,
148,
235,
9,
1637,
242,
25,
4131,
10782,
69,
185,
86,
25,
40,
13,
7,
6024,
8,
7991,
7,
2741,
5691,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
flex webservice client
===
Has anybody any useful links that can be used to consume a web service using flex?
The easier the solution the better
Thanks
| 4 | [
2,
14409,
2741,
11449,
6819,
800,
3726,
3726,
63,
11181,
186,
4811,
6271,
30,
92,
44,
147,
20,
16447,
21,
2741,
365,
568,
14409,
60,
14,
4950,
14,
4295,
14,
574,
3669,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Can anyone recommend a primer to Erlang?
===
I've recently found myself getting more and more interested in Erlang.
I've purchased a book (Programming in Erlang) and started reading up on the basics. Reading books is time consuming so I am looking to shortcut this a bit and go back to the book later.
What I lack is a good introductory tutorial. Kind of like, hands on, this is what you need to get started in Erlang, these are best practices, this is how you organize code and this is how you do a small project.
I've googled this topic extensively and haven't had much luck. ;) | 4 | [
2,
92,
1276,
12360,
21,
1621,
139,
20,
13,
106,
9949,
60,
800,
3726,
3726,
31,
22,
195,
1989,
216,
992,
1017,
91,
17,
91,
3158,
19,
13,
106,
9949,
9,
31,
22,
195,
2432,
21,
360,
13,
5,
19746,
3863,
19,
13,
106,
9949,
6,
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 get a full call stack?
===
How can I get a full call stack for a c++ application developed with Visual Studio 2005? I would like to have a full call stack including the code in the system libraries.
Do I have to change some settings in Visual Studio, or do I have to install additional software? | 0 | [
2,
184,
20,
164,
21,
503,
645,
7566,
60,
800,
3726,
3726,
184,
92,
31,
164,
21,
503,
645,
7566,
26,
21,
272,
20512,
3010,
885,
29,
3458,
1120,
812,
60,
31,
83,
101,
20,
57,
21,
503,
645,
7566,
215,
14,
1797,
19,
14,
329,
864... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Large array arithemtics in C#
===
Which is the best way to store a 2D array in c# in order to optimize performance when performing lots of arithmetics on the elements in the array?
We have large (approx 1.5G) arrays, which for example we want to multiply with each other element by element. Performance is critical. The context in which this is done is in c#. Is there any smart way of storing the arrays and iterating over them? Could we write these parts in unmanaged C++ and will this really increase performance? The arrays need to be accessible to the rest of the c# program. | 0 | [
2,
370,
7718,
9647,
124,
79,
11677,
19,
272,
5910,
800,
3726,
3726,
56,
25,
14,
246,
161,
20,
1718,
21,
172,
43,
7718,
19,
272,
5910,
19,
389,
20,
22864,
956,
76,
2955,
7503,
16,
21211,
18,
27,
14,
2065,
19,
14,
7718,
60,
95,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Comparison between Centralized and Distributed Version Control Systems
===
What are the **benefits and drawbacks** with using **Centralized versus Distributed** Version Control Systems (DVCS)? Have you run into any problems in DVCS and how did you safeguard against these problems? *Keep the discussion tool agnostic and flaming to minimum.*
Those wondering what tools are available that are DVCS there are the following available as free/open source:
- [Git][1], (written in C) used by development on the [Linux Kernel][2] and [Ruby on Rails][3] (in [Github][4]).
- [Mercurial][5], (written in Python) used for [Wget and Xine][6].
- [Bazaar][7], (written in Python) used by [Ubuntu developmers][8]
- [Darcs][9], (written in Haskell)
[1]: http://git.or.cz/
[2]: http://git.kernel.org/
[3]: http://github.com/rails/rails/tree/master
[4]: http://github.com/
[5]: http://www.selenic.com/mercurial/
[6]: http://www.selenic.com/mercurial/wiki/index.cgi/ProjectsUsingMercurial
[7]: http://bazaar-vcs.org/
[8]: https://wiki.ubuntu.com/UbuntuDevelopment
[9]: http://en.wikipedia.org/wiki/Darcs | 4 | [
2,
6050,
128,
25176,
17,
4387,
615,
569,
1242,
800,
3726,
3726,
98,
50,
14,
13,
1409,
17092,
11765,
18,
17,
2003,
1958,
18,
1409,
29,
568,
13,
1409,
6306,
1333,
5706,
4387,
1409,
615,
569,
1242,
13,
5,
43,
8990,
18,
6,
60,
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... |
Supplementary development tools for Java
===
What are your favorite supplementary tools for Java development?
Mine are:
1) TotalCommander (due to the ability to search inside JARs).
2) JAD + Jadclipse (to decompile) | 0 | [
2,
27461,
522,
4672,
26,
8247,
800,
3726,
3726,
98,
50,
154,
3839,
27461,
4672,
26,
8247,
522,
60,
1114,
50,
45,
137,
6,
600,
16239,
106,
13,
5,
12633,
20,
14,
2165,
20,
2122,
572,
5112,
18,
6,
9,
172,
6,
3009,
43,
2754,
3009,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Developing MS Word add-in
===
Anyone knows of a good tool for developing add-ins for Word in .net?
Hopefully something that supports both office 2003 and 2007.
Thanks. | 0 | [
2,
3561,
4235,
833,
3547,
8,
108,
800,
3726,
3726,
1276,
3620,
16,
21,
254,
5607,
26,
3561,
3547,
8,
108,
18,
26,
833,
19,
13,
9,
2328,
60,
13416,
301,
30,
6747,
156,
488,
973,
17,
624,
9,
3669,
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... |
Tools for converting from ASP to ASP.NET?
===
We have a large ASP (classic ASP) application and we would like to convert it to .NET in order to work on further releases. It makes no sense continuing to use ASP as it is obsolete, and we don't want to rewrite it from scratch (Joel Spolsky tells you [why][1]).
Are there any tools for converting from ASP to ASP.NET 2.0 or 3.5?
[1]: http://www.joelonsoftware.com/articles/fog0000000069.html | 0 | [
2,
4672,
26,
19583,
37,
28,
306,
20,
28,
306,
9,
2328,
60,
800,
3726,
3726,
95,
57,
21,
370,
28,
306,
13,
5,
19824,
28,
306,
6,
3010,
17,
95,
83,
101,
20,
8406,
32,
20,
13,
9,
2328,
19,
389,
20,
170,
27,
653,
7073,
9,
32... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best solution to stop Kontiki's KHOST.EXE from loading automatically at start-up on Windows XP?
===
Essentially, whenever the **[40D][1]** application is run it sets up **khost.exe** to automatically start-up with Windows. This is annoying as it increases my boot up time by a couple of minutes and I don't even use the P2P aspect of 4OD anyway.
The registry keys that are set are:
Command: C:\Program Files\Kontiki\KHost.exe -all
Description: kdx
Location: HKU\S-1-5-21-1757981266-1960408961-839522115-1003\SOFTWARE\Microsoft\Windows\CurrentVersion\Run
Name: kdx
Setting ID:
User: LAPTOP\Me
Command: "C:\Program Files\Kontiki\KHost.exe" -all
Description: 4oD
Location: HKLM\SOFTWARE\Microsoft\Windows\CurrentVersion\Run
Name: 4oD
Setting ID:
User: All Users
I'm assuming some kind of **start-up** or **shut-down** **script** to delete these registry keys would be the best solution, but I'm not that up with **.vbs** or **.bat** scripting or where I'd put them to automatically run at an appropriate time.
I know there is a **[TV On-Demand Monitor application][2]**, but I don't really need to be running yet another process, just to delete the registry keys.
[1]: http://www.channel4.com/4od/index.html
[2]: http://odmonitor.blogspot.com/ | 0 | [
2,
246,
4295,
20,
747,
5191,
38,
9674,
22,
18,
10680,
384,
9,
1706,
62,
37,
12797,
7499,
35,
799,
8,
576,
27,
1936,
23045,
60,
800,
3726,
3726,
7398,
15,
6634,
14,
13,
1409,
2558,
2602,
43,
500,
2558,
165,
500,
1409,
3010,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does a javascript closure work ?
===
Like the old Albert said : "If you can't explain it to a six-year old, you really don't understand it yourself.”. Well I tried to explain JS closures to a 27 years old friend and completely failed.
Can anybody consider than I am 6 and strangely interested in that subject ?
EDIT : I have seen the scheme example given in SO, and it did not help. | 0 | [
2,
184,
630,
21,
8247,
8741,
7790,
170,
13,
60,
800,
3726,
3726,
101,
14,
315,
2953,
87,
13,
45,
13,
7,
821,
42,
92,
22,
38,
3271,
32,
20,
21,
490,
8,
731,
315,
15,
42,
510,
221,
22,
38,
1369,
32,
2834,
9,
1,
9,
134,
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... |
Cascade delete in Eclipselink in a self-referncing table
===
I'm trying to cascade a delete in JPA to a self-referencing table but whatever I do I get the same error.
@Entity
@Table(name="SYS_ACL", schema="dbo")
public class ACL implements Serializable {
private static final long serialVersionUID = 1L;
@EmbeddedId
protected AccessControlListPK accessControlListPK;
@JoinColumn(name = "ROLE_ID", referencedColumnName = "ID", nullable = false, insertable = false, updatable = false)
@ManyToOne(optional = false)
private Roletable roletable;
@JoinColumn(name = "VIEW_ID", referencedColumnName = "ID", nullable = false, insertable = false, updatable = false)
@ManyToOne(optional = false)
private PageMap pagemap;
@Column(name="PARENT_ROLE")
private Long parentrole;
@Column(name="PARENT_VIEW_ID")
private Long parentview;
@JoinColumns({
@JoinColumn(name = "PARENT_ROLE", referencedColumnName = "ROLE_ID", nullable = true, insertable = false, updatable = false),
@JoinColumn(name = "PARENT_VIEW_ID", referencedColumnName = "VIEW_ID", nullable = true, insertable = false, updatable = false)})
@OneToMany(cascade = CascadeType.ALL, orphanRemoval=true)
@PrivateOwned
private List<ACL> children = new LinkedList<ACL>();
This is the error that I'm getting:
Exception [EclipseLink-4002] (Eclipse Persistence Services - 2.3.0.v20110604-r9504): org.eclipse.persistence.exceptions.DatabaseException
Internal Exception: com.microsoft.sqlserver.jdbc.SQLServerException: The DELETE statement conflicted with the SAME TABLE REFERENCE constraint "SYSCCSSCNTRLLSTPRNTVWD". The conflict occurred in database "mydb", table "dbo.SYS_ACL" Error Code: 547
I can use a recursive method to delete children first but I want to know if it is possible doing that in JPA.
I'm using GF 3.1, and Eclipselink 2.3.0 | 0 | [
2,
13542,
27448,
19,
11652,
6258,
19,
21,
1119,
8,
14057,
10952,
6302,
859,
800,
3726,
3726,
31,
22,
79,
749,
20,
13542,
21,
27448,
19,
487,
1060,
20,
21,
1119,
8,
29254,
859,
47,
2099,
31,
107,
31,
164,
14,
205,
7019,
9,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Mobile web app without browser
===
Given a web application how can I make it to run on a mobile device without showing the browser window?
I'd want to install a shortcut to URL. When user clicks on it the application launches and only the main window opens, without toolbar and other browser functions. So the user does not know if it's a web app or native app. | 0 | [
2,
3241,
2741,
4865,
366,
16495,
800,
3726,
3726,
504,
21,
2741,
3010,
184,
92,
31,
233,
32,
20,
485,
27,
21,
3241,
3646,
366,
3187,
14,
16495,
1463,
60,
31,
22,
43,
259,
20,
16146,
21,
502,
4118,
20,
287,
6362,
9,
76,
4155,
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... |
split the string data and build a xml string by using linq to xml format in c#
===
trying the split the string data and build into xml format using linq to xml,but i am facing some difficulities to generate a xml string
mystring = {1:abcd}{2:efgh}{3:/r/n:12:mmm/r/n:65:nnn}
required output :
<MESSAGE>
<BLOCK1>
<VALUE>abcd</VALUE>
</BLOCK1>
<BLOCK2>
<VALUE>efgh</VALUE>
</BLOCK2>
<BLOCK3>
<TAG>12</TAG>
<VALUE>mmm</VALUE>
<TAG>65</TAG>
<VALUE>nnn</VALUE>
</BLOCK3>
</MESSAGE>
Kindly advice on the above same
| 0 | [
2,
2132,
14,
3724,
1054,
17,
1895,
21,
23504,
3724,
34,
568,
6294,
1251,
20,
23504,
2595,
19,
272,
5910,
800,
3726,
3726,
749,
14,
2132,
14,
3724,
1054,
17,
1895,
77,
23504,
2595,
568,
6294,
1251,
20,
23504,
15,
811,
31,
589,
4325... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
unable to invoke applet from jsp
===
_applet tag in jsp :_
<applet code ="applets/applet_1" height="500" width="500"/>
<%--This tag is inside the jsp page which is index.jsp--%>
![enter image description here][1]
why don't i see the applet ?
[1]: http://i.stack.imgur.com/DB8hG.png | 0 | [
2,
2343,
20,
28371,
4037,
38,
37,
487,
3401,
800,
3726,
3726,
13,
1,
24212,
38,
3383,
19,
487,
3401,
13,
45,
1,
13,
1,
24212,
38,
1797,
800,
7,
24212,
38,
18,
118,
24212,
38,
1,
165,
7,
2947,
3726,
7,
6000,
7,
9456,
3726,
7,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
p:calender multiple date selection
===
I am trying to achieve multiple selection of dates functionality with p:calender(primefaces 3.3),
in this way.
<p:calendar id="cal" showButtonPanel="true" mode="inline" value="#{bean.dates}" selection="multiple"/>
In Backing bean I have taken dates as a array in this way.
private Date[] dates;
public Date[] getDates() {
return dates;
}
public void setDates(Date[] dates) {
this.dates = dates;
}
But still didnt able to select multiple dates.
As per this blog http://blog.primefaces.org/?p=391 it works.
I tried to implement in same way .but did'nt worked.
Why is it so?
| 0 | [
2,
351,
45,
793,
21607,
1886,
1231,
3155,
800,
3726,
3726,
31,
589,
749,
20,
4689,
1886,
3155,
16,
4076,
18548,
29,
351,
45,
793,
21607,
5,
21108,
6413,
18,
203,
9,
240,
6,
15,
19,
48,
161,
9,
13,
1,
306,
45,
3430,
219,
2542,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
symphony datasource error
===
When creating a data source that pulls from any of my sections and pressing "create data source", I get the following error:
Forbidden
You don't have permission to access /symph-page/symphony/blueprints/datasources/new/ on this server.
Additionally, a 404 Not Found error was encountered while trying to use an ErrorDocument to handle the request.
Strangely, if I pull from the system or provide custom xml, the data source is created fine and I don't get the previous message. Running symphony 2.3 on server that should be meeting the technical requirements. I have run Symphony before and never encountered this sort of issue. | 0 | [
2,
5261,
1054,
12097,
7019,
800,
3726,
3726,
76,
2936,
21,
1054,
1267,
30,
8071,
37,
186,
16,
51,
4501,
17,
7196,
13,
7,
6037,
1373,
1054,
1267,
7,
15,
31,
164,
14,
249,
7019,
45,
11369,
42,
221,
22,
38,
57,
5572,
20,
1381,
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... |
compress binary data in sql server
===
I am **storing images** in my database(Sql Server 2008) **in binary formate**.
Table's Field datatype is image.
Right now i'm having rows above than millions in that table. Now i want to **compress that binary data.**
I have searched some solutions but they are on form levels means i have to write code in C# or VB.net and bring that binary data on that page. By compressing them with code i have to update that particular record.
but due to i have large number of data it is inconvenient to do this process on form side because it can take plenty of time.
So all i want some **code for SQL** so i can **create Stored Procedure** in my database, using which i can get each row at a time,**directly compress that binary data and update** that fetched column for that perticular row.
Is there any method available to do this process on **SQL server 2008**.
Thank you in Advance. | 1 | [
2,
26060,
14171,
1054,
19,
4444,
255,
8128,
800,
3726,
3726,
31,
589,
13,
1409,
18,
2153,
68,
3502,
1409,
19,
51,
6018,
5,
18,
22402,
8128,
570,
6,
13,
1409,
108,
14171,
26,
5281,
1409,
9,
859,
22,
18,
575,
1054,
4474,
25,
1961,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 add audio to avi?
===
I want to add the original audio stream of an avi video to the edited avi which has no sound (due to using OpenCV). FFmpeg is not an option as I develop a commercial program. I've come across two possible code snippets which would probably allow me to do that but both require further input to work. The first one is the function AddAviAudio of this site:
http://www.wischik.com/lu/programmer/avi_utils.html
as you can see I would need 3 parameters: HAVI avi, void *dat, unsigned long numbytes,
of which only the last two represent a problem. How and where to obtain them?
the other function SaveAudio comes from this site:
http://www.itlisting.org/3-windows-xp/a6ead23d8e938c70.aspx
the function requires two parameters.
My attempt for SaveAudio looks like this:
PAVIFILE avinew;
PAVIFILE avi3;
PAVISTREAM pStream;
AVIFileInit();
AVIFileOpen(&avi3, str4.c_str(), OF_READ, NULL);
AVIFileGetStream(avi3, &pStream,streamtypeAUDIO, 0);
AVISTREAMINFO infoAudio;
AVIStreamInfo(pStream, &infoAudio, sizeof(info));
LONG lSize; // in bytes
AVIStreamReadFormat(pStream, AVIStreamStart(pStream), NULL, &lSize);
LPBYTE pChunk = new BYTE[lSize];
AVIStreamReadFormat(pStream, AVIStreamStart(pStream), pChunk, &lSize);
LPBYTE pBuffer = new BYTE[lSize];
AVIStreamRead(pStream, 0, AVISTREAMREAD_CONVENIENT, pBuffer, lSize, NULL, NULL);
AVIFileRelease(avi3);AVIFileExit();
AVIFileInit();
AVIFileOpen(&avinew, avi, OF_WRITE, NULL);
SaveAudio(pStream,avinew);AVIStreamRelease(pStream);AVIFileRelease(avinew);AVIFileExit();
where str4.c_str() is the location of the original avi and 'avi' the location of the edited avi. As you can see I've chosen pStream and avinew as the parameters for the function, not knowing if they are actually the right ones.
Although the prog compiles and runs no audio is added. Obviously my attempt does not work. So what am I doing wrong or which lines are necessary to make it work? | 0 | [
2,
184,
20,
3547,
4023,
20,
13,
5271,
60,
800,
3726,
3726,
31,
259,
20,
3547,
14,
501,
4023,
3766,
16,
40,
13,
5271,
763,
20,
14,
4802,
13,
5271,
56,
63,
90,
646,
13,
5,
12633,
20,
568,
368,
12732,
6,
9,
13,
2460,
79,
20427,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Symfony and Doctrine2 - get info from annotations
===
I have entity `User` with field `userName` (with appriopriate getter and setter) which maps to field `user_name` in table `users`. In `UserRepository` I fetch one record from database and I have `$user` of class `User`. How can I find out table and field name for `$user->userName` ? I need somehow to fetch information from annotations. I found that this information is in Doctrine2 cache and I found [class ClassMetadataInfo documentation][1] but I don't know how to put it together.
[1]: http://www.doctrine-project.org/api/orm/2.2/class-Doctrine.ORM.Mapping.ClassMetadataInfo.html | 0 | [
2,
13,
7261,
10229,
93,
17,
7521,
135,
13,
8,
164,
15404,
37,
40,
1270,
7504,
800,
3726,
3726,
31,
57,
9252,
13,
1,
16704,
1,
29,
575,
13,
1,
16704,
7259,
1,
13,
5,
1410,
4865,
5741,
6944,
1373,
164,
815,
17,
309,
815,
6,
56... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 integrate a TDD approach with VisualStudio?
===
I am interested in hearing about experiences using TDD and unit testing for C++ in general with Visual Studio 2005 (Professional)
First some background. We have a fairly large project and much of it has been developed on Linux using CppUnit for the unit tests. The project is divided into several libraries, each with their own set of tests. I have a simple script which compiles the library, compiles the test suite and then runs the tests. So after making changes in the code I just run "test" from a command line and the tests run.
Now, most of the developers are using Visual Studio 2005 on Windows for the development of this product. Of course they can still run the tests from a command line using nmake but involves extra steps and I would prefer to have a much more integrated solution.
So my question has two parts.
Firstly, what is the best way of laying out the code for tests on a large code base? Is it normal to create several test projects in a solution, one for each library?
Secondly are there any tools for integrating CppUnit tests into Visual Studio? With dependencies set up corectly running the test project should run the tests but currently the results still appear in a command window. | 0 | [
2,
184,
107,
42,
18399,
21,
15596,
43,
2141,
29,
3458,
21026,
60,
800,
3726,
3726,
31,
589,
3158,
19,
3229,
88,
5513,
568,
15596,
43,
17,
1237,
4431,
26,
272,
20512,
19,
297,
29,
3458,
1120,
812,
13,
5,
17056,
6,
64,
109,
2395,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 querying the MySQL information_schema database a good way to find related tables?
===
I have a table which is referenced by foreign keys on many other tables. In my program if I want to delete one of these rows I need to first search for dependencies and present them to the user - "This object depends on x from table y, z from table q, etc". I also expect the number of tables which have foreign keys to this table to grow considerably over time.
Is the information_schema database a good way to do a search for all dependencies? I tried to query it to retrieve a list of all tables which have foreign keys to my table, then iterate over the result and select all entries from each table where the foreign key value matches the value the user is trying to delete. The query I have is as follows:
SELECT * FROM `KEY_COLUMN_USAGE` kcu
LEFT JOIN TABLE_CONSTRAINTS tc
ON tc.CONSTRAINT_NAME = kcu.CONSTRAINT_NAME
WHERE tc.CONSTRAINT_TYPE='FOREIGN KEY'
AND (kcu.REFERENCED_TABLE_SCHEMA='db')
AND (kcu.REFERENCED_TABLE_NAME = 'testtable')
which works perfectly for determining the tables which I need to search, however it is *very* slow. The query takes around 1 to 2 seconds at best to execute on my development machine, which will reduce a lot when I run it on my production server, but will still be quite slow.
I need to know if it's a bad idea to use information_schema in this way. If not, how I can extract better performance from the query. Is the query I'm using solid or is there a better way to do it? If so, how best should I tackle this problem from a maintainability perspective. | 0 | [
2,
25,
25597,
68,
14,
51,
18,
22402,
676,
1,
7526,
540,
6018,
21,
254,
161,
20,
477,
1597,
7484,
60,
800,
3726,
3726,
31,
57,
21,
859,
56,
25,
17571,
34,
1228,
5534,
27,
151,
89,
7484,
9,
19,
51,
625,
100,
31,
259,
20,
27448... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 coolest thing you have done with threads?
===
Just wondering | 0 | [
2,
98,
25,
14,
2700,
1430,
584,
42,
57,
677,
29,
20396,
60,
800,
3726,
3726,
114,
5712,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Can .Net 3.5 apps run on machines that have .Net 2.0 runtime installed?
===
I write my app in VS 2008 and so use all the fanciful stuffs such as LINQ, object initializers etc. Now can my app run on machines that have only .Net 2.0 runtime, but no .Net 3.5 runtime? .Net 3.5 runtime is a huge download, as all of you might know. | 0 | [
2,
92,
13,
9,
2328,
203,
9,
264,
4865,
18,
485,
27,
6035,
30,
57,
13,
9,
2328,
172,
9,
387,
485,
891,
4066,
60,
800,
3726,
3726,
31,
2757,
51,
4865,
19,
4611,
570,
17,
86,
275,
65,
14,
2514,
1892,
1566,
3217,
18,
145,
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... |
How does nunit work?
===
Can someone explain me how it works, starting from when you select to run a test | 0 | [
2,
184,
630,
10210,
242,
170,
60,
800,
3726,
3726,
92,
737,
3271,
55,
184,
32,
693,
15,
1422,
37,
76,
42,
5407,
20,
485,
21,
1289,
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... | [
1,
1,
1,
1,
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 handle the window close event (user clicking the 'X' button) in a Python Tkinter program?
===
How do I handle the window close event (user clicking the 'X' button) in a Python Tkinter program? | 0 | [
2,
184,
107,
31,
3053,
14,
1463,
543,
807,
13,
5,
16704,
25590,
14,
13,
22,
396,
22,
5167,
6,
19,
21,
20059,
13,
38,
1767,
815,
625,
60,
800,
3726,
3726,
184,
107,
31,
3053,
14,
1463,
543,
807,
13,
5,
16704,
25590,
14,
13,
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,
0,
0,
0... |
Is there a tool to monitor the SQL statements being executed by an .EXE ?
===
I'd like to be able to hook into a 3rd party application to see what SQL Statements are being executed. Specifically, it is a VB6 application running on SQL Server 2005.
For example, when the application fills out a grid, I'd like to be able to see exactly what query produced that data.
| 0 | [
2,
25,
80,
21,
5607,
20,
7626,
14,
4444,
255,
9015,
142,
5557,
34,
40,
13,
9,
1706,
62,
13,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
44,
777,
20,
5559,
77,
21,
203,
897,
346,
3010,
20,
196,
98,
4444,
255,
9015,
50,
142,
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... |
How do I determine when there is no more data to read in a NetworkStream?
===
I have a web app which connects to a server using a TCP connection and reads a binary document which it then writes to its response object. In other words it's transferring a file from a backend server using a custom protocol and returning that file to its client through HTTP.
The server sends a status code and a mime type, which I read successfully and then writes the contents of the file and closes the socket. This seems to work fine.
The client (a C# web app), reads the data:
private NetworkStream stream_;
public void WriteDocument(HttpResponse response)
{
while (stream_.DataAvailable)
{
const int bufsize = 4 * 1024;
byte[] buffer = new byte[bufsize];
int nbytes = stream_.Read(buffer, 0, bufsize);
if (nbytes > 0)
{
if (nbytes < bufsize)
Array.Resize<byte>(ref buffer, nbytes);
response.BinaryWrite(buffer);
}
}
response.End();
}
This seems to always exit the read loop before all the data has arrived. What am I doing wrong? | 0 | [
2,
184,
107,
31,
3746,
76,
80,
25,
90,
91,
1054,
20,
1302,
19,
21,
982,
11260,
60,
800,
3726,
3726,
31,
57,
21,
2741,
4865,
56,
8534,
20,
21,
8128,
568,
21,
13,
38,
7439,
2760,
17,
11137,
21,
14171,
4492,
56,
32,
94,
6215,
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... |
Local Database with Silverlight
===
What would be a good local database for a Silverlight application? The database's main purpose is for local data caching and synchronization services. I do not believe that SQL anywhere or SQLite will work since they use unmanaged code which will not run under the silverlight sandbox | 0 | [
2,
375,
6018,
29,
1172,
3130,
800,
3726,
3726,
98,
83,
44,
21,
254,
375,
6018,
26,
21,
1172,
3130,
3010,
60,
14,
6018,
22,
18,
407,
2131,
25,
26,
375,
1054,
1658,
7192,
17,
13,
16023,
1829,
687,
9,
31,
107,
52,
985,
30,
4444,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I make a Enso style application in C#
===
The background should be transparent, but the text should not. | 0 | [
2,
184,
92,
31,
233,
21,
1957,
656,
1034,
3010,
19,
272,
5910,
800,
3726,
3726,
14,
2395,
378,
44,
14862,
15,
47,
14,
1854,
378,
52,
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,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
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... |
Least intrusive antivirus software for development PC?
===
What is the least intrusive and most effective antivirus software for a Windows PC that is used for software development (lots of small files and lots of disk I/O)? The software should support running from the command line so that virus scan be included into the build process. | 0 | [
2,
639,
19,
8989,
18,
1284,
1082,
14792,
2306,
26,
522,
5168,
60,
800,
3726,
3726,
98,
25,
14,
639,
19,
8989,
18,
1284,
17,
127,
3140,
1082,
14792,
2306,
26,
21,
1936,
5168,
30,
25,
147,
26,
2306,
522,
13,
5,
5639,
18,
16,
284... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is a "callable" in Python ?
===
Now that it's clear [what a metaclass is][1], there is an associated concept that I use all the time without knowing what it really means.
I suppose everybody made once a mistake with parenthesis, resulting in an "object is not callable" exception. What's more, using \_\_init\_\_ and \_\_new\_\_ lead to wonder what this bloody \_\_call\_\_ can be used for.
Could you give me some explanations, including examples with the magic method ?
[1]: http://stackoverflow.com/questions/100003/what-is-a-metaclass-in-python | 0 | [
2,
98,
25,
21,
13,
7,
9200,
579,
7,
19,
20059,
13,
60,
800,
3726,
3726,
130,
30,
32,
22,
18,
1207,
636,
608,
21,
7618,
1898,
25,
500,
2558,
165,
500,
15,
80,
25,
40,
1598,
2420,
30,
31,
275,
65,
14,
85,
366,
2506,
98,
32,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I stay up-to-date on computer (especially software) security?
===
I recently bought and read a box set of books on security ([Building Secure Software: How to Avoid Security Problems the Right Way][1], [Exploiting Software: How to Break Code][2], and [Software Security: Building Security In][3]). Although I think that the contents of these books will be useful for years to come, the authors do acknowledge that the world of computer and software security changes very quickly. What are some ways that I could stay on top of the latest happenings in these areas?
[1]: http://www.amazon.com/Building-Secure-Software-Addison-Wesley-Professional/dp/020172152X/ref=sr_1_1?ie=UTF8&s=books&qid=1222011590&sr=8-1
[2]: http://www.amazon.com/Exploiting-Software-Break-Addison-Wesley-Security/dp/0201786958/ref=pd_sim_b_3
[3]: http://www.amazon.com/Software-Security-Building-Addison-Wesley/dp/0321356705/ref=pd_sim_b_1 | 0 | [
2,
184,
92,
31,
1179,
71,
8,
262,
8,
8209,
27,
1428,
13,
5,
12183,
2306,
6,
1221,
60,
800,
3726,
3726,
31,
1989,
2448,
17,
1302,
21,
1649,
309,
16,
964,
27,
1221,
13,
5,
2558,
11783,
4315,
2306,
45,
184,
20,
2658,
1221,
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... |
What are some simple projects you can do to learn the embedded programming basics?
===
For someone wanting to learn the rudiments of embedded programming, what are some simple projects they could tackle?
We're talking about someone that does know the basics of electronic circuitry (resistors, capacitors, digital ICs, etc...) and can do basic soldering. An electronics hobbyist that is looking to get into embedded programming, or maybe a sophomore or junior in a EE college degree.
The platform doesn't really matter and neither does the language (it could be C or assembler or whatever). The point is to get ideas for a simple project that does **something**. | 4 | [
2,
98,
50,
109,
1935,
2314,
42,
92,
107,
20,
2484,
14,
12138,
3143,
2125,
18,
60,
800,
3726,
3726,
26,
737,
4638,
20,
2484,
14,
26439,
6601,
16,
12138,
3143,
15,
98,
50,
109,
1935,
2314,
59,
110,
9723,
60,
95,
22,
99,
1582,
88... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where can I find an .xsd file to provide intellisense for Castle Windsor?
===
I'm looking for an .xsd schema file to drop into my Visual Studio directory to provide intellisense for the xml configuration file for the Castle Windsor IoC container. I've looked in the downloaded code for Windsor, as well as googled several different ways. I see many people asking the same question, but no answers. Anyone know if there is such a document? | 0 | [
2,
113,
92,
31,
477,
40,
13,
9,
396,
18,
43,
3893,
20,
1181,
14635,
3159,
6498,
26,
1339,
10784,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
40,
13,
9,
396,
18,
43,
23874,
3893,
20,
2804,
77,
51,
3458,
1120,
16755,
20,
1181,
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... |
VMware server 1.0.7 kernel modules don't compile with Linux kernel 2.6.26-1-686 (Debian)
===
- VMware server 1.0.7 installed with vmware-package
- Debian GNU/Linux testing (lenny)
- Kernel 2.6.26-1-686
There are several compile problems when trying to build the binary kernel modules from the vmware-server-kernel-source package made by vmware-package from the VMware server tarball. Recently VMware has updated their kernel module sources so as to make them compatible with kernel 2.6.25, but they broke again with 2.6.26.
vmmon-only/linux/driver.c:146: error: unknown field 'nopage' specified in initializer
vmmon-only/linux/driver.c:147: warning: initialization from incompatible pointer type
vmmon-only/linux/driver.c:150: error: unknown field 'nopage' specified in initializer
vmmon-only/linux/driver.c:151: warning: initialization from incompatible pointer type
That's only the first error, but there are other compile problems (in vmnet-only).
Many advice on forums are to use vmware-any-any instead, but that has its own problems (see [my other question][1]).
[1]: http://stackoverflow.com/questions/109877/unknown-ioctl-2062-2065-2066-from-vmmon-when-starting-a-vm-vmware-server-107-fo | 0 | [
2,
13,
20147,
5011,
8128,
137,
9,
387,
9,
465,
17007,
17113,
221,
22,
38,
26561,
29,
13024,
17007,
172,
9,
379,
9,
2409,
8,
165,
8,
379,
3274,
13,
5,
546,
10035,
6,
800,
3726,
3726,
13,
8,
13,
20147,
5011,
8128,
137,
9,
387,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 SQLITE with VB6
===
I am currently using an MSAccess mdb file for a redistributable app.
A while ago I found out about SQLite, as an alternative to my solution, but the binaries they provide do not offer the possiblilty of using them as an object in VB6. (Or at least I couldn't figure it out how).
Does anyone has a link, or could write a little about connecting to a SQLite DB from VB6, and its differences with using ADO? | 0 | [
2,
568,
4444,
10601,
29,
13,
20468,
379,
800,
3726,
3726,
31,
589,
871,
568,
40,
4235,
20604,
8138,
220,
3893,
26,
21,
402,
403,
13202,
5924,
4865,
9,
21,
133,
1464,
31,
216,
70,
88,
4444,
10601,
15,
28,
40,
2676,
20,
51,
4295,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Delphi Question : Multiple Tables in a TClientDataset?
===
Is it possible to put the results from more than one query on more than one table into a TClientDataset?
Just something like
SELECT * from t1;
SELECT * from t2;
SELECT * from t3;
I can't seem to figure out a way to get a data provider (SetProvider) to pull in results from more than one table at a time. | 0 | [
2,
23030,
1301,
13,
45,
1886,
7484,
19,
21,
13,
6668,
18513,
38,
18768,
3554,
60,
800,
3726,
3726,
25,
32,
938,
20,
442,
14,
1736,
37,
91,
119,
53,
25597,
27,
91,
119,
53,
859,
77,
21,
13,
6668,
18513,
38,
18768,
3554,
60,
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... |
Licensing / Protection Software?
===
I'm selling software online and would love to know what everyone else is using for licensing and protection. I know Armadillo is popular, as is EXECrypter, but what else is out there? | 4 | [
2,
15038,
13,
118,
2057,
2306,
60,
800,
3726,
3726,
31,
22,
79,
4355,
2306,
2087,
17,
83,
339,
20,
143,
98,
1266,
962,
25,
568,
26,
15038,
17,
2057,
9,
31,
143,
813,
1283,
7430,
25,
844,
15,
28,
25,
1396,
62,
11435,
106,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Marketing Software Online
===
What are some resources in use for marketing downloadable desktop software online? AdWords, certainly, and "organic" search engine results but is anyone having any luck making sales through sites like Tucows and/or Download.com anymorE? | 2 | [
2,
4743,
2306,
2087,
800,
3726,
3726,
98,
50,
109,
2566,
19,
275,
26,
4743,
27795,
17404,
2306,
2087,
60,
21,
43,
12827,
15,
3850,
15,
17,
13,
7,
6826,
596,
7,
2122,
1406,
1736,
47,
25,
1276,
452,
186,
5419,
544,
2598,
120,
3259... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0... |
How does Jan Willem Klop's "(L L L...)" Y combinator work?
===
I understand what a Y Combinator is (those who don't [should go here](http://stackoverflow.com/questions/93526/what-is-a-y-combinator)), but I don't understand this example of a "novel" YC, from the [Wikipedia page](http://en.wikipedia.org/wiki/Y_combinator):
<pre> Yk = (L L L L L L L L L L L L L L L L L L L L L L L L L L)
where:
L = λabcdefghijklmnopqstuvwxyzr. (r (t h i s i s a f i x e d p o i n t c o m b i n a t o r))</pre>
How does this work? | 0 | [
2,
184,
630,
2262,
18955,
17966,
306,
22,
18,
13,
7,
5,
255,
644,
644,
9,
9,
9,
6,
7,
13,
93,
12994,
108,
3457,
170,
60,
800,
3726,
3726,
31,
1369,
98,
21,
13,
93,
12994,
108,
3457,
25,
13,
5,
13577,
72,
221,
22,
38,
636,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best content type to serve JSONP?
===
I have a webservice that when called without specifying a callback will return a JSON string using <code>application/json</code> as the content type.
When a callback is specified it will wrap the JSON string in a callback function, so it's not really valid JSON anymore. My question is, should I serve it as <code>application/javascript</code> in this case or still use <code>application/json</code>? | 0 | [
2,
246,
2331,
1001,
20,
1884,
487,
528,
306,
60,
800,
3726,
3726,
31,
57,
21,
2741,
11449,
30,
76,
227,
366,
19077,
68,
21,
645,
1958,
129,
788,
21,
487,
528,
3724,
568,
13,
1,
9375,
1,
2552,
20669,
118,
728,
528,
1,
118,
9375... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 "P=NP?", and why is it such a famous question?
===
The question of whether P=NP is perhaps the most famous in all of Computer Science. What does it mean? And why is it so interesting?
Oh, and for extra credit, please post a proof of the statement's truth or falsehood. :) | 0 | [
2,
98,
22,
18,
13,
7,
306,
3726,
8157,
60,
7,
15,
17,
483,
25,
32,
145,
21,
1561,
1301,
60,
800,
3726,
3726,
14,
1301,
16,
1472,
351,
3726,
8157,
25,
1774,
14,
127,
1561,
19,
65,
16,
1428,
762,
9,
98,
630,
32,
884,
60,
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 convert legacy Interbase DB to SQL Server?
===
I have an Interbase DB. How can I convert it to SQL Server? | 0 | [
2,
184,
20,
8406,
7780,
1480,
8436,
13,
9007,
20,
4444,
255,
8128,
60,
800,
3726,
3726,
31,
57,
40,
1480,
8436,
13,
9007,
9,
184,
92,
31,
8406,
32,
20,
4444,
255,
8128,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What are some ADFS alternatives for doing single sign on for an ASP.NET app with users in active directory?
===
Needs to be secure and able to handle thousands of users... | 4 | [
2,
98,
50,
109,
21,
8736,
18,
2676,
18,
26,
845,
345,
1676,
27,
26,
40,
28,
306,
9,
2328,
4865,
29,
3878,
19,
1348,
16755,
60,
800,
3726,
3726,
2274,
20,
44,
4315,
17,
777,
20,
3053,
3805,
16,
3878,
9,
9,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Getting Arduino LilyPad to switch BlueSmirf v2.11 to/from command mode
===
A battery powered (2 x AA) Arduino LilyPad should switch a BlueSmirf v2.11 Bluetooth modem to/from command mode (see source code below). The BlueSmirf has been set to 9600 baud.
If the PC connects via Bluetooth (see source code below), the Arduino program runs fine at the beginning (sending multiple "ping\n"). After some time it (LilyPad/BlueSmirf) starts to also send "$$$" and "---\n" over the Bluetooth connection instead of switching to/from command mode.
Any ideas?
Regards,
tamberg
// Arduino source code:
void setup () {
Serial.begin(9600);
}
void loop () {
Serial.print("$$$");
delay(2000); // TODO: Inquiry, etc.
Serial.print("---\n");
delay(100);
Serial.print("ping\n");
delay(2000);
}
// C# source code (runs on PC)
using System;
using System.IO.Ports;
class Program {
static void Main () {
SerialPort p = new SerialPort("COM20", 9600, Parity.None, 8, StopBits.One);
using (p) {
p.Open();
while (p.IsOpen) {
Console.Write((char) p.ReadChar());
}
}
}
}
| 0 | [
2,
1017,
13,
1514,
291,
3252,
6274,
8240,
20,
5521,
4089,
8635,
410,
566,
135,
9,
1306,
20,
118,
2665,
1202,
3740,
800,
3726,
3726,
21,
5044,
7462,
13,
5,
135,
993,
21,
58,
6,
13,
1514,
291,
3252,
6274,
8240,
378,
5521,
21,
4089... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Combine multiple results in a subquery into a single comma-separated value
===
I'm sorry if the question is long-winded and/or unclear. I will try and make it clearer with any feedback I get.
I've got two tables:
TableA
-------
ID, Name
TableB
-------
ID, SomeColumn, TableA_ID (FK for TableA)
The relationship is one row of TableA - many of TableB.
Now, I want to see a result like this:
<pre>
ID Name SomeColumn
1. ABC X, Y, Z (these are three different rows)
2. MNO R, S
</pre>
This won't work (multiple results in a subquery):
SELECT ID, Name, (SELECT SomeColumn FROM TableB WHERE F_ID = TableA.ID) FROM TableA
This is a trivial problem if I do the processing on the client side. But this will mean I will have to run X queries on every page, where X is the number of results of TableA.
Note that I can't simply do a GROUP BY or something similar, as it will return multiple results for rows of TableA.
I'm not sure if a UDF, utilizing COALESCE or something similar might work? | 0 | [
2,
12287,
1886,
1736,
19,
21,
972,
8190,
93,
77,
21,
345,
11951,
58,
8,
18,
14189,
7432,
1923,
800,
3726,
3726,
31,
22,
79,
1875,
100,
14,
1301,
25,
175,
8,
7809,
69,
17,
118,
248,
11293,
9,
31,
129,
1131,
17,
233,
32,
1207,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Getting image dimensions without reading the entire file
===
Is there a cheap way to get the dimensions of an image (jpg, png, ...)? Preferably, I would like to achieve this using only the standard class library (because of hosting restrictions). I know that it should be relatively easy to read the image header and parse it myself, but it seems that something like this should be already there. Also, I’ve verified that the following piece of code reads the entire image (which I don’t want):
using System;
using System.Drawing;
namespace Test
{
class Program
{
static void Main(string[] args)
{
Image img = new Bitmap("test.png");
System.Console.WriteLine(img.Width + " x " + img.Height);
}
}
}
| 0 | [
2,
1017,
1961,
9913,
366,
1876,
14,
1078,
3893,
800,
3726,
3726,
25,
80,
21,
9148,
161,
20,
164,
14,
9913,
16,
40,
1961,
13,
5,
12851,
263,
15,
351,
2723,
15,
13,
9,
9,
9,
6,
60,
6369,
4801,
15,
31,
83,
101,
20,
4689,
48,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What XNA based 3D terrain and physics libraries exist?
===
I'm planning on creating a game that contains a landscape with objects on it. The landscape will be defined using a heightfield, and the objects will move about on top of, and fly over the terrain. If you've ever played the old games [Marble Madness][1] and [Virus/Zarch][2], that's the kind of complexity and style I'm trying to create.
I've seen various physics engines on the Internet, and a few tutorials about how to render heightfields as terrain, but they either lack documentation or seem overly complex for what I need.
All I need is a way to draw a heightfield, place 3D objects on it and then make them roll down the hills, or fly around in the sky. I don't mind making my own code to do this, so any relevant tutorials would be good too.
[1]: http://en.wikipedia.org/wiki/Marble_Madness
[2]: http://en.wikipedia.org/wiki/Zarch | 4 | [
2,
98,
993,
325,
432,
203,
43,
9132,
17,
4339,
8649,
3182,
60,
800,
3726,
3726,
31,
22,
79,
2334,
27,
2936,
21,
250,
30,
1588,
21,
4453,
29,
3916,
27,
32,
9,
14,
4453,
129,
44,
2811,
568,
21,
2947,
1109,
15,
17,
14,
3916,
12... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 different controler
===
I have some code which redirects the user to a login page but I'm having trouble changing the controller which is used. So I might do
public void OnAuthorization(AuthorizationContext context)
{
UserController u = new UserController();
context.Result = u.Login();
context.Cancel = true;
}
But this results in
The view 'Login' or its master could not be found. The following locations were searched:
~/Views/Product/Login.aspx
~/Views/Product/Login.ascx
~/Views/Shared/Login.aspx
~/Views/Shared/Login.ascx
I am running this from a product controler. How do I get the view engine to use the user controler rather than the product controler? | 0 | [
2,
302,
14706,
20,
421,
569,
106,
800,
3726,
3726,
31,
57,
109,
1797,
56,
302,
14706,
18,
14,
4155,
20,
21,
6738,
108,
2478,
47,
31,
22,
79,
452,
2572,
4226,
14,
9919,
56,
25,
147,
9,
86,
31,
530,
107,
317,
11364,
27,
10007,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 performance test Javascript code?
===
CPU Cycles, Memory Usage, Execution Time, Etc?
Added: Is there a quantitative way of testing performance in JavaScript besides just perception of how fast the code runs? | 0 | [
2,
184,
107,
42,
956,
1289,
8247,
8741,
1797,
60,
800,
3726,
3726,
17578,
14763,
15,
1912,
7514,
15,
5769,
85,
15,
2722,
60,
905,
45,
25,
80,
21,
22122,
161,
16,
4431,
956,
19,
8247,
8741,
3410,
114,
9332,
16,
184,
1512,
14,
179... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Difference between SSL and Kerberos authentication?
===
I am trying to understand what's the actual difference between SSL and Kerberos authentications, and why sometimes I have both SSL traffic and Kerberos.
Or does Kerberos use SSL in any way?
Anyone could help?
Thank you! | 0 | [
2,
2841,
128,
13,
18,
18,
255,
17,
7002,
2102,
759,
27963,
60,
800,
3726,
3726,
31,
589,
749,
20,
1369,
98,
22,
18,
14,
3463,
2841,
128,
13,
18,
18,
255,
17,
7002,
2102,
759,
27963,
18,
15,
17,
483,
1030,
31,
57,
156,
13,
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... |
How to stream binary data to standard output in .NET?
===
I'm trying to stream binary data to the standard output in .NET. However you can only write char using the Console class. I want to use it with <a href="http://en.wikipedia.org/wiki/Redirection_(Unix)">redirection</a>. Is there a way to do this? | 0 | [
2,
184,
20,
3766,
14171,
1054,
20,
1236,
5196,
19,
13,
9,
2328,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
3766,
14171,
1054,
20,
14,
1236,
5196,
19,
13,
9,
2328,
9,
207,
42,
92,
104,
2757,
4892,
568,
14,
8650,
718,
9,
31,
25... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Recommendations for a google finance-like interactive chart control
===
I need some sort of interactive chart control for my .NET-based web app. I have some wide XY charts, and the user should be able to interactively scroll and zoom into a specific window on the x axis. Something that acts similar to the google finance control would be nice, but without the need for the date labels or the news event annotations. Also, I'd prefer to avoid Flash, if that's even possible. Can someone please give some recommendations of something that might come close?
| 0 | [
2,
12121,
26,
21,
8144,
3711,
8,
1403,
9194,
1795,
569,
800,
3726,
3726,
31,
376,
109,
2058,
16,
9194,
1795,
569,
26,
51,
13,
9,
2328,
8,
1281,
2741,
4865,
9,
31,
57,
109,
1051,
13,
15161,
5158,
15,
17,
14,
4155,
378,
44,
777,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way to add tests to an existing project?
===
I have a Rails project which I neglected to build tests for (for shame!) and the code base has gotten pretty large. A friend of mine said that RSpec was a pain to use unless you use it from the beginning. Is this true? What would make him say that?
So, considering the available tests suites and the fact that the code base is already there, what would be my best course of action for getting this thing testable? Is it really that much different than doing it from the beginning? | 0 | [
2,
246,
161,
20,
3547,
4894,
20,
40,
3149,
669,
60,
800,
3726,
3726,
31,
57,
21,
2240,
18,
669,
56,
31,
18318,
20,
1895,
4894,
26,
13,
5,
1106,
7912,
187,
6,
17,
14,
1797,
1000,
63,
4094,
1772,
370,
9,
21,
860,
16,
1114,
87,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should domain objects and simple JavaBeans be unit tested?
===
Should simple JavaBeans that have only simple getters and setters be unit tested??
What about Beans with some logic in getters and setters? | 0 | [
2,
378,
4603,
3916,
17,
1935,
8247,
863,
5950,
44,
1237,
7631,
60,
800,
3726,
3726,
378,
1935,
8247,
863,
5950,
30,
57,
104,
1935,
164,
6052,
17,
309,
6052,
44,
1237,
7631,
60,
60,
98,
88,
14685,
29,
109,
7085,
19,
164,
6052,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is it a problem if multiple different accepting sockets use the same OpenSSL context?
===
Is it OK if the same OpenSSL context is used by several different accepting sockets?
In particular I'm using the same boost::asio::ssl::context with 2 different listening sockets. | 0 | [
2,
25,
32,
21,
1448,
100,
1886,
421,
10894,
18482,
18,
275,
14,
205,
8965,
18,
255,
4141,
60,
800,
3726,
3726,
25,
32,
5854,
100,
14,
205,
8965,
18,
255,
4141,
25,
147,
34,
238,
421,
10894,
18482,
18,
60,
19,
1498,
31,
22,
79,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Miktex on Windows Vista
===
I have some problems with Miktex installed on Windows Vista Business SP1/32 bit. I use miktex 2.7, ghostscript, and texniccenter 1 beta 7.50. When I compile a document with the following profiles: Latex=>DVI, Latex=>PDF everything works fine; the system crashes when I compile with profiles Latex=>PS and Latex=>PS=>PDF. The error is reported into a window that states: "Dvi-to-Postscript converter has stopped working". What can I do? I need Latex=>PS=>PDF to include my images into the final PDF.
Thanks in advance,
Yet another LaTeX user | 0 | [
2,
13,
11753,
38,
1706,
27,
1936,
13520,
800,
3726,
3726,
31,
57,
109,
1716,
29,
13,
11753,
38,
1706,
4066,
27,
1936,
13520,
508,
3782,
8197,
3125,
1142,
9,
31,
275,
13,
11753,
38,
1706,
172,
9,
465,
15,
3995,
8741,
15,
17,
1401... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 fix the flickering that occurs when you use slideToggle in jQuery?
===
I have a simple unordered list that I want to show and hide on click using the jQuery slideUp and slideDown effect. Everything seems to work fine, however in IE6 the list will slide up, flicker for a split second, and then disappear.
Does anyone know of a fix for this?
Thanks! | 0 | [
2,
184,
107,
42,
6098,
14,
22399,
30,
3690,
76,
42,
275,
6464,
262,
263,
4875,
19,
487,
8190,
93,
60,
800,
3726,
3726,
31,
57,
21,
1935,
367,
7861,
69,
968,
30,
31,
259,
20,
298,
17,
3077,
27,
10840,
568,
14,
487,
8190,
93,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to configure asp.net process to run under a domain account?
===
I would like to configure asp.net process to run under an account with domain credentials.
My requirement is to access some files on a network share.
What are the steps for this? Is there any built-in account I can use?
| 0 | [
2,
184,
20,
1065,
15951,
28,
306,
9,
2328,
953,
20,
485,
131,
21,
4603,
2176,
60,
800,
3726,
3726,
31,
83,
101,
20,
1065,
15951,
28,
306,
9,
2328,
953,
20,
485,
131,
40,
2176,
29,
4603,
5059,
43,
10107,
18,
9,
51,
8981,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
"Information Not Found" page in Visual Studio 2008, VB.NET Express Edition
===
I'm experimenting with VS 2008 Express edition and when I hit f1 on a keyword or class name I seem to get the Information Not Found page more than 90% of the time.
Is this a configuration problem? Is it because this is the "free-as-in-beer" Express edition? Did Microsoft move their online documentation since the version I downloaded?
I'm kind of amazed that here's a demo of their flagship development product which seems to be missing almost any kind of integrated reference documentation. How is the integrated help in Visual Studio meant to work? | 0 | [
2,
13,
7,
22793,
52,
216,
7,
2478,
19,
3458,
1120,
570,
15,
13,
20468,
9,
2328,
2999,
1322,
800,
3726,
3726,
31,
22,
79,
5737,
68,
29,
4611,
570,
2999,
1322,
17,
76,
31,
770,
398,
165,
27,
21,
1246,
9587,
54,
718,
204,
31,
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... |
Strange call stack, could it be problem in asio's usage of openssl?
===
I have this [strange call stack below][1] and I am stumped to understand why.
It seems to me that asio calls open ssl's read and then gets a negative return value (-37) .
Asio seems to then try to use it inside the memcpy function.
The function that causes this call stack is used hunderds of thousands of times without this error.
It happens only rarely, about once a week.
ulRead = (boost::asio::read(spCon->socket(), boost::asio::buffer(_requestHeader, _requestHeader.size()), boost::asio::transfer_at_least(_requestHeader.size()), error_));
Note that request header's size is exactly 3 bytes always.
Could anyone shed some light on possible reasons?
Here is the crashing call stack crash happens in memcpy:
![alt text][2]
[1]: http://www.vwsolutions.com/temp/strange_callstack.jpg
[2]: http://www.vwsolutions.com/temp/strange_callstack.jpg
| 0 | [
2,
2578,
645,
7566,
15,
110,
32,
44,
1448,
19,
28,
1963,
22,
18,
7514,
16,
8965,
18,
255,
60,
800,
3726,
3726,
31,
57,
48,
636,
21516,
645,
7566,
1021,
500,
2558,
165,
500,
17,
31,
589,
15781,
69,
20,
1369,
483,
9,
32,
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... |
How do I set the thickness of a line in VB.NET
===
In VB.NET I'm drawing an ellipse using some code like this.
aPen = New Pen(Color.Black)
g.DrawEllipse(aPen, n.boxLeft, n.boxTop, n.getWidth(), n.getHeight)
But I want to set the thickness of the line. How do I do it? Is it a property of the Pen or an argument to the DrawEllipse method?
(NB : For some reason, the help is VisualStudio is failing me so I've got to hit the web anyway. Thought I'd try here first.)
| 0 | [
2,
184,
107,
31,
309,
14,
16008,
16,
21,
293,
19,
13,
20468,
9,
2328,
800,
3726,
3726,
19,
13,
20468,
9,
2328,
31,
22,
79,
3533,
40,
13,
4223,
1919,
62,
568,
109,
1797,
101,
48,
9,
21,
3014,
800,
78,
2402,
5,
11282,
9,
5485,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Did you apply computational complexity theory in real life?
===
I'm taking a course in computational complexity and have so far had an impression that it won't be of much help to a developer.
I might be wrong but if you have gone down this path before, could you please an example of how the complexity theory helped you in your work? Tons of thanks. | 0 | [
2,
144,
42,
5645,
16439,
12745,
1639,
19,
683,
201,
60,
800,
3726,
3726,
31,
22,
79,
741,
21,
674,
19,
16439,
12745,
17,
57,
86,
463,
41,
40,
6394,
30,
32,
230,
22,
38,
44,
16,
212,
448,
20,
21,
10058,
9,
31,
530,
44,
1389,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which gcc switch disables "left-hand operand of comma has no effect" warning?
===
It's a part of larger code base, which forces -Werror on gcc. This warning is generated in a third party code that shouldn't be changed (and I actually know how to fix it), but I can disable specific warnings. This time man gcc failed me, so please, let some gcc master enlighten me. TIA. | 0 | [
2,
56,
489,
3384,
5521,
1460,
579,
18,
13,
7,
9742,
8,
3203,
1877,
706,
16,
11951,
58,
63,
90,
1590,
7,
3590,
60,
800,
3726,
3726,
32,
22,
18,
21,
141,
16,
1662,
1797,
1000,
15,
56,
879,
13,
8,
499,
29992,
27,
489,
3384,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I get the svn revision number in PHP?
===
I want to have my PHP Application labeled with the revision number which it uses, but don't want to use CruiseControl or update a file and upload it everytime. How should I do it? | 0 | [
2,
184,
92,
31,
164,
14,
13,
18,
16578,
11323,
234,
19,
13,
26120,
60,
800,
3726,
3726,
31,
259,
20,
57,
51,
13,
26120,
3010,
14348,
29,
14,
11323,
234,
56,
32,
2027,
15,
47,
221,
22,
38,
259,
20,
275,
6581,
12898,
54,
11100,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How can I detect, using php, if the machine has oracle (oci8 and/or pdo_oci) installed?
===
How can I detect, using php, if the machine has oracle (oci8 and/or pdo_oci) installed?
I'm working on a PHP project where some developers, such as myself, have it installed, but there's little need for the themers to have it. How can I write a quick function to use in the code so that my themers are able to work on the look of the site without having it crash on them? | 0 | [
2,
184,
92,
31,
9092,
15,
568,
13,
26120,
15,
100,
14,
1940,
63,
15759,
13,
5,
16325,
457,
17,
118,
248,
351,
537,
1,
16325,
6,
4066,
60,
800,
3726,
3726,
184,
92,
31,
9092,
15,
568,
13,
26120,
15,
100,
14,
1940,
63,
15759,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Kerberos and T125 protocol
===
Why does Kerberos authentication use T125 protocol? I believe Kerberos authentication behaves this way:<br><br>
- Client asks for a ticket to the Kerberos authority
- The Kerberos authority provides a Ticket to the client
- The Client tries to authenticate towards a Server and sends to the server this Ticket.
- The Server verifies the Ticket is OK with the Kerberos Authority, and authenticates the Client.
Now, where, in this process, is used T125 and why? <br>
And does the Client send the Ticket any time it tries to access (e.g: for each HTTP GET page) to the Server and the Server checks this Ticket any time, or is it just once at the beginning of the "conversation"?
Thank you! | 0 | [
2,
7002,
2102,
759,
17,
13,
38,
16649,
8494,
800,
3726,
3726,
483,
630,
7002,
2102,
759,
27963,
275,
13,
38,
16649,
8494,
60,
31,
985,
7002,
2102,
759,
27963,
14149,
18,
48,
161,
45,
1,
5145,
1,
5145,
1,
13,
8,
6819,
3913,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.Net 8-bit Encoding
===
I'm working on serial port, transmitting and receiving data to some hardware at 8bit data. I would like to store it as string to facilitate comparison, and preset data are stored as string or hex format in xml file. I found out that only when using Encoding.Default which is ANSI encoding then the 8bit data is converted properly and easily reversible. ASCII encoding will only works for 7bit data, and UTF8 or UTF7 doesn't works well too, since I'm using some character from 1-255. Encoding.Default would be just fine, but I read on MSDN that it's dependent on OS codepage setting, which means it might behave differently on different codepage configured. I use GetBytes() and GetString extensively using the Encoding, but would like a failsafe and portable method that works all the time at any configuration. Any idea or better suggestion for this? | 0 | [
2,
13,
9,
2328,
469,
8,
3326,
19608,
800,
3726,
3726,
31,
22,
79,
638,
27,
5956,
1295,
15,
25884,
17,
3396,
1054,
20,
109,
7610,
35,
469,
3326,
1054,
9,
31,
83,
101,
20,
1718,
32,
28,
3724,
20,
9681,
6050,
15,
17,
782,
3554,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Auto-implemented getters and setters vs. public members
===
I see a lot of example code for C# classes that does this:
public class Point {
public int x { get; set; }
public int y { get; set; }
}
Or, in older code, the same with an explicit private backing value and without the new auto-implemented properties:
public class Point {
private int _x;
private int _y;
public int x {
get { return _x; }
set { _x = value; }
}
public int y {
get { return _y; }
set { _y = value; }
}
}
My question is why. Is there any functional difference between doing the above and just making these members public, like below?
public class Point {
public int x;
public int y;
}
To be clear, I understand the value of getters and setters when you need to do some translation of the underlying data. But in cases where you're just passing the values through, it seems needlessly verbose. | 0 | [
2,
3108,
8,
8983,
413,
1130,
69,
164,
6052,
17,
309,
6052,
4611,
9,
317,
443,
800,
3726,
3726,
31,
196,
21,
865,
16,
823,
1797,
26,
272,
5910,
2684,
30,
630,
48,
45,
317,
718,
454,
13,
1,
317,
19,
38,
993,
13,
1,
164,
73,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why is it wrong to use std::auto_ptr<> with STL containers?
===
Why is it wrong to use std::auto_ptr<> with STL containers? | 0 | [
2,
483,
25,
32,
1389,
20,
275,
354,
43,
45,
45,
18042,
1,
4417,
139,
1,
29,
354,
255,
18988,
60,
800,
3726,
3726,
483,
25,
32,
1389,
20,
275,
354,
43,
45,
45,
18042,
1,
4417,
139,
1,
29,
354,
255,
18988,
60,
3,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Error creating UDF in SQL Server 2005
===
I'm trying to create a UDF in SQL Server 2005 Express as below:
CREATE FUNCTION [CombineValues] ()
RETURNS VARCHAR(8000)
AS
BEGIN
DECLARE @CuisineList VARCHAR(8000);
RETURN
(
SELECT @CuisineList = COALESCE(@CuisineList + ', ', '') +
CAST(Cuisine AS varchar(20))
FROM Cuisines
)
END
Cuisines has the structure:
CuisineID INT PK,
Cuisine VARCHAR(20)
When I try to create the function as above, I get an error:
<pre>
Msg 102, Level 15, State 1, Procedure CombineValues, Line 10
Incorrect syntax near '='.
</pre>
What am I doing wrong? | 0 | [
2,
7019,
2936,
287,
8736,
19,
4444,
255,
8128,
812,
800,
3726,
3726,
31,
22,
79,
749,
20,
1600,
21,
287,
8736,
19,
4444,
255,
8128,
812,
2999,
28,
1021,
45,
1600,
1990,
636,
10204,
1149,
15165,
18,
500,
13,
5,
6,
4815,
4033,
543... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
automatic way of adding properties in objective-c
===
When adding new properties to classes, I find myself typing the same things over and over in xcode:
1. add TYPE *NAME; (in .h interface)
2. add @property (nonatomic, retain) TYPE *NAME; (in .h)
3. add @synthesize NAME; (in .m)
4. add [NAME release]; (in .m dealloc)
(I'm in a non-garbage collected environment.)
How can I do this automatically?
| 0 | [
2,
6715,
161,
16,
4721,
3704,
19,
7038,
8,
150,
800,
3726,
3726,
76,
4721,
78,
3704,
20,
2684,
15,
31,
477,
992,
25266,
14,
205,
564,
84,
17,
84,
19,
993,
9375,
45,
137,
9,
3547,
1001,
1637,
7259,
73,
13,
5,
108,
13,
9,
252,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Create query parameters in javascript
===
Is there any way to create the query parameters for doing a GET request in javascript.
Just like in python you have [urllib.urlencode()][1] which takes in a dict (or list of two tuples) and creates a string like 'var1=value1&var2=value2'
[1]: http://docs.python.org/lib/module-urllib.html | 0 | [
2,
1600,
25597,
12905,
19,
8247,
8741,
800,
3726,
3726,
25,
80,
186,
161,
20,
1600,
14,
25597,
12905,
26,
845,
21,
164,
3772,
19,
8247,
8741,
9,
114,
101,
19,
20059,
42,
57,
636,
911,
211,
4598,
9,
911,
2284,
9375,
5,
6,
500,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why can't I check out from my Subversion repository?
===
I'm trying to setup a new computer to synchronize with my SVN repository that's hosted with cvsdude.com.
I get this error:
![SVN Error][1]
Here's what I did (these have worked in the past):
0. Downloaded and installed TortoiseSVN
0. Created a new folder C:\aspwebsite
0. Right-clicked, chose SVN Checkout...
0. Entered the following information, clicked OK:
- URL of repository: https://<reponame>-svn.cvsdude.com/aspwebsite
- Checkout directory: C:\aspwebsite
- Checkout depth: Fully recursive
- Omit externals: Unchecked
- Revision: HEAD revision
0. Got TortoiseSVN error:
- OPTIONS of 'https://<reponame>-svn.cvsdude.com/aspwebsite': could not connect to server (https://<reponame>-svn.cvsdude.com)
Rather than getting the error, TortoiseSVN should have asked for my username and password and then downloaded about 90MB.
Why can't I checkout from my Subversion repository?
[1]: http://img502.imageshack.us/img502/74/checkoutcc4.gif | 0 | [
2,
483,
92,
22,
38,
31,
2631,
70,
37,
51,
972,
10898,
24869,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
18161,
21,
78,
1428,
20,
13,
16023,
2952,
29,
51,
13,
18,
16578,
24869,
30,
22,
18,
2812,
29,
13,
12732,
18,
43,
8389,
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... |
Listview icons show up blurry (C#)
===
I'm attempting to display a "LargeIcon" view in a listview control, however the images I specify are blurry. This is what I have so far:
![alt text][1]
The .png files are 48x48 and that's what I have it set to display at in the ImageList properties. There's one thing that I've noticed (which is probably the cause) but I don't know how to change it. Inside the "Images Collection Editor" where you choose what images you want for the ImageList control, it looks like it's setting the wrong size for each image.
![alt text][2]
As you can see the "PhysicalDimension" and the "Size" is set to 16x16 and not abled to be manipulated. Does anyone have any ideas? Many thanks!
[1]: http://img220.imageshack.us/img220/1005/blurryiconsql3.jpg
[2]: http://img83.imageshack.us/img83/5218/imagepropertiesmf9.jpg | 0 | [
2,
968,
4725,
9801,
18,
298,
71,
10330,
622,
13,
5,
150,
5910,
6,
800,
3726,
3726,
31,
22,
79,
6314,
20,
3042,
21,
13,
7,
11312,
49,
1126,
7,
1418,
19,
21,
968,
4725,
569,
15,
207,
14,
3502,
31,
19077,
50,
10330,
622,
9,
48,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Lots of unnecessary frameworks load into my iPhone app - can I prevent this?
===
There appear to be a lot of unnecessary frameworks loading into my iPhone app. I didn't link against them in Xcode, and I don't need them.
When I run "lsof -p" against them on the iPhone, I see these (and others) that I can't explain:
- CoreVideo
- AddressBookUI
- JavaScriptCore
- MobileSync
- EAP8021X
- BluetoothManager
- MusicLibrary
- CoreAudio
- MobileMusicPlayer
- AddressBook
- CoreTelephony
- MobileBluetooth
- Calendar
- TelephonyUI
- WebCore / WebKit
- MediaPlayer
- VideoToolbox
I wonder whether this is contributing to the slow startup times. My app is very simple. It is basically a Twitter-like posting client. The only multimedia function is to pick an image from the camera or library, and it uses simple NSURL / NSURLConnection functions to post data to a couple of web services.
This is a jailbroken 2.1 iPhone with a few apps installed from Cydia. Is this normal?
| 0 | [
2,
7503,
16,
16435,
6596,
18,
6305,
77,
51,
21024,
4865,
13,
8,
92,
31,
2501,
48,
60,
800,
3726,
3726,
80,
1893,
20,
44,
21,
865,
16,
16435,
6596,
18,
12797,
77,
51,
21024,
4865,
9,
31,
223,
22,
38,
3508,
149,
105,
19,
993,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When the bots attack!
===
What are some popular spam prevention methods besides CAPTCHA. | 4 | [
2,
76,
14,
11012,
18,
991,
187,
800,
3726,
3726,
98,
50,
109,
844,
6954,
79,
10173,
3195,
3410,
13960,
1651,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What are some GUI clients available for Mercurial?
===
And where would I find them?
I happen to be stuck with Windows at the moment, but to appeal to general interest, other platforms would be good too. | 0 | [
2,
98,
50,
109,
9457,
7421,
904,
26,
9046,
3594,
192,
60,
800,
3726,
3726,
17,
113,
83,
31,
477,
105,
60,
31,
2384,
20,
44,
4549,
29,
1936,
35,
14,
688,
15,
47,
20,
4262,
20,
297,
1163,
15,
89,
6843,
83,
44,
254,
266,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How do I name a result group in a Regex? (.Net)
===
Title says it all... | 0 | [
2,
184,
107,
31,
204,
21,
829,
214,
19,
21,
7953,
1706,
60,
13,
5,
9,
2328,
6,
800,
3726,
3726,
581,
898,
32,
65,
9,
9,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
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... |
Conditions when finally does not execute in a .net try..finally block
===
Basically I've heard that certain conditions will cause .net to blow past the finally block. Does anyone know what those conditions are? | 0 | [
2,
2039,
76,
722,
630,
52,
15644,
19,
21,
13,
9,
2328,
1131,
9,
9,
4932,
102,
1921,
800,
3726,
3726,
11374,
31,
22,
195,
752,
30,
1200,
2039,
129,
1679,
13,
9,
2328,
20,
4459,
640,
14,
722,
1921,
9,
630,
1276,
143,
98,
273,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to capture PCM data from Wave Out
===
How would it be possible to capture the audio programmatically? I am implementing an application that streams in real time the desktop on the network. The video part is finished. I need to implement the audio part. I need a way to get PCM data from the sound card to feed to my encoder (implemented using Windows Media Format).
I think the answer is related to the openMixer(), waveInOpen() functions in Win32 API, but I am not sure exactly what should I do.
How to open the necessary channel and how to read PCM data from it?
Thanks in advance. | 0 | [
2,
184,
20,
3683,
5168,
79,
1054,
37,
2367,
70,
800,
3726,
3726,
184,
83,
32,
44,
938,
20,
3683,
14,
4023,
625,
6732,
1326,
60,
31,
589,
17333,
40,
3010,
30,
9464,
19,
683,
85,
14,
17404,
27,
14,
982,
9,
14,
763,
141,
25,
84... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 kind of prefix do you use for member variables?
===
No doubt, it's essential for understanding code to give member variables a prefix so that they can easily be distinguished from "normal" variables.
But what kind of prefix do you use?
I have been working on projects where we used **m_** as prefix, on other projects we used an underscore only (which I personally don't like, because an underscore only is not demonstrative enough).
On another project we used a long prefix form, that also included the variable type. **mul_** for example is the prefix of a **m**ember variable of type **u**nsigned **l**ong.
Now let me know what kind of prefix you use (and please give a reason for it). | 0 | [
2,
98,
825,
16,
14315,
107,
42,
275,
26,
322,
12157,
60,
800,
3726,
3726,
90,
3063,
15,
32,
22,
18,
5832,
26,
3260,
1797,
20,
590,
322,
12157,
21,
14315,
86,
30,
59,
92,
2351,
44,
3842,
37,
13,
7,
17462,
7,
12157,
9,
47,
98,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you store your code and files for use across machines
===
I am interested to know what strategies people have to keep their code AND work versioned across multiple machines. For example I have a desktop PC running XP, a macbook running OSX and VMWare running XP as well as a sales laptop for running product demos. I want to know how I can always have these in sync. Subversion is a possibility for this but i find it less useful for dealing with binary files - maybe I have overlooked something here. What do other people use as they must have similar issues? Do they keep all files on a USB drive and never on the local file system. I am not always online so remote storage is not really an option. | 0 | [
2,
184,
107,
42,
1718,
154,
1797,
17,
6488,
26,
275,
464,
6035,
800,
3726,
3726,
31,
589,
3158,
20,
143,
98,
10272,
148,
57,
20,
643,
66,
1797,
17,
170,
615,
69,
464,
1886,
6035,
9,
26,
823,
31,
57,
21,
17404,
5168,
946,
23045... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 the Window API, how do I ensure controls retain a native appearance?
===
Some of the controls I've created seem to default to the old Windows 95 theme, how do I prevent this? Here's an example of a button that does not retain the Operating System's native appearance (I'm using Vista as my development environment):
HWND button = CreateWindowEx(NULL, L"BUTTON", L"OK", WS_VISIBLE | WS_CHILD | BS_PUSHBUTTON,
170, 340, 80, 25, hwnd, NULL, GetModuleHandle(NULL), NULL);
I'm using native C++ with the Windows API, no managed code. | 0 | [
2,
568,
14,
1463,
21,
2159,
15,
184,
107,
31,
4062,
8671,
8201,
21,
1275,
1468,
60,
800,
3726,
3726,
109,
16,
14,
8671,
31,
22,
195,
679,
2260,
20,
12838,
20,
14,
315,
1936,
7969,
3184,
15,
184,
107,
31,
2501,
48,
60,
235,
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... |
Visual Studio Solutions / Multiple project : How to effectively propagate project properties amongst several projects
===
I am working with a Visual Studio 2005 C++ solution that includes multiple projects (about 30).
Based upon my experience, it often becomes annoying to maintain all the properties of the projects (i.e include path, lib path, linked libs, code generation options, ...), as you often have to click each and every project in order to modify them.
The situation becomes even worse when you have multiple configurations (Debug, Release, Release 64 bits, ...).
Real life examples:
- Assume you want to use a new library, and you need to add the include path to this library to all projects.
How will you avoid to have to edit the properties of each an every project?
- Assume you want to test drive a new version of library (say version 2.1beta) so that you need to quickly change the include paths / library path / linked library for a set of projects?
Notes:
- I am aware that it is possible to select multiple projects at a time, then make a right click and select "properties". However this method only works for properties that were already exactly identical for the different projects : you can not use it in order to add an include path to a set of project that were using different include path.
- I also know that it is possible to modify globally the environment options (Tools/Options/Project And solutions/Directories), however it is not that satisfying since it can not be integrated into a SCM
- I also know that one can add "Configurations" to a solutions. It does not helps since it makes another set of project properties to maintain
- I know that codegear C++ Builder 2009 offers a viable answer to this need through so called "Option sets" which can be inherited by several projects (I use both Visual Studio and C++ Builder, and I still thinks C++ Builder rocks on certain aspects as compared to Visual Studio)
- I expect that someone will suggest an "autconf" such as CMake, however is it possible to import vcproj files into such a tool?
| 0 | [
2,
3458,
1120,
6776,
13,
118,
1886,
669,
13,
45,
184,
20,
5463,
24618,
669,
3704,
4667,
238,
2314,
800,
3726,
3726,
31,
589,
638,
29,
21,
3458,
1120,
812,
272,
20512,
4295,
30,
1103,
1886,
2314,
13,
5,
6901,
712,
6,
9,
432,
685,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 happens on deserialization with this?
===
I'm currently convering my ASP.NET v2 application to serialize/deserialize it's objects because I want to shift from inproc session state to stateserver. This is because my host, webhost4life, has a nasty tendency to recycle the worker process frequently thus causing session timeouts. Anyway... the question...
I'm trying to not serialize things I don't need to, i.e. variables that are re-initialised each page, don't need to be serialised. Here's one of them:
<NonSerialized()> Private RollbackQueue As New Queue(Of DataServer.Rollback)
On deserialisation, will RollbackQueue be a) nothing or b) an empty queue? My guess is that when .NET deserialises, it creates the parent object as normal and then fills in the fields one by one. Therefore, the NEW bit will fire.
But that is a guess.
Thanks, Rob. | 0 | [
2,
98,
5531,
27,
1746,
106,
2815,
1829,
29,
48,
60,
800,
3726,
3726,
31,
22,
79,
871,
1065,
2304,
68,
51,
28,
306,
9,
2328,
566,
135,
3010,
20,
5956,
2952,
118,
3196,
106,
2815,
2952,
32,
22,
18,
3916,
185,
31,
259,
20,
4471,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Locking Row in SQL 2005-2008
===
Is there a way to lock a row in the SQL 2005-2008 database without starting a transaction, so other processes cannot update the row until it is unlocked? | 0 | [
2,
17538,
3131,
19,
4444,
255,
812,
8,
2753,
800,
3726,
3726,
25,
80,
21,
161,
20,
3991,
21,
3131,
19,
14,
4444,
255,
812,
8,
2753,
6018,
366,
1422,
21,
12799,
15,
86,
89,
5102,
1967,
11100,
14,
3131,
163,
32,
25,
15994,
60,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
"Cocoa Touch Application" Template from XCode 3.1.1
===
Just installed the latest SDK for iPhone 2.1. When I go to File -> New Project in XCode, under the iPhone OS Application selection, I don't see a template icon for "Cocoa Touch Application". Am I missing something? Anything else I need to download other than the iPhone SDK? | 0 | [
2,
13,
7,
716,
716,
58,
1723,
3010,
7,
22894,
37,
993,
9375,
203,
9,
165,
9,
165,
800,
3726,
3726,
114,
4066,
14,
5736,
13,
18,
43,
197,
26,
21024,
172,
9,
165,
9,
76,
31,
162,
20,
3893,
13,
8,
1,
78,
669,
19,
993,
9375,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 "spikes" figure in the schedule / estimation game?
===
Might be subjective and/or discussion.. but here goes.
I've been asked to estimate a feature for the next big thing at work. I break it down.. use story points come up with a estimate. The feature however calls for interfacing with GoDiagrams a third party diagramming component in addition to various other company initiatives.. (a whole set of 2008_Limited_Edition frameworks/services:). I've been tracking myself using a burn-up chart and I find that I'm unable to sustain my pace primarily due to "spikes".. [Definition][1]
I estimate for 2 points a week and then I find myself working weekends (well trying to.. end up neither here nor there) because I can't figure out where to hook in so that I can preview user-actions, show a context menu, etc. In the end I spend time making spikes that throw my schedule off-track... and decreases its value.. doesn't give the right picture.
Spikes are needed to drive nails through the planks of ignorance. But how are they factored into the estimation equation? Doing all required spikes before the feature seems wrong.. (might turn out to be YAGNI) Doing it in between disrupts my flow. Right now it's during pre-iteration planning.. but this is pushing the touchline out on a weekly basis.
[1]: http://www.think-box.co.uk/blog/2006/01/spike.html | 0 | [
2,
184,
107,
13,
7,
18,
2159,
7218,
7,
1465,
19,
14,
4345,
13,
118,
25390,
250,
60,
800,
3726,
3726,
530,
44,
22835,
17,
118,
248,
5460,
9,
9,
47,
235,
1852,
9,
31,
22,
195,
74,
411,
20,
10243,
21,
1580,
26,
14,
328,
580,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 multithreaded application?
===
Does anyone have any advice for a consistent way to unit test a multithreaded application? I have done one application where our mock "worker threads" had a thread.sleep with a time that was specified by a public member variable. We would use this so we could set how long a particular thread would take to complete its work, then we could do our assertions. Any ideas of a better way to do this? Any good mock frameworks for .Net that can handle this? | 0 | [
2,
1237,
4431,
21,
1889,
96,
10647,
69,
3010,
60,
800,
3726,
3726,
630,
1276,
57,
186,
4978,
26,
21,
8224,
161,
20,
1237,
1289,
21,
1889,
96,
10647,
69,
3010,
60,
31,
57,
677,
53,
3010,
113,
318,
10506,
13,
7,
22560,
20396,
7,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
6502 CPU Emulation
===
Its the weekend, so I relax from spending all week programming by writing a hobby project.
I wrote the framework of a MOS 6502 CPU emulator yesterday, the registers, stack, memory and all the opcodes are implemented. (Source will be available on CodePlex when its ready)
I can manually run a series of operations in the debugger I wrote, but I'd like to load a NES rom and just point the program counter at its instructions, I figured that this would be the fastest way to find flawed opcodes.
I wrote a quick NES rom loader and loaded the ROM banks into the CPU memory.
The problem is that I don't know how the opcodes are encoded. I know that the opcodes themselves follow a pattern of one byte per opcode that uniquely identifies the opcode,
0 - BRK
1 - ORA (D,X)
2 - COP b
etc
However I'm not sure where I'm supposed to find the opcode argument. Is it the the byte directly following? In absolute memory, I suppose it might not be a byte but a short.
Is anyone familiar with this CPU's memory model?
| 0 | [
2,
2074,
3564,
17578,
3579,
11123,
800,
3726,
3726,
82,
14,
4010,
15,
86,
31,
9738,
37,
4837,
65,
877,
3143,
34,
1174,
21,
18229,
669,
9,
31,
738,
14,
6596,
16,
21,
7641,
2074,
3564,
17578,
3579,
14868,
7124,
15,
14,
2243,
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... |
Zero SQL deadlock by design - any coding patterns?
===
I am encountering very infrequent yet annoying SQL deadlocks on a .NET 2.0 webapp running on top of MS SQL Server 2005. In the past, we have been dealing with the SQL deadlocks in the very empirical way - basically tweaking the queries until it work.
Yet, I found this approach very unsatisfactory: time consuming and unreliable. I would highly prefer to follow deterministic query patterns that would ensure **by design** that no SQL deadlock will be encountered - ever.
For example, in C# multithreaded programming, a simple design rule such as *the locks must be taken following their lexicographical order* ensures that no deadlock will *ever* happen.
Are there any SQL coding patterns guaranteed to be deadlock-proof? | 0 | [
2,
4606,
4444,
255,
828,
3966,
34,
704,
13,
8,
186,
13,
15458,
6282,
60,
800,
3726,
3726,
31,
589,
7007,
68,
253,
19,
22840,
768,
17610,
4444,
255,
828,
3966,
18,
27,
21,
13,
9,
2328,
172,
9,
387,
2741,
7753,
946,
27,
371,
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... |
Can people recommend some good books and resources on unit testing?
===
Can people recommend books and other resources on unit testing? All levels from beginning to advanced techniques. | 0 | [
2,
92,
148,
12360,
109,
254,
964,
17,
2566,
27,
1237,
4431,
60,
800,
3726,
3726,
92,
148,
12360,
964,
17,
89,
2566,
27,
1237,
4431,
60,
65,
2216,
37,
997,
20,
2255,
4212,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do you "preview" user actions like resize or editing in GoDiagrams?
===
- The GoDiagram object model has a GoDocument.
- GoViews have a reference to a GoDocument.
- If the user does any modification on the diagramming surface, a GoDocument.Changed event is raised with the relevant information in the event arguments.
I would like to be notified when some user-actions happen, so that I can confer with my Controller (disallow/cancel it if need be) and then issue view-update orders from there that actually modify the **Northwoods GoDiagram** third party component.
The Changed event is a notification that something just happened (past tense) - Doing all of the above in the event handler results in a .... (*wait for it*)... StackOverflowException. (GoDocument.Changed handler > Updates GoDocument > Firing new Changed events.. )
So question, how do I get a BeforeEditing or BeforeResizing kind of notification model in GoDiagrams? Has anyone who's been there lived to tell a tale? | 0 | [
2,
184,
107,
42,
13,
7,
3515,
4725,
7,
4155,
3078,
101,
302,
10454,
54,
9510,
19,
701,
549,
6295,
18,
60,
800,
3726,
3726,
13,
8,
14,
701,
549,
6295,
3095,
1061,
63,
21,
162,
28132,
9,
13,
8,
162,
4725,
18,
57,
21,
2801,
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... |
Web interface tool for debian repository?
===
What is the web interface tool that Debian or Ubuntu use for publicizing their custom repositories on the web?
Like [packages.debian.org][1]
Is such tool open sourced, so that it could be re-used for a custom repository?
[1]: http://www.debian.org/distrib/packages | 0 | [
2,
2741,
6573,
5607,
26,
121,
10035,
24869,
60,
800,
3726,
3726,
98,
25,
14,
2741,
6573,
5607,
30,
121,
10035,
54,
287,
12968,
2473,
275,
26,
317,
3335,
66,
5816,
302,
14882,
262,
2829,
27,
14,
2741,
60,
101,
636,
8573,
14465,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.