unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
What is a good application programming problem to solve for beginners?
===
I have been programming on and off for some years, mainly with game development. Now I am interested in refining my skills in *application development*, and I feel like getting down and dirty with creating at least one usable application. I am quite wandered in C#, but I feel as if I haven't really done "usable" application yet.
In game programming, people often get the advice to start with some simple games such as pong, tetris and pacman. Pong focuses on getting input, rendering and collision working basically. Tetris adds problem solving through algortihms. Pacman adds more problem with agent behaviour.
I would like to get inspiration for a simple application that solves a problem. That is - a "window application Pong program". What would you recommend being a newbie application problem that fulfilles the following requirements?
- **Usability** : The application should
solve a recurring popular problem
- **Difficulity** : The problem should not
be too advanced, yet not too simple
- **Timespan** : The application should
take no more than two weeks to solve
for a single programmer
- **Feature-"rich"** : The application
should consist of menues, allowing
users to config the program
- **Platform** : .Net 2.0+, C#
I would also want to play around a little with custom user controls.
Some of my own ideas include notepad-clone, mspaint-clone, simple file transfer program. While I guess these make up good exercises for aspiring application developers, I'd like to hear more from you. What makes a good beginnners application for programmers? | 0 | [
2,
98,
25,
21,
254,
3010,
3143,
1448,
20,
8402,
26,
26931,
18,
60,
800,
3726,
3726,
31,
57,
74,
3143,
27,
17,
168,
26,
109,
122,
15,
2011,
29,
250,
522,
9,
130,
31,
589,
3158,
19,
28650,
51,
3207,
19,
1637,
2552,
20669,
522,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
adding html to my RSS/Atom feed in Rails
===
The default rails XML builder escapes all html so something like:
atom_feed do |feed|
@stories.each do |story|
feed.entry story do |entry|
entry.title story.title
entry.content "<b>foo</b>"
end
end
end
will produce the text:
<b>foo</b>
instead of: **foo**
Is there any way to instruct the XML builder to not escape the XML?
| 0 | [
2,
4721,
13,
15895,
20,
51,
13,
1224,
18,
118,
58,
6015,
4063,
19,
2240,
18,
800,
3726,
3726,
14,
12838,
2240,
18,
23504,
14960,
16366,
65,
13,
15895,
86,
301,
101,
45,
14571,
1,
20954,
107,
13,
1,
20954,
1,
13,
1,
18,
262,
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... |
Why do I need to SEM_PRIORITY_Q when using a VxWorks inversion safe mutex?
===
In VxWorks, I am creating a mutex with the SEM INVERSION SAFE option, to protect against the priority inversion problem.
The manual says that I **must** also use the SEM PRIORITY Q option. Why is that?
Note: I have the answer, I will be posting it shortly, feel free to answer as yours might be better than mine but please don't be offended by this population of the SO knowledgebase | 0 | [
2,
483,
107,
31,
376,
20,
12829,
1,
6944,
248,
856,
1,
1251,
76,
568,
21,
566,
396,
7684,
19,
10898,
1834,
20562,
396,
60,
800,
3726,
3726,
19,
566,
396,
7684,
15,
31,
589,
2936,
21,
20562,
396,
29,
14,
12829,
19,
10898,
1834,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Rsync on Windows - Socket operation on non-socket
===
I get the following error when trying to run the latest Cygwin version of rsync in Windows XP SP2. The error occurs for attempts at both local and remote syncs. Any advice on how to fix/workaround it?
<pre>
bash-3.2$ rsync -a dir1 dir2
rsync: Failed to dup/close: Socket operation on non-socket (108)
rsync error: error in IPC code (code 14) at /home/lapo/packaging/tmp/rsync-2.6.9/pipe.c(143) [receiver=2.6.9]
rsync: read error: Connection reset by peer (104)
rsync error: error in IPC code (code 14) at /home/lapo/packaging/tmp/rsync-2.6.9/io.c(604) [sender=2.6.9]
</pre> | 0 | [
2,
761,
9507,
150,
27,
1936,
13,
8,
18482,
1453,
27,
538,
8,
18,
5668,
1198,
800,
3726,
3726,
31,
164,
14,
249,
7019,
76,
749,
20,
485,
14,
5736,
6728,
263,
4181,
615,
16,
761,
9507,
150,
19,
1936,
23045,
3782,
135,
9,
14,
701... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Performance of SOAP vs. XML-RPC or REST
===
The arguments about the simplicity of solutions using XML-RPC or REST are easy to understand and hard to argue with.
I have often also heard arguments that the increased overhead of SOAP may significantly impact used bandwidth and possibly even latency. I would like to see the results of a test that quantifies the impact. Any one know a good source for such information? | 0 | [
2,
956,
16,
6447,
4611,
9,
23504,
8,
139,
5779,
54,
760,
800,
3726,
3726,
14,
10553,
88,
14,
20595,
16,
6776,
568,
23504,
8,
139,
5779,
54,
760,
50,
2010,
20,
1369,
17,
552,
20,
6467,
29,
9,
31,
57,
478,
67,
752,
10553,
30,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get USB device inserted and removed events in a service without hearing my hard drive being accessed repeatedly on some O/S's?
===
I use this code in my Windows Service to be notified of USB devices being inserted and removed:
WqlEventQuery query = new WqlEventQuery("__InstanceOperationEvent",
"TargetInstance ISA 'Win32_LogicalDisk' AND TargetInstance.DriveType=2");
query.WithinInterval = TimeSpan.FromSeconds(1);
_deviceWatcher = new ManagementEventWatcher(query);
_deviceWatcher.EventArrived += new EventArrivedEventHandler(OnDeviceEventArrived);
_deviceWatcher.Start();
It works on XP and Vista, but on XP I can hear the very noticeable sound of the hard drive being accessed every second. Is there another WMI query that will give me the events without the sound effect? | 0 | [
2,
184,
107,
31,
164,
182,
220,
3646,
14215,
17,
1974,
963,
19,
21,
365,
366,
3229,
51,
552,
1493,
142,
12904,
8081,
27,
109,
635,
118,
18,
22,
18,
60,
800,
3726,
3726,
31,
275,
48,
1797,
19,
51,
1936,
365,
20,
44,
22904,
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... |
How to find the amount of physical memory occupied by a hash in perl?
===
I have a perl script where I maintain a very simple cache using a hash table. I would like to clear the hash once it occupies more than n bytes, to avoid perl (32 bit) running out of memory and crashing.
I can do a check on the number of keys-value pairs:
if (scalar keys %cache > $maxSize)
{
%cache = ();
}
But is it possible to check the actual memory occupied by the hash?
| 0 | [
2,
184,
20,
477,
14,
2006,
16,
1825,
1912,
3197,
34,
21,
19170,
19,
416,
255,
60,
800,
3726,
3726,
31,
57,
21,
416,
255,
3884,
113,
31,
4027,
21,
253,
1935,
16522,
568,
21,
19170,
859,
9,
31,
83,
101,
20,
1207,
14,
19170,
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,
1,
1,
1,
1,
1,
1,
1... |
Does the tee command always wait for EOF?
===
I'd like to log the output of a command to <code>stdout</code> as well as to a log file. I've got Cygwin installed and I'm trying to use the <code>tee</code> command to accomplish this.
devenv mysolution.sln /build myproject "Release|Win32" | tee build.log
Trouble is that <code>tee</code> seems to insist on waiting for the end of file before outputting anything to either <code>stdout</code> or the log file. This takes away the point of it all, which is to have a log file for future reference, but also some <code>stdout</code> logging so I can easily see the build progress.
<code>tee</code>'s options appear to be limited to <code>--append</code>, <code>--ignore-interrupts</code>, <code>--help</code>, and <code>--version</code>. So is there another method to get to what I'm trying to do? | 0 | [
2,
630,
14,
10366,
1202,
550,
1760,
26,
13,
62,
1041,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
6738,
14,
5196,
16,
21,
1202,
20,
13,
1,
9375,
1,
384,
43,
1320,
1,
118,
9375,
1,
28,
134,
28,
20,
21,
6738,
3893,
9,
31,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can new trademarks affect non-trademarked software?
===
Assumption:
* The new trademark is within the software domain.
* No trademarks existed when the software was named and release.
First, are the any requirements for the trademark applicant to survey established names?
If the trademark is established, how can this affect previous non-trademarked software?
| 0 | [
2,
184,
92,
78,
11005,
18,
6245,
538,
8,
19878,
22048,
2306,
60,
800,
3726,
3726,
12027,
45,
1637,
14,
78,
11005,
25,
363,
14,
2306,
4603,
9,
1637,
90,
11005,
18,
4589,
76,
14,
2306,
23,
377,
17,
830,
9,
64,
15,
50,
14,
186,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Porting Windows software to Embedded/Realtime Operating Systems
===
I have an existing codebase targeting a Windows environment and with an eye to the future, would like to make this as cross platform as possible.
I've had some sucess with standard Linux distributions by using cross platform libraries but would like to extend this to Realtime and or embedded operating systems.
Would it be possible to port the majority of the codebase to such systems, or would it require reimplentations targeted to that environment? If parts need to be recreated, does development for these systems require a different type of design approach? Some vendors supply their own IDE's for development, are these a necessity or can we or is it possible to standardise on a GNU toolchain type build process?
A potential pothole could be differences in IPC handling but without further exposure it is difficult to get a handle on the specifics.
NB although Windows based presently, there is not particularly heavy use of the Win32 API (mainly COM) or Windows types.
Thanks | 0 | [
2,
1295,
68,
1936,
2306,
20,
12138,
118,
7467,
891,
2455,
1242,
800,
3726,
3726,
31,
57,
40,
3149,
1797,
8436,
15972,
21,
1936,
2307,
17,
29,
40,
1356,
20,
14,
1022,
15,
83,
101,
20,
233,
48,
28,
919,
2452,
28,
938,
9,
31,
22,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the principles guiding your error handling policy?
===
**There is a lot of relativity involved in working with exceptions.** Beyond low level APIs where exceptions cover errors raised from hardware and the OS there is a shady area where the programmer decides what constitutes an exception and what is a normal condition.
How do you decide when to use exceptions? **Do you have a consistent policy regarding exceptions?** | 0 | [
2,
98,
50,
14,
5624,
17273,
154,
7019,
7988,
1486,
60,
800,
3726,
3726,
13,
1409,
1887,
25,
21,
865,
16,
23490,
1013,
19,
638,
29,
13392,
9,
1409,
1701,
708,
662,
21,
8954,
113,
13392,
1227,
11908,
1127,
37,
7610,
17,
14,
13,
75... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do you ever use the volatile keyword in Java?
===
In work today, I came across the volatile keyword in Java. Not being very familiar with it, I found this explaination: http://www.ibm.com/developerworks/java/library/j-jtp06197.html
Given the detail in which that article explains the keyword in question, do you ever use it or could you ever see a case in which you could use this keyword in the correct manner? | 0 | [
2,
107,
42,
462,
275,
14,
24208,
1246,
9587,
19,
8247,
60,
800,
3726,
3726,
19,
170,
786,
15,
31,
281,
464,
14,
24208,
1246,
9587,
19,
8247,
9,
52,
142,
253,
3694,
29,
32,
15,
31,
216,
48,
3271,
857,
45,
7775,
6903,
6483,
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... |
Why are fixnums in emacs only 29 bits?
===
And why don't they change it?
| 0 | [
2,
483,
50,
6098,
6336,
18,
19,
13,
62,
6893,
18,
104,
1515,
10181,
60,
800,
3726,
3726,
17,
483,
221,
22,
38,
59,
753,
32,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
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... |
What is the best/most simple serialization for .NET objects?
===
I would like to serialize and deserialize objects without having to worry about the entire class graph.
Flexibility is key.
I've found problems using the DataContract, JSON, and XML Serializers in that if you have a collection of objects you can get weird errors.
Please base your answers on actual experiences and not theory or reading of an article. | 0 | [
2,
98,
25,
14,
246,
118,
4630,
1935,
5956,
1829,
26,
13,
9,
2328,
3916,
60,
800,
3726,
3726,
31,
83,
101,
20,
5956,
2952,
17,
1746,
106,
2815,
2952,
3916,
366,
452,
20,
3189,
88,
14,
1078,
718,
7210,
9,
19401,
25,
1246,
9,
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... |
Algorithm to blend gradient filled corners in image
===
I need to put an alpha blended gradient border around an image. My problem is in blending the corners so they are smooth where the horizontal and vertical gradients meet. I believe there is a standard algorithm that solves this problem. I think I even encountered it in school many years ago. But I have been unsuccessful in finding any reference to one in several web searches.
(I have implemented a radial fill pattern in the corner, but the transition is still not smooth enough.)
**My questions**:
1. If there is a standard algorithm for
this problem, what is the name of
it, and even better, how is it
implemented?
2. Forgoing any standard algorithm,
what's the best way to determine the desired pixel
value to produce a smooth gradient
in the corners? (Make a smooth
transition from the vertical
gradient to the horizontal
gradient.)
| 0 | [
2,
9083,
20,
11138,
17442,
1943,
8894,
19,
1961,
800,
3726,
3726,
31,
376,
20,
442,
40,
5705,
23147,
17442,
1862,
140,
40,
1961,
9,
51,
1448,
25,
19,
25359,
14,
8894,
86,
59,
50,
3905,
113,
14,
10095,
17,
7035,
17442,
18,
1255,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Seam 2.0.2sp1 apps run on Tomcat 5.5.9 with JBoss Embedded?
===
I'm trying to run the Tomcat with JBoss Embedded jpa booking example. I run the build and deploy the war. I then get the following error:
<pre>
ERROR [catalina.core.ContainerBase.[Catalina].[localhost].[/jboss-seam-jpa]] Error configuring application listener of class com.sun.faces.config.ConfigureListener
java.lang.NoClassDefFoundError: javax/el/CompositeELResolver
at java.lang.Class.getDeclaredConstructors0(Native Method)
at java.lang.Class.privateGetDeclaredConstructors(Class.java:2357)
at java.lang.Class.getConstructor0(Class.java:2671)
at java.lang.Class.newInstance0(Class.java:321)
at java.lang.Class.newInstance(Class.java:303)
at org.apache.catalina.core.StandardContext.listenerStart(StandardContext.java:3618)
at org.apache.catalina.core.StandardContext.start(StandardContext.java:4104
</pre>
I find this class exists in el-api.jar which is not in the classpath. So I add el-api.jar to the WEB-INF/lib directory. I then get the following error:
<pre>
INFO: JSF1048: PostConstruct/PreDestroy annotations present. ManagedBeans methods marked with these annotations will have said annotations processed.
Sep 19, 2008 5:37:50 PM com.sun.faces.config.ConfigureListener installExpressionFactory
SEVERE: Error Instantiating ExpressionFactory
java.lang.ClassNotFoundException: com.sun.el.ExpressionFactoryImpl
at org.apache.catalina.loader.WebappClassLoader.loadClass(WebappClassLoader.java:1332)
at org.apache.catalina.loader.WebappClassLoader.loadClass(WebappClassLoader.java:1181)
at java.lang.ClassLoader.loadClassInternal(ClassLoader.java:319)
at java.lang.Class.forName0(Native Method)
at java.lang.Class.forName(Class.java:164)
at com.sun.faces.config.ConfigureListener.installExpressionFactory(ConfigureListener.java:1521)
</pre>
This library appears to be in el-ri.jar or JSP 2.1 jar. Am I doing something wrong? Is there a place that explains how to run seam applications on tomcat 5.5.x? Any help is greatly appreciated! | 0 | [
2,
92,
13927,
172,
9,
387,
9,
135,
3401,
165,
4865,
18,
485,
27,
2067,
5782,
331,
9,
264,
9,
518,
29,
487,
10349,
18,
12138,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
485,
14,
2067,
5782,
29,
487,
10349,
18,
12138,
487,
1060,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 give java.util.Random a specific seed in thirdparty classes?
===
I have a Java program that loads thirdparty class files (classes I did not write) and executes them. These classes often use `java.util.Random`, which by default generates random starting seed values every time it gets instantiated. For reasons of reproducability, I want to give these classes the same starting seed every time, changing it only at my discretion.
Here are some of the obvious solutions, and why they don't work:
1. Use a different Random class in the thirdparty classfiles. The problem here is I only load the class files, and cannot modify the source.
2. Use a custom classloader to load our own Random class instead of the JVM's version. This approach will not work because Java does not allow classloaders to override classes in the `java` package.
3. Swap out the rt.jar's `java.util.Random` implementation for our own, or putting files into trusted locations for the JVM. These approaches require the user of the application messing with the JVM install on their machine, and are no good.
So how can I do this? | 0 | [
2,
184,
92,
31,
590,
8247,
9,
14255,
9,
2195,
5555,
21,
1903,
5134,
19,
422,
9635,
2684,
60,
800,
3726,
3726,
31,
57,
21,
8247,
625,
30,
19069,
422,
9635,
718,
6488,
13,
5,
1898,
160,
31,
144,
52,
2757,
6,
17,
15644,
18,
105,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why unicode() uses str() on my object only with no encoding given?
===
I start by creating a string variable with some **non-ascii** *utf-8* encoded data on it:
>>> text = 'á'
>>> text
'\xc3\xa1'
>>> text.decode('utf-8')
u'\xe1'
Using `unicode()` on it raises errors...
>>> unicode(text)
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
UnicodeDecodeError: 'ascii' codec can't decode byte 0xc3 in position 0:
ordinal not in range(128)
...but if I know the encoding I can use it as second parameter:
>>> unicode(text, 'utf-8')
u'\xe1'
>>> unicode(text, 'utf-8') == text.decode('utf-8')
True
Now if I have a class that returns this text in the `__str__()` method:
>>> class ReturnsEncoded(object):
... def __str__(self):
... return text
...
>>> r = ReturnsEncoded()
>>> str(r)
'\xc3\xa1'
`unicode(r)` seems to use `str()` on it, since it raises the same error as `unicode(text)` above:
>>> unicode(r)
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
UnicodeDecodeError: 'ascii' codec can't decode byte 0xc3 in position 0:
ordinal not in range(128)
But as no one would ever expect, `unicode(r, 'utf-8')` won't even try:
>>> unicode(r, 'utf-8')
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
TypeError: coercing to Unicode: need string or buffer, ReturnsEncoded found
Why? Is it a bug? is it intended? Very awkward. | 0 | [
2,
483,
28010,
5,
6,
2027,
13,
9729,
5,
6,
27,
51,
3095,
104,
29,
90,
19608,
504,
60,
800,
3726,
3726,
31,
799,
34,
2936,
21,
3724,
7612,
29,
109,
13,
1409,
3951,
8,
472,
1892,
49,
1409,
1637,
1982,
410,
8,
457,
2483,
13665,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it safe to use the Administrator Tasks in Central Administration?
===
Strange question, but: Sharepoint 2007 greets you with the Administrator Tasks on the Central Administration after installation.
I just wonder if this list is "safe" to be used for my own Administration Tasks? The reason why i'm asking is because I found that Sharepoint uses a lot of "black magic" and unlogical behaviour and breaks rather easily, so I do not want risk breaking anything if i'm entering my own tasks into the task list. | 0 | [
2,
25,
32,
1834,
20,
275,
14,
8890,
8674,
19,
521,
1603,
60,
800,
3726,
3726,
2578,
1301,
15,
47,
45,
1891,
3132,
624,
16624,
18,
42,
29,
14,
8890,
8674,
27,
14,
521,
1603,
75,
7758,
9,
31,
114,
2666,
100,
48,
968,
25,
13,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
webpage template where content takes full height of viewport if has 1 line minus footer
===
I am looking for a css based web page template where the main content div takes full height of the view port (minus header and footer heights) when its content has few lines. Footer should be at the bottom of the view port (instead of right below content and instead of showing in middle of viewport). Content area needs to extent vertically to flush with top of footer. Case #1
In all other cases where the content requires more than viewport area, then footer can be at the bottom of the web page (instead of bottom of viewport) as standard web design.
A link to a specific link or sample code appreciated. Don't mention a templates site and tell me to do a search there.
Sketch for case #1:
-------------- <-----
header area | |
-------------| |
small content| |
| viewport
| |
| |
-------------| |
footer area | |
-------------- <-----
all other cases:
-------------- <-----
header area | |
-------------| |
big content | |
| viewport
| |
| |
| |
| |
| <----
|
-------------|
footer area |
--------------
| 0 | [
2,
2741,
6486,
22894,
113,
2331,
1384,
503,
2947,
16,
1418,
1993,
100,
63,
137,
293,
13,
15495,
1749,
106,
800,
3726,
3726,
31,
589,
699,
26,
21,
272,
18,
18,
432,
2741,
2478,
22894,
113,
14,
407,
2331,
13,
12916,
1384,
503,
2947,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Simultaneously monitoring multiple log files (over ssh) on Windows ?
===
I've used poderosa(a .NET terminal app) to monitor logs on multiple linux/solaris servers. This application is NOT getting currently maintained and I've had several problems with it.
I'm wondering what other users do to simultaneously monitor several logs in real-time(as in tail -f logfile). I would like to be able to tab/cascade several ssh tails.
thank you | 0 | [
2,
6888,
8984,
1886,
6738,
6488,
13,
5,
2549,
13,
18,
1635,
6,
27,
1936,
13,
60,
800,
3726,
3726,
31,
22,
195,
147,
8848,
106,
4947,
5,
58,
13,
9,
2328,
3855,
4865,
6,
20,
7626,
18893,
27,
1886,
13024,
118,
5594,
14688,
17595,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to create a new type of entity in Microsoft Robotics Studio 2.0?
===
What I'm trying to do with MRS is to teach myself some basic AI; what I want to do is to make a rocket entity, with things such as vectored exhaust, and staging. Anyone have an idea on how to make an entity that can fly? Or do I just need to constantly apply a force upwards? | 0 | [
2,
184,
20,
1600,
21,
78,
1001,
16,
9252,
19,
7099,
15219,
18,
1120,
172,
9,
387,
60,
800,
3726,
3726,
98,
31,
22,
79,
749,
20,
107,
29,
2045,
25,
20,
5348,
992,
109,
2125,
21,
49,
73,
98,
31,
259,
20,
107,
25,
20,
233,
21... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get PHPMyAdmin to show MySQL warnings?
===
I use PHPMyAdmin for convenience in updating a remote database.
But it doesn't show warnings, by default, which recently got me into some embarrassing trouble where I was updating a SET field with string not on its list and not noticing the problem.
I'm using 2.11.9.1 (Dreamhost's default install).
On the PHPMyAdmin wiki it lists "Display warnings" as a feature of [version 2.9.0][1] and even "Display all warnings" as a feature of 2.10.2 -- but how do I actually turn this on? The documentation isn't great.
[1]: http://wiki.cihar.com/pma/phpMyAdmin_2.9.0-rc1 | 0 | [
2,
184,
20,
164,
13,
26120,
915,
1283,
2160,
20,
298,
51,
18,
22402,
3590,
18,
60,
800,
3726,
3726,
31,
275,
13,
26120,
915,
1283,
2160,
26,
16517,
19,
71,
43,
1880,
21,
5388,
6018,
9,
47,
32,
1437,
22,
38,
298,
3590,
18,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Blackberry Image effects
===
How to convert original image into sepia effect and negative effect.
I saw the android code for that but I want it in Blackberry.
I tried but does not work.....
Help me, Its urgent. | 0 | [
2,
27367,
1961,
2292,
800,
3726,
3726,
184,
20,
8406,
501,
1961,
77,
10332,
549,
1590,
17,
3682,
1590,
9,
31,
441,
14,
13005,
1797,
26,
30,
47,
31,
259,
32,
19,
27367,
9,
31,
794,
47,
630,
52,
170,
9,
9,
9,
9,
9,
448,
55,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Response.Write parts of html
===
I have a huge HTML table (not table really but div's) that is generating and loading realy long to the browser. So I decided to try to render this table by parts. I mean to render rows as they are ready at the server side. Using this the user can see some information at the page even if it is not fully genereted on server side.
I tried to play with HTTP handler and
context.Response.Write
context.Response.Flush();
But without any luck.
Can anybody please help me with streaming this html parts from server side to the client? | 0 | [
2,
1627,
9,
23716,
1341,
16,
13,
15895,
800,
3726,
3726,
31,
57,
21,
2329,
13,
15895,
859,
13,
5,
1270,
859,
510,
47,
13,
12916,
22,
18,
6,
30,
25,
13500,
17,
12797,
683,
93,
175,
20,
14,
16495,
9,
86,
31,
868,
20,
1131,
20,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I create this XML in .Net?
===
I need to serialise an object to the following XML in .Net.
Probably the easiest way is to implement IXMLSerializable due to the control I need over the end result.... What do I need to do to output in the following schema:
<ns2:ProcessRepairOrder languageCode="de-DE" releaseID="1.0" systemEnvironmentCode="PROD" versionID="1.0">
<ns2:ApplicationArea>
<ns2:Sender>
<ns2:CreatorNameCode xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:type="ns3:TextType">SomeVendor</ns2:CreatorNameCode>
<ns2:SenderNameCode name="Dave"/>
<ns2:Sender>
</ns2:ApplicationArea>
</ns2:ProcessRepairOrder>
| 0 | [
2,
184,
92,
31,
1600,
48,
23504,
19,
13,
9,
2328,
60,
800,
3726,
3726,
31,
376,
20,
5956,
2628,
40,
3095,
20,
14,
249,
23504,
19,
13,
9,
2328,
9,
910,
14,
27237,
161,
25,
20,
8713,
17053,
8184,
4104,
2815,
3186,
579,
397,
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... |
php: Adding status 2
===
Anyone can help me with this, i have here status 0 and status 1 now
**Status 0**: Not my friend
**Status 1**: My friend
And i need
**Status 2**: ADDED TO FRIEND LIST (we send friend request but row status is 0)
Please check query bellow...
<?
$query = "SELECT * FROM friends WHERE (idusers={$_SESSION[userid]} AND idusers_friend={$row[ID]}) AND status='1' OR (idusers={$row[ID]} AND idusers_friend={$_SESSION[userid]} AND status='1' )";
$result = mysql_query($query);
$check_exist = mysql_num_rows($result);
if($check_exist >= 1) { ?>
STATUS 1 - SEND A MESSSAGES (friend)
<? } elseif($check_exist == 0) { ?>
STATUS 0 - ADD AS FRIND (not friend)
<? } ?>
What i need now, i need to have **status 2** , example above you can see im make now if users is my frind i can send a messages to this user, is not in my frind list i have button to add it, but when i click to add as frind im send request (something like on facebook) and than this is status 2, waiting for accept.
*Example:* If i have this user as my frind Status in database is 1, is not in my list database is empty, if im send request row status is 0 and whan 2nd user accept request status will be changed to 1. | 0 | [
2,
13,
26120,
45,
4721,
1782,
172,
800,
3726,
3726,
1276,
92,
448,
55,
29,
48,
15,
31,
57,
235,
1782,
713,
17,
1782,
137,
130,
13,
1409,
10631,
267,
713,
1409,
45,
52,
51,
860,
13,
1409,
10631,
267,
137,
1409,
45,
51,
860,
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 split string that delimiters remain in he end of result?
===
I have several delimiters. For example {del1, del2, del3 }.
Suppose I have text : Text1 del1 text2 del2 text3 del3
I want to split string in such way:
Text1 del1
text2 del2
text3 del3
How can I do this in C# ? | 0 | [
2,
184,
20,
2132,
3724,
30,
121,
20565,
445,
2166,
19,
24,
241,
16,
829,
60,
800,
3726,
3726,
31,
57,
238,
121,
20565,
445,
9,
26,
823,
13,
1,
3436,
165,
15,
1506,
135,
15,
1506,
240,
13,
1,
9,
5787,
31,
57,
1854,
13,
45,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
tempfile error due to R parallel package
===
I am using the R parallel package command “parLapply” in Windows 7, with R 2.14.2. It works like a charm but when I try to do many itterations, i want to use it for feature selection in a double looped cross-validation set up, then I get an error that there are no more tempfile() names available.
The commands I use are these:
cl <- makeCluster(4)
clusterExport(cl, "TrainingSetDataFrame")
weightsWMW <- parLapply(cl, 1:(ncol(TrainingSetDataFrame)-1), function(i) wilcox.test(TrainingSetDataFrame[TrainingSetDataFrame$Outcome==1,i], TrainingSetDataFrame[TrainingSetDataFrame$Outcome==2,i])$p.value)
stopCluster(cl)
It seems to me that the cluster command does not remove the tempfiles that were used during the execution or that I do not close the cluster correctly. Is there a way to make it automaticly remove the old tempfiles, or is there anything else I could try to use to overcome this problem?
I already searched the internet but I could not find anything other than a resolved bug in R and this thread on stack overflow: http://stackoverflow.com/questions/5513495/parallel-r-execution-problem-in-r
I also contacted the maintainer of the R parallel package but i did not got any response yet. | 0 | [
2,
13,
9577,
16877,
7019,
397,
20,
761,
3821,
6030,
800,
3726,
3726,
31,
589,
568,
14,
761,
3821,
6030,
1202,
13,
1,
3574,
531,
3421,
102,
1,
19,
1936,
453,
15,
29,
761,
172,
9,
1419,
9,
135,
9,
32,
693,
101,
21,
7533,
47,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Calling function with changing input parameters in a loop Matlab
===
I have caught myself in a issue, I know its not that difficult but I couldnt figure out how to implement it. I have an m file that looks like
clear;
PVinv.m_SwF=20e3
for m=1:1:70;
PVinv.m_SwF=PVinv.m_SwF+1e3;
Lmin = PVinv.InductanceDimens();
Wa_Ac = PVinv.CoreSizeModel();
PVinv.CoreSelect(Wa_Ac);
[loss_ind_core,loss_ind_copper] = PVinv.InductorLossModel(PVinv.m_L_Selected);
Total_Inductor_Loss=loss_ind_core+loss_ind_copper
plot(PVinv.m_SwF,Total_Inductor_Loss,'--gs');
hold on
xlim([10e3 90e3])
set(gca,'XTickLabel',{'10';'20';'30';'40';'50';'60';'70';'80';'90'})
grid on
xlabel('Switching Frequency [kHz]');
ylabel('Power loss [W]');
end
And the function that is of interest is CoreSelect(Wa_Ac)
function obj = CoreSelect(obj, WaAc)
obj.m_Core_Available= obj.m_Core_List(i);
obj.m_L_Selected.m_Core = obj.m_Core_Available;
end
I want to change the value of i from obj.m_Core_List(1) to obj.m_Core_List(27) within that for loop of main m file. How can I get the value of the function coreselect when I call it in main m file
For eg for m=1 to 70 I want the function to take the value of i=1 then execute till plot command and then same with but i=2 and so on
Any suggestion would be really helpful | 0 | [
2,
2555,
1990,
29,
4226,
6367,
12905,
19,
21,
5293,
4277,
9086,
800,
3726,
3726,
31,
57,
1383,
992,
19,
21,
1513,
15,
31,
143,
82,
52,
30,
1956,
47,
31,
3245,
1465,
70,
184,
20,
8713,
32,
9,
31,
57,
40,
307,
3893,
30,
1879,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Jquery detect if keyboard key is held down
===
I'm making a crossword application using PhoneGap, and need to detect if the user has just done a quick press on the keyboard or has held down a key to get a special character. What would be the event to detect this? | 0 | [
2,
487,
8190,
93,
9092,
100,
8896,
1246,
25,
269,
125,
800,
3726,
3726,
31,
22,
79,
544,
21,
919,
9587,
3010,
568,
1132,
1136,
306,
15,
17,
376,
20,
9092,
100,
14,
4155,
63,
114,
677,
21,
2231,
901,
27,
14,
8896,
54,
63,
269,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Javascript Alert box is not showing
===
I am currently learning Object oriented Javascript but it seems that the alert is not working. what is the problem here?
<
html>
<head>
<script>
function professor(name, myLecture){
this.name = name;
this.myLecture = myLecture;
}
professor.prototype.display = function(){
return this.name + " is teaching " + this.myLecture;
};
function subjectList(subject){
this.subject = subject;
}
subjectList.prototype.showAll= function(){
var str = " " ;
for(var i = 0 ; i<subject.length; i++ )
str+= this.subject[i].display();
return str;
};
var ListOfSubs = new subjectList([
new professor("Muy","Obprog")
]);
alert(ListOfSubs.showAll());
</script>
<body>
</body>
</head>
</html> | 0 | [
2,
8247,
8741,
7863,
1649,
25,
52,
3187,
800,
3726,
3726,
31,
589,
871,
2477,
3095,
13,
6800,
8247,
8741,
47,
32,
2206,
30,
14,
7863,
25,
52,
638,
9,
98,
25,
14,
1448,
235,
60,
13,
1,
13,
15895,
1,
13,
1,
1743,
1,
13,
1,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
in Rails : Retreive user input from a form that isn't associated with a Model, use the result within the controller.
===
Here's a simplified version of what I'm trying to do :
1. Before any other actions are performed, present the user with a form to retrieve a string.
2. Input the string, and then redirect to the default controller action (e.g. index). The string only needs to exist, no other validations are necessary.
3. The string must be available (as an instance variable?) to all the actions in this controller.
I'm very new with Rails, but this doesn't seem like it ought to be exceedingly hard, so I'm feeling kind of dumb.
What I've tried :
I have a `before_filter` redirecting to a private method that looks like
def check_string
if @string
return true
else
get_string
end
end
the `get_string` method looks like
def get_string
if params[:string]
respond_to do |format|
format.html {redirect_to(accounts_url)} # authenticate.html.erb
end
end
respond_to do |format|
format.html {render :action =>"get_string"} # get_string.html.erb
end
end
This fails because i have two render or redirect calls in the same action. I can take out that first `respond_to`, of course, but what happens is that the controller gets trapped in the `get_string` method. I can more or less see why that's happening, but I don't know how to fix it and break out. I need to be able to show one form (View), get and then do something with the input string, and then proceed as normal.
The `get_string.html.erb` file looks like
<h1>Enter a string</h1>
<% form_tag('/accounts/get_string') do %>
<%= password_field_tag(:string, params[:string])%>
<%= submit_tag('Ok')%>
<% end %>
I'll be thankful for any help! | 0 | [
2,
19,
2240,
18,
13,
45,
13,
6239,
99,
1284,
4155,
6367,
37,
21,
505,
30,
2532,
22,
38,
1598,
29,
21,
1061,
15,
275,
14,
829,
363,
14,
9919,
9,
800,
3726,
3726,
235,
22,
18,
21,
13,
11268,
615,
16,
98,
31,
22,
79,
749,
20,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to make sure a font exists before using it with .NET
===
I have a VB.NET Windows Forms project that at one point paints text directly to onto the form at runtime. Before I paint with the font though, I want to make sure that the font and font-size exists on the user's machine. If they don't, I'll try a few other similar fonts, eventually defaulting with Arial or something.
What's the best way to test and validate a font on a user's computer? | 0 | [
2,
184,
20,
233,
562,
21,
9978,
5636,
115,
568,
32,
29,
13,
9,
2328,
800,
3726,
3726,
31,
57,
21,
13,
20468,
9,
2328,
1936,
1997,
669,
30,
35,
53,
454,
5107,
18,
1854,
1703,
20,
1204,
14,
505,
35,
485,
891,
9,
115,
31,
5107,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Anybody got an Actionscript 3 Youtube API / wrapper?
===
Google / Youtube has an API for Youtube for javascript and Actionscript 2.
Unfortunately this API is not compatible with Actionscript 3 without a wrapper - which google does not themselves provide.
Has anybody got an actionscript 3 wrapper they can make available? | 0 | [
2,
11181,
330,
40,
1028,
8741,
203,
7330,
21,
2159,
13,
118,
28051,
60,
800,
3726,
3726,
8144,
13,
118,
7330,
63,
40,
21,
2159,
26,
7330,
26,
8247,
8741,
17,
1028,
8741,
172,
9,
6200,
48,
21,
2159,
25,
52,
14961,
29,
1028,
8741,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 bundle a python application including dependencies for windows?
===
I want to provide an MSI installer that contains my application, the package dependencies of the application and possibly the python installer for windows.
What things should I be looking at to archieve that? python setup.py bdist_wininst seems promising, but it can't include python itself or any dependencies. | 0 | [
2,
184,
20,
10194,
21,
20059,
3010,
215,
29411,
26,
1936,
60,
800,
3726,
3726,
31,
259,
20,
1181,
40,
4235,
49,
16146,
106,
30,
1588,
51,
3010,
15,
14,
6030,
29411,
16,
14,
3010,
17,
2879,
14,
20059,
16146,
106,
26,
1936,
9,
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... |
Best way to determine if a web domain is available?
===
I am writing some code to determine whether a network domain is registered. For example, I want to check if "Google123.com" is available. There are at least two ways I can do this programatically, but I'm not sure which is more valid:
- A) In linux/cygwin, I can run the
whois command to see if a domain is
in use.
- B) In linux/windows, i can
run nslookup command to see if a
domain is resolvable.
My questions are:
1. Is nslookup really a valid way to check for registration? Does every registered domain have a name server and show up in DNS?
2. What is the fastest way to make this registration check? Any tips or other ways to do it? | 0 | [
2,
246,
161,
20,
3746,
100,
21,
2741,
4603,
25,
904,
60,
800,
3726,
3726,
31,
589,
1174,
109,
1797,
20,
3746,
1472,
21,
982,
4603,
25,
3801,
9,
26,
823,
15,
31,
259,
20,
2631,
100,
13,
7,
16111,
4875,
918,
240,
9,
960,
7,
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... |
I want my C# Windows Service to automatically update itself.
===
Is there a framework that can be used to enable a C# Windows Service to automatically check vor a newer version and upgrade itself? I can certainly write code to accomplish this, but I am looking for a framework that has already been implemented and (most importantly) tested. | 0 | [
2,
31,
259,
51,
272,
5910,
1936,
365,
20,
7499,
11100,
1145,
9,
800,
3726,
3726,
25,
80,
21,
6596,
30,
92,
44,
147,
20,
9240,
21,
272,
5910,
1936,
365,
20,
7499,
2631,
11150,
21,
12372,
615,
17,
9483,
1145,
60,
31,
92,
3850,
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... |
Unit Testing File Modifications
===
A common task in programs I've been working on lately is modifying a text file in some way. (Hey, I'm on Linux. Everything's a file. And I do large-scale system admin.)
But the file the code modifies may not exist on my desktop box. And I probably don't want to modify it if it IS on my desktop.
I've read about unit testing in Dive Into Python, and it's pretty clear what I want to do when testing an app that converts decimal to Roman Numerals (the example in DintoP). The testing is nicely self-contained. You don't need to verify that the program PRINTS the right thing, you just need to verify that the functions are returning the right output to a given input.
In my case, however, we need to test that the program is modifying its environment correctly. Here's what I've come up with:
1) Create the "original" file in a standard location, perhaps /tmp.
2) Run the function that modifies the file, passing it the path to the file in /tmp.
3) Verify that the file in /tmp was changed correctly; pass/fail unit test accordingly.
This seems kludgy to me. (Gets even kludgier if you want to verify that backup copies of the file are created properly, etc.) Has anyone come up with a better way? | 0 | [
2,
1237,
4431,
3893,
13922,
800,
3726,
3726,
21,
757,
3005,
19,
1726,
31,
22,
195,
74,
638,
27,
10434,
25,
17579,
68,
21,
1854,
3893,
19,
109,
161,
9,
13,
5,
3909,
15,
31,
22,
79,
27,
13024,
9,
796,
22,
18,
21,
3893,
9,
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... |
Standard concise way to copy a file in Java?
===
It has always bothered me that the only way to copy a file in Java involves opening streams, declaring a buffer, reading in one file, looping through it, and writing it out to the other steam. The web is littered with similar, yet still slightly different implementations of this type of solution.
Is there a better way that stays within the bounds of the Java language (meaning does not involve exec-ing OS specific commands)? Perhaps in some reliable open source utility package, that would at least obscure this underlying implementation and provide a one line solution?
| 0 | [
2,
1236,
29455,
161,
20,
4344,
21,
3893,
19,
8247,
60,
800,
3726,
3726,
32,
63,
550,
12200,
55,
30,
14,
104,
161,
20,
4344,
21,
3893,
19,
8247,
6569,
1214,
9464,
15,
15594,
21,
17497,
15,
1876,
19,
53,
3893,
15,
5293,
68,
120,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What do you use to protect your .NET code from reverse engineering?
===
For a while we were using a tool called CodeVeil. I'm just wondering if there are better alternatives out there. | 4 | [
2,
98,
107,
42,
275,
20,
2196,
154,
13,
9,
2328,
1797,
37,
7006,
1552,
60,
800,
3726,
3726,
26,
21,
133,
95,
46,
568,
21,
5607,
227,
1797,
195,
947,
9,
31,
22,
79,
114,
5712,
100,
80,
50,
574,
2676,
18,
70,
80,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Unit Testing Guidelines
===
Does anyone know of where to find unit testing guidelines and recommendations? I'd like to have something which addresses the following:
* Should tests be in the same project as application logic?
* Should I have test classes to mirror my logic classes or should I have only as many test classes as I feel I need to have?
* How should I name my test classes, methods, and projects (if they go in different projects)
* Should private, protected, and internal methods be tested, or just those that are publicly accessible?
* Should unit and integration tests be separated?
* Is there a **good** reason not to have 100% test coverage?
What am I not asking about that I should be? | 0 | [
2,
1237,
4431,
12629,
800,
3726,
3726,
630,
1276,
143,
16,
113,
20,
477,
1237,
4431,
12629,
17,
12121,
60,
31,
22,
43,
101,
20,
57,
301,
56,
12636,
14,
249,
45,
1637,
378,
4894,
44,
19,
14,
205,
669,
28,
3010,
7085,
60,
1637,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 j2ee?
===
Ok stupid question but...
I realize that literally it translates to java 2 enterprise edition. What I'm asking is what does this really mean? when a company requires j2ee experience what are they really asking for? experience with ejb's? experience with java web apps?
I suspect that this means something different to different people and the definition is subjective, so please try to upvote rather than reposting something already in another answer. | 0 | [
2,
98,
25,
487,
135,
2851,
60,
800,
3726,
3726,
5854,
3553,
1301,
47,
9,
9,
9,
31,
4007,
30,
6949,
32,
18510,
20,
8247,
172,
6002,
1322,
9,
98,
31,
22,
79,
3379,
25,
98,
630,
48,
510,
884,
60,
76,
21,
237,
4781,
487,
135,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Whats a good value for 'identity increment' for an 'Orders' table
===
Whats a good value for an identity increment for an 'Orders' table? (orders as in shopping cart orders)
I want the order numbers to appear so that we have more orders than we really do, plus make it harder for users to guess order numbers of other users in cases where that might be a problem.
I dont want too big a value such that I might run out of values, and i also don't want a noticable sequence to be apparent.
I've settled on 42 for now | 0 | [
2,
98,
18,
21,
254,
1923,
26,
13,
22,
13384,
856,
13,
28461,
22,
26,
40,
13,
22,
7861,
18,
22,
859,
800,
3726,
3726,
98,
18,
21,
254,
1923,
26,
40,
3270,
13,
28461,
26,
40,
13,
22,
7861,
18,
22,
859,
60,
13,
5,
7861,
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... |
Any experiences with Intel's Threading Building Blocks
===
Intel's [Threading Building Blocks (TBB)][1] open source library looks really interesting. Even though there's even an [O'Reilly Book][2] about the subject I don't hear about a lot of people using it. I'm interested in using it for some multi-level parallel applications (MPI + threads) in Unix (Mac, Linux, etc.) environments. For what it's worth, I'm interested in high performance computing / numerical methods kinds of applications.
Does anyone have experiences with TBB? Does it work well? Is it fairly portable (including GCC and other compilers)? Does the paradigm work well for programs you've written? Are there other libraries I should look into?
[1]: http://www.threadingbuildingblocks.org/
[2]: http://oreilly.com/catalog/9780596514808/ | 0 | [
2,
186,
5513,
29,
14635,
22,
18,
9322,
68,
353,
5198,
800,
3726,
3726,
14635,
22,
18,
636,
96,
22883,
353,
5198,
13,
5,
38,
3490,
6,
500,
2558,
165,
500,
368,
1267,
1248,
1879,
510,
4883,
9,
166,
362,
80,
22,
18,
166,
40,
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... |
Adobe Captivate 3 Typing Sound viewing a recording
===
I am using Adobe Captivate 3 and am having trouble disabling the typing noise when using a recording. Sometimes when I have this 'feature' disabled and make a recording, it doesn't make the typing sound, but when I publish the project, the typing sound returns. Also, I have other projects I am working on where the typing sound wasn't initially disabled during the recording and I can't get it to stop making that typing noise.
Any suggestions on how to disable the typing sound permanently within a new or existing Captivate project? | 0 | [
2,
20299,
13960,
6094,
591,
203,
25266,
646,
11244,
21,
1576,
800,
3726,
3726,
31,
589,
568,
20299,
13960,
6094,
591,
203,
17,
589,
452,
2572,
1460,
58,
8599,
14,
25266,
3406,
76,
568,
21,
1576,
9,
1030,
76,
31,
57,
48,
13,
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... |
How do I make WISA act like LAMP (Protecting .mp3s on IIS)
===
I have created a few small flash widgets that stream .mp3 audio from an Apache/php host. The mp3 file cannot be directly accessed and does not save it self to the browsers cache.
To do this I set the mp3 file permission on the host to "owner: read/write" (numeric value 600). This makes it so that only my .php file can read the .mp3.
Then I make a request to my php file from my ActionScript and it streams the mp3 to my widget. (If the client/user looks in the browsers cache the mp3 file is not found as desired)
This is the php code that streams the file:
<?php
ob_start();
header("Expires: Mon, 20 Dec 1977 00:00:00 GMT");
header("Last-Modified: " . gmdate("D, d M Y H:i:s") . " GMT");
header("Cache-Control: no-store, no-cache, must-revalidate");
header("Cache-Control: post-check=0, pre-check=0", false);
header("Pragma: no-cache");
header("Content-Type: audio/mpeg");
@readfile($_GET["file"]);
ob_end_flush();
?>
Does anyone know how to reproduce this behavior using IIS/ASP.Net
1.) Make it so a file is only accessible to a file on the server. <br>
2.) Stream that file using an .ASPX or .ASHX?
| 0 | [
2,
184,
107,
31,
233,
12375,
58,
601,
101,
6792,
13,
5,
16265,
68,
13,
9,
2554,
240,
18,
27,
595,
18,
6,
800,
3726,
3726,
31,
57,
679,
21,
310,
284,
4433,
4807,
43,
3060,
18,
30,
3766,
13,
9,
2554,
240,
4023,
37,
40,
17140,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Know Any Great Blogging Tools?
===
I've been blogging for about a year now. After a month I realized that I wasn't a huge fan of wysiwyg editors provided by blogger and typepad. Since then I've been using [Windows Live Writer][1] for authoring content and [Google Prettify][2] for syntax highlighting.
**Are there any great tools that I'm missing out on?**
My ideal tools would:
1. Support Blogger/TypePad/WordPress/FTP posting.
2. Have **in tool syntax highlighting** (as opposed to prettify which happens at runtime).
3. Great usability.
4. Awesome XHTML compliant layouts for figures, graphs, tables, etc...
5. Really take the friction away from blogging.
Have sweet technical blogging tools? Share the wealth! It's ok if they cost money or if they're for OS X, Windows, or a Linux distro (I run boot camp).
[1]: http://windowslivewriter.spaces.live.com/
[2]: http://code.google.com/p/google-code-prettify/ | 2 | [
2,
143,
186,
374,
334,
13919,
4672,
60,
800,
3726,
3726,
31,
22,
195,
74,
334,
13919,
26,
88,
21,
159,
130,
9,
75,
21,
1617,
31,
1896,
30,
31,
526,
22,
38,
21,
2329,
2514,
16,
5809,
18,
49,
7913,
263,
12149,
1173,
34,
24350,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 many Python classes should I put in one file?
===
I'm used to the Java model where you can have one public class per file. Python doesn't have this restriction, and I'm wondering what's the best practice for organising classes. | 0 | [
2,
184,
151,
20059,
2684,
378,
31,
442,
19,
53,
3893,
60,
800,
3726,
3726,
31,
22,
79,
147,
20,
14,
8247,
1061,
113,
42,
92,
57,
53,
317,
718,
416,
3893,
9,
20059,
1437,
22,
38,
57,
48,
18732,
15,
17,
31,
22,
79,
5712,
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,
0,
0,
0,
0,
0,
0,
0... |
Blogging About Programming: How To Do It Without Getting Fired (Discreetly Talking About Work Projects)
===
So I was just reading [this question][1] and several people suggest starting a blog as a good way to help yourself and others growing your programming knowledge. I have also seen several bloggers talk about using their blog as their own reference source.
I've considered starting a professional blog several times, but I always struggle with how I could handle discussing what I am working on without giving away too much about my clients private projects (and therefore getting fired).
Regardless of anything else, I would have to obfuscate the projects and clients names - that much I am sure of.
What other precautions should I take? Should I be completely anonymous (not my first choice). Should I run all of my work related post through my employer for approval?
[1]: http://stackoverflow.com/questions/78756/what-do-you-use-to-keep-notes-as-a-developer | 4 | [
2,
334,
13919,
88,
3143,
45,
184,
20,
107,
32,
366,
1017,
3899,
13,
5,
9752,
99,
1198,
102,
1582,
88,
170,
2314,
6,
800,
3726,
3726,
86,
31,
23,
114,
1876,
636,
1565,
1301,
500,
2558,
165,
500,
17,
238,
148,
5601,
1422,
21,
81... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Making code internal but available for unit testing from other projects
===
We put all of our unit tests in their own projects. We find that we have to make certain classes public instead of internal just for the unit tests. Is there anyway to avoid having to do this. What are the memory implication by making classes public instead of sealed? | 0 | [
2,
544,
1797,
3117,
47,
904,
26,
1237,
4431,
37,
89,
2314,
800,
3726,
3726,
95,
442,
65,
16,
318,
1237,
4894,
19,
66,
258,
2314,
9,
95,
477,
30,
95,
57,
20,
233,
1200,
2684,
317,
700,
16,
3117,
114,
26,
14,
1237,
4894,
9,
25... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to draw custom button in Window Titlebar with Windows Forms?
===
How do you draw a custom button next to the minimize, maximize and close buttons within the Titlebar of the Form?
I know you need to use Win32 API calls and override the WndProc procedure, but I haven't been able to figure out a solution that works right.
Does anyone know how to do this? | 0 | [
2,
184,
20,
2003,
5816,
5167,
19,
1463,
581,
1850,
29,
1936,
1997,
60,
800,
3726,
3726,
184,
107,
42,
2003,
21,
5816,
5167,
328,
20,
14,
16713,
15,
23952,
17,
543,
12861,
363,
14,
581,
1850,
16,
14,
505,
60,
31,
143,
42,
376,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I get source and variable values in ruby tracebacks?
===
Here's the last few frames of a typical Ruby on Rails traceback:
![application trace][1]
And here are the last few frames of a typical Nevow traceback in Python:
![alt text][2]
It's not just the web environment either, you can make similar comparisons between ipython and irb. How can I get more of these sorts of details in Ruby?
[1]: http://img444.imageshack.us/img444/8990/rails-lastfew.png
[2]: http://img444.imageshack.us/img444/9173/nw-lastfew.png | 0 | [
2,
184,
92,
31,
164,
1267,
17,
7612,
4070,
19,
10811,
5565,
1958,
18,
60,
800,
3726,
3726,
235,
22,
18,
14,
236,
310,
12809,
16,
21,
3874,
10811,
27,
2240,
18,
5565,
1958,
45,
13,
187,
2558,
2552,
20669,
5565,
500,
2558,
165,
50... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What sorts of simple IDL parsers / code generators are available for C / C++ code?
===
For a project I'm working on, I need to have a lot of source code files generated from an interface description. That description is currently IDL (really, a pidgin IDL-like language), but I'm not married to it and am willing to consider alternatives.
What sorts of code generators are available that can take IDL (or something like it) and generate C / C++ code from a template?
I'm aware of [SWIG](http://www.swig.org/), but since I'm not wrapping objects into one of the existing languages, I'd have to write my own binding. That appears difficult to me, but I'd love to be proven wrong.
Mozilla uses [XPIDL](http://developer.mozilla.org/en/XPIDL) for their purposes, but although they provide a build process for it, it's not entirely clear how to use it to generate anything but Mozilla-relevant sources.
I've cobbled together my own solution using a couple of [Boost Spirit](http://spirit.sourceforge.net/) parsers, but it's very rickety and often needs tweaking in order to do its job properly. Ideally, the software I'm looking for would take one template file (of some form or another) and one IDL file (or some other interface specification) and merge them together to generate a single output file.
Thanks! | 0 | [
2,
98,
14357,
16,
1935,
31,
8643,
2017,
18,
445,
13,
118,
1797,
20495,
50,
904,
26,
272,
13,
118,
272,
20512,
1797,
60,
800,
3726,
3726,
26,
21,
669,
31,
22,
79,
638,
27,
15,
31,
376,
20,
57,
21,
865,
16,
1267,
1797,
6488,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Shared File Database Suggestion (Windows)
===
<p>I would like to build and deploy a database application for Windows based systems, but need to live within the following constraints:</p>
<ol><li>Cannot run as a server (i.e., have open ports);</li>
<li>Must be able to share database files with other instances of the program (running on other machines);</li>
<li>Must not require a DBA for maintenance;</li>
<li>No additional cost for run-time license.</li></ol>
<p>In addition, the following are nice to have "features":</p>
<ol><li>1. Zero-install (e.g., no registry entries, no need to put files in \Windows\..., etc.);</li>
<li>"Reasonable" performance (yes, that's vague);</li>
<li>"Reasonable" file size limitations (at least 1GB per table/file--just in case).</li></ol>
<p>I've seen this question<br>
<a href ="http://stackoverflow.com/questions/705/embedded-database-for-net-that-can-run-off-a-network">Embedded Database for .net that can run off a network</a><br>
but it doesn't quite answer it for me.</p>
<p>I have seen the <a href="http://www.vistadb.net/">VistaDB site</a>, but while it looks promising, I have no personal experience with it.</p>
<p>I have also looked at <a href="http://www.sqlite.org/">SQLite</a>, and while it seems good enough for Goggle, I (again) have no personal experience with it.</p>
<p>I would love to use a Java based solution because it's cross-platform (even though my main target is Windows, I'd like to be flexible) and WebStart is a really nice way to distribute software, but the most commonly used DBs (Derby and hsqldb) won't support shared access.</p>
<p>I know that I'm not the only one who's trying/tried to do this, so I'm hoping I could get some advice.</p>
<p>Thanks,<br>
John</p> | 0 | [
2,
2592,
3893,
6018,
10910,
13,
5,
27508,
18,
6,
800,
3726,
3726,
13,
1,
306,
1,
49,
83,
101,
20,
1895,
17,
17617,
21,
6018,
3010,
26,
1936,
432,
1242,
15,
47,
376,
20,
515,
363,
14,
249,
16747,
45,
1,
118,
306,
1,
13,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should I use internal or public visibility by default?
===
I'm a pretty new C# and .Net developer. I recently created an MMC snapin using C# and was gratified by how easy it was to do, especially after hearing a lot of horror stories by some other developers in my organisation about how hard it is to do in C++.
I pretty much went through the whole project at some point and made every instance of the "public" keyword to "internal", except as required by the runtime in order to run the snapin. What is your feeling on this, should you generally make classes and methods public or internal? | 0 | [
2,
378,
31,
275,
3117,
54,
317,
19476,
34,
12838,
60,
800,
3726,
3726,
31,
22,
79,
21,
1772,
78,
272,
5910,
17,
13,
9,
2328,
10058,
9,
31,
1989,
679,
40,
1620,
150,
6877,
108,
568,
272,
5910,
17,
23,
13,
15125,
4462,
34,
184,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 the Unity Framework any good for Inversion of Control?
===
I have been using IoC for a little while now and I am curious if I should use Microsoft's Unity framework. Does anyone have experience using it? So for I have been copying my IoC container code from project to project but I think it would be better to using something standard. I think IoC can make a HUGE difference in keeping compnent based applications loosely coupled and therefore changeable but I am by no means an expert on IoC so I am nervous to switch to a framework that will just paint me into a corner as a dependency I will one day want to walk away from. Thanks! | 0 | [
2,
25,
14,
8385,
6596,
186,
254,
26,
19,
10898,
16,
569,
60,
800,
3726,
3726,
31,
57,
74,
568,
31,
2499,
26,
21,
265,
133,
130,
17,
31,
589,
7686,
100,
31,
378,
275,
7099,
22,
18,
8385,
6596,
9,
630,
1276,
57,
1496,
568,
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 lookup data about a book from its barcode number?
===
I'm building the world's simplest library application. All I want to be able to do is scan in a book's UPC (barcode) using a typical scanner (which just types the numbers of the barcode into a field) and then use it to look up data about the book... at a minimum, title, author, year published, and either the Dewey Decimal or Library of Congress catalog number.
The goal is to print out a tiny sticker ("spine label") with the card catalog number that I can stick on the spine of the book, and then I can sort the books by card catalog number on the shelves in our company library. That way books on similar subjects will tend to be near each other, for example, if you know you're looking for a book about accounting, all you have to do is find SOME book about accounting and you'll see the other half dozen that we have right next to it which makes it convenient to browse the library.
There seem to be lots of web APIs to do this, including Amazon and the Library of Congress. But those are all extremely confusing to me. What I really just want is a single higher level function that takes a UPC barcode number and returns some basic data about the book. | 0 | [
2,
184,
92,
31,
361,
576,
1054,
88,
21,
360,
37,
82,
748,
9375,
234,
60,
800,
3726,
3726,
31,
22,
79,
353,
14,
126,
22,
18,
24384,
1248,
3010,
9,
65,
31,
259,
20,
44,
777,
20,
107,
25,
8313,
19,
21,
360,
22,
18,
71,
150,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 read a file over a network that is in use/locked by another process in c#?
===
Is there a way to read a locked file across a network given that you are the machine admin on the remote machine? I haven't been able to read the locked file locally, and attempting it over the network adds another layer of difficulty. | 0 | [
2,
184,
107,
31,
1302,
21,
3893,
84,
21,
982,
30,
25,
19,
275,
118,
3966,
69,
34,
226,
953,
19,
272,
5910,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
1302,
21,
4011,
3893,
464,
21,
982,
504,
30,
42,
50,
14,
1940,
21,
43,
21... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best way to pass data between concurrent threads in .NET?
===
I have two threads, one needs to poll a bunch of separate static resources looking for updates. The other one needs to get the data and store it in the database. How can thread 1 tell thread 2 that there is something to process? | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
1477,
1054,
128,
19513,
20396,
19,
13,
9,
2328,
60,
800,
3726,
3726,
31,
57,
81,
20396,
15,
53,
2274,
20,
4994,
21,
7653,
16,
1725,
12038,
2566,
699,
26,
16779,
9,
14,
89,
53,
2274,
20,
164,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Predict next auto-inserted row id (sqlite)
===
I'm trying to find if there is a reliable way (using sqlite) to find the ID of the next row to be inserted, *before it gets inserted*. I need to use the id for another insert statement, but don't have the option of instantly inserting and getting the next row.
Is predicting the next id as simple as getting the last id and adding one? Is that a guarantee? | 0 | [
2,
9584,
328,
3108,
8,
108,
4104,
1427,
3131,
4924,
13,
5,
18,
1251,
10601,
6,
800,
3726,
3726,
31,
22,
79,
749,
20,
477,
100,
80,
25,
21,
11398,
161,
13,
5,
12655,
4444,
10601,
6,
20,
477,
14,
4924,
16,
14,
328,
3131,
20,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Detect And Remove Rootkit
===
What is the best (hopefully free or cheap) way to detect and then, if necessary, remove a rootkit found on your machine? | 2 | [
2,
9092,
17,
4681,
5900,
13703,
800,
3726,
3726,
98,
25,
14,
246,
13,
5,
18930,
5655,
551,
54,
9148,
6,
161,
20,
9092,
17,
94,
15,
100,
2378,
15,
4681,
21,
5900,
13703,
216,
27,
154,
1940,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is there a reference for the SharePoint XSLT extension functions?
===
There are a couple of different .NET XSLT functions that I see used in the out of the box SharePoint web parts (RSS Viewer and Data View web part).
<xsl:stylesheet
xmlns:ddwrt="http://schemas.microsoft.com/WebParts/v2/DataView/runtime"
xmlns:rssaggwrt="http://schemas.microsoft.com/WebParts/v3/rssagg/runtime"
...>
...
<xsl:value-of select="rssaggwrt:MakeSafe($Html)"/>
<a href="{ddwrt:EnsureAllowedProtocol(string(link))}">More...</a>
...
</xsl:stylesheet>
Where can I find a reference that describes all of the extension functions that SharePoint provides? | 0 | [
2,
25,
80,
21,
2801,
26,
14,
1891,
3132,
993,
18,
255,
38,
3896,
3719,
60,
800,
3726,
3726,
80,
50,
21,
1335,
16,
421,
13,
9,
2328,
993,
18,
255,
38,
3719,
30,
31,
196,
147,
19,
14,
70,
16,
14,
1649,
1891,
3132,
2741,
1341,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 know if you are a bad programmer? Or how do you tell someone they are?
===
It is a seemingly taboo subject. I imagine I want people to tell me I have a bad idea or did something totally wrong... but no one ever does. Of course I am part of the same problem, a good friend of mine is really smart, reads tech blogs, and goes to conventions... but always seems to make things that are more complicated then they have to be.
Where is the constructive criticism in our industry or how do I tell someone I don't agree with them without coming across as a pompous know it all or just a dick? | 4 | [
2,
184,
107,
42,
143,
100,
42,
50,
21,
896,
17968,
60,
54,
184,
107,
42,
494,
737,
59,
50,
60,
800,
3726,
3726,
32,
25,
21,
9688,
25767,
1550,
9,
31,
4382,
31,
259,
148,
20,
494,
55,
31,
57,
21,
896,
882,
54,
144,
301,
513... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 make a simple site render correctly on multiple mobile browsers?
===
We have a rather simple site (minimal JS) with plain html and CSS. It is a simple mobile interface for our main application.
We are running into trouble because we have more than one column and several browsers seem to force single columns.
Through some searching I ran into 2 meta tags.
<meta name="MobileOptimized" content="220" />
<meta name="viewport" content="width=320" />
With these we have a good 'scaled' view for IE Mobile and the iPhone. We have not run into any problems with palm's Blazer. But Blackberry is another matter.
Does the Blackberry have a simple way to control the view of the browser as well? By simple I mean without making a special page for that device. | 0 | [
2,
184,
20,
233,
21,
1935,
689,
16535,
12044,
27,
1886,
3241,
16495,
18,
60,
800,
3726,
3726,
95,
57,
21,
864,
1935,
689,
13,
5,
6840,
3482,
487,
18,
6,
29,
3748,
13,
15895,
17,
272,
18,
18,
9,
32,
25,
21,
1935,
3241,
6573,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Consistent outdent of first letter with CSS?
===
I'm in the process of redesigning my blog. I'm trying to implement an outdent of the first letter of the first paragraph of the body text. Where I'm stuck is in getting consistent spacing between the first letter and the rest of the paragraph. Basically, the problem is that there is a *huge* difference in width between a "W" and an "I". The difference is even big between a "W" and an "Y".
Check out these posts for examples:
[Starts with a "W"][1]
[Starts with a "Y"][2]
[Starts with an "I"][3]
Anyone have any bright ideas about how to mitigate the differences? I'd prefer a pure CSS solution, but will resort to JavaScript if I have to.
PS: I haven't even *looked* at the new design in Internet Explorer or Opera, so please don't bother telling me the whole thing falls apart in those browsers. Cleaning up the display in IE will be the last step of my process. Thanks!
[1]: http://andrew.hedges.name/blog/2008/09/11/v8-neither-all-that-nor-a-bag-of-chips
[2]: http://andrew.hedges.name/blog/2008/05/13/widget-javascript-the-un-series-part-0
[3]: http://andrew.hedges.name/blog/2008/01/08/so-many-widgets-so-little-time | 0 | [
2,
8224,
70,
817,
38,
16,
64,
1748,
29,
272,
18,
18,
60,
800,
3726,
3726,
31,
22,
79,
19,
14,
953,
16,
23903,
68,
51,
8146,
9,
31,
22,
79,
749,
20,
8713,
40,
70,
817,
38,
16,
14,
64,
1748,
16,
14,
64,
20599,
16,
14,
358,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 much of math and physics should a programmer know?
===
I am currently learning math and physics along with programming. Some of it is definitely useful for my programming related projects, especially the (hobby) games that I make, but not all.
What are the most important topics which are necessary for a programmer? | 2 | [
2,
184,
212,
16,
5057,
17,
4339,
378,
21,
17968,
143,
60,
800,
3726,
3726,
31,
589,
871,
2477,
5057,
17,
4339,
303,
29,
3143,
9,
109,
16,
32,
25,
4939,
4811,
26,
51,
3143,
1597,
2314,
15,
1118,
14,
13,
5,
1807,
220,
779,
6,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Commercial uses for grid computing?
===
I keep hearing from associates about grid computing which, from what I can gather, is highly distributed stuff along the lines of SETI@Home.
Is anyone working on these sort of systems for business use? My interest is in figuring out if there's a commercial reason for starting software development in this field. | 0 | [
2,
1439,
2027,
26,
7354,
10626,
60,
800,
3726,
3726,
31,
643,
3229,
37,
9423,
88,
7354,
10626,
56,
15,
37,
98,
31,
92,
7442,
15,
25,
2157,
4387,
3217,
303,
14,
1560,
16,
309,
49,
1,
8167,
9,
25,
1276,
638,
27,
158,
2058,
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... |
Code review addin for Visual Studio
===
This isn't so much as a question, as an idea which I think would be helpful. I decided to post it here to get feedback on the idea. I'm not sure if this isn't exactly the right place to post it, but I wanted to see what you guys think.
My idea is to create an code checkin policy which displays a diff of each modified file. To be able to check it in, another programmer has to 'sign off' on it; this is done via the other programmer using either Active Directory authentication, or just putting in a username and password from a random database. Obviously, a user wouldn't be able to sign off on his own code.
Ideally, it could be mixed with the sample from Microsoft which applies a checkin policy only to specific files, or to ignore small changes, and so on.
Or, is there already such a third-party policy? | 0 | [
2,
1797,
1487,
3547,
108,
26,
3458,
1120,
800,
3726,
3726,
48,
2532,
22,
38,
86,
212,
28,
21,
1301,
15,
28,
40,
882,
56,
31,
277,
83,
44,
15600,
9,
31,
868,
20,
678,
32,
235,
20,
164,
13111,
27,
14,
882,
9,
31,
22,
79,
52,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
An algorithm to generate a game map from individual images
===
I am designing a game to be played in the browser.
Game is a space theme and I need to generate a map of the "Galaxy".
Basic idea of the map is here:
![game map][1]
The map is a grid, with each grid sector can contain a planet/system and each of these has links to a number of adjacent grids.
To generate the maps I figured that I would have a collection of images representing the grid elements. So in the case of the sample above, each of the squares is a separate graphic.
To create a new map I would "weave" the images together.
The map element images would have the planets and their links already on them, and I therefore need to stitch the map together in such a way that each image is positioned with it's appropriate counterparts => so the image in the bottom corner must have images to the left and diagonal left that link up with it correctly.
How would you go about creating the code to know where to place the images?
Is there a better way than using images?
At the moment performance load should not be a consideration (if I need to generate X maps to have preset in the game, rather than do it in real-time, I don't mind).
If it makes a difference I will be using HTML, CSS and JavaScript and backed by a Ruby on Rails app.
[1]: http://www.oglehq.com/map.png | 0 | [
2,
40,
9083,
20,
7920,
21,
250,
2942,
37,
1359,
3502,
800,
3726,
3726,
31,
589,
15026,
21,
250,
20,
44,
257,
19,
14,
16495,
9,
250,
25,
21,
726,
3184,
17,
31,
376,
20,
7920,
21,
2942,
16,
14,
13,
7,
20419,
15161,
7,
9,
2125,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does WCF play well with Java?
===
Which of the WCF Service Protocols work well with Java?
Is it only the WebServices? Or does TCP work as well?
| 0 | [
2,
630,
11801,
410,
418,
134,
29,
8247,
60,
800,
3726,
3726,
56,
16,
14,
11801,
410,
365,
19957,
170,
134,
29,
8247,
60,
25,
32,
104,
14,
2741,
11449,
18,
60,
54,
630,
13,
38,
7439,
170,
28,
134,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Does WCF support WS-Eventing?
===
I know WCF supports many WS-* protocols but WS-Eventing does seem to be listed.
I do know that WCF has a pub/sub model, but is it WS-Eventing compliant? | 0 | [
2,
630,
11801,
410,
555,
619,
18,
8,
4943,
1203,
60,
800,
3726,
3726,
31,
143,
11801,
410,
6747,
151,
619,
18,
8,
2483,
19957,
47,
619,
18,
8,
4943,
1203,
630,
2260,
20,
44,
1510,
9,
31,
107,
143,
30,
11801,
410,
63,
21,
6329,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Why is there no generic synchronized queue in .NET?
===
I noticed that you can call Queue.Synchronize to get a thread-safe queue object, but the same method isn't available on Queue<T>. Does anyone know why? Seems kind of weird. | 0 | [
2,
483,
25,
80,
90,
12733,
27202,
22521,
19,
13,
9,
2328,
60,
800,
3726,
3726,
31,
2711,
30,
42,
92,
645,
22521,
9,
16023,
2952,
20,
164,
21,
9322,
8,
18166,
22521,
3095,
15,
47,
14,
205,
2109,
2532,
22,
38,
904,
27,
22521,
1,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... |
Can you use Reflector to get the source code of an app and then debug using that source code?
===
It seems like you could use a mashup of Relector and a Debugger to be able to debug any .NET app WITHOUT having the source code at all. Is this possible? Has anyone seen this before? | 0 | [
2,
92,
42,
275,
6907,
248,
20,
164,
14,
1267,
1797,
16,
40,
4865,
17,
94,
121,
16254,
568,
30,
1267,
1797,
60,
800,
3726,
3726,
32,
2206,
101,
42,
110,
275,
21,
13333,
576,
16,
13,
7256,
19932,
17,
21,
121,
2345,
11356,
20,
44... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 columns genrally make good indexes?
===
As a follow up to: http://stackoverflow.com/questions/105400/what-are-indexes-and-how-can-i-use-them-to-optimize-queries-in-my-database where I am attempting to learn about indexes, what columns are good index candidates?, specifically for an mssql database?
After some googling, everything I have read suggests that columns that are generally increasing and unique make a good index (things like mysql's auto_increment), I understand this but I am using mssql and I am using GUIDS for primary keys, so it seems that and index would not benefit on GUID columns...
Thanks.
| 0 | [
2,
98,
7498,
4380,
139,
1326,
233,
254,
4348,
160,
60,
800,
3726,
3726,
28,
21,
1740,
71,
20,
45,
7775,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
16242,
7114,
118,
608,
8,
1509,
8,
25671,
160,
8,
290,
8,
1544,
8,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
The quick hack you are most proud of
===
What crazily awesome (or crazily bad) stuff have you hacked together to meet a tight deadline? What are you most proud of? | 4 | [
2,
14,
2231,
11835,
42,
50,
127,
5944,
16,
800,
3726,
3726,
98,
6803,
2553,
102,
13706,
13,
5,
248,
6803,
2553,
102,
896,
6,
3217,
57,
42,
11835,
69,
429,
20,
1255,
21,
2618,
15968,
60,
98,
50,
42,
127,
5944,
16,
60,
3,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
ASP.NET TreeView and Selecting the Selected Node
===
How do I capture the event of the clicking the Selected Node of a TreeView?
It doesn't fire the **SelectedNodeChanged** since the selection has obviously not changed but then what event can I catch so I know that the Selected Node was clicked? | 0 | [
2,
28,
306,
9,
2328,
1541,
4725,
17,
20764,
14,
1704,
15421,
800,
3726,
3726,
184,
107,
31,
3683,
14,
807,
16,
14,
25590,
14,
1704,
15421,
16,
21,
1541,
4725,
60,
32,
1437,
22,
38,
535,
14,
13,
1409,
18,
7138,
251,
546,
16229,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a console app stay alive until it has finished its work?
===
I've just read up on Thread.IsBackground and if I understand it correctly, when it's set to false the Thread is a foreground thread which means it should stay alive until it has finished working even though the app have been exited out. Now I tested this with a winform app and it works as expected but when used with a console app the process doesn't stay alive but exits right away. Does the Thread.IsBackground behave differently from a console app than a winform app? | 0 | [
2,
92,
21,
8650,
4865,
1179,
2481,
163,
32,
63,
842,
82,
170,
60,
800,
3726,
3726,
31,
22,
195,
114,
1302,
71,
27,
9322,
9,
403,
1958,
8810,
17,
100,
31,
1369,
32,
12044,
15,
76,
32,
22,
18,
309,
20,
4997,
14,
9322,
25,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does one add a custom build step to an automake-based project in KDevelop?
===
I recently started work on a personal coding project using C++ and KDevelop. Although I started out by just hacking around, I figure it'll be better in the long run if I set up a proper unit test suite before going too much further. I've created a seperate test-runner executable as a sub project, and the tests I've added to it appear to function properly. So far, success.
However, I'd really like to get my unit tests running every time I build, not only when I explicitly run them. This will be especially true as I split up the mess I've made into convenience libraries, each of which will probably have its own test executable. Rather than run them all by hand, I'd like to get them to run as the final step in my build process. I've looked all through the options in the project menu and the automake manager, but I can't figure out how to set this up.
I imagine this could probably be done by editing the makefile by hand. Unfortunately, my makefile-fu is a bit weak, and I'm also afraid that KDevelop might overwrite any changes I make by hand the next time I change something through the IDE. Therefore, if there's an option on how to do this through KDevelop itself, I'd much prefer to go that way.
Does anybody know how I could get KDevelop to run my test executables as part of the build process? Thank you!
(I'm not 100% tied to KDevelop. If KDevelop can't do this, or else if there's an IDE that makes this much easier, I could be convinced to switch.) | 0 | [
2,
184,
630,
53,
3547,
21,
5816,
1895,
1424,
20,
40,
3108,
11115,
8,
1281,
669,
19,
680,
26051,
60,
800,
3726,
3726,
31,
1989,
373,
170,
27,
21,
1319,
13,
15458,
669,
568,
272,
20512,
17,
680,
26051,
9,
419,
31,
373,
70,
34,
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... |
Big-O for Eight Year Olds?
===
I'm asking more about what this means to my code. I understand the concepts mathematically, I just have a hard time wrapping my head around what they mean conceptually. For example, if one were to perform an O(1) operation on a data structure, I understand that the amount of operations it has to perform won't grow because there are more items. And an O(n) operation would mean that you would perform a set of operations on each element. Could somebody fill in the blanks here?
- Like what exactly would an O(n^2) operation do?
- And what the heck does it mean if an operation is O(n log(n))?
- And does somebody have to smoke crack to write an O(x!)? | 0 | [
2,
580,
8,
111,
26,
970,
159,
315,
18,
60,
800,
3726,
3726,
31,
22,
79,
3379,
91,
88,
98,
48,
1108,
20,
51,
1797,
9,
31,
1369,
14,
8700,
7046,
102,
15,
31,
114,
57,
21,
552,
85,
13437,
51,
157,
140,
98,
59,
884,
14425,
102... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Building Ruby on Windows XP
===
Has anyone out there got a good set of instructions for building/compiling Ruby from source of windows XP ? | 0 | [
2,
353,
10811,
27,
1936,
23045,
800,
3726,
3726,
63,
1276,
70,
80,
330,
21,
254,
309,
16,
7650,
26,
353,
118,
11103,
49,
802,
10811,
37,
1267,
16,
1936,
23045,
13,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Can you debug a .NET app with only the source code of one file?
===
I want to debug an application in Visual Studio but I only have the source code for 1 class. I only need to step through a single function in that file, but I don't understand what I need to do it. I think the steps are something like this:
1. Open a file in VS
2. Load in the "symbols" (whatever that means)
3. Attach to the running process
I know how to do #1 and #3, but I don't how to do #2 and I don't know if it will even work if I only have 1 file of source code. Thanks! | 0 | [
2,
92,
42,
121,
16254,
21,
13,
9,
2328,
4865,
29,
104,
14,
1267,
1797,
16,
53,
3893,
60,
800,
3726,
3726,
31,
259,
20,
121,
16254,
40,
3010,
19,
3458,
1120,
47,
31,
104,
57,
14,
1267,
1797,
26,
137,
718,
9,
31,
104,
376,
20,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How would one code test and set behavior without a special hardware instruction?
===
Most of the implementations I find require a hardware instruction to do this. However I strongly doubt this is required (if it is, I can't figure out why...) | 0 | [
2,
184,
83,
53,
1797,
1289,
17,
309,
3257,
366,
21,
621,
7610,
7304,
60,
800,
3726,
3726,
127,
16,
14,
6123,
18,
31,
477,
4077,
21,
7610,
7304,
20,
107,
48,
9,
207,
31,
5020,
3063,
48,
25,
1390,
13,
5,
821,
32,
25,
15,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0... |
C# - Why is a different dll produced after a clean build, with no code changes?
===
When I do a clean build my C# project, the produced dll is different then the previously built one (which I saved separately). No code changes were made, just clean and rebuild.
Diff shows some bytes in the DLL have changes -- few near the beginning and few near the end, but I can't figure out what these represent. Does anybody have insights on why this is happening and how to prevent it?
This is using Visual Studio 2005 / WinForms. | 0 | [
2,
272,
5910,
13,
8,
483,
25,
21,
421,
13,
43,
211,
671,
75,
21,
2745,
1895,
15,
29,
90,
1797,
1693,
60,
800,
3726,
3726,
76,
31,
107,
21,
2745,
1895,
51,
272,
5910,
669,
15,
14,
671,
13,
43,
211,
25,
421,
94,
14,
1343,
39... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 load a specific version of an assembly
===
To complete some testing I need to load the 64 bit version of an assembly even though I am running a 32 bit version of Windows. Is this possible? | 0 | [
2,
184,
20,
6305,
21,
1903,
615,
16,
40,
1475,
800,
3726,
3726,
20,
1279,
109,
4431,
31,
376,
20,
6305,
14,
4384,
1142,
615,
16,
40,
1475,
166,
362,
31,
589,
946,
21,
2512,
1142,
615,
16,
1936,
9,
25,
48,
938,
60,
3,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Are units of measurement unique to F#?
===
I was reading Andrew Kennedy's blog post series on <a href="http://blogs.msdn.com/andrewkennedy/archive/2008/08/29/units-of-measure-in-f-part-one-introducing-units.aspx">units of measurement in F#</a> and it makes a lot of sense in a lot of cases. Are there any other languages that have such a system?
Edit: To be more clear, I mean the flexible units of measurement system where you can define your own arbitrarily. | 4 | [
2,
50,
1398,
16,
11688,
2619,
20,
398,
5910,
60,
800,
3726,
3726,
31,
23,
1876,
2376,
4586,
22,
18,
8146,
678,
231,
27,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
7091,
5447,
9,
79,
18,
43,
103,
9,
960,
118,
28299,
22445,
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... |
The Attention Defecit Programmer - Tips for staying on task?
===
With broadband internet being what it is, and tabbed browsing, and the crazy amounts of very entertaining social information sites, and someone down the hall asking for help with the printer (combined with your desire to be useful), and the coder next to you showing everyone clips from comedy central, and the nasty habit of wanting to delete files and defrag your system, and oh yeah, the work that you are suppose to be doing which you're really not sure about since you have three different potential higher ups that all think their project is the highest priority, HOW ON EARTH DO YOU STAY ON TASK AS A PROGRAMMER IN A WORLD LIKE THIS?! | 0 | [
2,
14,
1220,
6312,
3319,
242,
17968,
13,
8,
11034,
26,
5725,
27,
3005,
60,
800,
3726,
3726,
29,
22831,
2620,
142,
98,
32,
25,
15,
17,
6523,
4283,
10175,
68,
15,
17,
14,
3328,
8545,
16,
253,
15677,
668,
676,
3259,
15,
17,
737,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
std::unique_ptr<T> incomplete type error
===
I have
template<typename T>
class queue
{
private:
struct node
{
T data;
std::unique_ptr<node> next; //compile error on incomplete type
node(T&& data_):
data(std::move(data_))
{}
};
std::unique_ptr<node> head;
node* tail;
public:
queue():
tail(nullptr)
{}
I get compile error on marked line in VS10. Shouldn't I be allowed to use an incomplete type in this case ? | 0 | [
2,
354,
43,
45,
45,
1020,
5312,
1,
4417,
139,
1,
38,
1,
14011,
1001,
7019,
800,
3726,
3726,
31,
57,
22894,
1,
4474,
7259,
13,
38,
1,
718,
22521,
13,
1,
932,
45,
13,
10346,
15421,
13,
1,
13,
38,
1054,
73,
354,
43,
45,
45,
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... |
Eclipse marks OpenGL functions cannot be resolved
===
I tried making use of some OpenGL-functions in Eclipse C/C++. some "standard" functions as GlClear are recognized by eclipse, others like glBindBuffer() and glEnableVertexAttribArray() aren't. They are just underlined in red.
I have linked glut, GL, GLU and GLEW and my operating system is arch linux. I use eclipse 3.7.2
What do I have to do additionally to avoid these errors? | 0 | [
2,
11652,
4872,
368,
8430,
3719,
1967,
44,
11052,
800,
3726,
3726,
31,
794,
544,
275,
16,
109,
368,
8430,
8,
22359,
18,
19,
11652,
272,
118,
150,
20512,
9,
109,
13,
7,
15566,
7,
3719,
28,
13,
8430,
18600,
50,
2124,
34,
11652,
15... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
New line and tab characters in python n mac
===
I am printing a string to the python shell on a mac os 10.7.3.
The string contains new line characters, \n\r, and tabs, \t.
I'm not 100% sure what new line characters are used on each platform, however i've tried every combination (\n, \n\r, \r) and the newline characters are printed on the shell:
'hello\n\r\tworld'
I don't know what i'm doing wrong, any help is appreciated.
Thanks | 0 | [
2,
78,
293,
17,
6523,
1766,
19,
20059,
13,
103,
1572,
800,
3726,
3726,
31,
589,
7312,
21,
3724,
20,
14,
20059,
3593,
27,
21,
1572,
13,
759,
332,
9,
465,
9,
240,
9,
14,
3724,
1588,
78,
293,
1766,
15,
13,
1,
103,
1,
139,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Android account manager and tornado web server GoogleMixin
===
**tldnr;** Can I use the Android account manager with the Google authentication available in tornado web server?
What I'm trying to achieve is something in the likes of what can be done using Google App Engine. Where you can use the Android account manager to get the necessary auth token for authenticating a user to my service running on GAE. But in my case it's going to be a tornado web service.
Or can I just grab a token using the account manager saying it's for GAE and then use that with the tornado google login? | 0 | [
2,
13005,
2176,
1382,
17,
12306,
2741,
8128,
8144,
15743,
108,
800,
3726,
3726,
13,
1409,
38,
6252,
12835,
73,
1409,
92,
31,
275,
14,
13005,
2176,
1382,
29,
14,
8144,
27963,
904,
19,
12306,
2741,
8128,
60,
98,
31,
22,
79,
749,
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... |
iPhone SDK -> RightBarButtonItem disappears when loading view through AppDelegate
===
So I have an issue with my rightbarbuttonitem disappearing. I have two ways of loading this view, first time launch it loads it after user enters in their name (from an initial view). Second time (after the app exits), it checks if the name exists in my stored database and if it does it loads the view right away. This second time is where the button does not show.
The button was set in viewDidLoad of my view originally here (and is still set here for the first load):
if (self.navigationItem.rightBarButtonItem == nil){
addButton = [[UIBarButtonItem alloc] initWithBarButtonSystemItem:UIBarButtonSystemItemAdd target:self action:@selector(buttonPressed)];
self.navigationItem.rightBarButtonItem = addButton;
[self.navigationItem.rightBarButtonItem retain];
}
Then in the .m of my AppDelegate, I added the button to think that would resolve it on the second load:
if(success){
self.window = [[[UIWindow alloc] initWithFrame:[[UIScreen mainScreen] bounds]] autorelease];
UIViewController *control = [[ViewController alloc] initWithNibName:@"myNib" bundle:nil];
[control retain];
UINavigationController *navControl = [[UINavigationController alloc] initWithRootViewController:control];
[navControl retain];
[self.window setRootViewController:navControl];
if (navControl.navigationItem.rightBarButtonItem == nil){
addButton = [[UIBarButtonItem alloc] initWithBarButtonSystemItem:UIBarButtonSystemItemAdd target:self action:@selector(buttonPressed)];
navControl.navigationItem.rightBarButtonItem = addButton;
[navControl.navigationItem.rightBarButtonItem retain];
}
//[navControl release];
[self.window makeKeyAndVisible];
return;
Here's the declaration of the addButton in the header for App Delegate and my view's header:
UIBarButtonItem *addButton;
@property (nonatomic, retain) UIBarButtonItem *addButton
Other posts say to check viewDidLoad/viewWillAppear but putting that first blurb of code in either of those does not solve the issue.
| 0 | [
2,
21024,
13,
18,
43,
197,
13,
8,
1,
193,
1850,
811,
444,
2119,
79,
20341,
76,
12797,
1418,
120,
4865,
24249,
3322,
800,
3726,
3726,
86,
31,
57,
40,
1513,
29,
51,
193,
1850,
811,
444,
2119,
79,
16797,
9,
31,
57,
81,
2847,
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... |
Running iOS UIAutomation tests from Jenkins
===
For a while now I've been trying to work out how to run UIAutomation tests from Jenkins - every time I run the build, it builds fine, then it runs my instruments command (using the same command as detailed here ( http://stackoverflow.com/questions/4819000/can-instruments-be-used-using-the-command-line) and jenkins just hangs, well the whole machine does, and when I look at activity monitor I can see an instruments process using 2gb of memory.
When I set up jenkins, I original ran it as from a hidden user - this presented some challenges with jenkins being a deamon and not being able to access the window server. I then decided to change the jenkins account to a normal user, logged in and ran instruments from the command line - this worked fine.. but still had no luck with running it from jenkins.
I have set the jenkins account as a developer - no admin though
Please let me know if there's anything else that I could try, or if anyone has got this running successful your guidance would be much appreciated - Thanks | 0 | [
2,
946,
13,
7760,
13,
5661,
18042,
79,
857,
4894,
37,
11420,
800,
3726,
3726,
26,
21,
133,
130,
31,
22,
195,
74,
749,
20,
170,
70,
184,
20,
485,
13,
5661,
18042,
79,
857,
4894,
37,
11420,
13,
8,
352,
85,
31,
485,
14,
1895,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is the stack corrupted if the EBP frame pointer is NULL?
===
My understanding of stack traces is essentially based on http://stackoverflow.com/questions/1395591/what-is-exactly-the-base-pointer-and-stack-pointer-to-what-do-they-point.
A program I have been helping to develop for years spits out a stack dump when it crashes, and I have become accustomed to evaluating these stack traces, in correspondence with a .map file that the C++ compiler produces. A number of times, I have successfully been able to walk the stack and debug issues.
However, sometimes the stack trace has a NULL EBP (frame) pointer. Here is the relevant snippet from such a sample stack dump:
Initial EBP pointer value: 04d8fab0
{at address 04d8fab0: 00000000}
As you can see, the value of the EBP frame pointer is NULL. Therefore, I cannot walk the stack.
Is this the sign of a corrupted stack, or is there another possible explanation?
| 0 | [
2,
25,
14,
7566,
11305,
69,
100,
14,
11817,
306,
3523,
454,
106,
25,
16203,
60,
800,
3726,
3726,
51,
3260,
16,
7566,
10738,
25,
7398,
432,
27,
7775,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
11698,
23884,
3902,
8197,
608,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
On an Facebook App, I have enabled the permission read_mailbox for users of my app. I am wondering how to access user's mailbox's?
===
so how can I read a users mailbox from the developer page? | 0 | [
2,
27,
40,
9090,
4865,
15,
31,
57,
9338,
14,
5572,
1302,
1,
8079,
5309,
26,
3878,
16,
51,
4865,
9,
31,
589,
5712,
184,
20,
1381,
4155,
22,
18,
4216,
5309,
22,
18,
60,
800,
3726,
3726,
86,
184,
92,
31,
1302,
21,
3878,
4216,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I anonymise a mercurial repository?
===
I have a programming assignment I'm to hand in at my University for the end of this week and they have strict rules about anonymity of the assignments to maintain impartiality, so if my name (or any other obvious identifying info) appears anywhere in the work it may be automatically disqualified.
While preparing to burn everything to disc, I've just noticed/remembered that my HG repo is *full* of copies of my name. The code is all clean, but the author of every changeset is either my full name and email or my university login ID and the hostname of a lab computer (depends where I was working).
I need to create an anonymised version of the repo (or swap out all names for my student ID number) without losing any of the other information it holds.
So, as the headline says, how do I anonymise a mercurial repository? | 0 | [
2,
184,
107,
31,
40,
14016,
2628,
21,
9046,
3594,
192,
24869,
60,
800,
3726,
3726,
31,
57,
21,
3143,
8427,
31,
22,
79,
20,
224,
19,
35,
51,
155,
26,
14,
241,
16,
48,
877,
17,
59,
57,
8170,
1761,
88,
40,
14016,
856,
16,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
matching certain keywords in a string that are not delimited by certain characters
===
In a Java program, I want to find out all the occurrences in a given String of these substrings: $$, or $\d (the symbol '$' followed by an integer).
My problem started when I added an additional constraint stating that a match occurs only if the matched string is not part of a substring limited by certain sequence of characters.
For example, I want to ignore the matches if they are part of a substring surrounded by "/{" and "/}".
The following example brings all the occurrences of $$, or $\d, but ignores the additional constraint of ignoring the match if it is inside "/{" and "/}".
public static final String PARAMETERS_PREFIX = "$";
public static final String ALL_PARAMS_SUFFIX = "$";
public static final String BEGIN_JAVA_EXPRESSION = "/{";
public static final String END_JAVA_EXPRESSION = "/}";
...
String test = "$1 xxx $$ " //$1 and $$ are matches
+ BEGIN_JAVA_EXPRESSION + "xxx $2 xxx" + END_JAVA_EXPRESSION; //$2 SHOULD NOT be a match
Set<String> symbolsSet = new LinkedHashSet<String>();
Pattern pattern = Pattern.compile(Pattern.quote(PARAMETERS_PREFIX)+"(\\d+|"+Pattern.quote(ALL_PARAMS_SUFFIX)+")");
Matcher findingMatcher = pattern.matcher(test);
while(findingMatcher.find()) {
String match = findingMatcher.group();
symbolsSet.add(match);
}
return new ArrayList<String>(symbolsSet);
Does someone could give me a hint about how to write the right regex for this problem ?. | 0 | [
2,
10120,
1200,
1246,
12827,
19,
21,
3724,
30,
50,
52,
121,
23012,
34,
1200,
1766,
800,
3726,
3726,
19,
21,
8247,
625,
15,
31,
259,
20,
477,
70,
65,
14,
12933,
18,
19,
21,
504,
3724,
16,
158,
972,
11130,
18,
45,
5579,
4403,
15... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
converting file size in bytes to human readable
===
I'm using this function to convert file size in bytes to a human readable file size:
function getReadableFileSizeString(fileSizeInBytes) {
var i = -1;
var byteUnits = [' kB', ' MB', ' GB', ' TB', 'PB', 'EB', 'ZB', 'YB'];
do {
fileSizeInBytes = fileSizeInBytes / 1024;
i++;
} while (fileSizeInBytes > 1024);
return Math.max(fileSizeInBytes, 0.1).toFixed(1) + byteUnits[i];
};
However, it seems like this isn't 100% accurate. For example...
getReadableFileSizeString(1551859712); // output is "1.4 GB"
Shouldn't this be "1.5 GB"? It seems like the division by 1024 is losing precision. Am I totally misunderstanding something or is there a better way to do this?
| 0 | [
2,
19583,
3893,
1072,
19,
34,
3231,
20,
585,
1302,
579,
800,
3726,
3726,
31,
22,
79,
568,
48,
1990,
20,
8406,
3893,
1072,
19,
34,
3231,
20,
21,
585,
1302,
579,
3893,
1072,
45,
1990,
164,
10647,
579,
16877,
10454,
11130,
5,
16877,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Android Client Server Application Via Bluetooth
===
Where can I get Android application source? I want to find a sample chat application in which Android Mobile act as a client and PC as a server using Bluetooth.
Thank You | 0 | [
2,
13005,
6819,
8128,
3010,
1197,
705,
15808,
800,
3726,
3726,
113,
92,
31,
164,
13005,
3010,
1267,
60,
31,
259,
20,
477,
21,
5717,
6615,
3010,
19,
56,
13005,
3241,
601,
28,
21,
6819,
17,
5168,
28,
21,
8128,
568,
705,
15808,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to repaint a Word 2003 menubar
===
I have a Word 2003 .dot template that changes it's menu based on the condition of the active document.
The DocumentChange, DocumentOpen and NewDocument events of Word.Application trigger setting the .Visible and .Enabled properties of CommandBarButton controls.
On switching active documents, controls exposed by changing the Visible property display correctly, but text buttons which have been enabled/disabled do not change appearance. You can show enabled controls by hovering over them, but the disabled ones do not repaint until you place a window in front.
Is there a simple way to send a repaint message to the menubar, to simulate hiding and exposing?
| 0 | [
2,
184,
20,
302,
20578,
21,
833,
973,
11379,
1850,
800,
3726,
3726,
31,
57,
21,
833,
973,
13,
9,
12527,
22894,
30,
1693,
32,
22,
18,
11379,
432,
27,
14,
2874,
16,
14,
1348,
4492,
9,
14,
4492,
16229,
15,
4492,
10157,
17,
78,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.