unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Can I add extension methods to an existing static class?
===
I'm a fan of extension methods in C#, but haven't had any success adding an extension method to a static class, such as Console.
For example, if I want to add an extension to Console, called 'WriteBlueLine', so that I can go:
Console.WriteBlueLine("This text is blue");
I tried this by adding a local, public static method, with Console as a 'this' parameter... but no dice!
public static class Helpers {
public static void WriteBlueLine(this Console c, string text)
{
Console.ForegroundColor = ConsoleColor.Blue;
Console.WriteLine(text);
Console.ResetColor();
}
}
This didn't add a 'WriteBlueLine' method to Console... am I doing it wrong? Or asking for the impossible? | 0 | [
2,
92,
31,
3547,
3896,
3195,
20,
40,
3149,
12038,
718,
60,
800,
3726,
3726,
31,
22,
79,
21,
2514,
16,
3896,
3195,
19,
272,
5910,
15,
47,
2933,
22,
38,
41,
186,
1280,
4721,
40,
3896,
2109,
20,
21,
12038,
718,
15,
145,
28,
8650,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Scalable google maps overlay
===
Is it possible to add an image overlay to a google map that scales as the user zooms?
My current code works like this:
var map = new GMap2(document.getElementById("gMap"));
var customIcon = new GIcon();
customIcon.iconSize = new GSize(100, 100);
customIcon.image = "/images/image.png";
map.addOverlay(new GMarker(new GLatLng(50, 50), { icon:customIcon }));
However, this adds an overlay that maintains the same size as the user zooms in and out (it is acts as a UI element like the sidebar zoom control). | 0 | [
2,
18957,
579,
8144,
6867,
84,
4414,
800,
3726,
3726,
25,
32,
938,
20,
3547,
40,
1961,
84,
4414,
20,
21,
8144,
2942,
30,
10105,
28,
14,
4155,
19469,
18,
60,
51,
866,
1797,
693,
101,
48,
45,
4033,
2942,
800,
78,
489,
15022,
135,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What fonts iPhone application support.?
===
I found a list of iPhone supported font here
<http://daringfireball.net/misc/2007/07/iphone-osx-fonts>
But I just wanted to confirm that, can we use all this fonts in application, or we are restricted to some class of fonts.
thanks in advance. | 0 | [
2,
98,
9978,
18,
21024,
3010,
555,
9,
60,
800,
3726,
3726,
31,
216,
21,
968,
16,
21024,
1827,
9978,
235,
13,
1,
21127,
6903,
2542,
68,
5929,
3610,
9,
2328,
118,
5858,
150,
118,
2727,
118,
2984,
118,
49,
7709,
8,
759,
396,
8,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Select from different tables via SQL depending on flag
===
I have a script to extract certain data from a much bigger table, with one field in particular changing regularly, e.g.
SELECT CASE @Flag WHEN 1 THEN t.field1 WHEN 2 THEN t.field2 WHEN 3
THEN t.field3 END as field,
...[A bunch of other fields]
FROM table t
However, the issue is now I want to do other processing on the data. I'm trying to figure out the most effective method. I need to have some way of getting the flag through, so I know I'm talking about data sliced by the right field.
One possible solution I was playing around with a bit (mostly to see what would happen) is to dump the contents of the script into a table function which has the flag passed to it, and then use a SELECT query on the results of the function. I've managed to get it to work, but it's significantly slower than...
The obvious solution, and probably the most efficient use of processor cycles: to create a series of cache tables, one for each of the three flag values. However, the problem then is to find some way of extracting the data from the right cache table to perform the calculation. The obvious, though incorrect, response would be something like
SELECT CASE @Flag WHEN 1 THEN table1.field WHEN 2 THEN table2.field WHEN 3
THEN table3.field END as field,
...[The various calculated fields]
FROM table1, table2, table3
Unfortunately, as is obvious, this creates a massive cross join - which is not my intended result at all.
Does anyone know how to turn that cross join into an "Only look at x table"? (Without use of Dynamic SQL, which makes things hard to deal with?) Or an alternative solution, that's still reasonably speedy? | 0 | [
2,
5407,
37,
421,
7484,
1197,
4444,
255,
4758,
27,
3157,
800,
3726,
3726,
31,
57,
21,
3884,
20,
10962,
1200,
1054,
37,
21,
212,
6197,
859,
15,
29,
53,
575,
19,
1498,
4226,
4217,
15,
13,
62,
9,
263,
9,
5407,
610,
13,
1,
22868,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 new in Visual Studio 2008 vs 2005 or C# 3.0 vs C# 2.0?
===
I was browsing the [Hidden Features of C#][1] question and thought I would try out one of the features I was unfamiliar with. Unfortunately I use Visual Studio 2005 and the feature in question was introduced later. Is there a good list for new features in C# 3.0 (Visual Studio 2008) vs. C# 2.0 (Visual Studio 2005)?
[1]: http://stackoverflow.com/questions/9033/hidden-features-of-c | 0 | [
2,
98,
25,
78,
19,
3458,
1120,
570,
4611,
812,
54,
272,
5910,
203,
9,
387,
4611,
272,
5910,
172,
9,
387,
60,
800,
3726,
3726,
31,
23,
10175,
68,
14,
636,
1822,
43,
817,
967,
16,
272,
5910,
500,
2558,
165,
500,
1301,
17,
289,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Jython 2.2.1, howto move a file? shutils.move is non-existant!
===
'''use Jython'''
import shutil
print dir(shutil)
There is no, shutil.move, how does one move a file with Jython?
and while we at it, how does one delete a file with Jython?
| 0 | [
2,
487,
93,
11570,
172,
9,
135,
9,
165,
15,
184,
262,
780,
21,
3893,
60,
2218,
947,
18,
9,
16598,
25,
538,
8,
1706,
14895,
38,
187,
800,
3726,
3726,
13,
7,
22,
3699,
487,
93,
11570,
7,
22,
9010,
2218,
947,
4793,
13,
9035,
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... |
split xml document into chunks
===
I have a large xml document that needs to be processed 100 records at a time
It is being done within a Windows Service written in c#.
The structure is as follows :
<docket xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="docket.xsd">
<order>
<Date>2008-10-13</Date>
<orderNumber>507580</orderNumber>
<ParcelID/>
<CustomerName>sddsf</CustomerName>
<DeliveryName>dsfd</DeliveryName>
<Address1>sdf</Address1>
<Address2>sdfsdd</Address2>
<Address3>sdfdsfdf</Address3>
<Address4>dffddf</Address4>
<PostCode/>
</order>
<order>
<Date>2008-10-13</Date>
<orderNumber>58023</orderNumber>
<ParcelID/>
<CustomerName>sddsf</CustomerName>
<DeliveryName>dsfd</DeliveryName>
<Address1>sdf</Address1>
<Address2>sdfsdd</Address2>
<Address3>sdfdsfdf</Address3>
<Address4>dffddf</Address4>
<PostCode/>
</order>
.....
.....
</docket>
There could be thousands of orders in a docket.
I need to chop this into 100 element chunks
However each of the 100 orders still need to be wrapped with the parent "docket" node and have the same namespace etc
is this possible? | 0 | [
2,
2132,
23504,
4492,
77,
15009,
18,
800,
3726,
3726,
31,
57,
21,
370,
23504,
4492,
30,
2274,
20,
44,
16697,
808,
742,
35,
21,
85,
32,
25,
142,
677,
363,
21,
1936,
365,
642,
19,
272,
5910,
9,
14,
1411,
25,
28,
2415,
13,
45,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Embedding html code in stored procedures
===
We seem to have a few developers here who think creating stored procedures that spit out HTML or Javascript code is a legitimate thing to do. In my mind this is the ultimate abuse of the separation of concerns model. Is doing something like this people have often seen people doing? | 0 | [
2,
11911,
69,
3258,
13,
15895,
1797,
19,
8214,
8876,
800,
3726,
3726,
95,
2260,
20,
57,
21,
310,
10168,
235,
72,
277,
2936,
8214,
8876,
30,
9286,
70,
13,
15895,
54,
8247,
8741,
1797,
25,
21,
11912,
584,
20,
107,
9,
19,
51,
594,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Virtualenv on Ubuntu with no site-packages
===
I've been using virtualenv lately while developing in python. I like the idea of a segregated development environment using the --no-site-packages option, but doing this while developing a PyGTK app can be a bit tricky. The PyGTK modules are installed on Ubuntu by default, and I would like to make a virtualenv (with --no-site-packages) aware of specific modules that are located elsewhere on the system.
What's the best way to do this? Or should I just suck it up and drop the --no-site-packages option? | 0 | [
2,
6599,
219,
710,
27,
287,
12968,
2473,
29,
90,
689,
8,
8573,
14465,
800,
3726,
3726,
31,
22,
195,
74,
568,
6599,
219,
710,
10434,
133,
3561,
19,
20059,
9,
31,
101,
14,
882,
16,
21,
26855,
522,
2307,
568,
14,
13,
8,
8,
251,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
internet explorer addon BHO development issues
===
I'm trying to develop an Internet Explorer 7 addon using "[Browser Helper Objects][1]" (BHO). The goal is to have a standard IE toolbar with some buttons and one custom control. I would like to develop it in .NET
I started from the baseline sample [here][2]. This works fine but...
- How to control where in the browser the toolbar will show? Currently it just shows on the menu line.
- How to let the user move it like other toolbars. Most other toolbars (built in and addons) have a dashed separator where you can grab and move them.
If there is a better way altogether to develop this (like the FireFox JS addons) I would like to know about it too.
[1]: http://msdn.microsoft.com/en-us/library/bb250436.aspx
[2]: http://www.codeproject.com/KB/shell/dotnetbandobjects.aspx | 0 | [
2,
2620,
8520,
3547,
218,
334,
1807,
522,
1549,
800,
3726,
3726,
31,
22,
79,
749,
20,
2803,
40,
2620,
8520,
453,
3547,
218,
568,
13,
7,
2558,
25699,
4104,
448,
106,
3916,
500,
2558,
165,
500,
7,
13,
5,
220,
1807,
6,
9,
14,
119... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Return type polymorphism in C-like languages
===
Why don't we see C-like languages that allow for callables with polymorphism in the return type? I could see how the additional type inference would be a hurdle, but we have [plenty of languages][1] with full-fledged type inference systems (that work for varying levels of "work").
[1]: http://en.wikipedia.org/wiki/Type_inference | 0 | [
2,
788,
1001,
3446,
13348,
19,
272,
8,
1403,
2556,
800,
3726,
3726,
483,
221,
22,
38,
95,
196,
272,
8,
1403,
2556,
30,
1655,
26,
645,
579,
18,
29,
3446,
13348,
19,
14,
788,
1001,
60,
31,
110,
196,
184,
14,
1351,
1001,
25883,
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... |
Custom collections - still worth the extra work?
===
Excuse me if I'm off on my terminology, I only have around 2.4 years of programming experience, mostly in .NET.
Currently I'm one of two .NET developers in a mainframe shop, the other developer set the standards and is a great coder with a lot more experience plus a CS degree(I am 100% self taught).
We use custom collections for every application, recently since .NET 2.0 I've got him using generics instead of ArrayLists, and eyeball performance they seem to do great. We developed an automated program that uses SQLDMO to connect to databases and will create the base Datalayer and business layers for any objects we'd like, plus it handles logical deletes et cetera.
When performance is what you optimize for, when can you justify NOT using a custom collection and writing a custom sort for it? Currently we use hard coded sorts because everything we've seen is a good deal slower, since most other options use reflection or bloated datasets/LINQ(is it still as slow as it was a year ago compared to custom collections?).
Does anyone else work strictly with custom generic collections instead of going the easy route? Is the performance sacrifice as significant as I have been led to believe? Being that I am still in my infant stages of my development career, I'd say the next logical step is for me to start benchmarking things myself, but I wanted to get the opinion of other professionals as well....So, how does everyone else do it? Am one of the only people who actually strictly use custom collections over the much quicker and easier to create solutions?
All opinions would be greatly appreciated. | 0 | [
2,
5816,
5721,
13,
8,
174,
2715,
14,
2230,
170,
60,
800,
3726,
3726,
6658,
55,
100,
31,
22,
79,
168,
27,
51,
20513,
15,
31,
104,
57,
140,
172,
9,
300,
122,
16,
3143,
1496,
15,
1555,
19,
13,
9,
2328,
9,
871,
31,
22,
79,
53,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Simple Random Samples from a (My)Sql database
===
How do I take an efficient simple random sample in SQL? The database in question is running MySQL; my table is at least 200,000 rows, and I want a simple random sample of about 10,000.
The "obvious" answer is to:
SELECT * FROM table ORDER BY RAND() LIMIT 10000
For large tables, that's too slow: it calls RAND() for every row (which already puts it at O(n)), and sorts them, making it O(n lg n) at best. Is there a way to do this faster than O(n)? | 0 | [
2,
1935,
5477,
7855,
37,
21,
13,
5,
915,
6,
18,
22402,
6018,
800,
3726,
3726,
184,
107,
31,
247,
40,
8243,
1935,
5477,
5717,
19,
4444,
255,
60,
14,
6018,
19,
1301,
25,
946,
51,
18,
22402,
73,
51,
859,
25,
35,
639,
13,
14335,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP.NET AJAX Page Methods from UserControl
===
I would like to utilize the ASP.NET AJAX Page Methods functionality with a user control. Is there a way to be able to specify my static [WebMethod] inside the UserControl's code behind instead of the Page's code behind? | 0 | [
2,
28,
306,
9,
2328,
20624,
2478,
3195,
37,
4155,
12898,
800,
3726,
3726,
31,
83,
101,
20,
13151,
14,
28,
306,
9,
2328,
20624,
2478,
3195,
18548,
29,
21,
4155,
569,
9,
25,
80,
21,
161,
20,
44,
777,
20,
19077,
51,
12038,
636,
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... |
php operator <>
===
can someone explain this one to me? a link to something in the php manual even?? i can't find anything:
if ($_SERVER['SERVER_PORT'] <> 443) {
doSomething();
} | 0 | [
2,
13,
26120,
6022,
13,
1,
800,
3726,
3726,
92,
737,
3271,
48,
53,
20,
55,
60,
21,
3508,
20,
301,
19,
14,
13,
26120,
5132,
166,
60,
60,
31,
92,
22,
38,
477,
602,
45,
100,
13,
5,
4403,
1,
10321,
106,
2558,
22,
10321,
106,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it relatively easy to hack Network Time Protocol(NTP)?
===
I read somewhere that NTP is based on UDP and there's no security built with NTP communication so it is easy to spoof NTP responses. Is it true? Wouldn't that be a major security issue since most of the servers out there depend on NTP to sync their clock? | 0 | [
2,
25,
32,
3109,
2010,
20,
11835,
982,
85,
8494,
5,
2877,
306,
6,
60,
800,
3726,
3726,
31,
1302,
3493,
30,
13,
2877,
306,
25,
432,
27,
287,
7431,
17,
80,
22,
18,
90,
1221,
392,
29,
13,
2877,
306,
3291,
86,
32,
25,
2010,
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... |
Modify the behaviour of a NotifyIcon with via a 3rd party application
===
I've always been curious to see if I can show, hide or change a NotifyIcon created by another application via a C# application.
Could someone please post an example on how to do this? :) | 0 | [
2,
17579,
14,
7727,
16,
21,
52,
8612,
49,
1126,
29,
1197,
21,
203,
897,
346,
3010,
800,
3726,
3726,
31,
22,
195,
550,
74,
7686,
20,
196,
100,
31,
92,
298,
15,
3077,
54,
753,
21,
52,
8612,
49,
1126,
679,
34,
226,
3010,
1197,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Translate SVN path to local file system path in Python
===
I'm writing a utility in Python that will attach changed files in Subversion to an email and send it when a subset of folders that are under source control in SVN have been changed. I am using the pysvn library to access the repository.
I have a copy of the files on my local file system and I do an update to check if the files have changed since the last time the utility was run.
I am at the point where I am translating the path names in SVN to the path names on my local copy.
Currently I have written the following to do the job:
def formatPaths(self, paths):
newPaths = list()
for path in paths:
path = path[len(self.basePath):]
path = path.replace("/", "\\")
newPaths.append(path)
return newPaths
self.basePath would be something like "/trunk/project1" and I'm looking to just get the relative path of a subset of folders (I.e. folder1 under "/trunk/project1").
Is this a good way to solve this problem or is there some magical function I missed? | 0 | [
2,
20628,
13,
18,
16578,
2013,
20,
375,
3893,
329,
2013,
19,
20059,
800,
3726,
3726,
31,
22,
79,
1174,
21,
10082,
19,
20059,
30,
129,
19514,
1015,
6488,
19,
972,
10898,
20,
40,
8517,
17,
2660,
32,
76,
21,
16622,
16,
19294,
18,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Remote desktop client to connect to Linux from Vista x64
===
I am looking at connecting to a openSuse 11.1 Beta 3 virtual machine from my Vista 64-bit development workstation. I found UltraVNC Viewer to be the only option for this purpose. Is there any other clients that I can use to connect from Vista to openSuse/other Linux installs?
Note: Bandwidth is not a worry, the connection will be using a Gigabit network. | 0 | [
2,
5388,
17404,
6819,
20,
6379,
20,
13024,
37,
13520,
993,
3470,
800,
3726,
3726,
31,
589,
699,
35,
6440,
20,
21,
8965,
3699,
547,
9,
165,
8434,
203,
6599,
1940,
37,
51,
13520,
4384,
8,
3326,
522,
170,
10839,
9,
31,
216,
6885,
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... |
Make a scrollable element stay "at the bottom" while adding content.
===
I am building a utility page for a web app that I am working on. I have an element that I want to use as a "console" of sorts.
I get entries for the console via Ajax calls (using prototype's `Ajax.PeriodicalUpdater`).
The problem I'm having is that when I insert new lines to the bottom of the "console", the scrollbar stays in the initial position (so I always see the top lines unless I manually scroll down).
How can I make the scrollbar automatically stay at the bottom?
I am using prototype for a few libraries that require it in this project, so I would prefer to stick with that or regular javascript if possible.
| 0 | [
2,
233,
21,
12159,
579,
4520,
1179,
13,
7,
721,
14,
2129,
7,
133,
4721,
2331,
9,
800,
3726,
3726,
31,
589,
353,
21,
10082,
2478,
26,
21,
2741,
4865,
30,
31,
589,
638,
27,
9,
31,
57,
40,
4520,
30,
31,
259,
20,
275,
28,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to disable array bounds checking in opensource Java?
===
Now that Java is open source, one of the first things I would like to do is to disable array bounds checking for certain blocks of code, where I'm dead sure I cannot go offbounds and where performance heavily matters.
Now, I'm not a compilers/grammar expert, so any syntax would be good enough for me: Here's one that I can think of:
pragma_disable_array_bounds_checking_begin
for(x = xMin; x < xMax; x += xIncr) {
for(y = yMin; y < yMax; y += yIncr) {
for(z = zMin; z < zMax; x += zIncr) {
sample_and_draw(voxel[x][y][z]);
}
}
}
pragma_disable_array_bounds_checking_end
I understand that after this change, my local version will cease to be Java. But I care less since I can always bundle the recompiled VM along with my app.
I don't know how to go about making this nontrivial change, hence the question. Note that I'm not interested in the JNI approach.
| 0 | [
2,
184,
20,
1460,
579,
7718,
4138,
18,
9886,
19,
368,
12097,
8247,
60,
800,
3726,
3726,
130,
30,
8247,
25,
368,
1267,
15,
53,
16,
14,
64,
564,
31,
83,
101,
20,
107,
25,
20,
1460,
579,
7718,
4138,
18,
9886,
26,
1200,
5198,
16,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using Scheme code to slove a quadratic equation?
===
I wrote this scheme code to compute one solution of the quadratic equation a*x2 + b*x + c = 0
(define (solve-quadratic-equation a b c) (define disc (sqrt (- (* b b) (* 4.0 a c)))) (/ (+ (- b) disc) (* 2.0 a)))
However, someone told me that this procedure is hard to understand. Why?
What would a cleaned up version of this procedure look like?
Please let me know why the new procedure would be easier to understand.
Thanks | 0 | [
2,
568,
4276,
1797,
20,
13,
18,
4583,
21,
13,
26849,
1786,
8020,
60,
800,
3726,
3726,
31,
738,
48,
4276,
1797,
20,
23909,
53,
4295,
16,
14,
13,
26849,
1786,
8020,
21,
2483,
396,
135,
2754,
334,
2483,
396,
2754,
272,
800,
713,
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... |
unions declaration C code
===
I have seen some declaration of a union inside a struct as follows. Example code given below.
My questions is does it help in any memory savings(typical use for which a union is used for)? I do not see the benefit.
typedef struct
{
int x1;
unsigned int x2;
ourstruct1 ov1;
ourstruct1 ov2;
union
{
struct
{
mystruct1 v1;
mystruct2 v2;
mystruct3 v3;
int* ctxSC;
mystruct4 v4;
Bool v5;
Long v6;
Long v7;
Long v8;
Long v9;
}mystr;
};
}structvar1;
-AD | 0 | [
2,
11048,
7098,
272,
1797,
800,
3726,
3726,
31,
57,
541,
109,
7098,
16,
21,
667,
572,
21,
13,
10346,
28,
2415,
9,
823,
1797,
504,
1021,
9,
51,
2346,
25,
630,
32,
448,
19,
186,
1912,
12135,
5,
22371,
275,
26,
56,
21,
667,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are there any CSS standards that I should follow while writing my first stylesheet?
===
I am currently working on my first website. I have no idea where to start on the CSS page, or if there are any standards that I should be following.
I would appreciate any links or first-hand advise. | 0 | [
2,
50,
80,
186,
272,
18,
18,
3364,
30,
31,
378,
1740,
133,
1174,
51,
64,
1034,
17627,
60,
800,
3726,
3726,
31,
589,
871,
638,
27,
51,
64,
2271,
9,
31,
57,
90,
882,
113,
20,
799,
27,
14,
272,
18,
18,
2478,
15,
54,
100,
80,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to Calculate Recurring Digits?
===
Given two integers `a` and `b`, how would I go about calculating the repeating decimal of `a / b`? This can be in any language; whatever it's easiest for you to express it in. | 0 | [
2,
184,
20,
18469,
11344,
19076,
60,
800,
3726,
3726,
504,
81,
13820,
18,
13,
1,
58,
1,
17,
13,
1,
220,
1,
15,
184,
83,
31,
162,
88,
22937,
14,
17389,
26380,
16,
13,
1,
58,
13,
118,
334,
1,
60,
48,
92,
44,
19,
186,
816,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Scheme procedure to compute the nth repeated application of a function?
===
Is anyone familiar with this?
> Write a procedure that takes as inputs
> a procedure that computes f and a
> positive integer n and returns the
> procedure that computes the nth
> repeated application of f. The
> procedure should be able to be used as
> follows:
>
> ((repeated square 2) 5)
> 625
I know that the following code I've created for the composition of functions will help make the solution simpler, but I'm not sure where to go from here:
(define (compose f g) (lambda (x) (f (g x)))) | 0 | [
2,
4276,
7004,
20,
23909,
14,
13,
103,
96,
4251,
3010,
16,
21,
1990,
60,
800,
3726,
3726,
25,
1276,
3694,
29,
48,
60,
13,
1,
2757,
21,
7004,
30,
1384,
28,
6367,
18,
13,
1,
21,
7004,
30,
23909,
18,
398,
17,
21,
13,
1,
2221,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Setting DataContext with SelectedItem Programatically
===
How do you programatically set a DataContext that specifies the selected item of a list?
More simply, how do you reproduce this type of binding in code?
<StackPanel>
<ListBox Name="listBox1" />
<TextBox DataContext="{Binding ElementName=listBox1, Path=SelectedItem}" />
</StackPanel> | 0 | [
2,
2697,
1054,
1126,
11969,
29,
1704,
2119,
79,
625,
721,
8438,
800,
3726,
3726,
184,
107,
42,
625,
721,
8438,
309,
21,
1054,
1126,
11969,
30,
27669,
14,
1704,
9101,
16,
21,
968,
60,
91,
1659,
15,
184,
107,
42,
21509,
48,
1001,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to find which character set is used by the database
===
I can access the database either from a .NET program (using ODBC) or through a database management tool (written in Java).
If I write a 'é' character to the database from the .NET program, it appears as 'Õ' (capital O with tilde) in the DB management tool.
If I write a 'é' character to the database from the DB management tool, it appears as 'Å' (capital A with a circle on top) in the .NET program.
I am not trying to actually solve the problem (i.e. having both programs show the same thing), although that would be nice. I am merely trying to guess which character sets each is using to interpret the data, so that I can do the conversion myself if I dump data using .NET and re-input it using the tool.
So, which combination of 2 character sets would give the character mismatches described above?
Thanks for your help.
| 0 | [
2,
184,
20,
477,
56,
925,
309,
25,
147,
34,
14,
6018,
800,
3726,
3726,
31,
92,
1381,
14,
6018,
694,
37,
21,
13,
9,
2328,
625,
13,
5,
12655,
12340,
7229,
6,
54,
120,
21,
6018,
1097,
5607,
13,
5,
6390,
19,
8247,
6,
9,
100,
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... |
Python with PIL and Libjpeg on Leopard
===
I'm having trouble getting pictures supported with PIL - it throws me this: "IOError: decoder jpeg not available"
I installed PIL from binary, not realizing I needed libjpeg.
I installed libjpeg and freetype2 through fink.
I tried to reinstall PIL using instructions from http://timhatch.com/ (bottom of the page)
"* Download PIL 1.1.6 source package and have the Developer Tools already installed
* Patch setup.py with this patch so it can find the Freetype you already have. (patch -p0 < leopard_freetype2.diff)
* sudo apt-get install libjpeg if you have fink (otherwise, build by hand and adjust paths)"
But I'm still getting the same error.
I'm on Leopard PPC.
| 0 | [
2,
20059,
29,
8483,
17,
2093,
11741,
20427,
27,
15446,
800,
3726,
3726,
31,
22,
79,
452,
2572,
1017,
3104,
1827,
29,
8483,
13,
8,
32,
13566,
55,
48,
45,
13,
7,
1963,
29992,
45,
12015,
1157,
487,
20427,
52,
904,
7,
31,
4066,
8483... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Binary Search in Array
===
How would I implement a binary search using just an array? | 0 | [
2,
14171,
2122,
19,
7718,
800,
3726,
3726,
184,
83,
31,
8713,
21,
14171,
2122,
568,
114,
40,
7718,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Comparing Polygons for Similarity
===
What are the usual methods to compare two polygons for similarity? Vertices are in 2D. | 0 | [
2,
15047,
21309,
18,
26,
17204,
800,
3726,
3726,
98,
50,
14,
3820,
3195,
20,
11590,
81,
21309,
18,
26,
17204,
60,
21235,
50,
19,
172,
43,
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,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Single-threading two processes
===
I have two C++ processes (A and B), executing under Windows, where one launches the other. I would like to effectively single-thread their execution. For example:
1. Start process A
2. A creates B
3. A suspends
4. B executes some fixed set of operations
5. B suspends and A is resumed
6. A executes some fixed set of operations
7. A suspends and B is resumed
8. (Repeat 4 - 7)
Which Windows synchronization and IPC services would be best to implement this type of behavior? | 0 | [
2,
345,
8,
96,
22883,
81,
5102,
800,
3726,
3726,
31,
57,
81,
272,
20512,
5102,
13,
5,
58,
17,
334,
6,
15,
25836,
131,
1936,
15,
113,
53,
22933,
14,
89,
9,
31,
83,
101,
20,
5463,
345,
8,
96,
10647,
66,
5769,
9,
26,
823,
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... |
How does XOR variable swapping work?
===
Can someone explain to me how XOR swapping of two variables with no temp variable works?
void xorSwap (int *x, int *y)
{
if (x != y) {
*x ^= *y;
*y ^= *x;
*x ^= *y;
}
}
I understand WHAT it does, but can someone walk me through the logic of how it works? | 0 | [
2,
184,
630,
993,
248,
7612,
10143,
5574,
170,
60,
800,
3726,
3726,
92,
737,
3271,
20,
55,
184,
993,
248,
10143,
5574,
16,
81,
12157,
29,
90,
13,
9577,
7612,
693,
60,
11364,
993,
248,
18,
1608,
306,
13,
5,
6391,
1637,
396,
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... |
Whats the reasonings behind the different brace forms?
===
I'm reading through the [Zend Framework coding standards][1], where they state that curly brace after a Class definitions should be on the next line, the "one true brace form".
class MyClass
{
function....
}
I usually have the braces on the same line:
class OtherClass {
function ...
}
What's the reason for putting the brace on the next line? Or using any other style, for that matter?
[1]: http://framework.zend.com/manual/en/coding-standard.coding-style.html | 0 | [
2,
98,
18,
14,
15543,
18,
439,
14,
421,
15646,
1997,
60,
800,
3726,
3726,
31,
22,
79,
1876,
120,
14,
636,
4257,
43,
6596,
13,
15458,
3364,
500,
2558,
165,
500,
15,
113,
59,
146,
30,
21056,
15646,
75,
21,
718,
18544,
378,
44,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Debugging a Direct3D Model
===
I am trying to render a model in Direct3D using `DrawIndexedPrimitives`. However, I am not able to see it on screen. What other methods are available to debug a Direct3D model?
I've tried the following:
- Switched off back face culling
- Used `PrimitiveType.LineStrip` instead of `PrimitiveType.TriangleStrip`
- Several combinations of View and Projection matrices.
- Used AutoCAD to plot the vertices as tiny spheres
| 0 | [
2,
121,
16254,
2762,
21,
1744,
240,
43,
1061,
800,
3726,
3726,
31,
589,
749,
20,
16535,
21,
1061,
19,
1744,
240,
43,
568,
13,
1,
43,
12404,
25671,
69,
6944,
5130,
1284,
18,
1,
9,
207,
15,
31,
589,
52,
777,
20,
196,
32,
27,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Data binding formatting to a DateTime column
===
I have a textbox with the **Text** property bound to a dataset column with the DataType set to System.DateTime.
The FormatString on the Binding is set to **dd-MM-yyyy**.
When the user enters a date it attempts to convert it to a date but can come up with some strange values for a seemingly invalid date.
For example:
textBox1.Text = "01-02-200";
Should be an invalid date but it formats it as **01-02-0200**.
Is there an easy way to catch these out-of-bounds values either through setting a valid range or overriding an event on the binding/textbox? | 0 | [
2,
1054,
8728,
2595,
1203,
20,
21,
1231,
891,
4698,
800,
3726,
3726,
31,
57,
21,
1854,
5309,
29,
14,
13,
1409,
11969,
1409,
1354,
4138,
20,
21,
1054,
3554,
4698,
29,
14,
1054,
4474,
309,
20,
329,
9,
8209,
891,
9,
14,
2595,
11130... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Prevent long word to add horizontal scroll to html view
===
On Windows Mobile, I am displaying my output in HTML. This includes lots of user-generated strings. Occasionally there are situations where a really large string is part of the output that has no whitespaces or punctuation.
Unfortunately the Windows Mobile's HTML view (htmlview.dll, based on Pocket Internet Explorer) does not break these long words down so they fit on screen. Instead a horizontal scrollbar is added and the user has to scroll sideways to see the whole word. This also affects other output which now also is spread along this larger screen width.
Is there any possibility to either make the htmlview behave differently, or to force the word to break? CSS can be used. Regarding the forcing: The ­ tag is ALWAYS introducing a "-" character to be inserted, empty tags like <B></B> also do nothing. Also it should be noted that this code is running on multiple screen sizes and due to other parts of the HTML output I am not 100% sure how much screen width I have left.
P.S.: My app is compiled using the WM 5.0 SDK and is written in C++/Win32/MFC. | 0 | [
2,
2501,
175,
833,
20,
3547,
10095,
12159,
20,
13,
15895,
1418,
800,
3726,
3726,
27,
1936,
3241,
15,
31,
589,
17418,
51,
5196,
19,
13,
15895,
9,
48,
1103,
7503,
16,
4155,
8,
25314,
7887,
9,
4533,
80,
50,
8329,
113,
21,
510,
370,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL: month to month computation
===
I want to compute for month difference of 2 dates which will return a float value.
example:
date1='4/23/2008'
date2='12/31/2008'
that will be 7.y months. I want to find the y value. can someone give me the formula to make this in sql codes? tnx.. | 0 | [
2,
4444,
255,
45,
1617,
20,
1617,
21683,
800,
3726,
3726,
31,
259,
20,
23909,
26,
1617,
2841,
16,
172,
4076,
56,
129,
788,
21,
11510,
1923,
9,
823,
45,
1231,
165,
3726,
22,
12918,
2001,
118,
2753,
22,
1231,
135,
3726,
22,
918,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is a simple example of floating point/rounding error?
===
I've heard of "error" when using floating point variables. Now I'm trying to solve this puzzle and I think I'm getting some rounding/floating point error. So I'm finally going to figure out the basics of floating point error.
What is a simple example of floating point/rounding error (preferably in C++) ?
| 0 | [
2,
98,
25,
21,
1935,
823,
16,
8319,
454,
118,
5000,
68,
7019,
60,
800,
3726,
3726,
31,
22,
195,
752,
16,
13,
7,
29992,
7,
76,
568,
8319,
454,
12157,
9,
130,
31,
22,
79,
749,
20,
8402,
48,
9164,
17,
31,
277,
31,
22,
79,
101... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
when would you use uint_least16_t
===
I'm looking at stdint.h and given that it has uint16_t and uint_fast16_t, what is the use for uint_least16_t what might you want that couldn't be done equally well with one of the other two? | 0 | [
2,
76,
83,
42,
275,
287,
6391,
1,
255,
2857,
1091,
1,
38,
800,
3726,
3726,
31,
22,
79,
699,
35,
354,
3653,
38,
9,
252,
17,
504,
30,
32,
63,
287,
6391,
1091,
1,
38,
17,
287,
6391,
1,
13088,
1091,
1,
38,
15,
98,
25,
14,
27... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JavaME: Convert String to camelCase
===
What would be a simple implementation of a method to convert a String like "Hello there everyone" to "helloThereEveryone". In JavaME support for String and StringBuffer utility operations are quite limited. | 0 | [
2,
8247,
790,
45,
8406,
3724,
20,
15386,
10325,
800,
3726,
3726,
98,
83,
44,
21,
1935,
6123,
16,
21,
2109,
20,
8406,
21,
3724,
101,
13,
7,
11515,
80,
1266,
7,
20,
13,
7,
11515,
1887,
20776,
7,
9,
19,
8247,
790,
555,
26,
3724,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0... |
What is the best way to handle protocols?
===
Say you are writing an application that must implement the HTTP protocol. Protocols are quite complex and may allow several commands depending on which stage of a transaction they are in.
As an example, look at SMTP. An SMTP server must throw an error if the "data" command is sent before receiving "rcpt" and "mail".
My question is: what is the best way to handle protocols such as this in code? Are there any design patterns related to this? | 0 | [
2,
98,
25,
14,
246,
161,
20,
3053,
19957,
60,
800,
3726,
3726,
395,
42,
50,
1174,
40,
3010,
30,
491,
8713,
14,
7775,
8494,
9,
19957,
50,
1450,
1502,
17,
123,
1655,
238,
14294,
4758,
27,
56,
876,
16,
21,
12799,
59,
50,
19,
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... |
What am I doing wrong with this Scheme evaluation?
===
Evaluate:
((((lambda (x) (lambda (y) (lambda (x) (+ x y)))) 3) 4) 5)
This is what I did:
-evaluate ((((lambda (x) (lambda (y) (lambda (x) (+ x y)))) 3) 4) 5)
-evaluate 5 -> 5
-evaluate (((lambda (x) (lambda (y) (lambda (x) (+ x y)))) 3) 4)
-evaluate 4 -> 4
-evaluate ((lambda (x) (lambda (y) (lambda (x) (+ x y)))) 3)
-evaluate 3 -> 3
-(lambda (x) (lambda (y) (lambda (x) (+ x y)))) -> (lambda (x) (lambda (y) (lambda (x) (+ x y))))
-apply (lambda (x) (lambda (y) (lambda (x) (+ x y)))) to 3
-substitute 3 -> x in (lambda (y) (lambda (x) (+ x y))
-(lambda (y) (lambda (x) (+ 3 y))
-evaluate (lambda (y) (lambda (x) (+ 3 y)) -> (lambda (y) (lambda (x) (+ 3 y))
-apply (lambda (y) (lambda (x) (+ 3 y)) to 4
-subsitute 4 -> y in (lambda (y) (lambda (x) (+ 3 y))
- (lambda (y) (+ 3 4))
-evaluate (lambda (y) (+ 3 4)) -> (lambda (y) (7))
-subsitute 5 ->
And then I'm stuck. | 0 | [
2,
98,
589,
31,
845,
1389,
29,
48,
4276,
8670,
60,
800,
3726,
3726,
13,
15599,
45,
13,
5,
5,
5,
5,
24187,
13,
5,
396,
6,
13,
5,
24187,
13,
5,
93,
6,
13,
5,
24187,
13,
5,
396,
6,
13,
5,
2430,
993,
13,
93,
6,
6,
6,
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... |
Looking for a better way than virtual inheritance in C++
===
OK, I have a somewhat complicated system in C++. In a nutshell, I need to add a method to a third party abstract base class. The third party also provides a ton of derived classes that also need the new functionality.
I'm using a library that provides a standard Shape interface, as well as some common shapes.
class Shape
{
public:
Shape(position);
virtual ~Shape();
virtual position GetPosition() const;
virtual void SetPosition(position);
virtual double GetPerimeter() const = 0;
private: ...
};
class Square : public Shape
{
public:
Square(position, side_length);
...
};
class Circle, Rectangle, Hexagon, etc
Now, here's my problem. I want the Shape class to also include a GetArea() function. So it seems like I should just do a:
class ImprovedShape : public virtual Shape
{
virtual double GetArea() const = 0;
};
class ImprovedSquare : public Square, public ImprovedShape
{
...
}
And then I go and make an ImprovedSquare that inherits from ImprovedShape and Square. Well, as you can see, I have now created the dreaded [diamond inheritance problem][1]. This would easily be fixed if the third party library used [virtual inheritance][2] for their Square, Circle, etc. However, getting them to do that isn't a reasonable option.
So, what do you do when you need to add a little functionality to an interface defined in a library? Is there a good answer?
Thanks!
[1]: http://en.wikipedia.org/wiki/Diamond_problem
[2]: http://en.wikipedia.org/wiki/Virtual_inheritance | 0 | [
2,
699,
26,
21,
574,
161,
119,
6599,
13852,
19,
272,
20512,
800,
3726,
3726,
5854,
15,
31,
57,
21,
4131,
8343,
329,
19,
272,
20512,
9,
19,
21,
8619,
15984,
15,
31,
376,
20,
3547,
21,
2109,
20,
21,
422,
346,
8502,
1000,
718,
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... |
Interesting Scheme question - why doesn't this function work?
===
(define (square x)
(display (* x x)))
(define (sum-of-squares a b)
(+ (square a) (square b)))
I tested it, and the sum-of-squares function will not work. Why is this? | 0 | [
2,
4883,
4276,
1301,
13,
8,
483,
1437,
22,
38,
48,
1990,
170,
60,
800,
3726,
3726,
13,
5,
546,
7509,
13,
5,
12300,
993,
6,
13,
5,
2906,
5438,
13,
5,
2483,
993,
993,
6,
6,
6,
13,
5,
546,
7509,
13,
5,
18,
723,
8,
1041,
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... |
Get contact information on smartphones/ppc with windows mobile 6.0?
===
In a C# application, I want to get a list of the all the contacts of the mobile phone.
I have no idea if there is a class that exists already to do it out-of-the-box. If not, I would like how to access those information. | 0 | [
2,
164,
2203,
676,
27,
21421,
18,
118,
3421,
150,
29,
1936,
3241,
400,
9,
387,
60,
800,
3726,
3726,
19,
21,
272,
5910,
3010,
15,
31,
259,
20,
164,
21,
968,
16,
14,
65,
14,
11894,
16,
14,
3241,
1132,
9,
31,
57,
90,
882,
100,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When using Eclipse with FindBugs can you mark a bug as not a bug and have it removed from the bug list?
===
FindBugs has found a potential bug in my code. But it is not a bug.
Is it possible to mark this occurrence as 'not a bug' AND have it removed from the bug list?
I have documented quite clearly why for each case it is not a bug.
For example. A class implements the comparable interface. it has the compareTo method. I have however not overridden the equals method.
FindBugs does not like this as the JavaDocs state that it is recommended that
(x.compareTo(y)==0) == (x.equals(y))
Although in my case the above condition is and always will be true.
| 0 | [
2,
76,
568,
11652,
29,
477,
16254,
18,
92,
42,
943,
21,
6256,
28,
52,
21,
6256,
17,
57,
32,
1974,
37,
14,
6256,
968,
60,
800,
3726,
3726,
477,
16254,
18,
63,
216,
21,
2222,
6256,
19,
51,
1797,
9,
47,
32,
25,
52,
21,
6256,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Programmer to Manager
===
What a Programmer should learn to become a manager without losing his programming skills? | 2 | [
2,
17968,
20,
1382,
800,
3726,
3726,
98,
21,
17968,
378,
2484,
20,
533,
21,
1382,
366,
2281,
33,
3143,
3207,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Repeated aplication of functions in Scheme?
===
If f is a numerical function and n is a positive integer, then we can form the nth repeated application of f, which is defined to be the function whose value at x is f(f(...(f(x))...)). For example, if f is the function x + 1, then the nth repeated application of f is the function x + n. If f is the operation of squaring a number, then the nth repeated application of f is the function that raises its argument to the 2^nth power. Write a procedure that takes as inputs a procedure that computes f and a positive integer n and returns the procedure that computes the nth repeated application of f. Your procedure should be able to be used as follows:
((repeated square 2) 5)
625
You can use this to simplify the answer:
(define (compose f g) (lambda (x) (f (g x))))
I know it's frowned upon when someone posts homework problems to be solved, but I really am stuck on this problem and it is due soon. Any help is appreciated. Thanks | 0 | [
2,
4251,
21,
20669,
16,
3719,
19,
4276,
60,
800,
3726,
3726,
100,
398,
25,
21,
16010,
1990,
17,
13,
103,
25,
21,
2221,
13820,
15,
94,
95,
92,
505,
14,
13,
103,
96,
4251,
3010,
16,
398,
15,
56,
25,
2811,
20,
44,
14,
1990,
119... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 PHP continue to make drastic changes with major version releases?
===
So I got started with PHP at version 4, and had to make the switch to 5. Now I understand that version 6 is on the way, and that a lot of things have been re-thought.
The changes may be good ones, but in the future, does anyone know about PHP's roadmap? Does it look like it will flatten out? | 0 | [
2,
129,
13,
26120,
1816,
20,
233,
27065,
1693,
29,
394,
615,
7073,
60,
800,
3726,
3726,
86,
31,
330,
373,
29,
13,
26120,
35,
615,
268,
15,
17,
41,
20,
233,
14,
5521,
20,
331,
9,
130,
31,
1369,
30,
615,
400,
25,
27,
14,
161,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the advantages to Perforce?
===
What are the benefits of Perforce?
I'd love to have some insight as to how Perforce can work better in a given situation than, say, svn. | 0 | [
2,
98,
50,
14,
14683,
20,
416,
8774,
60,
800,
3726,
3726,
98,
50,
14,
5800,
16,
416,
8774,
60,
31,
22,
43,
339,
20,
57,
109,
9239,
28,
20,
184,
416,
8774,
92,
170,
574,
19,
21,
504,
1858,
119,
15,
395,
15,
13,
18,
16578,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Algorithm to avoid SQL injection on MSSQM from C# code?
===
What would be the best way to avoid SQL injection on the C#.net platform.
Please post an C# implementation if you have any. | 0 | [
2,
9083,
20,
2658,
4444,
255,
13646,
27,
4235,
18,
1251,
79,
37,
272,
5910,
1797,
60,
800,
3726,
3726,
98,
83,
44,
14,
246,
161,
20,
2658,
4444,
255,
13646,
27,
14,
272,
5910,
9,
2328,
2452,
9,
2247,
678,
40,
272,
5910,
6123,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Paralel processing of database queue
===
There is small system, where a database table as queue on MSSQL 2005. Several applications are writing to this table, and one application is reading and processing in a FIFO manner.
I have to make it a little bit more advanced to be able to create a distributed system, where several processing application can run. The result should be that 2-10 processing application should be able to run and they should not interfere each other during work.
My idea is to extend the queue table with a row showing that a process is already working on it. The processing application will first update the table with it's idetifyer, and then asks for the updated records.
So something like this:
start transaction
update top(10) queue set processing = 'myid' where processing is null
select * from processing where processing = 'myid'
end transaction
After processing, it sets the processing column of the table to something else, like 'done', or whatever.
I have three questions about this approach.
First: can this work in this form?
Second: if it is working, is it effective? Do you have any other ideas to create such a distribution?
Third: In MSSQL the locking is row based, but after an amount of rows are locked, the lock is extended to the whole table. So the second application cannot access it, until the first application does not release the transaction. How big can be the selection (top x) in order to not lock the whole table, only create row locks?
| 0 | [
2,
2017,
192,
532,
5511,
16,
6018,
22521,
800,
3726,
3726,
80,
25,
284,
329,
15,
113,
21,
6018,
859,
28,
22521,
27,
4235,
18,
22402,
812,
9,
238,
3767,
50,
1174,
20,
48,
859,
15,
17,
53,
3010,
25,
1876,
17,
5511,
19,
21,
6028,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Syntax of shell\command\open values - %1 vs %l vs %L
===
one of the programs I'm developing at work is reading the registry to figure out how to open files that it is given from another application (we didn't use ShellExecute because we need to process id, and I failed to look at ShellExecuteEx closely enough to see that it gives the process handle, and it's too late now, anyway). It already works, so this is more for my own edification, but does anyone know why some of the entries use %l or %L instead of %1? At least for "%l" it could be a typo, but "%L" seems unlikely. In fact, Media Player uses "%L" in the open commands for various audio files. I'm fairly sure it means the same thing as %1, if only because I can't think of anything else it could be.
My current favorite theory is that it's a joke about how l and 1 are easy to confuse. Or it could stand for "location", but that would be lame :) | 0 | [
2,
22649,
16,
3593,
1,
16239,
1,
10157,
4070,
13,
8,
13,
11881,
165,
4611,
13,
11881,
255,
4611,
13,
11881,
255,
800,
3726,
3726,
53,
16,
14,
1726,
31,
22,
79,
3561,
35,
170,
25,
1876,
14,
18269,
20,
1465,
70,
184,
20,
368,
64... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to delete files older than X hours
===
I'm writing a bash script that needs to delete old files.
It's currently implemented using :
find $LOCATION -name $REQUIRED_FILES -type f -mtime +1 -delete
This will delete of the files older than 1 day.
However, what if I need a finer resolution that 1 day, say like 6 hours old? Is there a nice clean way to do it, like there is using find and -mtime?
| 0 | [
2,
184,
20,
27448,
6488,
1234,
119,
993,
974,
800,
3726,
3726,
31,
22,
79,
1174,
21,
13158,
3884,
30,
2274,
20,
27448,
315,
6488,
9,
32,
22,
18,
871,
6807,
568,
13,
45,
477,
5579,
19032,
13,
8,
7259,
5579,
99,
3003,
2095,
1,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 add fitnesse pages to version-control?
===
What is the recommended practice? Should I add the my sub-folder under the fitnesse folder to version control?
*Context: working on a single developer rails pet project. I've my rails project under version-control (Subversion) however my fitnesse wiki pages lie under the fitnesse program folder.*
Fitnesse seems to have its own version-control... (I see numbered zips along with each of my wiki pages) Is it reliable? Where does it store the revisions?
| 0 | [
2,
184,
107,
31,
3547,
11331,
62,
4434,
20,
615,
8,
12898,
60,
800,
3726,
3726,
98,
25,
14,
5773,
1345,
60,
378,
31,
3547,
14,
51,
972,
8,
8814,
106,
131,
14,
11331,
62,
19294,
20,
615,
569,
60,
1637,
1126,
11969,
45,
638,
27,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Explain Facet pattern with c++ example?
===
I have checked with wikipedia article seems like it is missing c++ version of code.I am not able to fully appreciate facet pattern. | 0 | [
2,
3271,
276,
38,
3732,
29,
272,
20512,
823,
60,
800,
3726,
3726,
31,
57,
6505,
29,
20169,
2002,
2206,
101,
32,
25,
2863,
272,
20512,
615,
16,
1797,
9,
49,
589,
52,
777,
20,
2337,
8831,
276,
38,
3732,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
High Quality Image Scaling C#
===
I want to scale an image in C# with quality level as good as PhotoShop do. Is there any C# image processing library available to do this thing? | 0 | [
2,
183,
2190,
1961,
26829,
272,
5910,
800,
3726,
3726,
31,
259,
20,
3464,
40,
1961,
19,
272,
5910,
29,
2190,
662,
28,
254,
28,
7064,
5347,
107,
9,
25,
80,
186,
272,
5910,
1961,
5511,
1248,
904,
20,
107,
48,
584,
60,
3,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Programatically raise user privileges
===
I have been maintaining an installation for a while but I am not really an expert. now I've been asked to come up with a solution for this:
Our software is always sold together with a computer as it has to be run in a very controlled environment. The installer needs administrative privileges to be executed. So far we had two different users, one with administrative rights and other one without. Our custumer service login as Administrator, install the software and restart the machine so that the user can access as a normal user.
Now we want the user to be able to install the software themselves but we don't want them to have access as an administrator because they can modify things it shouldn't be modified.
So, is there any way to programatically raise the user privileges during the installation and afterwards lower them back? The installer is made using InstallShield but we use vbscript to check some pre-requisites.
Thanks in advance. | 0 | [
2,
625,
721,
8438,
3972,
4155,
15977,
800,
3726,
3726,
31,
57,
74,
8215,
40,
7758,
26,
21,
133,
47,
31,
589,
52,
510,
40,
5390,
9,
130,
31,
22,
195,
74,
411,
20,
340,
71,
29,
21,
4295,
26,
48,
45,
318,
2306,
25,
550,
945,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
VC++ linker errors on std::exception::_Raise and std::exception::exception
===
I am using Visual C++ 2005 Express Edition and get the following linker errors:
19>mylib1.lib(mylibsource1.obj) : error LNK2019: unresolved external symbol "__declspec(dllimport) public: void __thiscall std::exception::_Raise(void)const " (__imp_?_Raise@exception@std@@QBEXXZ) referenced in function "protected: static void __cdecl std::vector<class mytype,class std::allocator<class mytype> >::_Xlen(void)" (?_Xlen@?$vector@Vmytype@@V?$allocator@Vmytype@@@std@@@std@@KAXXZ)
19>mylib2.lib(mylibsource2.obj) : error LNK2001: unresolved external symbol "__declspec(dllimport) public: void __thiscall std::exception::_Raise(void)const " (__imp_?_Raise@exception@std@@QBEXXZ)
19>mylib1.lib(mylibsource1.obj) : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall std::exception::exception(char const *,int)" (__imp_??0exception@std@@QAE@PBDH@Z) referenced in function "public: __thiscall std::logic_error::logic_error(class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const &)" (??0logic_error@std@@QAE@ABV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@1@@Z)
19>mylib2.lib(mylibsource2.obj) : error LNK2001: unresolved external symbol "__declspec(dllimport) public: __thiscall std::exception::exception(char const *,int)" (__imp_??0exception@std@@QAE@PBDH@Z)
I turned off exceptions in generated code, and I am using before including the vector header file:
#define _HAS_EXCEPTIONS 0
A few Google results turned up some stuff, but no "aha!" solutions that worked for me. | 0 | [
2,
13,
8990,
20512,
3508,
106,
11908,
27,
354,
43,
45,
45,
10066,
872,
45,
45,
1,
525,
2628,
17,
354,
43,
45,
45,
10066,
872,
45,
45,
10066,
872,
800,
3726,
3726,
31,
589,
568,
3458,
272,
20512,
812,
2999,
1322,
17,
164,
14,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WPF visual state manager in Blend 2 sp1
===
Can anyone explain to me how to get the visual state manager to work with a WPF application? It's just been added to the new wpftoolkit. I installed it as told, but even the sample doesn't show the VSM. In silverlight it work, but not in WPF. If installed the latest Blend 2 and updated with the SP1. | 0 | [
2,
619,
7721,
3458,
146,
1382,
19,
11138,
172,
3782,
165,
800,
3726,
3726,
92,
1276,
3271,
20,
55,
184,
20,
164,
14,
3458,
146,
1382,
20,
170,
29,
21,
619,
7721,
3010,
60,
32,
22,
18,
114,
74,
905,
20,
14,
78,
619,
7721,
20799... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 started on Aspect Oriented Programming on the .Net platform?
===
Please give me some insight on how to get the best start on applying Aspect Oriented Programming to my C#.net applications? | 0 | [
2,
184,
20,
164,
373,
27,
7289,
13,
6800,
3143,
27,
14,
13,
9,
2328,
2452,
60,
800,
3726,
3726,
2247,
590,
55,
109,
9239,
27,
184,
20,
164,
14,
246,
799,
27,
11989,
7289,
13,
6800,
3143,
20,
51,
272,
5910,
9,
2328,
3767,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What happens to an applet when browser is closed?
===
Let's suppose I have an applet running within a page in a browser.
What happens when the browser is closed by the user?
Is the applet notified so that it can perform some kind of close action on its side (closing connections opened to a server, cleaning static variables, ...)?
Also, I assume the same behavior would apply for a page refresh or page navigation (instead of browser close). The browser remains opened but the applet is gone. Although when you close the browser you also close the JVM so I'm unsure at this point.
Thanks,
JB | 0 | [
2,
98,
5531,
20,
40,
4037,
38,
76,
16495,
25,
827,
60,
800,
3726,
3726,
408,
22,
18,
5787,
31,
57,
40,
4037,
38,
946,
363,
21,
2478,
19,
21,
16495,
9,
98,
5531,
76,
14,
16495,
25,
827,
34,
14,
4155,
60,
25,
14,
4037,
38,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Changing Output path of the Unit Test project in Visual Studio 2008
===
I changed the output path of the test project, because the default path doesn't conform to our projects directory structure. After I did that, Visual Studio 2008 fails to run the tests, because it can't find the Unit Test project assembly.
What else do I have to change for the Unit Test Engine to find the assembly? | 0 | [
2,
4226,
5196,
2013,
16,
14,
1237,
1289,
669,
19,
3458,
1120,
570,
800,
3726,
3726,
31,
1015,
14,
5196,
2013,
16,
14,
1289,
669,
15,
185,
14,
12838,
2013,
1437,
22,
38,
13620,
20,
318,
2314,
16755,
1411,
9,
75,
31,
144,
30,
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... |
"Application" global variable not recognized
===
I work on a large project in Delphi 5.
Today, after merging two branches of the app together, one of the hundreds of units, UnitMain (the main form's unit, would you guess) stopped recognizing the Application global.
This is a rather bizarre problem - I could get the program to compile by defining Application: TApplication in UnitMain, and setting that to the Application from our .dpr project file, but that leads to an access violation, which isn't much of a surprise with Application being the special thing it is.
I'm hoping someone has faced the same problem before, or knows enough of Delphi VCL's inner workings to help me out here. | 0 | [
2,
13,
7,
2552,
20669,
7,
2062,
7612,
52,
2124,
800,
3726,
3726,
31,
170,
27,
21,
370,
669,
19,
23030,
331,
9,
786,
15,
75,
18842,
81,
4395,
16,
14,
4865,
429,
15,
53,
16,
14,
4541,
16,
1398,
15,
1237,
6232,
13,
5,
124,
407,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 copy built artifact to a directory on remote Windows server in maven deploy phase?
===
could someone provide working example (full maven plugin configuration) how to copy built jar file to a specific server(s) at the time of deploy phase?
I have tried to look at wagon plugin, but it is hugely undocumented and I was not able to set it up. The build produces standard jar that is being deployed to Nexus, but I need to put the jar also to the test server automatically over local network (\\someserver\testapp\bin).
I will be grateful for any hints.
Thank you | 0 | [
2,
184,
107,
31,
4344,
392,
22929,
20,
21,
16755,
27,
5388,
1936,
8128,
19,
1216,
3124,
17617,
2702,
60,
800,
3726,
3726,
110,
737,
1181,
638,
823,
13,
5,
13727,
1216,
3124,
10922,
108,
8091,
6,
184,
20,
4344,
392,
5112,
3893,
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... |
Hints for making programming even more pleasant
===
After my first large project, I've understood there are lots of things that can make programming more pleasant at such projects. I know some already but what else I could yet do when preparing for large projects?
What I've learned this far:
- Minimize your requirements list for the project.
- Provide something early as possible.
- Automate your testing routines.
- Make deployment easy as possible.
- Research and take your time, do not hurry.
- Set up a bug tracking website.
- Find out and search ways to make programming more pleasant.
I've written these out as bullet points, but I'd like to see the reasoning and experience behind the new ones you provide. As an exchange I can try explain my own reasoning and experience behind these points one-by-one.
(I feel mildly.. surprised that there comes up a related questions as: "Usability hints for building an adult web site?") | 0 | [
2,
6382,
18,
26,
544,
3143,
166,
91,
6673,
800,
3726,
3726,
75,
51,
64,
370,
669,
15,
31,
22,
195,
4014,
80,
50,
7503,
16,
564,
30,
92,
233,
3143,
91,
6673,
35,
145,
2314,
9,
31,
143,
109,
614,
47,
98,
962,
31,
110,
768,
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... |
Best practices to test protected methods with PHPUnit
===
I found the discussion on [Do you test private method][1] informative.
I have decided, that in some classes, I want to have protected methods, but test them.
Some of these methods are static and short. Because most of the public methods make use of them, I will probably be able to safely remove the tests later. But for starting with a TDD approach and avoid debugging, I really want to test them.
I thought of the following:
- [Method Object][2] as adviced in [an answer][3] seems to be overkill for this.
- Start with public methods and when code coverage is given by higher level tests, turn them protected and remove the tests.
- Inherit a class with a testable interface making protected methods public
Which is best practice? Is there anything else?
It seems, that JUnit automatically changes protected methods to be public, but I did not have a deeper look at it. PHP does not allow this via [reflection][4].
[1]: http://stackoverflow.com/questions/105007/do-you-test-private-method
[2]: http://www.refactoring.com/catalog/replaceMethodWithMethodObject.html
[3]: http://stackoverflow.com/questions/105007/do-you-test-private-method#105021
[4]: http://php.net/language.oop5.reflection | 4 | [
2,
246,
5242,
20,
1289,
3803,
3195,
29,
13,
26120,
15464,
800,
3726,
3726,
31,
216,
14,
5460,
27,
636,
537,
42,
1289,
932,
2109,
500,
2558,
165,
500,
10361,
3366,
9,
31,
57,
868,
15,
30,
19,
109,
2684,
15,
31,
259,
20,
57,
380... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Flatten a recordset in SQL Server?
===
Say you get a recordset like the following:
| ID | Foo | Bar | Red |
|-----|------|------|------|
| 1 | 100 | NULL | NULL |
| 1 | NULL | 200 | NULL |
| 1 | NULL | NULL | 300 |
And you want:
| ID | Foo | Bar | Red |
|-----|-----|-----|-----|
| 1 | 100 | 200 | 300 |
You could use something like:
SELECT
ID,
MAX(Foo) AS Foo,
MAX(Bar) AS Bar,
MAX(Red) AS Red
FROM foobarred
GROUP BY ID
----
Now, how might you accomplish similar when Foo, Bar, and Red are VARCHAR?
| ID | Foo | Bar | Red |
|-----|----------|---------|---------|
| 1 | 'Text1' | NULL | NULL |
| 1 | NULL | 'Text2' | NULL |
| 1 | NULL | NULL | 'Text3' |
To:
| ID | Foo | Bar | Red |
|-----|----------|---------|---------|
| 1 | 'Text1' | 'Text2' | 'Text3' |
----
Currently working primarily with SQL Server 2000; but have access to 2005 servers. | 0 | [
2,
1844,
1316,
21,
742,
1198,
19,
4444,
255,
8128,
60,
800,
3726,
3726,
395,
42,
164,
21,
742,
1198,
101,
14,
249,
45,
13,
1,
4924,
13,
1,
4310,
111,
13,
1,
748,
13,
1,
402,
13,
1,
13,
1,
8,
8,
8,
8,
8,
1,
8,
8,
8,
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... |
Changing the Foreground colour of a contentpresenter in a listbox
===
I have created the following style for a listbox that will have an image displayed next to some text:
<Style x:Key="ImageListBoxStyle" TargetType="{x:Type ListBox}">
<Setter Property="SnapsToDevicePixels" Value="true"/>
<Setter Property="BorderThickness" Value="1"/>
<Setter Property="ScrollViewer.HorizontalScrollBarVisibility" Value="Auto"/>
<Setter Property="ScrollViewer.VerticalScrollBarVisibility" Value="Auto"/>
<Setter Property="ScrollViewer.CanContentScroll" Value="True"/>
<Setter Property="ItemContainerStyle">
<Setter.Value>
<!-- Simple ListBoxItem - This is used for each Item in a ListBox. The item's content is placed in the ContentPresenter -->
<Style TargetType="{x:Type ListBoxItem}">
<Setter Property="SnapsToDevicePixels" Value="true"/>
<Setter Property="OverridesDefaultStyle" Value="true"/>
<Setter Property="VerticalContentAlignment" Value="Center"/>
<Setter Property="Template">
<Setter.Value>
<ControlTemplate TargetType="{x:Type ListBoxItem}">
<Grid SnapsToDevicePixels="true">
<Border x:Name="Border">
<Grid Height="40">
<Grid.ColumnDefinitions>
<ColumnDefinition Width="Auto"/>
<ColumnDefinition Width="*"/>
</Grid.ColumnDefinitions>
<Image
x:Name="DisplayImage"
Source="{Binding Path=ThumbnailImage}"
Height="30"
Width="30"
Grid.Column="0"/>
<ContentPresenter
x:Name="DisplayText"
HorizontalAlignment="Stretch"
VerticalAlignment="Center"
Grid.Column="1"/>
<!--<ContentPresenter.Resources>
<Style TargetType="{x:Type TextBlock}">
<Setter Property="Foreground" Value="Black"/>
</Style>
</ContentPresenter.Resources>-->
<!--Content="{Binding RelativeSource={RelativeSource FindAncestor, AncestorType=ListBox}, Path=DisplayMemberPath, Converter={StaticResource myDisplayMemberConverter}}"-->
<!--<Label
x:Name="Text"
Content="{Binding Path=FullNameAndTitle}"
Foreground="Black"
VerticalAlignment="{TemplateBinding VerticalContentAlignment}"
VerticalContentAlignment="Center"
HorizontalAlignment="Stretch"
Grid.Column="1"
Height="40"/>-->
</Grid>
</Border>
</Grid>
<ControlTemplate.Triggers>
<Trigger Property="IsSelected" Value="true">
<!--<Setter Property="FontWeight" Value="Bold" TargetName="DisplayText"/>-->
<!--<Setter Property="Style" Value="{StaticResource SelectedTextStyle}" TargetName="DisplayText"/>-->
<Setter Property="Background" Value="DarkBlue" TargetName="Border"/>
<Setter Property="Width" Value="40" TargetName="DisplayImage"/>
<Setter Property="Height" Value="40" TargetName="DisplayImage"/>
</Trigger>
</ControlTemplate.Triggers>
</ControlTemplate>
</Setter.Value>
</Setter>
</Style>
</Setter.Value>
</Setter>
<Setter Property="Template">
<Setter.Value>
<ControlTemplate TargetType="{x:Type ListBox}">
<Grid>
<Border x:Name="Border" Background="{TemplateBinding Background}" BorderBrush="Black" BorderThickness="{TemplateBinding BorderThickness}">
<Grid>
<ScrollViewer Margin="1,1,1,1" Focusable="false" Background="{TemplateBinding Background}" SnapsToDevicePixels="True">
<StackPanel IsItemsHost="true"/>
</ScrollViewer>
</Grid>
</Border>
</Grid>
<ControlTemplate.Triggers>
<Trigger Property="IsGrouping" Value="true">
<Setter Property="ScrollViewer.CanContentScroll" Value="false"/>
</Trigger>
</ControlTemplate.Triggers>
</ControlTemplate>
</Setter.Value>
</Setter>
</Style>
I have to use the contentpresenter as I am filtering what is displayed (text wise) using the DisplayMemberPath of the ListBox itself.
All I want to do is set the FontWeight to Bold and the Foreground to White when an item is selected in the ListBox.
Has anyone encountered a problem like this? I have looked at some related questions but people have been able to use a TextBlock to get around their issues I can't unfortunately.
Any info ppl can give will be appreciated.
Cheers | 0 | [
2,
4226,
14,
26,
62,
8810,
4609,
16,
21,
2331,
3914,
106,
19,
21,
968,
5309,
800,
3726,
3726,
31,
57,
679,
14,
249,
1034,
26,
21,
968,
5309,
30,
129,
57,
40,
1961,
6115,
328,
20,
109,
1854,
45,
13,
1,
4381,
993,
45,
4237,
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... |
Best way to avoid SQL injection on MSSQL Server from C# code using Linq?
===
What is the best way to avoid SQL injection on MSSQL Server from C# code using Linq?
Should you use a function to strip of security issues or is it handled by the framework? | 0 | [
2,
246,
161,
20,
2658,
4444,
255,
13646,
27,
4235,
18,
22402,
8128,
37,
272,
5910,
1797,
568,
6294,
1251,
60,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
2658,
4444,
255,
13646,
27,
4235,
18,
22402,
8128,
37,
272,
5910,
1797,
568,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 won't parse my JSON from AJAX query
===
I'm having difficulty parsing some JSON data returned from my server using jQuery.ajax()
To perform the AJAX I'm using:
$.ajax({
url: myUrl,
cache: false,
dataType: "json",
success: function(data){
...
},
error: function(e, xhr){
...
}
});
And if I return an array of items then it works fine:
[ { title: "One", key: "1" }, { title: "Two", key: "2" } ]
The success function is called and receives the correct object.
However, when I'm trying to return a single object:
{ title: "One", key: "1" }
The error function is called and xhr contains 'parsererror'. I've tried wrapping the JSON in parenthesis on the server before sending it down the wire, but it makes no difference. Yet if I paste the content into a string in Javascript and then use the eval() function, it evaluates it perfectly.
Any ideas what I'm doing wrong?
Anthony | 0 | [
2,
487,
8190,
93,
230,
22,
38,
2017,
870,
51,
487,
528,
37,
20624,
25597,
800,
3726,
3726,
31,
22,
79,
452,
6967,
2017,
18,
68,
109,
487,
528,
1054,
587,
37,
51,
8128,
568,
487,
8190,
93,
9,
6881,
7522,
5,
6,
20,
2985,
14,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Multiple definitions due to multiple includes of same header file
===
I have a header file x.h which is included by more than one *.c source files.
This header file has some structure variables defined.
I have put multiple inclusion prevention guard at the beginning of the header file as:
#ifndef X_H
#define X_H
...
..
//header file declarations and definitons.
#endif//X_H
On building i get linekr errors related to Multiple definitions. I understand the problem.
Questions is :
1.) Wont a multiple inclusion prevention guard at the top of header file as i have, prevent multiple inclusions of the header file x.h and thereby avoid multiple definitions of the variables that are there in x.h??
2.) #pragma once does not work on this particular compiler, so what is the solution.
Someone had posted [this][1] answer to a similar question. It doesnt seem to work for me. How does this solution work?
wishes,
-AD
[1]: http://stackoverflow.com/questions/223771/repeated-multiple-definition-errors-from-including-same-header-in-multiple-cpps#223798 | 0 | [
2,
1886,
18544,
397,
20,
1886,
1103,
16,
205,
157,
106,
3893,
800,
3726,
3726,
31,
57,
21,
157,
106,
3893,
993,
9,
252,
56,
25,
506,
34,
91,
119,
53,
1637,
9,
150,
1267,
6488,
9,
48,
157,
106,
3893,
63,
109,
1411,
12157,
2811,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a process intercept stdout and stderr of another process ?
===
I have some scripts that ought to have stopped running but hang around for ever.
I'd like to know what is happening to them. Is there some way I can figure out what they're writing to stdout and stderr in a readable way ?
I tried, for example, to do
tail -f /proc/(pid)/fd/1
but that doesn't really work. It was a long shot anyway.
Any other ideas ? strace on its own is quite verbose and unreadable for seeing this. | 0 | [
2,
184,
92,
21,
953,
18324,
354,
43,
1320,
17,
354,
1157,
139,
16,
226,
953,
13,
60,
800,
3726,
3726,
31,
57,
109,
17505,
30,
11869,
20,
57,
1175,
946,
47,
4546,
140,
26,
462,
9,
31,
22,
43,
101,
20,
143,
98,
25,
4942,
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... |
Run command when bash script is stopped
===
How can i, in a bash script, execute a command when the user stops the script (with ctrl - c)?
Currently, i have this:
afplay file.mp3
while true:
do osascript -e "set volume 10"
end
But i would like it to execute `killall afplay` when the user is finished with it, regardless if it is command-c or another keypress. | 0 | [
2,
485,
1202,
76,
13158,
3884,
25,
1175,
800,
3726,
3726,
184,
92,
31,
15,
19,
21,
13158,
3884,
15,
15644,
21,
1202,
76,
14,
4155,
6604,
14,
3884,
13,
5,
1410,
13,
4812,
6362,
13,
8,
272,
6,
60,
871,
15,
31,
57,
48,
45,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Efficient way to recursively calculate dominator tree?
===
I'm using the Lengauer and Tarjan algorithm with path compression to calculate the dominator tree for a tree where there are millions of nodes. The algorithm is quite complex and I have to admit I haven't taken the time to fully understand it, I'm just using it. Now I have a need to calculate the dominator trees of the direct children of the root node and possibly recurse down the tree to a certain depth repeating this operation. I.e. when I calculate the dominator tree for a child of the root node I want to pretend that the root node has been removed from the graph.
My question is whether there is an efficient solution to this that makes use of immediate dominator information already calculated in the initial dominator tree for the root node? In other words I don't want to start from scratch for each of the children because the whole process is quite time consuming.
Naively it seems it must be possible since there will be plenty of nodes deep down in the tree that have idoms just a little way above them and are unaffected by changes at the top of the tree.
BTW just as aside: it's bizarre that the subject of dominator trees is "owned" by compiler people and there is no mention of it in books on classic graph theory. The application I'm using it for - my FindRoots java heap analyzer - is not related to compiler theory. | 0 | [
2,
8243,
161,
20,
302,
24244,
102,
18469,
107,
28607,
1541,
60,
800,
3726,
3726,
31,
22,
79,
568,
14,
10655,
12869,
106,
17,
2475,
4098,
9083,
29,
2013,
14864,
20,
18469,
14,
107,
28607,
1541,
26,
21,
1541,
113,
80,
50,
11999,
16,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to convert DateTime from JSON to C#?
===
I've got the following class:
[DataContractAttribute]
public class TestClass
{
[DataMemberAttribute]
public DateTime MyDateTime { get; set; }
}
Here's the JSON:
{ "MyDateTime":"1221818565" }
The JSON is being returned from a PHP webservice.
What I need to do, is convert that epoch string into a valid C# DateTime. What's the best way of doing this?
I can do this:
[IgnoreDataMemberAttribute]
public DateTime MyDateTime { get; set; }
[DataMemberAttribute(Name = "MyDateTime")]
public Int32 MyDateTimeTicks
{
get { return this.MyDateTime.Convert(...); }
set { this.Created = new DateTime(...); }
}
But the trouble with this is, the MyDateTimeTicks is public (changing it to private causes an exception in the serialization process)
| 0 | [
2,
184,
20,
8406,
1231,
891,
37,
487,
528,
20,
272,
5910,
60,
800,
3726,
3726,
31,
22,
195,
330,
14,
249,
718,
45,
636,
18768,
23311,
721,
14755,
500,
317,
718,
1289,
1898,
13,
1,
636,
18768,
6990,
721,
14755,
500,
317,
1231,
89... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I remove items from the Site Actions menu in SharePoint?
===
How can I customise the Site Actions menu to remove or rename 'standard' menu items? Where are the site actions menu items defined? | 0 | [
2,
184,
107,
31,
4681,
3755,
37,
14,
689,
3078,
11379,
19,
1891,
3132,
60,
800,
3726,
3726,
184,
92,
31,
5816,
2628,
14,
689,
3078,
11379,
20,
4681,
54,
302,
7259,
13,
22,
15566,
22,
11379,
3755,
60,
113,
50,
14,
689,
3078,
1137... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Ordering URL's
===
I am writing a Jython script to sort a list of URL's.
I have a list that looks like this:
http://www.domain.com/folder1/folder2/|,1<br />
http://www.domain.com/folder1/|,1<br />
http://www.domain.com/folder1/folder2/folder3/|,1<br />
http://www.domain.com/folder1/|,1<br />
http://www.domain.com/folder1/folder2/|,1<br />
http://www.domain.com/folder1/folder2/|,1<br />
http://www.domain.com/folder1/folder2/folder3/|,1<br />
The pipe and the comma separates the path from the amount of files that are under that path.
Is it possible some how use Jython to order the URL's by length, so it would end up look like the below list:
http://www.domain.com/folder1/|,1<br />
http://www.domain.com/folder1/|,1<br />
http://www.domain.com/folder1/folder2/|,1<br />
http://www.domain.com/folder1/folder2/|,1<br />
http://www.domain.com/folder1/folder2/|,1<br />
http://www.domain.com/folder1/folder2/folder3/|,1<br />
http://www.domain.com/folder1/folder2/folder3/|,1<br />
Hope you guys get what I mean, any help would be appreciated. Cheers | 0 | [
2,
15775,
287,
6362,
22,
18,
800,
3726,
3726,
31,
589,
1174,
21,
487,
93,
11570,
3884,
20,
2058,
21,
968,
16,
287,
6362,
22,
18,
9,
31,
57,
21,
968,
30,
1879,
101,
48,
45,
7775,
6903,
6483,
9,
537,
6232,
9,
960,
118,
8814,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to deploy and debug PocketPC applications in the SDK emulators without using ActiveSync?
===
Im currently working on a PPC application that I would like to test in the PPC emulator "USA Windows mobile 5.0 PC R2 Emulator" without using Active Sync. Somewhere in my back head I think I have been able to just do that: But when I start a debug session with Visual Studio, it can not deploy the application to the emulator. All I get in the build log is:
9>------ Deploy started: Project: DLL1, Configuration: Debug Salsa ARMv4 Windows Mobile 5.0 Pocket PC SDK (ARMV4I) ------
9>There are no more files.
9>
10>------ Skipped Deploy: Project: DLL2, Configuration: Debug Salsa ARMv4 Windows Mobile 5.0 Pocket PC SDK (ARMV4I) ------
10>Project not selected to build for this solution configuration
11>------ Deploy started: Project: DLL3, Configuration: Debug Salsa ARMv4 Windows Mobile 5.0 Pocket PC SDK (ARMV4I) ------
11>There are no more files.
11>
========== Build: 0 succeeded, 0 failed, 7 up-to-date, 5 skipped ==========
========== Deploy: 3 succeeded, 2 failed, 7 skipped ==========
If I cradle it (Using Device Emulator manager) and let the device sync through ActiveSync, then Visual Studio can deploy and debug. But I would like to debug some connectivity issues without being connected thorugh ActiveSync. How can I do that?
| 0 | [
2,
25,
32,
938,
20,
17617,
17,
121,
16254,
3397,
5779,
3767,
19,
14,
13,
18,
43,
197,
3579,
14868,
18,
366,
568,
1348,
9507,
150,
60,
800,
3726,
3726,
797,
871,
638,
27,
21,
3273,
150,
3010,
30,
31,
83,
101,
20,
1289,
19,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the application design aspects to be considered when developing a Multi-Tier, High Availability web application?
===
The application is planned to be built using ASP.NET, .NET Remoting & MS SQL Server.
High availability is required at presentation layer, application layer and database.
Does IIS 7.0 provide any advantages over IIS 6.0 in regard to the High availability aspect? | 0 | [
2,
98,
50,
14,
3010,
704,
4842,
20,
44,
724,
76,
3561,
21,
1889,
8,
5259,
15,
183,
11886,
2741,
3010,
60,
800,
3726,
3726,
14,
3010,
25,
2035,
20,
44,
392,
568,
28,
306,
9,
2328,
15,
13,
9,
2328,
302,
7662,
68,
279,
4235,
44... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to convert UNIX timestamp to DateTime and vice versa?
===
As the title says really.
There is this example code, but then it starts talking about millisecond / nanosecond problems.
http://blogs.msdn.com/brada/archive/2004/03/20/93332.aspx | 0 | [
2,
184,
20,
8406,
22540,
436,
38,
10158,
20,
1231,
891,
17,
1821,
18596,
60,
800,
3726,
3726,
28,
14,
581,
898,
510,
9,
80,
25,
48,
823,
1797,
15,
47,
94,
32,
3244,
1582,
88,
13436,
5007,
13,
118,
10371,
5007,
1716,
9,
7775,
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... |
Free C# Training Resources?
===
My boss (being completely unreasonable and wanting everything yesterday like most bosses) wants me to run a C# training session with our new recruits. Unfortunately he wants this done next week and with my current workload means I have little time to put together from scratch any slides or other resources.
Anyone know of any good slides, presentations, labs or other materials out there that I can grab and customize for our purposes rather than having to start from nothing?
Thanks. | 0 | [
2,
551,
272,
5910,
838,
2566,
60,
800,
3726,
3726,
51,
4054,
13,
5,
10554,
1524,
28454,
17,
4638,
796,
7124,
101,
127,
24889,
6,
2846,
55,
20,
485,
21,
272,
5910,
838,
3723,
29,
318,
78,
17307,
9,
6200,
24,
2846,
48,
677,
328,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to determine if a directory is on same partition
===
Say I have an input file, and a target directory. How do I determine if the input file is on the same hard-drive (or partition) as the target directory?
What I want to do is the copy a file if it's on a different, but move it if it's the same. For example:
target_directory = "/Volumes/externalDrive/something/"
input_foldername, input_filename = os.path.split(input_file)
if same_partition(input_foldername, target_directory):
copy(input_file, target_directory)
else:
move(input_file, target_directory) | 0 | [
2,
184,
20,
3746,
100,
21,
16755,
25,
27,
205,
10711,
800,
3726,
3726,
395,
31,
57,
40,
6367,
3893,
15,
17,
21,
2935,
16755,
9,
184,
107,
31,
3746,
100,
14,
6367,
3893,
25,
27,
14,
205,
552,
8,
14573,
13,
5,
248,
10711,
6,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Align element under other element through css
===
I have a really simple search form with the following
- Label ("Search")
- Textbox (fixed width)
- Submit button
- "Advanced" link
Label, textbox and submit are all on one horizontal line and centered.
Now I would like my advanced link to be under the submit button.
Any ideas?
| 0 | [
2,
23389,
4520,
131,
89,
4520,
120,
272,
18,
18,
800,
3726,
3726,
31,
57,
21,
510,
1935,
2122,
505,
29,
14,
249,
13,
8,
1899,
13,
5,
7,
25136,
7,
6,
13,
8,
1854,
5309,
13,
5,
18594,
69,
9456,
6,
13,
8,
12298,
5167,
13,
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... |
OS X: Determine Trash location for a given path
===
Simply moving the file to `~/.Trash/` will not work, as if the file os on an external drive, it will move the file to the main system drive..
Also, there are other conditions, like files on external drives get moved to `/Volumes/.Trash/501/` (or whatever the current user's ID is)
Given a file or folder path, what is the correct way to determine the trash folder? I imagine the language is pretty irrelevant, but I intend to use Python | 0 | [
2,
13,
759,
993,
45,
3746,
10744,
1474,
26,
21,
504,
2013,
800,
3726,
3726,
1659,
1219,
14,
3893,
20,
13,
1,
118,
9,
38,
15469,
118,
1,
129,
52,
170,
15,
28,
100,
14,
3893,
13,
759,
27,
40,
4886,
1493,
15,
32,
129,
780,
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... |
How to fix possible db correction?
===
I'm at a client doing some quick fixes to their access application. It was a while I had a go with access, but I'm recovering quickly. However, I've discovered an interesting problem:
For some reports, I get a "Record is deleted" error. I've checked the reports, and it seems like there's a problem with one table. When opening that table, I find a record where all columns are marked "#deleted". So obviously, this row seems to be the culprit. However, when I try to delete that row, nothing really happens. If I re-open the table, the row still exists.
Is there a corruption in the db? How can I remove this record for good? | 0 | [
2,
184,
20,
6098,
938,
13,
9007,
14608,
60,
800,
3726,
3726,
31,
22,
79,
35,
21,
6819,
845,
109,
2231,
6098,
160,
20,
66,
1381,
3010,
9,
32,
23,
21,
133,
31,
41,
21,
162,
29,
1381,
15,
47,
31,
22,
79,
15135,
976,
9,
207,
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... |
Sharing Files in SVN
===
I am in the process of moving from VSS to SVN and I'm not sure how to share files in SVN.
Basically we have the following structure in VSS
$MOSS
- Components
- ComponentA
- bin
- ComponentB
- bin
- GAC Mirror
GAC Mirror holds a shared copy of all the Dlls from the bin folders of the components to allow for easy copying to the GAC.
In VSS all you do is drag the Dll from the bin folder to the GAC Mirror folder and it works it's life out.
How would I do this in SVN?
Thanks in advance.
| 0 | [
2,
6126,
6488,
19,
13,
18,
16578,
800,
3726,
3726,
31,
589,
19,
14,
953,
16,
1219,
37,
4611,
18,
20,
13,
18,
16578,
17,
31,
22,
79,
52,
562,
184,
20,
1891,
6488,
19,
13,
18,
16578,
9,
11374,
95,
57,
14,
249,
1411,
19,
4611,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Round a Time in T-SQL
===
I'me looking for a function that would receive a time and would round it to the next/previous hour / half-hour / quarter / minute.
| 0 | [
2,
184,
20,
560,
21,
85,
19,
13,
38,
8,
18,
22402,
800,
3726,
3726,
31,
22,
790,
699,
26,
21,
1990,
30,
83,
2588,
21,
85,
17,
83,
560,
32,
20,
14,
328,
118,
3515,
1755,
1291,
1671,
13,
118,
519,
8,
4754,
13,
118,
2650,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to I dynamically set the expiry time for a cookie-based session in Rails
===
I'm currently using the ActiveRecord-based session store for my Rails app and I have a background process which clears out inactive sessions every 30 minutes.
I'd like to switch to Rails' new cookie-based session store but how do I set the expiry time of the session to 30 minutes, as opposed to the default 'at end of session' value? | 0 | [
2,
184,
20,
31,
7782,
1326,
309,
14,
1396,
2159,
622,
85,
26,
21,
19980,
8,
1281,
3723,
19,
2240,
18,
800,
3726,
3726,
31,
22,
79,
871,
568,
14,
1348,
14953,
8,
1281,
3723,
1718,
26,
51,
2240,
18,
4865,
17,
31,
57,
21,
2395,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should I expect problems when communicating via RMI between Java5 and Java6?
===
Basically the subject says it all: We have a couple of components running on Java 5, they're talking to each other via RMI. Should we expect any problems, if we move some of them to Java6? By moving I mean compiling them with `-source/target 1.6` and running on a java6 vm. | 0 | [
2,
378,
31,
4186,
1716,
76,
23284,
1197,
761,
1435,
128,
8247,
264,
17,
8247,
379,
60,
800,
3726,
3726,
11374,
14,
1550,
898,
32,
65,
45,
95,
57,
21,
1335,
16,
5090,
946,
27,
8247,
331,
15,
59,
22,
99,
1582,
20,
206,
89,
1197,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
using system.thread.threadpool in powershell
===
I am after a example of some code in powershell using the threadpool. my friends at google can not help me. Any example would be great.
Donald | 0 | [
2,
568,
329,
9,
96,
10647,
9,
96,
10647,
13378,
19,
414,
15984,
800,
3726,
3726,
31,
589,
75,
21,
823,
16,
109,
1797,
19,
414,
15984,
568,
14,
9322,
13378,
9,
51,
954,
35,
8144,
92,
52,
448,
55,
9,
186,
823,
83,
44,
374,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I avoid multiple CASTs in sql query?
===
I have the following sql query for transforming data but is it possible to save the value of the int in some variable to avoid casting multiple times?
update prospekts set sni_kod = case
when
cast(sni_kod as int) >= 1000 and cast(sni_kod as int) <= 1499
or cast(sni_kod as int) >= 1600 and cast(sni_kod as int) <= 2439
then 1
else
sni_kod
end
There are a lot more when-cases in the script, just showing the first one. I cannot use anything other than a simple text-script.
Thanks
Anders | 0 | [
2,
184,
107,
31,
2658,
1886,
1325,
18,
19,
4444,
255,
25597,
60,
800,
3726,
3726,
31,
57,
14,
249,
4444,
255,
25597,
26,
22335,
1054,
47,
25,
32,
938,
20,
2079,
14,
1923,
16,
14,
19,
38,
19,
109,
7612,
20,
2658,
9087,
1886,
43... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are there C++ free and fast (maybe standalone) refactoring tools for Windows?
===
At the moment I am working in a pretty big project and I have been been asked to refactor some old code. Most of the refactoring is setting apart a big class into smaller components and functions.
I've searched and seen some other [questions][1] related with the topic but I am not very happy with the proposed options. The problem with these is that
- Everybody here uses VS2k5 in Windows and I am not very keen on using different editors for the same project.
- The Reactor! plugin for VS2k5 is just too slow to work with.
- Reactor!Pro is not for free and I am not that sure it would work faster.
I was just wondering if there is any lightweight standalone GUI-based free tool that does not make my computer work slower than a lame snail. It does not have to make 150 refactorings just the basics. Maybe I am asking for too much!
[1]: http://stackoverflow.com/questions/16167/good-refactoring-support-for-c | 0 | [
2,
50,
80,
272,
20512,
551,
17,
1512,
13,
5,
5138,
26986,
6,
302,
17455,
68,
4672,
26,
1936,
60,
800,
3726,
3726,
35,
14,
688,
31,
589,
638,
19,
21,
1772,
580,
669,
17,
31,
57,
74,
74,
411,
20,
302,
17455,
109,
315,
1797,
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 use NUnit
===
I am wondering how to use NUnit correctly. First i created a separate Test-Project that uses my main project as reference. But in that case i am not able to test private methods. My guess was that i need to include my testcode into my main code?! - That doesn't seem to be the correct way to do it. (I dislike the idea of shipping code with tests in it.)
How do you test private methods with NUnit? | 0 | [
2,
184,
20,
275,
10210,
242,
800,
3726,
3726,
31,
589,
5712,
184,
20,
275,
10210,
242,
12044,
9,
64,
31,
679,
21,
1725,
1289,
8,
21011,
30,
2027,
51,
407,
669,
28,
2801,
9,
47,
19,
30,
610,
31,
589,
52,
777,
20,
1289,
932,
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... |
UITextField isFirstResponder always returns false (iPhone)
===
In my view controller's viewDidLoad method, I call [myTextField becomeFirstResponder]; This works like a charm, opens the keyboard and myTextField gets focus.
I have a button with a target action (the action is in the same controller) that checks [myTextField isFirstReponder] - but it always returns false (er, NO in Cocoa terms ;)).
Is that not the right way to find out if myTextField has the keyboard up for input? | 0 | [
2,
13,
5661,
11969,
1109,
25,
3552,
99,
18,
17738,
106,
550,
4815,
4997,
13,
5,
49,
7709,
6,
800,
3726,
3726,
19,
51,
1418,
9919,
22,
18,
1418,
3052,
8294,
2109,
15,
31,
645,
636,
915,
11969,
1109,
533,
3552,
99,
18,
17738,
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... |
System.UnauthorizedAccessException when running a test in VS2008
===
When I run selenium tests (written as nunit tests) from VS2008 I am getting System.UnauthorizedAccessException : Access to the path /bin/Debug is denied. The test is trying to read a entry in App.Config( this file is copied to bin/Debug during compilation).
I used unlocker to check file handles and it is VS2008 that has a handle to that file. | 0 | [
2,
329,
9,
1020,
10007,
1333,
20604,
10066,
872,
76,
946,
21,
1289,
19,
4611,
2753,
800,
3726,
3726,
76,
31,
485,
23027,
14311,
4894,
13,
5,
6390,
28,
10210,
242,
4894,
6,
37,
4611,
2753,
31,
589,
1017,
329,
9,
1020,
10007,
1333,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Restrict adding control on Panel
===
How can i restrict adding controls in Panel in C# window controls? I have to restrict user to add controls in a panel at design time. | 0 | [
2,
15436,
4721,
569,
27,
4113,
800,
3726,
3726,
184,
92,
31,
15436,
4721,
8671,
19,
4113,
19,
272,
5910,
1463,
8671,
60,
31,
57,
20,
15436,
4155,
20,
3547,
8671,
19,
21,
4113,
35,
704,
85,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What could cause an ORA-00936 - Missing Expression with the following sql?
===
We're seeing the error message ORA-00936 Missing Expression for the following SQL:
Note that this is just a cut-down version of a much bigger SQL so rewriting it to a inner join or similar is not really in the scope of this:
This is the SQL that fails:
select (select count(*) from gt_roster where ROS_ROSTERPLAN_ID = RPL_ID)
from gt_rosterplan
where RPL_ID = 432065061
What I've tried:
* Extracting the innermost SQL and substituting the ID from the outer SQL gives me the number 12.
* Aliasing both the sub-query, and the count(*) individually and both at the same time does not change the outcome (ie. still an error)
What else do I need to look at?
The above are only tables, no views, RPL_ID is primary key of gt_rosterplan, and ROS_ROSTERPLAN_ID is a foreign key to this column, there is basically no magic or hidden information here. | 0 | [
2,
98,
110,
1679,
40,
54,
58,
8,
2032,
4069,
379,
13,
8,
2863,
1803,
29,
14,
249,
4444,
255,
60,
800,
3726,
3726,
95,
22,
99,
2078,
14,
7019,
2802,
54,
58,
8,
2032,
4069,
379,
2863,
1803,
26,
14,
249,
4444,
255,
45,
1945,
30... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why doesn't my Path show up when I programmatically add segments to the path in Silverlight 2?
===
I'm creating a Path in Silverlight, and adding elements to it on mouse events. But, although the elements are there in memory, the screen doesn't get updated until something else causes a screen repaint to happen.
Here's the relevant code - I'm responding to a mouse event, and I keep a class member of the path I'm editing.
Path path = null;
private void LayoutRoot_MouseLeftButtonDown(object sender, MouseButtonEventArgs e)
{
Point thisPoint = e.GetPosition(LayoutRoot);
if (path == null)
{
CreateNewPath(thisPoint);
path.LayoutUpdated += new EventHandler(path_LayoutUpdated);
}
else
{
path.AddLineElement(thisPoint);
}
}
private void CreateNewPath(Point startPoint)
{
path = new Path();
PathGeometry geometry = new PathGeometry();
path.Data = geometry;
PathFigureCollection figures = new PathFigureCollection();
geometry.Figures = figures;
PathFigure figure = new PathFigure();
figures.Add(figure);
figure.StartPoint = startPoint;
figure.Segments = new PathSegmentCollection();
path.Stroke = new SolidColorBrush(Colors.Red);
path.StrokeThickness = 2;
path.Stretch = Stretch.None;
LayoutRoot.Children.Add(path);
}
`AddLineElement` is an extension method for the path class just to simplify:
public static class PathHelper
{
public static void AddLineElement(this Path thePath, Point newPoint)
{
PathGeometry geometry = thePath.Data as PathGeometry;
geometry.Figures[0].Segments.Add(new LineSegment { Point = newPoint });
}
}
This is the minimum needed to reproduce the problem. If you run this code in a full WPF app it all works as expected. Mouse clicks add line elements which appear immediately. However, in Silverlight it's a different matter. The clicks appear to do nothing, even though stepping through the code shows that the data is getting added. But if you click a few times, then resize the browser, for example, the path elements appear. If you happen to have a button on the page as well, and move the mouse over, the path will appear.
I've tried all the obvious things, like calling InvalidateMeasure and InvalidateArrange on the Path (and on the parent grid) to no avail.
The only workaround I've got is to change a property on the path then change it back, which seems to be enough to get the rendering engine to draw the new path elements. I use Opacity. You have to set it to a different value, otherwise (I presume) the PropertyChanged event won't fire. It's a kludge, though.
Has anyone else played with paths in this way? I guess if I were putting other graphical elements on screen at the same time this wouldn't be an issue, so it's probably not something which will affect may people, but it would be good to know if there's a more correct way to do it. | 0 | [
2,
483,
1437,
22,
38,
51,
2013,
298,
71,
76,
31,
625,
6732,
1326,
3547,
9061,
20,
14,
2013,
19,
1172,
3130,
172,
60,
800,
3726,
3726,
31,
22,
79,
2936,
21,
2013,
19,
1172,
3130,
15,
17,
4721,
2065,
20,
32,
27,
7567,
963,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.