unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
autoconf using sh, I need SHELL=BASH, how do I force autoconf to use bash?
===
I'm running autoconf and configure sets SHELL to '/bin/sh'.
This creates huge problems. How to force SHELL to be '/bin/bash' for autoconf? | 0 | [
2,
3108,
14093,
568,
5527,
15,
31,
376,
3593,
3726,
969,
1635,
15,
184,
107,
31,
558,
3108,
14093,
20,
275,
13158,
60,
800,
3726,
3726,
31,
22,
79,
946,
3108,
14093,
17,
1065,
15951,
3415,
3593,
20,
13,
22,
118,
4772,
118,
1635,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 upgrade to Windows Server & Exchange 2007?
===
Currently running Server 2003 but am looking at reinstalling in the near future due to a change of direction with the domains. Should I take this opportunity to install Windows Server 2007 instead?
I would love to play with new technology and the server is only for a small home business so downtime/performance issues aren't really a concern. | 0 | [
2,
378,
31,
9483,
20,
1936,
8128,
279,
1950,
624,
60,
800,
3726,
3726,
871,
946,
8128,
973,
47,
589,
699,
35,
7102,
21300,
68,
19,
14,
424,
1022,
397,
20,
21,
753,
16,
1400,
29,
14,
15544,
9,
378,
31,
247,
48,
2893,
20,
16146,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 would be the best way to parse this file?
===
I was just wondering if anyone knew of a good way that I could parse the file at the bottom of the post.
I have a database setup with the correct tables for each section eg Refferal Table,Caller Table,Location Table. Each table has the same columns that are show in the file below
I would really like something that is fairly genetic so if the file layout changes it won't mess me around to much. At the moment I am just reading the file in a line at a time and just using a case statement to check which section i'm in.
Is anyone able to help me with this?
PS. I am using VB but C# or anything else will be fine, also the x's in the document are just personal info I have blanked
Thanks,
Nathan
File:--->
DIAL BEFORE YOU DIG
Call 1100, Fax 1300 652 077
PO Box 7710 MELBOURNE, VIC 8004
Utilities are requested to respond within 2 working days and reference the Sequence number.
[REFFERAL DETAILS]
FROM= Dial Before You Dig - Web
TO= Technical Services
UTILITY ID= xxxxxx
COMPANY= {Company Name}
ENQUIRY DATE= 02/10/2008 13:53
COMMENCEMENT DATE= 06/10/2008
SEQUENCE NO= xxxxxxxxx
PLANNING= No
[CALLER DETAILS]
CUSTOMER ID= 403552
CONTACT NAME= {Name of Contact}
CONTACT HOURS= 0
COMPANY= Underground Utility Locating
ADDRESS= {Address}
SUBURB= {Suburb}
STATE= {State}
POSTCODE= 4350
TELEPHONE= xxxxxxxxxx
MOBILE= xxxxxxxxxx
FAX TYPE= Private
FAX NUMBER= xxxxxxxxxx
PUBLIC ADDRESS= xxxxxxxxxx
PUBLIC TELEPHONE=
EMAIL ADDRESS= {Email Address}
[LOCATION DETAILS]
ADDRESS= {Location Address}
SUBURB= {Location Suburb}
STATE= xxx
POSTCODE= xxx
DEPOSITED PLAN NO= 0
SECTION & HUNDRED NO= 0
PROPERTY PHONE NO=
SIDE OF STREET= B
INTERSECTION= xxxxxx
DISTANCE= 0-200m B
ACTIVITY CODE= 15
ACTIVITY DESCRIPTION= xxxxxxxxxxxxxxxxxx
MAP TYPE= StateGrid
MAP REF= Q851_63
MAP PAGE=
MAP GRID 1=
MAP GRID 2=
MAP GRID 3=
MAP GRID 4=
MAP GRID 5=
GPS X COORD=
GPS Y COORD=
PRIVATE/ROAD/BOTH= B
TRAFFIC AFFECTED= No
NOTIFICATION NO= 3082321
MESSAGE= entire intersection of Allora-Clifton rd , Hillside
rd and merivale st
MOCSMESSAGE= Digsafe generated referral
Notice: Please DO NOT REPLY TO THIS EMAIL as it has been automatically generated and replies are not monitored. Should you wish to advise Dial Before You Dig of any issues with this enquiry, please Call 1100
(See attached file: 3082321_LLGDA94.GML)
| 0 | [
2,
98,
83,
44,
14,
246,
161,
20,
2017,
870,
48,
3893,
60,
800,
3726,
3726,
31,
23,
114,
5712,
100,
1276,
404,
16,
21,
254,
161,
30,
31,
110,
2017,
870,
14,
3893,
35,
14,
2129,
16,
14,
678,
9,
31,
57,
21,
6018,
18161,
29,
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... |
Prevent Enter key from firing button click even in vb6
===
I have a form with a progress bar and a cancel button which is displayed as a process runs. The buttons "Cancel" property is set to true so pressing escape, cancels the process.
But, as the button is the only control on the form capable of taking the focus, should the user inadvertently press enter (or space bar) while the process is running it will be cancelled.
I have prevented the Space Bar from working by setting KeyPreview to true (on the form) then setting KeyAscii to 0 but this approach deson't seem to work for the enter key as the button click event fires first.
I've tried setting the button's TabStop property to "false" - no change. | 0 | [
2,
2501,
2830,
1246,
37,
7139,
5167,
10840,
166,
19,
13,
20468,
379,
800,
3726,
3726,
31,
57,
21,
505,
29,
21,
3455,
748,
17,
21,
14815,
5167,
56,
25,
6115,
28,
21,
953,
1461,
9,
14,
12861,
13,
7,
1245,
11040,
7,
1354,
25,
309... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 integrate a SpringSource dm Server into another OSGi-based application server?
===
I would really like to use SpringSource dm Server, but our customer requires us to run our apps on their application server (Websphere). Is there a way to integrate SpringSource dm Server with other application servers? At least dm Server is build on OSGi, and many other application servers (including Websphere) are based on OSGi as well. Is it possible to run a SpringSource dm Server as a websphere component? | 0 | [
2,
184,
20,
18399,
21,
1573,
12097,
15728,
8128,
77,
226,
13,
759,
2234,
8,
1281,
3010,
8128,
60,
800,
3726,
3726,
31,
83,
510,
101,
20,
275,
1573,
12097,
15728,
8128,
15,
47,
318,
7705,
4781,
182,
20,
485,
318,
4865,
18,
27,
66... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 this with a single SQL
===
I have a table that looks like that:
![alt text][1]
The rows are sorted by CLNDR_DATE DESC.
I need to find a CLNDR\_DATE that corresponds to the highlighted row, in other words:
Find the topmost group of rows WHERE EFFECTIVE\_DATE IS NOT NULL,
and return the CLNR_DATE of a last row of that group.
Normally I would open a cursor and cycle from top to bottom until I find a NULL in EFFECTIVE\_DATE. Then I would know that the date I am looking for is CLNDR_DATE, obtained at the previous step.
However, I wonder if the same can be achieved with a single SQL?
[1]: http://img142.imageshack.us/img142/2328/sqlpuzzle2yg2.jpg | 0 | [
2,
107,
48,
29,
21,
345,
4444,
255,
800,
3726,
3726,
31,
57,
21,
859,
30,
1879,
101,
30,
45,
13,
187,
2558,
192,
38,
1854,
500,
2558,
165,
500,
14,
11295,
50,
22554,
34,
10842,
706,
139,
1,
8209,
1746,
150,
9,
31,
376,
20,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Visiting the points in a triangle in a random order..
===
For a right triangle specified by an equation aX + bY <= c on integers
I want to plot each pixel(*) in the triangle once and only once, in a pseudo-random order, and without storing a list of previously hit points.
I know how to do this with a line segment between 0 and x
> pick a random point'o' along the line,
> pick 'p' that is relatively prime to x
> repeat for up to x times: O<sub>next</sub> = (O<sub>cur</sub> + P) MOD x
To do this for a triangle, I would
1. Need to count the number of pixels in the triangle sans lists
2. Map an integer 0..points into a x,y pair that is a valid pixel inside the triangle
I hope any solution could be generalized to pyramids and higher dimensional shapes.
(*) I use the CG term pixel for the pair of integer points X,Y such that the equation is satisfied.
| 0 | [
2,
4803,
14,
819,
19,
21,
8676,
19,
21,
5477,
389,
9,
9,
800,
3726,
3726,
26,
21,
193,
8676,
9931,
34,
40,
8020,
21,
396,
2754,
34,
13,
1,
3726,
272,
27,
13820,
18,
31,
259,
20,
3798,
206,
18146,
5,
2483,
6,
19,
14,
8676,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Distributed Cache/Session where should I turn?
===
I am currently looking at a distributed cache solution.
If money was not an issue, which would you recommend?
- [www.scaleoutsoftware.com][1]
- [ncache][2]
- [memcacheddotnet][3]
- [MS Velocity][4]
[1]: http://www.scaleoutsoftware.com/
[2]: http://www.alachisoft.com/ncache/
[3]: http://sourceforge.net/projects/memcacheddotnet/
[4]: http://www.microsoft.com/downloads/details.aspx?FamilyId=B24C3708-EEFF-4055-A867-19B5851E7CD2&displaylang=en | 0 | [
2,
4387,
16522,
118,
7202,
5991,
113,
378,
31,
805,
60,
800,
3726,
3726,
31,
589,
871,
699,
35,
21,
4387,
16522,
4295,
9,
100,
875,
23,
52,
40,
1513,
15,
56,
83,
42,
12360,
60,
13,
8,
636,
6483,
9,
5093,
1320,
12980,
5011,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why ActiveRecord instead of a MySql API
===
I've been developing web applications for a while and i am quite comfortable with mySql, in fact as many do i use some form of SQL almost every day. I like the syntax and a have zero problems writing queries or optimizing my tables. I have enjoyed this mysql [api][1].
The thing that has been bugging me is Ruby on Rails uses ActiveRecord and migrates everything so you use functions to query the database. I suppose the idea being you "never have to look at SQL again". Maybe this isn't KISS (keep it simple stupid) but is the ActiveRecord interface really best. Is development without having to ever write a SQL statement healthy? What if you ever have to look something up that isn't already defined as a rails function? I know they have a function that allows me to do a custom query. I guess really i want to know what people think the advantages are of using ActiveRecord over mySQL and if anyone feels like me that maybe this would be for the rails community what the calculator was to the math community and some people might forget how to do long division.
[1]: http://www.tmtm.org/en/mysql/ruby/ | 0 | [
2,
483,
1348,
14953,
700,
16,
21,
51,
18,
22402,
21,
2159,
800,
3726,
3726,
31,
22,
195,
74,
3561,
2741,
3767,
26,
21,
133,
17,
31,
589,
1450,
5733,
29,
51,
18,
22402,
15,
19,
837,
28,
151,
107,
31,
275,
109,
505,
16,
4444,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you keep track of temporary threads of conversation online
===
Often when I post a comment or answer on a site I like to keep an eye out for additional responses from other people, possibly replying again if appropriate. Sometimes I'll bookmark a page for a while, other times I'll end up re-googling keywords to locate the post again. I've always thought there should be something better than my memory for keeping track of pages I care about for a few days to a week.
Does anyone any clever ideas for this type of thing? Is there a micro-delicious type of online app with a bookmarklet for very short term followup?
| 0 | [
2,
184,
107,
42,
643,
792,
16,
4700,
20396,
16,
2735,
2087,
800,
3726,
3726,
478,
76,
31,
678,
21,
6484,
54,
1623,
27,
21,
689,
31,
101,
20,
643,
40,
1356,
70,
26,
1351,
13231,
37,
89,
148,
15,
2879,
6504,
68,
188,
100,
4593,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 configure the place of the Netbeans .netbeans directory?
===
I want Netbeans 6.1 to store the .netbeans directory in another place than the default. How do I do this? | 0 | [
2,
184,
107,
31,
1065,
15951,
14,
209,
16,
14,
4275,
863,
5950,
13,
9,
2328,
863,
5950,
16755,
60,
800,
3726,
3726,
31,
259,
4275,
863,
5950,
400,
9,
165,
20,
1718,
14,
13,
9,
2328,
863,
5950,
16755,
19,
226,
209,
119,
14,
128... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What's wrong with F#?
===
What's wrong with F#?
That is, what about the language would make it unsuitable for production environments (**excluding** the fact that it's not yet officially graduated from MS Research)? I'm interested in functional programming (especially on .NET) and I'd like to learn this language, but I worry about its applicability in the real world. | 0 | [
2,
98,
22,
18,
1389,
29,
398,
5910,
60,
800,
3726,
3726,
98,
22,
18,
1389,
29,
398,
5910,
60,
30,
25,
15,
98,
88,
14,
816,
83,
233,
32,
26749,
26,
637,
11246,
13,
5,
1409,
14938,
1409,
14,
837,
30,
32,
22,
18,
52,
768,
232... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 import users from Community Server into DNN?
===
A client is switching from Community Server to DNN. We would like to just import all the users including their passwords. It seems like this should work since both products use the .NET SqlMembershipProvider. What tables need to be populated to get a user set up correctly in DNN? | 0 | [
2,
184,
107,
42,
9010,
3878,
37,
514,
8128,
77,
13,
43,
9377,
60,
800,
3726,
3726,
21,
6819,
25,
13027,
37,
514,
8128,
20,
13,
43,
9377,
9,
95,
83,
101,
20,
114,
9010,
65,
14,
3878,
215,
66,
20884,
18,
9,
32,
2206,
101,
48,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I force a tomcat web application reload the trust store after I update it
===
I have the following problem.
My tomcat 5.5 based web application is using a trust store to verify SSL connections.
The application allows the user to add or remove CA certificates to be used in the verification process.
However, adding or removing certificates from the trust store doesn't change a thing. The application 'recognizes' only the certificates that were in the trust store when tomcat started. For it to recognize the new set of certificates, I need to restart tomcat.
This is not a valid solution, however.
What I do need is a code based solution.
Please advice. | 0 | [
2,
184,
107,
31,
558,
21,
2067,
5782,
2741,
3010,
27339,
14,
1527,
1718,
75,
31,
11100,
32,
800,
3726,
3726,
31,
57,
14,
249,
1448,
9,
51,
2067,
5782,
331,
9,
264,
432,
2741,
3010,
25,
568,
21,
1527,
1718,
20,
21012,
13,
18,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it safe to increase an iterator inside when using it as an argument?
===
Currently I'm trying to erase a sequence of iterators from a set, however GCC's standard library seems to be broken because std::set::erase(iterator) should return the an iterator (next iterator), however in GCC it returns void (which is standard?)
Anyways I want to write:
myIter = mySet.erase(myIter);
But GCC doesn't like it...
So Is it safe to write this instead?
mySet.erase(myIter++);
Thanks!
Edit: And yes I'm checking against mySet.end();
| 0 | [
2,
25,
32,
1834,
20,
1839,
40,
32,
106,
3457,
572,
76,
568,
32,
28,
40,
5476,
60,
800,
3726,
3726,
871,
31,
22,
79,
749,
20,
23593,
21,
4030,
16,
32,
106,
9922,
37,
21,
309,
15,
207,
489,
3384,
22,
18,
1236,
1248,
2206,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I determine the file and line # of a C# method from a symbols (.pdb) file?
===
pdb files contain symbol information for .NET assemblies. I'd like to read a pdb file in order to correlate methods with their file location. The data is contained within it but I can't seem to find a good description of how to get it out.
I know about [mdbg][1], but that is very heavy (I think/hope) for what I want.
[1]:http://blogs.msdn.com/jmstall/archive/2005/08/25/pdb2xml.aspx | 0 | [
2,
184,
107,
31,
3746,
14,
3893,
17,
293,
6926,
16,
21,
272,
5910,
2109,
37,
21,
9794,
13,
5,
9,
9251,
220,
6,
3893,
60,
800,
3726,
3726,
351,
9007,
6488,
3717,
4678,
676,
26,
13,
9,
2328,
21066,
9,
31,
22,
43,
101,
20,
1302... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 export a large table with many records from SQLite to a custom delimited text file?
===
The table I'm dealing with it potentially larger than available memory (let's say 10GB) and some of the fields can have at most 100MB of text. So a simple SELECT query probably isn't going to cut it. I've seen some command line solutions but I need to be able to do this through a C# program. | 0 | [
2,
98,
25,
14,
246,
161,
20,
7487,
21,
370,
859,
29,
151,
742,
37,
4444,
10601,
20,
21,
5816,
121,
23012,
1854,
3893,
60,
800,
3726,
3726,
14,
859,
31,
22,
79,
5746,
29,
32,
9465,
1662,
119,
904,
1912,
13,
5,
1336,
22,
18,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does C++ support 'finally' blocks? (And what's this 'RAII' I keep hearing about?)
===
Does C++ support '[**finally**][1]' blocks?
What is the [**RAII idiom**][2]?
What is the difference between C++'s RAII idiom and [**C#'s 'using' statement**][3]?
[1]: http://java.sun.com/docs/books/tutorial/essential/exceptions/finally.html
[2]: http://sourceforge.net/docman/display_doc.php?docid=8673&group_id=9028
[3]: http://www.c-sharpcorner.com/uploadfile/dipalchoksi/usingstatement11092005065819am/usingstatement.aspx
| 0 | [
2,
630,
272,
20512,
555,
13,
22,
4932,
102,
22,
5198,
60,
13,
5,
290,
98,
22,
18,
48,
13,
22,
9618,
49,
22,
31,
643,
3229,
88,
60,
6,
800,
3726,
3726,
630,
272,
20512,
555,
13,
22,
2558,
1409,
4932,
102,
1409,
500,
2558,
165... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Fastest way to get productive in VS 08 and C#
===
I have recently been working with Python using Komodo Edit and other simpler editors but now I am doing a project which is to be done in C# using VS 08. I would appreciate any hints on how to get productive on that platform as quickly as possible. | 0 | [
2,
7518,
161,
20,
164,
15337,
19,
4611,
13,
3099,
17,
272,
5910,
800,
3726,
3726,
31,
57,
1989,
74,
638,
29,
20059,
568,
8028,
8850,
9392,
17,
89,
19120,
12149,
47,
130,
31,
589,
845,
21,
669,
56,
25,
20,
44,
677,
19,
272,
591... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Error "Cannot change Visible in OnShow or OnHide" in Delphi IDE
===
I have a very strange problem with the Delphi 2006 IDE.
If the IDI is minimized, and the PC is locked. I return to the pc, unlock it and maximize the IDE, i sometimes get the error "Cannot change Visible in OnShow or OnHide".
If this happens, i have to kill the IDE with the taskmanager.
Is there anybody out there who has the same problem? And if possible a solution?
I suspect that some third party components are involved, but my coworkers never experience this error. | 0 | [
2,
7019,
13,
7,
1245,
1270,
753,
4560,
19,
27,
9303,
54,
27,
19522,
7,
19,
23030,
13,
3448,
800,
3726,
3726,
31,
57,
21,
253,
2578,
1448,
29,
14,
23030,
592,
13,
3448,
9,
100,
14,
13,
8976,
25,
16713,
43,
15,
17,
14,
5168,
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... |
FTP File Upload with HTTP Proxy (C#)
===
Is there a way to upload a file to a FTP server when behind an HTTP proxy ?
It seems that uploading a file is not supported behind an HTTP Proxy using .Net Webclient. ([http://msdn.microsoft.com/en-us/library/system.net.ftpwebrequest.proxy.aspx][1]).
If there is no workaround ? If not, do you know a good and free FTP library I can use ?
[1]: http://msdn.microsoft.com/en-us/library/system.net.ftpwebrequest.proxy.aspx | 0 | [
2,
1187,
306,
3893,
71,
8294,
29,
7775,
27188,
13,
5,
150,
5910,
6,
800,
3726,
3726,
25,
80,
21,
161,
20,
71,
8294,
21,
3893,
20,
21,
1187,
306,
8128,
76,
439,
40,
7775,
27188,
13,
60,
32,
2206,
30,
71,
16866,
21,
3893,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Sending mass emails programmatically
===
I need to be able to periodically send email alerts to subscribed users. PHP seems to struggle with sending *one* message, so I'm looking for good alternatives.
Any language will do, if the implementation is fast enough. The amount of mails sent will eventually be in the thousands.
If purchasing licensed software can be avoided, so much the better. | 0 | [
2,
4907,
1619,
8517,
18,
625,
6732,
1326,
800,
3726,
3726,
31,
376,
20,
44,
777,
20,
19886,
2660,
8517,
7863,
18,
20,
13,
20330,
43,
3878,
9,
13,
26120,
2206,
20,
4697,
29,
4907,
1637,
849,
2483,
2802,
15,
86,
31,
22,
79,
699,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
State Service when using system.web.routing in WebForms
===
I am using the System.Web.Routing assembly in a WebForms application. When running the application deployed on win2008/IIS7 I got the following message.
> Session state can only be used when enableSessionState is set to true, either in a configuration file or in the Page directive. Please also make sure that System.Web.SessionStateModule or a custom session state module is included in the <configuration>\<system.web>\<httpModules> section in the application configuration.
This is only a problem when using a route I have configured. It is not a problem when directly navigating to an aspx page.
EnableSessionState has been turned on in both the web.config and the Page directive. I have added the Session entry to httpmodule of the web.config.
This is not an issue when developing using Visual Studio on my workstation. It is only a problem when trying to run the application under IIS7 on Win 2008.
| 0 | [
2,
146,
365,
76,
568,
329,
9,
14113,
9,
8821,
1203,
19,
2741,
4190,
18,
800,
3726,
3726,
31,
589,
568,
14,
329,
9,
14113,
9,
8821,
1203,
1475,
19,
21,
2741,
4190,
18,
3010,
9,
76,
946,
14,
3010,
6698,
27,
628,
2753,
118,
2865,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 continuous integration with an Eclipse project?
===
I've been using maven2 and hudson for a while to do my continuous integration, but I find that Eclipse and Maven do not play well together. Sure there's a plugin, but it's cranky to mash the maven project into something that eclipse likes and the build times and unit test are too long.
I'm considering switching back to a pure eclipse project with no ant and no maven involved. With the infinitest plugin and possible the JavaRebel agent, it would give me a very fast build-deploy-test cycle. However I'd still like to have automatic and testing as well, so:
How do I use continuous integration with an Eclipse project?
Is there a command line way to do it?
Is there a build server that already supports it natively? | 0 | [
2,
184,
107,
31,
275,
6357,
8078,
29,
40,
11652,
669,
60,
800,
3726,
3726,
31,
22,
195,
74,
568,
1216,
3124,
135,
17,
6195,
26,
21,
133,
20,
107,
51,
6357,
8078,
15,
47,
31,
477,
30,
11652,
17,
1216,
3124,
107,
52,
418,
134,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Site-Wide Filters in ASP.NET MVC
===
What is the best way to enable site-wide filters in an ASP.NET MVC application?
To clarify, I have a form in my master page which has a drop down list =, the value of which filters every page on the site. Each individual page also has it's own form elements. I'd really rather not have a form element across the whole page (a la vanilla WebForms) but am having difficulty knowing what to call when the site-wide filter in the header is changed. | 0 | [
2,
689,
8,
8077,
21062,
19,
28,
306,
9,
2328,
307,
8990,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
9240,
689,
8,
8077,
21062,
19,
40,
28,
306,
9,
2328,
307,
8990,
3010,
60,
20,
23116,
15,
31,
57,
21,
505,
19,
51,
1129,
2478... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 differences between the different saving methods in Hibernate?
===
Hibernate has a handful of methods that, one way or another, takes your object and puts it into the database. What are the differences between them, when to use which, and why isn't there just one intelligent method to know when to use what?
The methods that I have identified thus far are:
- save()
- update()
- saveOrUpdate()
- saveOrUpdateCopy()
- merge()
- persist() | 0 | [
2,
98,
50,
14,
4921,
128,
14,
421,
7599,
3195,
19,
4148,
2102,
8820,
60,
800,
3726,
3726,
4148,
2102,
8820,
63,
21,
8893,
16,
3195,
30,
15,
53,
161,
54,
226,
15,
1384,
154,
3095,
17,
11179,
32,
77,
14,
6018,
9,
98,
50,
14,
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... |
Access to remote computer's private queue gives "Remote computer is not available"
===
We have a windows application that runs on a server accesses 4 different servers to get the messages in each of their private queues. We've just installed a new server, and for some reason when the application tries to access that computer, it gets a "Remote computer is not available" message.
The access is done with a supervisor user that exists in all servers (they're in a cluster).
Has anyone encountered such a problem, or have a clue as to what could be causing it? | 0 | [
2,
1381,
20,
5388,
1428,
22,
18,
932,
22521,
2352,
13,
7,
99,
20209,
1428,
25,
52,
904,
7,
800,
3726,
3726,
95,
57,
21,
1936,
3010,
30,
1461,
27,
21,
8128,
1381,
160,
268,
421,
17595,
20,
164,
14,
7561,
19,
206,
16,
66,
932,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 force creator signatures and static methods?
===
Sorry in advance if the question is *naive*...
**Is there a way of forcing a (child) class to have creators with particular signatures or particular static methods in c sharp?**
You can't obviously use interfaces for this, and I know that it will have a limited usage. The one instance in which I do find it useful is when you want to enforce some design guideline, for example:
**Exceptions**
They should all have the four canonical creators, but there is no way to enforce it. You have to rely on a tool like FxCop to catch these.
**Operators**
There is no contract that specifies that two classes can be summed (with operator+)
Is there any design pattern to work around this limitation?
What construct could be added to the *language* to overcome this limitation in future versions of c sharp? | 0 | [
2,
184,
107,
42,
558,
9247,
19506,
17,
12038,
3195,
60,
800,
3726,
3726,
1875,
19,
3612,
100,
14,
1301,
25,
1637,
325,
1284,
2483,
9,
9,
9,
13,
1409,
403,
80,
21,
161,
16,
6135,
21,
13,
5,
11287,
6,
718,
20,
57,
20638,
29,
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 do I get svn:ignore to work properly?
===
As I understand it, the command to ignore the _content_ of a directory using SVN is this:
svn propset svn:ignore "*" tmp/
This should set the ignore property on the content of the `tmp` directory, right? In other words, the wildcard is set to be the ignore value on the tmp directory. Trouble is, here's what is happening on my Windows box:
> svn propset svn:ignore "*" ./tmp
property 'svn:ignore' set on 'app'
property 'svn:ignore' set on 'config'
property 'svn:ignore' set on 'db'
property 'svn:ignore' set on 'doc'
property 'svn:ignore' set on 'lib'
property 'svn:ignore' set on 'log'
property 'svn:ignore' set on 'nbproject'
property 'svn:ignore' set on 'public'
[etc...]
That's not right. Am I doing something wrong (or perhaps going insane), or is my svn on Windows broken?
Setting this property via Tortoise works perfectly. | 0 | [
2,
184,
107,
31,
164,
13,
18,
16578,
45,
23565,
99,
20,
170,
7428,
60,
800,
3726,
3726,
28,
31,
1369,
32,
15,
14,
1202,
20,
7174,
14,
13,
1,
25424,
1,
16,
21,
16755,
568,
13,
18,
16578,
25,
48,
45,
13,
18,
16578,
9476,
3554,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Compiled, strongly-typed alternative .Net?
===
Is there a programming language suitable for building web applications, that is compiled, strongly-typed, and isn't ASP.Net?
I thought of using Mono (www.project-mono.com), but just wondering if there are any additional alternatives?
(If the language and framework are open-source, that's a big plus!) | 0 | [
2,
9316,
15,
5020,
8,
4474,
43,
2676,
13,
9,
2328,
60,
800,
3726,
3726,
25,
80,
21,
3143,
816,
6445,
26,
353,
2741,
3767,
15,
30,
25,
9316,
15,
5020,
8,
4474,
43,
15,
17,
2532,
22,
38,
28,
306,
9,
2328,
60,
31,
289,
16,
56... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
bash: start multiple chained commands in background
===
I'm trying to run some commands in paralel, in background, using bash. Here's what I'm trying to do:
forloop {
//this part is actually written in perl
//call command sequence
print `touch .file1.lock; cp bigfile1 /destination; rm .file1.lock;`;
}
The part between backticks (``) spawns a new shell and executes the commands in succession. The thing is, control to the original program returns only after the last command has been executed. I would like to execute the whole statement in background (I'm not expecting any output/return values) and I would like the loop to continue running.
The calling program (the one that has the loop) would not end until all the spawned shells finish.
I could use threads in perl to spawn different threads which call different shells, but it seems an overkill...
Can I start a shell, give it a set of commands and tell it to go to the background?
Thank you for your help. | 0 | [
2,
13158,
45,
799,
1886,
2858,
69,
14294,
19,
2395,
800,
3726,
3726,
31,
22,
79,
749,
20,
485,
109,
14294,
19,
2017,
192,
532,
15,
19,
2395,
15,
568,
13158,
9,
235,
22,
18,
98,
31,
22,
79,
749,
20,
107,
45,
26,
18786,
13,
1,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What language/methods to use to listen to removeable drives in Windows?
===
What language or method would I use to listen to the event when a removeable drive is plugged into the PC? | 0 | [
2,
98,
816,
118,
5909,
1807,
43,
18,
20,
275,
20,
3834,
20,
4681,
579,
10396,
19,
1936,
60,
800,
3726,
3726,
98,
816,
54,
2109,
83,
31,
275,
20,
3834,
20,
14,
807,
76,
21,
4681,
579,
1493,
25,
29039,
77,
14,
5168,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I program a driver for a USB device?
===
I am looking for a device that reads wiring voltages via a USB interface and returns the data. How would I go about programming something to interpret this data and what language would I use? | 0 | [
2,
184,
107,
31,
625,
21,
2425,
26,
21,
182,
220,
3646,
60,
800,
3726,
3726,
31,
589,
699,
26,
21,
3646,
30,
11137,
12701,
68,
10390,
18,
1197,
21,
182,
220,
6573,
17,
4815,
14,
1054,
9,
184,
83,
31,
162,
88,
3143,
301,
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,
0,
0,
0,
0,
0,
0,
0... |
What would be the best book to read in order to really 'grok' OOP?
===
How would you recommend I go about learning about Object Oriented Design/Programming?
I prefer to learn based on books first (it's likely a bias of mine based on the assumption that books are edited for quality, which "random" websites would not - discuss in question comments if you wish), so I'm really looking for a couple great beginner books on the topic. If there is a definitive website that covers this, I'd be open to that too if it's known to be good quality. | 0 | [
2,
98,
83,
44,
14,
246,
360,
20,
1302,
19,
389,
20,
510,
13,
22,
7944,
197,
22,
13,
21709,
60,
800,
3726,
3726,
184,
83,
42,
12360,
31,
162,
88,
2477,
88,
3095,
13,
6800,
704,
118,
19746,
3863,
60,
31,
6369,
20,
2484,
432,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ruby/ruby on rails memory leak detection
===
I wrote a small web app using ruby on rails, its main purpose is to upload, store, and display results from xml(files can be up to several MB) files. After running for about 2 months I noticed that the mongrel process was using about 4GB of memory. I did some research on debugging ruby memory leaks and could not find much. So I have two questions.
- Are there any good tools that can be used to find memory leaks in Ruby/rails?
- What type of coding patterns cause memory leaks in ruby? | 0 | [
2,
10811,
118,
1820,
779,
27,
2240,
18,
1912,
11724,
11643,
800,
3726,
3726,
31,
738,
21,
284,
2741,
4865,
568,
10811,
27,
2240,
18,
15,
82,
407,
2131,
25,
20,
71,
8294,
15,
1718,
15,
17,
3042,
1736,
37,
23504,
5,
16877,
18,
92,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a php library for email validation?
===
I need to validate the email of my users. Unfortunately, making a validator that [comforms to standards][2] is hard
[Here][1] is an example of a regex expression that tries to comform to standard
Are there any PHP library (preferably, open-source) that validates emails?
[1]: http://www.ex-parrot.com/~pdw/Mail-RFC822-Address.html
[2]: http://tools.ietf.org/html/rfc2822#section-3.4.1 | 0 | [
2,
25,
80,
21,
13,
26120,
1248,
26,
8517,
27999,
60,
800,
3726,
3726,
31,
376,
20,
7394,
1373,
14,
8517,
16,
51,
3878,
9,
6200,
15,
544,
21,
7394,
3457,
30,
636,
960,
4190,
18,
20,
3364,
500,
2558,
135,
500,
25,
552,
636,
6836... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 prevent ServerXMLHTTP from automatically following redirects (HTTP 303 See Other responses)
===
I am using ServerXMLHTTP to perform an HTTP POST. The response returned is a redirect (specifically 303 See Other). ServerXMLHTTP is automatically following this redirect but this is causing an authentication failure as is not propagating the Authorization header of the original request.
Is there a way I can prevent the automatic redirection (or alternatively ensure that the Authorization header is resent)? | 0 | [
2,
184,
107,
31,
2501,
8128,
396,
8184,
21127,
37,
7499,
249,
302,
14706,
18,
13,
5,
21127,
13,
19806,
196,
89,
13231,
6,
800,
3726,
3726,
31,
589,
568,
8128,
396,
8184,
21127,
20,
2985,
40,
7775,
678,
9,
14,
1627,
587,
25,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
F# - while woes given tuple condition
===
Given the following:
#light
//any function returning bool * 'a
let foo =
let x = ref 10
fun () ->
x := !x - 1
if !x <> 0 then
(true, x)
else
(false, x)
while let (c,x) = foo() in c do print_any x;//can't access x, but would be convinent.
How should I go about solving this?
Or should I just go through the hassle to convert "foo" to a sequence expression? | 0 | [
2,
398,
5910,
13,
8,
133,
4808,
160,
504,
2289,
5106,
2874,
800,
3726,
3726,
504,
14,
249,
45,
6926,
3130,
12894,
6001,
1990,
2485,
1607,
1823,
1637,
13,
22,
58,
408,
4310,
111,
800,
408,
993,
800,
13,
14057,
332,
2414,
13,
5,
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... |
Top reason not to use EJB 3.0 again?
===
The scenario
* You have developed a webapp using EJBs version 3.
* The system is deployed, delivered and is used by the customer.
If you would have to rewrite the system from scratch, would you use EJBs again?
**Yes**: Don't answer this question, answer [this one][1] instead.
**No**: Provide the top reason for not using EJBs again, based on your personal experience.
Let the answer contain just **one** reason. This will let other readers vote up the number one reason to stay away from EJB 3.
[1]: http://stackoverflow.com/questions/105544/most-important-problem-solved-by-ejb-3 | 0 | [
2,
371,
1215,
52,
20,
275,
13,
10022,
220,
203,
9,
387,
188,
60,
800,
3726,
3726,
14,
12705,
1637,
42,
57,
885,
21,
2741,
7753,
568,
13,
10022,
4562,
615,
203,
9,
1637,
14,
329,
25,
6698,
15,
4002,
17,
25,
147,
34,
14,
7705,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Going back to academia?
===
I was playing around with [Zotero][1] yesterday to help my partner with an assignment and it gave me a craving for going back to academia. I'm a CS Grad with a Masters (In CS as well) so I'd be going back to do a Phd.
How much time is too muchtime before going back to academia? I'd planned on working for at least 5 years before considdering going back to academia, mainly to round off my experience and to improve my work ethic, but I'm wondering if I'm shooting myself in the foot by not going straight back.
On the other hand I'd like to ensure that I can get a job once I finish my Phd, which is one of the reasons I went into industry after my masters, and I found it hard enough finding a job then. I'm aware there is a stigma of being "over qualified" associated with having done a post grad.
By not moving about in academic circles I feel like I have no idea whats going on in research, so if I were to have to formulate a Thesis proposal I wouldn't know where to start?
Any Thoughts on:
1. How long one should wait before going back to academia?
2. How to keep current while not in academia?
3. Whether it's worth going back to academia?
4. What the long term job prospects are for somone with a Phd outside of academia?
5. What it's like to go back to academia after a few years in industry?
6. If I do decide to go back who to approach and how to go about it? (Should I apply to the same university I graduated from?)
I'm thinking about rejoining academia in the UK I've got no idea whether this is different to doing so elsewhere, I'd considder going elsewhere, but it would be more hassle as I own my home and now is not a good time to sell...
Cheers.
[1]: http://www.zotero.org/ | 0 | [
2,
228,
97,
20,
19450,
60,
800,
3726,
3726,
31,
23,
791,
140,
29,
636,
2500,
16059,
500,
2558,
165,
500,
7124,
20,
448,
51,
2417,
29,
40,
8427,
17,
32,
492,
55,
21,
25591,
26,
228,
97,
20,
19450,
9,
31,
22,
79,
21,
272,
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... |
Create a new Word Document using VSTO
===
How to new a word document programmatically using Visual Studio Tools for Developers? | 0 | [
2,
1600,
21,
78,
833,
4492,
568,
4611,
262,
800,
3726,
3726,
184,
20,
78,
21,
833,
4492,
625,
6732,
1326,
568,
3458,
1120,
4672,
26,
10168,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Library for converting a traceback to its exception?
===
Just a curiosity: is there an already-coded way to convert a printed traceback back to the exception that generated it? :) Or to a sys.exc_info-like structure? | 0 | [
2,
1248,
26,
19583,
21,
5565,
1958,
20,
82,
5391,
60,
800,
3726,
3726,
114,
21,
11581,
45,
25,
80,
40,
614,
8,
22254,
161,
20,
8406,
21,
5317,
5565,
1958,
97,
20,
14,
5391,
30,
6756,
32,
60,
13,
45,
6,
54,
20,
21,
10315,
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,
0,
0,
0,
0,
0,
0... |
Pitfalls for converting a .net 2.0 solution to .net 3.5
===
We're moving a solution with 20+ projects from .net 2.0 to 3.5 and at the same time moving from Visual Studio 2005 to 2008. We're also at the same time switching from MS Entlib 2.0 to 4.0.
- Is there any reasons not to let the
Visual Studio wizard convert the
solution for us?
- Is 3.5 fully backwards compatible
with 2.0?
- Is Entlib 4.0 fully backwards compatible
with 2.0?
:)
//W
| 0 | [
2,
4175,
5660,
18,
26,
19583,
21,
13,
9,
2328,
172,
9,
387,
4295,
20,
13,
9,
2328,
203,
9,
264,
800,
3726,
3726,
95,
22,
99,
1219,
21,
4295,
29,
434,
2430,
2314,
37,
13,
9,
2328,
172,
9,
387,
20,
203,
9,
264,
17,
35,
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... |
Finding a User in Active Directory with the Login Name
===
I'm possibly just stupid, but I'm trying to find a user in Active Directory from C#, using the Login name ("domain\user").
My "Skeleton" AD Search Functionality looks like this usually:
de = new DirectoryEntry(string.Format("LDAP://{0}", ADSearchBase), null, null, AuthenticationTypes.Secure);
ds = new DirectorySearcher(de);
ds.SearchScope = SearchScope.Subtree;
ds.PropertiesToLoad.Add("directReports");
ds.PageSize = 10;
ds.ServerPageTimeLimit = TimeSpan.FromSeconds(2);
SearchResult sr = ds.FindOne();
Now, that works if I have the full DN of the user (ADSearchBase usually points to the "Our Users" OU in Active Directory), but I simply have no idea how to look for a user based on the "domain\user" syntax.
Any Pointers? | 0 | [
2,
3007,
21,
4155,
19,
1348,
16755,
29,
14,
6738,
108,
204,
800,
3726,
3726,
31,
22,
79,
2879,
114,
3553,
15,
47,
31,
22,
79,
749,
20,
477,
21,
4155,
19,
1348,
16755,
37,
272,
5910,
15,
568,
14,
6738,
108,
204,
13,
5,
7,
537... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Page.Tostring() behaves a bit weird in .net 1.1?
===
I have a control where I have to check in which page I am, so I can set a certain variable accordingly.
string pageName = this.Page.ToString();
switch (pageName)
{
case "ASP.foo_bar_aspx": doSomething(); break;
default: doSomethingElse(); break;
}
this works fine locally and on some developmentservers, however when I put it live, It stopped working because I don't get `ASP.foo_bar_aspx` but `_ASP.foo_bar_aspx`
(notice the underscore in the live version)
Why does it act that way, Can I set it somehow?
| 0 | [
2,
2478,
9,
262,
11130,
5,
6,
14149,
18,
21,
1142,
5455,
19,
13,
9,
2328,
137,
9,
165,
60,
800,
3726,
3726,
31,
57,
21,
569,
113,
31,
57,
20,
2631,
19,
56,
2478,
31,
589,
15,
86,
31,
92,
309,
21,
1200,
7612,
12932,
9,
3724... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 favorite Firebug tip or trick?
===
I think, every web developer loves Firefox's [Firebug extension][1] for solving CSS or Javascript problems.
I use it very often, but I'm sure that I'm not aware of some hidden gems. What is your **favorite (not evident) trick or tip** for Firebug?
[1]: http://getfirebug.com/ | 4 | [
2,
98,
25,
154,
3839,
535,
16254,
4265,
54,
5514,
60,
800,
3726,
3726,
31,
277,
15,
352,
2741,
10058,
9330,
535,
18219,
22,
18,
636,
5929,
16254,
3896,
500,
2558,
165,
500,
26,
17533,
272,
18,
18,
54,
8247,
8741,
1716,
9,
31,
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... |
Using DISTINCT inner join in SQL
===
I have three tables, A, B, C, where A is many to one B, and B is many to one C. I'd like a list of all C's in A.
My tables are something like this: A[id, valueA, lookupB], B[id, valueB, lookupC], C[id, valueC]. I've written a query with two nested SELECTs, but I'm wondering if it's possible to do INNER JOIN with DISTINCT somehow.
SELECT valueC
FROM C
INNER JOIN
(
SELECT DISTINCT lookupC
FROM B INNER JOIN
(
SELECT DISTINCT lookupB
FROM A
)
A2 ON B.id = A2.lookupB
)
B2 ON C.id = B2.lookupC | 0 | [
2,
568,
4421,
3754,
1865,
19,
4444,
255,
800,
3726,
3726,
31,
57,
132,
7484,
15,
21,
15,
334,
15,
272,
15,
113,
21,
25,
151,
20,
53,
334,
15,
17,
334,
25,
151,
20,
53,
272,
9,
31,
22,
43,
101,
21,
968,
16,
65,
272,
22,
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 are available for providing a breakdown of the diskspace used by an MSSQL database
===
I have an MSDE2000 database which appears to be approaching it's 2Gb limit.
What tools can I use to determine where all the space is being used?
Ideally think TreesizePro for SQL Databases | 0 | [
2,
98,
4672,
50,
904,
26,
2674,
21,
13369,
16,
14,
8582,
5582,
147,
34,
40,
4235,
18,
22402,
6018,
800,
3726,
3726,
31,
57,
40,
4235,
546,
3050,
6018,
56,
1780,
20,
44,
8371,
32,
22,
18,
172,
11400,
4496,
9,
98,
4672,
92,
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... |
Best algorithm for synchronizing two IList in C# 2.0
===
Imagine the following type:
public struct Account
{
public int Id;
public double Amount;
}
What is the best algorithm to synchronize two `IList<Account>` in C# 2.0 ? (No linq) ?
The first list (L1) is the reference list, the second (L2) is the one to synchronize according to the first:
- All accounts in L2 that are no longer present in L1 must be deleted from L2
- All accounts in L2 that still exist in L1 must be updated (amount attribute)
- All accounts that are in L1 but not yet in L2 must be added to L2
The Id identifies accounts. It's no too hard to find a naive and working algorithm, but I would like to know if there is a smart solution to handle this scenario without ruining readability and perfs. | 0 | [
2,
246,
9083,
26,
13,
16023,
3335,
81,
31,
5739,
19,
272,
5910,
172,
9,
387,
800,
3726,
3726,
4382,
14,
249,
1001,
45,
317,
13,
10346,
2176,
13,
1,
317,
19,
38,
4924,
73,
317,
1494,
2006,
73,
13,
1,
98,
25,
14,
246,
9083,
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... |
URL segment to action method parameter in Zend Framework
===
in Kohana/CodeIgniter, I can have url in this form -> http://www.name.tld/controller_name/method_name/parameter_1/parameter_2/parameter_3 ...
and read the parameters in my controller as follows
class controller_name_controller
{
public function method_name($param_A, $param_B, $param_C ...)
{
// ... code
}
}
is there a workaround for this or there is an alternative way in Zend Framework? | 0 | [
2,
287,
6362,
5631,
20,
1028,
2109,
18906,
19,
10526,
43,
6596,
800,
3726,
3726,
19,
1584,
7285,
118,
9375,
9693,
242,
106,
15,
31,
92,
57,
287,
6362,
19,
48,
505,
13,
8,
1,
7775,
6903,
6483,
9,
7259,
9,
38,
6252,
118,
12898,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 'clone' WebControls in C# .NET ?
===
My basic question is, in .NET, how do I clone WebControls?
I would like to build a custom tag, which can produce multiple copies of its children.
Ultimately I intend to build a tag similar to <logic:iterate> in JSP/Struts.
But the first hurdle I have is the ability to duplicate/clone the contents of a control.
Consider this rather contrived example;
<custom:duplicate count="2">
<div>
<p>Some html</p>
<asp:TextBox id="tb1" runat="server" />
</div>
</custom:duplicate>
The HTML markup which is output would be something like,
<div>
<p>Some html</p>
<input type="text" id="tb1" />
</div>
<div>
<p>Some html</p>
<input type="text" id="tb1" />
</div>
*Note: I know i have the id duplicated, I can come up with a solution to that later!*
So what we would have is my custom control with 3 children (I think) - a literal control, a TextBox control, and another literal control.
In this example I have said 'count=2' so what the control should do is output/render its children twice.
What I would hope to do is write some "OnInit" code which does something like:
List<WebControl> clones;
for(int i=1; i<count; i++)
{
foreach(WebControl c in Controls)
{
WebControl clone = c.Clone();
clones.Add(clone);
}
}
Controls.AddRange(clones);
However, as far as I can tell, WebControls do not implement ICloneable, so its not possible to clone them in this way.
Any ideas how I can clone WebControls?
| 0 | [
2,
184,
107,
42,
13,
22,
150,
16285,
22,
2741,
12898,
18,
19,
272,
5910,
13,
9,
2328,
13,
60,
800,
3726,
3726,
51,
2125,
1301,
25,
15,
19,
13,
9,
2328,
15,
184,
107,
31,
13871,
2741,
12898,
18,
60,
31,
83,
101,
20,
1895,
21,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
typedef in C#?
===
Is there a typedef equivalent in C#, or someway to get some sort of similar behaviour? I've done some googling, but everywhere I look seems to be negative. Currently I have a situation similar to the following:
class GenericClass<T>
{
public event EventHandler<EventData> MyEvent;
public class EventData : EventArgs { /* snip */ }
// ... snip
}
Now, it doesn't take a rocket scientist to figure out that this can very quickly lead to alot of typing (appologies for the horrible pun) when trying to implement a handler for that event. It'd end up being something like this:
GenericClass<int> gcInt = new GenericClass<int>;
gcInt.MyEvent += new EventHandler<GenericClass<int>.EventData>(gcInt_MyEvent);
// ...
private void gcInt_MyEvent(object sender, GenericClass<int>.EventData e)
{
throw new NotImplementedException();
}
Except, in my case, I was already using a complex type, not just an int. It'd be nice if it was possible to simplify this a little...
Edit: ie. perhaps typedefing the EventHandler<T> instead of needing to redefine it to get similar behaviour. | 0 | [
2,
1001,
13862,
19,
272,
5910,
60,
800,
3726,
3726,
25,
80,
21,
1001,
13862,
4602,
19,
272,
5910,
15,
54,
109,
1443,
20,
164,
109,
2058,
16,
835,
7727,
60,
31,
22,
195,
677,
109,
162,
5598,
802,
15,
47,
6417,
31,
361,
2206,
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... |
Spring MVC : Binding 3 dropdowns to a date property in SimpleFormController
===
How should I configure the class to bind three dropdowns (date, month, year) to a single Date property so that it works the way it works for 'single request parameter per property' scenario ?
I guess a should add some custom PropertyEditors by overriding initBinder method. What else ? | 0 | [
2,
1573,
307,
8990,
13,
45,
8728,
203,
2804,
2968,
18,
20,
21,
1231,
1354,
19,
1935,
4190,
12898,
1252,
800,
3726,
3726,
184,
378,
31,
1065,
15951,
14,
718,
20,
10193,
132,
2804,
2968,
18,
13,
5,
8209,
15,
1617,
15,
159,
6,
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... |
Change language of error messages in ASP.NET
===
I developing ASP.NET application using a Swedish version of Windows XP and Visual studio Professional. When ever i get an error aka. "yellow screen of death" the error message is in swedish, making it a bit hard to search for info about it.
How can i change what language the error messages in ASP.NET uses? | 0 | [
2,
753,
816,
16,
7019,
7561,
19,
28,
306,
9,
2328,
800,
3726,
3726,
31,
3561,
28,
306,
9,
2328,
3010,
568,
21,
3061,
615,
16,
1936,
23045,
17,
3458,
1120,
736,
9,
76,
462,
31,
164,
40,
7019,
20892,
9,
13,
7,
17589,
2324,
16,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Referenced structure not 'sticking'
===
I am currently porting a lot of code from an MFC-based application to a DLL for client branding purposes.
I've come across an unusual problem. This bit of code is the same in both systems:
// ...
CCommsProperties props;
pController->GetProperties( props );
if (props.handshake != HANDSHAKE_RTS_CTS)
{
props.handshake = HANDSHAKE_RTS_CTS;
pController->RefreshCommProperties( props );
}
// ... in another file:
void CControllerSI::RefreshCommProperties ( const CCommsProperties& props )
{
// ... code ...
}
CommProperties is a wrapper for the comm settings, serialization etc. and ControllerSI is a layer between the actual Comms and the Application.
On the original MFC version the setting of handshake to RTS-CTS sticks but when running as the DLL version it resets itself to 0 as soon as the function is entered.
The main differences between the original and the new modules is the variables that call the various dialogs have been removed and the removed #includes
I've lost an afternoon to this and I don't really want to lose any more...
| 2 | [
2,
17571,
1411,
52,
13,
22,
10277,
68,
22,
800,
3726,
3726,
31,
589,
871,
1295,
68,
21,
865,
16,
1797,
37,
40,
307,
7061,
8,
1281,
3010,
20,
21,
13,
43,
211,
26,
6819,
19898,
4612,
9,
31,
22,
195,
340,
464,
40,
4706,
1448,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Some good resources for learning F# please
===
I am a .Net programmer(both C# and VB.net) , and I want to go into F# area also, but can't find some good online article/pdf to start with. Please guide me through this. | 0 | [
2,
109,
254,
2566,
26,
2477,
398,
5910,
2247,
800,
3726,
3726,
31,
589,
21,
13,
9,
2328,
17968,
5,
8110,
272,
5910,
17,
13,
20468,
9,
2328,
6,
13,
15,
17,
31,
259,
20,
162,
77,
398,
5910,
217,
67,
15,
47,
92,
22,
38,
477,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 nice way of handling multi-line input with GNU readline?
===
My application has a command line interface, and I'm thinking about using the [GNU Readline library](http://tiswww.case.edu/php/chet/readline/rltop.html) to provide history, an editable command line, etc.
The hitch is that my commands can be quite long and complex (think SQL) and I'd like to allow users to spread commands over multiple lines to make them more readable in the history.
Is it possible to do this in readline (maybe by specifying a difference between a newline and an end of input)?
Or would I be better off implementing my own command line (but maybe using the [GNU History library](http://tiswww.case.edu/php/chet/readline/history.html))? | 0 | [
2,
25,
80,
21,
2210,
161,
16,
7988,
1889,
8,
1143,
6367,
29,
26092,
1302,
1143,
60,
800,
3726,
3726,
51,
3010,
63,
21,
1202,
293,
6573,
15,
17,
31,
22,
79,
1440,
88,
568,
14,
636,
263,
4215,
1302,
1143,
1248,
500,
5,
21127,
69... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Execute an application in XP when a particular type of USB device is attached
===
In Windows XP what is the best way to execute a particular application when a particular type of USB device is attached (it currently attaches as a storage device - i.e. it appears as a drive).
The solution I am looking for must execute the application from the very first time the device is attached or offer the application as a selection, whichever is easier to achieve, the device must remain attached as a storage device.
| 0 | [
2,
184,
20,
15644,
40,
3010,
19,
23045,
76,
21,
1498,
1001,
16,
182,
220,
3646,
25,
3638,
800,
3726,
3726,
19,
1936,
23045,
98,
25,
14,
246,
161,
20,
15644,
21,
1498,
3010,
76,
21,
1498,
1001,
16,
182,
220,
3646,
25,
3638,
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... |
'pass parameter by reference' in Ruby ?
===
In Ruby, is it possible to pass by reference a parameter with value-type semantics (e.g. a Number)?
I'm looking for something similar to C#'s '**ref**' keyword.
Example:
def func(x)
x += 1
end
a = 5
func(a) #this should be something like func(ref a)
puts a #should read '6'
Btw. I know I could just use:
a = func(a)
| 0 | [
2,
13,
22,
6201,
18906,
34,
2801,
22,
19,
10811,
13,
60,
800,
3726,
3726,
19,
10811,
15,
25,
32,
938,
20,
1477,
34,
2801,
21,
18906,
29,
1923,
8,
4474,
17220,
18,
13,
5,
62,
9,
263,
9,
21,
234,
6,
60,
31,
22,
79,
699,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Linking an external .jar from an Xcode java project?
===
How do I link an external .jar into my Xcode java project? That is, have it in the classpath during compilation and execution. I'm using Xcode 3.0 and this seems to have changed since 2.4. | 0 | [
2,
12585,
40,
4886,
13,
9,
6300,
37,
40,
993,
9375,
8247,
669,
60,
800,
3726,
3726,
184,
107,
31,
3508,
40,
4886,
13,
9,
6300,
77,
51,
993,
9375,
8247,
669,
60,
30,
25,
15,
57,
32,
19,
14,
718,
8353,
112,
4868,
17,
5769,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does this query look optimized?
===
I'm writing a query for an application that needs to list all the products with the number of times they have been purchased.
I came up with this and it works, but I am not too sure how optimized it is.
---
SELECT products.id,
products.long_name AS name,
count(oi.order_id) AS sold
FROM products
LEFT OUTER JOIN
( SELECT * FROM orderitems
INNER JOIN orders ON orderitems.order_id = orders.id
AND orders.paid = 1 ) AS oi
ON oi.product_id = products.id
GROUP BY products.id
---
The schema (with relevant fields) looks like this:
*orders* id, paid
*orderitems* order_id, product_id
*products* id
Thanks | 0 | [
2,
630,
48,
25597,
361,
22864,
43,
60,
800,
3726,
3726,
31,
22,
79,
1174,
21,
25597,
26,
40,
3010,
30,
2274,
20,
968,
65,
14,
1985,
29,
14,
234,
16,
436,
59,
57,
74,
2432,
9,
31,
281,
71,
29,
48,
17,
32,
693,
15,
47,
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 "best practice" to access anopther process in the OS through java?
===
I've been reading Skype4Java (java api for skype) and noticed they use jni to access the skype client.
intuitively I'd assume that there already is a standard library in java that has an OS-sensitive jni implementation to access other processes. I set up to look for one, but couldn't find it.
Is there such a library? if not, is there a best practice to access another process in the os, not necessarily a skype client? | 0 | [
2,
25,
80,
21,
13,
7,
4936,
1345,
7,
20,
1381,
40,
2594,
7171,
953,
19,
14,
13,
759,
120,
8247,
60,
800,
3726,
3726,
31,
22,
195,
74,
1876,
1661,
1664,
300,
1004,
1385,
13,
5,
1004,
1385,
21,
2159,
26,
1661,
1664,
6,
17,
271... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Submitting a form on a user control by pressing enter on a text field does not work
===
This seems to be a common problem but I cannot find a solution.
I type in my username and password which are in a login control I have created.
I then press enter once I've typed in my password and the page just refreshes. It triggers the page load event but not the button on click event.
If I press the submit button then everything works fine. | 0 | [
2,
28848,
21,
505,
27,
21,
4155,
569,
34,
7196,
2830,
27,
21,
1854,
575,
630,
52,
170,
800,
3726,
3726,
48,
2206,
20,
44,
21,
757,
1448,
47,
31,
1967,
477,
21,
4295,
9,
31,
1001,
19,
51,
4155,
7259,
17,
20884,
56,
50,
19,
21... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the purpose of instance methods in Modules without classes?
===
Imagine the following Ruby Module:
module Foo
def inst_method
puts "Called Foo.inst_method"
end
def self.class_method
puts "Called Foo.class_method"
end
end
Obviously `Foo.class_method` can be called without any class instances. However, what's happening to `Foo.inst_method`? Is it possible to call `Foo.inst_method` without previously including/extending a class?
Disclaimer: The question isn't focused on solving a real problem. I'm just trying to improve my understanding of the Ruby object system.
| 0 | [
2,
98,
22,
18,
14,
2131,
16,
4851,
3195,
19,
17113,
366,
2684,
60,
800,
3726,
3726,
4382,
14,
249,
10811,
12613,
45,
12613,
4310,
111,
6312,
19,
384,
1,
5909,
1807,
43,
11179,
13,
7,
4580,
4310,
111,
9,
108,
384,
1,
5909,
1807,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 is GDB documentation specific to the Cell Linux environment?
===
Where can documentation be found for the features of GDB, and the debugging process, specific to debugging of Cell Linux programs mixing PPU and SPU code? | 0 | [
2,
113,
25,
489,
9007,
13945,
1903,
20,
14,
1667,
13024,
2307,
60,
800,
3726,
3726,
113,
92,
13945,
44,
216,
26,
14,
967,
16,
489,
9007,
15,
17,
14,
121,
16254,
2762,
953,
15,
1903,
20,
121,
16254,
2762,
16,
1667,
13024,
1726,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Svn vs Git
===
I am starting a new distributed project where some of the developers will not be in the same country... What should I use: Git or SVN?
Why?
PS. It is a smart client application running on windows and will be developed using Visual Studio... | 4 | [
2,
13,
18,
16578,
4611,
13,
10404,
800,
3726,
3726,
31,
589,
1422,
21,
78,
4387,
669,
113,
109,
16,
14,
10168,
129,
52,
44,
19,
14,
205,
475,
9,
9,
9,
98,
378,
31,
275,
45,
13,
10404,
54,
13,
18,
16578,
60,
483,
60,
8613,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Programatically renaming a table in SQL Server 2000 - is sp_rename the only solution?
===
I recently had to rename a table (and a column and FK/PK contraints) in SQL Server 2000 without losing an data. There did not seem to be an obvious DDL T-SQL statements for performing this action, so I used sp_rename to directly fiddle with object names.
Was this the only solution to the problem? (other, than give the table the correct name in the first place - doh!) | 0 | [
2,
625,
721,
8438,
25934,
21,
859,
19,
4444,
255,
8128,
824,
13,
8,
25,
3782,
1,
99,
7259,
14,
104,
4295,
60,
800,
3726,
3726,
31,
1989,
41,
20,
302,
7259,
21,
859,
13,
5,
290,
21,
4698,
17,
15795,
118,
17244,
11805,
6391,
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... |
Convert IDictionary<string, string> keys to lowercase (C#)
===
I've got a Method that gets a IDictionary<string, string> as a parameter.
Now I want to provide a method that retrieves the value from this dictionary, but it should be case-invariant.
So my solution to this right now was to have a static function that loops through the keys and converts them toLower() like this:
private static IDictionary<ILanguage, IDictionary<string, string>> ConvertKeysToLowerCase(
IDictionary<ILanguage, IDictionary<string, string>> dictionaries)
{
IDictionary<ILanguage, IDictionary<string, string>> resultingConvertedDictionaries
= new Dictionary<ILanguage, IDictionary<string, string>>();
foreach(ILanguage keyLanguage in dictionaries.Keys)
{
IDictionary<string, string> convertedDictionatry = new Dictionary<string, string>();
foreach(string key in dictionaries[keyLanguage].Keys)
{
convertedDictionatry.Add(key.ToLower(), dictionaries[keyLanguage][key]);
}
resultingConvertedDictionaries.Add(keyLanguage, convertedDictionatry);
}
return resultingConvertedDictionaries;
}
Now, this is ok, but still it's a pretty huge chunk of code that contradicts my idea of "clean and efficient". Do you know any alternatives to this so that the .ContainsKey() method of the dictionary doesn't differentiate between casing? | 0 | [
2,
8406,
31,
22595,
1857,
1,
11130,
15,
3724,
1,
5534,
20,
987,
10325,
13,
5,
150,
5910,
6,
800,
3726,
3726,
31,
22,
195,
330,
21,
2109,
30,
3049,
21,
31,
22595,
1857,
1,
11130,
15,
3724,
1,
28,
21,
18906,
9,
130,
31,
259,
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 do I launch a standalone SWF from within an Abode AIR application?
===
I'm completely new to AIR but what I'm trying to do feels like it should be quite easy.
I want my AIR app to execute (launch) an SWF in the standalone Flash Player (just like if I were to double click it).
Please note that I don't want the AIR app to embed the SWF. Just run it.
Can this be done? | 0 | [
2,
184,
107,
31,
3394,
21,
26986,
13,
18,
15263,
37,
363,
40,
29340,
282,
3010,
60,
800,
3726,
3726,
31,
22,
79,
1524,
78,
20,
282,
47,
98,
31,
22,
79,
749,
20,
107,
5121,
101,
32,
378,
44,
1450,
2010,
9,
31,
259,
51,
282,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 worth joining the ACM
===
I keep getting mail form the Association for Computing Machinery urging me to join up and get access to all these wonderful resources.
At something like $84 (USD) a year and with the dollar/pound exchange rate it isn't a lot of money, but is it worth it?
Any opinions? | 4 | [
2,
25,
32,
2715,
3765,
14,
21,
9095,
800,
3726,
3726,
31,
643,
1017,
4216,
505,
14,
607,
26,
10626,
10846,
16082,
55,
20,
1865,
71,
17,
164,
1381,
20,
65,
158,
5934,
2566,
9,
35,
301,
101,
14623,
300,
13,
5,
267,
43,
6,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you track your time?
===
I had about 7 employes until today and everyone had another kind of timesheet/timereporting.
How do you track your time at your current workplace, or if your a freelancer, how do you keep track of your time? | 2 | [
2,
184,
107,
42,
792,
154,
85,
60,
800,
3726,
3726,
31,
41,
88,
453,
13125,
160,
163,
786,
17,
1266,
41,
226,
825,
16,
85,
17627,
118,
891,
17437,
68,
9,
184,
107,
42,
792,
154,
85,
35,
154,
866,
16932,
15,
54,
100,
154,
21,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... |
Usability: Should the ENTER key close a wizard form as OK even if the focus is not set on the OK/DONE button?
===
I have the in my opinion odd request to close a wizard form as Done or OK if Enter was pressed on the keyboard even if the OK/DONE button is not focused.
In my opinion that would be a usability mistake. For example: In the wizard you may have multiple controls, buttons, check boxes, multiple line controls and they all have a different behavior on actions from the ENTER key. And don't forget the other buttons in the navigation of the wizard, what if they are focused?
Should these controls don't react on Enter like expected before? Should they do their actions but in other cases where Enter does no further action for the control it should close the form == inconsistent?
I think that is a typical request where the needs of one person would help him but confuse many other.
In my opinion Wizards are very special because they are not only made to make things easier but also very often focus on people with less experience with the functionality of an application. So I take every request serious and try to look into all arguments for and against the request.
Is my point of view to narrow? Are there some usability studies or guidelines especially for Wizards to backup my opinion or maybe proof me wrong?
Thank you very much!
Michael | 0 | [
2,
182,
4091,
45,
378,
14,
2830,
1246,
543,
21,
10276,
505,
28,
5854,
166,
100,
14,
1776,
25,
52,
309,
27,
14,
5854,
118,
43,
849,
5167,
60,
800,
3726,
3726,
31,
57,
14,
19,
51,
4052,
4210,
3772,
20,
543,
21,
10276,
505,
28,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you get the Class of an Abstract class (Object) in JavaME
===
So i need to get the Class of an object at runtime, and sorry guys Javas not my home ;0)
For an none abstract class i could do something like:
public class MyNoneAbstract{
public static Class MYNONEABSTRACT_CLASS = new MyNoneAbstract().getClass();
But for an abstract class this does NOT work (always gives me Object)
public abstract class MyAbstract{
public static Class MYABSTRACT_CLASS = MyAbstract.class.getClass();
This code will be running in JavaME environments.
Thanks for the help...
| 0 | [
2,
184,
107,
42,
164,
14,
718,
16,
40,
8502,
718,
13,
5,
23793,
6,
19,
8247,
790,
800,
3726,
3726,
86,
31,
376,
20,
164,
14,
718,
16,
40,
3095,
35,
485,
891,
15,
17,
1875,
2776,
8247,
18,
52,
51,
213,
13,
73,
387,
6,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why is Apache + Rails is spitting out two status headers for code 500?
===
I have a rails app that is working fine except for one thing.
When I request something that doesn't exist (i.e. /not_a_controller_or_file.txt), the response is this:
HTTP/1.1 200 OK
Date: Thu, 02 Oct 2008 10:28:02 GMT
Content-Type: text/html
Content-Length: 122
Vary: Accept-Encoding
Keep-Alive: timeout=15, max=100
Connection: Keep-Alive
Status: 500 Internal Server Error
Content-Type: text/html
<html><body><h1>500 Internal Server Error</h1></body></html>
I have the ExceptionLogger plugin in /vendor, though that doesn't seem to be the problem. I haven't added any error handling beyond the custom 500.html in public (though the response doesn't contain that HTML) and I have no idea where this bit of html is coming from.
So Something, somewhere is adding that **HTTP/1.1 200** status code too early, or the **Status: 500** too late. I suspect it's Apache because I get the appropriate HTTP/1.1 500 header (at the top) when I use Webrick.
My production stack is as follows:
Apache 2
Mongrel (5 instances)
RubyOnRails 2.1.1 | 0 | [
2,
483,
25,
17140,
2754,
2240,
18,
25,
26535,
70,
81,
1782,
157,
445,
26,
1797,
3033,
60,
800,
3726,
3726,
31,
57,
21,
2240,
18,
4865,
30,
25,
638,
1123,
1613,
26,
53,
584,
9,
76,
31,
3772,
301,
30,
1437,
22,
38,
3182,
13,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Methods in a Java interface with or without public access modifier
===
Should methods in a Java interface be declared with or without a public access modifier?
Technically it doesn't matter of course. A class method that implements an interface is always public. But what is a better convention?
Java itself is not consequent in this. See for instance `Collection` vs. `Comparable` or `Future` vs. `ScriptEngine`. | 0 | [
2,
3195,
19,
21,
8247,
6573,
29,
54,
366,
317,
1381,
7226,
16292,
800,
3726,
3726,
378,
3195,
19,
21,
8247,
6573,
44,
2482,
29,
54,
366,
21,
317,
1381,
7226,
16292,
60,
12345,
32,
1437,
22,
38,
1161,
16,
674,
9,
21,
718,
2109,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Visual Studio 2005 - can not open form on designer
===
My team developed a GUI application on Visual Studio 2005, managed C++. Since some deliveries it is not possible to open the form in the designer, even if the source code and the project settings have not been changed. The designer reports this error:
**Exception of type 'System.OutOfMemoryException' was thrown.**
*at Microsoft.VisualStudio.Design.VSDynamicTypeService.ShadowCopyAssembly(String fileName)
at Microsoft.VisualStudio.Design.VSDynamicTypeService.CreateDynamicAssembly(String codeBase)
at Microsoft.VisualStudio.Design.VSTypeResolutionService.AssemblyEntry.get_Assembly()
at Microsoft.VisualStudio.Design.VSTypeResolutionService.AssemblyEntry.Search(String fullName, String typeName, Boolean ignoreTypeCase, Assembly& assembly, String description)
...*
We successfully recompiled the project but we still encounter this problem.
Any idea? | 0 | [
2,
3458,
1120,
812,
13,
8,
92,
52,
368,
505,
27,
4742,
800,
3726,
3726,
51,
173,
885,
21,
9457,
3010,
27,
3458,
1120,
812,
15,
1471,
272,
20512,
9,
179,
109,
25340,
32,
25,
52,
938,
20,
368,
14,
505,
19,
14,
4742,
15,
166,
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... |
Windbg: How to set breakpoint on one of the overloads of a C++ function?
===
I have two overloads of a c++ function and I would like to set a breakpoint on one of them:
0:000> bu myexe!displayerror
Matched: 00000000`ff3c6100 myexe!displayError (int, HRESULT, wchar_t *)
Matched: 00000000`ff3c60d0 myexe!displayError (int, HRESULT)
Ambiguous symbol error at 'myexe!displayerror'
Heck I would be fine with setting breakpoints on all overloads, but can't seem to figure out how:
0:000> bu myexe!displayerror*
Matched: 00000000`ff3c6100 myexe!displayError (int, HRESULT, wchar_t *)
Matched: 00000000`ff3c60d0 myexe!displayError (int, HRESULT)
Ambiguous symbol error at 'myexe!displayerror*'
| 0 | [
2,
1511,
19924,
45,
184,
20,
309,
1442,
3132,
27,
53,
16,
14,
84,
8294,
18,
16,
21,
272,
20512,
1990,
60,
800,
3726,
3726,
31,
57,
81,
84,
8294,
18,
16,
21,
272,
20512,
1990,
17,
31,
83,
101,
20,
309,
21,
1442,
3132,
27,
53,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which is the fastest TAR application?
===
I've got a script that tars an entire source code directory (around 800MB), and I want it to run as fast as possible. GNU Tar, for some reason, was kind of slow when untarring. I was wondering if anyone's already made this comparison and knows which application has the fastest tar/untar implementation.
For Windows, btw.
| 0 | [
2,
56,
25,
14,
7518,
2475,
3010,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
3884,
30,
2475,
18,
40,
1078,
1267,
1797,
16755,
13,
5,
10037,
7993,
5024,
6,
15,
17,
31,
259,
32,
20,
485,
28,
1512,
28,
938,
9,
26092,
2475,
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... |
Truncating Method calls
===
This is a subjective question as I want to gauge if it's worth me moaning at my co-workers for doing something which I find utterly detestable.
The issue is that a bunch of my co-workers will truncate method calls to fit a width. We all use widescreen laptops that can handle large resolutions (mine is 1920x1200) and when it comes to debugging and reading code I find it much easier to read one line method calls as opposed to multiple line calls.
Here's an example of a method (how I would like it):
IReallyLongInterfaceName instanceOfInterfaceName = OurContainer.retrieveClass(IReallyLongInterfaceName.class, param1, param2, param3);
(I do hate really long interface/class names as well :)
It seems that this doesn't render well on StackOverflow, but I think most of you know what I mean. Anyway, some of the other devs do the following.
IReallyLongInterfaceName instanceOfInterfaceName = OurContainer.retrieveClass(IReallyLongInterfaceName.class,
param1,
param2,
param3);
Which is the easier to read at the end of the day for you and would I be unreasonable in asking them to use the first of the two (as it is part of our standard)? | 0 | [
2,
22328,
68,
2109,
3029,
800,
3726,
3726,
48,
25,
21,
22835,
1301,
28,
31,
259,
20,
7313,
100,
32,
22,
18,
2715,
55,
25858,
35,
51,
326,
8,
16355,
26,
845,
301,
56,
31,
477,
14037,
121,
10543,
579,
9,
14,
1513,
25,
30,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I maintain history of a file that is moved to a directory overwriting a file of the same name
===
Consider the following subversion directory structure
/dir1/file.txt
/dir2/file.txt
I want to move the file.txt in dir1 to replace the same file in dir2 and ensure that the history for the dir1 file is maintained. I don't care about the history of original dir2 file.
Is this possible using subversion commands and not hacking the backend? | 0 | [
2,
184,
92,
31,
4027,
447,
16,
21,
3893,
30,
25,
385,
20,
21,
16755,
84,
12646,
21,
3893,
16,
14,
205,
204,
800,
3726,
3726,
3563,
14,
249,
972,
10898,
16755,
1411,
13,
118,
9035,
8197,
16877,
9,
38,
396,
38,
13,
118,
9035,
92... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SICP Exercise 1.3 request for comments
===
I'm trying to learn scheme via SICP. Exercise 1.3 reads as follow: Define a procedure that takes three numbers as arguments and returns the sum of the squares of the two larger numbers. Please comment on how I can improve my solution.
(define (big x y)
(if (> x y) x y))
(define (p a b c)
(cond ((> a b) (+ (square a) (square (big b c))))
(else (+ (square b) (square (big a c))))))
| 0 | [
2,
2769,
7439,
5935,
137,
9,
240,
3772,
26,
7534,
800,
3726,
3726,
31,
22,
79,
749,
20,
2484,
4276,
1197,
2769,
7439,
9,
5935,
137,
9,
240,
11137,
28,
1740,
45,
9267,
21,
7004,
30,
1384,
132,
2116,
28,
10553,
17,
4815,
14,
3907,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 initialisation containing class variable initialisation
===
I noticed some code of a colleague today that initialised class variables in the initialisation. However it was causing a warning, he says because of the order they are in. My question is why is it better to do variable initialisation where it currently is and not within the curly brackets?
DiagramScene::DiagramScene( int slideNo, QRectF screenRect, MainWindow* parent )
: QGraphicsScene( screenRect, parent ),
myParent( parent ),
slideUndoImageCurrentIndex(-1),
nextGroupID(0),
m_undoInProgress(false),
m_deleteItemOnNextUndo(0)
line(0),
path(0)
{
/* Setup default brush for background */
scDetail->bgBrush.setStyle(Qt::SolidPattern);
scDetail->bgBrush.setColor(Qt::white);
setBackgroundBrush(scDetail->bgBrush);
} | 0 | [
2,
272,
20512,
718,
2104,
4330,
3503,
718,
7612,
2104,
4330,
800,
3726,
3726,
31,
2711,
109,
1797,
16,
21,
12321,
786,
30,
2104,
2541,
718,
12157,
19,
14,
2104,
4330,
9,
207,
32,
23,
3242,
21,
3590,
15,
24,
898,
185,
16,
14,
389... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Home/End keys in zsh don't work with putty
===
I'm running zsh as the default shell on a Ubuntu box, and everything works fine using gnome-terminal (which as far as I know emulates xterm). When I login from a windows box via ssh and putty (which also emulates xterm) suddendly the home/end keys no longer work.
I've been able to solve that adding these lines to my zshrc file...
bindkey '\e[1~' beginning-of-line
bindkey '\e[4~' end-of-line
...but I'm still wondering what's wrong here. Any idea?
| 0 | [
2,
213,
118,
2451,
5534,
19,
2052,
1635,
221,
22,
38,
170,
29,
442,
1084,
800,
3726,
3726,
31,
22,
79,
946,
2052,
1635,
28,
14,
12838,
3593,
27,
21,
287,
12968,
2473,
1649,
15,
17,
796,
693,
1123,
568,
24117,
8,
20907,
13,
5,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
iCalendar Format (Outlook 2007)
===
I've got a little problem, I need to be able to have a reoccurring event (forever) that marks the day after the second Tuesday of each month.
Your probably thinking, why not just Wednesday of each month.
October 2008 is an example, it starts on a Wednesday. :(
Really I just need it in Outlook, probably (but not limited to) some iCalendar format file. | 0 | [
2,
13,
4272,
219,
2542,
2595,
13,
5,
1320,
5810,
624,
6,
800,
3726,
3726,
31,
22,
195,
330,
21,
265,
1448,
15,
31,
376,
20,
44,
777,
20,
57,
21,
302,
2499,
28119,
807,
13,
5,
1106,
5221,
6,
30,
4872,
14,
208,
75,
14,
153,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Table that supports sorting, scrolling and filtering
===
I have a project using GWT and it displays data in a table.
I need a Table for GWT that supports:
- sorting by particular column
- scrolling the data, while the header is immobile
- filtering rows for data searched in the table
The project is being created for internal purpose of the company, so I look for a solution that does not require commercial licensing for such uses.
| 0 | [
2,
14094,
38,
859,
30,
6747,
2058,
68,
15,
13,
28166,
17,
25272,
800,
3726,
3726,
31,
57,
21,
669,
568,
14094,
38,
17,
32,
9412,
1054,
19,
21,
859,
9,
31,
376,
21,
859,
26,
14094,
38,
30,
6747,
45,
13,
8,
2058,
68,
34,
1498,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Perl Challenge- Directory Iterator
===
You sometimes hear it said about Perl that there are different 6 ways to approach the same problem. Good Perl developers usually have well-reasoned insights for making choices between the various possible methods of implementation.
So an example Perl problem:
A simple script which recursively iterates through a directory structure, looking for files which were modified recently (after a certain date, which would be variable). Save the results to a file.
The question, for Perl developers: What is your simplest or best way to accomplish this? | 0 | [
2,
416,
255,
2404,
8,
16755,
32,
106,
3457,
800,
3726,
3726,
42,
1030,
990,
32,
87,
88,
416,
255,
30,
80,
50,
421,
400,
2847,
20,
2141,
14,
205,
1448,
9,
254,
416,
255,
10168,
951,
57,
134,
8,
24793,
69,
9239,
18,
26,
544,
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 can i speed up my maven build?
===
I'm using a local artifactory to proxy the request, but the build and test phases are still a bit slow. It's not the actual compile and tests that are slow, it's the "warmup" of the maven framework. Any ideas? | 0 | [
2,
184,
92,
31,
1362,
71,
51,
1216,
3124,
1895,
60,
800,
3726,
3726,
31,
22,
79,
568,
21,
375,
22929,
7159,
20,
27188,
14,
3772,
15,
47,
14,
1895,
17,
1289,
14795,
50,
174,
21,
1142,
2276,
9,
32,
22,
18,
52,
14,
3463,
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... |
Using Generic lists on serviced component
===
I'm trying to use a generic List as a property on a `ServicedComponent` class...
public class MyCOM : ServicedComponent {
public enum MyEnumType {
Value1, Value2, Value3
}
public List<MyEnumType> MyList { private set; get; }
public MyCOM()
{
MyList = new List<MyEnumType>();
}
}
The code compiles without errors but when I try to use the `MyList` property on the com object from a different class no values get added to the list. Google "told me" that I can't use Generics on Components but I'm yet to find a good explanation why that is and a good solution to the problem.
Can someone help me out? | 0 | [
2,
568,
12733,
7227,
27,
365,
43,
5912,
800,
3726,
3726,
31,
22,
79,
749,
20,
275,
21,
12733,
968,
28,
21,
1354,
27,
21,
13,
1,
11449,
43,
11103,
218,
2291,
1,
718,
9,
9,
9,
317,
718,
51,
960,
13,
45,
365,
43,
11103,
218,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 size limit of the application object in classic asp?
===
I am cerating an ASP script that uses the application object to store the pages. The question in my mind is whether there is a size limit to this object. Anyone know? | 0 | [
2,
98,
25,
14,
1072,
4496,
16,
14,
3010,
3095,
19,
2732,
28,
306,
60,
800,
3726,
3726,
31,
589,
6173,
1880,
40,
28,
306,
3884,
30,
2027,
14,
3010,
3095,
20,
1718,
14,
4434,
9,
14,
1301,
19,
51,
594,
25,
1472,
80,
25,
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,
0,
0,
0,
0,
0,
0,
0,
0... |
How to remotely Start/Stop SQLServer services kicking off existing connections?
===
I know there is already a [question][1] about this but my issue is more oriented to remote scenarios.
With *net start/stop* you can specify a */y* parameter to bounce users off current sessions but you cannot start/stop remotely.
With *sc* you can start/stop remotely but if the SQLServer instance is being used it won't let you stop the service.
So my question is: what's the best way of kicking out users stopping the SqlServer service remotely?
[1]: http://stackoverflow.com/questions/133883/stop-and-start-a-service-via-batch-or-cmd-file | 0 | [
2,
184,
20,
23288,
799,
118,
7318,
4444,
255,
10321,
106,
687,
11228,
168,
3149,
6760,
60,
800,
3726,
3726,
31,
143,
80,
25,
614,
21,
636,
24652,
500,
2558,
165,
500,
88,
48,
47,
51,
1513,
25,
91,
13,
6800,
20,
5388,
19611,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Adding and removing content in jQuery
===
If I create a function with jQuery that adds an empty div, performs some animation inside the blank space created by the div, then removes the div, the browser never makes room for the empty div (height and width are set).
If I don't remove the empty div in my function, then the browser will create the needed space and everything works correctly. However, I really need the blank space created by the div to be removed when the animation is complete.
Is there a way to queue up the div removall so that the browser will show the desired behavior?
| 0 | [
2,
4721,
17,
9096,
2331,
19,
487,
8190,
93,
800,
3726,
3726,
100,
31,
1600,
21,
1990,
29,
487,
8190,
93,
30,
10621,
40,
2424,
13,
12916,
15,
11563,
109,
6236,
572,
14,
6463,
726,
679,
34,
14,
13,
12916,
15,
94,
4681,
18,
14,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the best ASP.NET performance counters to monitor?
===
There are truckloads of counters available in perfmon for ASP.NET. What are the best (I am thinking of choosing 5-10) that will be the best to monitor in our test environment so that we can feed back to developers.
I am thinking of things like request time, request queue length, active sessions etc. | 0 | [
2,
98,
50,
14,
246,
28,
306,
9,
2328,
956,
2105,
18,
20,
7626,
60,
800,
3726,
3726,
80,
50,
2956,
8294,
18,
16,
2105,
18,
904,
19,
416,
410,
2111,
26,
28,
306,
9,
2328,
9,
98,
50,
14,
246,
13,
5,
49,
589,
1440,
16,
10883,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 regular expression to check if a string is a valid URL
===
I need to check if a given string is a valid URL address.
My knowledge of regular expressions is basic and doesn't allow me to choose from the hundreds of regex i've already seen on the web.
| 0 | [
2,
98,
25,
14,
246,
1290,
1803,
20,
2631,
100,
21,
3724,
25,
21,
7394,
287,
6362,
800,
3726,
3726,
31,
376,
20,
2631,
100,
21,
504,
3724,
25,
21,
7394,
287,
6362,
3218,
9,
51,
1918,
16,
1290,
13832,
25,
2125,
17,
1437,
22,
38,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to allow MediaWiki logged user to edit Common.css ?
===
I would like to allow the logged user to edit MediaWiki/Common.css without adding them to the sysop group.
I understand that this will allow user to change it to harful ways but it is a closed wiki so that is not a problem.
Any solution is acceptable even changing php code :) | 0 | [
2,
184,
20,
1655,
941,
17375,
13,
19287,
4155,
20,
9392,
757,
9,
6824,
18,
13,
60,
800,
3726,
3726,
31,
83,
101,
20,
1655,
14,
13,
19287,
4155,
20,
9392,
941,
17375,
118,
17130,
9,
6824,
18,
366,
4721,
105,
20,
14,
10315,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How would you implement ant-style patternsets in python to select groups of files?
===
Ant has a nice way to select groups of files, most handily using ** to indicate a directory tree. E.g.
**/CVS/* # All files immediately under a CVS directory.
mydir/mysubdir/** # All files recursively under mysubdir
More examples can be seen here:
[http://ant.apache.org/manual/dirtasks.html][1]
How would you implement this in python, so that you could do something like:
files = get_files("**/CVS/*")
for file in files:
print file
=>
CVS/Repository
mydir/mysubdir/CVS/Entries
mydir/mysubdir/foo/bar/CVS/Entries
[1]: http://ant.apache.org/manual/dirtasks.html | 0 | [
2,
184,
83,
42,
8713,
40,
38,
8,
4381,
6282,
6095,
19,
20059,
20,
5407,
1170,
16,
6488,
60,
800,
3726,
3726,
40,
38,
63,
21,
2210,
161,
20,
5407,
1170,
16,
6488,
15,
127,
224,
5768,
568,
13,
1409,
20,
4342,
21,
16755,
1541,
9,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Putting configuration information in a DLL
===
In my project I have functionality that is being used as a web application and as a console application (to be started from the task scheduler). To do that I put the common code in a DLL that is being used by both the web application and the console application. This works fine.
However, the console and web applications now have an App.config and Web.config that are mostly the same. Is it possible to put this configuration in the DLL as well and make it available to both applications? | 0 | [
2,
3873,
8091,
676,
19,
21,
13,
43,
211,
800,
3726,
3726,
19,
51,
669,
31,
57,
18548,
30,
25,
142,
147,
28,
21,
2741,
3010,
17,
28,
21,
8650,
3010,
13,
5,
262,
44,
373,
37,
14,
3005,
4345,
139,
6,
9,
20,
107,
30,
31,
442,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 - imap - moving emails on antoher account
===
I am working on a script that downloads emails and stores them in a db, I usually receive thousands of emails on this account, once downloaded the mails are deleted.
Being paranoic, I want to have at least one month backup of my emails, but I cannot clutter my main mailbox address leaving them in there.
So i need to move the mails (via php code) from one mailbox to another. I came up with this solution that uses imap_append(). This solution, however recreates the email, and does not really move it.
Do you have any suggestions or alternative ways of doing this?
Remember: it must be done in php, because I need to integrate it in my readmail script.
I have already seen this thread [where a fetchmail solution was proposed](http://stackoverflow.com/questions/57547/imap-forwarder)
Here follows the code I wrote for this task
<?php
/**
* Conn params
*/
$fromMboxServerPath = "{imap.from.server/notls/imap:143}";
$fromMboxMailboxPath = "INBOX";
$fromMboxMailAddress = "login";
$fromMboxMailPass = "pass";
$toMboxServerPath = "{imap.to.server/notls/imap:143}";
$toMboxMailboxPath = "INBOX";
$toMboxMailAddress = "login";
$toMboxMailPass = "pass";
$fromMboxConnStr = $fromMboxServerPath.$fromMboxMailboxPath;
$toMboxConnStr = $toMboxServerPath.$toMboxMailboxPath;
$fetchStartSeq = 1;
$fetchEndSeq = 10;
function myLog($str)
{
echo "Log [".date('Y-m-d H:i:s')."]: $str\n";
}
myLog("Connecting to mailbox");
function mboxConn($connstr,$addr,$pass)
{
if(!($mbox = @imap_open($connstr, $addr, $pass)))
{
myLog("Error: ".imap_last_error());
die;
}
else
{
myLog("Connected to: $addr $connstr");
return $mbox;
}
}
function mboxCheck($mbox)
{
if(!($mbox_data = imap_check($mbox)))
{
myLog("Error: ".imap_last_error());
die;
}
else
{
myLog("Mailbox check ".$mbox_data->Mailbox." OK");
myLog($mbox_data->Nmsgs." messages present");
return $mbox_data->Nmsgs;
}
}
$fromMbox = mboxConn($fromMboxConnStr, $fromMboxMailAddress, $fromMboxMailPass);
$toMbox = mboxConn($toMboxConnStr, $toMboxMailAddress, $toMboxMailPass);
$fromMboxCount = mboxCheck($fromMbox);
$toMboxCount = mboxCheck($toMbox);
/**
* Loop on mails
*/
$fetchStartUID = imap_uid($fromMbox,$fetchStartSeq);
if ($fromMboxCount < $fetchEndSeq)
{
$fetchEndSeq = $fromMboxCount;
}
$fetchEndUID = imap_uid($fromMbox,$fetchEndSeq);
/**
* Loop on mails
*/
myLog("Do stuff and backup from UID [$fetchStartUID] to UID [$fetchEndUID]");
for ($i=$fetchStartSeq;$i<=$fetchEndSeq;$i++)
{
$pfx = "Msg #$i : ";
$h = imap_header($fromMbox, $i);
$fh = imap_fetchheader($fromMbox, $i);
$fb = imap_body($fromMbox, $i);
$message = $fh.$fb;
$msgUID = imap_uid($fromMbox,$i);
$struct = imap_fetchstructure ($fromMbox, $i);
/**
* We do some logging
*/
myLog($pfx."UID [".$msgUID."] SEQ [".imap_msgno($fromMbox,$msgUID)."] Flags: [". $h->Unseen . $h->Recent . $h->Deleted . $h->Answered . $h->Draft . $h->Flagged."]");
myLog($pfx."From: [". htmlspecialchars($h->fromaddress) . "] To: [".htmlspecialchars($h->toaddress)."]");
myLog($pfx."Subject: [$h->subject]");
/**
* Here you do whaterver you need with your email
*/
/**
* Backup email
*/
if (!($ret = imap_append($toMbox,$toMboxServerPath.$toMboxMailboxPath,$message)))
{
myLog("Error: ".imap_last_error());
die;
}
else
{
myLog("everything ok, mail [$fetchStartUID:$fetchEndUID] downloaded and moved in $newMailboxNameMOVE");
}
}
/**
* End
*/
imap_close($fromMbox);
imap_close($toMbox);
myLog("Connection closed");
?> | 0 | [
2,
13,
26120,
13,
8,
31,
15022,
13,
8,
1219,
8517,
18,
27,
40,
262,
1694,
2176,
800,
3726,
3726,
31,
589,
638,
27,
21,
3884,
30,
7121,
18,
8517,
18,
17,
4134,
105,
19,
21,
13,
9007,
15,
31,
951,
2588,
3805,
16,
8517,
18,
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 MemCache solution for ASP.NET applications?
===
What is the best MemCache solution for ASP.NET applications running in a windows server environment? Why? | 0 | [
2,
98,
25,
14,
246,
55,
4829,
9616,
4295,
26,
28,
306,
9,
2328,
3767,
60,
800,
3726,
3726,
98,
25,
14,
246,
55,
4829,
9616,
4295,
26,
28,
306,
9,
2328,
3767,
946,
19,
21,
1936,
8128,
2307,
60,
483,
60,
3,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is JavaScript single threaded? If not, how do I get synchronized access to shared data?
===
I have a web page with `DIV`s with a `mouseover` handler that is intended to show a pop-up information bubble. I don't want more than one info bubble to be visible at a time. But when the user moves the mouse rapidly over two items, I sometimes get two bubbles. This should not happen, because the code for showing a pop-up cancels the previous pop-up.
If this were a multi-threaded system then the problem would be obvious: there are two threads trying to show a pop-up, and they both cancel existing pop-ups then pop up their own pop-ups. But I assumed JavaScript is always run single-threaded, which would prevent this. Am I wrong? Are event handlers running asynchronously, in which case I need synchronized access to shared data, or should I instead be looking for bugs in the library code for cancelling pop-ups? | 0 | [
2,
25,
8247,
8741,
345,
9322,
69,
60,
100,
52,
15,
184,
107,
31,
164,
27202,
1381,
20,
2592,
1054,
60,
800,
3726,
3726,
31,
57,
21,
2741,
2478,
29,
13,
1,
12916,
1,
18,
29,
21,
13,
1,
14002,
62,
2549,
1,
24641,
30,
25,
2081,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Passing structs by value - why not?
===
Are there any downsides to passing structs by value in C, rather than passing a pointer?
If the struct is large, the there is obviously the performancd aspect of copying lots of data, but for a smaller struct, it should basically be the same as passing several values to a function.
It is maybe even more interesting when used as return values. C only has single return values from functions, but you often need several. So a simple solution is to put them in a struct and return that.
Are there any reasons for or against this? | 0 | [
2,
2848,
13,
10346,
18,
34,
1923,
13,
8,
483,
52,
60,
800,
3726,
3726,
50,
80,
186,
125,
1416,
18,
20,
2848,
13,
10346,
18,
34,
1923,
19,
272,
15,
864,
119,
2848,
21,
454,
106,
60,
100,
14,
13,
10346,
25,
370,
15,
14,
80,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.