unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Check if SoundChannel is playing sound
===
How to check reliably if a SoundChannel is still playing a sound?
For example,
[Embed(source="song.mp3")]
var Song: Class;
var s: Song = new Song();
var ch: SoundChannel = s.play();
// how to check if ch is playing? | 0 | [
2,
2631,
100,
646,
10928,
25,
791,
646,
800,
3726,
3726,
184,
20,
2631,
13,
19003,
4801,
100,
21,
646,
10928,
25,
174,
791,
21,
646,
60,
26,
823,
15,
636,
1503,
4283,
5,
12097,
3726,
7,
8149,
9,
2554,
240,
7,
6,
500,
4033,
338... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
GUI beyond the WIMP Paradigm
===
*With the popularity of the Apple iPhone, the potential of the Microsoft [Surface][1], and the sheer fluidity and innovation of the interfaces pioneered by Jeff Han of [Perceptive Pixel][2] ...*
###What are good examples of Graphical User Interfaces which have evolved beyond the
###Windows, Icons, ( Mouse / Menu ), and Pointer paradigm ?
[1]: http://www.microsoft.com/surface/index.html
[2]: http://link.brightcove.com/services/link/bcpid713271701/bclid713073346/bctid709364416 | 0 | [
2,
9457,
1701,
14,
619,
8983,
20234,
800,
3726,
3726,
1637,
1410,
14,
5178,
16,
14,
4037,
21024,
15,
14,
2222,
16,
14,
7099,
636,
18830,
500,
2558,
165,
500,
15,
17,
14,
14694,
6250,
856,
17,
7666,
16,
14,
6573,
18,
18643,
34,
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... |
C# - How to get Program Files (x86) on Vista x64
===
I'm using:
FileInfo(System.Environment.GetFolderPath(System.Environment.SpecialFolder.ProgramFiles) + @"\MyInstalledApp"
In order to determine if a program is detected on a users machine (it's not ideal, but the program I'm looking for is a right old kludge of a MS-Dos application, and I couldn't think of another method).
On XP and 32-Bit versions of Vista this works fine. However, on x64 Vista the code returns the x64 Program Files folder, whereas the application is installed in Program Files x86. Is there a way to programatically return the path the path to Program Files x86 without hard wiring "C:\Program Files (x86)"? | 0 | [
2,
272,
5910,
13,
8,
184,
20,
164,
625,
6488,
13,
5,
396,
3274,
6,
27,
13520,
993,
3470,
800,
3726,
3726,
31,
22,
79,
568,
45,
3893,
108,
4120,
5,
10724,
9,
28976,
9,
3060,
8814,
106,
8353,
5,
10724,
9,
28976,
9,
11118,
8814,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 change java logging console output from std err to std out
===
I'm using the standard logger from java.util.logging and by default the console output is directed to the error stream (i.e. same as System.err.println). How do I change the console output to the output stream (i.e. same as System.out.println) | 0 | [
2,
184,
107,
31,
753,
8247,
13,
13919,
8650,
5196,
37,
354,
43,
13,
106,
139,
20,
354,
43,
70,
800,
3726,
3726,
31,
22,
79,
568,
14,
1236,
13,
29480,
37,
8247,
9,
14255,
9,
13919,
17,
34,
12838,
14,
8650,
5196,
25,
1012,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to push pixels faster on the iPhone?
===
I asked before about pixel-pushing, and have now managed to get far enough to get noise to show up on the screen. Here's how I init:
CGDataProviderRef provider;
bitmap = malloc(320*480*4);
provider = CGDataProviderCreateWithData(NULL, bitmap, 320*480*4, NULL);
CGColorSpaceRef colorSpaceRef;
colorSpaceRef = CGColorSpaceCreateDeviceRGB();
ir = CGImageCreate(
320,
480,
8,
32,
4 * 320,
colorSpaceRef,
kCGImageAlphaNoneSkipLast,
provider,
NULL,
NO,
kCGRenderingIntentDefault
);
Here's how I render each frame:
for (int i=0; i<320*480*4; i++) {
bitmap[i] = rand()%256;
}
CGRect rect = CGRectMake(0, 0, 320, 480);
CGContextDrawImage(context, rect, ir);
Problem is this is awfully awfully slow, around 5fps. I think my path to publish the buffer must be wrong. Is it even possible to do full-screen pixel-based graphics that I could update at 30fps, without using the 3D chip? | 0 | [
2,
184,
20,
3250,
18146,
18,
4233,
27,
14,
21024,
60,
800,
3726,
3726,
31,
411,
115,
88,
18146,
8,
26973,
68,
15,
17,
57,
130,
1471,
20,
164,
463,
511,
20,
164,
3406,
20,
298,
71,
27,
14,
2324,
9,
235,
22,
18,
184,
31,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I get notified when the user finishes editing a cell in an NSTableView?
===
I need to know when the user finishes editing a cell in an NSTableView. The table contains all of the user's calendars (obtained from the CalCalendarStore), so in order for the user's changes to be saved I need to inform the CalCalendarStore of the changes. However, I can't find anything that gets called after the user finishes their editing - I would guess that there would be a method in the table's delegate, but I only saw one that gets called when editing starts, not when editing ends. | 0 | [
2,
184,
92,
31,
164,
22904,
76,
14,
4155,
13625,
9510,
21,
1667,
19,
40,
13,
2172,
5924,
4725,
60,
800,
3726,
3726,
31,
376,
20,
143,
76,
14,
4155,
13625,
9510,
21,
1667,
19,
40,
13,
2172,
5924,
4725,
9,
14,
859,
1588,
65,
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... |
Applicaton design for processing data prior to database
===
I have a large collection of data in an excel file (and csv files). The data needs to be placed into a database (mysql). However, before it goes into the database it needs to be processed..for example if columns 1 is less than column 3 add 4 to column 2. There are quite a few rules that must be followed before the information is persisted.
What would be a good design to follow to accomplish this task? (using java)
**Additional notes**
The process needs to be automated. In the sense that I don't have to manually go in and alter the data. We're talking about thousands of lines of data with 15 columns of information per line.
Currently, I have a sort of chain of responsibility design set up. One class(Java) for each rule. When one rule is done, it calls the following rule.
| 0 | [
2,
4865,
16904,
444,
704,
26,
5511,
1054,
1313,
20,
6018,
800,
3726,
3726,
31,
57,
21,
370,
1206,
16,
1054,
19,
40,
20700,
3893,
13,
5,
290,
272,
18,
710,
6488,
6,
9,
14,
1054,
2274,
20,
44,
1037,
77,
21,
6018,
13,
5,
915,
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... |
Which is "better", COM DLL or Standard DLL with a Typelib?
===
I put "better" in quotes because it's a qualitative question. I've been writing COM DLLs for a couple of years now and have only recently come upon, and successfully used, the standard DLL with Typelib concept.
Are there any compelling reasons to use COM DLLs instead of DLL+Typelib? Granted, you can't do DCOM with a DLL+Typelib, but is that the only reason? | 0 | [
2,
56,
25,
13,
7,
16252,
7,
15,
13,
960,
13,
43,
211,
54,
1236,
13,
43,
211,
29,
21,
1001,
8326,
60,
800,
3726,
3726,
31,
442,
13,
7,
16252,
7,
19,
18901,
185,
32,
22,
18,
21,
27819,
1301,
9,
31,
22,
195,
74,
1174,
13,
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... |
Passing data between business layer and data access layer - bad code?
===
I'm using the following code within the JCProperty class to retrieve data from a DAL:
Dim x As JCProperty
x = JCPropertyDB.GetProperty(PropertyID)
If Not x Is Nothing Then
Me.PropertyID = x.PropertyID
Me.AddressLine1 = x.AddressLine1
Me.AddressLine2 = x.AddressLine2
Me.AddressLine3 = x.AddressLine3
Me.AddressCity = x.AddressCity
Me.AddressCounty = x.AddressCounty
Me.AddressPostcode = x.AddressPostcode
Me.TelNo = x.TelNo
Me.UpdatedOn = x.UpdatedOn
Me.CreatedOn = x.CreatedOn
Me.Description = x.Description
Me.GUID = x.GUID
End If
This works fine but requires that the DAL object (JCPropertyDB) is aware of the business object (JCProperty) and I effectively create and populate the same object twice (once in the DAL to return to the BL and then again within the BL object to populate itself).
I'm missing something here, I know there must be a better way!
Effectively I need to assign 'Me = x' which is not allowed. Can someone put me straight?
| 0 | [
2,
2848,
1054,
128,
508,
5385,
17,
1054,
1381,
5385,
13,
8,
896,
1797,
60,
800,
3726,
3726,
31,
22,
79,
568,
14,
249,
1797,
363,
14,
13,
15864,
10890,
106,
1084,
718,
20,
11917,
1054,
37,
21,
6868,
45,
5937,
993,
28,
13,
15864,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are bought in thirdparty libraries cost/time effective?
===
I've recently been working on a C# GUI. We used a third party graphical controls library (that I won't name). Some of my peers seemed to really like this library and got all excited with "hey look its got a control looks flashy, let's use that on this screen", My experience was that we compromised the usability of our GUI to put some flashy controls in it. And, I also found many of the controls limiting. They'd nearly do what I wanted, but not quite, so there would always be a compromise.
Some parts of the library just had unacceptably poor performance, and we had to write our own versions of these features. In other places where bugs were encountered, we had to wait long turn-around times to get fixes from the suppliers.
I've got a feeling that the expense of buying this library in wasn't worth it and that it didn't improve our development time or product quality.
Do you have any information, preferably quantifiable facts, on the successes/failings of buying in software libraries so that we can be more informed about deciding if we should buy in libraries for future projects? | 0 | [
2,
50,
2448,
19,
422,
9635,
8649,
1516,
118,
891,
3140,
60,
800,
3726,
3726,
31,
22,
195,
1989,
74,
638,
27,
21,
272,
5910,
9457,
9,
95,
147,
21,
422,
346,
21755,
8671,
1248,
13,
5,
887,
31,
230,
22,
38,
204,
6,
9,
109,
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... |
What's the right tier to obtain directory attributes for display?
===
I have an intranet application that needs contact information for various locations on our campus that are served by our IT lab support organization. We have an enterprise directory that contains contact information so I'm not keeping the actual contact information in the database, but rather an immutable identifier that serves as a key to look the person up in our enterprise directory (via a web service). Since we also have web-based directory lookup service, I'm planning to use that until the customer decides that it's more important to access the information directly in the application. The way it will work is I'll construct a like with the text being the lookup identifier that is most suited to the lookup service so that the user can click on the id and pull up a web page with the details. Its a public site so I don't need to worry about authentication to it.
The problem comes in that the id that is useful to the web-based directory lookup is only "mostly" immutable and is not the id that I will store in the database. Directory lookups are most easily performed using the person's Active Directory login id. Generally these do not change once a person has used it for awhile, but they can and do change with some regularity as people get married, etc. and want an id that matches their new name. The id I will be using is a DB key from another database, called the Master Records Unique ID (or MRUID).
My question is: where is the most reasonable place to do the translation from MRUID to Hawk ID for the link.
Right now I'm doing the translation in the presentation layer as the page is rendered by putting an OnRender callback on the control to which the column holding the MRUID is bound. I have a helper class that does that looks the MRUID up in a local cache and translates the MRUID to a Hawk ID. Where necessary (for readonly display) it also constructs the links to the external directory lookup site. On a cache miss or expiration, the cache is responsible for looking the id up via the web service.
Right now there is only a single web site, but I would expect that if there are other web sites that need to do this, I would migrate the helper class to a shared web controls library.
I considered putting the code in the data or business layer, but opted not to because of the caching. How and what you cache seems to be more a function of the application rather than these other layers.
I'd be interested in other opinions and ideas that I may not have considered. | 0 | [
2,
98,
22,
18,
14,
193,
7197,
20,
5545,
16755,
13422,
26,
3042,
60,
800,
3726,
3726,
31,
57,
40,
14369,
2328,
3010,
30,
2274,
2203,
676,
26,
617,
4095,
27,
318,
2071,
30,
50,
423,
34,
318,
32,
4343,
555,
1165,
9,
95,
57,
40,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 key combination in XCode to implement a Protocol?
===
In Visual Studio if I define a class to implement an interface e.g.
class MyObject : ISerializable {}
I am able to right click on ISerializable, select "*Implement Interface*" from the context menu and see the appropriate methods appear in my class definition.
class MyObject : ISerializable {
#region ISerializable Members
public void GetObjectData(SerializationInfo info,
StreamingContext context)
{
throw new NotImplementedException();
}
#endregion
}
Is there anything anything like this functionality available in XCode on the Mac? I would like to be able to automatically implement Protocols in this way. Maybe with the optional methods generated but commented out. | 0 | [
2,
25,
80,
21,
1246,
3733,
19,
993,
9375,
20,
8713,
21,
8494,
60,
800,
3726,
3726,
19,
3458,
1120,
100,
31,
9267,
21,
718,
20,
8713,
40,
6573,
13,
62,
9,
263,
9,
718,
51,
23793,
13,
45,
25,
106,
2815,
3186,
579,
13,
1,
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... |
Storing contents of multidimensional character array in array of strings in C#
===
I have a 2 dimensional array, like so:
char[,] str = new char[2,50];
Now, after I've stored contents in both str[0] and str[1], how do I store it in a
string[] s = new string[2];
?
I tried
s[0] = str[0].ToString();
but that seems to be an error: VC# expects 'two' indices within the braces, which means I can convert only a character from the array. Is there a way to convert the entire str[0] to a string? Or is changing it to a jagged array the only solution? | 0 | [
2,
25615,
8478,
16,
1889,
7865,
925,
7718,
19,
7718,
16,
7887,
19,
272,
5910,
800,
3726,
3726,
31,
57,
21,
172,
13,
7865,
7718,
15,
101,
86,
45,
4892,
2558,
15,
500,
13,
9729,
800,
78,
4892,
2558,
135,
15,
2290,
12660,
130,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
RAII in Java... is resource disposal always so ugly ? (was: I had a dream ?)
===
I just played with Java file system API, and came down with the following function, used to copy binary files. The original source came from the Web, but I added try/catch/finally clauses to be sure that, should something wrong happen, the Buffer Streams would be closed (and thus, my OS ressources freed) before quiting the function.
I trimmed down the function to show the pattern:
public static void copyFile(FileOutputStream oDStream, FileInputStream oSStream) throw etc...
{
BufferedInputStream oSBuffer = new BufferedInputStream(oSStream, 4096);
BufferedOutputStream oDBuffer = new BufferedOutputStream(oDStream, 4096);
try
{
try
{
int c;
while((c = oSBuffer.read()) != -1) // could throw a IOException
{
oDBuffer.write(c); // could throw a IOException
}
}
finally
{
oDBuffer.close(); // could throw a IOException
}
}
finally
{
oSBuffer.close(); // could throw a IOException
}
}
As far as I understand it, I cannot put the two "close()" in the finally clause because the first "close()" could well throw, and then, the second would not be executed.
I know C# has the *Dispose* pattern that would have handled this with the using keyword.
I even know better a C++ code would have been something like (using a Java-like API):
void copyFile(FileOutputStream & oDStream, FileInputStream & oSStream)
{
BufferedInputStream oSBuffer(oSStream, 4096);
BufferedOutputStream oDBuffer(oDStream, 4096);
int c;
while((c = oSBuffer.read()) != -1) // could throw a IOException
{
oDBuffer.write(c); // could throw a IOException
}
// I don't care about resources, as RAII handle them for me
}
I am missing something, or do I really have to produce ugly and bloated code in Java just to handle exceptions in the close() method of a Buffered Stream?
(Please, tell me I'm wrong somewhere...)
| 0 | [
2,
6623,
49,
19,
8247,
9,
9,
9,
25,
6577,
13497,
550,
86,
9212,
13,
60,
13,
5,
4149,
45,
31,
41,
21,
1868,
13,
60,
6,
800,
3726,
3726,
31,
114,
257,
29,
8247,
3893,
329,
21,
2159,
15,
17,
281,
125,
29,
14,
249,
1990,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Data recovery mechanics
===
I've been using some data recovery tools like [Diskinternals Uneraser][1]. I've been wondering how we can recover *things* on a hard drive programmatically?
Is there specific disc access mechanics, patterns, API to use? Is it something I can do in C#?
[1]: http://www.diskinternals.com/products/deleted-data-recovery/ | 0 | [
2,
1054,
6550,
9701,
800,
3726,
3726,
31,
22,
195,
74,
568,
109,
1054,
6550,
4672,
101,
636,
2906,
1767,
8766,
192,
18,
367,
2615,
4104,
500,
2558,
165,
500,
9,
31,
22,
195,
74,
5712,
184,
95,
92,
7635,
1637,
22309,
2483,
27,
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... |
Option Strict and Option Infer
===
In a [related question][1], my team is about to (hopefully) start using LINQ, and I'd like to take advantage of anonymous types. What is the best way to mix VB.NET's Option Strict (which we've been using through the life of the project) and the new Option Infer directives?
[1]: http://stackoverflow.com/questions/194272 | 0 | [
2,
4255,
8170,
17,
4255,
19,
2407,
800,
3726,
3726,
19,
21,
636,
6203,
1301,
500,
2558,
165,
500,
15,
51,
173,
25,
88,
20,
13,
5,
18930,
5655,
6,
799,
568,
6294,
1251,
15,
17,
31,
22,
43,
101,
20,
247,
3314,
16,
10364,
2551,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Recommended data format for describing the rules of chess
===
I'm going to be writing a chess server and one or more clients for chess and I want to describe the rules of chess (e.g. allowable moves based on game state, rules for when a game is complete) in a programming language independant way. This is a bit tricky since some of the chess rules (e.g. King Castling, en passent, draws based on 3 or more repeated moves) are based not only on the board layout but also on the history of moves.
I would prefer the format to be:
- textual
- human readable
- based on a standard (e.g. YAML, XML)
- easily parsable in a variety of languages
But I am willing to sacrifice any of these for a suitable solution.
My main question is: How can I build algorithms of such a complexity that operate on such complex state from a data format?
A followup queston is: Can you provide an example of a similar problem solved in a similar manner that can act as a starting point?
| 0 | [
2,
5773,
1054,
2595,
26,
7153,
14,
1761,
16,
6168,
800,
3726,
3726,
31,
22,
79,
228,
20,
44,
1174,
21,
6168,
8128,
17,
53,
54,
91,
7421,
26,
6168,
17,
31,
259,
20,
4996,
14,
1761,
16,
6168,
13,
5,
62,
9,
263,
9,
1655,
579,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Logging, when and what ? ?
===
I am currently working on a rather large multi tiered app that will be deployed overseas. Although I hope it won't fall over or blow up once depolyed I can't be 100% sure of this. Therefore it would be nice to know that I could request the log file, to work out exactly what went wrong and why.
So basically as the title suggests I would like to know when and what to log? I would like to know this to ensure I have comprehensive log files that can be examined easily to determine what has happened if my app falls over. | 0 | [
2,
13,
13919,
15,
76,
17,
98,
13,
60,
13,
60,
800,
3726,
3726,
31,
589,
871,
638,
27,
21,
864,
370,
1889,
7197,
69,
4865,
30,
129,
44,
6698,
6108,
9,
419,
31,
1376,
32,
230,
22,
38,
1080,
84,
54,
4459,
71,
382,
121,
17108,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best way to write [0..100] in C#?
===
I'm trying to think of clever, clear, and simple ways to write code that describes the sequence of integers in a given range.
Here's an example:
IEnumerable<int> EnumerateIntegerRange(int from, int to)
{
for (int i = from; i <= to; i++)
{
yield return i;
}
}
| 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
2757,
636,
387,
9,
9,
4031,
500,
19,
272,
5910,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
277,
16,
11994,
15,
1207,
15,
17,
1935,
2847,
20,
2757,
1797,
30,
4359,
14,
4030,
16,
13820,
18,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
iPhone to iPhone communication
===
I'm kind of curious how I should approach a problem with iPhones and communication between two phones.
I have an idea for an application that needs to send data between two known phones. The problem is that the data could be very small or very large. I want to have intermediate storage on a server and a messaging layer, but I want there to be performant means to communicate between devices for shorter, unimportant messages.
You always hear about networking and client to client communication with popular platforms and protocols, but I'm curious what people's thoughts are on doing p2p style communication with an iPhone.
I'm pretty sure it should (and can) be treated as just a simple addressable machine... so I would have to build NAT traversing network code into the iPhone itself. A thought I had would be some sort of UPnP situation where I would ask to NAT a particular port for communication to the devices... but I guess I could just as easily turn it into a polling situation.
Granted, I understand that Apple will have a "push" mechanism for developers eventually but I want to get the app out the door before hand...
Just curious about thoughts on this type of thing... any thoughts on multi-player game situations would also directly apply to (and benefit from) this question. | 0 | [
2,
21024,
20,
21024,
3291,
800,
3726,
3726,
31,
22,
79,
825,
16,
7686,
184,
31,
378,
2141,
21,
1448,
29,
21024,
18,
17,
3291,
128,
81,
14830,
9,
31,
57,
40,
882,
26,
40,
3010,
30,
2274,
20,
2660,
1054,
128,
81,
167,
14830,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to do memory profiling on remote java web application
===
I know we can use tools like JProfiler etc.
Is there any tutorial on how to configure it to display the memory usage just by remote monitoring?
Any idea? | 0 | [
2,
184,
20,
107,
1912,
8721,
49,
802,
27,
5388,
8247,
2741,
3010,
800,
3726,
3726,
31,
143,
95,
92,
275,
4672,
101,
487,
14503,
139,
2722,
9,
25,
80,
186,
29724,
27,
184,
20,
1065,
15951,
32,
20,
3042,
14,
1912,
7514,
114,
34,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Adding a method to a domain class
===
I have a domain class containing a couple of fields. I can access them from my .gsps. I want to add a method to the domain class, which I can call from the .gsps (this method is a kind of virtual field; it's data is not coming directly from the database).
How do I add the method and how can I then call it from the .gsps? | 0 | [
2,
4721,
21,
2109,
20,
21,
4603,
718,
800,
3726,
3726,
31,
57,
21,
4603,
718,
3503,
21,
1335,
16,
2861,
9,
31,
92,
1381,
105,
37,
51,
13,
9,
5447,
1919,
9,
31,
259,
20,
3547,
21,
2109,
20,
14,
4603,
718,
15,
56,
31,
92,
64... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Python Code Organization Question : Eggs + Packages + Buildout + Unit Tests + SVN
===
Like http://stackoverflow.com/questions/61151/where-do-the-python-unit-tests-go I'm trying to figure out where to put my Python Unit Tests.
But I have a couple of other requirements.
I have several python projects that share common modules. Until now, I've been ... ahem ... keeping multiple copies of the common code and synchronizing by hand. But I'd clearly prefer to do something else.
It looks to me now, as if zc.Buildout maybe what I need. I guess that what I should be doing is putting each reusable component of my system into a separate egg, and then using buildout to assemble them into projects.
I'm also thinking that for any particular module, I should put the unit-tests into a separate package or egg, so that I'm not also installing copies of the component's unit-tests in every project. I only want to unit-test in a place where my library is developed, not where it's just being used.
So maybe I want something like this
projects
lib1
tests
code
lib2
tests
code
app1
tests
appcode
app2
tests
appcode
etc.
Where both app1 and app2 are independent applications with their own code and tests, but are also including and using both lib1 and lib2. And lib1/test, lib1/code, lib2/test, lib2code, app1, app2 are separate eggs. Does this sound right?
However, I now get confused. I assume that when I develop app1, I want buildout to pull copies of lib1, lib2 and app1 into a separate working directory rather than put copies of these libraries under app1 directly. But how does this work with my SVN source-control? If the working directory is dynamically constructed with buildout, it can't be a live SVN directory from which I can check the changes back into the repository?
Have I misunderstood how buildout is meant to be used? Would I be better going for a completely different approach? How do you mix source-control with module-reuse between projects?
| 0 | [
2,
20059,
1797,
1165,
1301,
13,
45,
5821,
2754,
16875,
2754,
1895,
1320,
2754,
1237,
4894,
2754,
13,
18,
16578,
800,
3726,
3726,
101,
7775,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
4821,
15533,
118,
2798,
8,
537,
8,
124... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MySQL missing a root account
===
For some reason beyond me there seems to be no root account in the mysql user table. I'm looking at an untouched MT (dv) server with CentOS 5. Any ideas on how to get the root going? | 0 | [
2,
51,
18,
22402,
2863,
21,
5900,
2176,
800,
3726,
3726,
26,
109,
1215,
1701,
55,
80,
2206,
20,
44,
90,
5900,
2176,
19,
14,
51,
18,
22402,
4155,
859,
9,
31,
22,
79,
699,
35,
40,
24059,
8651,
13,
5,
17905,
6,
8128,
29,
5802,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Force iframe to Load Full Frame
===
I have an HTML page (say welcome.html) which contains an iframe to a page I have no control over (say app.html). The user performs some actions using the app within the iframe and clicks submit. Once they do this, they are taken to a new page (say thanks.jsp), which loads within the iframe. Is there a way in which I can force thanks.jsp to load in the full frame and not the iframe once submit is clicked? Remember, I have no control over the logic behind that Submit button or app.html. I do however have control over welcome.html and thanks.jsp. If possible, I would like to stick with HTML and/or JavaScript. Thank you in advance. | 0 | [
2,
558,
31,
8361,
20,
6305,
503,
3523,
800,
3726,
3726,
31,
57,
40,
13,
15895,
2478,
13,
5,
6366,
5575,
9,
15895,
6,
56,
1588,
40,
31,
8361,
20,
21,
2478,
31,
57,
90,
569,
84,
13,
5,
6366,
4865,
9,
15895,
6,
9,
14,
4155,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the proper way to store app's conf data in Java?
===
where do you store *user-specific* and *machine-specific* configuration data for J2SE application?
How do you get these locations in the filesystem in platform-independent way? | 0 | [
2,
98,
25,
14,
4119,
161,
20,
1718,
4865,
22,
18,
13,
14093,
1054,
19,
8247,
60,
800,
3726,
3726,
113,
107,
42,
1718,
1637,
16704,
8,
9219,
2483,
17,
1637,
20442,
8,
9219,
2483,
8091,
1054,
26,
487,
135,
870,
3010,
60,
184,
107,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... |
Oracle recommendations for high volume writes and low volume read.
===
Is there some general guidelines online on how to tweak oracle for doing a high number of inserts and low number of reads? | 0 | [
2,
15759,
12121,
26,
183,
2310,
6215,
17,
708,
2310,
1302,
9,
800,
3726,
3726,
25,
80,
109,
297,
12629,
2087,
27,
184,
20,
28769,
15759,
26,
845,
21,
183,
234,
16,
14692,
18,
17,
708,
234,
16,
11137,
60,
3,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What are some recommended plugins for Trac?
===
In particular, I need a more full fledged version of Trac to support robust project management, and task tracking. I went through the plugins and literally found over 50 that looked promising.
But, my question is to the admins/users of Trac: which ones are indespensible for making Trac feature complete?
Also, which ones should be avoided (e.g. stability issues)?
Thanks.
| 0 | [
2,
98,
50,
109,
5773,
10922,
108,
18,
26,
13,
38,
5797,
60,
800,
3726,
3726,
19,
1498,
15,
31,
376,
21,
91,
503,
13,
27398,
615,
16,
13,
38,
5797,
20,
555,
15313,
669,
1097,
15,
17,
3005,
10353,
9,
31,
296,
120,
14,
10922,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
what is the difference between using the visitor design pattern or using an interface ?
===
What is the difference between applying the visitor design pattern to your code , and code like the following :
interface Dointerface {
public void perform(Object o);
}
public class T {
private Dointerface d;
private String s;
public String getS() {
return s;
}
public T(String s) {
this.s = s;
}
public void setInterface(Dointerface d) {
this.d = d;
}
public void perform() {
d.perform(this);
}
public static void main(String[] args) {
T t = new T("Geonline");
t.setInterface(new Dointerface() {
public void perform(Object o) {
T a = (T)o;
System.out.println(a.getS());
}
});
t.perform();
}
}
I assume that by using interfaces , we're not really separating the algorithm.
| 0 | [
2,
98,
25,
14,
2841,
128,
568,
14,
10875,
704,
3732,
54,
568,
40,
6573,
13,
60,
800,
3726,
3726,
98,
25,
14,
2841,
128,
11989,
14,
10875,
704,
3732,
20,
154,
1797,
13,
15,
17,
1797,
101,
14,
249,
13,
45,
6573,
107,
6280,
6413,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 determine MS Access field size via OleDb
===
The existing application is in C#. During startup the application calls a virtual method to make changes to the database (for example a new revision may need to calculate a new field or something). An open OleDb connection is passed into the method.
I need to change a field width. The ALTER TABLE statement is working fine. But I would like to avoid executing the ALTER TABLE statement if the field is already the appropriate size. Is there a way to determine the size of an MS Access field using the same OleDb connection? | 0 | [
2,
184,
20,
3746,
4235,
1381,
575,
1072,
1197,
12116,
9007,
800,
3726,
3726,
14,
3149,
3010,
25,
19,
272,
5910,
9,
112,
20205,
14,
3010,
3029,
21,
6599,
2109,
20,
233,
1693,
20,
14,
6018,
13,
5,
1106,
823,
21,
78,
11323,
123,
37... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 discover what is in the permanent generation
===
Given a heapdump or a running VM, how do I discover what the contents of the permanent generation is ? I know about 'jmap -permstat' but that's not available on Windows. | 0 | [
2,
184,
107,
31,
6297,
98,
25,
19,
14,
3032,
2782,
800,
3726,
3726,
504,
21,
15414,
43,
11134,
54,
21,
946,
13,
20147,
15,
184,
107,
31,
6297,
98,
14,
8478,
16,
14,
3032,
2782,
25,
13,
60,
31,
143,
88,
13,
22,
728,
15022,
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,
0,
0... |
How to obfuscate javascript
===
I want to make a javascript application that's not open source and thus have two questions.
1) What's the best way to obfuscate the code
2) What's the best way to obfuscate the strings themselves within the application (assuming that the answer to #1 does not handle this). | 0 | [
2,
184,
20,
5122,
13735,
9530,
8247,
8741,
800,
3726,
3726,
31,
259,
20,
233,
21,
8247,
8741,
3010,
30,
22,
18,
52,
368,
1267,
17,
1086,
57,
81,
2346,
9,
137,
6,
98,
22,
18,
14,
246,
161,
20,
5122,
13735,
9530,
14,
1797,
172,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Resources for Windows developer to switch to Linux
===
I'm looking for some help and it goes like this:
I'm a fairly green software developer, and focus mainly on the web (python/PHP) but am pretty well experienced with Java applications and as an electrical engineering student, looking forward to dive into some c/c++. I've pretty much grown up on Windows machine, but hate .net with a passion and dont really have a need to develop on Windows - besides the fact that i'm used to it.
I'm looking to switch to Ubuntu as my development machine entirely (without having WinXP on another partition) as I'm quite fedup with Windows, but am tempted to go back to it everytime i'm stuck with countless driver issues (be it headphone drivers, or dual monitor setup, etc). I'm looking for a comprehensive resource that will help this transition and doesn't assume you know alien linux shell keywords.
Cheers. | 0 | [
2,
2566,
26,
1936,
10058,
20,
5521,
20,
13024,
800,
3726,
3726,
31,
22,
79,
699,
26,
109,
448,
17,
32,
1852,
101,
48,
45,
31,
22,
79,
21,
6647,
647,
2306,
10058,
15,
17,
1776,
2011,
27,
14,
2741,
13,
5,
6448,
11570,
118,
26120... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 release the memory that has been used for a variable in C?
===
How can i release the memory that I used for a variable (e.g. a long string) in C? | 0 | [
2,
184,
20,
830,
14,
1912,
30,
63,
74,
147,
26,
21,
7612,
19,
272,
60,
800,
3726,
3726,
184,
92,
31,
830,
14,
1912,
30,
31,
147,
26,
21,
7612,
13,
5,
62,
9,
263,
9,
21,
175,
3724,
6,
19,
272,
60,
3,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I properly store and retrieve internationalized Strings in properties files?
===
I'm experimenting with internationalization by making a Hello World program that uses properties files + ResourceBundle to get different strings.
Specifically, I have a file "messages\_en\_US.properties" that stores "hello.world=Hello World!", which works fine of course.
I then have a file "messages\_ja\_JP.properties" which I've tried all sorts of things with, but it always appears as some type of garbled string when printed to the console or in Swing. The problem is obviously with the reading of the content into a Java string, as a Java string in Japanese typed directly into the source can print fine.
Things I've tried:
- The .properties file in UTF-8 encoding with the Japanese string as-is for the value. Something I read indicates that Java expects a properties file to be in the native encoding of the system...? It didn't work either way.
- The file in default encoding (ISO-8859-1) and the value stored as escaped Unicode created by the native2ascii program included with Java. Tried with a source file in various Japanese encodings... SHIFT-JIS, EUC-JP, ISO-2022-JP.
**Edit:**
I actually figured this out while I was typing this, but I figured I'd post it anyway and answer it in case it helps anyone. | 0 | [
2,
184,
107,
31,
7428,
1718,
17,
11917,
294,
1333,
7887,
19,
3704,
6488,
60,
800,
3726,
3726,
31,
22,
79,
5737,
68,
29,
294,
1829,
34,
544,
21,
10975,
126,
625,
30,
2027,
3704,
6488,
2754,
6577,
9930,
413,
20,
164,
421,
7887,
9,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you run a console app in the visual studio output window, instead of opening a new command prompt?
===
I'm developing a simple console app in visual studio 2008 and want to run it in the output window inside visual studio 2008, instead of having a separate command prompt window come up. Is there a way to do this? | 0 | [
2,
184,
107,
42,
485,
21,
8650,
4865,
19,
14,
3458,
1120,
5196,
1463,
15,
700,
16,
1214,
21,
78,
1202,
11443,
4417,
60,
800,
3726,
3726,
31,
22,
79,
3561,
21,
1935,
8650,
4865,
19,
3458,
1120,
570,
17,
259,
20,
485,
32,
19,
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... |
Multi-segmented PalmOS app/library in "background"
===
the question I am having is: when running my app with a launch code other than sysAppLaunchCmdNormalLaunch, I can not use code outside the default code segment - but could I use a shared library that is multi-segmented, thus circumventing this problem?
A bit of background information: I am evaluating the possibility of porting an existing mobile application to PalmOS. A core part of this app is that it is doing some network communication in the background every 10 minutes or so, or when it receives incoming data (via a network/socket callback). During this time, I do not have access to globals and hence not to any code segments in my application other than the default one.
The problem now is that the actions involved in the communication (protocol, data handling, etc) require a lot of code that just does not fit into one segment. Apart from the question whether it makes sense to have that much code run in the 'background', the obvious problem is: how would I run it in the first place? Hence the question, whether putting the code in a shared (multi-segment) library would help.
Looking forward to your insights. | 0 | [
2,
1889,
8,
28857,
69,
3044,
759,
4865,
118,
1210,
2559,
622,
19,
13,
7,
1958,
8810,
7,
800,
3726,
3726,
14,
1301,
31,
589,
452,
25,
45,
76,
946,
51,
4865,
29,
21,
3394,
1797,
89,
119,
10315,
18,
7753,
18494,
9095,
43,
17462,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Have you ever crashed the compiler?
===
Everyone (at least everyone who uses a compiled language) has faced compilation errors but how many times do you get to actually crash the compiler?
I've had my fair share of **"internal compiler errors"** but most went away just by re-compiling. Do you have a (minimal) piece of code that crashes the compiler? | 0 | [
2,
57,
42,
462,
7579,
14,
21486,
60,
800,
3726,
3726,
1266,
13,
5,
721,
639,
1266,
72,
2027,
21,
9316,
816,
6,
63,
3110,
4868,
11908,
47,
184,
151,
436,
107,
42,
164,
20,
1121,
4597,
14,
21486,
60,
31,
22,
195,
41,
51,
1768,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 parse a string to an int in C++?
===
What's the C++ way of parsing a string (given as char *) into an int? Robust and clear error handling is a plus (instead of [returning zero][1]).
[1]: http://www.cplusplus.com/reference/clibrary/cstdlib/atoi.html | 0 | [
2,
184,
20,
2017,
870,
21,
3724,
20,
40,
19,
38,
19,
272,
20512,
60,
800,
3726,
3726,
98,
22,
18,
14,
272,
20512,
161,
16,
2017,
18,
68,
21,
3724,
13,
5,
8448,
103,
28,
4892,
1637,
6,
77,
40,
19,
38,
60,
15313,
17,
1207,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get a list of local Windows users?
===
I'm trying to write a faster user switching app for Windows. Win+L and selecting users is very cumbersome. If I start Task Manager as administrator, it shows active users and I can select one and "Connect" (if I enter their password).
How do I get the list of all users (or all active users)?
I'm using C# (Visual Studio Express).
| 0 | [
2,
184,
107,
31,
164,
21,
968,
16,
375,
1936,
3878,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
2757,
21,
4233,
4155,
13027,
4865,
26,
1936,
9,
628,
2430,
255,
17,
20764,
3878,
25,
253,
10611,
2102,
3220,
9,
100,
31,
799,
3005,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 strangest corner case you've seen in C# or .NET?
===
I collect a few corner cases and [brain teasers][1] and would always like to hear more. The page only really covers C# language bits and bobs, but I also find core .NET things interesting too. For example, here's one which isn't on the page, but which I find incredible:
string x = new string(new char[0]);
string y = new string(new char[0]);
Console.WriteLine(object.ReferenceEquals(x, y));
I'd expect that to print False - after all, "new" *always* creates a new object, doesn't it? Well, not in this particular case. It prints True, and has done on every version of the framework I've tested it with. (I haven't tried it on Mono, admittedly...)
Any similar gems lurking out there?
[1]: http://www.yoda.arachsys.com/csharp/teasers.html | 4 | [
2,
98,
22,
18,
14,
2578,
384,
1531,
610,
42,
22,
195,
541,
19,
272,
5910,
54,
13,
9,
2328,
60,
800,
3726,
3726,
31,
5543,
21,
310,
1531,
1871,
17,
636,
20128,
27410,
18,
500,
2558,
165,
500,
17,
83,
550,
101,
20,
990,
91,
9,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to create shared dylib and have it loaded at run time (using XCode)
===
I'm building few command-line utilities in XCode (plain C, no Cocoa). I want all of them to use my customized version of libpng, and I want to save space by sharing one copy of the library among all executables (I don't mind re-distributing `.dylib` with them).
I've created Dynamic Library project in XCode and it created liblibpng.dylib. However if I add this library to other projects' *"Link Binary With Libraries"* build phase, I still get undefined symbols (but only libpng's symbols don't work, zlib links fine).
Do I need to do some magic to get libpng export symbols?
Does *"Link Binary With Libraries"* build phase link statically? If so, how can I make executables link without static library and have it loaded at run time?
| 0 | [
2,
184,
20,
1600,
2592,
9841,
8326,
17,
57,
32,
8572,
35,
485,
85,
13,
5,
12655,
993,
9375,
6,
800,
3726,
3726,
31,
22,
79,
353,
310,
1202,
8,
1143,
19817,
19,
993,
9375,
13,
5,
9897,
108,
272,
15,
90,
24507,
6,
9,
31,
259,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 paralleize search for a string in a file with a help of fork? (GNU Linux/g++)
===
This is how the situation looks:
I got a text file with a couple of lines and I am looking for a string in this file. I need to pass following command line parameters to the program:
- file path
- the string I am looking for
- maximum number of processes the program is allowed to "fork" in order to complete this task.
How to such program should be constructed?
Thanks for your help. | 0 | [
2,
184,
20,
2258,
6696,
2952,
2122,
26,
21,
3724,
19,
21,
3893,
29,
21,
448,
16,
8777,
60,
13,
5,
263,
4215,
13024,
118,
263,
20512,
6,
800,
3726,
3726,
48,
25,
184,
14,
1858,
1879,
45,
31,
330,
21,
1854,
3893,
29,
21,
1335,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 discover an existing project?
===
recently I was given the task to discover a C# solution I have never seen before, and give suggestions on refactoring it. I think I will use NDepend (for the first time ever) to see the overall picture, and also to check a lot of code metrics to figure out what could be refactored. NDepend is pretty good at showing the structure of a project, I think.
My question is a more general one: what do you think is the best way to discover code that you are seeing the first time, and need to understand it's structure?
(Unfortunately there is no logical design documentation and the code is poorly commented.) | 0 | [
2,
98,
25,
14,
246,
161,
20,
6297,
40,
3149,
669,
60,
800,
3726,
3726,
1989,
31,
23,
504,
14,
3005,
20,
6297,
21,
272,
5910,
4295,
31,
57,
243,
541,
115,
15,
17,
590,
18389,
27,
302,
17455,
68,
32,
9,
31,
277,
31,
129,
275,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Creating standalone Lua executables
===
Is there an easy way to create standalone .exe files from Lua scripts? Basically this would involve linking the Lua interpreter and the scripts.
I believe it is possible (PLT Scheme allows the creation of standalone executables in the same way), but how, exactly? | 0 | [
2,
2936,
26986,
1612,
58,
1396,
17194,
5924,
18,
800,
3726,
3726,
25,
80,
40,
2010,
161,
20,
1600,
26986,
13,
9,
1706,
62,
6488,
37,
1612,
58,
17505,
60,
11374,
48,
83,
8847,
12585,
14,
1612,
58,
19336,
17,
14,
17505,
9,
31,
985... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Multiple deletions using LINQ (more specifically Linq2Nhibernate, but...)
===
Is there any smart way to do this?
If using Linq2Nhibernate, you really seem to have to rely on HQL or the likes to do multiple deletes from a database (without loading up and deleting one by one)?
It doesn't seem like Linq2Sql have it either? I just want something that can do stuff like:
DELETE FROM Accounts WHERE amount < 1000
Any ideas?
| 0 | [
2,
1886,
28916,
18,
568,
6294,
1251,
13,
5,
1995,
3524,
6294,
1251,
135,
13880,
15191,
8820,
15,
47,
9,
9,
9,
6,
800,
3726,
3726,
25,
80,
186,
3978,
161,
20,
107,
48,
60,
100,
568,
6294,
1251,
135,
13880,
15191,
8820,
15,
42,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
UDP and my computer?
===
I recently turned on Windows Firewall logging on my computer and started tracking incoming and outgoing connections. Something curious about the logfiles is that I have noticed numerous UDP packets (in fact, it constitutes basically all of my incoming traffic) that don't have my host as destination or source showing up in the logs.
I thought this might be a implementation detail for UDP (the packets are hopping over my computer in the subnet) but Wikipedia'ing UDP didn't enlighten me any more, and I don't see why my computer should be forwarding these packets in the first place.
Any ideas? | 0 | [
2,
287,
7431,
17,
51,
1428,
60,
800,
3726,
3726,
31,
1989,
412,
27,
1936,
535,
6051,
13,
13919,
27,
51,
1428,
17,
373,
10353,
17126,
17,
25193,
6760,
9,
301,
7686,
88,
14,
6738,
16877,
18,
25,
30,
31,
57,
2711,
1548,
287,
7431,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
LINQ asp.net page against MS Access . .
===
I have a ASP.Net page using ADO to query MS access database and as a learning exercise i would like to incorporate LINQ. I have one simple table called Quotes.
The fields are: QuoteID, QuoteDescription, QuoteAuthor, QuoteDate. I would like to run simple queries like, "Give me all quotes after 1995".
How would i incorporate LINQ into this ASP.Net site (C#) | 0 | [
2,
6294,
1251,
28,
306,
9,
2328,
2478,
149,
4235,
1381,
13,
9,
13,
9,
800,
3726,
3726,
31,
57,
21,
28,
306,
9,
2328,
2478,
568,
21,
537,
20,
25597,
4235,
1381,
6018,
17,
28,
21,
2477,
5935,
31,
83,
101,
20,
14710,
6294,
1251,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Dependency Injection frameworks for classes with many dependencies
===
I have been looking at various dependency injection frameworks for .NET as I feel the project I am working on would greatly benefit from it. While I think I have a good grasp of the *capabilities* of these frameworks, I am still a little unclear on how best to introduce them into a large system. Most demos (understandably) tend to be of quite simple classes that have one or two dependencies.
I have three questions...
**First**, how do you deal with those common but uninteresting dependencies, e.g. ILog, IApplicationSettings, IPermissions, IAudit. It seems overkill for every class to have these as parameters in their constructor. Would it be better to use a static instance of the DI container to get these when they are needed?
MyClass(ILog log, IAudit audit, IPermissions permissions, IApplicationSettings settings)
// ... versus ...
ILog log = DIContainer.Get<ILog>();
**Second**, how do you approach dependencies that *might* be used, but may be expensive to create. Example - a class might have a dependency on an ICDBurner interface but not want the concrete implementation to be created unless the CD Burning feature was actually used. Do you pass in interfaces to factories (e.g. ICDBurnerFactory) in the constructor, or do you again go with some static way of getting directly to the DI Container and ask for it at the point it is needed?
**Third**, suppose you have a large Windows Forms application, in which the top level GUI component (e.g. MainForm) is the parent of potentially hundreds of sub-panels or modal forms, each of which may have several dependencies. Does this mean that MainForm should be set up to have as dependencies the superset of all the dependencies of its children? And if you did so, wouldn't this end up creating a huge self-inflating monster that constructs every single class it could ever need the moment you create MainForm, wasting time and memory in the process? | 0 | [
2,
568,
26835,
13646,
6596,
18,
26,
2684,
29,
151,
29411,
800,
3726,
3726,
31,
57,
74,
699,
35,
617,
26835,
13646,
6596,
18,
26,
13,
9,
2328,
28,
31,
583,
14,
669,
31,
589,
638,
27,
83,
5629,
4234,
37,
32,
9,
133,
31,
277,
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... |
How does one write good error messages?
===
While this is more of a written language issue than a coding one, it is something that programmers must do in circumstances where copy is not provided by a client or someone else. Any examples of error messages, good or bad, are welcome to make the point.
I briefly searched and could not find a dupe thread. Ok, have at it. Thanks, all. | 0 | [
2,
184,
630,
53,
2757,
254,
7019,
7561,
60,
800,
3726,
3726,
133,
48,
25,
91,
16,
21,
642,
816,
1513,
119,
21,
13,
15458,
53,
15,
32,
25,
301,
30,
17968,
18,
491,
107,
19,
5072,
113,
4344,
25,
52,
1173,
34,
21,
6819,
54,
737... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Class member organization
===
What is the best way to sort class members?
I'm in conflit with a team member about this. He suggests that we should sort the members alphabetically. I think it's better to organize in a semmantic manner: important attributes first, related methods together, etc.
What do you think? | 0 | [
2,
718,
322,
1165,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
2058,
718,
443,
60,
31,
22,
79,
19,
13,
14093,
6864,
29,
21,
173,
322,
88,
48,
9,
24,
5049,
30,
95,
378,
2058,
14,
443,
27169,
102,
9,
31,
277,
32,
22,
18,
574,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
For interviews, how do you gauge whether the candidate would be a good coworker?
===
As has been often stressed, people skills count for a lot in software development. While it's great to have smart and skilled coworkers, someone who communicates well and has the technical chops to contribute is invaluable to a project.
How do you gauge whether a candidate would be great to work with?
For me:
1) I look at how they explain their answers. Do they identify hidden assumptions as they answer their questions? Do they explain step-by-step how they get from their premises to the conclusions they want to draw? Are they humble enough to admit when there's more than one way to do it?
2) Direct questions that may be revealing about people skills. What was the most serious non-technical challenge have you addressed and how? Describe your dream job. If you had to pick a team for a feature set, how would you pick your team?
| 0 | [
2,
26,
7450,
15,
184,
107,
42,
7313,
1472,
14,
2316,
83,
44,
21,
254,
326,
22560,
60,
800,
3726,
3726,
28,
63,
74,
478,
14718,
15,
148,
3207,
2468,
26,
21,
865,
19,
2306,
522,
9,
133,
32,
22,
18,
374,
20,
57,
3978,
17,
11315... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Delphi for PHP
===
I just came across <a href="http://www.codegear.com/products/delphi/php">Delphi for PHP</a> and my immediate response was "oh, <i>no</i>", but I think maybe I was being too hasty. Has anyone tried it? What do you think? | 0 | [
2,
23030,
26,
13,
26120,
800,
3726,
3726,
31,
114,
281,
464,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
6483,
9,
9375,
834,
512,
9,
960,
118,
14086,
18,
118,
3436,
7805,
118,
26120,
7,
1,
3436,
7805,
26,
13,
26120,
1,
118,
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... |
Anyone out there used vinpower?
===
I have to implement the VinPower application. They offer a java version, a C dll and an active x dll, if anyone has an idea on where I could begin, i'd appreciate it.
| 0 | [
2,
1276,
70,
80,
147,
9730,
5484,
60,
800,
3726,
3726,
31,
57,
20,
8713,
14,
9730,
5484,
3010,
9,
59,
1994,
21,
8247,
615,
15,
21,
272,
13,
43,
211,
17,
40,
1348,
993,
13,
43,
211,
15,
100,
1276,
63,
40,
882,
27,
113,
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,
0,
0,
0,
0,
0,
0,
0... |
Inserting data in XML file with PHP DOM
===
I was trying to insert new data into an existing XML file, but it's not working. Here's my xml file:
<list>
<activity>swimming</activity>
<activity>running</activity>
<list>
Now, my idea was making two files: an index page, where it displays what's on the file and provides a field for inserting new elements, and a php page which will insert the data into the XML file. Here's the code for index.php:
<html>
<head><title>test</title></head>
</head>
<?php
$xmldoc = new DOMDocument();
$xmldoc->load('sample.xml', LIBXML_NOBLANKS);
$activities = = $xmldoc->firstChild->firstChild;
if($activities!=null){
while(activities!=null){
echo $activities->textContent.'<br/>';
activities = activities->nextSibling.
}
}
?>
<form name='input' action'insert.php' method='post'>
insert activity:
<input type='text' name='activity'/>
<input type='submit' value='send'/>
</form>
</body>
</html
and here's the code for insert.php:
<?php
header('Location:index.php');
$xmldoc = new DOMDocument();
$xmldoc->load('sample.xml');
$newAct = $_POST['activity'];
$root = $xmldoc->firstChild;
$newElement = $xmldoc->createElement('activity');
$root->appendChild($newElement);
$newText = $xmldoc->createTextNode($newActv);
$newElement->appendChild($newText);
$xmldoc->save('sample.xml');
?>
The user is to access index.php, where he would see a list of the current activities present in the XML file, and a text field below where he can insert new activities. Upon clicking the send button, the page would call insert.php, which contains a code that opens the XML file in a DOM tree, inserts a new node under the root node and calls back the index.php page, where the user should be able to see the list of activities, his new activity there under the others. It is not working. When i click on the button to submit a new entry, the pages refreshes and apparently nothing happens, the XML is the same as before. What did i do wrong? | 0 | [
2,
14692,
68,
1054,
19,
23504,
3893,
29,
13,
26120,
11859,
800,
3726,
3726,
31,
23,
749,
20,
14692,
78,
1054,
77,
40,
3149,
23504,
3893,
15,
47,
32,
22,
18,
52,
638,
9,
235,
22,
18,
51,
23504,
3893,
45,
13,
1,
5739,
1,
13,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to detect when a user has successfully finished downloading a file in php
===
I've got a php page which handles requets for file downloads. I need to be able to detect when a file has been downloaded successfully. How can this be done? Perhaps there's some means of detecting this client-side then sending a confirmation down to the server.
Thanks. | 0 | [
2,
184,
20,
9092,
76,
21,
4155,
63,
3673,
842,
7121,
68,
21,
3893,
19,
13,
26120,
800,
3726,
3726,
31,
22,
195,
330,
21,
13,
26120,
2478,
56,
3053,
18,
302,
9268,
18,
26,
3893,
7121,
18,
9,
31,
376,
20,
44,
777,
20,
9092,
76... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you write good PHP code without the use of a framework?
===
Other than standard OO concepts, what are some other strategies that allow for producing good, clean PHP code when a framework is not being used? | 0 | [
2,
184,
107,
42,
2757,
254,
13,
26120,
1797,
366,
14,
275,
16,
21,
6596,
60,
800,
3726,
3726,
89,
119,
1236,
13,
4328,
8700,
15,
98,
50,
109,
89,
10272,
30,
1655,
26,
4081,
254,
15,
2745,
13,
26120,
1797,
76,
21,
6596,
25,
52,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
control robot via internet
===
i have robot and want to control it via internet using radio wave .. but still i dont know the best language to do that . with the need to build scure site to insure not any body can use it . i expect for site asp with c# but what is the language i'll need it to control from sender device to the recipt robot . also need to live video transfer to the site from robot camera............
soory for bothering .....i know it may wrong but i'm beginner
and thanx for all who read or try to help me | 0 | [
2,
569,
8288,
1197,
2620,
800,
3726,
3726,
31,
57,
8288,
17,
259,
20,
569,
32,
1197,
2620,
568,
603,
2367,
13,
9,
9,
47,
174,
31,
1049,
143,
14,
246,
816,
20,
107,
30,
13,
9,
29,
14,
376,
20,
1895,
4729,
4221,
689,
20,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Looking for an open source Traveling Salesman function / library in c / c++?
===
I know there are a few different [Traveling Salesman][1] projects out there and I've played with [LKH][2] a bit, but I was wondering if anyone had any recommendations on any other ones?
My project is GPL'ed so I would need something that is compatible with that license.
![Input][3] ![Output][4]
[1]: http://en.wikipedia.org/wiki/Traveling_salesman_problem
[2]: http://www.akira.ruc.dk/~keld/research/LKH/
[3]: http://www.cs.sunysb.edu/~algorith/files/traveling-salesman-L.gif
[4]: http://www.cs.sunysb.edu/~algorith/files/traveling-salesman-R.gif | 0 | [
2,
699,
26,
40,
368,
1267,
6530,
20957,
1990,
13,
118,
1248,
19,
272,
13,
118,
272,
20512,
60,
800,
3726,
3726,
31,
143,
80,
50,
21,
310,
421,
636,
21629,
68,
20957,
500,
2558,
165,
500,
2314,
70,
80,
17,
31,
22,
195,
257,
29,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Distinguishing between HFS+ and HFS Standard Volumes
===
IOKit and the DiskArbitration framework can tell me a lot
of things about mounted volumes on a mac, but they don't seem
to be able to differentiate between HFS+ and HFS Standard volumes.
The IOKit/DA keys `Content`, `DAVolumeKind` and `DAMediaContent`
are always Apple_HFS and hfs for both HFS Standard and HFS+ volumes.
diskutil and DiskUtility.app _can_ tell the difference, but I they
don't seem to have been open sourced by Apple.
p.s. statfs (2) does not differentiate | 0 | [
2,
23973,
128,
13,
18526,
18,
2430,
17,
13,
18526,
18,
1236,
6127,
800,
3726,
3726,
31,
13826,
38,
17,
14,
8582,
25267,
857,
6596,
92,
494,
55,
21,
865,
16,
564,
88,
4897,
6127,
27,
21,
1572,
15,
47,
59,
221,
22,
38,
2260,
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... |
2D Javascript array
===
Simply put, is there a way to create a 2D javascript array using similar syntax to this?
var newArray = [
[0, 1, 2],
[3, 4, 5],
[6, 7, 8]
]
| 0 | [
2,
172,
43,
8247,
8741,
7718,
800,
3726,
3726,
1659,
442,
15,
25,
80,
21,
161,
20,
1600,
21,
172,
43,
8247,
8741,
7718,
568,
835,
22649,
20,
48,
60,
4033,
78,
8576,
93,
800,
636,
636,
387,
15,
137,
15,
172,
500,
15,
636,
240,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
MSSQL Regular expressions in T-SQL
===
Is there any regular expression library written in _T-SQL_ (no CLR, no extended sp, pure t-sql) for MSSQL?
(should work with shared hosting) | 0 | [
2,
4235,
18,
22402,
1290,
13832,
19,
13,
38,
8,
18,
22402,
800,
3726,
3726,
25,
80,
186,
1290,
1803,
1248,
642,
19,
13,
1,
38,
8,
18,
22402,
1,
13,
5,
251,
10842,
139,
15,
90,
1984,
3782,
15,
4267,
13,
38,
8,
18,
22402,
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,
0,
0,
0... |
I need my scaled image to be aliased in C#
===
This might be an odd question, but when I scale my image in C# I need it to be pixelated and not anti-aliased. Just like in MSpaint when you scale.
I hope images anti-alias by default in C#, or else I changed something I didn't want to.
I've tried playing around with the `Graphics.InterpolationMode` but no luck there. I'm using a Bitmap object to hold the image and it's being constructed like so:
// A custom control holds the image
this.m_ZoomPanPicBox.Image = new Bitmap(szImagePath);
And a brief synapsis of the custom control:
class ZoomPanPicBox : ScrollableControl
{
Image m_image;
float m_zoom = 1.0f;
InterpolationMode m_interpolationMode;
...
////////////////////////////////////////////////////////
public ZoomPanPicBox()
{
//Double buffer the control
this.SetStyle(ControlStyles.AllPaintingInWmPaint | ControlStyles.UserPaint | ControlStyles.ResizeRedraw | ControlStyles.UserPaint | ControlStyles.DoubleBuffer, true);
this.AutoScroll=true;
}
////////////////////////////////////////////////////////
protected override void OnPaint(PaintEventArgs e)
{
//if no image, don't bother
if(m_image==null)
{
base.OnPaintBackground(e);
return;
}
//Set up a zoom matrix
Matrix mx = new Matrix(m_zoom,0,0,m_zoom,0,0);
//now translate the matrix into position for the scrollbars
mx.Translate(this.AutoScrollPosition.X / m_zoom, this.AutoScrollPosition.Y / m_zoom);
//use the transform
e.Graphics.Transform = mx;
//and the desired interpolation mode
e.Graphics.InterpolationMode = m_interpolationMode;
//Draw the image ignoring the images resolution settings.
e.Graphics.DrawImage(m_image,new Rectangle(0,0,this.m_image.Width,this.m_image.Height),0,0,m_image.Width, m_image.Height,GraphicsUnit.Pixel);
base.OnPaint(e);
}
Any ideas? Thanks. | 0 | [
2,
31,
376,
51,
22960,
1961,
20,
44,
15794,
69,
19,
272,
5910,
800,
3726,
3726,
48,
530,
44,
40,
4210,
1301,
15,
47,
76,
31,
3464,
51,
1961,
19,
272,
5910,
31,
376,
32,
20,
44,
18146,
1669,
17,
52,
1082,
8,
10060,
18,
69,
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... |
Resolving Component libs with Flex SDK mxmlc
===
I'm new to Flex SDK and trying to implement a simple project using [Doug Mccune's CoverFlow][1] widget. Most of the documentation out there on how to do this assumes that one is using Adobe's FlexBuilder product, which is a $250 Eclipse plug-in that I'd rather avoid buying. The problem I'm having is simply getting Doug's swc file, which is the binary version of his component lib, to be recognized by mxmlc, the Flex SDK project compiler. I keep getting error messages such as
> Error: Could not resolve <local:CoverFlow> to a component installation
and
> Error: Type was not found or was not a compile-time constant: CoverFlow.
I have also tried the type "VideoCoverFlow" as I am pretty sure that these types are defined in Doug's lib. Alas, I am stuck on figuring out where I've gone wrong.
The following is the full text for my mxml project file, called coverflow.mxml.
<?xml version="1.0" encoding="utf-8"?>
<mx:Application
xmlns:mx="http://www.adobe.com/2006/mxml"
xmlns:local="*"
height="100%"
width="100%"
layout="absolute">
<local:CoverFlow
id="CoverFlow"
horizontalCenter="0"
verticalCenter="0"
borderThickness="10"
borderColor="#FFFFFF"
width="100%"/>
</mx:Application>
I am trying to compile it with the following command:
c:\flex_sdk_3\bin\mxmlc.exe -compiler.source-path=lib coverflow.mxml
I have also tried moving the CoverFlow_lib.swc file into the same dir as the mxml file instead of using the source-path argument, but that does not seem to make a difference.
I would gladly go RTFM if somebody could be so kind as to point me in the direction of the proper docs. There are related Stack Overflow questions [here][2] and [here][3].
Thank you!
[1]: http://dougmccune.com/blog/2007/11/19/flex-coverflow-performance-improvement-flex-carousel-component-and-vertical-coverflow/
[2]: http://stackoverflow.com/questions/78230/compiling-mxml-files-with-ant-and-flex-sdk
[3]: http://stackoverflow.com/questions/119947/using-flash-component-swc-file-in-flex | 0 | [
2,
28687,
5912,
13,
8326,
18,
29,
14409,
13,
18,
43,
197,
307,
396,
79,
6109,
800,
3726,
3726,
31,
22,
79,
78,
20,
14409,
13,
18,
43,
197,
17,
749,
20,
8713,
21,
1935,
669,
568,
636,
7663,
263,
25961,
556,
22,
18,
1227,
9990,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a way to suppress warnings in Xcode?
===
Is there a way to suppress warnings in Xcode?
For example I am calling an undocumented method and since the method is not in the header I get a warning on compile. I know I can add it to my header to stop the warning, but I am wondering if there is a way other then adding it to the header (so I can keep the headers clean and standard) to suppress the warning? A pragma or something? | 0 | [
2,
25,
80,
21,
161,
20,
12451,
3590,
18,
19,
993,
9375,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
12451,
3590,
18,
19,
993,
9375,
60,
26,
823,
31,
589,
2555,
40,
367,
28132,
69,
2109,
17,
179,
14,
2109,
25,
52,
19,
14,
157,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 cache images in memory on the web server for an ASP.NET MVC web app?
===
I am working on a web application with many images, using ASP.NET MVC. I want to be able to cache the images in memory to improve the performance, but I would like to hear what is the best way to do this.
1) The images are accessible from URL, like http://www.site.com/album/1.jpg. How are the images stored in memory? Are they going to be in a form of memory stream?
2) How to access the image from memory and send to the web pagee? Now the web pages will use the image URL to directly embed the image in a <img> tag.
Thanks! | 0 | [
2,
184,
20,
16522,
3502,
19,
1912,
27,
14,
2741,
8128,
26,
40,
28,
306,
9,
2328,
307,
8990,
2741,
4865,
60,
800,
3726,
3726,
31,
589,
638,
27,
21,
2741,
3010,
29,
151,
3502,
15,
568,
28,
306,
9,
2328,
307,
8990,
9,
31,
259,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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/platform would you recommend for CPU-bound application?
===
I'm developing non-interactive cpu-bound application which does only computations, almost no IO. Currently it works too long and while I'm working on improving the algorithm, I also think if it can give any benefit to change language or platform. Currently it is C++ (no OOP so it is almost C) on windows compiled with Intel C++ compiler. Can switching to ASM help and how much? Can switching to Linux and GCC help? | 0 | [
2,
98,
816,
118,
27035,
83,
42,
12360,
26,
17578,
8,
7410,
3010,
60,
800,
3726,
3726,
31,
22,
79,
3561,
538,
8,
6280,
7889,
17578,
8,
7410,
3010,
56,
630,
104,
21683,
18,
15,
557,
90,
13,
1963,
9,
871,
32,
693,
266,
175,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Favorite Essay about Programming
===
What is your favorite essay about programming? Something which has made you think, or made you a better programmer. Something that you feel portrays the field well, or maybe that was just hilarious to read.
Some of my choices would be some of Paul Graham's essays, such as Hackers and Painters. The Cathedral and the Bazaar is also up there. | 4 | [
2,
3839,
8474,
88,
3143,
800,
3726,
3726,
98,
25,
154,
3839,
8474,
88,
3143,
60,
301,
56,
63,
117,
42,
277,
15,
54,
117,
42,
21,
574,
17968,
9,
301,
30,
42,
583,
19871,
14,
575,
134,
15,
54,
913,
30,
23,
114,
12045,
8756,
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... |
how to load a jar file on runtime
===
I was asked to build a java system that will have the ability to load new code (expantions) while running.
How do I re-load a jar file while my code is running? or how do I load a new jar?
Obviously, since constant up-time is important, I'd like to add the ability to re-load existing classes while at it (if it does not complicate things too much).
What are the things I should look out for?
(think of it as two different questions - one regarding reloading classes at runtime, the other regarding adding new classes).
| 0 | [
2,
184,
20,
6305,
21,
5112,
3893,
27,
485,
891,
800,
3726,
3726,
31,
23,
411,
20,
1895,
21,
8247,
329,
30,
129,
57,
14,
2165,
20,
6305,
78,
1797,
13,
5,
6899,
1830,
5757,
6,
133,
946,
9,
184,
107,
31,
302,
8,
8294,
21,
5112,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 automatically register an HttpHandler required by a web control
===
In ASP.NET, when building a web server control in a class library that includes an HttpHandler is there a way to automatically register the handler without having to manually edit the web application's web.config file?
I've read [this blog post][1] which outlines how to trick the designer into doing this for you, but I'd like something that doesn't require the user of my class library to enter the designer in Visual Studio for this to work.
[1]: http://www.tkachenko.com/blog/archives/000686.html | 0 | [
2,
184,
20,
7499,
2243,
40,
7775,
3203,
1252,
1390,
34,
21,
2741,
569,
800,
3726,
3726,
19,
28,
306,
9,
2328,
15,
76,
353,
21,
2741,
8128,
569,
19,
21,
718,
1248,
30,
1103,
40,
7775,
3203,
1252,
25,
80,
21,
161,
20,
7499,
2243... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I make the "find" Command on OS X default to the current directory?
===
I am a heavy command line user and use the find command extensively in my build system scripts. However, the Mac (BSD) find is somewhat annoying in that it doesn't have a default path (unlike the GNU version), thus when I am not concentrating I often get output like this:
$ find -name \*.plist
find: illegal option -- n
find: illegal option -- a
find: illegal option -- m
find: illegal option -- e
find: *.plist: No such file or directory
I tried in vain to make a bash function to default to the current directory, thus converting the above command to:
$ find . -name \*.plist
but failed. Thanks for your help. | 0 | [
2,
184,
92,
31,
233,
14,
13,
7,
19811,
7,
1202,
27,
13,
759,
993,
12838,
20,
14,
866,
16755,
60,
800,
3726,
3726,
31,
589,
21,
1278,
1202,
293,
4155,
17,
275,
14,
477,
1202,
7802,
19,
51,
1895,
329,
17505,
9,
207,
15,
14,
15... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can a Flex 3 method detect the calling object?
===
If I have a method such as:
private function testMethod(param:string):void
{
// Get the object that called this function
}
Inside the testMethod, can I work out what object called us? e.g.
class A
{
doSomething()
{
var b:B = new B();
b.fooBar();
}
}
class B
{
fooBar()
{
// Can I tell that the calling object is type of class A?
}
} | 0 | [
2,
92,
21,
14409,
203,
2109,
9092,
14,
2555,
3095,
60,
800,
3726,
3726,
100,
31,
57,
21,
2109,
145,
28,
45,
932,
1990,
1289,
5909,
1807,
43,
5,
6351,
79,
45,
11130,
6,
45,
2625,
1340,
13,
1,
12894,
164,
14,
3095,
30,
227,
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... |
Determining available Internet connection
===
What is the best way to determine whether there is an available Internet connection for your WinForms app. (Programatically of course) I want to disable/hide certain functions if the user is not connected to the Internet. | 0 | [
2,
13521,
904,
2620,
2760,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
3746,
1472,
80,
25,
40,
904,
2620,
2760,
26,
154,
628,
4190,
18,
4865,
9,
13,
5,
19746,
721,
8438,
16,
674,
6,
31,
259,
20,
1460,
579,
118,
19522,
1200,
371... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
HTML in an ASP.NET Dynamic Data MultilineText Control
===
I'm trying to enter a little bit of HTML into an ASP.NET Dynamic Data MultilineText_Edit control, just a couple of `<br>` tags to have line breaks when I output the value of the column on a web page.
However, when I try to click the "Update" link on the Dynamic Data edit page, nothing happens. I don't even get an error message, which I would expect if HTML input were not allowed via some rule the control has built in. As soon as I remove the tag, the update link works correctly. It's not a column size issue, I can add a bunch more characters to the input and everything works fine.
Is HTML input not allowed in these controls, or is there something else going on? If there is some kind of validation rule, can it be turned off? | 0 | [
2,
13,
15895,
19,
40,
28,
306,
9,
2328,
7782,
1054,
1889,
1143,
11969,
569,
800,
3726,
3726,
31,
22,
79,
749,
20,
2830,
21,
265,
1142,
16,
13,
15895,
77,
40,
28,
306,
9,
2328,
7782,
1054,
1889,
1143,
11969,
1,
69,
242,
569,
15... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Rendering UML diagrams from text files
===
Is there any good tool or tool-chain that allows UML images in the .svg format to be created from a textual source file?
The reason for this question is that I want to automate the generation of these images to avoid having to manually create and update this set of images.
| 0 | [
2,
15307,
13,
723,
255,
14161,
18,
37,
1854,
6488,
800,
3726,
3726,
25,
80,
186,
254,
5607,
54,
5607,
8,
17317,
30,
2965,
13,
723,
255,
3502,
19,
14,
13,
9,
18,
22955,
2595,
20,
44,
679,
37,
21,
1854,
6948,
1267,
3893,
60,
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... |
.Net Form POST
===
I've got a client that, during testing, is giving me conflicting information. I don't think they are lying but more confused. So, I would like to setup some simple auditing in my ASP.Net application. Specifically, right when any page is called, I want to immediately insert the Querystring and/or form POST data into a log table. Just the raw values.
Querystring is easy. But there doesn't seem to be a way to get the raw form POST'ed data without using BinaryRead, and if I do that, then I screw myself out of using the Request.Form collection later on.
Does anyone know a way around this? | 0 | [
2,
13,
9,
2328,
505,
678,
800,
3726,
3726,
31,
22,
195,
330,
21,
6819,
30,
15,
112,
4431,
15,
25,
1438,
55,
22297,
676,
9,
31,
221,
22,
38,
277,
59,
50,
3262,
47,
91,
4230,
9,
86,
15,
31,
83,
101,
20,
18161,
109,
1935,
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... |
Image Zoom using javascript?
===
Has anyone got to some good code to zoom into an image using javascript?
I know I could just resize it etc but was being lazy and looking for something clever to zoom to different levels, move around when zoomed etc | 0 | [
2,
1961,
19469,
568,
8247,
8741,
60,
800,
3726,
3726,
63,
1276,
330,
20,
109,
254,
1797,
20,
19469,
77,
40,
1961,
568,
8247,
8741,
60,
31,
143,
31,
110,
114,
302,
10454,
32,
2722,
47,
23,
142,
16792,
17,
699,
26,
301,
11994,
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... |
How do I get java logging output to appear on a single line?
===
At the moment a default entry looks something like this:
Oct 12, 2008 9:45:18 AM myClassInfoHere<br>
INFO: MyLogMessageHere
How do I get it to do this?
Oct 12, 2008 9:45:18 AM myClassInfoHere - INFO: MyLogMessageHere
| 0 | [
2,
184,
107,
31,
164,
8247,
13,
13919,
5196,
20,
1893,
27,
21,
345,
293,
60,
800,
3726,
3726,
35,
14,
688,
21,
12838,
2792,
1879,
301,
101,
48,
45,
9543,
390,
15,
570,
561,
45,
2520,
45,
1087,
589,
51,
1898,
108,
4120,
6836,
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 better to hire a developer to do unit tests, or to have each developer do their own?
===
For a team of 10, is it better to hire an individual developer to do all unit tests, or to have each individual developer do unit tests for their own owned code? | 0 | [
2,
25,
32,
574,
20,
10039,
21,
10058,
20,
107,
1237,
4894,
15,
54,
20,
57,
206,
10058,
107,
66,
258,
60,
800,
3726,
3726,
26,
21,
173,
16,
332,
15,
25,
32,
574,
20,
10039,
40,
1359,
10058,
20,
107,
65,
1237,
4894,
15,
54,
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,
0,
0,
0... |
How do you use Squeak?
===
I downloaded Squeak, the Image file, and the Sources file, but I can't figure out how to write Smalltalk code. Is there something obvious I'm missing? Is Squeak even the right IDE for serious Smalltalk development? | 0 | [
2,
184,
107,
42,
275,
16604,
60,
800,
3726,
3726,
31,
23887,
16604,
15,
14,
1961,
3893,
15,
17,
14,
2662,
3893,
15,
47,
31,
92,
22,
38,
1465,
70,
184,
20,
2757,
284,
9718,
1797,
9,
25,
80,
301,
4674,
31,
22,
79,
2863,
60,
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,
0,
0,
0,
0... |
In agile like development, who should write test cases?
===
Our team has a task system where we post small incremental tasks assigned to each developer.
Each task is developed in its own branch, and then each branch is tested before being merged to the trunk.
My question is: Once the task is done, who should define the **test cases** that should be done on this task?
Ideally I think the developer of the task himself is best suited for the job, but I have had a lot of resistance from developers who think it's a waste of their time, or that they simply don't like doing it.
The reason I don't like having my QA people do it, is because I don't like the idea of them creating their own work. For example they might leave out things that are simply too much work to test, and they may not know the technical detail that is needed.
But likewise, the down part of developers doing the test cases, is that they may leave out things that they think will break. (even subconsciously maybe)
As the project manager, I ended up writing the test cases for each task myself, but my time is taxed and I want to change this.
Suggestions?
**EDIT: By test cases I mean the individual QA tasks that should be done to the branch before it should be merged to the trunk. (Black Box)** | 0 | [
2,
19,
27475,
101,
522,
15,
72,
378,
2757,
1289,
1871,
60,
800,
3726,
3726,
318,
173,
63,
21,
3005,
329,
113,
95,
678,
284,
29977,
8674,
2467,
20,
206,
10058,
9,
206,
3005,
25,
885,
19,
82,
258,
1686,
15,
17,
94,
206,
1686,
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... |
Lucene.Net fails at my host because it calls GetTempPath(). What's the work around?
===
I'm using Lucene.Net in an ASP.NET application on a shared host. Got this stack trace shown below. What's the work around?
[SecurityException: Request for the permission of type 'System.Security.Permissions.EnvironmentPermission, mscorlib, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089' failed.]
System.Security.CodeAccessSecurityEngine.Check(Object demand, StackCrawlMark& stackMark, Boolean isPermSet) +0
System.Security.CodeAccessPermission.Demand() +59
System.IO.Path.GetTempPath() +54
Lucene.Net.Store.FSDirectory..cctor() +73
| 0 | [
2,
18515,
556,
9,
2328,
13614,
35,
51,
2015,
185,
32,
3029,
164,
9577,
8353,
5,
6,
9,
98,
22,
18,
14,
170,
140,
60,
800,
3726,
3726,
31,
22,
79,
568,
18515,
556,
9,
2328,
19,
40,
28,
306,
9,
2328,
3010,
27,
21,
2592,
2015,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Automatic two columns with CSS or JavaScript
===
I'm currently developing a website and my client wants the text of various articles to overflow into two columns. Kind of like in a newspaper? So it would look like:
Today in Wales, someone actually Nobody was harmed in
did something interesting. the incident, although one
Authorities are baffled by this elderly victim is receiving
development and have arrested the counselling.
perpetrator.
[my really bad attempt at coming up with something to write]
Is there a way I can do this with just CSS alone? I'd prefer not to have to use multiple divs. I'm open to using JavaScript too, but I'm -really- bad at that, so help would be appreciated. I was thinking maybe JavaScript could count how many <p>'s there are in the content div, and then move the second half of them to be floated right based on that? Maybe? Advices would be appreciated :D
| 0 | [
2,
6715,
81,
7498,
29,
272,
18,
18,
54,
8247,
8741,
800,
3726,
3726,
31,
22,
79,
871,
3561,
21,
2271,
17,
51,
6819,
2846,
14,
1854,
16,
617,
3376,
20,
20285,
77,
81,
7498,
9,
825,
16,
101,
19,
21,
1987,
60,
86,
32,
83,
361,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How many points your company has in the Joel test nowadays?
===
We all know [the Joel test](http://www.joelonsoftware.com/articles/fog0000000043.html). Joel had written it 8 years ago in August 2000. He wrote that most software companies ran with score between 2 and 3, which should have been quite scary for them.
8 years is a long time in software industry :).
Two years ago friend of mine [ask his friends](http://www.projectcomplete.pl/blog/entry70) [text is in Polish] about Joel test and published some results.
In short:
* two the worst companies had 4 points,
* three the best had 8 points,
* not many companies ask for writing a piece of code,
* almost no once test UI.
I would like to ask you how many points your company earns today in the Joel test?
I am sure the results look much better then 8 years ago. But I am wondering how much better and how much Joel's post influenced this progress...
| 4 | [
2,
184,
151,
819,
154,
237,
63,
19,
14,
8873,
1289,
15694,
60,
800,
3726,
3726,
95,
65,
143,
636,
124,
8873,
1289,
500,
5,
21127,
6903,
6483,
9,
19838,
3226,
12980,
5011,
9,
960,
118,
20360,
18,
118,
4120,
263,
21903,
21903,
4644,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
List of opensource programming books
===
I'm trying to amass a list of programming books with opensource licenses, like Creative Commons, GPL, etc. The books can be about a particlar programming language or about computers in general. Hoping you guys could help:
# Programming Languages
## Python
* [Dive Into Python](http://diveintopython.org/)
* [How to Think Like a Computer Scientist](http://openbookproject.net/thinkcs/python/english2e/index.xhtml)
* [A Byte of Python](http://www.ibiblio.org/g2swap/byteofpython/read/)
* [Python for Fun](http://www.openbookproject.net/py4fun/)
# Programming Tools
* [The SVN Book](http://svnbook.red-bean.com/)
I will expand on this list as i get comments or when i think of more :D | 4 | [
2,
968,
16,
368,
12097,
3143,
964,
800,
3726,
3726,
31,
22,
79,
749,
20,
21,
11749,
21,
968,
16,
3143,
964,
29,
368,
12097,
3962,
18,
15,
101,
4231,
8322,
15,
489,
5727,
15,
2722,
9,
14,
964,
92,
44,
88,
21,
141,
49,
12078,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Batch node operations in Drupal 5
===
What is the most efficient way to go through and update every single node in a drupal site, to, for instance mechanically add tags? Drupal 6 has a shiny new batch API, but what to do in Drupal 5?
I started writing a script that keeps a pointer and then goes around all nodes on a cron, loads them and then saves them, but I wonder what else could be done. | 0 | [
2,
13064,
15421,
1311,
19,
15708,
6720,
331,
800,
3726,
3726,
98,
25,
14,
127,
8243,
161,
20,
162,
120,
17,
11100,
352,
345,
15421,
19,
21,
15708,
6720,
689,
15,
20,
15,
26,
4851,
4953,
102,
3547,
3383,
18,
60,
15708,
6720,
400,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 code-coverage percentage on your project?
===
What is the % code-coverage on your project? I'm curious as to reasons why.
Is the dev team happy with it? If not, what stands in the way from increasing it?
Stuart Halloway is one whose projects aim for 100% (or else the build breaks!). Is anyone at that level?
We are at a painful 25% but aspire to 80-90% for new code. We have legacy code that we have decided to leave alone as it evaporates (we are actively re-writing). | 0 | [
2,
98,
25,
14,
1797,
8,
14069,
1303,
5780,
27,
154,
669,
60,
800,
3726,
3726,
98,
25,
14,
13,
11881,
1797,
8,
14069,
1303,
27,
154,
669,
60,
31,
22,
79,
7686,
28,
20,
2932,
483,
9,
25,
14,
9664,
173,
1700,
29,
32,
60,
100,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to do a kind of Link / Button style using CSS with special effects like shadows, outlining of text, and/or gradient?
===
Is it possible to make such buttons (http://img225.imageshack.us/img225/6452/buttonslw9.jpg) using CSS? It should be Menu, and PHP would just feed the text to html/css and css should take care of the design.
Maybe I want too much out of CSS - especially with that red outline of the text.. ? Any ideas how i can achieve such results without doing those buttons manually in Graphical Editor? | 0 | [
2,
25,
32,
938,
20,
107,
21,
825,
16,
3508,
13,
118,
5167,
1034,
568,
272,
18,
18,
29,
621,
2292,
101,
5327,
15,
70,
8930,
16,
1854,
15,
17,
118,
248,
17442,
60,
800,
3726,
3726,
25,
32,
938,
20,
233,
145,
12861,
13,
5,
2112... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there any kind of hashCode function in javascript?
===
Basically what I'm trying to do is create an object of unique objects, a set. I had the brilliant idea of just using a JS object with objects for the property names. Such as,
set[obj] = true;
This works, to a point. It works great with string and numbers, but with other objects, they all seem to "hash" to the same value and access the same property. Is there some kind of way I can generate a unique hash value for an object? How do strings and numbers do it, can I override the same behavior? Can someone please explain this to me? | 0 | [
2,
25,
80,
186,
825,
16,
19170,
9375,
1990,
19,
8247,
8741,
60,
800,
3726,
3726,
11374,
98,
31,
22,
79,
749,
20,
107,
25,
1600,
40,
3095,
16,
2619,
3916,
15,
21,
309,
9,
31,
41,
14,
7472,
882,
16,
114,
568,
21,
487,
18,
3095... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Hardware Acceleration for non-SSL based signing and encryption.
===
I am working on a project that does a large amount of hashing, signing, and both asymmetric and symmetric encryption. Since these steps have a significant effect on our performance and available load, I was wondering if there is a hardware based solution to offloading the work.
I have done some surfing to find out, and the only items I can find are dedicated to SSL based communications. I need a more generic solution that will allow me to speed up signing and encryption regardless of where it occurs.
Is it possible to adapt these SSL based solutions (maybe it's just marketing and it would be easy to re-use elsewhere)? Is there a good generic co-processor that can help out?
I need this on a Windows Server 2008 based box, but I would be interested in solutions on any platform.
| 0 | [
2,
7610,
17661,
26,
538,
8,
18,
18,
255,
432,
5479,
17,
24420,
9,
800,
3726,
3726,
31,
589,
638,
27,
21,
669,
30,
630,
21,
370,
2006,
16,
19170,
68,
15,
5479,
15,
17,
156,
21,
16367,
17,
13,
16367,
24420,
9,
179,
158,
2382,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 map api would best support fictionally defined maps?
===
I am researching the feasibility of setting up a mapping tool for my alliance in an online game.
The game is not based in the real world so I am not interested in the content of the map tools available, just the functionality.
Minimally, I would like the map to display information about where allied cities are located in the world. Ideally, I'd like to be able to display information about desired trades, levels of development, and military actions. All this should be editable by the map users.
I've been looking at the google maps API and it appears that I could use it to serve my ends by using my own map tiles with a custom defined map object and some custom overlays, but it looks like it would be a lot of work to set up.
Is there another tool that would be better suited to this task? | 0 | [
2,
56,
2942,
21,
2159,
83,
246,
555,
6079,
102,
2811,
6867,
60,
800,
3726,
3726,
31,
589,
527,
68,
14,
26022,
16,
2697,
71,
21,
13305,
5607,
26,
51,
2928,
19,
40,
2087,
250,
9,
14,
250,
25,
52,
432,
19,
14,
683,
126,
86,
31,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Show file tree in visual studio 2005?
===
I have a large project that I want to start using visual studio 2005 to edit. I want to tell it "Here are all the files I want you to track, now get on with it" and have them displayed as a directory tree, for example:
Folder 1
- File A
- File B
- File C
Folder 2
- Folder 3
- File X
- File Y
- File D
- File E
Right now it's just showing all the header files in one big list, and all the source files in one big list, which I find unhelpful. I also don't want to spend ages creating a folder in the project for each folder on the disk.
Is there any way I can get VS to show me a source tree of everything in the solution, organised by where it is on the actual disk?
Thanks. | 0 | [
2,
298,
3893,
1541,
19,
3458,
1120,
812,
60,
800,
3726,
3726,
31,
57,
21,
370,
669,
30,
31,
259,
20,
799,
568,
3458,
1120,
812,
20,
9392,
9,
31,
259,
20,
494,
32,
13,
7,
6836,
50,
65,
14,
6488,
31,
259,
42,
20,
792,
15,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can you efficiently check the VM mapping for an address?
===
I am writing a tracing tool which needs to deal with the output of a a JIT, so the stack can look pretty bizarre at times. I'd like to try to apply some heuristics to addresses to determine if they are code, data or garbage. (If I'm wrong some of the time, it's no big deal; however if the process crashes, not so much.)
I can `cat /proc/«pid»/maps` to get a list of the VM mappings for a process in Linux. Is it possible to access this information (or any subset) from inside the process without parsing that file? It'd be ideal to examine the `rwx` bits for an address. Essentially, I want a “read” version of `mprotect(2)`.
If I can't do this, how about determining if an access to a certain address will cause a segmentation fault? (There is already a `SIGSEGV` handler installed in this case and I can't easily overwrite it, or I'd just do that.) | 0 | [
2,
184,
92,
42,
20519,
2631,
14,
13,
20147,
13305,
26,
40,
3218,
60,
800,
3726,
3726,
31,
589,
1174,
21,
20005,
5607,
56,
2274,
20,
1183,
29,
14,
5196,
16,
21,
21,
13,
13803,
15,
86,
14,
7566,
92,
361,
1772,
15701,
35,
436,
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... |
Where does Visual Studio get the type description info used by Intellisense?
===
Where do the type/member/parameter descriptions that you see in the Intellisense bubble come from? Are they stored in type attributes? | 0 | [
2,
113,
630,
3458,
1120,
164,
14,
1001,
5318,
15404,
147,
34,
14635,
3159,
6498,
60,
800,
3726,
3726,
113,
107,
14,
1001,
118,
6990,
118,
6351,
7307,
15740,
30,
42,
196,
19,
14,
14635,
3159,
6498,
10937,
340,
37,
60,
50,
59,
8214,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Any C++ libraries available to convert between floating point representations?
===
I recently had a need to interpret a DEC 32-bit floating point representation. It differs from the IEEE floating point representations in the number of bits allocated to the exponent and mantissa.
Here's a description of a bunch of floating point formats:
[http://www.quadibloc.com/comp/cp0201.htm][1]
I managed to roll my own C++ code to stuff a DEC 32-bit float into an IEEE 32-bit float but was wondering if there were any libraries out there that had tackled this conversion and others already.
I checked [boost.org][2] but didn't see any in there.
[1]: http://www.quadibloc.com/comp/cp0201.htm
[2]: http://www.boost.org | 0 | [
2,
186,
272,
20512,
8649,
904,
20,
8406,
128,
8319,
454,
18667,
60,
800,
3726,
3726,
31,
1989,
41,
21,
376,
20,
11584,
21,
6661,
2512,
8,
3326,
8319,
454,
5442,
9,
32,
14761,
37,
14,
19215,
8319,
454,
18667,
19,
14,
234,
16,
101... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Adding spaces between strings
===
What's the best way of adding spaces between strings
myString = string.Concat("a"," ","b")
or
myString = string.Concat("a",Chr(9),"b")
I am using stringbuilder to build an XML file and looking for something efficient.
Thanks | 0 | [
2,
4721,
7644,
128,
7887,
800,
3726,
3726,
98,
22,
18,
14,
246,
161,
16,
4721,
7644,
128,
7887,
51,
11130,
800,
3724,
9,
1126,
5782,
5,
7,
58,
7,
15,
7,
13,
7,
15,
7,
220,
7,
6,
54,
51,
11130,
800,
3724,
9,
1126,
5782,
5,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I use LINQ .Contains(string[]) instead of .Contains(string)
===
I got one big question.
I got a linq query to put it simply looks like this:
from xx in table
where xx.uid.ToString().Contains(string[])
select xx
The values of the string[] array would be numbers like (1,45,20,10,etc...)
the Default for .Contains is .Contains(string).
I need it to do this instead: .Contains(string[])...
Help anyone? | 0 | [
2,
184,
107,
31,
275,
6294,
1251,
13,
9,
1126,
5851,
18,
5,
11130,
2558,
500,
6,
700,
16,
13,
9,
1126,
5851,
18,
5,
11130,
6,
800,
3726,
3726,
31,
330,
53,
580,
1301,
9,
31,
330,
21,
6294,
1251,
25597,
20,
442,
32,
1659,
187... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In C#, what is the best method to format a string as XML?
===
I am creating a lightweight editor in C# and would like to know the best method for converting a string into nicely formatted XML. I would hope that there's a public method in the C# library like "public bool FormatAsXml(string text, out string formattedXmlText)", but it couldn't be that easy, could it? | 0 | [
2,
19,
272,
5910,
15,
98,
25,
14,
246,
2109,
20,
2595,
21,
3724,
28,
23504,
60,
800,
3726,
3726,
31,
589,
2936,
21,
13613,
1835,
19,
272,
5910,
17,
83,
101,
20,
143,
14,
246,
2109,
26,
19583,
21,
3724,
77,
24050,
13,
29850,
23... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Migrating from PostgreSQL to Oracle
===
Does anyone knows of an automated tool that works for migrating table structure and data?
The tool has to resolve concerns such as transforming PostgreSQL fields on cases where a direct equivalent isn't available. I.e, a field type like *boolean* being used. | 0 | [
2,
28749,
37,
678,
6879,
18,
22402,
20,
15759,
800,
3726,
3726,
630,
1276,
3620,
16,
40,
14904,
5607,
30,
693,
26,
28749,
859,
1411,
17,
1054,
60,
14,
5607,
63,
20,
9854,
4823,
145,
28,
22335,
678,
6879,
18,
22402,
2861,
27,
1871,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I find out what exceptions might be thrown by a .NET function?
===
I might be missing something obvious but is there a reference somewhere about what exceptions are thrown by functions in .NET and why the exception might be thrown?
As an example, I was recently trying out Linq in Visual C# 2008 and I was loading an XML file into an XDocument. It was only through testing that I realised that if you try to load a file that doesn't exist, it will throw a FileNotFound exception, but if you try to load a directory instead of a file you'll get an UnauthorizedAccessException. Also looking through the System.IO namespace I can see things like a FileLoad exception and a PathTooLongException, and I can guess when they might be thrown but there could be others out there that might be thrown in some circumstance I haven't thought of yet.
The only solution I've got right now is just to catch the ones I know about and then catch the Exception type, but I would rather be able to know exactly which types of exceptions I'm most likely to run into and why. I would have thought the MSDN library would have this type of information, but I can't find it anywhere. Am I just blind? Is this information anywhere else? | 0 | [
2,
184,
107,
31,
477,
70,
98,
13392,
530,
44,
6027,
34,
21,
13,
9,
2328,
1990,
60,
800,
3726,
3726,
31,
530,
44,
2863,
301,
4674,
47,
25,
80,
21,
2801,
3493,
88,
98,
13392,
50,
6027,
34,
3719,
19,
13,
9,
2328,
17,
483,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.