unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Where can I learn about proven methods for sharing crypographic keys?
===
Suppose that a group wants to encrypt some information, then share the encryption key among the group members in a way that requires the consensus of the group to decrypt the information. I'm interested in a variety of scenarios where the breadth of consensus ranges from unanimity to an absolute majority. A useful technique can apply to symmetric keys, private keys, or both.
I could take a crack at rolling my own method, as I'm sure many SO members could. But for the purposes of this question, I am interested *only* in methods that have been widely published and have withstood scrutiny by expert cryptanalysts. Journal citations are good, but interpretation of academic sources are very useful too. | 0 | [
2,
113,
92,
31,
2484,
88,
8829,
3195,
26,
6126,
3687,
306,
11113,
5534,
60,
800,
3726,
3726,
5787,
30,
21,
214,
2846,
20,
1957,
11435,
109,
676,
15,
94,
1891,
14,
24420,
1246,
497,
14,
214,
443,
19,
21,
161,
30,
4781,
14,
11205,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 install a masked package in Gentoo 2008?
===
I searched the net and handbook, but I only managed to learn what is the masked package, and not how to install it. I did find some commands, but they don't seem to work on 2008 (looking at it, it seems those are for earlier versions). I have something like this:
localhost ~ # emerge flamerobin
Calculating dependencies
!!! All ebuilds that could satisfy "dev-db/flamerobin" have been masked.
!!! One of the following masked packages is required to complete your request:
- dev-db/flamerobin-0.8.6 (masked by: ~x86 keyword)
- dev-db/flamerobin-0.8.3 (masked by: ~x86 keyword)
I would like to install version 0.8.6, but don't know how? I found some instructions, but they tell me to edit or write to some files under /etc/portage. However, I don't have /etc/portage on my system:
localhost ~ # ls /etc/portage
ls: cannot access /etc/portage: No such file or directory
| 0 | [
2,
184,
20,
16146,
21,
20354,
6030,
19,
4380,
8175,
570,
60,
800,
3726,
3726,
31,
9036,
14,
4275,
17,
16582,
15,
47,
31,
104,
1471,
20,
2484,
98,
25,
14,
20354,
6030,
15,
17,
52,
184,
20,
16146,
32,
9,
31,
144,
477,
109,
14294... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Datagridview virtual model combobox
===
how can you dynamically add items to a combobox using the datagridview virtual mode? | 0 | [
2,
1054,
16375,
4725,
6599,
1061,
22621,
5309,
800,
3726,
3726,
184,
92,
42,
7782,
1326,
3547,
3755,
20,
21,
22621,
5309,
568,
14,
1054,
16375,
4725,
6599,
3740,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How would you format multiple properties when using Property Initialization? (.Net)
===
For example:
root.Nodes.Add(new TNode() { Foo1 = bar1, Foo2 = bar2, Foo3 = bar3 });
or:
root.Nodes.Add(new TNode() { Foo1 = bar1,
Foo2 = bar2,
Foo3 = bar3 });
| 0 | [
2,
184,
83,
42,
2595,
1886,
3704,
76,
568,
1354,
2104,
1829,
60,
13,
5,
9,
2328,
6,
800,
3726,
3726,
26,
823,
45,
5900,
9,
251,
3196,
9,
14854,
5,
2681,
13,
38,
251,
546,
5,
6,
13,
1,
4310,
111,
165,
800,
748,
165,
15,
431... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best practice for naming convention of UI controls for referencing in code-behind?
===
What is the best practice for naming UI controls (textboxes, drop-downs, etc.) on forms and reports for reference in the code-behind pages?
I develop a lot of reports and forms in my office. I have several web applications providing about 80+ "live" reports being generated from various and multiple data sources (Access, SQL, Oracle). These reports are considered "live" because they accept user set paramaters from a form, then query the database to produce a report based on the current information available.
So, the process starts with obtaining the values set by the user, passing those to the database query, receiving the dataset, and finally assigning the dataset to the report. In some cases, additional fields displayed on the report need to be calculated from the dataset before the report can be generated. This requires referencing the output controls on the report to assign the calculated value.
While I don't really care to use prefixes in my code for variables or member fields, I do use them to identify the UI controls. For example, txtFirstName to reference the report control to assign the data from the FirstName field in the dataset to the display control on the report. Is there a better practice for naming/referencing UI controls on forms and reports? | 0 | [
2,
246,
1345,
26,
10929,
3087,
16,
13,
5661,
8671,
26,
13,
29254,
19,
1797,
8,
24878,
60,
800,
3726,
3726,
98,
25,
14,
246,
1345,
26,
10929,
13,
5661,
8671,
13,
5,
11969,
5309,
160,
15,
2804,
8,
2968,
18,
15,
2722,
9,
6,
27,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to improve ASP.NET/C# compilation speed?
===
What hardware/tools/add-in are you using to improve ASP.NET compilation and first execution speed? We are looking at solid state hard drives to speed things up, but the prices are really high right now.
I have two 7200rpm harddrives in RAID 0 right now and I'm not satisfied with the performance anymore.
So my main question is what is the best cost effective way right now to improve ASP.NET compilation speed and overall development performance when you do a lot of debugging?
Scott Gu has a pretty good blog post about this, anyone has anything else to suggest?
http://weblogs.asp.net/scottgu/archive/2007/11/01/tip-trick-hard-drive-speed-and-visual-studio-performance.aspx | 0 | [
2,
98,
25,
14,
246,
161,
20,
3545,
28,
306,
9,
2328,
118,
150,
5910,
4868,
1362,
60,
800,
3726,
3726,
98,
7610,
118,
20799,
18,
118,
14854,
8,
108,
50,
42,
568,
20,
3545,
28,
306,
9,
2328,
4868,
17,
64,
5769,
1362,
60,
95,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the easiest way to upgrade a large C# winforms app to WPF
===
I work on a large C# application (approximately 450,000 lines of code), we constantly have problems with desktop heap and GDI handle leaks. WPF solves these issues, but I don't know what is the best way to upgrade (I expect this is going to take a long time). The application has only a few forms but these can contain many different sets of user-controls which are determined programatically.
This is an internal company app so our release cycles are very short (typically 3 week release cycle).
Is there some gradual upgrade path or do we have to take the hit in one massive effort? | 0 | [
2,
98,
25,
14,
27237,
161,
20,
9483,
21,
370,
272,
5910,
628,
4190,
18,
4865,
20,
619,
7721,
800,
3726,
3726,
31,
170,
27,
21,
370,
272,
5910,
3010,
13,
5,
24853,
268,
10274,
1560,
16,
1797,
6,
15,
95,
7545,
57,
1716,
29,
1740... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Free open source asp.net file managers?
===
Any good ones?
So far I have found IZWebFileManager, OXFileManager and AWS File Picker. The file manager should be able to delete, copy, rename, download & upload files. | 0 | [
2,
551,
368,
1267,
28,
306,
9,
2328,
3893,
12657,
60,
800,
3726,
3726,
186,
254,
53,
18,
60,
86,
463,
31,
57,
216,
13,
3186,
14113,
16877,
22256,
15,
7506,
16877,
22256,
17,
21,
10268,
3893,
2036,
106,
9,
14,
3893,
1382,
378,
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,
0,
0,
0... |
Tools to work with stored procedures in Oracle, in a team ?
===
What tools do you use to develop Oracle stored procedures, in a team :
- To automatically "lock" the current procedure you are working with, so nobody else in the team can make changes to it until you are finished.
- To automatically send the changes you make in the stored procedure, in an Oracle database, to a Subversion, CVS, ... repository
Thanks! | 0 | [
2,
4672,
20,
170,
29,
8214,
8876,
19,
15759,
15,
19,
21,
173,
13,
60,
800,
3726,
3726,
98,
4672,
107,
42,
275,
20,
2803,
15759,
8214,
8876,
15,
19,
21,
173,
13,
45,
13,
8,
20,
7499,
13,
7,
3966,
7,
14,
866,
7004,
42,
50,
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... |
GWT-EXT - What is the best way to widgets to a specific ContentPanel after an event?
===
first post don't hurt me :)
I am using a `BorderLayout` with the usual North, West, Center, South Panels. On the **West** `ContentPanel`, I've got a `Tree`. If an event (`OnClick`)occurs I want a particular dialog box displayed on the **Center** `ContentPanel`.
What is the best way for me to do this? Currently I'm using a function called `returnPanel()` that returns the center `ContentPanel`. In the event handler I call this function `(MainWindow.returnPanel().add(myDialog))`.
| 0 | [
2,
14094,
38,
8,
1706,
38,
13,
8,
98,
25,
14,
246,
161,
20,
4807,
43,
3060,
18,
20,
21,
1903,
2331,
3206,
532,
75,
40,
807,
60,
800,
3726,
3726,
64,
678,
221,
22,
38,
1500,
55,
13,
45,
6,
31,
589,
568,
21,
13,
1,
24389,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 did you use to teach yourself python?
===
I'm an avid programmer, and I like to learn new languauges... I normally teach them myselves
What are your suggestions for resources for learning python? | 4 | [
2,
98,
144,
42,
275,
20,
5348,
2834,
20059,
60,
800,
3726,
3726,
31,
22,
79,
40,
19613,
17968,
15,
17,
31,
101,
20,
2484,
78,
4544,
3786,
13054,
18,
9,
9,
9,
31,
4147,
5348,
105,
51,
3434,
195,
18,
98,
50,
154,
18389,
26,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Did you ever switch from one programming language to another?
===
The stereotypical programmer is very keen on writing software in one particular programming language and is very fanatic about defending their programming language in any way they can, without being realistic about whether their programming language is the best tool for the job.
The other kind of programmer can take a step back and switch between languages (or is not very concerned about doing everything in just one language) is a "jack-of-all-trades" and doesn't mind learning a new language. As long as it solves their business problem in a good fashion.
Did you ever switch from one programming language to another? If yes, why?
*[P.S. Please don't just answer with "I switched from language A to B because company X sucks! I think it will be very useful to understand why people switch between languages, or what's the best tool for a particular kind of job]* | 4 | [
2,
144,
42,
462,
5521,
37,
53,
3143,
816,
20,
226,
60,
800,
3726,
3726,
14,
29187,
17968,
25,
253,
7194,
27,
1174,
2306,
19,
53,
1498,
3143,
816,
17,
25,
253,
24908,
88,
6119,
66,
3143,
816,
19,
186,
161,
59,
92,
15,
366,
142,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 remove from NSMutableArray while iterating?
===
In Cocoa, if I want to loop through an NSMutableArray and remove multiple objects that fit a certain criteria, what's the best way to do this without restarting the loop each time I remove an object?
Thanks, | 0 | [
2,
246,
161,
20,
4681,
37,
13,
2172,
7903,
579,
8576,
93,
133,
32,
106,
1880,
60,
800,
3726,
3726,
19,
24507,
15,
100,
31,
259,
20,
5293,
120,
40,
13,
2172,
7903,
579,
8576,
93,
17,
4681,
1886,
3916,
30,
2742,
21,
1200,
9157,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is your last useful Perl one-liner (or a pipe envolving perl)?
===
The one-liner should:
* solve a real-world problem
* not be extensively cryptic (should be easy to understand and reproduce)
* be worth the time it takes to write it (should not be too clever)
I'm looking for practical tips and tricks. | 4 | [
2,
98,
25,
154,
236,
4811,
416,
255,
53,
8,
14813,
13,
5,
248,
21,
7642,
1957,
5847,
8397,
416,
255,
6,
60,
800,
3726,
3726,
14,
53,
8,
14813,
378,
45,
1637,
8402,
21,
683,
8,
4423,
1448,
1637,
52,
44,
7802,
25792,
13,
5,
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... |
source control with VB2005 Express
===
Can anyone suggest a good source control system that interfaces with VB2005 Express? As the Express editions of Visual Studio do not allow add-ins does this mean that I will not be able to integrate source control into the IDE? I'm used to the check-in/check-out process of SourceSafe integrated into VB6. Can anyone recommend TortoiseSVN as an alternative? | 0 | [
2,
1267,
569,
29,
13,
20468,
2835,
2999,
800,
3726,
3726,
92,
1276,
5601,
21,
254,
1267,
569,
329,
30,
6573,
18,
29,
13,
20468,
2835,
2999,
60,
28,
14,
2999,
6179,
16,
3458,
1120,
107,
52,
1655,
3547,
8,
108,
18,
630,
48,
884,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 access the Server (HttpServerUtility) object in a Thread or Timer ?
===
I use a `System.Timers.Timer` in my Asp.Net application and I need to use the `HttpServerUtility.MapPath` method which seems to be only available via `HttpContext.Current.Server.MapPath`.
The problem is that `HttpContext.Current` is `null` when the `Timer.Elapsed` event fires.
Is there another way to get a reference to a HttpServerUtility object ?
I could inject it in my class' constructor. Is it safe ? How can I be sure it won't be Garbage Collected at the end of the current request ?
Thanks !
| 0 | [
2,
184,
20,
1381,
14,
8128,
13,
5,
21127,
10321,
106,
14255,
856,
6,
3095,
19,
21,
9322,
54,
85,
139,
13,
60,
800,
3726,
3726,
31,
275,
21,
13,
1,
10724,
9,
891,
1224,
9,
891,
139,
1,
19,
51,
28,
306,
9,
2328,
3010,
17,
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... |
Is there a printf converter to print in binary format?
===
I can print with printf as a hex or octal number. Is there a format tag to print as binary, or arbitrary base?
I am running gcc.
printf("%d %x %o\n", 10, 10, 10); //prints "10 A 12\n"
print("%b\n", 10); // prints "%b\n"
| 0 | [
2,
25,
80,
21,
4793,
410,
25893,
20,
4793,
19,
14171,
2595,
60,
800,
3726,
3726,
31,
92,
4793,
29,
4793,
410,
28,
21,
24,
396,
54,
9543,
192,
234,
9,
25,
80,
21,
2595,
3383,
20,
4793,
28,
14171,
15,
54,
17237,
1000,
60,
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... |
Why shouldn't I use "Hungarian Notation"?
===
I know what Hungarian refers to - giving information about a variable or parameter as a prefix to its name. Everyone seems to be rabidly against it, even though in some cases it seems to be a good idea. If I feel that useful information is being imparted, why shouldn't I put it right there where it's available? | 0 | [
2,
483,
5714,
22,
38,
31,
275,
13,
7,
14136,
15591,
7,
60,
800,
3726,
3726,
31,
143,
98,
5046,
3806,
20,
13,
8,
1438,
676,
88,
21,
7612,
54,
18906,
28,
21,
14315,
20,
82,
204,
9,
1266,
2206,
20,
44,
29168,
102,
149,
32,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I find out the size of a canvas item in Python/Tkinter?
===
I want to create some text in a canvas:
myText = self.canvas.create_text(5, 5, anchor=NW, text="TEST")
Now how do I find the width and height of myText? | 0 | [
2,
184,
107,
31,
477,
70,
14,
1072,
16,
21,
9696,
9101,
19,
20059,
118,
38,
1767,
815,
60,
800,
3726,
3726,
31,
259,
20,
1600,
109,
1854,
19,
21,
9696,
45,
51,
11969,
800,
1119,
9,
1245,
8471,
9,
6037,
1373,
1,
11969,
5,
264,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there anyway to do HTTP PUT in python
===
I need to upload some data to a server using HTTP PUT in python. From my brief reading of the urllib2 docs, it only does http post. is there anyway to do http put in python? | 0 | [
2,
25,
80,
2774,
20,
107,
7775,
442,
19,
20059,
800,
3726,
3726,
31,
376,
20,
71,
8294,
109,
1054,
20,
21,
8128,
568,
7775,
442,
19,
20059,
9,
37,
51,
2698,
1876,
16,
14,
13,
911,
211,
4598,
135,
9765,
18,
15,
32,
104,
630,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Outsourcing
===
I am possibly going to have to outsource some work, the good news is that I will have a lot of authority over what I do (so no silly red tape) but the bad news is that I have no experience.
I am not asking for suggested locations to find people that I can outsource to but for suggestions on how to make the best use of them and tips to help avoid possible pitfalls that I may encounter.
I am interested in Web Design/Development outsourcing so tips specific to that are especially welcome.
Thanks. | 4 | [
2,
70,
27028,
800,
3726,
3726,
31,
589,
2879,
228,
20,
57,
20,
70,
12097,
109,
170,
15,
14,
254,
996,
25,
30,
31,
129,
57,
21,
865,
16,
1959,
84,
98,
31,
107,
13,
5,
656,
90,
10752,
402,
5473,
6,
47,
14,
896,
996,
25,
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... |
Using Python's ftplib to get a directory listing, portably
===
You can use ftplib for full FTP support in Python. However the preferred way of getting a directory listing is:
# File: ftplib-example-1.py
import ftplib
ftp = ftplib.FTP("www.python.org")
ftp.login("anonymous", "ftplib-example-1")
data = []
ftp.dir(data.append)
ftp.quit()
for line in data:
print "-", line
Which yields:
$ python ftplib-example-1.py
- total 34
- drwxrwxr-x 11 root 4127 512 Sep 14 14:18 .
- drwxrwxr-x 11 root 4127 512 Sep 14 14:18 ..
- drwxrwxr-x 2 root 4127 512 Sep 13 15:18 RCS
- lrwxrwxrwx 1 root bin 11 Jun 29 14:34 README -> welcome.msg
- drwxr-xr-x 3 root wheel 512 May 19 1998 bin
- drwxr-sr-x 3 root 1400 512 Jun 9 1997 dev
- drwxrwxr-- 2 root 4127 512 Feb 8 1998 dup
- drwxr-xr-x 3 root wheel 512 May 19 1998 etc
...
I guess the idea is to parse the results to get the directory listing. However this listing is directly dependent on the FTP server's way of formatting the list. It would be very messy to write code for this having to anticipate all the different ways FTP servers might format this list.
Is there a portable way to get an array filled with the directory listing?
(The array should only have the folder names.) | 0 | [
2,
568,
20059,
22,
18,
1187,
306,
8326,
20,
164,
21,
16755,
9554,
15,
1295,
4801,
800,
3726,
3726,
42,
92,
275,
1187,
306,
8326,
26,
503,
1187,
306,
555,
19,
20059,
9,
207,
14,
5981,
161,
16,
1017,
21,
16755,
9554,
25,
45,
6926,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
python.array versus numpy.array
===
If you are creating a 1d array in Python is there any benefit to using the NumPy package? | 0 | [
2,
20059,
9,
8576,
93,
5706,
13,
6336,
6448,
9,
8576,
93,
800,
3726,
3726,
100,
42,
50,
2936,
21,
137,
43,
7718,
19,
20059,
25,
80,
186,
4234,
20,
568,
14,
13,
6336,
6448,
6030,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What are the cons of a web based application
===
I am going to write a database application for the camp I work for. I am thinking about writing it in C# with a Windows GUI interface but using a browser as the application is seeming more and more appelaing for various reasons. What I am wondering is why someone would not choose to write an application as a web application. Ex. The back button can cause you some trouble. Are there other things that ayone can think of? | 0 | [
2,
98,
50,
14,
11608,
16,
21,
2741,
432,
3010,
800,
3726,
3726,
31,
589,
228,
20,
2757,
21,
6018,
3010,
26,
14,
1232,
31,
170,
26,
9,
31,
589,
1440,
88,
1174,
32,
19,
272,
5910,
29,
21,
1936,
9457,
6573,
47,
568,
21,
16495,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# class separation into a header and a .cs file
===
Is there a way to separate a C# class into a header that contains the class definition and then an actual .cs file that contains the implementation? I suppose one can do this by creating an interface, but that doesn't seem right. I just want a file where I can just see the class design, and not all the detail. It's easy enough to do in C++, but I haven't seen it done with C#.
Thanks in advance. | 0 | [
2,
272,
5910,
718,
8312,
77,
21,
157,
106,
17,
21,
13,
9,
6824,
3893,
800,
3726,
3726,
25,
80,
21,
161,
20,
1725,
21,
272,
5910,
718,
77,
21,
157,
106,
30,
1588,
14,
718,
5465,
17,
94,
40,
3463,
13,
9,
6824,
3893,
30,
1588,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 enable inno-db support on installed MySql?
===
How to enable inno-db support on installed instance of MySql?
I have installed mysql-5.0.67-win32.
'InnoDB' is 'DISABLED' when executing 'show engines'.
In my.ini I commented line with 'skip-innodb'. This didn't help.
| 0 | [
2,
184,
20,
9240,
19,
251,
8,
9007,
555,
27,
4066,
51,
18,
22402,
60,
800,
3726,
3726,
184,
20,
9240,
19,
251,
8,
9007,
555,
27,
4066,
4851,
16,
51,
18,
22402,
60,
31,
57,
4066,
51,
18,
22402,
8,
264,
9,
387,
9,
4167,
8,
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... |
Creating a column of RadioButtons in Adobe Flex
===
I'm using the AdvancedDataGrid widget and I want two columns to be radio buttons, where each column is it's own RadioButtonGroup. I thought I had all the necessary mxxml, but I'm running into a strange behavior issue. When I scroll up and down, the button change values! The selected button becomes deselected, and unselected ones become selected. Anyone have a clue about this bug? Should I being going about this a different way. -- Here's a stripped down example of what I trying to do.
<mx:WindowedApplication xmlns:mx="http://www.adobe.com/2006/mxml" layout="absolute">
<mx:RadioButtonGroup id="leftAxisGrp" />
<mx:RadioButtonGroup id="rightAxisGrp">
<mx:change>
<![CDATA[
trace (rightAxisGrp.selection);
trace (rightAxisGrp.selection.data.name);
]]>
</mx:change>
</mx:RadioButtonGroup>
<mx:AdvancedDataGrid
id="readingsGrid"
designViewDataType="flat"
height="150" width="400"
sortExpertMode="true"
selectable="false">
<mx:columns>
<mx:AdvancedDataGridColumn
headerText="L" width="25" paddingLeft="6"
dataField="left" sortable="false">
<mx:itemRenderer>
<mx:Component>
<mx:RadioButton groupName="leftAxisGrp" />
</mx:Component>
</mx:itemRenderer>
</mx:AdvancedDataGridColumn>
<mx:AdvancedDataGridColumn
headerText="R" width="25" paddingLeft="6"
dataField="right" sortable="false">
<mx:itemRenderer>
<mx:Component>
<mx:RadioButton groupName="rightAxisGrp" />
</mx:Component>
</mx:itemRenderer>
</mx:AdvancedDataGridColumn>
<mx:AdvancedDataGridColumn headerText="" dataField="name" />
</mx:columns>
<mx:dataProvider>
<mx:Array>
<mx:Object left="false" right="false" name="Reddish-gray Mouse Lemur" />
<mx:Object left="false" right="false" name="Golden-brown Mouse Lemur" />
<mx:Object left="false" right="false" name="Northern Rufous Mouse Lemur" />
<mx:Object left="false" right="false" name="Sambirano Mouse Lemur" />
<mx:Object left="false" right="false" name="Simmons' Mouse Lemur" />
<mx:Object left="false" right="false" name="Pygmy Mouse Lemur" />
<mx:Object left="false" right="false" name="Brown Mouse Lemur" />
<mx:Object left="false" right="false" name="Madame Berthe's Mouse Lemur" />
<mx:Object left="false" right="false" name="Goodman's Mouse Lemur" />
<mx:Object left="false" right="false" name="Jolly's Mouse Lemur" />
<mx:Object left="false" right="false" name="Mittermeier's Mouse Lemur" />
<mx:Object left="false" right="false" name="Claire's Mouse Lemur" />
<mx:Object left="false" right="false" name="Danfoss' Mouse Lemur" />
<mx:Object left="false" right="false" name="Lokobe Mouse Lemur" />
<mx:Object left="true" right="true" name="Bongolava Mouse Lemur" />
</mx:Array>
</mx:dataProvider>
</mx:AdvancedDataGrid>
</mx:WindowedApplication>
| 0 | [
2,
2936,
21,
4698,
16,
603,
811,
444,
18,
19,
20299,
14409,
800,
3726,
3726,
31,
22,
79,
568,
14,
2255,
18768,
16375,
4807,
43,
3060,
17,
31,
259,
81,
7498,
20,
44,
603,
12861,
15,
113,
206,
4698,
25,
32,
22,
18,
258,
603,
811... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 deal with pair programming issues?
===
Some members of the team are having problems programming together.
Different gender, different culture, different age. How to deal with those problems?
- Do not pair them together, or
- Pair them together and let them come to a "golden middle" | 2 | [
2,
184,
20,
1183,
29,
2146,
3143,
1549,
60,
800,
3726,
3726,
109,
443,
16,
14,
173,
50,
452,
1716,
3143,
429,
9,
421,
4552,
15,
421,
1365,
15,
421,
348,
9,
184,
20,
1183,
29,
273,
1716,
60,
13,
8,
107,
52,
2146,
105,
429,
15... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What does %~d0 mean in a Windows batch file?
===
I'm looking at a batch file which defines the following variables:
set _SCRIPT_DRIVE=%~d0 set
set _SCRIPT_PATH=%~p0
Does anybody have any information about what %~d0 or %~p0 actually mean? Is there a set of well-known values for things like current directory, drive, parameters to a script? Are there any other similar syntactic hacks I could use?
I'm just looking for more information on these seemingly strange constructs. | 0 | [
2,
98,
630,
13,
11881,
1,
43,
387,
884,
19,
21,
1936,
13064,
3893,
60,
800,
3726,
3726,
31,
22,
79,
699,
35,
21,
13064,
3893,
56,
13110,
14,
249,
12157,
45,
309,
13,
1,
8741,
1,
14573,
3726,
11881,
1,
43,
387,
309,
309,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is an invariant?
===
The word seems to get used in a number of contexts. The best I can figure is that they mean a variable that can't change. Isn't that what constants/finals (darn you Java!) are for? | 0 | [
2,
98,
25,
40,
19,
18445,
60,
800,
3726,
3726,
14,
833,
2206,
20,
164,
147,
19,
21,
234,
16,
4141,
18,
9,
14,
246,
31,
92,
1465,
25,
30,
59,
884,
21,
7612,
30,
92,
22,
38,
753,
9,
2532,
22,
38,
30,
98,
3587,
18,
118,
735... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0... |
Is this C++ structure initialization trick safe?
===
Instead of having to remember to initialize a simple 'C' structure, I might derive from it and zero it in the constructor like this:
struct MY_STRUCT
{
int n1;
int n2;
};
class CMyStruct : public MY_STRUCT
{
public:
CMyStruct()
{
memset(this, 0, sizeof(MY_STRUCT));
}
};
This trick is often used to initialize Win32 structures and can sometimes set the ubiquitous __cbSize__ member.
Now, as long as there isn't a virtual function table for the memset call to destroy, is this a safe practice? | 0 | [
2,
25,
48,
272,
20512,
1411,
2104,
1829,
5514,
1834,
60,
800,
3726,
3726,
700,
16,
452,
20,
1518,
20,
2104,
2952,
21,
1935,
13,
22,
150,
22,
1411,
15,
31,
530,
20576,
37,
32,
17,
4606,
32,
19,
14,
6960,
248,
101,
48,
45,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Background color stretches accross entire width of ul
===
I have a simple list I am using for a horizontal menu:
<ul>
<h1>Menu</h1>
<li><a href="/" class="selected">Home</a></li>
<li><a href="/Home">Forum</a></li>
</ul>
When I add a background color to the selected class, only the text gets the color, I want it to stretch the entire distance of the section.
Hope this makes sense. | 0 | [
2,
2395,
1665,
16077,
21,
150,
7703,
1078,
9456,
16,
13,
1287,
800,
3726,
3726,
31,
57,
21,
1935,
968,
31,
589,
568,
26,
21,
10095,
11379,
45,
13,
1,
1287,
1,
13,
1,
252,
165,
1,
755,
291,
1,
118,
252,
165,
1,
13,
1,
1210,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Secure Gmail login on web browser from external Java program
===
Is there a secure way of logging into a Gmail account on a web browser, from an external Java program? I know the following works, but is there a safer alternative?
Desktop.getDesktop().browse(new URI(
"https://www.google.com/accounts/ServiceLoginAuth?continue=http://mail.google.com/gmail" +
"&service=mail&Email=LOGIN&Passwd=PASSWORD&null=Sign+in")); | 0 | [
2,
4315,
489,
8079,
6738,
108,
27,
2741,
16495,
37,
4886,
8247,
625,
800,
3726,
3726,
25,
80,
21,
4315,
161,
16,
13,
13919,
77,
21,
489,
8079,
2176,
27,
21,
2741,
16495,
15,
37,
40,
4886,
8247,
625,
60,
31,
143,
14,
249,
693,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 interpreter to replace Python
===
In terms of quick dynamically typed languages, I'm really starting to like Javascript, as I use it a lot for web projects, especially because it uses the same syntax as Actionscript (flash).
It would be an ideal language for shell scripting, making it easier to move code from the front and back end of a site, and less of the strange syntax of python.
Is there a good, javascript interpreter that is easy to install (I know there's one based on java, but that would mean installing all the java stuff to use), | 0 | [
2,
8247,
8741,
19336,
20,
3934,
20059,
800,
3726,
3726,
19,
1663,
16,
2231,
7782,
1326,
1001,
43,
2556,
15,
31,
22,
79,
510,
1422,
20,
101,
8247,
8741,
15,
28,
31,
275,
32,
21,
865,
26,
2741,
2314,
15,
1118,
185,
32,
2027,
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... |
Method-naming: get or load
===
I'm writing a desktop application that communicates with a web service. Would you name all web-service functions that that fetch data for **Load**XXXX since it takes a while to execute. Or would you use **Get**XXXX, for instance when getting just a single object.
| 0 | [
2,
2109,
8,
6865,
68,
45,
164,
54,
6305,
800,
3726,
3726,
31,
22,
79,
1174,
21,
17404,
3010,
30,
8709,
18,
29,
21,
2741,
365,
9,
83,
42,
204,
65,
2741,
8,
11449,
3719,
30,
30,
18312,
1054,
26,
13,
1409,
8294,
1409,
396,
13290,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 long does it really take to do something?
===
I mean name off a programming project you did and how long it took, please. The boss has never complained but I sometimes feel like things take too long. But this could be because I am impatient as well. Let me know your experiences for comparison.
I've also noticed that things always seem to take longer, sometimes much longer, than originally planned. I don't know why we don't start planning for it but then I think that maybe it's for motivational purposes.
Ryan | 0 | [
2,
184,
175,
630,
32,
510,
247,
20,
107,
301,
60,
800,
3726,
3726,
31,
884,
204,
168,
21,
3143,
669,
42,
144,
17,
184,
175,
32,
199,
15,
2247,
9,
14,
4054,
63,
243,
11509,
47,
31,
1030,
583,
101,
564,
247,
266,
175,
9,
47,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best java conference to visit
===
My company allows me to visit one international work related (I'm Java/JEE Developer/Technical Lead interested in polyglot programming) conference each year. I've visited JavaOne and Javapolis (devox?) in the past.
For next year I'm looking for a conference which is less technology but a bit more methodology focussed... possible like JAOO or QCon. What would you recommend? | 4 | [
2,
98,
25,
14,
246,
8247,
1199,
20,
2139,
800,
3726,
3726,
51,
237,
2965,
55,
20,
2139,
53,
294,
170,
1597,
13,
5,
49,
22,
79,
8247,
118,
13412,
10058,
118,
22307,
672,
3158,
19,
3446,
6725,
38,
3143,
6,
1199,
206,
159,
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... |
How do you maintain your program vocabulary?
===
In a not-so-small program, when you have not-so-few entities, in order to maintain code readability, common terms, and otherwise improve mutual understanding between team members, one have to define and maintain **program vocabulary**.
How do you (or your company) deal with this task, what discipline do you have, what arrangements do you introduce? | 0 | [
2,
184,
107,
42,
4027,
154,
625,
18630,
60,
800,
3726,
3726,
19,
21,
52,
8,
656,
8,
15988,
625,
15,
76,
42,
57,
52,
8,
656,
8,
3739,
499,
12549,
15,
19,
389,
20,
4027,
1797,
1302,
4091,
15,
757,
1663,
15,
17,
3190,
3545,
764... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Custom Twitter + comments integration with a blog.
===
I would like to create a blog where my Twitter updates essentially create blog posts, with a comment thread. If there isn't blog software that does this right now (I did some searching but couldn't find the commenting aspect) what would be the simplest approach and starting blog software to do this?
(Note, I'm also interested in 'normal' blog posting via the default blog web admin interface.) | 0 | [
2,
5816,
10623,
2754,
7534,
8078,
29,
21,
8146,
9,
800,
3726,
3726,
31,
83,
101,
20,
1600,
21,
8146,
113,
51,
10623,
16779,
7398,
1600,
8146,
9868,
15,
29,
21,
6484,
9322,
9,
100,
80,
2532,
22,
38,
8146,
2306,
30,
630,
48,
193,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Google Chrome broke ShellExecute() ?
===
For years I've been using ShellExecute() API to launch the default web browser from within my applications. Like this:
ShellExecute( hwnd, _T("open"),
_T("http://www.winability.com/home/"),
NULL, NULL, SW_NORMAL );
It's been working fine until a couple of weeks ago, when Google released its Chrome browser. Now, if Chrome is installed on the computer, the ShellExecute API no longer opens a web page.
Has anyone figured out yet how to solve this problem? (Short of detecting Chrome and displaying a message telling the user it's Chrome's fault?)
| 0 | [
2,
8144,
13,
12985,
1842,
3593,
1706,
17194,
591,
5,
6,
13,
60,
800,
3726,
3726,
26,
122,
31,
22,
195,
74,
568,
3593,
1706,
17194,
591,
5,
6,
21,
2159,
20,
3394,
14,
12838,
2741,
16495,
37,
363,
51,
3767,
9,
101,
48,
45,
3593,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.ini & SMTP= - how do you pass username & password
===
My ISP account requires that I send a username & password for outbound SMTP mail.
How do I get PHP to use this when executing php.mail()? The php.ini file only contains entries for the server (SMTP= ) and From: (sendmail_from= ).
| 0 | [
2,
13,
26120,
9,
2651,
279,
7613,
13726,
3726,
13,
8,
184,
107,
42,
1477,
4155,
7259,
279,
20884,
800,
3726,
3726,
51,
25,
306,
2176,
4781,
30,
31,
2660,
21,
4155,
7259,
279,
20884,
26,
70,
7410,
7613,
13726,
4216,
9,
184,
107,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to return multiple tags from a Rails Helper?
===
I want to create a hidden field and create a link in one helper and then output both to my erb.
<%= my_cool_helper "something", form %>
Should out put the results of
link_to "something", a_path
form.hidden_field "something".tableize, :value => "something"
What would the definition of the helper look like? The details of what link_to and the form.hidden_field don't really matter. What matters is, how do I return the output from two different calls. | 0 | [
2,
98,
25,
14,
246,
161,
20,
788,
1886,
3383,
18,
37,
21,
2240,
18,
448,
106,
60,
800,
3726,
3726,
31,
259,
20,
1600,
21,
3689,
575,
17,
1600,
21,
3508,
19,
53,
448,
106,
17,
94,
5196,
156,
20,
51,
13,
106,
220,
9,
13,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Click through transparency for Visual C# Window Forms?
===
I made a panel and set it to fill the screen, now I can see the windows under it but I want it to be click through, meaning they could click a file or see a tool tip of another object through the transparency. | 0 | [
2,
10840,
120,
19668,
26,
3458,
272,
5910,
1463,
1997,
60,
800,
3726,
3726,
31,
117,
21,
4113,
17,
309,
32,
20,
3509,
14,
2324,
15,
130,
31,
92,
196,
14,
1936,
131,
32,
47,
31,
259,
32,
20,
44,
10840,
120,
15,
1813,
59,
110,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Consistently retrieve "From" email addresses across Outlook versions
===
I am picking up emails from a folder and then saving the senders name to a database using automation and C#.
This works well for Outlook 2007 which has the SenderEmailAddress property. However Outlook 2000, XP, 2003 do not have these and will not consistently return name@domain.com. I am providing support for these versions.
I have found that a library called Outlook Redemption will solve this but I am developing in .net and really want to avoid writing to customer registrys.
Would appreciate any pointers as to a .Net alternative to the Redemption dll or an approach to being able to consitently retrieve an email address accross Outlook versions.
Many thanks
AbsFabs | 0 | [
2,
11852,
11917,
13,
7,
2665,
7,
8517,
12636,
464,
19837,
3281,
800,
3726,
3726,
31,
589,
7833,
71,
8517,
18,
37,
21,
19294,
17,
94,
7599,
14,
2660,
445,
204,
20,
21,
6018,
568,
23217,
17,
272,
5910,
9,
48,
693,
134,
26,
19837,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Sorting matched arrays in Java
===
Let's say that I have two arrays (in Java),
int[] numbers; and int[] colors;
Each ith element of numbers corresponds to its ith element in colors.
Ex, numbers = {4,2,1}
colors = {0x11, 0x24, 0x01}; Means that number 4 is color 0x11, number 2 is 0x24, etc.
I want to sort the numbers array, but then still have it so each element matches up with its pair in colors.
Ex. numbers = {1,2,4};
colors = {0x01,0x24,0x11};
What's the cleanest, simplest way to do this? The arrays have a few thousand items, so being in place would be best, but not required. Would it make sense to do an Arrays.sort() and a custom comparator? Using library functions as much as possible is preferable. | 0 | [
2,
2058,
68,
11265,
7718,
18,
19,
8247,
800,
3726,
3726,
408,
22,
18,
395,
30,
31,
57,
81,
7718,
18,
13,
5,
108,
8247,
6,
15,
19,
38,
2558,
500,
2116,
73,
17,
19,
38,
2558,
500,
5268,
73,
206,
31,
96,
4520,
16,
2116,
17016,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where can I get a list of what Crystal Reports features conflict?
===
There are certain Crystal Reports features that cannot be combined in the same report, for example SQL command objects and server side grouping. However, as far as I can find, the built-in help doesn't seem to clearly document these conflicts. For example, checking the help page for either of those features doesn't mention that it doesn't work with the other. I want to be able to find out about these conflicts when I decide to use a new feature, not later when I go to use some other feature and the option is greyed out. Is there any place that documents these conflicts?
I am specifically working with Crystal Reports XI. Bonus points if the list of conflicts documents what range of versions each feature is available and conflicting in. | 0 | [
2,
113,
92,
31,
164,
21,
968,
16,
98,
4282,
2813,
967,
2930,
60,
800,
3726,
3726,
80,
50,
1200,
4282,
2813,
967,
30,
1967,
44,
2461,
19,
14,
205,
1330,
15,
26,
823,
4444,
255,
1202,
3916,
17,
8128,
270,
19288,
9,
207,
15,
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... |
Building a web search engine
===
I've always been interested in developing a web search engine. What's a good place to start? I've heard of Lucene, but I'm not a big Java guy. Any other good resources or open source projects?
I understand it's a huge under-taking, but that's part of the appeal. I'm not looking to create the next Google, just something I can use to search a sub-set of sites that I might be interested in. | 1 | [
2,
353,
21,
2741,
2122,
1406,
800,
3726,
3726,
31,
22,
195,
550,
74,
3158,
19,
3561,
21,
2741,
2122,
1406,
9,
98,
22,
18,
21,
254,
209,
20,
799,
60,
31,
22,
195,
752,
16,
18515,
556,
15,
47,
31,
22,
79,
52,
21,
580,
8247,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 overlap widgets with the pack geometry manager in Python/Tkinter?
===
I want to put a canvas with an image in my window, but then I want to pack() widgets over top of it so the canvas acts as a background. Is it possible to have two states for the pack() manager, one for one set of widgets and another for another set?
| 0 | [
2,
184,
107,
31,
15406,
4807,
43,
3060,
18,
29,
14,
3607,
11689,
1382,
19,
20059,
118,
38,
1767,
815,
60,
800,
3726,
3726,
31,
259,
20,
442,
21,
9696,
29,
40,
1961,
19,
51,
1463,
15,
47,
94,
31,
259,
20,
3607,
5,
6,
4807,
43... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Directory Modification Monitoring
===
I'm building a C# application that will monitor a specified directory for changes and additions and storing the information in a database.
I would like to avoid checking each individual file for modifications, but I'm not sure if I can completely trust the file access time.
What would be the best method to use for getting recently modified files in a directory?
It would check for modifications only when the user asks it to, it will not be a constantly running service. | 0 | [
2,
16755,
16135,
8984,
800,
3726,
3726,
31,
22,
79,
353,
21,
272,
5910,
3010,
30,
129,
7626,
21,
9931,
16755,
26,
1693,
17,
848,
18,
17,
25615,
14,
676,
19,
21,
6018,
9,
31,
83,
101,
20,
2658,
9886,
206,
1359,
3893,
26,
13922,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 into to C++ static metaprogramming?
===
Static metaprogramming (aka "template metaprogramming") is a great C++ technique that allows the execution of programs at compile-time. A light bulb went off in my head as soon as I read this canonical metaprogramming example:
#include <iostream>
using namespace std;
template< int n >
struct factorial { enum { ret = factorial< n -1 >::ret * n }; };
template<>
struct factorial< 0 > { enum { ret = 1 }; };
int main() {
cout << "7! = " << factorial< 7 >::ret << endl; // 5040
return 0;
}
If one wants to learn more about C++ static metaprogramming, what are the best sources (books, websites, on-line courseware, whatever)?
| 0 | [
2,
246,
77,
20,
272,
20512,
12038,
7618,
19746,
3863,
60,
800,
3726,
3726,
12038,
7618,
19746,
3863,
13,
5,
4176,
13,
7,
9577,
6554,
7618,
19746,
3863,
7,
6,
25,
21,
374,
272,
20512,
4873,
30,
2965,
14,
5769,
16,
1726,
35,
26561,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SharePoint 2007 performance issues
===
I don't expect a straightforward silver bullet answer to this, but what are the best practices for ensuring good performance for SharePoint 2007 sites?
We've a few sites for our intranet, and it generally is thought to run slow. There's plenty of memory and processor power in the servers, but the pages just don't 'snap' like you'd expect from a web site running on powerful servers.
We've done what we can to tweak setup, but is there anything we could be missing? | 0 | [
2,
1891,
3132,
624,
956,
1549,
800,
3726,
3726,
31,
221,
22,
38,
4186,
21,
22262,
1172,
6812,
1623,
20,
48,
15,
47,
98,
50,
14,
246,
5242,
26,
14183,
254,
956,
26,
1891,
3132,
624,
3259,
60,
95,
22,
195,
21,
310,
3259,
26,
318... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 static metaprogramming possible in Java?
===
I am a fan of [static metaprogramming in C++][1]. I know Java now has generics. Does this mean that static metaprogramming (i.e., compile-time program execution) is possible in Java? If so, can anyone recommend any good resources where one can learn more about it?
[1]: http://stackoverflow.com/questions/112277/best-intro-to-c-static-metaprogramming | 0 | [
2,
25,
12038,
7618,
19746,
3863,
938,
19,
8247,
60,
800,
3726,
3726,
31,
589,
21,
2514,
16,
636,
18077,
7618,
19746,
3863,
19,
272,
20512,
500,
2558,
165,
500,
9,
31,
143,
8247,
130,
63,
12733,
18,
9,
630,
48,
884,
30,
12038,
76... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Object Programming madness?
===
I've started programming more in OO style than ever (Python).
Any good web resources I could read? **I need help constructing and modelling objects, relations, interfaces etc.** . Not only *dry theory* (I've read that), but something easy to grasp (examples would be nice), do you know any site or a good book? | 0 | [
2,
3095,
3143,
13139,
60,
800,
3726,
3726,
31,
22,
195,
373,
3143,
91,
19,
13,
4328,
1034,
119,
462,
13,
5,
6448,
11570,
6,
9,
186,
254,
2741,
2566,
31,
110,
1302,
60,
13,
1409,
49,
376,
448,
18660,
17,
23089,
3916,
15,
2649,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 remove the passphrase for the SSH key without having to create a new key?
===
I set a passphrase when creating a new SSH key on my laptop. But, as I realise now, this is quite a PITA when you are trying to commit(git,svn) to a remote location over SSH many times in an hour.
One way I can think of is, delete my SSH keys and create new. Is there a way to remove the passphrase, while still keeping the same keys? | 2 | [
2,
184,
107,
31,
4681,
14,
1477,
13314,
870,
26,
14,
13,
18,
1635,
1246,
366,
452,
20,
1600,
21,
78,
1246,
60,
800,
3726,
3726,
31,
309,
21,
1477,
13314,
870,
76,
2936,
21,
78,
13,
18,
1635,
1246,
27,
51,
12294,
9,
47,
15,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does replication in team foundation server work.
===
We have two offices in different states and issues with performance when using integrated source control over the WAN. We were contemplating using replication in TFS to allow both office to have fast and robust connectivity. We need to understand network load, speed of access, how conflicts are managed. | 0 | [
2,
184,
630,
23841,
19,
173,
1304,
8128,
170,
9,
800,
3726,
3726,
95,
57,
81,
3642,
19,
421,
202,
17,
1549,
29,
956,
76,
568,
5547,
1267,
569,
84,
14,
10685,
9,
95,
46,
27412,
568,
23841,
19,
13,
11720,
18,
20,
1655,
156,
488,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using Visual Studio 2008 to Assemble, Link, Debug, and Execute MASM 6.11 Assembly Code
===
I would like to use Visual Studio 2008 to the greatest extent possible while effectively compiling/linking/building/etc code as if all these build processes were being done by the tools provided with MASM 6.11. The exact version of MASM does not matter, so long as it's within the 6.x range, as that is what my college is using to teach 16-bit assembly.
I have done some research on the subject and have come to the conclusion that there are several options:
1. Reconfigure VS to call the MASM 6.11 executables with the same flags, etc as MASM 6.11 would natively do.
2. Create intermediary batch file(s) to be called by VS to then invoke the proper commands for MASM's linker, etc.
3. Reconfigure VS's built-in build tools/rules (assembler, linker, etc) to provide an environment identical to the one used by MASM 6.11.
Option (2) was brought up when I realized that the options available in VS's "External Tools" interface may be insufficient to correctly invoke MASM's build tools, thus a batch file to interpret VS's strict method of passing arguments might be helpful, as a lot of my learning about how to get this working involved my manually calling ML.exe, LINK.exe, etc from the command prompt.
Below are several links that may prove useful in answering my question. Please keep in mind that I have read them all and none are the actual solution. I can only hope my specifying MASM 6.11 doesn't prevent anyone from contributing a perhaps more generalized answer.
Similar method used to Option (2), but users on the thread are not contactable:
<a>http://www.codeguru.com/forum/archive/index.php/t-284051.html</a>
(also, I have my doubts about the necessity of an intermediary batch file)
Out of date explanation to my question:
<a>http://www.cs.fiu.edu/~downeyt/cop3402/masmaul.html</a>
Probably the closest thing I've come to a definitive solution, but refers to a suite of tools from something besides MASM, also uses a batch file:
<a>http://www.kipirvine.com/asm/gettingStarted/index.htm#16-bit</a>
I apologize if my terminology for the tools used in each step of the code -> exe process is off, but since I'm trying to reproduce the entirety of steps in between completion of writing the code and generating an executable, I don't think it matters much. | 0 | [
2,
568,
3458,
1120,
570,
20,
13,
13736,
15,
3508,
15,
121,
16254,
15,
17,
15644,
4885,
79,
400,
9,
1306,
1475,
1797,
800,
3726,
3726,
31,
83,
101,
20,
275,
3458,
1120,
570,
20,
14,
3023,
5674,
938,
133,
5463,
24378,
118,
6258,
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... |
Should I use #define, enum or const?
===
In a C++ project I'm working on I have a *flag* kind of value which can have 4 values. Those 4 flags can be combined. Flags describe the records in database and can be:
- new record
- deleted record
- modified record
- existing record
Now, for each Record I wish to keep this attribute, so I could use enum:
enum { xNew, xDeleted, xModified, xExisting }
However, in other places in code, I need to select which records are to be visible to the user, so I'd like to be able to pass that as a single parameter, like:
showRecords(xNew | xDeleted);
So, it seems I have 3 possible appoaches:
#define X_NEW 0x01
#define X_DELETED 0x02
#define X_MODIFIED 0x04
#define X_EXISTING 0x08
or
typedef enum { xNew = 1, xDeleted, xModified = 4, xExisting = 8 } RecordType;
or
static const uint8 xNew = 1;
static const uint8 xDeleted = 2;
static const uint8 xModified = 4;
static const uint8 xExisting = 8;
Space requirements are important (byte vs int) but not crucial. With defines I lose type safety, and with enum I lose some space (integers) and probably have to cast when I want to do bitwise operation. With const I think I also lose type safety since a random uint8 could get in by mistake.
Is there some other cleaner way?
If not, what would you use and why?
P.S. The rest of the code is rather clean modern C++ without #defines, and I have used namespaces and templates in few spaces, so those aren't out of question either.
| 0 | [
2,
378,
31,
275,
6926,
546,
7509,
15,
1957,
723,
54,
11608,
38,
60,
800,
3726,
3726,
19,
21,
272,
20512,
669,
31,
22,
79,
638,
27,
31,
57,
21,
1637,
22868,
2483,
825,
16,
1923,
56,
92,
57,
268,
4070,
9,
273,
268,
9318,
92,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CPU Emulation and locking to a specific clock speed
===
If you had read my other [question](http://stackoverflow.com/questions/111700/6502-cpu-emulation), you'll know I've spent this weekend putting together a 6502 CPU emulator as a programming exercise.
The CPU emulator is mostly complete, and seems to be fairly accurate from my limited testing, however it is running incredibly fast, and I want to throttle it down to the actual clock speed of the machine.
My current test loop is this:
// Just loop infinitely.
while (1 == 1)
{
CPU.ClockCyclesBeforeNext--;
if (CPU.ClockCyclesBeforeNext <= 0)
{
// Find out how many clock cycles this instruction will take
CPU.ClockCyclesBeforeNext = CPU.OpcodeMapper.Map[CPU.Memory[CPU.PC]].CpuCycles;
// Run the instruction
CPU.ExecuteInstruction(CPU.Memory[CPU.PC]);
// Debugging Info
CPU.DumpDebug();
Console.WriteLine(CPU.OpcodeMapper.Map[CPU.Memory[CPU.PC]].ArgumentLength);
// Move to next instruction
CPU.PC += 1 + CPU.OpcodeMapper.Map[CPU.Memory[CPU.PC]].ArgumentLength;
}
}
As you can tell, each opcode takes a specific amount of time to complete, so I do not run the next instruction until I count down the CPU Cycle clock. This provides proper timing between opcodes, its just that the entire thing runs way to fast.
The targeted CPU speed is 1.79mhz, however I'd like whatever solution to the clock issue to keep the speed at 1.79mhz even as I add complexity, so I don't have to adjust it up.
Any ideas?
| 0 | [
2,
17578,
3579,
11123,
17,
17538,
20,
21,
1903,
4229,
1362,
800,
3726,
3726,
100,
42,
41,
1302,
51,
89,
636,
24652,
500,
5,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
15974,
7915,
118,
13798,
135,
8,
150,
4201,
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... |
Javascript error
===
I'm getting a JS error on displaying a page: Nothing concrete is specified but the line where it seems to be thrown. When looking into the source code of the page, I see the error is thrown inside the following script, but I can't understand why! It's only about loading images!
<SCRIPT language=JavaScript>
<!--
function newImage(arg) {
var rslt = new Image();
rslt.src = arg;
return rslt;
}
function changeImages(a, b) {
a.src = b;
}
newImage("\/_layouts\/images\/icon1.gif");
newImage("\/_layouts\/images\/icon2.gif");
// -->
</SCRIPT>
Any tips on what may be happening here?<br>
Thanks a lot!
| 0 | [
2,
8247,
8741,
7019,
800,
3726,
3726,
31,
22,
79,
1017,
21,
487,
18,
7019,
27,
17418,
21,
2478,
45,
626,
4105,
25,
9931,
47,
14,
293,
113,
32,
2206,
20,
44,
6027,
9,
76,
699,
77,
14,
1267,
1797,
16,
14,
2478,
15,
31,
196,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are bug-free programs easier to write in one language than in another?
===
Are some programming languages, by their nature, easier to write bug-free programs in than others? For a fair comparison, assume that the programmer is considered "skilled" in that particular language, however long that may have taken him.
I'm mainly wondering about the influence of conceptual differences, like:
* manual memory management vs. garbage collection
* imperative vs. imperative/object-oriented vs. functional vs. declarative
* languages with side effects vs. side-effect free languages
* static typing vs. dynamic typing
Again, I don't want to see whether one language is "easier" than another, but compare *once the programmer has mastered the language* how many bugs are produced in one language versus another, and whether the choice of language makes any difference at all. | 0 | [
2,
50,
6256,
8,
4639,
1726,
4950,
20,
2757,
19,
53,
816,
119,
19,
226,
60,
800,
3726,
3726,
50,
109,
3143,
2556,
15,
34,
66,
1444,
15,
4950,
20,
2757,
6256,
8,
4639,
1726,
19,
119,
654,
60,
26,
21,
1768,
6050,
15,
7158,
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... |
Is it possible to have one appBase served by multiple context paths in Tomcat?
===
Is it possible to have one appBase served up by multiple context paths in Tomcat?
I have an application base that recently replaced a second application base. My problem is a number of users still access the old context. I would like to serve the, now common, application from a single appBase yet accessed via either context. I took a swing at the low lying fruit and used a symbolic link in the 'webapps' directory... pointing the old context path at the new context path; it works, but feels "cheezy." And I don't like that a database connection pool is created for both contexts ( I would like to minimize the resources for connecting to the database ).
Anyway, if anyone knows of the "proper" way to do this I will greatly appreciate it. I'm using Tomcat 6.0.16 - no apache front end ( I suppose URL rewrite would be nice ). | 0 | [
2,
25,
32,
938,
20,
57,
53,
4865,
8436,
423,
34,
1886,
4141,
12074,
19,
2067,
5782,
60,
800,
3726,
3726,
25,
32,
938,
20,
57,
53,
4865,
8436,
423,
71,
34,
1886,
4141,
12074,
19,
2067,
5782,
60,
31,
57,
40,
3010,
1000,
30,
1989... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the difference between "lang" and "type"?
===
For `<script>` HTML tags, what is the technical difference between "lang=Javascript" and "type=text/javascript"?
I usually use both, because I've always assumed that older browsers need one or the other. | 0 | [
2,
98,
25,
14,
2841,
128,
13,
7,
9949,
7,
17,
13,
7,
4474,
7,
60,
800,
3726,
3726,
26,
13,
1,
8741,
1,
13,
15895,
3383,
18,
15,
98,
25,
14,
2447,
2841,
128,
13,
7,
9949,
3726,
1004,
1385,
8741,
7,
17,
13,
7,
4474,
3726,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I remove objects from an Array in java?
===
Given an Array of **n** Objects, let's say is an **Array of Strings**, and it has the following values:
foo[0]="a";
foo[1]="cc";
foo[2]="a";
foo[3]="dd";
What do I have to do to delete/remove all the Strings/Objects equal to **"a"** in the Array?
Thanks! | 0 | [
2,
184,
107,
31,
4681,
3916,
37,
40,
7718,
19,
8247,
60,
800,
3726,
3726,
504,
40,
7718,
16,
13,
1409,
103,
1409,
3916,
15,
408,
22,
18,
395,
25,
40,
13,
1409,
8576,
93,
16,
7887,
1409,
15,
17,
32,
63,
14,
249,
4070,
45,
431... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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't attach to w3wp under Vista with UAC turned on
===
I run Vista (business x32) on my work machine, in which I do ASP.NET development. Because I use IIS to server the sites I build (I do a lot of CMS integrations so I need to use IIS not the inbuilt web development server) I always need to attach to w3wp for debugging.
The problem is that w3wp requires elevated permissions for me to connect to the processes from VS 2008. But when I try and restart VS to "run as administrator" I get the error:
"This program has been blocked"
"Your administrator has set a policy to block this program"
I only get this problem when I'm logged into my machine with my domain account (which is in the local admin group), if I use the local admin I have no problems.
I'm the only person on the domain who has this problem, everyone else using Vista can open VS as an administrator no dramas.
To get around this I have to turn off UAC, but it always turns itself back on (after each restart), so this is highly frustrating.
I've not been able to find out how to add a program to the "safe" list either. | 0 | [
2,
92,
22,
38,
19514,
20,
619,
240,
13790,
131,
13520,
29,
287,
1738,
412,
27,
800,
3726,
3726,
31,
485,
13520,
13,
5,
18717,
993,
3125,
6,
27,
51,
170,
1940,
15,
19,
56,
31,
107,
28,
306,
9,
2328,
522,
9,
185,
31,
275,
595,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 build interface for such enum
===
I have the following enum:
public enum Status implements StringEnum{
ONLINE("on"),OFFLINE("off");
private String status = null;
private Status(String status) {
this.status = status;
}
public String toString() {
return this.status;
}
public static Status find(String value) {
for(Status status : Status.values()) {
if(status.toString().equals(value)) {
return status;
}
}
throw new IllegalArgumentException("Unknown value: " + value );
}
}
Is it possible to build StringEnum interface to make sure every enum has find(), toString() and a constructor?
Thanks. | 0 | [
2,
184,
20,
1895,
6573,
26,
145,
1957,
723,
800,
3726,
3726,
31,
57,
14,
249,
1957,
723,
45,
317,
1957,
723,
1782,
8713,
18,
3724,
219,
723,
1,
2087,
5,
7,
218,
7,
6,
15,
1299,
1143,
5,
7,
1299,
7,
6,
73,
932,
3724,
1782,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 WPF Datagrid controls are worth the money and/or effort?
===
Looking for a good WPF Datagrid. I'm currently doing a "survey" of my available options. However, that survey is not going great.
So infragistics has a free one, MS released one with the WPFToolkit, XCeed has a WPF Datagrid.
Each seems to have it's pros and cons, but without super hard specs, it's hard to nail down what I actually need in a grid. Knowing that, what I'm looking for is
1. The WPF/XAML Way. The incredible support for MVVM and great databinding has changed how I do apps quickly. The great support with "lookless" controls and styling lets me use the design/develop workflow. I need a grid that doesn't short-circut this in the name of API design.
1. API Design - should be clear to the people maintaining this after me
1. Easy to deploy *and* develop. I'd prefer not to have to manually install lots of components to develop, and create an installer for our xcopy-able application.
Anyone have testimonials or horror stories? Things to look out for or hidden gotchas that find you a month later?
| 0 | [
2,
98,
619,
7721,
1054,
16375,
8671,
50,
2715,
14,
875,
17,
118,
248,
2150,
60,
800,
3726,
3726,
699,
26,
21,
254,
619,
7721,
1054,
16375,
9,
31,
22,
79,
871,
845,
21,
13,
7,
4082,
8704,
7,
16,
51,
904,
6368,
9,
207,
15,
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... |
Calculate diffs in PHP
===
Are there any libraries (3rd party or built-in) in PHP to calculate diffs? | 0 | [
2,
18469,
20811,
18,
19,
13,
26120,
800,
3726,
3726,
50,
80,
186,
8649,
13,
5,
240,
897,
346,
54,
392,
8,
108,
6,
19,
13,
26120,
20,
18469,
20811,
18,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
List all words in a dictionary that start with <user input>
===
How would a go about making a program where the user enters a string, and the program generates a list of words beginning with that string?
Ex:<br />
User: "abd"<br />
Program:abdicate, abdomen, abduct...
Thanks!
----------
Edit: I'm using python, but I assume that this is a fairly language-independent problem.
| 0 | [
2,
968,
65,
715,
19,
21,
9186,
30,
799,
29,
13,
1,
16704,
6367,
1,
800,
3726,
3726,
184,
83,
21,
162,
88,
544,
21,
625,
113,
14,
4155,
8104,
21,
3724,
15,
17,
14,
625,
7920,
18,
21,
968,
16,
715,
997,
29,
30,
3724,
60,
139... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL Server Priority Ordering
===
I have a table that contains tasks and I want to give these an explicit ordering based on the priority of the task. The only way I can think to do this is via an unique int column that indexes where the task is in term of the priority (i.e. 1 is top 1000 is low).
The problem is that say I wanted to update task and set its priority to a lower value , I would have to update all the other rows between its current value and its new value.
**Can anyone suggest a better way of implementing this?** | 0 | [
2,
4444,
255,
8128,
9857,
15775,
800,
3726,
3726,
31,
57,
21,
859,
30,
1588,
8674,
17,
31,
259,
20,
590,
158,
40,
14990,
15775,
432,
27,
14,
9857,
16,
14,
3005,
9,
14,
104,
161,
31,
92,
277,
20,
107,
48,
25,
1197,
40,
2619,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I use genshi.builder to programmatically build an HTML document?
===
I recently discovered the genshi.builder module. It reminds me of Divmod Nevow's Stan module. How would one use genshi.builder.tag to build an HTML document with a particular doctype? Or is this even a good thing to do? If not, what is the _right_ way? | 0 | [
2,
184,
107,
31,
275,
4380,
3528,
9,
20904,
20,
625,
6732,
1326,
1895,
40,
13,
15895,
4492,
60,
800,
3726,
3726,
31,
1989,
1848,
14,
4380,
3528,
9,
20904,
12613,
9,
32,
18572,
55,
16,
13,
12916,
13670,
13,
14644,
3581,
22,
18,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Select Element in a Namespace with XPath
===
I want to select the topmost element in a document that has a given namespace (prefix).
More specifically: I have XML documents that either start with /html/body (in the XHTML namespace) or with one of several elements in a particular namespace. I effectively want to stip out /html/body and just return the body contents OR the entire root namespaced element.
| 0 | [
2,
5407,
4520,
19,
21,
204,
5582,
29,
993,
8353,
800,
3726,
3726,
31,
259,
20,
5407,
14,
371,
4630,
4520,
19,
21,
4492,
30,
63,
21,
504,
204,
5582,
13,
5,
3515,
18594,
6,
9,
91,
3524,
45,
31,
57,
23504,
4374,
30,
694,
799,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is 'JNI Global reference'
===
I am using jProfiler to find memory leaks in a Java swing application. I have identified instances of a JFrame which keeps growing in count.
This frame is opened, and then closed.
Using jProfiler, and viewing the Paths to GC Root there is only one reference, 'JNI Global reference'.
What does this mean? Why is it hanging on to each instance of the frame? | 0 | [
2,
98,
25,
13,
22,
728,
889,
2062,
2801,
22,
800,
3726,
3726,
31,
589,
568,
487,
14503,
139,
20,
477,
1912,
11724,
18,
19,
21,
8247,
5587,
3010,
9,
31,
57,
2889,
13946,
16,
21,
487,
8361,
56,
8968,
1991,
19,
2468,
9,
48,
3523,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are C++ non-type parameters to (function) templates ordered?
===
I am hosting [SpiderMonkey][1] in a current project and would like to have template functions generate some of the simple property get/set methods, eg:
template <typename TClassImpl, int32 TClassImpl::*mem>
JSBool JS_DLL_CALLBACK WriteProp(JSContext* cx, JSObject* obj, jsval id, jsval* vp)
{
if (TClassImpl* pImpl = (TClassImpl*)::JS_GetInstancePrivate(cx, obj, &TClassImpl::s_JsClass, NULL))
return ::JS_ValueToInt32(cx, *vp, &(pImpl->*mem));
return JS_FALSE;
}
Used:
::JSPropertySpec Vec2::s_JsProps[] = {
{"x", 1, JSPROP_PERMANENT, &JsWrap::ReadProp<Vec2, &Vec2::x>, &JsWrap::WriteProp<Vec2, &Vec2::x>},
{"y", 2, JSPROP_PERMANENT, &JsWrap::ReadProp<Vec2, &Vec2::y>, &JsWrap::WriteProp<Vec2, &Vec2::y>},
{0}
};
This works fine, however, if I add another member type:
template <typename TClassImpl, JSObject* TClassImpl::*mem>
JSBool JS_DLL_CALLBACK WriteProp(JSContext* cx, JSObject* obj, jsval id, jsval* vp)
{
if (TClassImpl* pImpl = (TClassImpl*)::JS_GetInstancePrivate(cx, obj, &TClassImpl::s_JsClass, NULL))
return ::JS_ValueToObject(cx, *vp, &(pImpl->*mem));
return JS_FALSE;
}
Then Visual C++ 9 attempts to use the JSObject* wrapper for int32 members!
1>d:\projects\testing\jswnd\src\main.cpp(93) : error C2440: 'specialization' : cannot convert from 'int32 JsGlobal::Vec2::* ' to 'JSObject *JsGlobal::Vec2::* const '
1> Types pointed to are unrelated; conversion requires reinterpret_cast, C-style cast or function-style cast
1>d:\projects\testing\jswnd\src\main.cpp(93) : error C2973: 'JsWrap::ReadProp' : invalid template argument 'int32 JsGlobal::Vec2::* '
1> d:\projects\testing\jswnd\src\wrap_js.h(64) : see declaration of 'JsWrap::ReadProp'
1>d:\projects\testing\jswnd\src\main.cpp(93) : error C2440: 'initializing' : cannot convert from 'overloaded-function' to 'JSPropertyOp'
1> None of the functions with this name in scope match the target type
[1]: http://developer.mozilla.org/En/SpiderMonkey/JSAPI_Reference
| 0 | [
2,
50,
272,
20512,
538,
8,
4474,
12905,
20,
13,
5,
22359,
6,
22894,
18,
1905,
60,
800,
3726,
3726,
31,
589,
10637,
636,
18,
11031,
106,
2111,
4237,
500,
2558,
165,
500,
19,
21,
866,
669,
17,
83,
101,
20,
57,
22894,
3719,
7920,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
git instaweb gives 403 Forbidden - No projects found
===
running `git instaweb ` in my repository opens a page that says "403 Forbidden - No projects found". What am I missing? | 0 | [
2,
13,
10404,
19,
6106,
14113,
2352,
13,
25821,
11369,
13,
8,
90,
2314,
216,
800,
3726,
3726,
946,
13,
1,
10404,
19,
6106,
14113,
13,
1,
19,
51,
24869,
8965,
21,
2478,
30,
898,
13,
7,
25821,
11369,
13,
8,
90,
2314,
216,
7,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
== vs. Object.Equals(object)
===
So, when I was a comparitive novice to the novice I am right now, I used to think that these two things were syntactic sugar for each other, ie. that using one over the other was simply a personal preference. Over time, I'm come to find that these two are not the same thing, even in a default implementation (see [this](http://blogs.msdn.com/jmstall/archive/2005/03/06/386064.aspx) and [this](http://blogs.msdn.com/jmstall/archive/2005/03/12/394645.aspx)). To further confuse the matter, each can be overriden/overloaded seperately to have completely different meanings.
Is this a good thing, what are the differences, and when/why should you use one over the other? | 0 | [
2,
800,
3726,
4611,
9,
3095,
9,
62,
14512,
18,
5,
23793,
6,
800,
3726,
3726,
86,
15,
76,
31,
23,
21,
6479,
2905,
6142,
21999,
20,
14,
21999,
31,
589,
193,
130,
15,
31,
147,
20,
277,
30,
158,
81,
564,
46,
6063,
6981,
1786,
42... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I dynamically create a selector at runtime with Objective-C?
===
I know how to create a `SEL` at compile time using `@selector(MyMethodName:)` but what I want to do is create a selector dynamically from an `NSString`. Is this even possible?
What I can do:
SEL selector = @selector(doWork:);
[myobj respondsToSelector:selector];
What I want to do: (pseudo code, this obviously doesn't work)
SEL selector = selectorFromString(@"doWork");
[myobj respondsToSelector:selector];
I've been searching the Apple API docs, but haven't found a way that doesn't rely on the compile-time `@selector(myTarget:)` syntax. | 0 | [
2,
184,
92,
31,
7782,
1326,
1600,
21,
23946,
35,
485,
891,
29,
7038,
8,
150,
60,
800,
3726,
3726,
31,
143,
184,
20,
1600,
21,
13,
1,
3434,
1,
35,
26561,
85,
568,
13,
1,
3434,
19932,
5,
915,
5909,
1807,
43,
7259,
45,
6,
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... |
Recommend open source accounting / erp?
===
Can anyone recommend an open source accounting/erp solution? Ideally I'm looking for something web-based that can handle both standard and non-profit accounting. But there's not a lot out there, so I'd like to hear about anything that people use and like. | 4 | [
2,
12360,
368,
1267,
10090,
13,
118,
13,
106,
306,
60,
800,
3726,
3726,
92,
1276,
12360,
40,
368,
1267,
10090,
118,
106,
306,
4295,
60,
5628,
102,
31,
22,
79,
699,
26,
301,
2741,
8,
1281,
30,
92,
3053,
156,
1236,
17,
538,
8,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do you leverage Semantic Web technologies? Why or why not?
===
_Disclaimer: I focus on semantic computing incubation's at Microsoft._
I'm interested in understanding why people choose to leverage technology built on the W3C Semantic Web standards. How did you make the decision to use the technology you chose and what does it enable you to do that you identify as being unique to the Semantic Web effort?
If you have specifically made the decision not to use Semantic Web technologies what are your reasons for that decision? What would have to change to cause you to revisit your decision?
Note: I know there are many different types of semantic computing technologies besides those specified by the W3C but please keep answers to this subjective question focused on the W3C technologies (RDF, OWL, SPARQL). | 4 | [
2,
107,
42,
19414,
17220,
2741,
5740,
60,
483,
54,
483,
52,
60,
800,
3726,
3726,
13,
1,
2906,
22661,
106,
45,
31,
1776,
27,
17220,
10626,
19,
21684,
857,
22,
18,
35,
7099,
9,
1,
31,
22,
79,
3158,
19,
3260,
483,
148,
3538,
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... |
Comparison of embedded operating systems?
===
I've been involved in embedded operating systems of one flavor or another, and have generally had to work with whatever the legacy system had. Now I have the chance to start from scratch on a new embedded project.
The primary constraints on the system are:
+ It needs a web-based interface.
+ Inputs are required to be processed in real-time (so a true RTOS is needed).
+ The memory available is 32MB of RAM and FLASH.
The operating systems that the team has used previously are VxWorks, ThreadX, uCos, pSOS, and Windows CE.
Does anyone have a comparison or trade study regarding operating system choice?
Are there any other operating systems that we should consider? (We've had eCos and RT-Linux suggested). | 0 | [
2,
6050,
16,
12138,
2455,
1242,
60,
800,
3726,
3726,
31,
22,
195,
74,
1013,
19,
12138,
2455,
1242,
16,
53,
11974,
54,
226,
15,
17,
57,
1469,
41,
20,
170,
29,
2099,
14,
7780,
329,
41,
9,
130,
31,
57,
14,
1504,
20,
799,
37,
12... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Connect to SQL Server from cygwin window times out, from DOS prompt works
===
The title says it all. I can connect to my SQL Server database via sqlcmd from a DOS command window, but not from a Cygwin window. From DOS:
> F:\Cygnus>sqlcmd -Q "select 'a test'" -S .\SQLEXPRESS
------
a test
(1 rows affected)
> F:\Cygnus>
====================================================
From Cygwin:
> $ sqlcmd -Q "select 'a test'" -S .\SQLEXPRESS
HResult 0x35, Level 16, State 1<br>
Named Pipes Provider: Could not open a connection to SQL Server [53].
Sqlcmd: Error: Microsoft SQL Native Client : An error has occurred while establishing a connection to the server. When connecting to SQL Server 2005, this failure may be caused by the fact that under the default settings SQL Server does not allow remote connections..
Sqlcmd: Error: Microsoft SQL Native Client : Login timeout expired.
| 0 | [
2,
6379,
20,
4444,
255,
8128,
37,
6728,
263,
4181,
1463,
436,
70,
15,
37,
107,
18,
11443,
4417,
693,
800,
3726,
3726,
14,
581,
898,
32,
65,
9,
31,
92,
6379,
20,
51,
4444,
255,
8128,
6018,
1197,
4444,
6109,
79,
43,
37,
21,
107,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Restore a SQL Server database from single instance to cluster
===
I need to transfer a database from a SQL Server instance test server to a production environment that is clustered. But SQL Server doesn't allow you to use backup/restore to do it from single instance to cluster. I'm talking about a Microsoft CRM complex database here.
Your help is greatly appreciated. | 0 | [
2,
8454,
21,
4444,
255,
8128,
6018,
37,
345,
4851,
20,
7460,
800,
3726,
3726,
31,
376,
20,
2617,
21,
6018,
37,
21,
4444,
255,
8128,
4851,
1289,
8128,
20,
21,
637,
2307,
30,
25,
7460,
69,
9,
47,
4444,
255,
8128,
1437,
22,
38,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What tools do you use to security test your web applications?
===
Are there any tools you recommend for security testing your web applications?
I have used WebScarab from OWASP, but find it a bit difficult and unwieldy to use.
Is there anything else you would suggest using?
| 0 | [
2,
98,
4672,
107,
42,
275,
20,
1221,
1289,
154,
2741,
3767,
60,
800,
3726,
3726,
50,
80,
186,
4672,
42,
12360,
26,
1221,
4431,
154,
2741,
3767,
60,
31,
57,
147,
2741,
3862,
16951,
37,
13,
15289,
3401,
15,
47,
477,
32,
21,
1142,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Friendly url scheme?
===
One of the many things that's been lacking from my [scraper service][1] that I set up last week are pretty URLs. Right now the user parameter is being passed into the script with *?u=*, which is a symptom of a lazy hack (which the script admittedly is). However, I've been thinking about redoing it and I'd like to get some feedback on the options available. Right now there are two pages, update and chart, that provide information to the user. Here are the two possibilities that I came up with. "1234" is the user ID number. For technical reasons the user name unfortunately cannot be used:
- http://< tld >/update/1234
- http://< tld >/chart/1234
or
- http://< tld >/1234/update
- http://< tld >/1234/chart
Option #1, conceptually, is calling update with the user ID. Option #2 is providing a verb to operate on a user ID.
From a consistency standpoint, which makes more sense?
[1]: http://stackoverflow.com/questions/61553/track-your-reputation | 0 | [
2,
4753,
287,
6362,
4276,
60,
800,
3726,
3726,
53,
16,
14,
151,
564,
30,
22,
18,
74,
11690,
37,
51,
636,
18,
7519,
1432,
365,
500,
2558,
165,
500,
30,
31,
309,
71,
236,
877,
50,
1772,
13,
911,
7532,
9,
193,
130,
14,
4155,
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... |
py2exe - generate single executable file
===
I thought I heard that [py2exe][1] was able to do this, but I never figured it out. Has anyone successfully done this? Can I see your setup.py file, and what command line options you used?
Basically I'm thinking of it giving me a single executable file that does something like unzips itself to maybe /temp and runs.
[1]: http://www.py2exe.org/ | 0 | [
2,
7103,
135,
1706,
62,
13,
8,
7920,
345,
1396,
17194,
5924,
3893,
800,
3726,
3726,
31,
289,
31,
752,
30,
636,
6448,
135,
1706,
62,
500,
2558,
165,
500,
23,
777,
20,
107,
48,
15,
47,
31,
243,
5700,
32,
70,
9,
63,
1276,
3673,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 advantages of using Objective-C over C++
===
I have heard mention of Objective-C but I have never used it myself. I was curious what everyones opinion of it was in general and also in relation to C++. Are there any types of projects where it would be more useful or less useful? | 0 | [
2,
98,
50,
14,
14683,
16,
568,
7038,
8,
150,
84,
272,
20512,
800,
3726,
3726,
31,
57,
752,
3794,
16,
7038,
8,
150,
47,
31,
57,
243,
147,
32,
992,
9,
31,
23,
7686,
98,
1266,
18,
4052,
16,
32,
23,
19,
297,
17,
67,
19,
5827,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 enable multimode emacs to program PHP without messing up my indents?
===
Using whenever I indent HTML in PHP mode, emacs pops up a frame and tells me to get MUMODE or somesuch extra add-on. I installed PHP Mode without a big hassle, but I don't know how to get this multi-mode rolling.
<hr>
I'd like to know 2 things
<ol>
<li>How to install and configure multi-mode</li>
<li>How to disable pop-ups in Emacs</li>
</ol> | 0 | [
2,
184,
107,
31,
9240,
1889,
15570,
13,
62,
6893,
18,
20,
625,
13,
26120,
366,
3957,
68,
71,
51,
19,
817,
38,
18,
60,
800,
3726,
3726,
568,
6634,
31,
19,
817,
38,
13,
15895,
19,
13,
26120,
3740,
15,
13,
62,
6893,
18,
1675,
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... |
Combining Scriptaculous and JQuery in a Rails application
===
I've got the following situation
* A rails application that makes use of rjs / Scriptaculous to offer AJAX functionality
* Lot of nice javascript written using JQuery (for a separate application)
I want to combine the two and use my JQuery based functionality in my Rails application, but I'm worried about JQuery and Scriptaculous clashing (they both define the $() function, etc).
What is my easiest option to bring the two together? Thanks! | 0 | [
2,
12803,
3884,
1738,
22717,
17,
487,
8190,
93,
19,
21,
2240,
18,
3010,
800,
3726,
3726,
31,
22,
195,
330,
14,
249,
1858,
1637,
21,
2240,
18,
3010,
30,
1364,
275,
16,
13,
23008,
18,
13,
118,
3884,
1738,
22717,
20,
1994,
20624,
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... |
How to avoid the dangers of optimisation when coding the unknown?
===
A two parter:
1) Say you're designing a new type of application and you're in the process of coming up with new algorithms to express the concepts and content -- does it make sense to attempt to **actively** not consider optimisation techniques at that stage, even if in the back of your mind you fear it might end up as O(N!) over millions of elements?
2) If so, say to avoid limiting cool functionality which you **might** be able to optimise once the proof-of-concept is running -- how do you stop yourself from this programmers habit of a lifetime? I've been trying mental exercises, paper notes, but I grew up essentially counting clock cycles in assembler and I continually find myself vetoing potential solutions for being too wasteful before fully considering the functional value. | 0 | [
2,
184,
20,
2658,
14,
3589,
18,
16,
19259,
4330,
76,
13,
15458,
14,
2562,
60,
800,
3726,
3726,
21,
81,
141,
106,
45,
137,
6,
395,
42,
22,
99,
15026,
21,
78,
1001,
16,
3010,
17,
42,
22,
99,
19,
14,
953,
16,
880,
71,
29,
78,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CakePHP n to n relation on a third table
===
I have a `n...n` structure for two tables, **`makes`** and **`models`**. So far no problem.
In a third table (**`products`**) like:
id
make_id
model_id
...
My problem is creating a view for products of one specifi **`make`** inside my `ProductsController` containing just that's make models:
I thought this could work:
var $uses = array('Make', 'Model');
$this->Make->id = 5; // My Make
$this->Make->find(); // Returns only the make I want with it's Models (HABTM)
$this->Model->find('list'); // Returns ALL models
$this->Make->Model->find('list'); // Returns ALL models
So, If I want to use the `list` to pass to my view to create radio buttons I will have to do a `foreach()` in my **`make`** array to find all models titles and create a new array and send to the view via `$this->set()`.
$makeArray = $this->Make->find();
foreach ($makeArray['Model'] as $model) {
$modelList[] = $model['title'];
}
$this->set('models', $models)
Is there any easier way to get that list without stressing the **`make`** Array. It will be a commom task to develops such scenarios in my application(s).
Thanks in advance for any hint!
| 0 | [
2,
8390,
26120,
13,
103,
20,
13,
103,
5827,
27,
21,
422,
859,
800,
3726,
3726,
31,
57,
21,
13,
1,
103,
9,
9,
9,
103,
1,
1411,
26,
81,
7484,
15,
13,
1409,
1,
11115,
18,
1,
1409,
17,
13,
1409,
1,
13998,
18,
1,
1409,
9,
86,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does boost bind work behind the scenes in general?
===
Without spending a long time reviewing the boost source code, could someone give me a quick rundown of how boost bind is implemented? | 0 | [
2,
184,
630,
10419,
10193,
170,
439,
14,
3918,
19,
297,
60,
800,
3726,
3726,
366,
4837,
21,
175,
85,
18046,
14,
10419,
1267,
1797,
15,
110,
737,
590,
55,
21,
2231,
485,
2968,
16,
184,
10419,
10193,
25,
6807,
60,
3,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Shortest Root to Leaf Path
===
What is the easiest way, preferably using recursion, to find the shortest root-to-leaf path in a BST (Binary Search Tree). Java prefered, pseudocode okay.
Thanks! | 0 | [
2,
23576,
5900,
20,
5164,
2013,
800,
3726,
3726,
98,
25,
14,
27237,
161,
15,
6369,
4801,
568,
26604,
5991,
15,
20,
477,
14,
23576,
5900,
8,
262,
8,
15522,
2013,
19,
21,
334,
384,
13,
5,
4772,
1857,
2122,
1541,
6,
9,
8247,
6369,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to map geo location based on one or all of these services.
===
I'm looking for a solution to map one or all of the following Flickr, twitter, vimeo, by exif, keywords or whatever to google maps. I'm trying to show a map of my location from updating social sites. | 0 | [
2,
184,
20,
2942,
6389,
1474,
432,
27,
53,
54,
65,
16,
158,
687,
9,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
4295,
20,
2942,
53,
54,
65,
16,
14,
249,
12407,
139,
15,
10623,
15,
1790,
790,
111,
15,
34,
1396,
821,
15,
1246,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 services have you used for design work for your web site programming?
===
As a programmer, I don't have the best design skills. I often find the need to have a single graphic or even an entire web site designed. What sites have you used to get the graphics you needed and would you use them again? | 0 | [
2,
98,
687,
57,
42,
147,
26,
704,
170,
26,
154,
2741,
689,
3143,
60,
800,
3726,
3726,
28,
21,
17968,
15,
31,
221,
22,
38,
57,
14,
246,
704,
3207,
9,
31,
478,
477,
14,
376,
20,
57,
21,
345,
8479,
54,
166,
40,
1078,
2741,
68... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Possible to use multiple/nested MySQLi statements?
===
Is it possible to have a MySQLi prepared statement within the fetch() call of a previous statement? If not, what's the best way around it?
Example code:
if($stmt = $link->prepare("SELECT item FROM data WHERE id = ?")) {
$stmt->bind_param("i", $id);
$stmt->execute();
$stmt->bind_result($item);
while( $stmt->fetch() ) {
/* Other code here */
$itemSummary = $item + $magic;
if($stmt2 = $link->prepare("INSERT INTO summaries (itemID, summary) VALUES (?, ?)")) {
$stmt2->bind_param("is", $itemID, $itemSummary);
$stmt2->execute();
$stmt2->close();
}
}
} | 0 | [
2,
938,
20,
275,
1886,
118,
2696,
1427,
51,
18,
1251,
1210,
9015,
60,
800,
3726,
3726,
25,
32,
938,
20,
57,
21,
51,
18,
1251,
1210,
3268,
3331,
363,
14,
18312,
5,
6,
645,
16,
21,
1158,
3331,
60,
100,
52,
15,
98,
22,
18,
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... |
Getting developers fired up about development
===
I've recently started in a new team of classic ASP developers and part of my role is to re-train the team in ASP.NET 3.5 and C#.
To kick things off I've been running weekly training sessions on the fundamentals (as well as some sexier sessions on Linq & Ajax) and these have proven quite popular. However, despite a little dabbling, there seems to be a lot of resistence to getting stuck into the newer technlogies.
I'd like to know what other people do to fire up others around issues such as quality, technology and design.
| 2 | [
2,
1017,
10168,
3899,
71,
88,
522,
800,
3726,
3726,
31,
22,
195,
1989,
373,
19,
21,
78,
173,
16,
2732,
28,
306,
10168,
17,
141,
16,
51,
597,
25,
20,
302,
8,
11809,
14,
173,
19,
28,
306,
9,
2328,
203,
9,
264,
17,
272,
5910,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Conflicting desires in Database Design, with fields of two similar functions
===
Okay, so I'm making a table right now for "Box Items".
Now, a Box Item, depending on what it's being used for/the status of the item, may end up being related to a "Shipping" box or a "Returns" box.
A Box Item may be defective:if it is, a flag will be set in the Box Item's row (IsDefective), and the Box Item will be put in a "Returns" box (with other items to be returned to that vendor). Otherwise, the Box Item will eventually be put into a "Shipping" box (with other items to be shipped). (Note that Shipping and Returns boxes have their own tables: there's not one common table for all boxes... though maybe I should consider doing that if possible as a third possibility?)
Maybe I'm just not thinking clearly today, but I started questioning what should be done in this situation.
My gut tells me that I should have a separate field for each possible relation, even if only one of the relations can happen at any given time, which would make the schema for Box Items look like:
BoxItemID
Description
IsDefective
ShippingBoxID
ReturnBoxID
etc...
This would make the relations clear, but it seems wasteful (since only one of the relations will be used at any time). So then I thought I could have just one field for the BoxID, and determine which BoxID it's referring to (a Shipping or a Returns Box ID) based on the IsDefective field:
BoxItemID
Description
IsDefective
BoxID
etc...
This seems less wasteful, but doesn't sit right with me. The relation isn't obvious.
So, I put it to you, database gurus of Stackoverflow. What would you do in this situation? | 0 | [
2,
22297,
18374,
19,
6018,
704,
15,
29,
2861,
16,
81,
835,
3719,
800,
3726,
3726,
1705,
15,
86,
31,
22,
79,
544,
21,
859,
193,
130,
26,
13,
7,
5309,
3755,
7,
9,
130,
15,
21,
1649,
9101,
15,
4758,
27,
98,
32,
22,
18,
142,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What MySQL client application would you recommend for Mac OS X?
===
My colleagues and I are looking for alternative client tools for Mac OS X.
I tend to prefer the text-based interface and we have [PHPMyAdmin][1] installed on our development servers (Linux).
What are your recommendations?
(One recommendation per answer please, so people can up-mod individual recommendations).
[1]: http://www.phpmyadmin.net/ | 0 | [
2,
98,
51,
18,
22402,
6819,
3010,
83,
42,
12360,
26,
1572,
13,
759,
993,
60,
800,
3726,
3726,
51,
8493,
17,
31,
50,
699,
26,
2676,
6819,
4672,
26,
1572,
13,
759,
993,
9,
31,
5480,
20,
6369,
14,
1854,
8,
1281,
6573,
17,
95,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PHP performance considerations?
===
I'm building a PHP site, but for now the only PHP I'm using is a half-dozen or so includes on certain pages. (I will probably use some database queries eventually.)
Are simple include() statements a concern for speed or scaling, as opposed to static HTML? What kinds of things tend to cause a site to bog down? | 0 | [
2,
13,
26120,
956,
20478,
60,
800,
3726,
3726,
31,
22,
79,
353,
21,
13,
26120,
689,
15,
47,
26,
130,
14,
104,
13,
26120,
31,
22,
79,
568,
25,
21,
519,
8,
537,
4257,
54,
86,
1103,
27,
1200,
4434,
9,
13,
5,
49,
129,
910,
275... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 view contents of NSDictionary variable in Xcode debugger?
===
Is there a way to view the key/value pairs of a NSDictionary variable through the Xcode debugger? Here's the extent of information when it is fully expanded in the variable window:
Variable Value Summary
jsonDict 0x45c540 4 key/value pairs
NSObject {...}
isa 0xa06e0720
I was expecting it to show me each element of the dictionary (similar to an array variable). | 0 | [
2,
184,
20,
1418,
8478,
16,
13,
2172,
22595,
1857,
7612,
19,
993,
9375,
121,
2345,
11356,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
1418,
14,
1246,
118,
15165,
7473,
16,
21,
13,
2172,
22595,
1857,
7612,
120,
14,
993,
9375,
121,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MD5 routines that are GLib friendly?
===
Does anyone know of an MD5/SHA1/etc routine that is easily used with GLib (i.e. you can give it a GIOChannel, etc)? | 0 | [
2,
8138,
264,
8275,
18,
30,
50,
489,
8326,
4753,
60,
800,
3726,
3726,
630,
1276,
143,
16,
40,
8138,
10551,
3162,
8197,
1198,
150,
8275,
30,
25,
2351,
147,
29,
489,
8326,
13,
5,
49,
9,
62,
9,
42,
92,
590,
32,
21,
13,
5449,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.