unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
SQL query to calculate coordinate proximity
===
I'm using this formula to calculate the distance between entries in my (My)SQL database which have latitude and longitude fields in decimal format:
6371 * ACOS(SIN(RADIANS( %lat1% )) * SIN(RADIANS( %lat2% )) + COS(RADIANS( %lat1% )) * COS(RADIANS( %lat2% )) * COS(RADIANS( %lon2% ) - RADIANS( %lon1% )))
Substituting %lat1% and %lat2% appropriately it can be used in the WHERE clause to find entries within a certain radius of another entry, using it in the ORDER BY clause together with LIMIT will find the nearest x entries etc.
I'm writing this mostly as a note for myself, but improvements are always welcome. :) | 0 | [
2,
4444,
255,
25597,
20,
18469,
15154,
10493,
800,
3726,
3726,
31,
22,
79,
568,
48,
3729,
20,
18469,
14,
1583,
128,
11399,
19,
51,
13,
5,
915,
6,
18,
22402,
6018,
56,
57,
16337,
17,
22291,
2861,
19,
26380,
2595,
45,
400,
25686,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Infrastructure for a software project
===
I'd be leading a new project soon. And I've been pondering over what are the basic infrastructure for a software project. These are the stuff that I think every project should have:
-Coding style conventions
-Naming conventions
-Standard project directory structure(eg maven standard dir layout, etc)
-Project management and issue tracking(eg trac, redmine, etc)
-Continuous Integration server(eg, hudson, cruise control, etc)
I'm not sure if I missed out anything. Would anyone like to add? | 0 | [
2,
5282,
26,
21,
2306,
669,
800,
3726,
3726,
31,
22,
43,
44,
1005,
21,
78,
669,
651,
9,
17,
31,
22,
195,
74,
14197,
68,
84,
98,
50,
14,
2125,
5282,
26,
21,
2306,
669,
9,
158,
50,
14,
3217,
30,
31,
277,
352,
669,
378,
57,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I best convert a string representation into a DbType?
===
Suppose I have a string 'nvarchar(50)', which is for example the T-SQL string segment used in creating a table of that type. How do I best convert that to an enum representation of System.Data.DbType?
Could it handle the many different possible ways of writing the type in T-SQL, such as:
[nvarchar](50)
nvarchar 50
Thanks in advance | 0 | [
2,
184,
107,
31,
246,
8406,
21,
3724,
5442,
77,
21,
13,
9007,
4474,
60,
800,
3726,
3726,
5787,
31,
57,
21,
3724,
13,
22,
103,
3311,
5433,
5,
2290,
6,
22,
15,
56,
25,
26,
823,
14,
13,
38,
8,
18,
22402,
3724,
5631,
147,
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... |
Best way to validate drag/drop operations for a TreeView in C#
===
I want to verify a drag & drop operation is allowed. A valid item can come from another one of our "controls", or internally from within the custom treeview. Currently I have this:
bool CanDrop(DragEventArgs e)
{
bool allow = false;
Point point = tree.PointToClient(new Point(e.X, e.Y));
TreeNode target = tree.GetNodeAt(point);
if (target != null)
{
if (CanWrite(target)) //user permissions
{
if (e.Data.GetData(typeof(DataInfoObject)) != null) //from internal application
{
DataInfoObject info = (DataInfoObject)e.Data.GetData(typeof(DataInfoObject));
DragDataCollection data = info.GetData(typeof(DragDataCollection)) as DragDataCollection;
if (data != null)
{
allow = true;
}
}
else if (tree.SelectedNode.Tag.GetType() != typeof(TreeRow)) //node belongs to this & not a root node
{
if (TargetExistsInNode(tree.SelectedNode, target) == false)
{
if (e.Effect == DragDropEffects.Copy)
{
allow = true;
}
else if (e.Effect == DragDropEffects.Move)
{
allow = true;
}
}
}
}
}
return allow;
}
I've moved all the checking code to this method to try to improve things, but to me this is still horrible!
So much logic, and so much of it to do things that I'd expect the treeview would do itself (eg. "TargetExistsInNode" checks whether the dragged node is being dragged to one of its children).
What is the best way to validate input to a control? | 0 | [
2,
246,
161,
20,
7394,
1373,
5501,
118,
12361,
1311,
26,
21,
1541,
4725,
19,
272,
5910,
800,
3726,
3726,
31,
259,
20,
21012,
21,
5501,
279,
2804,
1453,
25,
1159,
9,
21,
7394,
9101,
92,
340,
37,
226,
53,
16,
318,
13,
7,
12898,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
OO Design, open/closed principle question
===
I've been thinking about this object oriented design question for a while now and have unable to come up with a satisfactory solution, so thought I'd throw it open to the crowds here for some opinions.
I have a *Game* class that represents a turn based board game, we can assume it's similar to Monopoly for the purposes of this question.
In my design I have a *Player* class containing a method *TakeTurn*.
The *Game* loops through all *Player*s and calls the TakeTurn method to do all the necessary things to complete the turn.
I want to be able to have n number of players, and be able to set an arbitrary number of them to be computer players.
So, my thought was to have a HumanPlayer class and a *ComputerPlayer* class, both of which derive from Player.
The *Game* knows only the *Player* class and simply calls the *TakeTurn* method on each *Player* in turn.
My problem comes in the fact that *ComputerPlayer* objects can be completely automated, i.e. keeping with the Monopoly example, can decide to buy a property using some piece of logic.
Now, with the *HumanPlayer* object, it needs to get an input from the actual user to be able to buy a property for instance, which seems to imply a different interface and potentially mean they shouldn't derive
I haven't been able to come up with a good solution to the problem without having the *Game* class know the actual implementations of the various *Player* classes explicitly.
I could always make the assumption in the *Game* class that there will only ever be human and computer players and effectively close it for extension, but it doesn't seem like good OO programming.
Any opinions on this would be appreciated. | 0 | [
2,
13,
4328,
704,
15,
368,
118,
20372,
5897,
1301,
800,
3726,
3726,
31,
22,
195,
74,
1440,
88,
48,
3095,
13,
6800,
704,
1301,
26,
21,
133,
130,
17,
57,
2343,
20,
340,
71,
29,
21,
25549,
4295,
15,
86,
289,
31,
22,
43,
3814,
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... |
Hosting a WCF endpoint with programatic settings in IIS
===
I need to host a WCF service in IIS that exposes a wsHttpBinding. That part is working nicely using the settings of system.serviceModel in my web.config.
What i need now is to setup the configuration (like maxReceivedMessageSize and other options) through a configuration assembly that is also used by the client(s).
How is this possible? I see no handles in my .svc file like in my client to overload binding configuration. I suspect this is because it is automaticly handled by ISS when the application starts up as in contrast to a windows service where you have to manually declare the client/channel.
Am i right about this? And would the solution to his problem (if i still want hosting inside IIS) to remove all configuration and instead create a HttpHandler that takes care of the hosting on startup?
If i'm right i guess i just wasted a whole lot of space writing this, but i can't help thinking i'm missing something. | 0 | [
2,
10637,
21,
11801,
410,
241,
3132,
29,
625,
12479,
12410,
19,
595,
18,
800,
3726,
3726,
31,
376,
20,
2015,
21,
11801,
410,
365,
19,
595,
18,
30,
13833,
18,
21,
619,
18,
21127,
22260,
9,
30,
141,
25,
638,
24050,
568,
14,
12410,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 best convert a DbType to System.Type?
===
How do I best convert a System.Data.DbType enumeration value to the corresponding (or at least one of the possible corresponding) System.Type values?
For example:
DbType.StringFixedLength -> System.String
DbType.String -> System.String
DbType.Int32 -> System.Int32
I've only seen very "dirty" solutions but nothing really clean.
(yes, it's a follow up to a different question of mine, but it made more sense as two seperate questions) | 0 | [
2,
184,
107,
31,
246,
8406,
21,
13,
9007,
4474,
20,
329,
9,
4474,
60,
800,
3726,
3726,
184,
107,
31,
246,
8406,
21,
329,
9,
18768,
9,
9007,
4474,
26940,
872,
1923,
20,
14,
7265,
13,
5,
248,
35,
639,
53,
16,
14,
938,
7265,
6,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Make Web Application Accessible
===
What things have to be done before I can honestly tell myself my web application is accessible? Or even better, convince Joe Clark. I don't have any video or audio to worry about, so I know I won't need transcripts. What else do I have to check? | 0 | [
2,
233,
2741,
3010,
7342,
800,
3726,
3726,
98,
564,
57,
20,
44,
677,
115,
31,
92,
10971,
494,
992,
51,
2741,
3010,
25,
7342,
60,
54,
166,
574,
15,
6218,
1802,
3618,
9,
31,
221,
22,
38,
57,
186,
763,
54,
4023,
20,
3189,
88,
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... |
Excel report framework
===
Is there any Excel report framework available? We need to export some of the reports into Excel format. Our application is java application hence anything supporting java would be great. I have tried Apache POI API, however that is not good enough. Any framework based on Windows API would be better. | 0 | [
2,
20700,
1330,
6596,
800,
3726,
3726,
25,
80,
186,
20700,
1330,
6596,
904,
60,
95,
376,
20,
7487,
109,
16,
14,
2813,
77,
20700,
2595,
9,
318,
3010,
25,
8247,
3010,
5796,
602,
3134,
8247,
83,
44,
374,
9,
31,
57,
794,
17140,
2353... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Automated tests for Java Swing GUIs
===
What options are there for building automated tests for GUIs written in Java Swing?
I'd like to test some GUIs which have been written using the [NetBeans Swing GUI Builder][1], so something that works without requiring special tampering of the code under test would be ideal.
[1]: http://www.netbeans.org/features/java/swing.html | 0 | [
2,
14904,
4894,
26,
8247,
5587,
9457,
18,
800,
3726,
3726,
98,
6368,
50,
80,
26,
353,
14904,
4894,
26,
9457,
18,
642,
19,
8247,
5587,
60,
31,
22,
43,
101,
20,
1289,
109,
9457,
18,
56,
57,
74,
642,
568,
14,
636,
2328,
863,
5950... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Cruise Control and Obfuscation, How?
===
this is my first question to stackoverflow so here it goes...
I use cruise control for my continuous integration scheme, i want to use obfuscation in order to add another protection layer to my assemblies. The thing is that i don't know how to go about it since i couldn't find articles describing about this. Suggestions that include other CI tools such as NAnt are also accepted.
Commercial tools are also an option so don't hesitate to include them in your answer. The applications that i am building and want to obfuscate are mostly written in Compact Framework 2.0, Dot Net 2.0-3.5.
At the moment cruise control checks for changes in the repository, then based on the script for the specific solution downloads and builds the project by using devenv, after the setup project has been run it copies the setup file into a different folder and thats more or less it. So i need obfuscate somewhere in this process..
Thanks in advance for any input. | 0 | [
2,
6581,
569,
17,
5122,
13735,
16893,
15,
184,
60,
800,
3726,
3726,
48,
25,
51,
64,
1301,
20,
7566,
2549,
9990,
86,
235,
32,
1852,
9,
9,
9,
31,
275,
6581,
569,
26,
51,
6357,
8078,
4276,
15,
31,
259,
20,
275,
5122,
13735,
16893... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
i need to write code in python for comparing text of two documents uning fingerprint techniques
===
I need to write code in python language for comparing the text of document uning fingerprint techniques. I do not know to take fingerprint of a document or to generate fingerprint of a document. Please if anyone know the method or have a source code for generating fingerprints of documents which is stored in bits form.
please guide me or send me.
I am very thankful for it.
thanks
| 0 | [
2,
31,
376,
20,
2757,
1797,
19,
20059,
26,
15047,
1854,
16,
81,
4374,
367,
68,
21564,
4212,
800,
3726,
3726,
31,
376,
20,
2757,
1797,
19,
20059,
816,
26,
15047,
14,
1854,
16,
4492,
367,
68,
21564,
4212,
9,
31,
107,
52,
143,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can you tell programmatically if a Flex App is running in debug mode?
===
Is it possible to write code in a Flex application that will only be run in a debug build, or when running through the debugger?
Does Flex provide a way to actually remove code entirely from release builds, like C-style #defines? | 0 | [
2,
184,
92,
42,
494,
625,
6732,
1326,
100,
21,
14409,
4865,
25,
946,
19,
121,
16254,
3740,
60,
800,
3726,
3726,
25,
32,
938,
20,
2757,
1797,
19,
21,
14409,
3010,
30,
129,
104,
44,
485,
19,
21,
121,
16254,
1895,
15,
54,
76,
946... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 write an emacs mode for a new language?
===
I would like to write an <b>emacs major mode</b> for a 4GL.
Can some one show me a tutorial.
As far as i googled i was able to find only this broken link <a>http://two-wugs.net/emacs/mode-tutorial.html</a> | 0 | [
2,
184,
20,
2757,
40,
13,
62,
6893,
18,
3740,
26,
21,
78,
816,
60,
800,
3726,
3726,
31,
83,
101,
20,
2757,
40,
13,
1,
220,
1,
62,
6893,
18,
394,
3740,
1,
118,
220,
1,
26,
21,
268,
8430,
9,
92,
109,
53,
298,
55,
21,
29724... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 an efficient\easy way to draw a concave polygon in Direct3d
===
I'm trying to draw a polygon using c# and directx
All I get is an ordered list of points from a file and I need to draw the flat polygon in a 3d world.
I can load the points and draw a convex shape using a trianglefan and drawuserprimitives.
This obviously leads to incorrect results when the polygon is very concave (which it may be).
I can't imagine I'm the only person to grapple with this problem (tho I'm a gfx/directx neophyte - my background is in gui\windows application development).
Can anyone point me towards a simple to follow resource\tutorial\algorithm which may assist me? | 0 | [
2,
25,
80,
40,
8243,
1,
18385,
161,
20,
2003,
21,
29472,
21309,
19,
1744,
240,
43,
800,
3726,
3726,
31,
22,
79,
749,
20,
2003,
21,
21309,
568,
272,
5910,
17,
1744,
396,
65,
31,
164,
25,
40,
1905,
968,
16,
819,
37,
21,
3893,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Will everything in the standard library treat strings as unicode in Python 3.0?
===
I'm a little confused about how the standard library will behave now that Python (from 3.0) is unicode-based. Will modules such as CGI and urllib use unicode strings or will they use the new 'bytes' type and just provide encoded data? | 0 | [
2,
129,
796,
19,
14,
1236,
1248,
5752,
7887,
28,
28010,
19,
20059,
203,
9,
387,
60,
800,
3726,
3726,
31,
22,
79,
21,
265,
4230,
88,
184,
14,
1236,
1248,
129,
14149,
130,
30,
20059,
13,
5,
2665,
203,
9,
387,
6,
25,
28010,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Beginning Web Development on Plan 9
===
I've been wanting to program for the Plan 9 operating system for a while. I'd really like to play around with a web app there. Of course, the only language I know for Plan 9 is C, and that doesn't seem ideal for web development. I also understand that it doesn't run apache or mysql either.
What is the best way to start coding web apps on Plan 9? | 0 | [
2,
997,
2741,
522,
27,
944,
561,
800,
3726,
3726,
31,
22,
195,
74,
4638,
20,
625,
26,
14,
944,
561,
2455,
329,
26,
21,
133,
9,
31,
22,
43,
510,
101,
20,
418,
140,
29,
21,
2741,
4865,
80,
9,
16,
674,
15,
14,
104,
816,
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... |
Serialize Java objects into Java code
===
Does somebody know a Java library which serializes a Java object hierarchy into Java code which generates this object hierarchy? Like Object/XML serialization, only that the output format is not binary/XML but Java code. | 0 | [
2,
5956,
2952,
8247,
3916,
77,
8247,
1797,
800,
3726,
3726,
630,
8861,
143,
21,
8247,
1248,
56,
5956,
13569,
21,
8247,
3095,
14417,
77,
8247,
1797,
56,
7920,
18,
48,
3095,
14417,
60,
101,
3095,
118,
396,
8184,
5956,
1829,
15,
104,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What is the difference between mysql_real_escape_string and addslashes?
===
`mysql_real_escape_string` and `addslashes` are both used to escape data before the database query, so what's the difference? (This question is not about parametrized queries/PDO/mysqli) | 0 | [
2,
98,
25,
14,
2841,
128,
51,
18,
22402,
1,
7467,
1,
62,
13109,
1,
11130,
17,
10621,
9545,
160,
60,
800,
3726,
3726,
13,
1,
915,
18,
22402,
1,
7467,
1,
62,
13109,
1,
11130,
1,
17,
13,
1,
14854,
18,
9545,
160,
1,
50,
156,
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... |
Checking if another web server is listening from asp
===
I'm using Microsoft.XMLHTTP to get some information from another server from an old ASP/VBScript site. But that other server is restarted fairly often, so I want to check that it's up and running before trying to pull information from it (or avoid my page from giving an HTTP 500 by detecting the problem some other way).
How can I do this with ASP? | 0 | [
2,
9886,
100,
226,
2741,
8128,
25,
4948,
37,
28,
306,
800,
3726,
3726,
31,
22,
79,
568,
7099,
9,
396,
8184,
21127,
20,
164,
109,
676,
37,
226,
8128,
37,
40,
315,
28,
306,
118,
20468,
8741,
689,
9,
47,
30,
89,
8128,
25,
27440,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 the names of all the classes within a VS2008 project
===
Is there a quick & dirty way of obtaining a list of all the classes within a Visual Studio 2008 (c#) project? There are quite a lot of them and Im just lazy enough not to want to do it manually. | 0 | [
2,
968,
14,
1817,
16,
65,
14,
2684,
363,
21,
4611,
2753,
669,
800,
3726,
3726,
25,
80,
21,
2231,
279,
6121,
161,
16,
12114,
21,
968,
16,
65,
14,
2684,
363,
21,
3458,
1120,
570,
13,
5,
150,
5910,
6,
669,
60,
80,
50,
1450,
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... |
Multiple keyboards and low-level hooks
===
I have a system where I have multiple keyboards and really need to know which keyboard the key stroke is coming from. To explain the set up:
1. I have a normal PC and USB keyboard
2. I have an external VGA screen with some hard-keys
3. The hard keys are mapped as a standard USB keyboard, sending a limited number of key-codes (F1, F2, Return, + and -)
I have a low-level hook (in C# but actually calling upon Win32 functionality) which is able to deal with the input even when my application is not focused.
The problem is that when using the normal keyboard, some of the mapped key-codes at picked up by the application being driven on the external screen. One of the key-presses sent by the external screen and used for confirmation is VK_RETURN. Unless I can identify the "device" and filter upon it, the user could be performing actions and confirming them on a screen their not even looking at.
How do I know which keyboard was responsible for the key-press? | 0 | [
2,
1886,
5362,
17,
708,
8,
3906,
5559,
18,
800,
3726,
3726,
31,
57,
21,
329,
113,
31,
57,
1886,
5362,
17,
510,
376,
20,
143,
56,
8896,
14,
1246,
7080,
25,
880,
37,
9,
20,
3271,
14,
309,
71,
45,
137,
9,
31,
57,
21,
1826,
51... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
VS: Attribute for ignoring missing XML comments when building
===
I have a VS2008 solution using xml documentation, and we have warnings as errors turned on for release mode (a nice feature IMHO); this results, however, in long lists of 'missing xml comment' errors for such things as every element of a (self describing) enum.
Does anyone know of an attribute or similar which switches off the requrement for xml comments? Ideally for some delimited area, not just one line (otherwise I could just put empty tags before every item, kind of defeating the purpose...)
Thanks! | 0 | [
2,
4611,
45,
35,
14755,
26,
9321,
2863,
23504,
7534,
76,
353,
800,
3726,
3726,
31,
57,
21,
4611,
2753,
4295,
568,
23504,
13945,
15,
17,
95,
57,
3590,
18,
28,
11908,
412,
27,
26,
830,
3740,
13,
5,
58,
2210,
1580,
797,
1807,
6,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best resources to prepare for the "Spring Framework Certification"
===
I want to do the Spring Framework Certification (2.5), but there aren't many good resources to prepare for the exam. For the Sun certifications there are a lot of books and trainers (Enthuware / Whizlabs) but not for the Spring certification.
Has somebody done the 2.5 exam already? What was your first impression? How did you prepare? What resources did you have and which are sufficient.
Thanks in advance for your answers! | 0 | [
2,
246,
2566,
20,
5723,
26,
14,
13,
7,
15827,
6596,
10439,
7,
800,
3726,
3726,
31,
259,
20,
107,
14,
1573,
6596,
10439,
13,
5,
135,
9,
264,
6,
15,
47,
80,
4847,
22,
38,
151,
254,
2566,
20,
5723,
26,
14,
11796,
9,
26,
14,
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... |
Scrum Burndown issues
===
We have been using Scrum for around 9 months and it has largely been successful. However our burndown charts rarely look like the 'model' charts, instead resembling more of a terrifying rollercoaster ride with some vomit inducing climbs and drops.
To try and combat this we are spending more time before the sprint prototyping and designing but we still seem to discover much more work during the sprint than initially thought.
Is this a common problem with Scrum and does anyone have any tips to help smooth the ride?
I should point out that most of our development work is not greenfield, so we are maintaining functionality in an existing large and complex application. Is scrum less suited to this type of development simply because you don't know what problems the existing code is going to throw up?
Just how much time should we be spending before the sprint starts working out the detail of the development? | 0 | [
2,
26562,
4306,
2968,
1549,
800,
3726,
3726,
95,
57,
74,
568,
26562,
26,
140,
561,
818,
17,
32,
63,
2679,
74,
1300,
9,
207,
318,
4306,
2968,
5158,
5664,
361,
101,
14,
13,
22,
13998,
22,
5158,
15,
700,
18353,
91,
16,
21,
19320,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Pause a DOS Console/GNU Makefile if an error occurs
===
Part of the install for an App I am responsible compiles some C code libraries. This is done in a DOS console using GNU Make.
So, as part of the install, a DOS Console window pops open, you see the make file output wiz by as it compiles and links, when finished the DOS Console window closes and the installer continues.
All good, unless there is a compilation error. Then the make file bugs out and the DOS Console window closes before you have a chance to figure out what is happening.
So, what I'd like to happen is have the Makefile/DOS console window pause with a 'press a key to continue' type functionality IF there is an error from the makefile so that the DOS console stays open. Otherwise, just exit as normal and close the DOS console.
I can't work out how to do this in a GNU Makefile or from a DOS batch file that could run the Make.
Any DOS/GNU Make guru's with a solution?
| 0 | [
2,
6911,
21,
107,
18,
8650,
118,
263,
4215,
233,
16877,
100,
40,
7019,
3690,
800,
3726,
3726,
141,
16,
14,
16146,
26,
40,
4865,
31,
589,
1864,
26561,
18,
109,
272,
1797,
8649,
9,
48,
25,
677,
19,
21,
107,
18,
8650,
568,
26092,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Statistically removing erroneous values
===
We have a application where users enter prices all day. These prices are recorded in a table with a timestamp and then used for producing charts of how the price has moved... Every now and then the user enters a price wrongly (eg. puts in a zero to many or to few) which somewhat ruins the chart (you get big spikes). We've even put in an extra confirmation dialogue if the price moves by more than 20% but this doesn't stop them entering wrong values...
What statistical method can I use to analyse the values before I chart them to exclude any values that are way different from the rest? | 0 | [
2,
6762,
102,
9096,
24406,
4070,
800,
3726,
3726,
95,
57,
21,
3010,
113,
3878,
2830,
7334,
65,
208,
9,
158,
7334,
50,
801,
19,
21,
859,
29,
21,
436,
38,
10158,
17,
94,
147,
26,
4081,
5158,
16,
184,
14,
2162,
63,
385,
9,
9,
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... |
Best solution for using EJBs from Excel
===
We would like to give access to some of our EJBs from Excel. The goal is to give an API usable from VBA.
Our EJBs are mostly Stateless Session Beans that do simple CRUD operations with POJOs.
Some possible solutions:
* Exposing the EJBs as WebServices and create a VB/C# dll wrapping them,
* Using Corba to access the EJBs from C#,
* Creating a COM Library that uses Java to access the EJBs,
Pointers to frameworks for these solution or other ideas are welcome.
| 0 | [
2,
246,
4295,
26,
568,
13,
10022,
4562,
37,
20700,
800,
3726,
3726,
95,
83,
101,
20,
590,
1381,
20,
109,
16,
318,
13,
10022,
4562,
37,
20700,
9,
14,
1195,
25,
20,
590,
40,
21,
2159,
182,
579,
37,
566,
969,
9,
318,
13,
10022,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Programmatically Build a TemplateColumn
===
How does one go about programatically building a TemplateColumn object and adding it to a DataGrid. I know how to add it, but not how to build the contents of the TemplateColumn. There are no useful looking methods on the ITemplate the column class exposes. | 0 | [
2,
184,
20,
625,
6732,
1326,
1895,
21,
22894,
716,
4404,
103,
800,
3726,
3726,
184,
630,
53,
162,
88,
625,
721,
8438,
353,
21,
22894,
716,
4404,
103,
3095,
17,
4721,
32,
20,
21,
1054,
16375,
9,
31,
143,
184,
20,
3547,
32,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ruby on Rails Migration - Create Schema
===
I have a migration that runs an SQL script to create a new Postgres schema which seems to work fine. The problem is that after the migration has run, when it tries to update the 'schema_info' table it says that it does not exist, as if it is looking for it in the new schema and not the default public schema where the table actually is.
Does anybody know how I can tell it to look at the public schema for this table?
Thanks for your help
Chris Knight | 0 | [
2,
10811,
27,
2240,
18,
8443,
13,
8,
1600,
23874,
800,
3726,
3726,
31,
57,
21,
8443,
30,
1461,
40,
4444,
255,
3884,
20,
1600,
21,
78,
678,
6879,
18,
23874,
56,
2206,
20,
170,
1123,
9,
14,
1448,
25,
30,
75,
14,
8443,
63,
485,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do you think good developers should have lots of certificates?
===
When hiring a developer, some HR departments sort received CV's by the number of enclosed certificates from Microsoft, Oracle, e.t.c. And this way they miss a skilled developer sometimes, because they just invite certified people only for the interview. Do you think this is enough reason to sign up for a certain certificate? Personally I prefer to prove my skills writing good code, but maybe this is wrong thinking? | 0 | [
2,
107,
42,
277,
254,
10168,
378,
57,
7503,
16,
6259,
18,
60,
800,
3726,
3726,
76,
16867,
21,
10058,
15,
109,
13,
3112,
8627,
2058,
420,
13,
12732,
22,
18,
34,
14,
234,
16,
12188,
6259,
18,
37,
7099,
15,
15759,
15,
13,
62,
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... |
.NET's SslStream is always negotiating to the least secure cipher I have. How can I change this?
===
SslStream is supposed to negotiate the cipher type, key length, hash algorithm, etc. with its peer SSL stack. When using it in my code, I find that the negotiation always defaults to RC4 & MD5. I would like to use 3DES or AES for some added security.
Looking around the web I find only a few references to this problem and no solutions; one poster is claiming this actually makes sense, since the lowest common denominator between the two stacks is secure while has the added benefit of being faster/using less CPU resources. While this may be technically correct, my particular trade-off between complexity and cost lies elsewhere (I prefer to use AES with a long key).
If anyone can help I'd appreciate it. | 0 | [
2,
13,
9,
2328,
22,
18,
13,
18,
18,
255,
11260,
25,
550,
21489,
20,
14,
639,
4315,
23525,
31,
57,
9,
184,
92,
31,
753,
48,
60,
800,
3726,
3726,
13,
18,
18,
255,
11260,
25,
2293,
20,
15172,
14,
23525,
1001,
15,
1246,
1476,
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... |
Attaching additional javadoc in Intellij IDEA
===
When I use quick documentaion lookup (Ctrl+Q) on j2ee classes or annotations in IDEA I only get an empty javadoc. It only contains the basics like class name.
How do I add the javadoc to the libs IDEA provides itself? | 0 | [
2,
19514,
68,
1351,
8247,
13799,
19,
19,
4213,
9999,
882,
800,
3726,
3726,
76,
31,
275,
2231,
4492,
58,
872,
361,
576,
13,
5,
4812,
6362,
2430,
1251,
6,
27,
487,
135,
2851,
2684,
54,
40,
1270,
7504,
19,
882,
31,
104,
164,
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... |
How to extend default timeout period in flash application?
===
I have an application written in flash (actually it is written in haXe and run under SHWX but it doesn't matter here). I have a pretty complex task that consumes a lot of CPU power and sometimes executes for more that 15 seconds. If that happens, I've got an error saying 'A script has executed for longer than the default timeout period of 15 seconds.' and everything crashes.
I know I can use continuations to stop this from happening but is there a way to extend that 'default timeout period'? It's a developer tool, responsivnes doesn't really matter. | 0 | [
2,
184,
20,
7206,
12838,
85,
1320,
620,
19,
4433,
3010,
60,
800,
3726,
3726,
31,
57,
40,
3010,
642,
19,
4433,
13,
5,
15661,
32,
25,
642,
19,
1458,
13012,
17,
485,
131,
5527,
499,
396,
47,
32,
1437,
22,
38,
1161,
235,
6,
9,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can Visual Studio 2008 work with Team System 2005?
===
I would like to upgrade my team from VS2005 to VS2008 without touching the version of Team Server which is 2005.
Is that possible?
And if so, how do I tell VS to recognize TFS ? Currently in my VS2008 options menu, I don't have any source control to choose from... | 0 | [
2,
92,
3458,
1120,
570,
170,
29,
173,
329,
812,
60,
800,
3726,
3726,
31,
83,
101,
20,
9483,
51,
173,
37,
4611,
2835,
20,
4611,
2753,
366,
6652,
14,
615,
16,
173,
8128,
56,
25,
812,
9,
25,
30,
938,
60,
17,
100,
86,
15,
184,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XMP library for ruby
===
Could any one recommended an open source library that allows me add XMP metadata to JPEG images?
Thanks.
| 0 | [
2,
993,
2554,
1248,
26,
10811,
800,
3726,
3726,
110,
186,
53,
5773,
40,
368,
1267,
1248,
30,
2965,
55,
3547,
993,
2554,
28057,
20,
487,
20427,
3502,
60,
3669,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is the value of href attribute in openid.server link tag if Techorati OpenID is hosted at my site?
===
I want to log in to Stack Overflow with Techorati OpenID hosted at my site.
http://stackoverflow.com/users/login has some basic information.
I understood that I should change
<link rel="openid.delegate" href="http://yourname.x.com" />
to
<link rel="openid.delegate" href="http://technorati.com/people/technorati/USERNAME/" />
but if I change
<link rel="openid.server" href="http://x.com/server" />
to
<link rel="openid.server" href="http://technorati.com/server" />
or
<link rel="openid.server" href="http://technorati.com/" />
it does not work. | 0 | [
2,
98,
25,
14,
1923,
16,
746,
14057,
35,
14755,
19,
368,
1340,
9,
10321,
106,
3508,
3383,
100,
6145,
248,
5166,
368,
1340,
25,
2812,
35,
51,
689,
60,
800,
3726,
3726,
31,
259,
20,
6738,
19,
20,
7566,
20285,
29,
6145,
248,
5166,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 calculate the sum of values in a tree using SQL
===
I need to sum points on each level earned by a tree of users. Level 1 is the sum of users' points of the users 1 level below the user. Level 2 is the Level 1 points of the users 2 levels below the user, etc...
What would the SQL look like to do it?
If you're confused, don't worry, I am as well!
User table:
ID ParentID Points
1 0 230
2 1 150
3 0 80
4 1 110
5 4 54
6 4 342
Tree:
0
|---\
1 3
| \
2 4---
\ \
5 6
Output should be:
ID Points Level1 Level2
1 230 150+110 150+110+54+342
2 150
3 80
4 110 54+342
5 54
6 342
SQL Server Syntax and functions preferably... | 0 | [
2,
184,
20,
18469,
14,
3907,
16,
4070,
19,
21,
1541,
568,
4444,
255,
800,
3726,
3726,
31,
376,
20,
3907,
819,
27,
206,
662,
1931,
34,
21,
1541,
16,
3878,
9,
662,
137,
25,
14,
3907,
16,
3878,
22,
819,
16,
14,
3878,
137,
662,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 escape brackets in a format string in .Net
===
How can brackets be escaped in a C# format string so, something like :
String val = "1,2,3"
String.Format(" foo {{0}}", val);
doesn't throw a parse exception but actually outputs the string " foo {1,2,3}"
Is there a way to escape the brackets or should a workaround be used. | 0 | [
2,
184,
20,
2220,
21971,
19,
21,
2595,
3724,
19,
13,
9,
2328,
800,
3726,
3726,
184,
92,
21971,
44,
5409,
19,
21,
272,
5910,
2595,
3724,
86,
15,
301,
101,
13,
45,
3724,
3347,
800,
13,
7,
15793,
15,
240,
7,
3724,
9,
23588,
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... |
Mercury Quick Test Pro and Virtual machines: Works from one client machine but not another
===
I have a virtual machine (VMware) with Mercury Quick Test Professional 9.2 installed. I have a script to test an application, written in VB.NET using the Infragistics library.
If I access this virtual machine using my laptop (using Remote Desktop), everything works fine, the script completes without a problem. My laptop runs XP, with Windows Classic theme.
If I access this virtual machine using another machine (using Remote Desktop), the script starts fine, but stops halfway through, without no error message from QTP, nothing. This machine runs XP, with Windows Classic theme.
One difference between the two setups is the size of the screen, the laptop is 1920x1280, other machine 1280x1024.
The step where the script stops involves checking a checkbox within an UltraWinGrid. The checkbox itself is displayed, is on the screen in both cases.
Has anyone had this problem before, or have any idea why the behaviour is different between the two machines?
Thanks.
| 0 | [
2,
9012,
2231,
1289,
895,
17,
6599,
6035,
45,
693,
37,
53,
6819,
1940,
47,
52,
226,
800,
3726,
3726,
31,
57,
21,
6599,
1940,
13,
5,
20147,
5011,
6,
29,
9012,
2231,
1289,
736,
561,
9,
135,
4066,
9,
31,
57,
21,
3884,
20,
1289,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 trace javascript events like onclick onblur?
===
Is there a way to debug/trace every javascript event in Internet Explorer 7?
I have a bug that prevents scrolling after text-selecting, and I have no idea which event or action creates the bug. I really want to see which events are being triggered when I move the mouse for example. | 0 | [
2,
184,
20,
5565,
8247,
8741,
963,
101,
27,
150,
10129,
27,
220,
14130,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
121,
16254,
118,
38,
7367,
352,
8247,
8741,
807,
19,
2620,
8520,
453,
60,
31,
57,
21,
6256,
30,
2501,
18,
13,
28... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Checking if a directory contains files
===
How do I check if a directory contains files?
Something similar to this:
if [ -e /some/dir/* ]; then echo "huzzah"; fi;
but which works if the directory contains one or several files (the above one only works with exactly 0 or 1 files). | 0 | [
2,
9886,
100,
21,
16755,
1588,
6488,
800,
3726,
3726,
184,
107,
31,
2631,
100,
21,
16755,
1588,
6488,
60,
301,
835,
20,
48,
45,
100,
636,
13,
8,
62,
13,
118,
3220,
118,
9035,
118,
2483,
13,
12660,
94,
8117,
13,
7,
2242,
5092,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Unit testing for C++ code - Tools and methodology
===
I work on a large c++ system that is being developed for a few years now. As part of an effort to improve the quality of the existing code we engaged on a large long-term refactoring project.
Do you know a good tool that can help me write unit tests in C++? Maybe something similar to Junit or Nunit?
Can anyone give some good advice on the methodology of writing unit tests for modules that were written without unit testing in mind? | 0 | [
2,
1237,
4431,
26,
272,
20512,
1797,
13,
8,
4672,
17,
18653,
800,
3726,
3726,
31,
170,
27,
21,
370,
272,
20512,
329,
30,
25,
142,
885,
26,
21,
310,
122,
130,
9,
28,
141,
16,
40,
2150,
20,
3545,
14,
2190,
16,
14,
3149,
1797,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way to debug an ODBC driver on Windows
===
What is the best way to debug a custom ODBC driver on Windows? A former member of our team wrote the driver so we have the source available.
How do you attach a debugger to the driver? Or is it easier to just add "trace prints" to the driver to see what is going on?
| 0 | [
2,
246,
161,
20,
121,
16254,
40,
12340,
7229,
2425,
27,
1936,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
121,
16254,
21,
5816,
12340,
7229,
2425,
27,
1936,
60,
21,
336,
322,
16,
318,
173,
738,
14,
2425,
86,
95,
57,
14,
1267,
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 represent date and/or time information in JSON?
===
JSON text ([RFC 4627][1]) has unambigious representation of objects, arrays, strings, numbers, Boolean values (literally `true` or `false`) and `null`. However, it has nothing defined for representing time information like date and time of day, which is very common in applications. What are the current methods in use to represent time in JSON given the constraints and grammar laid out in [RFC 4627][2]?
Note to respondents: The purpose of this question is to document the various methods known to be in circulation along with examples and relative pros and cons (ideally from field experience).
[1]: http://www.ietf.org/rfc/rfc4627.txt?number=4627
[2]: http://www.ietf.org/rfc/rfc4627.txt?number=4627
[3]: http://www.w3.org/TR/1998/NOTE-datetime-19980827 | 0 | [
2,
184,
20,
3501,
1231,
17,
118,
248,
85,
676,
19,
487,
528,
60,
800,
3726,
3726,
487,
528,
1854,
13,
5,
2558,
139,
7061,
5084,
2567,
500,
2558,
165,
500,
6,
63,
367,
9150,
5449,
267,
5442,
16,
3916,
15,
7718,
18,
15,
7887,
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... |
Export variable from C++ static library
===
I have a static library written in C++ and I have a structure describing data format, i.e.<br><br>
<code>
struct Format{<br>
long fmtId;<br>
long dataChunkSize;<br>
long headerSize;<br>
bool operator==(Format const & other) const;<br>
};<br>
</code>
Some of data formats are widely used, like <code>{fmtId=0, dataChunkSize=128, headerSize=0}</code> and <code>{fmtId=0, dataChunkSize=256, headerSize=0}</code><br><br>
Some data structure classes receive format in constructor. I'd like to have some sort of shortcuts for those widely used formats, like a couple of static <code>Format</code> members <code>gFmt128, gFmt256</code> that I can pass by reference.
But if I try and do it in the main module that uses the lib, the linker complains about unresolved external <code>gFmt128</code>.
How can I make my library 'export' those global vars, so I can use them from other modules? | 0 | [
2,
7487,
7612,
37,
272,
20512,
12038,
1248,
800,
3726,
3726,
31,
57,
21,
12038,
1248,
642,
19,
272,
20512,
17,
31,
57,
21,
1411,
7153,
1054,
2595,
15,
31,
9,
62,
9,
1,
5145,
1,
5145,
1,
13,
1,
9375,
1,
13,
10346,
2595,
1,
51... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Amazon S3 standalone stub server
===
I seem to recall reading about an Amazon S3-compatible test server that you could run on your own server for unit tests or whatever. However, I've just exhausted my patience looking for this with both Google and AWS. Does such a thing exist? If not, I think I'll write one. | 0 | [
2,
8059,
13,
18,
240,
26986,
21354,
8128,
800,
3726,
3726,
31,
2260,
20,
7111,
1876,
88,
40,
8059,
13,
18,
240,
8,
20049,
1289,
8128,
30,
42,
110,
485,
27,
154,
258,
8128,
26,
1237,
4894,
54,
2099,
9,
207,
15,
31,
22,
195,
114... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
best IDE for ruby on rails
===
Having moved from java to ruby, I am struggling to find a good IDE for ruby. I used eclipse on java, so I tried Aptana Studio (previously Radrails), but its not even half as good.
Currently I am trying out Netbeans for Ruby.
Please suggest me the best RoR IDE out there. | 4 | [
2,
246,
13,
3448,
26,
10811,
27,
2240,
18,
800,
3726,
3726,
452,
385,
37,
8247,
20,
10811,
15,
31,
589,
7587,
20,
477,
21,
254,
13,
3448,
26,
10811,
9,
31,
147,
11652,
27,
8247,
15,
86,
31,
794,
8442,
9068,
1120,
13,
5,
17603,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 wrap an existing memory buffer as a DC for GDI
===
I have a memory buffer corresponding to my screen resolution (1280x800 at 24-bits-per-pixel) that contains my screen contents at 24bpp. I want to convert this to 8-bpp (ie. Halftone color palette in Windows).
I currently do this:
1. Use CreateDIBSection to allocate a new 1280x800 24-bpp buffer and access it as a DC, as well as a plain memory buffer
2. Use memcpy to copy from my original buffer to this new buffer from step 1
3. Use BitBlt to let GDI perform the color conversion
I want to avoid the extra memcpy of step 2. To do this, I can think of two approaches:
a. Wrap my original mem buf in a DC to perform BitBlt directly from it
b. Write my own 24-bpp to 8-bpp color conversion. I can't find any info on how Windows implements this halftone color conversion. Besides even if I find out, I won't be using the accelerated features of GDI that BitBlt has access to.
So how do I do either (a) or (b)?
thanks! | 0 | [
2,
184,
20,
8118,
40,
3149,
1912,
17497,
28,
21,
4752,
26,
489,
1115,
800,
3726,
3726,
31,
57,
21,
1912,
17497,
7265,
20,
51,
2324,
4302,
13,
5,
918,
2887,
396,
8464,
35,
937,
8,
3326,
18,
8,
1432,
8,
18321,
532,
6,
30,
1588,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
jQuery attribute selectors: How to query for an attribute with a custom namespace
===
Suppose I have a simple XHTML document that uses a custom namespace for attributes:
<html xmlns="..." custom:xmlns="http://www.example.com/ns">
...
<div class="foo" custom:attr="bla"/>
...
</html>
How do I select that custom attribute using jQuery? Using
$("div[custom:attr]")
does not work. (Tried with Firefox only, so far.) | 0 | [
2,
487,
8190,
93,
35,
14755,
23946,
18,
45,
184,
20,
25597,
26,
40,
35,
14755,
29,
21,
5816,
204,
5582,
800,
3726,
3726,
5787,
31,
57,
21,
1935,
993,
15895,
4492,
30,
2027,
21,
5816,
204,
5582,
26,
13422,
45,
13,
1,
15895,
23504... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 drawString method be used for writing diognal way.
===
I am using c# 2005 i want to write string diagonally on image. But by default c# provides the option to write horizontally or vertically.
how we write diagonally?
Thanks | 0 | [
2,
184,
92,
2003,
11130,
2109,
44,
147,
26,
1174,
926,
5598,
5025,
161,
9,
800,
3726,
3726,
31,
589,
568,
272,
5910,
812,
31,
259,
20,
2757,
3724,
16807,
102,
27,
1961,
9,
47,
34,
12838,
272,
5910,
1927,
14,
4255,
20,
2757,
2565... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Streaming audio with Flash / Actionscript 3 - Slow playback problem
===
I've written a simple Flash player for a Shoutcast stream. At first it seemed to work reliably, however about 5% of the time users experience slow playback where the stream plays at roughly half of normal speed.
All files being streamed are MP3, encoded at 128kbps/44.1kHz, the same settings as used in the Shoutcast config files, so the issue is not caused by mismatched bit rates as suggested on a number of forums I have read. Has anyone else encountered this problem and possibly found a solution?
Regards,
Alan | 0 | [
2,
11920,
4023,
29,
4433,
13,
118,
1028,
8741,
203,
13,
8,
2276,
21306,
1448,
800,
3726,
3726,
31,
22,
195,
642,
21,
1935,
4433,
517,
26,
21,
11905,
6146,
3766,
9,
35,
64,
32,
890,
20,
170,
13,
19003,
4801,
15,
207,
88,
13,
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... |
Debugging techniques
===
Debugging is the most time consuming activity of programming. So using appropriate tools and techniques is paramount to efficiency and productivity.
What are your favorite debugging techniques, and in which cases do you apply each of them?
There are many orthogonal criteria to consider:
- Programming languages (tools usually are language specific, and there are maybe some techniques that are applicacble only within specific languages)
- Applications (web applications, client side, server side, singlethreaded versus multithreaded)
- Environment (how many tiers, is it on a stored procedure, is it on an embedded device)
But I'm mainly interested on techniques (and tools, if there are any) which are generally applicable and that you find most useful for finding and squashing bugs. | 4 | [
2,
121,
16254,
2762,
4212,
800,
3726,
3726,
121,
16254,
2762,
25,
14,
127,
85,
13,
17601,
2358,
16,
3143,
9,
86,
568,
4593,
4672,
17,
4212,
25,
13195,
20,
7836,
17,
18211,
9,
98,
50,
154,
3839,
121,
16254,
2762,
4212,
15,
17,
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... |
Switch over PropertyType
===
How can I make this work?
switch(property.PropertyType){
case typeof(Boolean):
//doStuff
break;
case typeof(String):
//doOtherStuff
break;
default: break;
}
I don't want to use the name since string comparing for types is just awfull and can be subject to change. | 0 | [
2,
5521,
84,
1354,
4474,
800,
3726,
3726,
184,
92,
31,
233,
48,
170,
60,
5521,
5,
10890,
106,
1084,
9,
10890,
106,
1084,
4474,
6,
1,
610,
1001,
1041,
5,
10858,
413,
210,
6,
45,
12894,
537,
384,
5386,
1442,
73,
610,
1001,
1041,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
crti.o file missing
===
I'm building a project using a gnu tool chain and everything works fine until I get to linking it, where the linker complains that it is missing/can't find crti.o. This is not one of my object files, it seems to be related to libc but I can't understand why it would need this crti.o, wouldn't it use a library file, e.g. libc.a ??
A solution and explanation would be great :-)
Thanks,
Richard | 0 | [
2,
6186,
1388,
9,
111,
3893,
2863,
800,
3726,
3726,
31,
22,
79,
353,
21,
669,
568,
21,
26092,
5607,
2858,
17,
796,
693,
1123,
163,
31,
164,
20,
12585,
32,
15,
113,
14,
3508,
106,
15310,
18,
30,
32,
25,
2863,
118,
1245,
22,
38,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What do you need from a test harness?
===
I'm one of the people involved in the <a href="http://testanything.org/wiki/index.php/TAP_at_IETF:_Notes">Test Anything Protocol (TAP) IETF group</a> (if interested, feel free to join the mailing list). Many programming languages are starting to adopt TAP as their primary testing protocol and they want more from it than what we currently offer. As a result, we'd like to get feedback from people who have a background in xUnit, TestNG or any other testing framework/methodology.
Basically, aside from a simple pass/fail, what information do you need from a test harness? Just to give you some examples:
* Filename and line number (if applicable)
* Start and end time
* Diagnostic output such as the difference between what you got and what you expected.
And so on ... | 0 | [
2,
98,
107,
42,
376,
37,
21,
1289,
16445,
60,
800,
3726,
3726,
31,
22,
79,
53,
16,
14,
148,
1013,
19,
14,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
10543,
20938,
9,
5583,
118,
17375,
118,
25671,
9,
26120,
118,
38,
2552,
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... |
Easiest cross platform widget toolkit?
===
What is the **easiest** cross platform widget toolkit? that minimally covers Windows, osx, and Linux with a c interface? | 0 | [
2,
27237,
919,
2452,
4807,
43,
3060,
5607,
13703,
60,
800,
3726,
3726,
98,
25,
14,
13,
1409,
3537,
18,
10727,
1409,
919,
2452,
4807,
43,
3060,
5607,
13703,
60,
30,
8663,
102,
2937,
1936,
15,
13,
759,
396,
15,
17,
13024,
29,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
TDD class stub generators?
===
I am looking for a tool that can take a unit test, like
IPerson p = new Person();
p.Name = "Sklivvz";
Assert.AreEqual("Sklivvz", p.Name);
and generate the corresponding stub class and interface
interface IPerson
{
string Name { get; set; }
}
class Person: IPerson
{
private string name;
public string Name
{
get
{
return name;
}
set
{
name = value;
}
}
public Person()
{
}
}
I know ReSharper does some of this, but I need a complete tool.
If there is no such tool, how would you write it (e.g. extending ReSharper, from scratch, using which libraries)?
| 0 | [
2,
15596,
43,
718,
21354,
20495,
60,
800,
3726,
3726,
31,
589,
699,
26,
21,
5607,
30,
92,
247,
21,
1237,
1289,
15,
101,
31,
7276,
351,
800,
78,
840,
5,
6,
73,
351,
9,
7259,
800,
13,
7,
18,
17833,
20492,
380,
7,
73,
10908,
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... |
Is there any point for interfaces in dynamic languages?
===
In static languages like Java you need interfaces because
otherwise the type system just won't let you do certain things.
But in dynamic languages like PHP and Python you just take
advantage of *duck-typing*.
PHP and Python both support interfaces.
Ruby and many others doesn't have them.
So you can clearly live happily without them.
I've been mostly doing my work in PHP and have never really
made use of the ability to define interfaces. When I need a
set of classes to implement certain common interface, then
I just describe it in documentation.
So, what do you think? Aren't you better off without using
interfaces in dynamic languages at all? | 0 | [
2,
25,
80,
186,
454,
26,
6573,
18,
19,
7782,
2556,
60,
800,
3726,
3726,
19,
12038,
2556,
101,
8247,
42,
376,
6573,
18,
185,
3190,
14,
1001,
329,
114,
230,
22,
38,
408,
42,
107,
1200,
564,
9,
47,
19,
7782,
2556,
101,
13,
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... |
JBoss 4.23 and EJB 2 support
===
Does anyone know if the JBoss 4.2.3 release that is compiled for Java 6 still supports EJB 2? I'm having issues where it can't cast a class to a certain interface where I never had this problem before and the code hasn't changed. | 0 | [
2,
487,
10349,
18,
268,
9,
2001,
17,
13,
10022,
220,
172,
555,
800,
3726,
3726,
630,
1276,
143,
100,
14,
487,
10349,
18,
268,
9,
135,
9,
240,
830,
30,
25,
9316,
26,
8247,
400,
174,
6747,
13,
10022,
220,
172,
60,
31,
22,
79,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MS SQL Server 2005 - How to Auto Increment a field (not primary key)
===
I would like to automatically increment a field when a row is updated.
Currently I am doing it via the sql update statement.
i.e "UPDATE tb_users SET name = @name, incrementID = incrementID + 1 .....
I'm wondering how I can do this automatically. Any help muchos appreciated.
Thanks
| 0 | [
2,
4235,
4444,
255,
8128,
812,
13,
8,
184,
20,
3108,
13,
28461,
21,
575,
13,
5,
1270,
1256,
1246,
6,
800,
3726,
3726,
31,
83,
101,
20,
7499,
13,
28461,
21,
575,
76,
21,
3131,
25,
6372,
9,
871,
31,
589,
845,
32,
1197,
14,
444... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JavaScript RegEx Help
===
I'm trying to match elements with a name that is 'container1$container2$chkChecked', using a regex of '.+\$chkChecked', but I'm not getting the matches I expect when the element name is as described. What am I doing wrong? | 0 | [
2,
8247,
8741,
7953,
1706,
448,
800,
3726,
3726,
31,
22,
79,
749,
20,
730,
2065,
29,
21,
204,
30,
25,
13,
22,
1126,
5851,
106,
165,
4403,
1126,
5851,
106,
135,
4403,
673,
197,
12542,
69,
22,
15,
568,
21,
7953,
1706,
16,
13,
22... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PostSharp - il weaving - thoughts
===
I am considering using Postsharp framework to ease the burden of application method logging.
It basically allows me to adorn methods with logging attribute and at compile time injects the logging code needed into the il. I like this solution as it keeps the noise out of the deign time code environment.
Any thoughts, experiences or better alternatives? | 0 | [
2,
678,
23646,
13,
8,
6317,
17909,
13,
8,
3064,
800,
3726,
3726,
31,
589,
5154,
568,
678,
23646,
6596,
20,
6378,
14,
9505,
16,
3010,
2109,
13,
13919,
9,
32,
11374,
2965,
55,
20,
26003,
3195,
29,
13,
13919,
35,
14755,
17,
35,
265... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
NI CVI with Python
===
I'd like to integrate a Python IDLE-esque command prompt interface into an existing NI-CVI (LabView) application. I've tried to follow the Python.org discussions but seem to get lost in the details. Is there a resource out there for dummies like me? | 0 | [
2,
1781,
272,
1755,
29,
20059,
800,
3726,
3726,
31,
22,
43,
101,
20,
18399,
21,
20059,
18652,
8,
17029,
1202,
11443,
4417,
6573,
77,
40,
3149,
1781,
8,
150,
1755,
13,
5,
9086,
4725,
6,
3010,
9,
31,
22,
195,
794,
20,
1740,
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... |
What is the best way to add users to multiple groups in a database?
===
In an application where users can belong to multiple groups, I'm currently storing their groups in a column called `groups` as a binary. Every four bytes is a 32 bit integer which is the `GroupID`. However, this means that to enumerate all the users in a group I have to programatically select all users, and manually find out if they contain that group.
Another method was to use a unicode string, where each character is the integer denoting a group, and this makes searching easy, but is a bit of a fudge.
Another method is to create a seperate table, linking users to groups. One column called `UserID` and another called `GroupID`.
Which of these ways would be the best to do it? Or is there a better way? | 0 | [
2,
98,
25,
14,
246,
161,
20,
3547,
3878,
20,
1886,
1170,
19,
21,
6018,
60,
800,
3726,
3726,
19,
40,
3010,
113,
3878,
92,
6219,
20,
1886,
1170,
15,
31,
22,
79,
871,
25615,
66,
1170,
19,
21,
4698,
227,
13,
1,
8024,
18,
1,
28,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I specify the local address on a java.net.URLConnection?
===
My Tomcat instance is listening to multiple IP adress, but I want to control what source IP address is used when opening a URLConnection. How can I specify this? | 0 | [
2,
184,
92,
31,
19077,
14,
375,
3218,
27,
21,
8247,
9,
2328,
9,
911,
255,
25996,
872,
60,
800,
3726,
3726,
51,
2067,
5782,
4851,
25,
4948,
20,
1886,
15735,
21,
19137,
18,
15,
47,
31,
259,
20,
569,
98,
1267,
15735,
3218,
25,
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,
0,
0,
0... |
How do you implement unit-testing in large scale C++ projects?
===
I believe strongly in using unit-tests as an approach to building large multi-platform applications. We currently are planning on having our unit-tests within a separate project. This has the benefit of keeping are code base clean. I think, however, that this would separate the test code from the implementation of the unit. What do you think of this approach and are there any tools like JUnit for c++ applications? | 0 | [
2,
184,
107,
42,
8713,
1237,
8,
10543,
68,
19,
370,
3464,
272,
20512,
2314,
60,
800,
3726,
3726,
31,
985,
5020,
19,
568,
1237,
8,
10543,
18,
28,
40,
2141,
20,
353,
370,
1889,
8,
27035,
3767,
9,
95,
871,
50,
2334,
27,
452,
318,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the differences(pros/cons) between clustered and non-clustered indexes
===
What are the differences(pros/cons) between clustered and non-clustered indexes?
| 0 | [
2,
98,
50,
14,
4921,
5,
2740,
18,
118,
12124,
6,
128,
7460,
69,
17,
538,
8,
10301,
18,
10919,
4348,
160,
800,
3726,
3726,
98,
50,
14,
4921,
5,
2740,
18,
118,
12124,
6,
128,
7460,
69,
17,
538,
8,
10301,
18,
10919,
4348,
160,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
JSTL/JSP EL (Expression Language) in a non JSP (standalone) context
===
Can anyone recommend a framework for templating/formatting messages in a standalone application along the lines of the JSP EL (Expression Language)?
I would expect to be able to instantiate a an object of some sort, give it a template along the lines of
Dear ${customer.firstName}. You order will be dispatched on ${order.estimatedDispatchDate}
provide it with a context which would include a value dictionary of parameter objects (in this case an object of type Customer with a name 'customer', say, and an object of type Order with a name 'order').
I know there are many template frameworks out there - many of which work outside the web application context, but I do not see this as a big heavyweight templating framework. Just a better version of the basic Message Format funtionality Java already provides
For example, I can accomplish the above with java.text.MessageFormat by using a template (or a 'pattern' as they call it) such as
Dear {0}. You order will be dispatched on {1,date,EEE dd MMM yyyy}
and I can pass it an Object array, in my calling Java program
new Object[] { customer.getFirstName(), order.getEstimatedDispatchDate() };
However, in this usage, the code and the pattern are intimately linked. While I could put the pattern in a resource properties file, the code and the pattern need to know intimate details about each other. With an EL-like system, the contract between the code and the pattern would be at a much higher level (e.g. customer and order, rather then customer.firstName and order.estimatedDispatchDate), making it easier to change the structure, order and contents of the message without changing any code.
| 0 | [
2,
487,
18,
7786,
118,
728,
3401,
931,
13,
5,
28993,
816,
6,
19,
21,
538,
487,
3401,
13,
5,
10731,
17979,
6,
4141,
800,
3726,
3726,
92,
1276,
12360,
21,
6596,
26,
13,
9577,
255,
1880,
118,
23588,
1203,
7561,
19,
21,
26986,
3010,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PHP equivalent of Perl's 'use strict' (to require variables to be initialzied before use)
===
Python's convention is that variables are created by first assignment, and trying to read their value before one has been assigned raises an exception. PHP by contrast implicitly creates a variable when it is read, with a null value. This means it is easy to do this in PHP:
function mymodule_important_calculation() {
$result = /* ... long and complex calculation ... */;
return $resukt;
}
This function always returns null, and if null is a valid value for the functuion then the bug might go undetected for some time. The Python equivalent would complain that the variable `resukt` is being used before it is assigned.
So... is there a way to configure PHP to be stricter with variable assignments? | 0 | [
2,
13,
26120,
4602,
16,
416,
255,
22,
18,
13,
22,
3699,
8170,
22,
13,
5,
262,
4077,
12157,
20,
44,
2104,
2553,
69,
115,
275,
6,
800,
3726,
3726,
20059,
22,
18,
3087,
25,
30,
12157,
50,
679,
34,
64,
8427,
15,
17,
749,
20,
130... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
End-to-End application testing from a users standpoint
===
I am looking for a good way to consistently test my web applications from the end users point of view. I have all kinds of ways to check to make sure my code is working behind the scenes. I can't count the number of times that I make a change to a piece of code, test it and it works fine and then deploy it only to have it blow up somewhere else weeks later. I have by that time forgotten the change I made that caused it to blow up. I need something that I can run every time I make a change to assure me I did not break something somewhere else.
It needs to be able to input correct and incorrect entries so that client side validation can be tested also.
Thank you,
Scott and the Dev Team | 0 | [
2,
241,
8,
262,
8,
2451,
3010,
4431,
37,
21,
3878,
1261,
3132,
800,
3726,
3726,
31,
589,
699,
26,
21,
254,
161,
20,
11852,
1289,
51,
2741,
3767,
37,
14,
241,
3878,
454,
16,
1418,
9,
31,
57,
65,
8623,
16,
2847,
20,
2631,
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... |
When people talk about scaling a website with 'shards', what do they mean?
===
I have heard the 'shard' technique mentioned several times with regard to solving scaling problems for large websites. What is this 'shard' technique and why is it so good? | 0 | [
2,
76,
148,
930,
88,
26829,
21,
2271,
29,
13,
22,
18,
6011,
18,
22,
15,
98,
107,
59,
884,
60,
800,
3726,
3726,
31,
57,
752,
14,
13,
22,
18,
6011,
22,
4873,
2211,
238,
436,
29,
6731,
20,
17533,
26829,
1716,
26,
370,
13931,
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 transform a date-string in classic asp
===
I'm a little blockheaded right now...
I have a date string in european format **dd.mm.yyyy** and need to transform it to **mm.dd.yyyy** with classic ASP. Any quick ideas?
Thanks in advance! | 0 | [
2,
184,
20,
8007,
21,
1231,
8,
11130,
19,
2732,
28,
306,
800,
3726,
3726,
31,
22,
79,
21,
265,
1921,
7690,
193,
130,
9,
9,
9,
31,
57,
21,
1231,
3724,
19,
733,
2595,
13,
1409,
8096,
9,
3363,
9,
93,
93,
93,
93,
1409,
17,
376... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
DataGridViewComboBoxColumn adding different items to each row . .
===
I am building a table using the DataGridView where a user can select items from a dropdown in each cell. To simplify the problem, lets say i have 1 column. I am using the DataGridViewComboBoxColumn in the designer. I am trying to support having each row in that column have a different list of items to choose from.
Is this possible? | 0 | [
2,
1054,
16375,
4725,
960,
1192,
5309,
716,
4404,
103,
4721,
421,
3755,
20,
206,
3131,
13,
9,
13,
9,
800,
3726,
3726,
31,
589,
353,
21,
859,
568,
14,
1054,
16375,
4725,
113,
21,
4155,
92,
5407,
3755,
37,
21,
2804,
2968,
19,
206,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Background color of a ListBox item (winforms)
===
How can I set the background color of a specific item in a System.Windows.Forms.ListBox? I would like to be able to set multiple ones if possible. | 0 | [
2,
2395,
1665,
16,
21,
968,
5309,
9101,
13,
5,
4181,
4190,
18,
6,
800,
3726,
3726,
184,
92,
31,
309,
14,
2395,
1665,
16,
21,
1903,
9101,
19,
21,
329,
9,
27508,
18,
9,
4190,
18,
9,
5739,
5309,
60,
31,
83,
101,
20,
44,
777,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I sort by the length of a field.
===
I have a DataGrid where each column has a SortExpression. I would like the sort expression to be the equivalent of "ORDER BY LEN(myField)".
I have tried
SortExpression="LEN(myField)"
but this throws an exception as it is not valid syntax. Any ideas? | 0 | [
2,
184,
107,
31,
2058,
34,
14,
1476,
16,
21,
575,
9,
800,
3726,
3726,
31,
57,
21,
1054,
16375,
113,
206,
4698,
63,
21,
2058,
28993,
9,
31,
83,
101,
14,
2058,
1803,
20,
44,
14,
4602,
16,
13,
7,
7861,
34,
10655,
5,
915,
1109,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 remove all event handlers from a control
===
To create a new event handler on a control you can do this
c.Click += new EventHandler(mainFormButton_Click);
or this
c.Click += mainFormButton_Click;
and to remove an event handler you can do this
c.Click -= mainFormButton_Click;
But how do you remove all event handlers from a control?
| 0 | [
2,
184,
20,
4681,
65,
807,
24641,
18,
37,
21,
569,
800,
3726,
3726,
20,
1600,
21,
78,
807,
24641,
27,
21,
569,
42,
92,
107,
48,
272,
9,
150,
10129,
2754,
3726,
78,
807,
3203,
1252,
5,
6232,
4190,
811,
444,
1,
150,
10129,
6,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I delete duplicate rows in a table
===
I have a table with say 3 columns. There's no primary key so there can be duplicate rows. I need to just keep one and delete the others. Any idea how to do this is Sql Server? | 0 | [
2,
184,
92,
31,
27448,
19429,
11295,
19,
21,
859,
800,
3726,
3726,
31,
57,
21,
859,
29,
395,
203,
7498,
9,
80,
22,
18,
90,
1256,
1246,
86,
80,
92,
44,
19429,
11295,
9,
31,
376,
20,
114,
643,
53,
17,
27448,
14,
654,
9,
186,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0... |
Grep and Sed Equivalent for XML Command Line Processing
===
When doing shell scripting, typically data will be in files of single line records like csv. It's really simple to handle this data with `grep` and `sed`. But I have to deal with XML often, so I'd really like a way to script access to that XML data via the command line. What are the best tools? | 0 | [
2,
5604,
306,
17,
13924,
4602,
26,
23504,
1202,
293,
5511,
800,
3726,
3726,
76,
845,
3593,
3884,
68,
15,
2442,
1054,
129,
44,
19,
6488,
16,
345,
293,
742,
101,
272,
18,
710,
9,
32,
22,
18,
510,
1935,
20,
3053,
48,
1054,
29,
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... |
Order SharePoint search results by more columns
===
I'm using a FullTextSqlQuery in SharePoint 2007 (MOSS) and need to order the results by two columns:
SELECT WorkId FROM SCOPE() ORDER BY Author ASC, Rank DESC
However it seems that only the first column from ORDER BY is taken into account when returning results. In this case the results are ordered correctly by Author, but not by Rank. If I change the order the results will be ordered by Rank, but not by Author.
I had to resort to my own sorting of the results, which I don't like very much. Has anybody a solution to this? | 0 | [
2,
389,
1891,
3132,
2122,
1736,
34,
91,
7498,
800,
3726,
3726,
31,
22,
79,
568,
21,
503,
11969,
18,
22402,
8190,
93,
19,
1891,
3132,
624,
13,
5,
7076,
18,
6,
17,
376,
20,
389,
14,
1736,
34,
81,
7498,
45,
5407,
170,
1340,
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... |
What database privileges does a Wordpress Blog really need?
===
I am setting up a few Wordpress blog sites. I have created a user in mysql that wordpress will use to access its database. The docs say to give this user all privileges on the database.
Does it really need full privileges? I expect not, so does anyone know the min set of privileges that it really needs? | 0 | [
2,
98,
6018,
15977,
630,
21,
833,
5890,
8146,
510,
376,
60,
800,
3726,
3726,
31,
589,
2697,
71,
21,
310,
833,
5890,
8146,
3259,
9,
31,
57,
679,
21,
4155,
19,
51,
18,
22402,
30,
833,
5890,
129,
275,
20,
1381,
82,
6018,
9,
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... |
Is there a pretty printer for python data?
===
Working with python interactively, it's sometimes necessary to display a result which is some arbitrarily complex data structure (like lists with embedded lists, etc.)
The default way to display them is just one massive linear dump which just wraps over and over and you have to parse carefully to read it.
Is there something that will take any python object and display it in a more rational manner. e.g.
[0, 1,
[a, b, c],
2, 3, 4]
instead of:
[0, 1, [a, b, c], 2, 3, 4]
I know that's not a very good example, but I think you get the idea. | 0 | [
2,
25,
80,
21,
1772,
12925,
26,
20059,
1054,
60,
800,
3726,
3726,
638,
29,
20059,
9194,
102,
15,
32,
22,
18,
1030,
2378,
20,
3042,
21,
829,
56,
25,
109,
13,
25267,
18966,
1502,
1054,
1411,
13,
5,
1403,
7227,
29,
12138,
7227,
15,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the use/meaning of the @ character in variable names in C#?
===
I discovered that you can start your variable name with a '@' character in C#.
In my C# project I was using a web service (I added a web reference to my project) that was written in Java. One of the interface objects defined in the WSDL had a member variable with the name "params". Obviously this is a reserved word in C# so you can't have a class with a member variable with the name "params". The proxy object that was generated contained a property that looked like this:
public ArrayList @params {
get { return this.paramsField; }
set { this.paramsField = value; }
}
I searched through the VS 2008 c# documentation but couldn't find anything about it. Also searching Google didn't give me any useful answers. So what is the exact meaning or use of the '@' character in a variable/property name? | 0 | [
2,
98,
22,
18,
14,
275,
118,
14466,
16,
14,
13,
1,
925,
19,
7612,
1817,
19,
272,
5910,
60,
800,
3726,
3726,
31,
1848,
30,
42,
92,
799,
154,
7612,
204,
29,
21,
13,
22,
1,
22,
925,
19,
272,
5910,
9,
19,
51,
272,
5910,
669,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Google App Engine: how can I programmatically access the properties of my Model class?
===
I have a model class:
class Person(db.Model):
first_name = db.StringProperty(required=True)
last_name = db.StringProperty(required=True)
I have an instance of this class in `p`, and string `s` contains the value `'first_name'`. I would like to do something like:
print p[s]
and
p[s] = new_value
Both of which result in a `TypeError`.
Does anybody know how I can achieve what I would like?
| 0 | [
2,
8144,
4865,
1406,
45,
184,
92,
31,
625,
6732,
1326,
1381,
14,
3704,
16,
51,
1061,
718,
60,
800,
3726,
3726,
31,
57,
21,
1061,
718,
45,
718,
840,
5,
9007,
9,
13998,
6,
45,
64,
1,
7259,
800,
13,
9007,
9,
11130,
10890,
106,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Free hosting for C CGI
===
For an Open Source project, I'd like to allow pople to test the application via WEB to see if it's what they were looking for.
The application is in C but I've not found a free hosting that would allow me to do upload my application.
The reason why in general they don't allow to do it is rather obvious but maybe there's an OS-friendly service that would offer such service for free after a selection process.
Any help?
| 0 | [
2,
551,
10637,
26,
272,
272,
2234,
800,
3726,
3726,
26,
40,
368,
1267,
669,
15,
31,
22,
43,
101,
20,
1655,
1675,
413,
20,
1289,
14,
3010,
1197,
2741,
20,
196,
100,
32,
22,
18,
98,
59,
46,
699,
26,
9,
14,
3010,
25,
19,
272,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Fitnesse for Delphi 2006 / Delphi 2007 /Delphi 2009
===
Is there a version of Fitnesse that works on Delphi 2006/2007/2009 ?
If so where can I find It?
Are there any other programs like Fitnesse that work on Delphi 2006 ?
Thanks
Charles
| 0 | [
2,
11331,
62,
26,
23030,
592,
13,
118,
23030,
624,
13,
118,
3436,
7805,
588,
800,
3726,
3726,
25,
80,
21,
615,
16,
11331,
62,
30,
693,
27,
23030,
592,
118,
2727,
118,
2849,
13,
60,
100,
86,
113,
92,
31,
477,
32,
60,
50,
80,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0... |
Detecting Web.Config Authentication Mode
===
Say I have the following web.config:
<?xml version="1.0" encoding="utf-8"?>
<configuration>
<system.web>
<authentication mode="Windows"></authentication>
</system.web>
</configuration>
Using ASP.NET C#, how can I detect the Mode value of the Authentication tag? | 0 | [
2,
9092,
68,
2741,
9,
14093,
2816,
27963,
3740,
800,
3726,
3726,
395,
31,
57,
14,
249,
2741,
9,
14093,
2816,
45,
13,
1,
60,
396,
8184,
615,
3726,
7,
165,
9,
387,
7,
19608,
3726,
7,
1982,
410,
8,
457,
7,
60,
1,
13,
1,
1126,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
D-Editor with debugging
===
i've been programming a while in D [(http://www.digitalmars.com/d/)][1] now. I prefer it to Java because it is faster. However, i have not found an Editor that supports Code-Completion and Debugging (Step-Over, Step-Into, Breakpoints,...).
Do you have any suggestions?
[1]: http://www.digitalmars.com/d/ | 0 | [
2,
13,
43,
8,
13401,
29,
121,
16254,
2762,
800,
3726,
3726,
31,
22,
195,
74,
3143,
21,
133,
19,
13,
43,
636,
5,
21127,
6903,
6483,
9,
24123,
1615,
18,
9,
960,
118,
43,
118,
6,
500,
2558,
165,
500,
130,
9,
31,
6369,
32,
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... |
Multi tenant architecture and NHibernate
===
Could anyone explein me finally what is the best strategy to implement transparient and fluent support of multi-tenant functionality in NHibernate powered domain model?
Im looking for the way, how to keep the domain logic as isolated as possible from the multi-tenant stuff like filtering by TenantID etc | 0 | [
2,
1889,
18536,
2607,
17,
12109,
15191,
8820,
800,
3726,
3726,
110,
1276,
13,
6899,
13535,
55,
722,
98,
25,
14,
246,
4427,
20,
8713,
2982,
3574,
49,
2291,
17,
19252,
555,
16,
1889,
8,
1316,
1830,
18548,
19,
12109,
15191,
8820,
7462,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Rails or Django? (or something else?)
===
I'm interested in learning a web framework. The two big ones, as I gather, are Rails and Django. Which one is better/faster? Is one better designed or more logically consistent than the other? Is there another framework I should look into? How easy is it to set up and administer a Rails or Django server, and how easy is it to find a shared hosting plan?
To give a little background, the websites I'm currently used to making are in straight PHP (no framework) and I'd like to be able to manage some of the complexity that comes from feature creep. Outputting HTML with echo becomes a lot less fun the more you have to customize it. In addition, I don't know either Ruby or Python so I'm free to go either way.
note: I'm not interested in ASP. I'd like to develop on a Mac and deploy to Linux/FreeBSD and I don't think that ASP fits the bill. | 4 | [
2,
2240,
18,
54,
3857,
14541,
60,
13,
5,
248,
301,
962,
60,
6,
800,
3726,
3726,
31,
22,
79,
3158,
19,
2477,
21,
2741,
6596,
9,
14,
81,
580,
53,
18,
15,
28,
31,
7442,
15,
50,
2240,
18,
17,
3857,
14541,
9,
56,
53,
25,
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... |
How to get all datatype sizes and function stack footprint sizes in a C/C++ project?
===
I have a large inherited C/C++ project. Are there any good tools or techniques to produce a report on the "sizeof" of all the datatypes, and a breakdown of the stack footprints of each function in such a project.
| 0 | [
2,
184,
20,
164,
65,
1054,
4474,
13403,
17,
1990,
7566,
18511,
13403,
19,
21,
272,
118,
150,
20512,
669,
60,
800,
3726,
3726,
31,
57,
21,
370,
7179,
272,
118,
150,
20512,
669,
9,
50,
80,
186,
254,
4672,
54,
4212,
20,
2213,
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... |
Software Design Description Practise
===
How many people actually write an SDD document before writing a single line of code?
How do you handle large CSCI's?
What standard do you use for SDD content?
What tailoring have you done? | 0 | [
2,
2306,
704,
5318,
27954,
800,
3726,
3726,
184,
151,
148,
1121,
2757,
40,
13,
18,
8096,
4492,
115,
1174,
21,
345,
293,
16,
1797,
60,
184,
107,
42,
3053,
370,
272,
18,
1892,
22,
18,
60,
98,
1236,
107,
42,
275,
26,
13,
18,
8096... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
TSQL: Are indexes on temporary tables deleted when the table is deleted?
===
Would the following sql remove also the index or does it have to be removed seperately?
CREATE TABLE #Tbl (field int)
CREATE NONCLUSTERED INDEX idx ON #Tbl (field)
DROP TABLE #Tbl | 0 | [
2,
13,
38,
18,
22402,
45,
50,
4348,
160,
27,
4700,
7484,
19584,
76,
14,
859,
25,
19584,
60,
800,
3726,
3726,
83,
14,
249,
4444,
255,
4681,
67,
14,
4348,
54,
630,
32,
57,
20,
44,
1974,
10332,
106,
1373,
102,
60,
1600,
859,
6926... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Cygwin Folders
===
Can I safely rename the cygdrive folder? Also, I would like to add other folders at root and map them to folders on windows in the same way as /cygdrive/c maps to my C drive. Is that possible? | 0 | [
2,
6728,
263,
4181,
19294,
18,
800,
3726,
3726,
92,
31,
9817,
302,
7259,
14,
6728,
263,
14573,
19294,
60,
67,
15,
31,
83,
101,
20,
3547,
89,
19294,
18,
35,
5900,
17,
2942,
105,
20,
19294,
18,
27,
1936,
19,
14,
205,
161,
28,
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,
0... |
Use grep to find content in files and move them if they match
===
I'm using grep to generate a list of files I need to move:
grep -L -r 'Subject: \[SPAM\]' .
How can I pass this list to the mv command and move the files somewhere else?
| 0 | [
2,
275,
5604,
306,
20,
477,
2331,
19,
6488,
17,
780,
105,
100,
59,
730,
800,
3726,
3726,
31,
22,
79,
568,
5604,
306,
20,
7920,
21,
968,
16,
6488,
31,
376,
20,
780,
45,
5604,
306,
13,
8,
255,
13,
8,
139,
13,
22,
28743,
45,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
mailto add urgent priority
===
I want to add a mailto link on our web page. I want to add a urgent priority to this mail. If you can help me that would be great.
Thanks for your help,
Donald | 0 | [
2,
4216,
262,
3547,
15639,
9857,
800,
3726,
3726,
31,
259,
20,
3547,
21,
4216,
262,
3508,
27,
318,
2741,
2478,
9,
31,
259,
20,
3547,
21,
15639,
9857,
20,
48,
4216,
9,
100,
42,
92,
448,
55,
30,
83,
44,
374,
9,
3669,
26,
154,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How does strategy pattern works?
===
How does it work, what is it used for and when should one use it?
**Note:** I know how it works, I just though it will be useful for the answer to be in stackoverflow. | 0 | [
2,
184,
630,
4427,
3732,
693,
60,
800,
3726,
3726,
184,
630,
32,
170,
15,
98,
25,
32,
147,
26,
17,
76,
378,
53,
275,
32,
60,
13,
1409,
10280,
45,
1409,
31,
143,
184,
32,
693,
15,
31,
114,
362,
32,
129,
44,
4811,
26,
14,
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,
0,
0,
0,
0,
0,
0,
0,
0... |
Performance when checking for duplicates
===
I've been working on a project where I need to iterate through a collection of data and remove entries where the "primary key" is duplicated. I have tried using a
List<int>
and
Dictionary<int, bool>
With the dictionary I found slightly better performance, even though I never need the Boolean tagged with each entry. My expectation is that this is because a List allows for indexed access and a Dictionary does not. What I was wondering is, is there a better solution to this problem. I do not need to access the entries again, I only need to track what "primary keys" I have seen and make sure I only perform addition work on entries that have a new primary key. I'm using C# and .NET 2.0. And I have no control over fixing the input data to remove the duplicates from the source (unfortunately!). And so you can have a feel for scaling, overall I'm checking for duplicates about 1,000,000 times in the application, but in subsets of no more than about 64,000 that need to be unique. | 0 | [
2,
956,
76,
9886,
26,
19429,
18,
800,
3726,
3726,
31,
22,
195,
74,
638,
27,
21,
669,
113,
31,
376,
20,
32,
106,
1373,
120,
21,
1206,
16,
1054,
17,
4681,
11399,
113,
14,
13,
7,
29584,
1246,
7,
25,
19429,
43,
9,
31,
57,
794,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Windows API spying/hijacking techniques
===
I'm interested in using API spying/hijacking to implement some core features of a project I'm working on. It's been mentioned [in this question][1] as well, but that wasn't really on topic so I figured it'd be better with a question of its own for this.,
I'd like to gather as much information as possible on this, different techniques/libraries ([MS Detours][2], [IAT patching][3]) or other suggestions.
Also, it'd be especially interesting to know if someone has any real production experience of using such techniques -- can they be made stable enough for production code or is this strictly a technique for research? Does it work properly over multiple versions of windows? How bug prone is it?
Personal experiences and external links both appreciated.
[1]: http://stackoverflow.com/questions/60641/how-to-replace-winapi-functions-calls-in-the-ms-vc-project-with-my-own-implemen
[2]: http://research.microsoft.com/sn/detours/
[3]: http://www.codeproject.com/KB/system/hooksys.aspx | 0 | [
2,
1936,
21,
2159,
25128,
118,
1822,
6994,
68,
4212,
800,
3726,
3726,
31,
22,
79,
3158,
19,
568,
21,
2159,
25128,
118,
1822,
6994,
68,
20,
8713,
109,
2884,
967,
16,
21,
669,
31,
22,
79,
638,
27,
9,
32,
22,
18,
74,
2211,
636,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I use groovy to search+replace in XML?
===
How do I use groovy to search+replace in XML?
I need something as short/easy as possible, since I'll be giving this code to the testers for their SoapUI scripting.
More specifically, how do i turn
"<root><data></data></root>"
into
"<root><data>value</data></root>"
| 0 | [
2,
184,
107,
31,
275,
3452,
2026,
93,
20,
2122,
2430,
99,
5119,
19,
23504,
60,
800,
3726,
3726,
184,
107,
31,
275,
3452,
2026,
93,
20,
2122,
2430,
99,
5119,
19,
23504,
60,
31,
376,
301,
28,
502,
118,
18385,
28,
938,
15,
179,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.