unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
How do you "override" an Internal Class in C#?
===
There's something I want to customize in the System.Web.Script.Services.ScriptHandlerFactory and other .NET stuff inside an internal class. Unfortunately, it's an internal class. What options do I have when trying to customize a method in this class? | 0 | [
2,
184,
107,
42,
13,
7,
2549,
11891,
7,
40,
3117,
718,
19,
272,
5910,
60,
800,
3726,
3726,
80,
22,
18,
301,
31,
259,
20,
5816,
2952,
19,
14,
329,
9,
14113,
9,
8741,
9,
11449,
18,
9,
8741,
3203,
1252,
17455,
93,
17,
89,
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... |
In C++ what are the benefits of using exceptions and try / catch instead of just returning an error code?
===
I've programmed C and C++ for a long time and so far I've never used exceptions and try / catch. What are the benefits of using that instead of just having functions return error codes?
| 0 | [
2,
19,
272,
20512,
98,
50,
14,
5800,
16,
568,
13392,
17,
1131,
13,
118,
2949,
700,
16,
114,
2485,
40,
7019,
1797,
60,
800,
3726,
3726,
31,
22,
195,
2866,
43,
272,
17,
272,
20512,
26,
21,
175,
85,
17,
86,
463,
31,
22,
195,
24... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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? browser based online games [not BB-type text based but rich rpg's with spriting etc...]
===
with the current advancements in javascript for rich browser interfaces
would it be possible to create semi-massive multiplayer online games
running on our browsers in the near future?
well we could say that if we really want games we still must stick with c++
but im just asking for possibilities here and answers from open-minded persons
| 0 | [
2,
25,
32,
938,
60,
16495,
432,
2087,
466,
636,
1270,
13,
3490,
8,
4474,
1854,
432,
47,
2042,
22338,
22,
18,
29,
13,
18,
6944,
1203,
2722,
9,
9,
9,
500,
800,
3726,
3726,
29,
14,
866,
12624,
18,
19,
8247,
8741,
26,
2042,
16495,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Java webservice (soap) client - use certificates
===
I am trying to connect to a webservice over ssl with a client certificate. Is there an elegant way of doing this apart from shoving things like "javax.net.ssl.keyStore" into System.properties.
Any pointers to code examples would be appreciated. | 0 | [
2,
8247,
2741,
11449,
13,
5,
656,
2552,
6,
6819,
13,
8,
275,
6259,
18,
800,
3726,
3726,
31,
589,
749,
20,
6379,
20,
21,
2741,
11449,
84,
13,
18,
18,
255,
29,
21,
6819,
6259,
9,
25,
80,
40,
11614,
161,
16,
845,
48,
2629,
37,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I make <li> with block elements sit beside each other?
===
I have a mockup layout for something [here][1]. Essentially there are sections, columns and fields, which are all written as a combination of <ul> and <li> elements. This is done specifically for later parsing.
A snippet of the HTML:
<li class="layout"><span class="type">[Column] </span>
<ul class="layout-children">
<li class="field"><span class="type">[Text] </span>A field</li>
<li class="field"><span class="type">[Text] </span>Another field</li>
<li class="field"><span class="type">[Text] </span>Yet another field</li>
</ul>
</li>
<li class="layout"><span class="type">[Column] </span>
<ul class="layout-children">
<li class="field"><span class="type">[Text] </span>More fields</li>
<li class="field"><span class="type">[Text] </span>And one more field</li>
</ul>
</li>
If you go to the [linked content][1] you'll note that those columns sit vertically.
I want the columns to sit beside each other, but I am not sure how to go about it.
It would be preferable if the HTML didn't change, just the CSS.
[1]: http://www.mylittlepwnage.com/misc/forms-editor.html | 0 | [
2,
184,
107,
31,
233,
13,
1,
1210,
1,
29,
1921,
2065,
2066,
2113,
206,
89,
60,
800,
3726,
3726,
31,
57,
21,
10506,
576,
9106,
26,
301,
636,
6836,
500,
2558,
165,
500,
9,
7398,
80,
50,
4501,
15,
7498,
17,
2861,
15,
56,
50,
65... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can you see the sql that is causing an error on SubmitChanges in LINQ to SQL?
===
I've got some LINQ to SQL that sometimes throws a
> "Cannot insert duplicate key row in object 'dbo.Table' with unique index
> 'IX_Indexname'.The statement has been terminated."
Is there some way I can turn on logging or at least debug into the datacontext to see what sql is being executed at the time that error is raised? | 0 | [
2,
184,
92,
42,
196,
14,
4444,
255,
30,
25,
3242,
40,
7019,
27,
12298,
16229,
18,
19,
6294,
1251,
20,
4444,
255,
60,
800,
3726,
3726,
31,
22,
195,
330,
109,
6294,
1251,
20,
4444,
255,
30,
1030,
13566,
21,
13,
1,
13,
7,
1245,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
integer formatting with given digits
===
I have a demand of the integer formatting. For example, with certain four digits, the output of the integer 4 is "0004" instead of "4". How can I do this in C# 2.0?
Thanks in advance. | 0 | [
2,
13820,
2595,
1203,
29,
504,
19076,
800,
3726,
3726,
31,
57,
21,
3888,
16,
14,
13820,
2595,
1203,
9,
26,
823,
15,
29,
1200,
222,
19076,
15,
14,
5196,
16,
14,
13820,
268,
25,
13,
7,
3993,
300,
7,
700,
16,
13,
7,
300,
7,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to navigate between fields with Enter Key
===
My company has a large application written in VB6, and for historical reasons, the application is navigated with the Enter key instead of with the Tab key. I don't know VB6, but I know that they currently set the focus for each control in a big select statement in the Form's KeyUp event if it's an EnterKey. Now we are starting to convert to .NET, and have to keep things consistent. I want to write ancestor forms that will automatically ENTER from field to field instead of tabbing. A coworker told me that the way it's done in VB6 is to process buttons not on the CLICK event but on the KEYUP event. I need to continue doing this so I won't have leftover KeyUp events to pass back to VB6 after my form is finished. The order of events for buttons is
1. button_PreviewKeyDown
2. button_Click (apparently replacing the KeyPress event)
3. form_KeyUp
4. button_KeyUp
I created forms as follows:
- On the ANCESTOR form's KeyUp event, checks to see if it's an enter key. If it is an enter key, and the active control is not a button, it moves to the next field in tab order. Otherwise it ignores the key and lets the control handle it. If it is a button, the ancestor doesn't presume to know where the button wants control to go, because it will depend on what the button wants to do when it is "clicked".
- On the CHILD form's buttons, the click event does nothing, and the processing is duplicated in the KeyUp event and the MouseClick event.
- The ANCESTOR form has a protected Boolean, EatKeyUp, that can be set to True by the CHILD. This is used when the child form needs to send a MessageBox, because if the user enters through the OK button on the MessageBox, there is still a leftover KeyUp event that will be consumed by the ancestor form.
Although klugey, this actually seems to work. What I want to know is, is there a better way? Perhaps some setting somewhere that I can tell my application "Enter through forms instead of tabbing"? | 0 | [
2,
184,
20,
20782,
128,
2861,
29,
2830,
1246,
800,
3726,
3726,
51,
237,
63,
21,
370,
3010,
642,
19,
13,
20468,
379,
15,
17,
26,
1668,
2932,
15,
14,
3010,
25,
20782,
43,
29,
14,
2830,
1246,
700,
16,
29,
14,
6523,
1246,
9,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.NET 2.0 WinForm: Supporting DPI and Default Font Changes
===
So i'm trying to figure out how the Form's AutoScaleMode property can possibly help to support a system with a font or dpi that is different from my work development machine.
From the SDK:
AutoScaleMode Enumeration
public enum AutoScaleMode
None
Automatic scaling is disabled.
Font
Controls scale relative to the dimensions of the
font the classes are using, which is typically the
system font.
Dpi
Controls scale relative to the display resolution.
Common resolutions are 96 and 120 DPI.
By default .NET 2.0 Forms use AutoScaleMode.Font.
So i designed a sample form on my Windows XP, Tahoma 8pt, 96dpi development machine. Then i tried it out on a 14pt Segoe UI machine, at 150 dpi machine, and a 14pt Segoe UI 150dpi machine. The results were not encouraging, as you can see in this screenshot:
![alt text][1]
So obviously the AutoScaleMode property was not designed to enable a .NET Form for support of different font or dpi settings. So what **is** the proper way to support different font and dpi settings?
Edit: Yes the image is partially obscurred by stackoverflow junk. You're savvy enough to right-click and copy-paste [the image url][2] for yourself.
[1]: http://uiguidelines.files.wordpress.com/2008/10/comparison-of-form-autoscalemodes.png
[2]: http://uiguidelines.files.wordpress.com/2008/10/comparison-of-form-autoscalemodes.png | 0 | [
2,
13,
9,
2328,
172,
9,
387,
628,
4190,
45,
3134,
13,
43,
2159,
17,
12838,
9978,
1693,
800,
3726,
3726,
86,
31,
22,
79,
749,
20,
1465,
70,
184,
14,
505,
22,
18,
3108,
5093,
15570,
1354,
92,
2879,
448,
20,
555,
21,
329,
29,
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... |
Harder, Better, Faster, Stronger... Techniques for an image-based CAPTCHA?
===
There are lots of non-image-based CAPTCHA ideas floating around. But what about the old-fashioned way?
What are the elements of a good image CAPTCHA? What visual elements are hard for computers, but easier for humans? What about mistakes, elements that are easier for computers than they are for humans? What are good techniques for increasing the *speed* of a CAPTCHA generator?
Here's an example of a CAPCHA I've been working on. It generates the functions for two sine waves, then stretches a text between them. It lays that over a background drawn from a pool of images.
![Image-based CAPTCHA][1]
How could this be improved? (Specifically, I'm using PHP GD.) Things that come to mind are:
- Change the color of the text, possibly making it multicolored.
- Add "scratches" or marks that mildly obscure the text.
- Add to the distortion so that it's affected by sine waves horizontally as well.
**What goes into a superb image CAPTCHA?**
[1]: http://farm4.static.flickr.com/3178/2936174357_fc9e92b881_m.jpg | 0 | [
2,
5229,
15,
574,
15,
4233,
15,
5375,
9,
9,
9,
4212,
26,
40,
1961,
8,
1281,
13960,
1651,
60,
800,
3726,
3726,
80,
50,
7503,
16,
538,
8,
22039,
8,
1281,
13960,
1651,
3478,
8319,
140,
9,
47,
98,
88,
14,
315,
8,
15016,
161,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Java: What does this Commenting Style Signify ?
===
This will be a Quickdraw I suspect ...
I've been given some code with commenting unlike anything I've come across before:
//{{{ Imports
import imports;
//}}}
It is the same for each method block,
// {{{ above the code block
// }}} below the code block
Is this a markup for a build tool of some kind ? | 0 | [
2,
8247,
45,
98,
630,
48,
17797,
1034,
24802,
13,
60,
800,
3726,
3726,
48,
129,
44,
21,
2231,
43,
12404,
31,
7551,
13,
9,
9,
9,
31,
22,
195,
74,
504,
109,
1797,
29,
17797,
2822,
602,
31,
22,
195,
340,
464,
115,
45,
12894,
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... |
Escaping in a ILIKE query
===
I need to do a query that search for a text with **'Nome % teste \ / '** as prefix. I'm doing the query using:
**where "name" ILIKE 'Nome a% teste \ /%' ESCAPE 'a'** (using a as scape character).
There is a row that match this, but this query returns nothing. Removing the slash (**'Nome % teste \'**), it works. But I don't see why the **slash** is a problem, since the default escape is a **backslash** and I've changed it to **'a'** in this test.
There is something that I'm missing? (I've consulted TFM) | 0 | [
2,
14700,
19,
21,
31,
1403,
25597,
800,
3726,
3726,
31,
376,
20,
107,
21,
25597,
30,
2122,
26,
21,
1854,
29,
13,
1409,
22,
251,
790,
13,
11881,
1289,
62,
13,
1,
13,
118,
13,
22,
1409,
28,
14315,
9,
31,
22,
79,
845,
14,
25597... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Printing out items in any Collection in reverse order?
===
Okay, so I have the following problem in my <i>Data Structures and Problem Solving using Java</i> book:
<b>Write a routine that uses the Collections API to print out the items in any Collection in reverse order. Do not use a ListIterator.</b>
I'm not putting it up here because I want somebody to do my homework, I just can't seem to understand exactly what it is asking for me to code!
When it asks me to write a 'routine', is it looking for a single method? I don't really understand how I can make a single method work for all of the various types of Collections (linked list, queue, stack).
If anybody could guide me in the right direction, I would greatly appreciate it. | 0 | [
2,
7312,
70,
3755,
19,
186,
1206,
19,
7006,
389,
60,
800,
3726,
3726,
1705,
15,
86,
31,
57,
14,
249,
1448,
19,
51,
13,
1,
49,
1,
18768,
3815,
17,
1448,
17533,
568,
8247,
1,
118,
49,
1,
360,
45,
13,
1,
220,
1,
23716,
21,
82... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 read/interact with an old ActiveX SSUltraGrid using UIAutomation
===
I am investigating automated testing of an old Win32 application that used ActiveX controls. I am spiking use White (from Thougthworks) that uses Microsoft UIAutomation. I can find the AutomationElement related to the control, but how do I interact with it?
Spy++ sees the grid control as a single window, so I can't talk to rows, columns, or cells directly. How do I talk to the SSUltraGrid control from my test code?
Cheers
Nigel | 0 | [
2,
184,
107,
1302,
118,
6280,
5183,
29,
40,
315,
1348,
396,
13,
18,
18,
1287,
1939,
16375,
568,
13,
5661,
18042,
79,
857,
800,
3726,
3726,
31,
589,
12490,
14904,
4431,
16,
40,
315,
628,
3125,
3010,
30,
147,
1348,
396,
8671,
9,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Prepared Statement vs. Stored Procedure
===
If you are using php5 and mysql5, is there a substantial advantage to using stored procs over prepared statements? | 0 | [
2,
3268,
3331,
4611,
9,
8214,
7004,
800,
3726,
3726,
100,
42,
50,
568,
13,
26120,
264,
17,
51,
18,
22402,
264,
15,
25,
80,
21,
6185,
3314,
20,
568,
8214,
13,
15617,
18,
84,
3268,
9015,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Anyone know of a good algorithm for rendering an HTML table to an image?
===
There is a standard two-pass algorithm mentioned in RFC 1942: [http://www.ietf.org/rfc/rfc1942.txt][1] however I haven't seen any good real-world implementations. Anyone know of any? I haven't been able to find anything useful in the Mozilla or WebKit code bases, but I am not entirely sure where to look.
I guess this might actually be a deeper problem with having to actually render HTML (the contents of table cells) but just to keep it simple - plaintext HTML table as an image. Even an HTML table rendering algorithm ignoring the "as an image" part...
[1]: http://www.ietf.org/rfc/rfc1942.txt | 0 | [
2,
1276,
143,
16,
21,
254,
9083,
26,
15307,
40,
13,
15895,
859,
20,
40,
1961,
60,
800,
3726,
3726,
80,
25,
21,
1236,
81,
8,
6201,
9083,
2211,
19,
17492,
3148,
45,
636,
21127,
6903,
6483,
9,
660,
11720,
9,
5583,
118,
139,
7061,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can someone recomend example of Lazy Grid implementation in .NET 2.0+?
===
To improve performance/scalability of a WinForms app, I would like to defer calculation of fields that are not visible in the grid until they are needed.
Looking for ideas on how this can be done in .NET 2.0.
One idea inspired by this [post][1] is to attach a DataSource object that supports ITypedList. However ITypedList interface seems awkward for this use as it provides a column rather than row view of the data.
Cheers
[1]: http://jopinblog.wordpress.com/2007/04/30/implementing-itypedlist-for-virtual-properties/ | 4 | [
2,
92,
737,
302,
960,
2451,
823,
16,
16792,
7354,
6123,
19,
13,
9,
2328,
172,
9,
387,
2430,
60,
800,
3726,
3726,
20,
3545,
956,
118,
18,
3430,
4091,
16,
21,
628,
4190,
18,
4865,
15,
31,
83,
101,
20,
121,
2407,
19644,
16,
2861,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Calling a static method on a generic type parameter
===
I was hoping to do something like this, but it appears to be illegal in C#:
<pre><code>
public Collection MethodThatFetchesSomething<T>()
where T : SomeBaseClass
{
return T.StaticMethodOnSomeBaseClassThatReturnsCollection();
}
</code></pre>
I get a compile-time error: "'T' is a 'type parameter', which is not valid in the given context."
Given a generic type parameter, how can I call a static method on the generic class? The static method has to be available, given the constraint. | 0 | [
2,
2555,
21,
12038,
2109,
27,
21,
12733,
1001,
18906,
800,
3726,
3726,
31,
23,
3935,
20,
107,
301,
101,
48,
15,
47,
32,
1780,
20,
44,
5143,
19,
272,
5910,
45,
13,
1,
3515,
1,
9375,
1,
317,
1206,
2109,
887,
19813,
5370,
9099,
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 reference assets from a different subdomain (or CDN) in production?
===
I am working both in the Ruby and Java worlds. I have been inspired somewhat by the [merb-assets][1] project, which provides various functionality to make it easy to reference assets (images, CSS, etc.) located on a subdomain (or CDN).
I want to do the same in Java:
* in **development and testing**, I want to use either JSTL's `<c:url>` or Struts 2's `<s:url value=""/>` tags to reference assets.
* but in **production**, I want to move most of these assets out to a separate subdomain (or CDN).
Are there any taglibs (or other methodologies) out there that can help with this? I don't particular want to litter my views with `<c:if` and tests for `localhost`, everytime I insert an `<img>` or `<link>` tag.
I am using Struts 2 + JSP.
[1]: http://github.com/wycats/merb-more/tree/master/merb-assets | 0 | [
2,
184,
107,
31,
2801,
6223,
37,
21,
421,
972,
537,
6232,
13,
5,
248,
1745,
103,
6,
19,
637,
60,
800,
3726,
3726,
31,
589,
638,
156,
19,
14,
10811,
17,
8247,
126,
18,
9,
31,
57,
74,
3054,
4131,
34,
14,
636,
1263,
220,
8,
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... |
print out post values
===
i have a form that has multiple fields, and for testing purposes is there a (php) way i could print out the values entered in all the fields, without having to individually GET and print each value. | 0 | [
2,
4793,
70,
678,
4070,
800,
3726,
3726,
31,
57,
21,
505,
30,
63,
1886,
2861,
15,
17,
26,
4431,
4612,
25,
80,
21,
13,
5,
26120,
6,
161,
31,
110,
4793,
70,
14,
4070,
1297,
19,
65,
14,
2861,
15,
366,
452,
20,
16579,
164,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
External Styles in JasperReports
===
I'm working on a system that includes a large number of reports, generated using [JasperReports][1]. One of the newer features is that you can define styles for reports.
From the available docs I believe there is some way to have an external file defining styles to use, and you can reference that in your jasper reports. This allows a single style to be used by multiple reports.
I can't find any concrete information on whether this is an actual feature, and if it is, how to use it. Does anyone know if it is possible to have external styles for jasper reports, and if so, how to do it?
Thanks,
Jamie
[1]: http://jasperforge.org/plugins/project/project_home.php?group_id=102 | 0 | [
2,
4886,
6443,
19,
16750,
17437,
18,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
329,
30,
1103,
21,
370,
234,
16,
2813,
15,
6756,
568,
636,
1004,
18,
1432,
17437,
18,
500,
2558,
165,
500,
9,
53,
16,
14,
12372,
967,
25,
30,
42,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Archiving Files
===
I really like the way gmail has the archive system implemented. I can archive any file after adding a tag to it (if needed) and I can search for it whenever I want to.
Is there any program in Windows/Linux which behaves in a similar fashion? | 0 | [
2,
13,
25328,
68,
6488,
800,
3726,
3726,
31,
510,
101,
14,
161,
489,
8079,
63,
14,
9250,
329,
6807,
9,
31,
92,
9250,
186,
3893,
75,
4721,
21,
3383,
20,
32,
13,
5,
821,
851,
6,
17,
31,
92,
2122,
26,
32,
6634,
31,
259,
20,
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... |
Can you mix .net languages within a single project?
===
Can you mix .net languages within a single project? So pre-compiled, I would like to call classes and methods of other source files.
For both web and apps?
In particular I'd be interested in F# and C#.
| 0 | [
2,
92,
42,
2917,
13,
9,
2328,
2556,
363,
21,
345,
669,
60,
800,
3726,
3726,
92,
42,
2917,
13,
9,
2328,
2556,
363,
21,
345,
669,
60,
86,
782,
8,
11103,
49,
1294,
15,
31,
83,
101,
20,
645,
2684,
17,
3195,
16,
89,
1267,
6488,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 get select option text
===
Alright, say I have this:
<select id='list'>
<option value='1'>Option A</option>
<option value='2'>Option B</option>
<option value='3'>Option C</option>
</select>
What would the selector look like if I wanted to get "Option B" when I have the value '2'. Please note that this is not asking how to get the _selected_ text value, but just any one of them, whether selected or not, depending on the value attribute. I tried:
$("#list[value='2']").text();
But it is not working. | 0 | [
2,
487,
8190,
93,
164,
5407,
4255,
1854,
800,
3726,
3726,
11885,
15,
395,
31,
57,
48,
45,
13,
1,
18,
16964,
4924,
3726,
22,
5739,
22,
1,
13,
1,
2594,
3309,
1923,
3726,
22,
165,
22,
1,
2594,
3309,
21,
1,
118,
2594,
3309,
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... |
Is there a pattern for dealing with non-memory resources on cleaning up an ObjC object?
===
It's usual for objects which have some state related to a non-memory resource to provide a method for explicitly 'finishing' with that resource. Is there a preferred common practice for dealing with the case where an object deallocation is attempted while still in the "using my resource" state? I have seen a couple of different approaches:
1. log that the programmer made a mistake and tell them how to debug it (`NSLock` does that)
2. let the caller choose whether the resource is managed by the caller or relinquished on deallocation (e.g. `NSFileHandle`)
3. raise an exception if the object is not in an expected final state, i.e. assert that the programmer isn't going to use my object in that way
4. always clean up on the way out.
The [GC docs][1] confirm that managing other resources alongside memory management is A Bad Idea and (yet) provide an example of doing 4, albeit with caveats. So has anyone "chosen" an approach to always follow?
[1]: http://developer.apple.com/documentation/Cocoa/Conceptual/GarbageCollection/Articles/gcFinalize.html#//apple_ref/doc/uid/TP40002453-SW1 | 0 | [
2,
25,
80,
21,
3732,
26,
5746,
29,
538,
8,
790,
5171,
93,
2566,
27,
9724,
71,
40,
5122,
15864,
3095,
60,
800,
3726,
3726,
32,
22,
18,
3820,
26,
3916,
56,
57,
109,
146,
1597,
20,
21,
538,
8,
790,
5171,
93,
6577,
20,
1181,
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... |
Where to place Javascript in a HTML file?
===
Say I have a fairly hefty javascript file, packed down to roughly 100kb or so, where's the best place to put this in the HTML?
<html>
<head>
<!-- here? -->
<link rel="stylesheet" href="stylez.css" type="text/css" />
<!-- here? -->
</head>
<body>
<!-- here? -->
<p>All the page content ...</p>
<!-- or here? -->
</body>
</html>
Will there be any functional difference between each of the options? | 0 | [
2,
113,
20,
209,
8247,
8741,
19,
21,
13,
15895,
3893,
60,
800,
3726,
3726,
395,
31,
57,
21,
6647,
24,
3072,
93,
8247,
8741,
3893,
15,
9402,
125,
20,
4457,
808,
18167,
54,
86,
15,
113,
22,
18,
14,
246,
209,
20,
442,
48,
19,
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... |
Match Regex with Javascript
===
I need to match something in the form
> < a href="pic/5" id="piclink">< img src="thumb/5"/>< /a>
to find the number, in this case 5, using javascript. I have no idea how to use regexes so I was wondering if anyone here could help out. Thanks! | 0 | [
2,
730,
7953,
1706,
29,
8247,
8741,
800,
3726,
3726,
31,
376,
20,
730,
301,
19,
14,
505,
13,
1,
13,
1,
21,
746,
14057,
3726,
7,
7763,
18133,
7,
4924,
3726,
7,
7763,
6258,
7,
1,
797,
263,
13,
18,
5453,
3726,
7,
96,
723,
220,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Cobertura to fail M2 build for low code coverage
===
I'm trying to configure my WAR project build to fail if the line or branch coverage is below given thresholds. I've been using the configuration provided on page 455 of the excellent book [Java Power Tools][1], but with no success. Here's the relevant snippet of my project's Maven 2 POM:
<build>
...
<plugins>
<plugin>
<groupId>org.codehaus.mojo</groupId>
<artifactId>cobertura-maven-plugin</artifactId>
<version>2.2</version>
<configuration>
<check>
<!-- Per-class thresholds -->
<lineRate>80</lineRate>
<branchRate>80</branchRate>
<!-- Project-wide thresholds -->
<totalLineRate>90</totalLineRate>
<totalBranchRate>90</totalBranchRate>
</check>
<executions>
<execution>
<goals>
<goal>clean</goal>
<goal>check</goal>
</goals>
</execution>
<execution>
<id>coverage-tests</id>
<!-- The "verify" phase occurs just before "install" -->
<phase>verify</phase>
<goals>
<goal>clean</goal>
<goal>check</goal>
</goals>
</execution>
</executions>
<instrumentation>
<excludes>
<exclude>au/**/*Constants.*</exclude>
</excludes>
<ignores>
<ignore>au/**/*Constants.*</ignore>
</ignores>
</instrumentation>
</configuration>
</plugin>
...
</plugins>
...
</build>
As I say, the coverage report works fine, the problem is that the "install" goal isn't failing as it should if the line or branch coverage is below my specified thresholds. Does anyone have this working, and if so, what does your POM look like and which version of Cobertura and Maven are you using? I'm using Maven 2.0.9 and Cobertura 2.2.
I've tried Googling and reading the Cobertura docs, but no luck (the latter are sparse to say the least).
[1]: http://oreilly.com/catalog/9780596527938/ | 0 | [
2,
184,
20,
164,
326,
4461,
3031,
20,
7476,
307,
135,
1895,
26,
708,
1797,
5245,
800,
3726,
3726,
31,
22,
79,
749,
20,
1065,
15951,
51,
176,
669,
1895,
20,
7476,
100,
14,
293,
54,
1686,
5245,
25,
1021,
504,
11361,
18,
9,
31,
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... |
PHP-Based Manual Apps
===
Are there any well-made web apps for writing tehcnical/API type manuals? I've got some code I want to write some "getting started" guides for and maybe some reference content.
PHPDocumentor is all fine and good for documenting my class heirarchy, but I also want to put something together that is a bit more human readable and linear. I suppose a general CMS would work fine, or just building something from scratch. But if there is anything that has been designed specifically with writing online manuals in mind, I'd love to find out more. | 0 | [
2,
13,
26120,
8,
1281,
5132,
4865,
18,
800,
3726,
3726,
50,
80,
186,
134,
8,
5781,
2741,
4865,
18,
26,
1174,
13,
22314,
9881,
4272,
118,
2552,
49,
1001,
5132,
18,
60,
31,
22,
195,
330,
109,
1797,
31,
259,
20,
2757,
109,
13,
7,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Hashes vs Numeric id's
===
When creating a web application that some how displays the display of a unique identifier for a recurring entity (videos on YouTube, or book section on a site like mine), would it be better to use a uniform length identifier like a hash or the unique key of the item in the database (1, 2, 3, etc).
Besides revealing a little, what I think is immaterial, information about the internals of your app, why would using a hash be better than just using the unique id?
In short: **Which is better to use as a publicly displayed unique identifier - a hash value, or a unique key from the database?** | 0 | [
2,
63,
438,
18,
4611,
15764,
596,
4924,
22,
18,
800,
3726,
3726,
76,
2936,
21,
2741,
3010,
30,
109,
184,
9412,
14,
3042,
16,
21,
2619,
25570,
26,
21,
11344,
9252,
13,
5,
14785,
18,
27,
7330,
15,
54,
360,
1050,
27,
21,
689,
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... |
Stack Size for Kernel Development
===
So I'm working on designing an OS, and I'm working on designing (not coding yet) the kernel. This is going to be for an x86 operating system, and my target is for more modern computers, so RAM can be considered to be at least 256M or more.
My question is this: What is a good size to make the stack for each thread run on the system? Or better yet, should I try to design the system in such a way that the stack can be extended automatically if the max length is reached?
I think if I remember correctly that a page in RAM is 4k (4096 bytes) and that just doesn't seem like a lot to me. I can definitely see times, especially when using lots of recursion, that I would want to have more than 1000 ints in RAM at once. Now, the real solution would be to have the program doing this to use malloc and manage its own memory resources a bit, but really I would like to know the user opinion on this.
Is 4k big enough for a stack with modern PC programs? Should the stack be bigger than that? Should the stack be auto-expanding to accomodate any (reasonable) size? I'm interested in this both from a practical developer's standpoint, and a security standpoint.
Or, on the flip side, is 4k to *big* for a stack? Considering normal program execution (especially from the point of view of classes in C++) I notice that good code tends to malloc/new the data it needs when classes are created, to minimize the data being thrown around in a function call.
What might also be important here, and I haven't even gotten into this, is the size of the processor's cache memory. Ideally, I think the stack would reside in the cache to speed things up, and quite frankly I'm not sure if I need to achieve this, or if the processor can handle it for me? I was just planning on using regular boring old RAM for testing purposes.
I can't decide, so I ask you.
Thanks | 0 | [
2,
7566,
1072,
26,
17007,
522,
800,
3726,
3726,
86,
31,
22,
79,
638,
27,
15026,
40,
13,
759,
15,
17,
31,
22,
79,
638,
27,
15026,
13,
5,
1270,
13,
15458,
768,
6,
14,
17007,
9,
48,
25,
228,
20,
44,
26,
40,
993,
3274,
2455,
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... |
Best way to extract the second level domain from the HTTP_Host Variable in VBScript
===
I need to extract only the 2nd level part of the domain from request.servervariables("HTTP_HOST") what is the best way to do this?
| 0 | [
2,
246,
161,
20,
10962,
14,
153,
662,
4603,
37,
14,
7775,
1,
11694,
7612,
19,
13,
20468,
8741,
800,
3726,
3726,
31,
376,
20,
10962,
104,
14,
172,
706,
662,
141,
16,
14,
4603,
37,
3772,
9,
10321,
106,
8220,
579,
18,
5,
7,
21127... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to efficiently empty a perl database file
===
I've inherited a piece of code with a snippet which empties the database as follows:
dbmopen (%db,"file.db",0666);
foreach $key (keys %db) {
delete $db{$key};
}
dbmclose (%db);
This is usually okay but sometimes the database grows very large before this cleanup code is called and it's usually when a user wants to do something important.
Is there a better way of doing this?
| 0 | [
2,
184,
20,
20519,
2424,
21,
416,
255,
6018,
3893,
800,
3726,
3726,
31,
22,
195,
7179,
21,
1855,
16,
1797,
29,
21,
13,
29061,
56,
29863,
14,
6018,
28,
2415,
45,
13,
43,
13178,
10157,
13,
5,
11881,
9007,
15,
7,
16877,
9,
9007,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Smart pointer and virtual
===
I have code like this:
class RetInterface {...}
class Ret1: public RetInterface {...}
class AInterface
{
public:
virtual boost::shared_ptr<RetInterface> get_r() const = 0;
};
class A1: public AInterface
{
public:
boost::shared_ptr<Ret1> get_r() const {...}
};
This code does not compile. In visual studio it raises "C2555: overriding virtual function return type differs and is not covariant". If I do not use <code>boost::shared\_ptr</code>, the code compiles. I can see the problem is because <code>boost::shared\_ptr<Ret1> </code>cannot be dynamically converted into <code>boost::shared\_ptr<RetInterface></code>.
1. Am I doing something wrong?
2. If not, why is the language like this - it should be extensible to handle conversion between smart pointers in this scenario? Is there a desirable getaround? | 0 | [
2,
3978,
454,
106,
17,
6599,
800,
3726,
3726,
31,
57,
1797,
101,
48,
45,
718,
13,
6239,
6280,
6413,
13,
1,
9,
9,
9,
1,
718,
13,
6239,
165,
45,
317,
13,
6239,
6280,
6413,
13,
1,
9,
9,
9,
1,
718,
21,
6280,
6413,
13,
1,
317... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 not use 'protected' or 'private' in PHP?
===
I've been working on the Joomla framework and I have noticed that they use a convention to designate private or protected methods (they put an underscore "`_`" in front of the method name), but they do not explicitly declare any methods `public`, `private`, or `protected`. Why is this? Does it have to do with portability? Are the `public`, `private`, or `protected` keywords not available in older versions of PHP? | 0 | [
2,
483,
52,
275,
13,
22,
16265,
69,
22,
54,
13,
22,
20181,
22,
19,
13,
26120,
60,
800,
3726,
3726,
31,
22,
195,
74,
638,
27,
14,
2640,
2636,
531,
6596,
17,
31,
57,
2711,
30,
59,
275,
21,
3087,
20,
24124,
932,
54,
3803,
3195,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 add NUnit in Visual Studio
===
I need to write test cases for my application. I go for Nunit. Please let me know how to add Nunit to my Visual studio IDE. where can i download them.
Thanks. | 0 | [
2,
184,
20,
3547,
10210,
242,
19,
3458,
1120,
800,
3726,
3726,
31,
376,
20,
2757,
1289,
1871,
26,
51,
3010,
9,
31,
162,
26,
10210,
242,
9,
2247,
408,
55,
143,
184,
20,
3547,
10210,
242,
20,
51,
3458,
1120,
13,
3448,
9,
113,
92... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do you slice arrays in "D"?
===
How are arrays manipulated in "D"? | 0 | [
2,
184,
107,
42,
12982,
7718,
18,
19,
13,
7,
43,
7,
60,
800,
3726,
3726,
184,
50,
7718,
18,
22953,
19,
13,
7,
43,
7,
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... | [
1,
1,
1,
1,
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,
0... |
What does "select((select(s),$|=1)[0])" do in perl.
===
I've seen some horrific code written in perl but I can't make head or tail of this one.
It's in some networking code that we use to communicate with a server and I assume it's something to do with buffering (since it sets $|).
But I can't figure out why there's multiple selects or the array reference. Can anyone help me out? | 0 | [
2,
98,
630,
13,
7,
18,
16964,
5,
5,
18,
16964,
5,
18,
6,
15,
4403,
1,
3726,
165,
6,
2558,
387,
500,
6,
7,
107,
19,
416,
255,
9,
800,
3726,
3726,
31,
22,
195,
541,
109,
25142,
1797,
642,
19,
416,
255,
47,
31,
92,
22,
38,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I search through stackoverflow questions from a script?
===
Given a string of keywords, such as "python best practices", I would like to obtain the first 10 stackoverflow questions that contain that keywords, sorted by relevance (?), say from a python script. My goal is to end up with a list of tuples (title, URL).
How can I accomplish this? Would you consider querying google instead? (How would you do it from python?)
| 0 | [
2,
184,
92,
31,
2122,
120,
7566,
2549,
9990,
2346,
37,
21,
3884,
60,
800,
3726,
3726,
504,
21,
3724,
16,
1246,
12827,
15,
145,
28,
13,
7,
6448,
11570,
246,
5242,
7,
15,
31,
83,
101,
20,
5545,
14,
64,
332,
7566,
2549,
9990,
234... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to escape Python strings in PHP?
===
I have a PHP application which needs to output a python script, more specifically a bunch of variable assignment statements, eg.
subject_prefix = 'This String From User Input'
msg_footer = """This one too."""
The contents of subject_prefix et al need to be written to take user input; as such, I need to escape the contents of the strings. Writing something like the following probably isn't going to cut it:
echo "subject_prefix = '".addslashes($subject_prefix)."'\n";
So. Any ideas?
(Rewriting the app in Python isn't possible due to time constraints. :P ) | 0 | [
2,
98,
25,
14,
246,
161,
20,
2220,
20059,
7887,
19,
13,
26120,
60,
800,
3726,
3726,
31,
57,
21,
13,
26120,
3010,
56,
2274,
20,
5196,
21,
20059,
3884,
15,
91,
3524,
21,
7653,
16,
7612,
8427,
9015,
15,
12369,
9,
1550,
1,
3515,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which AES library to use in Ruby/Python?
===
I need to be able to send encrypted data between a Ruby client and a Python server (and vice versa) and have been having trouble with the [ruby-aes][1] gem/library. The library is very easy to use but we've been having trouble passing data between it and the pyCrypto AES library for Python. These libraries seem to be fine when they're the only one being used, but they don't seem to play well across language boundaries. Any ideas?
[1]: http://rubyforge.org/projects/ruby-aes | 0 | [
2,
56,
21,
160,
1248,
20,
275,
19,
10811,
118,
6448,
11570,
60,
800,
3726,
3726,
31,
376,
20,
44,
777,
20,
2660,
29403,
1054,
128,
21,
10811,
6819,
17,
21,
20059,
8128,
13,
5,
290,
1821,
18596,
6,
17,
57,
74,
452,
2572,
29,
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 do I get character offset information from a pdf document?
===
I'm trying to implement search result highlighting for pdfs in a web app. I have the original pdfs, and small png versions that are used in search results. Essentially I'm looking for an api like:
pdf_document.find_offsets('somestring')
# => { top: 501, left: 100, bottom: 520, right: 150 }, { ... another box ... }, ...
I know it's possible to get this information out of a pdf because Apple's Preview.app implements this.
Need something that runs on Linux and ideally is open source. I'm aware you can do this with acrobat on windows. | 0 | [
2,
184,
107,
31,
164,
925,
17493,
676,
37,
21,
13,
11124,
4492,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
8713,
2122,
829,
23102,
26,
13,
11124,
18,
19,
21,
2741,
4865,
9,
31,
57,
14,
501,
13,
11124,
18,
15,
17,
284,
351,
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... |
How do I set up my Ubuntu VPS to send outgoing mail?
===
My VPS provider (Slicehost) doesn't provide an SMTP server. I use Google Apps to send and receive mail for my domains, but I want to be able to programmatically send e-mail.
I've been Googling this issue on and off for many months, and I just can't seem to get a clear picture of what I need to do. Do I just need an MTA like postfix? Do I configure it as a "satellite", or an "internet" site? Do I need to make any DNS changes? If I want to programmatically receive e-mail someday, are there any configuration options I should be careful about tinkering with? Also, if my VPS host **did** provide an SMTP server, what *wouldn't* I need to do, that I'm doing now?
Thank you! | 0 | [
2,
184,
107,
31,
309,
71,
51,
287,
12968,
2473,
13,
10924,
18,
20,
2660,
25193,
4216,
60,
800,
3726,
3726,
51,
13,
10924,
18,
11747,
13,
5,
18,
11909,
11694,
6,
1437,
22,
38,
1181,
40,
7613,
13726,
8128,
9,
31,
275,
8144,
4865,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Next step for System administrator?
===
I have been a system administrator for about 8 years. Have worked on various technologies including various linux/unix flavours as well as MS technologies.
I have also dabbled in perl and bash programming purely considering sysad jobs.
I am planning to switch to programming.
Is it advisable for a sysad to shift to programming.
If no, why? If yes, what path should I follow?
| 0 | [
2,
328,
1424,
26,
329,
8890,
60,
800,
3726,
3726,
31,
57,
74,
21,
329,
8890,
26,
88,
469,
122,
9,
57,
577,
27,
617,
5740,
215,
617,
13024,
118,
1020,
4028,
22408,
18,
28,
134,
28,
4235,
5740,
9,
31,
57,
67,
1331,
13784,
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... |
Is there a way to control the animation on a UITableView scrollToRowAtIndexPath?
===
I would like to modify the animation duration and attach a callback to be called when the animation finishes when calling scrollToRowAtIndexPath with animated:YES but I can't find a handle to its animation proxy or any other way to do it.
Anyone know if this is possible? | 0 | [
2,
25,
80,
21,
161,
20,
569,
14,
6236,
27,
21,
13,
11193,
579,
4725,
12159,
2153,
15289,
38,
25671,
8353,
60,
800,
3726,
3726,
31,
83,
101,
20,
17579,
14,
6236,
9403,
17,
19514,
21,
645,
1958,
20,
44,
227,
76,
14,
6236,
13625,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Export to excel from crystal reports without page headers/footers
===
Just wondering if anybody had working code example (in c#) for exporting a crystal report to excel from a .NET application without the report's page headers and footer's.
I am using crystal reports v9 runtime. | 0 | [
2,
7487,
20,
20700,
37,
4282,
2813,
366,
2478,
157,
445,
118,
3670,
445,
800,
3726,
3726,
114,
5712,
100,
11181,
41,
638,
1797,
823,
13,
5,
108,
272,
5910,
6,
26,
7487,
68,
21,
4282,
1330,
20,
20700,
37,
21,
13,
9,
2328,
3010,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Cross-platform editor control
===
I need a cross-platform editor control to use as GUI-part in an in-house tool. The control may be commercial, but with reasonable price.
Required features:
* Platforms: Win32, OS X, Linux
* UTF-8 support
* Fine-grained run-time control to the text style (or at least color)
* Nice low-level plain C API without usual horrible bloat
* Should not prevent me to have these features (even if I'll have to implement them myself):
* Undo / redo
* Copy / paste
* Context menu, depending on click position in text
* Toolbar, depending on cursor position in text
* Sidebar panel, depending on cursor position in text
Actually above requires not simple control, but whole cross-platform GUI library.
Discarded options:
* Scintilla and descendants (no OS X)
* FLTK (no
* Fox-toolkit
* gtksourceview
| 0 | [
2,
919,
8,
27035,
1835,
569,
800,
3726,
3726,
31,
376,
21,
919,
8,
27035,
1835,
569,
20,
275,
28,
9457,
8,
3091,
19,
40,
19,
8,
1682,
5607,
9,
14,
569,
123,
44,
1439,
15,
47,
29,
9954,
2162,
9,
1390,
967,
45,
1637,
6843,
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... |
ReSharper (or something like it) for Visual C++ ?
===
I've seen ReSharper recommended a lot Unfortunately, it doesn't support C++ in Visual Studio. Is there anything out there you can recommend? I already use Visual Assist, and it does its job very well, but it's quite limited in comparison with ReSharper.
Any suggestions? | 0 | [
2,
302,
23646,
106,
13,
5,
248,
301,
101,
32,
6,
26,
3458,
272,
20512,
13,
60,
800,
3726,
3726,
31,
22,
195,
541,
302,
23646,
106,
5773,
21,
865,
6200,
15,
32,
1437,
22,
38,
555,
272,
20512,
19,
3458,
1120,
9,
25,
80,
602,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the easiest/best/most correct way to iterate through the characters of a string in Java?
===
StringTokenizer? Convert the String to a char[] and iterate over that? Something else? | 0 | [
2,
98,
25,
14,
27237,
118,
4936,
118,
4630,
4456,
161,
20,
32,
106,
1373,
120,
14,
1766,
16,
21,
3724,
19,
8247,
60,
800,
3726,
3726,
3724,
262,
2853,
11907,
60,
8406,
14,
3724,
20,
21,
4892,
2558,
500,
17,
32,
106,
1373,
84,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Drop Down List with WPF Menu Controls
===
I am looking for a way to add a drop down list in WPF to a menu. This used to be really easy in winforms and so I am expecting you experts to know just now to do it in WPF. Thanks. | 0 | [
2,
2804,
125,
968,
29,
619,
7721,
11379,
8671,
800,
3726,
3726,
31,
589,
699,
26,
21,
161,
20,
3547,
21,
2804,
125,
968,
19,
619,
7721,
20,
21,
11379,
9,
48,
147,
20,
44,
510,
2010,
19,
628,
4190,
18,
17,
86,
31,
589,
7752,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0... |
How do I emulate Python's named printf parameters in Ruby?
===
In Python, you can do this:
print "Hi! I'm %(name)s, and I'm %(age)d years old." % ({"name":"Brian","age":30})
What's the closest, simplest Ruby idiom to replicate this behavior? (No monkeypatching the String class, please.) | 0 | [
2,
184,
107,
31,
23804,
20059,
22,
18,
377,
4793,
410,
12905,
19,
10811,
60,
800,
3726,
3726,
19,
20059,
15,
42,
92,
107,
48,
45,
4793,
13,
7,
1822,
187,
31,
22,
79,
13,
11881,
5,
7259,
6,
18,
15,
17,
31,
22,
79,
13,
11881,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Searching for a safe way to do authentication from a mobile app
===
I've inherited a mobile app which sends auth credentials (userid/password) in the clear.
I'd imagine that I have 2 choices:
a) use TLS.
b) write my own auth protocol.
If I choose (b) what are the key guidelines that I must follow to make it it secure.
e.g. how to avoid replay attacks, encryption strategies. Thanks | 0 | [
2,
5792,
26,
21,
1834,
161,
20,
107,
27963,
37,
21,
3241,
4865,
800,
3726,
3726,
31,
22,
195,
7179,
21,
3241,
4865,
56,
11350,
10343,
96,
5059,
43,
10107,
18,
13,
5,
3699,
5175,
118,
6201,
9587,
6,
19,
14,
1207,
9,
31,
22,
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... |
Subversion web interface with a specific feature
===
I'm looking for a **subversion web client** ala [SVN::Web][1] but with a very specific feature I've always thought would be quite useful.
What I want is the ability to find **which revision was responsible for a certain line** (or lines) in a text file. A way to do this via the web would be fantastic.
Anybody know of such a tool?
[1]: http://search.cpan.org/dist/SVN-Web/ | 0 | [
2,
972,
10898,
2741,
6573,
29,
21,
1903,
1580,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
13,
1409,
7563,
10898,
2741,
6819,
1409,
21,
531,
636,
18,
16578,
45,
45,
14113,
500,
2558,
165,
500,
47,
29,
21,
253,
1903,
1580,
31,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a better way to get a named series of constants (enumeration) in Python?
===
Just looking at ways of getting named constants in python.
class constant_list:
(A_CONSTANT, B_CONSTANT, C_CONSTANT) = range(3)
Then of course you can refer to it like so:
constant_list.A_CONSTANT
I suppose you could use a dictionary, using strings:
constant_dic = {
"A_CONSTANT" : 1,
"B_CONSTANT" : 2,
"C_CONSTANT" : 3,}
and refer to it like this:
constant_dic["A_CONSTANT"]
---
My question, then, is simple. Is there any better ways of doing this? Not saying that these are inadequate or anything, just curious - any other common idioms that I've missed?
Thanks in advance.
| 0 | [
2,
25,
80,
21,
574,
161,
20,
164,
21,
377,
231,
16,
3587,
18,
13,
5,
219,
9472,
5946,
6,
19,
20059,
60,
800,
3726,
3726,
114,
699,
35,
2847,
16,
1017,
377,
3587,
18,
19,
20059,
9,
718,
3587,
1,
5739,
45,
13,
5,
58,
1,
2963... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 page life cycle.
===
I am having an ASP.net page in my page i am having this as my code behind files.
on first access the page the page preinit, init, load methods are called. on postbacks
the preinit, init, load methods are called.
My question is LoadViewstate and control state events (Overridden methods) are not firing after postbacks also
protected override void OnPreInit(EventArgs e)
{
base.OnPreInit(e);
}
protected override void LoadViewState(object savedState)
{
base.LoadViewState(savedState);
}
protected override void LoadControlState(object savedState)
{
base.LoadControlState(savedState);
}
protected void Page_Init(object sender, EventArgs e)
{
}
protected void Page_Load(object sender, EventArgs e)
{
// lblName.Text = ViewState["Test"].ToString();
} | 0 | [
2,
28,
306,
9,
2328,
2478,
201,
4150,
9,
800,
3726,
3726,
31,
589,
452,
40,
28,
306,
9,
2328,
2478,
19,
51,
2478,
31,
589,
452,
48,
28,
51,
1797,
439,
6488,
9,
27,
64,
1381,
14,
2478,
14,
2478,
782,
108,
242,
15,
19,
242,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Running on 32 or 64 bit matlab?
===
How can I determine if I'm running on a 32bit or a 64bit version of matlab?
I have some pre-compiled mex-files which need different path's depending on 32/64bit matlab.
| 0 | [
2,
946,
27,
2512,
54,
4384,
1142,
4277,
9086,
60,
800,
3726,
3726,
184,
92,
31,
3746,
100,
31,
22,
79,
946,
27,
21,
2512,
3326,
54,
21,
4384,
3326,
615,
16,
4277,
9086,
60,
31,
57,
109,
782,
8,
11103,
49,
1294,
55,
396,
8,
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... |
Java2D Performance Issues
===
I'm having performance oddities with Java2D. I know of the sun.java2d.opengl VM parameter to enable 3D acceleration for 2D, but even using that has some weird issues.
Here are results of tests I ran:
Drawing a 25x18 map with 32x32 pixel tiles on a JComponent<br>
Image 1 = .bmp format, Image 2 = A .png format
Without -Dsun.java2d.opengl=true
--------------------------------
120 FPS using .BMP image 1<BR>
13 FPS using .PNG image 2
With -Dsun.java2d.opengl=true
-----------------------------
12 FPS using .BMP image 1<BR>
700 FPS using .PNG image 2
Without acceleration, I'm assuming some kind of transformation is taking place with every drawImage() I do in software, and is pulling down the FPS considerably in the case of .PNG. Why though, with acceleration, would the results switch (and PNG actually performs incredibly faster)?! Craziness!
.BMP Image 1 is translated to an image type of TYPE_INT_RGB. .PNG Image 2 is translated to an image type of TYPE_CUSTOM. In order to get consistent speed with and without opengl acceleration, I have to create a new BufferedImage with an image type of TYPE_INT_ARGB, and draw Image 1 or Image 2 to this new image.
Here are the results running with that:
Without -Dsun.java2d.opengl=true
--------------------------------
120 FPS using .BMP image 1<BR>
120 FPS using .PNG image 2
With -Dsun.java2d.opengl=true
-----------------------------
700 FPS using .BMP image 1<BR>
700 FPS using .PNG image 2
My real question is, can I assume that TYPE_INT_ARGB will be the native image type for all systems and platforms? I'm assuming this value could be different. Is there some way for me to get the native value so that I can always create new BufferedImages for maximum performance?
Thanks in advance...
| 0 | [
2,
8247,
135,
43,
956,
1549,
800,
3726,
3726,
31,
22,
79,
452,
956,
4210,
3808,
29,
8247,
135,
43,
9,
31,
143,
16,
14,
939,
9,
1004,
1385,
135,
43,
9,
10157,
8430,
13,
20147,
18906,
20,
9240,
203,
43,
17661,
26,
172,
43,
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... |
Locking Executing Files: Windows does, Linux doesn't. Why?
===
I noticed when a file is executed on Windows (.exe or .dll), it is locked and cannot be deleted, moved or modified.
Linux, on the other hand, does not lock executing files and you *can* delete, move, or modify them.
Why does Windows lock when Linux does not? Is there an advantage to locking? | 0 | [
2,
17538,
25836,
6488,
45,
1936,
630,
15,
13024,
1437,
22,
38,
9,
483,
60,
800,
3726,
3726,
31,
2711,
76,
21,
3893,
25,
5557,
27,
1936,
13,
5,
9,
1706,
62,
54,
13,
9,
43,
211,
6,
15,
32,
25,
4011,
17,
1967,
44,
19584,
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... |
Editing SQL query with Visual Studio 2008
===
Would you recommend me the best approach to edit SQL query with Visual Studio 2008 Professional, please?
I know I can open Query window from context menu in Server Explorer and edit text in SQL Pane. But unfortunately I am not allowed to save query to a file and Find and Replace commands are not working there.
Alternatively I can open text file with extension .SQL in Visual Studio editor obtaining syntax highlighting and full editing capabilities but losing possibility to execute the script.
Now I copy query text from one window to another and back but I hope there is better solution.
Many thanks for suggestions! | 0 | [
2,
9510,
4444,
255,
25597,
29,
3458,
1120,
570,
800,
3726,
3726,
83,
42,
12360,
55,
14,
246,
2141,
20,
9392,
4444,
255,
25597,
29,
3458,
1120,
570,
736,
15,
2247,
60,
31,
143,
31,
92,
368,
25597,
1463,
37,
4141,
11379,
19,
8128,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which wiki will let me dynamically create a page when its link is clicked?
===
For an application I'm developing I need a mixture of dynamically generated and static pages. It would be cool to use a wiki such that once a dynamic page has been accessed for the first time it becomes a static page that can be annotated by a user just like any other static wiki page.
In other words, I want to override whatever outputs the message "This topic does not exist yet" (or whatever) with something that a) generates the new content in wiki format and stores it in the database then b) parses and displays that text.
Oh and this should be recursive - the created page may have links to more dynamically generated pages and so on.
I will generate the dynamic page based on its name (including category/namespace info to some arbitrary depth).
One last thing - it would also be nice (but not essential) to do the creation of some of the dynamic pages upfront by a batch script (mainly for performance because these are pages it may take some time to generate).
So my question is which wiki software would be easiest to modify/write a plugin for to do this? | 0 | [
2,
56,
13,
17375,
129,
408,
55,
7782,
1326,
1600,
21,
2478,
76,
82,
3508,
25,
15802,
60,
800,
3726,
3726,
26,
40,
3010,
31,
22,
79,
3561,
31,
376,
21,
7181,
16,
7782,
1326,
6756,
17,
12038,
4434,
9,
32,
83,
44,
2700,
20,
275,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I change OutDir variable in Visual C++?
===
In the linker the binary destination is specified as:
$(OutDir)\$(ProjectName).exe
I've looked through every setting and I can't see where OutDir is defined. How do I change this? | 0 | [
2,
184,
107,
31,
753,
70,
9035,
7612,
19,
3458,
272,
20512,
60,
800,
3726,
3726,
19,
14,
3508,
106,
14,
14171,
6970,
25,
9931,
28,
45,
5579,
5,
1320,
9035,
6,
1,
4403,
5,
21011,
7259,
6,
9,
1706,
62,
31,
22,
195,
292,
120,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to ensure user submit only english text
===
I am building a project involving natural language processing, since the nlp module currently only deal with english text, so I have to make sure the user submitted content (not long, only several words) is in english. Are there established ways to achieve this? Python or Javascript way preferred. | 0 | [
2,
184,
20,
4062,
4155,
12298,
104,
486,
1854,
800,
3726,
3726,
31,
589,
353,
21,
669,
4838,
1112,
816,
5511,
15,
179,
14,
13,
103,
5478,
12613,
871,
104,
1183,
29,
486,
1854,
15,
86,
31,
57,
20,
233,
562,
14,
4155,
7368,
2331,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to trim() in javascript
===
The question says it all; JS doesn't seem to have a native trim() method. | 0 | [
2,
98,
25,
14,
246,
161,
20,
8971,
5,
6,
19,
8247,
8741,
800,
3726,
3726,
14,
1301,
898,
32,
65,
73,
487,
18,
1437,
22,
38,
2260,
20,
57,
21,
1275,
8971,
5,
6,
2109,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to check if OS is Vista in Python?
===
How, in the simplest possible way, distinguish between Windows XP and Windows Vista, using Python and [pywin32](http://python.net/crew/mhammond/win32/Downloads.html) or [wxPython](http://www.wxpython.org/)?
Essentially, I need a function that called will return True iff current OS is Vista:
>>> isWindowsVista()
True | 0 | [
2,
184,
20,
2631,
100,
13,
759,
25,
13520,
19,
20059,
60,
800,
3726,
3726,
184,
15,
19,
14,
24384,
938,
161,
15,
9705,
128,
1936,
23045,
17,
1936,
13520,
15,
568,
20059,
17,
636,
6448,
4181,
3125,
500,
5,
21127,
6903,
6448,
11570,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Reflection and generic types
===
I'm writing some code for a class constructor which loops through all the properties of the class and calls a generic static method which populates my class with data from an external API. So I've got this as an example class:
public class MyClass{
public string Property1 { get; set; }
public int Property2 { get; set; }
public bool Property3 { get; set; }
public static T DoStuff<T>(string name){
// get the data for the property from the external API
// or if there's a problem return 'default(T)'
}
}
Now in my constructor I want something like this:
public MyClass(){
var properties = this.GetType().GetProperties();
foreach(PropertyInfo p in properties){
p.SetValue(this, MyClass(p.Name), new object[0]);
}
}
So the above constructor will thrown an error because I'm not supplying the generic type.
So how do I pass in the type of the property in? | 0 | [
2,
9138,
17,
12733,
2551,
800,
3726,
3726,
31,
22,
79,
1174,
109,
1797,
26,
21,
718,
6960,
248,
56,
19661,
120,
65,
14,
3704,
16,
14,
718,
17,
3029,
21,
12733,
12038,
2109,
56,
1675,
12383,
18,
51,
718,
29,
1054,
37,
40,
4886,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does Android WebView need permissions for opening external URLs?
===
I was trying following example but with external URLs:
http://android-developers.blogspot.com/2008/09/using-webviews.html
The example shows how to load an HTML file from assets folder (file:// url) and display it in a webview.
But when I try it with external URLs (like http://google.com), I am always getting a "Website Not Available" error. Android's built-in browser is able to access all external URLs.
I suspect that it has something to do with permissions but wasn't able to confirm it.
| 0 | [
2,
630,
13005,
2741,
4725,
376,
5572,
18,
26,
1214,
4886,
13,
911,
7532,
60,
800,
3726,
3726,
31,
23,
749,
249,
823,
47,
29,
4886,
13,
911,
7532,
45,
7775,
6903,
290,
18524,
8,
26051,
445,
9,
7091,
5447,
4296,
9,
960,
118,
2753,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 run NOT elevated in Vista (.NET)
===
I have an application that I have to run as Administrator.
One small part of that application is to start other applications with Process.Start
The started applications will also be run as administrators, but I'd rather see them run as the 'normal' user.
How do I accomplish that?
/johan/ | 0 | [
2,
184,
20,
485,
52,
8052,
19,
13520,
13,
5,
9,
2328,
6,
800,
3726,
3726,
31,
57,
40,
3010,
30,
31,
57,
20,
485,
28,
8890,
9,
53,
284,
141,
16,
30,
3010,
25,
20,
799,
89,
3767,
29,
953,
9,
13680,
14,
373,
3767,
129,
67,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can you list the keyword arguments a Python function receives?
===
I have a dict, which I need to pass key/values as keyword arguments.. For example..
d_args = {'kw1': 'value1', 'kw2': 'value2'}
example(**d_args)
This works fine, *but* if there are values in the d_args dict that are not accepted by the `example` function, it obviously dies.. Say, if the example function is defined as `def example(kw2):`
This is a problem since I don't control either the generation of the `d_args`, or the `example` function.. They both come from external modules, and `example` only accepts some of the keyword-arguments from the dict..
Ideally I would just do
parsed = feedparser.parse(the_url); PyRSS2Gen.RSS2(parsed, [magic to make it ignore invalid keyword arguments])
I will probably just filter the dict, from a list of valid keyword-arguments, but I was wondering: **Is there a way to programatically list the keyword arguments the a specific function takes?** | 0 | [
2,
92,
42,
968,
14,
1246,
9587,
10553,
21,
20059,
1990,
8359,
60,
800,
3726,
3726,
31,
57,
21,
13,
16315,
15,
56,
31,
376,
20,
1477,
1246,
118,
15165,
18,
28,
1246,
9587,
10553,
9,
9,
26,
823,
9,
9,
13,
43,
1,
10663,
18,
800... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where does jQuery UI fit in MVC?
===
I need to develop a generic jQuery-based search plugin for the ASP.NET MVC application I'm building, but I can't figure out how it's supposed to fit, or what the best practice is. I want to do the following:
$().ready(function() {
$('#searchHolder').customSearch('MyApp.Models.User');
});
As long as I have implemented a specific interface on Models.User, jQuery will be able to talk to a reflection service to generically construct the relevant UI.
Sounds fun, but it seems that I'm now calling the JavaScript from the View, which is in turn going to do some View-related activity to build the search UI, and then to do the search and interact with the user it's going to throw a bunch of Controller tasks in there.
So where does this really fit? Is there a different way I can structure my jQuery plugin so that it conforms more to the idea of MVC? Does MVC work when it scales down to its own form _within_ another MVC structure? Should I just ignore these issues for the sake of one plugin? | 0 | [
2,
113,
630,
487,
8190,
93,
13,
5661,
2742,
19,
307,
8990,
60,
800,
3726,
3726,
31,
376,
20,
2803,
21,
12733,
487,
8190,
93,
8,
1281,
2122,
10922,
108,
26,
14,
28,
306,
9,
2328,
307,
8990,
3010,
31,
22,
79,
353,
15,
47,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Convert string to proper case with javascript
===
Is there a simple way to convert a string to proper case? E.g. `john smith` becomes `John Smith`. I'm not looking for something complicated like [John Resig's solution][1], just (hopefully) some kind of one- or two-liner.
[1]: http://ejohn.org/blog/title-capitalization-in-javascript/ | 0 | [
2,
8406,
3724,
20,
4119,
610,
29,
8247,
8741,
800,
3726,
3726,
25,
80,
21,
1935,
161,
20,
8406,
21,
3724,
20,
4119,
610,
60,
13,
62,
9,
263,
9,
13,
1,
7373,
1167,
1,
2633,
13,
1,
7373,
1167,
1,
9,
31,
22,
79,
52,
699,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can anyone recommend a Java rich text editor?
===
The rich text editor must be implemented in Java, provide Swing support, and preferably be open source.
Thanks. | 4 | [
2,
92,
1276,
12360,
21,
8247,
2042,
1854,
1835,
60,
800,
3726,
3726,
14,
2042,
1854,
1835,
491,
44,
6807,
19,
8247,
15,
1181,
5587,
555,
15,
17,
6369,
4801,
44,
368,
1267,
9,
3669,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
wordpress - having comments inline ajax like in stackoverflow
===
i have a wordpress blog and want to give people the same user experience for adding comments that is in stackoverflow. There are a number of comments ajax plugins out there but i can't find a working one that allows you to inline on the main page, go in and add comments without first drilling down into a seperate single post page.
Can anyone help here with either a wordpress plugin or php code to do this. | 0 | [
2,
833,
5890,
13,
8,
452,
7534,
19,
1143,
20624,
101,
19,
7566,
2549,
9990,
800,
3726,
3726,
31,
57,
21,
833,
5890,
8146,
17,
259,
20,
590,
148,
14,
205,
4155,
1496,
26,
4721,
7534,
30,
25,
19,
7566,
2549,
9990,
9,
80,
50,
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... |
Is there a good wrapper around ILGenerator ?
===
I'm using System.Reflection.Emit for a while now, and find it (who don't?) as painful as bug prone.
Do you know if there is a good wrapper around the IL Generator, something that I can rely on to emit IL in a more safe and easier manner than with playing directly with SRE?
| 0 | [
2,
25,
80,
21,
254,
28051,
140,
6317,
17083,
3457,
13,
60,
800,
3726,
3726,
31,
22,
79,
568,
329,
9,
27977,
872,
9,
7411,
38,
26,
21,
133,
130,
15,
17,
477,
32,
13,
5,
1924,
221,
22,
38,
60,
6,
28,
9383,
28,
6256,
15957,
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 is the easiest way to learn ActionScript when you know JavaScript?
===
I am an Ajax developer and I want to build a Flash application. Given my previous experience with JavaScript, what do you thing will be the easiest way to learn ActionScript and what are the obstacles I might encounter? | 0 | [
2,
98,
25,
14,
27237,
161,
20,
2484,
1028,
8741,
76,
42,
143,
8247,
8741,
60,
800,
3726,
3726,
31,
589,
40,
20624,
10058,
17,
31,
259,
20,
1895,
21,
4433,
3010,
9,
504,
51,
1158,
1496,
29,
8247,
8741,
15,
98,
107,
42,
584,
129... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 out whether subversion working directory is locked by svn?
===
A python script is running two parallel python processes ( created via os.fork() ) each of which eventually tries to check out a subversion repository leaf into the same working copy dir.
Before running 'svn co ...' command in a sub-process ( via python subprocess module ) the parent python code checks if the working copy dir already exists.
if os.path.isdir(checkout_dir):
# working copy dir already exists
return checkout_dir
So that if it does there shouldn't be any 'svn co' running, but rather immediate return from the parent function.
Nevertheless some collision happened and one of the python processes failed on 'svn co ..' with the following error.
checked-out failed: svn: Working copy '/tmp/qm_23683' locked
svn: run 'svn cleanup' to remove locks (type 'svn help cleanup' for details)
So the first question is why the working copy dir existence check didn't work and the second - is there a way to find out that a working copy dir is locked by svn and loop until it is unlocked?
Thanks. | 0 | [
2,
184,
20,
477,
70,
1472,
972,
10898,
638,
16755,
25,
4011,
34,
13,
18,
16578,
60,
800,
3726,
3726,
21,
20059,
3884,
25,
946,
81,
3821,
20059,
5102,
13,
5,
679,
1197,
13,
759,
9,
1106,
197,
5,
6,
13,
6,
206,
16,
56,
878,
39... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I declare a combo box in a view to set a value to a model in ASP.NET MVC?
===
I would like to declare a combo box in a view in an ASP.NET MVC application, for letting the user select a lookup value. I know how to declare plain text boxes but is there an official helper for declaring combo boxes (date time pickers and the rest)?.
I also don't know what structure I should pass to my view for giving the values to the combo box, because I assume I need both an id and a description.
Finally, how do I pass the selected id from the combo box back to my action in the controller? | 0 | [
2,
184,
92,
31,
10123,
21,
22621,
1649,
19,
21,
1418,
20,
309,
21,
1923,
20,
21,
1061,
19,
28,
306,
9,
2328,
307,
8990,
60,
800,
3726,
3726,
31,
83,
101,
20,
10123,
21,
22621,
1649,
19,
21,
1418,
19,
40,
28,
306,
9,
2328,
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... |
<?php system('php file.php'); ?> doesn't work, why?
===
neither
<?php system('/usr/bin/php file.php'); ?>
I tried with -q, with !#/usr/bin/php etc... anyone can help? | 0 | [
2,
13,
1,
60,
26120,
329,
5,
22,
26120,
3893,
9,
26120,
22,
6,
73,
13,
60,
1,
1437,
22,
38,
170,
15,
483,
60,
800,
3726,
3726,
3028,
13,
1,
60,
26120,
329,
5,
22,
118,
267,
139,
118,
4772,
118,
26120,
3893,
9,
26120,
22,
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... |
where is the Oracle Event Log located?
===
A fairly simple question here. Where is the location of my oracle event log (on a default Linux installation)?
Many thanks in advance.
| 0 | [
2,
113,
25,
14,
15759,
807,
6738,
335,
60,
800,
3726,
3726,
21,
6647,
1935,
1301,
235,
9,
113,
25,
14,
1474,
16,
51,
15759,
807,
6738,
13,
5,
218,
21,
12838,
13024,
7758,
6,
60,
151,
3669,
19,
3612,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What's the best anti-spam scheme
===
How can I combine the followings to fight spam and at the same time minimize annoyance imposed to the user?
1. In registration page, sending an email to verify the email address
2. In registration page, use CAPTCHA
3. In every post page, use CAPTCHA
Feel free to add new item to the list, and please tell your suggested scheme in boolean expression, eg: (1 and 3) or 2
| 0 | [
2,
98,
22,
18,
14,
246,
1082,
8,
3401,
765,
4276,
800,
3726,
3726,
184,
92,
31,
12287,
14,
249,
18,
20,
1074,
6954,
79,
17,
35,
14,
205,
85,
16713,
20106,
10787,
20,
14,
4155,
60,
137,
9,
19,
8587,
2478,
15,
4907,
40,
8517,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Definition of software quality?
===
There are quite a few questions on measuring and proving software quality here, however there is no formal definition of software quality itself:
**Please give formal, all encompassing definition of software product quality.**
<sub>Since the question is fairly generic I am happy to keep accepting a better definition each time it is submitted.</sub> | 0 | [
2,
5465,
16,
2306,
2190,
60,
800,
3726,
3726,
80,
50,
1450,
21,
310,
2346,
27,
9937,
17,
15333,
2306,
2190,
235,
15,
207,
80,
25,
90,
3337,
5465,
16,
2306,
2190,
1145,
45,
13,
1409,
6744,
590,
3337,
15,
65,
13,
22022,
5465,
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... |
Setting default values for columns in JPA
===
Is it possible to set a default value for columns in JPA, and if, how is it done using annotations? | 0 | [
2,
2697,
12838,
4070,
26,
7498,
19,
487,
1060,
800,
3726,
3726,
25,
32,
938,
20,
309,
21,
12838,
1923,
26,
7498,
19,
487,
1060,
15,
17,
100,
15,
184,
25,
32,
677,
568,
40,
1270,
7504,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 is the difference between <% %> and <%=%>?
===
What is the difference between <% %> and <%= %> in ASP.NET MVC? And when to use which? | 0 | [
2,
98,
25,
14,
2841,
128,
13,
1,
11881,
13,
11881,
1,
17,
13,
1,
11881,
3726,
11881,
1,
60,
800,
3726,
3726,
98,
25,
14,
2841,
128,
13,
1,
11881,
13,
11881,
1,
17,
13,
1,
11881,
3726,
13,
11881,
1,
19,
28,
306,
9,
2328,
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,
0,
0,
0,
0,
0,
0,
0... |
Idiomatic use of std::auto_ptr or only use shared_ptr?
===
Now that shared_ptr is in tr1, what do you think should happen to the use of std::auto_ptr? They both have different use cases, but all use cases of auto_ptr can be solved with shared_ptr, too. Will you abandon auto_ptr or continue to use it in cases where you want to express explicitly that only one class has ownership at any given point? My take is that using auto_ptr can add clarity to code, precisely by adding nuance and an indication of the design of the code, but on the other hand, it add yet another subtle issue when training new programmers: they need to understand smart pointers and the fine details of how they work. When you use only one smart pointer everywhere, you can just lay down a rule 'wrap all pointers in shared_ptr' and be done with it.
What's your take on this? | 0 | [
2,
28380,
12479,
275,
16,
354,
43,
45,
45,
18042,
1,
4417,
139,
54,
104,
275,
2592,
1,
4417,
139,
60,
800,
3726,
3726,
130,
30,
2592,
1,
4417,
139,
25,
19,
9235,
165,
15,
98,
107,
42,
277,
378,
2384,
20,
14,
275,
16,
354,
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... |
javac.exe AST programmatic access example
===
Is it possible to access the Abstract Syntax Tree(AST) inside the javac.exe programmatically? Could you provide an example? | 0 | [
2,
8247,
150,
9,
1706,
62,
28,
38,
625,
6732,
1381,
823,
800,
3726,
3726,
25,
32,
938,
20,
1381,
14,
8502,
22649,
1541,
5,
472,
38,
6,
572,
14,
8247,
150,
9,
1706,
62,
625,
6732,
1326,
60,
110,
42,
1181,
40,
823,
60,
3,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Convert dictionary values into array
===
what is the most efficient way of turning the list of values of a dictionary into an array
for example, if i have:
Dictionary where key is string and value is Foo
i want to get Foo[]
I am using VS 2005, C# 2.0 | 0 | [
2,
8406,
9186,
4070,
77,
7718,
800,
3726,
3726,
98,
25,
14,
127,
8243,
161,
16,
2101,
14,
968,
16,
4070,
16,
21,
9186,
77,
40,
7718,
26,
823,
15,
100,
31,
57,
45,
9186,
113,
1246,
25,
3724,
17,
1923,
25,
4310,
111,
31,
259,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Flatten Ruby method in C#
===
How can I do the Ruby method ["Flatten" Ruby Method][1] in C#. This method flattens a multi-dimensional array into a single-dimensional array.
For example:
s = [ 1, 2, 3 ] #=> [1, 2, 3]
t = [ 4, 5, 6, [7, 8] ] #=> [4, 5, 6, [7, 8]]
a = [ s, t, 9, 10 ] #=> [[1, 2, 3], [4, 5, 6, [7, 8]], 9, 10]
a.flatten #=> [1, 2, 3, 4, 5, 6, 7, 8, 9, 10
[1]: http://www.ruby-doc.org/core/classes/Array.html#M002241 | 0 | [
2,
1844,
1316,
10811,
2109,
19,
272,
5910,
800,
3726,
3726,
184,
92,
31,
107,
14,
10811,
2109,
636,
7,
13830,
1316,
7,
10811,
2109,
500,
2558,
165,
500,
19,
272,
5910,
9,
48,
2109,
1844,
8710,
21,
1889,
8,
7865,
7718,
77,
21,
34... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Whats the difference between Keyboard.Focus(item) and item.Focus()?
===
In WPF, there are two ways to set the focus to an element.
You can either call the .Focus() method of the input element, or call Keyboard.Focus() with the input element as parameter.
// first way:
item.Focus();
// alternate way:
Keyboard.Focus(item);
What is the difference between these two? Are there special reasons to use one of them instead of the other in some cases?
| 0 | [
2,
98,
18,
14,
2841,
128,
8896,
9,
23371,
5,
2119,
79,
6,
17,
9101,
9,
23371,
5,
6,
60,
800,
3726,
3726,
19,
619,
7721,
15,
80,
50,
81,
2847,
20,
309,
14,
1776,
20,
40,
4520,
9,
42,
92,
694,
645,
14,
13,
9,
23371,
5,
6,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Oracle 10g - UTL_MAIL package
===
I'm having a bit of trouble with the UTL_MAIL package in Oracle 10g, and was wondering if anyone had any solutions?
I connect to my DB as SYSMAN and load the following two scripts;
**@C:\oracle\product\10.2.0\db_1\rdbms\admin\utlmail.sql**
**@C:\oracle\product\10.2.0\db_1\rdbms\admin\prvtmail.plb**
I set up the SMTP server;
**ALTER SYSTEM SET smtp_out_server='mymailserver.fake:25' SCOPE=BOTH;**
I grant the user the required permission;
**GRANT execute ON utl_mail TO MYUSER;**
But then if I connect to the "MYTABLESPACE" (where MYUSER exists), I get the following error if I make reference to UTL_MAIL.SEND;
**PLS-00201: identifier 'UTL_MAIL.SEND' must be declared**
If I prefix it with SYSMAN though (SYSMAN.UTL_MAIL.SEND), it works, but I don't want to do this as this procedure that contains this call has no knowledge of the tablespace which installed the scripts.
Is there a way to install these scripts so that they are accessible universally, and do not require the SYSMAN prefix to execute?
Cheers,
Chris
| 0 | [
2,
15759,
332,
263,
13,
8,
287,
7786,
1,
8079,
6030,
800,
3726,
3726,
31,
22,
79,
452,
21,
1142,
16,
2572,
29,
14,
287,
7786,
1,
8079,
6030,
19,
15759,
332,
263,
15,
17,
23,
5712,
100,
1276,
41,
186,
6776,
60,
31,
6379,
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... |
Select specific rows with MSSQL XML column type
===
I'm trying to select data from a table defined similar to the following :
Column | Data Type
-------------------------
Id | Int
DataType | Int
LoggedData | XML
but I only want to select those rows with a specific DataType value, and that contain a string (or evaluates a piece of XPath) in the LoggedData column.
A quick Google search turned up nothing useful, and I am in a bit of a rush to get an answer... I'll carry on searching, but if anyone can help me out on this in the mean time, I'd really appreciate it.
Thanks | 0 | [
2,
5407,
1903,
11295,
29,
4235,
18,
22402,
23504,
4698,
1001,
800,
3726,
3726,
31,
22,
79,
749,
20,
5407,
1054,
37,
21,
859,
2811,
835,
20,
14,
249,
13,
45,
4698,
13,
1,
1054,
1001,
13,
8,
8,
8,
8,
8,
8,
8,
8,
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... |
Fastest "Get Duplicates" SQL script
===
What is an example of a fast SQL to get duplicates in datasets with hundreds of thousands of records. I typically use something like:
select afield1, afield2 from afile a where 1 < (select count(afield1) from afile b where a.afield1 = b.afield1);
But this is quite slow. | 0 | [
2,
7518,
13,
7,
3060,
19429,
18,
7,
4444,
255,
3884,
800,
3726,
3726,
98,
25,
40,
823,
16,
21,
1512,
4444,
255,
20,
164,
19429,
18,
19,
1054,
3554,
18,
29,
4541,
16,
3805,
16,
742,
9,
31,
2442,
275,
301,
101,
45,
5407,
21,
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 Static variable not working as expected
===
This [example][1] is from php.net:
<?php
function Test()
{
static $a = 0;
echo $a;
$a++;
}
?>
And this is my code:
function getNextQuestionID()
{
static $idx = 0;
return $idx++;
}
And I use it in JavaScript:
'quizID=' + "<?php echo getNextQuestionID(); ?>"
Returns 1 everytime. Why?
[1]: http://my.php.net/static | 0 | [
2,
13,
26120,
12038,
7612,
52,
638,
28,
1727,
800,
3726,
3726,
48,
636,
29041,
500,
2558,
165,
500,
25,
37,
13,
26120,
9,
2328,
45,
13,
1,
60,
26120,
1990,
1289,
5,
6,
13,
1,
12038,
5579,
58,
800,
713,
73,
8117,
5579,
58,
73,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 write a for loop that iterates over a CAtlMap selectively deleting elements as it goes?
===
I'm trying to do the following without too much special case code to deal with invalidated POSITIONs etc:
What's the best way to fill in the blanks?
void DeleteUnreferencedRecords(CAtlMap<Record>& records)
{
for(____;____;____)
{
if( NotReferencedElsewhere(record) )
{
// Delete record
_______;
}
}
} | 0 | [
2,
184,
107,
31,
2757,
21,
26,
5293,
30,
32,
106,
7759,
84,
21,
2008,
255,
15022,
14092,
102,
121,
1336,
68,
2065,
28,
32,
1852,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
107,
14,
249,
366,
266,
212,
621,
610,
1797,
20,
1183,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 develop a WPF grid control which supports databinding?
===
I am fairly new to WPF. I want to develop a grid control which supports databinding.
There is a lot of information available about databinding to existing controls, but I cannot find any information how to develop a control from scratch which supports databinding.
I do not expect a simple answer to this question, a link to get me started would be nice. | 0 | [
2,
184,
20,
2803,
21,
619,
7721,
7354,
569,
56,
6747,
1054,
22260,
60,
800,
3726,
3726,
31,
589,
6647,
78,
20,
619,
7721,
9,
31,
259,
20,
2803,
21,
7354,
569,
56,
6747,
1054,
22260,
9,
80,
25,
21,
865,
16,
676,
904,
88,
1054,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Renaming accessor/mutator methods in Eclipse?
===
Is there any way to automatically rename accessor/mutator when a variable they get/set gets refactored -> renamed (Eclipse 3.4)? | 0 | [
2,
25934,
1381,
248,
118,
7903,
3457,
3195,
19,
11652,
60,
800,
3726,
3726,
25,
80,
186,
161,
20,
7499,
302,
7259,
1381,
248,
118,
7903,
3457,
76,
21,
7612,
59,
164,
118,
3554,
3049,
302,
17455,
69,
13,
8,
1,
2433,
13,
5,
3319,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Data Cut off when exporting to excel in SQL Reporting Services 2005.
===
I am having huge lines data which could accomdate in Textbox.
While I am exporting to excel the wrapping up of data occurs and the data
is being cut off.
When i manually change the textbox height i can see the full data but i need the full data to be
displayed in the first time itself.
| 0 | [
2,
1054,
1077,
168,
76,
7487,
68,
20,
20700,
19,
4444,
255,
6670,
687,
812,
9,
800,
3726,
3726,
31,
589,
452,
2329,
1560,
1054,
56,
110,
21,
150,
960,
8209,
19,
1854,
5309,
9,
133,
31,
589,
7487,
68,
20,
20700,
14,
13437,
71,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Bug Tracker in .NET
===
Is there any good bug tracker based on .NET which is free? | 0 | [
2,
551,
6256,
792,
106,
19,
13,
9,
2328,
800,
3726,
3726,
25,
80,
186,
254,
6256,
792,
106,
432,
27,
13,
9,
2328,
56,
25,
551,
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... | [
1,
1,
1,
1,
1,
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... |
How to prevent exception message to be translated to users language
===
How do I make my application always use English when displaying win32/.net exceptions messages?
I got this message, it looks like someone used babelfish to translate it (it's Swedish):
"System.ComponentModel.Win32Exception: Programmet kunde inte starta eftersom programmets sida-vid-sidakonfiguration är felaktig."
Extremely unhelpful, and Google had a whopping 4 hits for it, none of them helpful.
So I have to guess what the original message was and google that. (It's was: "The application has failed to start because its side-by-side configuration is incorrect.")
This time it was fairly simple to find out what the original error message was, having the message in English from the start would of course save me time.
So how do I do that? | 0 | [
2,
184,
20,
2501,
5391,
2802,
20,
44,
4331,
20,
3878,
816,
800,
3726,
3726,
184,
107,
31,
233,
51,
3010,
550,
275,
486,
76,
17418,
628,
3125,
118,
9,
2328,
13392,
7561,
60,
31,
330,
48,
2802,
15,
32,
1879,
101,
737,
147,
11337,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Getting notifications when the user tries sending an SMS
===
My application is implemented as a service (running under services.exe).
I am adding a new feature which requires being notified when the user sends an SMS.
I have tried using `IMAPIAdviseSink`, registering with both `IMAPISession` and `IMsgStore`, but I do not get any notifications.
The other options I can see are to create a Short Message Service Provider or to implement the `IFormProviderEx` interface, but I am not sure about the impact this might have on SMS functionality and the user experience.
Is there any way in which my application can reliably get notifications of SMSs being created in the Outbox?
Mark | 0 | [
2,
1017,
52,
4634,
18,
76,
14,
4155,
3919,
4907,
40,
7613,
18,
800,
3726,
3726,
51,
3010,
25,
6807,
28,
21,
365,
13,
5,
11325,
131,
687,
9,
1706,
62,
6,
9,
31,
589,
4721,
21,
78,
1580,
56,
4781,
142,
22904,
76,
14,
4155,
113... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best implementation of STL for VS2005?
===
I'm currently using default implementation of STL for VS2005 and I'm <a href="http://stackoverflow.com/questions/186494/ifstr1str2-versus-ifstr1lengthstr2length-str1str2">not really satisfied</a> with it. Perhaps there is something better?
| 0 | [
2,
98,
25,
14,
246,
6123,
16,
354,
255,
26,
4611,
2835,
60,
800,
3726,
3726,
31,
22,
79,
871,
568,
12838,
6123,
16,
354,
255,
26,
4611,
2835,
17,
31,
22,
79,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
25325,
2549,
9990,
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... |
Exception when not finding
===
What is the rationale behind throwing an exeption in JPA, when something can't be found?
Normally I would not expect it to be an exception that something could not be found. Actually this might me the default situation in some cases, and at leats the expected cases in most other sotuations. It makes me remeber an old saying that you should not use exceptions as part of your business logic, but only as what it is, special cases you don't know how or don't want to deal with.
Does anyone have an idea why it is implemented this way in JPA? What is the drawback on returning null when something could not be found? | 0 | [
2,
5391,
76,
52,
3007,
800,
3726,
3726,
98,
25,
14,
7511,
62,
439,
6033,
40,
1396,
3492,
3309,
19,
487,
1060,
15,
76,
301,
92,
22,
38,
44,
216,
60,
4147,
31,
83,
52,
4186,
32,
20,
44,
40,
5391,
30,
301,
110,
52,
44,
216,
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.