unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Namespace scope in SOAP / XML
===
Is this valid SOAP / XML?
<?xml version="1.0" encoding="utf-8"?>
<soap:Envelope xmlns:soap="http://schemas.xmlsoap.org/soap/envelope/"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xmlns:xsd="http://www.w3.org/2001/XMLSchema">
<soap:Body>
<CreateRoute xmlns="urn:Routs">
<aRoute>
<name>ToTheTop</name>
<grade xsi:type="FrencGrade">
<gradeNumber>7</gradeNumber>
<gradeModifier>a</gradeModifier>
</grade>
</aRoute>
</CreateRoute>
</soap:Body>
</soap:Envelope>
And if it is: in what namespace does FrenchGrade belong? Is it in the urn:Routs namespace? | 0 | [
2,
204,
5582,
9914,
19,
6447,
13,
118,
23504,
800,
3726,
3726,
25,
48,
7394,
6447,
13,
118,
23504,
60,
13,
1,
60,
396,
8184,
615,
3726,
7,
165,
9,
387,
7,
19608,
3726,
7,
1982,
410,
8,
457,
7,
60,
1,
13,
1,
656,
2552,
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... |
User or account or person or what?
===
Here on Stack Overflow, you're a "user." On [43things.com][1] you're a "person." On other sites, you're an "account." And then some web apps skip the usage of this kind of signifier, and it's just http://webapp.com/yourusername
Do you think that these signifiers imply anything at all? Do you prefer one over the other?
In building an application, I often come to this step in the process and stumble on whether to call users of the application a "user" or a "person" or an "account." I'm sure there are other examples, but these are the ones I come across most often. I'm curious what others think when coming to building the user management functions of their applications. I think most default to using "user," but do you put any thought into why?
[1]: http://43things.com/ | 0 | [
2,
4155,
54,
2176,
54,
840,
54,
98,
60,
800,
3726,
3726,
235,
27,
7566,
20285,
15,
42,
22,
99,
21,
13,
7,
16704,
9,
7,
27,
636,
4644,
22309,
9,
960,
500,
2558,
165,
500,
42,
22,
99,
21,
13,
7,
7276,
9,
7,
27,
89,
3259,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to programmatically run an Xpand workflow on a model in a second workbench?
===
I have an Xtext/Xpand (oAW 4.3, Eclipse 3.4) generator plug-in, which I run together with the editor plug-in in a second workbench. There, I'd like to run Xpand workflows programmatically on the model file I create. If I set the model file using the absolute path of the IFile I have, e.g. with:
String dslFile = file.getLocation().makeAbsolute().toOSString();
Or if I use a file URI retrieved with:
String dslFile = file.getLocationURI().toString();
The file is not found:
org.eclipse.emf.ecore.resource.Resource$IOWrappedException: Resource '/absolute/path/to/my/existing/dsl.file' does not exist.
at org.openarchitectureware.xtext.parser.impl.AbstractParserComponent.invokeInternal(AbstractParserComponent.java:55)
To what value should I set the model file attribute (dslFile) in the map I hand to the WorkflowRunner:
Map properties = new HashMap();
properties.put("modelFile", dslFile);
I also tried leaving the properties empty and referencing the model file relative to the workflow file (inside the workflow file), but that yields a FileNotFoundException. Running all of this in a normal app (not in a second workbench) works fine. | 0 | [
2,
184,
20,
625,
6732,
1326,
485,
40,
23045,
290,
170,
9990,
27,
21,
1061,
19,
21,
153,
170,
26359,
60,
800,
3726,
3726,
31,
57,
40,
993,
11969,
118,
396,
3206,
43,
13,
5,
111,
3885,
268,
9,
240,
15,
11652,
203,
9,
300,
6,
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... |
Classloader issues - How to determine which library versions (jar-files) are loaded
===
I've just solved another *I-though-I-was-using-this-version-of-a-library-but-apparently-my-app-server-has-already-loaded-an-older-version-of-this-library-*issue (sigh).
Does anybody know a good way to verify (or monitor) whether your application has access to all the appropriate jar-files, or loaded class-versions?
Thanks in advance!
[P.S. A very good reason to start using the [OSGi module architecture][1] in my view!]
[1]: http://en.wikipedia.org/wiki/OSGi#Architecture | 0 | [
2,
718,
8294,
106,
1549,
13,
8,
184,
20,
3746,
56,
1248,
3281,
13,
5,
6300,
8,
16877,
18,
6,
50,
8572,
800,
3726,
3726,
31,
22,
195,
114,
15091,
226,
1637,
49,
8,
9371,
8,
49,
8,
4149,
8,
12655,
8,
1565,
8,
10898,
8,
1041,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I upgrade from Drupal 5 to 6?
===
I'm running Drupal 5 on my website and want to upgrade to V6. I've not got any obscure or unsupported modules running.
What do I do though? I can't seem to find any step-by-step upgrade methods.
Do I just have to overwrite all the files and then re-run the installer again? | 0 | [
2,
184,
107,
31,
9483,
37,
15708,
6720,
331,
20,
400,
60,
800,
3726,
3726,
31,
22,
79,
946,
15708,
6720,
331,
27,
51,
2271,
17,
259,
20,
9483,
20,
566,
379,
9,
31,
22,
195,
52,
330,
186,
15472,
54,
367,
24909,
17113,
946,
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... |
Whats the best way to create interactive application prototypes?
===
The question should be interpreted from a general point of view and not targeted solely at web apps or desktop apps.
I have been looking around to find a simple and easy way of creating interactive prototypes for web applications. I'd like to use a technique that allows simple UI creation and especially UI recreation and modification in further iterations. Filling the UI with mockup data should be very simple. The technique may require a simple form of programming, e.g. to specify a drag and drop behaviour from UI element A to UI element B.
One tool i currently use is the Adobe Flex Builder. The included GUI-designer is very good and i have accomplished some skills with AS3 so far. The problem is adding data to the UI. It always results in me programming code for checking and parsing of XML-trees structures, and mainly debugging this section of the prototype. Too cumbersome!
Another tool many people use is PowerPoint which involves a really cumbersome way of creating a GUI by drawing every part of an interaction in a separate slide. No way! I would be much faster with paper prototypes. Other (better!) free form drawing tools are also part of this category (i'm a happy heavy weight inkscape user) but Prototyping and Mockup are obviously not their main purpose. The UI-stencil palette for Viso makes it a bit better than the drawing competition.
The main competitors in rapid prototyping as far i know are:
- iRise
- Axure
- Serena and other ?
- Viso
- Powerpoint, Illustrator, Inkscape or any other free form drawing tool
- paper prototyping
- IDE with good GUI builders (such as Flex Builder Designer and Netbeans Matisse)
My opinion is that real GUI-builders are a good staring point. What are your current approaches? Please outline your process and the pros and cons as an answer here. | 0 | [
2,
98,
18,
14,
246,
161,
20,
1600,
9194,
3010,
7063,
18,
60,
800,
3726,
3726,
14,
1301,
378,
44,
10394,
37,
21,
297,
454,
16,
1418,
17,
52,
9536,
9748,
35,
2741,
4865,
18,
54,
17404,
4865,
18,
9,
31,
57,
74,
699,
140,
20,
47... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Creating an online catalogue using Drupal, what are the best modules/techniques?
===
I have a large collection of retro games consoles and computers, I want to create some sort of catalogue to keep track of them using Drupal. I could do it as a series of pages in Drupal, but would rather have some sort of more structured method.
It'd be great if I could somehow define a record consisting of certain fields (manufacturer, model, serial number, etc) and have a form to fill in, and then have the display part automatically taken care of.
From looking at various Drupal modules I get the feeling I can do this, but I can't work out what modules to use. I got somewhat lost looking at the CCK module. | 0 | [
2,
2936,
40,
2087,
9179,
568,
15708,
6720,
15,
98,
50,
14,
246,
17113,
118,
6524,
889,
13655,
60,
800,
3726,
3726,
31,
57,
21,
370,
1206,
16,
13534,
466,
8650,
18,
17,
7774,
15,
31,
259,
20,
1600,
109,
2058,
16,
9179,
20,
643,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 programmatically change ASP.NET ajax AccordionPane with javascript?
===
I've got an asp.net ajax style AccordionPane control that I am trying to get/set based on some user interactions. However it seems not let me do this with javascript:
function navPanelMove() {
var aPane = $get('ctl00_Accordion1_AccordionExtender_ClientState');
openPaneID = aPane.get_SelectedIndex(); // doesn't work
}
| 0 | [
2,
184,
107,
31,
625,
6732,
1326,
753,
28,
306,
9,
2328,
20624,
20753,
16660,
29,
8247,
8741,
60,
800,
3726,
3726,
31,
22,
195,
330,
40,
28,
306,
9,
2328,
20624,
1034,
20753,
16660,
569,
30,
31,
589,
749,
20,
164,
118,
3554,
432... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Balanced Distribution Algorithm
===
I'm working on some code for a loosely coupled cluster. To achieve optimal performance during jobs, I have the cluster remap its data each time a child enters or exits. This will eventually be made optional, but for now it performs its data balancing by default. My balancing is basically just making sure that each child never has more than the average number of files per machine, plus one. The plus one is for the remainder if the division isn't clean. And since the remainder will _always_ be less than the number of children [except 0 case, but we can exclude that], children after a balancing will have at most avg + 1.
Everything seems fine, until I realized my algorithm is O(n!). Go down the list of children, find out the avg, remainder, who has too many and who has too few. For each child in the too many list, go through list, send to each child who has too few.
Is there a better solution to this? I feel there must be. | 0 | [
2,
13966,
2523,
9083,
800,
3726,
3726,
31,
22,
79,
638,
27,
109,
1797,
26,
21,
13166,
13420,
7460,
9,
20,
4689,
17586,
956,
112,
4844,
15,
31,
57,
14,
7460,
302,
15022,
82,
1054,
206,
85,
21,
850,
8104,
54,
4350,
18,
9,
48,
12... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Wise to run MS Velocity on my development machine?
===
I've never developed a web application that uses distributed memory.
Is it common practice to run a tool such as Microsoft [Velocity][1] on my local machine as I develop, should I run Velocity on another server as I develop, or should I just develop as normal (default session & cache) and use Velocity only after I've deployed to our development server?
We are running into a lot of memory issues in our production web application so we are researching into splitting our servers into a farm.
[1]: http://blogs.msdn.com/velocity/ | 0 | [
2,
6714,
20,
485,
4235,
10700,
27,
51,
522,
1940,
60,
800,
3726,
3726,
31,
22,
195,
243,
885,
21,
2741,
3010,
30,
2027,
4387,
1912,
9,
25,
32,
757,
1345,
20,
485,
21,
5607,
145,
28,
7099,
636,
195,
1415,
5788,
500,
2558,
165,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to clone/deep copy a .NET generic Dictionary<string, T>?
===
I've got a generic dictionary Dictionary<string, T> that I would like to essentially make a Clone() of ..any suggestions. | 0 | [
2,
98,
25,
14,
246,
161,
20,
13871,
118,
11759,
4344,
21,
13,
9,
2328,
12733,
9186,
1,
11130,
15,
13,
38,
1,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
12733,
9186,
9186,
1,
11130,
15,
13,
38,
1,
30,
31,
83,
101,
20,
7398,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
ProcessStartInfo hanging on "WaitForExit"? Why?
===
I have the following code:
info = new System.Diagnostics.ProcessStartInfo("TheProgram.exe", String.Join(" ", args));
info.CreateNoWindow = true;
info.WindowStyle = System.Diagnostics.ProcessWindowStyle.Hidden;
info.RedirectStandardOutput = true;
info.UseShellExecute = false;
System.Diagnostics.Process p = System.Diagnostics.Process.Start(info);
p.WaitForExit();
Console.WriteLine(p.StandardOutput.ReadToEnd()); //need the StandardOutput contents
I know that the output from the process I am starting is around 7MB long. Running it in the Windows console works fine. Unfortunately programmatically this hangs indefinitely at WaitForExit. Note also this does code NOT hang for smaller outputs (like 3KB).
Is it possible that the internal StandardOutput in ProcessStartInfo can't buffer 7MB? If so, what should I do instead? If not, what am I doing wrong? | 0 | [
2,
953,
13680,
108,
4120,
4505,
27,
13,
7,
8195,
1106,
1706,
242,
7,
60,
483,
60,
800,
3726,
3726,
31,
57,
14,
249,
1797,
45,
15404,
800,
78,
329,
9,
4286,
21944,
18,
9,
16835,
13680,
108,
4120,
5,
7,
124,
19746,
9,
1706,
62,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 find packages names and versions for RedHat?
===
How can I find out whether a specific RedHat release (RHEL4, RHEL5...) contains a certain package (or a certain version of a package)? For Debian and Ubuntu, there's packages.debian.org and packages.ubuntu.com; is there a similar web site for RedHat?
Note: I don't want to have to install all the releases just to check some package version :-) | 0 | [
2,
113,
20,
477,
16875,
1817,
17,
3281,
26,
402,
6775,
60,
800,
3726,
3726,
184,
92,
31,
477,
70,
1472,
21,
1903,
402,
6775,
830,
13,
5,
139,
9180,
300,
15,
9940,
255,
264,
9,
9,
9,
6,
1588,
21,
1200,
6030,
13,
5,
248,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the difference between myCustomer.GetType() and typeof(Customer) in C#?
===
I've seen both done in some code I'm maintaining, but don't know the difference. Is there one? | 0 | [
2,
98,
25,
14,
2841,
128,
51,
4636,
262,
1263,
9,
3060,
4474,
5,
6,
17,
1001,
1041,
5,
4636,
262,
1263,
6,
19,
272,
5910,
60,
800,
3726,
3726,
31,
22,
195,
541,
156,
677,
19,
109,
1797,
31,
22,
79,
8215,
15,
47,
221,
22,
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,
0,
0,
0,
0,
0,
0,
0... |
Does the CAutoPtr class implement reference counting?
===
Modern ATL/MFC applications now have access to a new shared pointer class called CAutoPtr, and associated containers (CAutoPtrArray, CAutoPtrList, etc.).
Does the CAutoPtr class implement reference counting? | 0 | [
2,
630,
14,
10513,
3880,
6384,
718,
8713,
2801,
11195,
60,
800,
3726,
3726,
773,
35,
255,
118,
79,
7061,
3767,
130,
57,
1381,
20,
21,
78,
2592,
454,
106,
718,
227,
10513,
3880,
6384,
15,
17,
1598,
18988,
13,
5,
19433,
3880,
1939,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Delayed jump
===
How do I cause the page to make the user jump to a new web page after X seconds. If possible I'd like to use HTML but a niggly feeling tells me it'll have to be Javascript.
So far I have the following but it has no time delay
<body onload="document.location='newPage.html'">
| 0 | [
2,
8241,
3936,
800,
3726,
3726,
184,
107,
31,
1679,
14,
2478,
20,
233,
14,
4155,
3936,
20,
21,
78,
2741,
2478,
75,
993,
2582,
9,
100,
938,
31,
22,
43,
101,
20,
275,
13,
15895,
47,
21,
13,
27980,
102,
1249,
2609,
55,
32,
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... |
What's the difference between TRUNCATE and DELETEin SQL
===
I wrote up an answer to this question by mistake in response to a question about the difference between DROP and TRUNCATE, but I thought that it's a shame not to share so I'll post my own answer to my own question ... is that even ethical? :) | 0 | [
2,
98,
22,
18,
14,
2841,
128,
22328,
62,
17,
27448,
108,
4444,
255,
800,
3726,
3726,
31,
738,
71,
40,
1623,
20,
48,
1301,
34,
5643,
19,
1627,
20,
21,
1301,
88,
14,
2841,
128,
2804,
17,
22328,
62,
15,
47,
31,
289,
30,
32,
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... |
.NET Architectural issue: 2 Web Services, how do I change which one is used at run time?
===
I am working with Reporting Services and Sharepoint, I have an application that leverages reporting services however a client would like our application integrated into sharepoint. Currently we are tightly coupled to the ReportService.asmx webservice which exposes various methods for performing operations. Reporting Services has something called "Sharepoint Integration mode" when enabled the report server works differently and Sharepoint is used to manage the reports. Sharepoint adds a new web service called ReportService2006.asmx which is almost exactly the same.
Now our application uses a web reference to the ReportService and uses various objects exposed by the service. ReportService2006 has exactly the same objects but they are obviously in a different namespace e.g I have 2 web references - 1 to each service so there is an object MyApplication.ReportService.CatalogItem and another MyApplication.ReportService2006.CatalogItem.
I've tried to use dependency injection to absract the Service out of our application coupled with a factory pattern to determine which implementation of my interface to implement. Heres my interface. I've simplified it to include only the calls I need for this application.
using System;
using NetworkUserEncrypt.ReportService;
namespace MyApplication.Service
{
public interface IReportingService
{
CatalogItem CreateDataSource(string DataSource, string Parent, bool Overwrite, DataSourceDefinition Definition, Property[] Properties);
void DeleteItem(string Item);
DataSourceDefinition GetDataSourceContents(string DataSource);
byte[] GetReportDefinition(string Report);
CatalogItem[] ListChildren(string Item);
}
}
So I have 2 implementations of this each instantiating a different web service e.g:
namespace MyApp.Service.Implementation
{
class ReportingServiceImpl : IReportingService
{
ReportingService _service = null;
public ReportingService()
{
ReportingService _service = new ReportingService();
}
/* SNIP */
}
}
and
namespace MyApp.Service.Implementation
{
class ReportingService2006Impl : IReportingService
{
ReportingService2006 _service = null;
public ReportingService2006Impl()
{
ReportingService2006 _service = new ReportingService2006();
}
/* SNIP */
}
}
So the plan is I can inject these into my ServiceWrapper at run time. However - if you'll notice the interface is tied to the ReportService and some of the methods return objects that are from the web reference e.g. CatalogItem. Thus my project won't build because my implementation for ReportService2006 is referencing the CatalogItem from a different namespace.
Any ideas? Am I going totally the wrong direction with this? | 0 | [
2,
13,
9,
2328,
5350,
1513,
45,
172,
2741,
687,
15,
184,
107,
31,
753,
56,
53,
25,
147,
35,
485,
85,
60,
800,
3726,
3726,
31,
589,
638,
29,
6670,
687,
17,
1891,
3132,
15,
31,
57,
40,
3010,
30,
19414,
18,
6670,
687,
207,
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... |
When writing XML, is it better to hand write it, or to use a generator such as simpleXML in PHP?
===
I have normally hand written xml like this:
<tag><?= $value ?></tag>
Having found tools such as simpleXML, should I be using those instead? What's the advantage of doing it using a tool like that? | 0 | [
2,
76,
1174,
23504,
15,
25,
32,
574,
20,
224,
2757,
32,
15,
54,
20,
275,
21,
15286,
145,
28,
1935,
396,
8184,
19,
13,
26120,
60,
800,
3726,
3726,
31,
57,
4147,
224,
642,
23504,
101,
48,
45,
13,
1,
8628,
1,
60,
3726,
5579,
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... |
How to convert Pixels to Points (px to pt) in .NET? (C#)
===
I have a need to convert Pixels to Points in C#. I've seen some complicated explanations about the topic, but can't seem to locate a simple formula. Let's assume a standard 96dpi, how do I calulate this conversion? | 0 | [
2,
184,
20,
8406,
18146,
18,
20,
819,
13,
5,
306,
396,
20,
12923,
6,
19,
13,
9,
2328,
60,
13,
5,
150,
5910,
6,
800,
3726,
3726,
31,
57,
21,
376,
20,
8406,
18146,
18,
20,
819,
19,
272,
5910,
9,
31,
22,
195,
541,
109,
8343,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 deal with .NET TabPage controls all ending up in one Form class?
===
I'd like to structure a Form with a TabControl but I'd like to avoid having every control on each TabPage end up being a member of the Form I'm adding the TabControl to. So far I've identified these options, please comment or suggest alternatives:
1) Write a UserControl for each TabPage
2) Leave only the Control on the main Form but turn the control variable public and cut-and-past all actual code into separate classes
3) Forgo the Form designer and do everything at runtime
4) Derive from Tabpage (not sure if this works and what the design-time implications are)
Thanks all,
Andrew
| 0 | [
2,
184,
20,
1183,
29,
13,
9,
2328,
6523,
6486,
8671,
65,
3119,
71,
19,
53,
505,
718,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
1411,
21,
505,
29,
21,
6523,
12898,
47,
31,
22,
43,
101,
20,
2658,
452,
352,
569,
27,
206,
6523,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Data in a table with carriage return?
===
In SQL SERVER Is it possible to store data with carriage return in a table and then retrieve it back again with carriage return.
Eg:
insert into table values ('test1
test2
test3
test4');
when i retrieve it, I get the message in a line
test1 test2 test3 test4
The carriage return is treated as a single character.
Is there way to get the carriage returns or its just the way its going to be stored?
Thanks for the help guys!!!
| 0 | [
2,
1054,
19,
21,
859,
29,
7274,
788,
60,
800,
3726,
3726,
19,
4444,
255,
8128,
25,
32,
938,
20,
1718,
1054,
29,
7274,
788,
19,
21,
859,
17,
94,
11917,
32,
97,
188,
29,
7274,
788,
9,
12369,
45,
14692,
77,
859,
4070,
13,
5,
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... |
tool for reading glassfish logs?
===
I'm dealing with huge glassfish log files (in windows, eek!) and well ... Wordpad isn't cutting it.
Are there any tools out there that can handle these log files in a more intelligent manner? Functionality that would be welcome:
- View all lines of a certain log level (info, warning, severe)
- Show logs between two timestamps
- Occurency counter (this exception was thrown 99 times between time x and time y) | 0 | [
2,
5607,
26,
1876,
1350,
4934,
18893,
60,
800,
3726,
3726,
31,
22,
79,
5746,
29,
2329,
1350,
4934,
6738,
6488,
13,
5,
108,
1936,
15,
13,
62,
2354,
187,
6,
17,
134,
13,
9,
9,
9,
833,
8240,
2532,
22,
38,
5378,
32,
9,
50,
80,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Delphi Free and Open Source Components that is still being maintained.
===
It would be good to compile a new inventory here of Delphi FOSS components that are very useful, also with rare and difficult to find functionality and still maintained for the latest Delphi versions. Examples of rare components are for instance "TWAIN" scanning components, raw printing etc. Your comments added will be make for a very valuable searchable resource that is up to date. | 0 | [
2,
23030,
551,
17,
368,
1267,
5090,
30,
25,
174,
142,
3926,
9,
800,
3726,
3726,
32,
83,
44,
254,
20,
26561,
21,
78,
13875,
235,
16,
23030,
13,
15912,
5090,
30,
50,
253,
4811,
15,
67,
29,
2890,
17,
1956,
20,
477,
18548,
17,
174... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should Local Variable Initialisation Be Mandatory?
===
The maintenance problems that uninitialised locals cause (particularly pointers) will be obvious to anyone who has done a bit of c/c++ maintenance or enhancement, but I still see them and occasionally hear performance implications given as their justification.
It's easy to demonstrate in c that redundant initialisation is optimised out:
$ less test.c
#include <stdio.h>
main()
{
#ifdef INIT_LOC
int a = 33;
int b;
memset(&b,66,sizeof(b));
#else
int a;
int b;
#endif
a = 0;
b = 0;
printf ("a = %i, b = %i\n", a, b);
}
$ gcc --version
gcc (GCC) 3.4.4 (cygming special, gdc 0.12, using dmd 0.125)
[Not Optimised:]
$ gcc test.c -S -o no_init.s; gcc test.c -S -D INIT_LOC=1 -o init.s; diff no_in
it.s init.s
22a23,28
> movl $33, -4(%ebp)
> movl $4, 8(%esp)
> movl $66, 4(%esp)
> leal -8(%ebp), %eax
> movl %eax, (%esp)
> call _memset
33a40
> .def _memset; .scl 3; .type 32; .endef
[Optimised:]
$ gcc test.c -O -S -o no_init.s; gcc test.c -O -S -D INIT_LOC=1 -o init.s; diff
no_init.s init.s
$
So WRT performance under what circumstances is mandatory variable initialisation NOT a good idea?
IF applicable, no need to restrict answers to c/c++ but please be clear about the language/environment (and reproducible evidence much preferred over speculation!) | 0 | [
2,
378,
375,
7612,
2104,
4330,
44,
12605,
60,
800,
3726,
3726,
14,
5010,
1716,
30,
367,
27313,
2541,
375,
18,
1679,
13,
5,
20874,
454,
445,
6,
129,
44,
4674,
20,
1276,
72,
63,
677,
21,
1142,
16,
272,
118,
150,
20512,
5010,
54,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
VC error C4772: #import of typelib with another dependency
===
Using VC2005, I have 3 projects to build:
* libA (contains a typelib, results in libA.dll)
* libB (contains a typelib importing libA, results in libB.dll): IDL has a line `importlib( "libA " );`
* libC (imports libB): contains `#import <libB.dll>`
the `#import <libB.dll>` is handled by the compiler in the following way (according to documentation):
1. search directories of %PATH%
2. search directories of %LIB%
3. search the "additional include paths" (/I compiler option)
When compiling libC, I can see that cl.exe clearly is able to find the libA.dll on the executable path (using Filemon.exe)
However, still the libA namespace is _not_ found and all references to libA types are replaced by `__missing_type__`
(note: found a reference to hte problem at [http://forums.microsoft.com/MSDN/ShowPost.aspx?PostID=2555244&SiteID=1][1], but it didn't help in the end.)
Anyone seen this problem before? And solved it?
[1]:http://forums.microsoft.com/MSDN/ShowPost.aspx?PostID=2555244&SiteID=1
| 0 | [
2,
13,
8990,
7019,
272,
2918,
4009,
45,
6926,
1660,
1993,
16,
1001,
8326,
29,
226,
26835,
800,
3726,
3726,
568,
13,
8990,
2835,
15,
31,
57,
203,
2314,
20,
1895,
45,
1637,
2093,
969,
13,
5,
1126,
5851,
18,
21,
1001,
8326,
15,
173... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 parse_ini_file() - where does it look?
===
if I call php's `parse_ini_file("foo.ini")`, in what paths does it look for foo.ini ?
the include path? the function's documentation doesn't mention it. | 0 | [
2,
13,
26120,
2017,
870,
1,
2651,
1,
16877,
5,
6,
13,
8,
113,
630,
32,
361,
60,
800,
3726,
3726,
100,
31,
645,
13,
26120,
22,
18,
13,
1,
3574,
870,
1,
2651,
1,
16877,
5,
7,
4120,
111,
9,
2651,
7,
6,
1,
15,
19,
98,
12074,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Javascript Framework is the simplest and most powerful?
===
I've been using various javascript frameworks including mootools, jquery, prototype and scriptaculous and have found them all good, but difficult to extend to more complex ideas.
If I am going to knuckle down and learn one, which is the simplest to extend and use whilst staying powerful enough to use in a variety of directions? | 0 | [
2,
56,
8247,
8741,
6596,
25,
14,
24384,
17,
127,
2177,
60,
800,
3726,
3726,
31,
22,
195,
74,
568,
617,
8247,
8741,
6596,
18,
215,
13,
8765,
20799,
18,
15,
487,
8190,
93,
15,
7063,
17,
3884,
1738,
22717,
17,
57,
216,
105,
65,
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... |
Which syntax is better for return value?
===
I've been doing a massive code review and one pattern I notice all over the place is this:
public bool MethodName()
{
bool returnValue = false;
if (expression)
{
// do something
returnValue = MethodCall();
}
else
{
// do something else
returnValue = Expression;
}
return returnValue;
}
This is not how I would have done this I would have just returned the value when I knew what it was. which of these two patterns is more correct?
I stress that the logic always seems to be structured such that the return value is assigned in one plave only and no code is executed after it's assigned. | 0 | [
2,
56,
22649,
25,
574,
26,
788,
1923,
60,
800,
3726,
3726,
31,
22,
195,
74,
845,
21,
3787,
1797,
1487,
17,
53,
3732,
31,
3551,
65,
84,
14,
209,
25,
48,
45,
317,
1607,
1823,
2109,
7259,
5,
6,
13,
1,
1607,
1823,
788,
15165,
80... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When to use partial mocks?
===
I'm starting to get comfortable with the idea of fakes, stubs, mocks, and dynamic mocks. But I am still a little iffy in my understanding of when to use partial mocks.
It would seem that if you're planning on mocking a service and need to resort to a partial mock then it is a sign of bad design. Is it that partial mocks are mostly for getting legacy code under test coverage?
On the flip side of this, say I am testing a class which has a Reset() method. If I have already confirmed in a separate test that the Reset() method works is it poor test design to do a partial mock of the object and run tests against the partial mock, defining an Expectation on the Reset() method. Is this sort of thing going to get me in trouble later on?
| 0 | [
2,
76,
20,
275,
7284,
10506,
18,
60,
800,
3726,
3726,
31,
22,
79,
1422,
20,
164,
5733,
29,
14,
882,
16,
7031,
18,
15,
21354,
18,
15,
10506,
18,
15,
17,
7782,
10506,
18,
9,
47,
31,
589,
174,
21,
265,
31,
16852,
19,
51,
3260,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CVS: List all files changed between tags (or dates)
===
Is there any way to list all the files that have changed between two tags in CVS?
Every time we do a release we apply a tag to all the files in that release. I want to find all the files that changed between releases.
It would also work if I could find all files that had changed between two dates.
| 0 | [
2,
13,
12732,
18,
45,
968,
65,
6488,
1015,
128,
3383,
18,
13,
5,
248,
4076,
6,
800,
3726,
3726,
25,
80,
186,
161,
20,
968,
65,
14,
6488,
30,
57,
1015,
128,
81,
3383,
18,
19,
13,
12732,
18,
60,
352,
85,
95,
107,
21,
830,
95... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are there alternatives to CGI (and do I really need one)?
===
I am designing an application that is going to consist of 3-4 services that run as separate processes and are linked by a suitable IPC. The system is going to have a web interface and I want to use whatever webserver is there.
The web interface should be accessed under some URL that allows to have other URLs on the same webserver doing totally different things. I'm planning to use the path below that URL to specify what the web interface should do. It has facilities for use by other applications over the net and for humans to interact with in a browser.
Off the cuff, I'd work as follows:
- make the webserver fire up a CGI process for every request it receives (like SetHandler in Apache)
- let the CGI connect to the IPC
- let it get whatever it needs from the backend services
- let the CGI return HTML / XML and whatever HTTP Status based on the services' answers
Now, what I really want is to avoid the first two steps, or if I can't, avoid the second one, because I'm afraid that I'm wasting performance on unneccesary overhead (the requests coming from other applications might be frequent).
PHP, for example, can open persistent connections to a MySQL database that survive the script's runtime and don't need to be recreated next time, though I don't know how they actually do it. Also, as I understand it, the Apache modules are loaded once when the server starts, so that might remove the first step but would tie me to Apache.
So, what are good ways to hook a handler for specific URLs into different webservers? I don't want to handle the HTTP, otherwise I might just use a proxy setup to a second server, but it just seems to be so reinventing-the-wheel. If you think, CGI is fine and have examples where it handles large numbers of request of a similar structure, please let me know. | 0 | [
2,
50,
80,
2676,
18,
20,
272,
2234,
13,
5,
290,
107,
31,
510,
376,
53,
6,
60,
800,
3726,
3726,
31,
589,
15026,
40,
3010,
30,
25,
228,
20,
7929,
16,
203,
8,
300,
687,
30,
485,
28,
1725,
5102,
17,
50,
4727,
34,
21,
6445,
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... |
Can I get the path of the php file originally called within an included file?
===
Let's say we have index.php and it is stored in '/home/user/public/www' and index.php calls the class Foo->bar() from the file 'inc/app/Foo.class.php'. I'd like the bar function in the Foo class to get a hold of the path '/home/user/public/www' in this instance - and I don't want to use a global variable, pass a variable etc. | 0 | [
2,
92,
31,
164,
14,
2013,
16,
14,
13,
26120,
3893,
912,
227,
363,
40,
506,
3893,
60,
800,
3726,
3726,
408,
22,
18,
395,
95,
57,
4348,
9,
26120,
17,
32,
25,
8214,
19,
13,
22,
118,
8167,
118,
16704,
118,
12259,
118,
6483,
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... |
Sending messages to WCF host process
===
I have a Console application hosting a WCF service. I would like to be able to fire an event from a method in the WCF service and handle the event in the hosting process of the WCF service. Is this possible? How would I do this? Could I derive a custom class from ServiceHost? | 0 | [
2,
4907,
7561,
20,
11801,
410,
2015,
953,
800,
3726,
3726,
31,
57,
21,
8650,
3010,
10637,
21,
11801,
410,
365,
9,
31,
83,
101,
20,
44,
777,
20,
535,
40,
807,
37,
21,
2109,
19,
14,
11801,
410,
365,
17,
3053,
14,
807,
19,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Algorithm to score similarness of sets of numbers
===
What is an algorithm to compare multiple sets of numbers against a target set to determine which ones are the most "similar"?
One use of this algorithm would be to compare today's hourly weather forecast against historical weather recordings to find a day that had similar weather.
The similarity of two sets is a bit subjective, so the algorithm really just needs to diferentiate between good matches and bad matches. We have a lot of historical data, so I would like to try to narrow down the amount of days the users need to look through by automatically throwing out sets that aren't close and trying to put the "best" matches at the top of the list. | 0 | [
2,
9083,
20,
1618,
835,
720,
16,
3415,
16,
2116,
800,
3726,
3726,
98,
25,
40,
9083,
20,
11590,
1886,
3415,
16,
2116,
149,
21,
2935,
309,
20,
3746,
56,
53,
18,
50,
14,
127,
13,
7,
19107,
7,
60,
53,
275,
16,
48,
9083,
83,
44,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
InnerWorkings training -- Is it worth it?
===
I've been thinking about ordering up some modules from [InnerWorkings][1] but I am unsure if the cost/benefit is worth it. What are the thoughts of the community on this?
Thanks.
[1]: http://www.innerworkings.com | 0 | [
2,
3754,
14120,
18,
838,
13,
8,
8,
25,
32,
2715,
32,
60,
800,
3726,
3726,
31,
22,
195,
74,
1440,
88,
15775,
71,
109,
17113,
37,
636,
18005,
14120,
18,
500,
2558,
165,
500,
47,
31,
589,
13815,
100,
14,
1516,
118,
17092,
11765,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 results of map() and list comprehension are different?
===
The following test fails:
#!/usr/bin/env python
def f(*args):
"""
>>> t = 1, -1
>>> f(*map(lambda i: lambda: i, t))
[1, -1]
>>> f(*(lambda: i for i in t)) # -> [-1, -1]
[1, -1]
>>> f(*[lambda: i for i in t]) # -> [-1, -1]
[1, -1]
"""
alist = [a() for a in args]
print(alist)
if __name__ == '__main__':
import doctest; doctest.testmod()
| 0 | [
2,
483,
1736,
16,
2942,
5,
6,
17,
968,
27300,
50,
421,
60,
800,
3726,
3726,
14,
249,
1289,
13614,
45,
6926,
187,
118,
267,
139,
118,
4772,
118,
219,
710,
20059,
6312,
398,
5,
2483,
10663,
18,
6,
45,
13,
7,
7,
7,
13,
1,
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... |
Bare Minium Configration for RESTful WCF
===
What is the bare minimum I need to put in web.config to get WCF working with REST? I have annotated my methods with [WebGet], but they are not getting the message. | 0 | [
2,
4856,
4236,
723,
13,
14093,
2816,
5946,
26,
760,
1566,
11801,
410,
800,
3726,
3726,
98,
25,
14,
4856,
5187,
31,
376,
20,
442,
19,
2741,
9,
14093,
2816,
20,
164,
11801,
410,
638,
29,
760,
60,
31,
57,
40,
1270,
1669,
51,
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,
0,
0,
0,
0... |
Track Data Execution Prevention (DEP) problem.
===
When running one of our software, a tester was faced with the data execution prevention dialog of Windows.
We try to reproduce this situation on a developer computer for debugging purposes : with no success.
Does anyone know how to find what may cause the DEP protection to kill the application?
Is there any existing tools available for this?
Any advices are welcome,
Thanks,
Nic | 0 | [
2,
792,
1054,
5769,
10173,
13,
5,
17309,
6,
1448,
9,
800,
3726,
3726,
76,
946,
53,
16,
318,
2306,
15,
21,
1289,
106,
23,
3110,
29,
14,
1054,
5769,
10173,
28223,
16,
1936,
9,
95,
1131,
20,
21509,
48,
1858,
27,
21,
10058,
1428,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
StringReplace alternatives to improve performance.
===
I am using StringReplace to replace > and < by the char itself in a generated XML like this:
StringReplace(xml.Text,'>','>',[rfReplaceAll]) ;
StringReplace(xml.Text,'<','<',[rfReplaceAll]) ;
The thing is it takes way tooo long to replace every occurence of >.
Do you purpose any better idea to make it faster?
| 0 | [
2,
3724,
99,
5119,
2676,
18,
20,
3545,
956,
9,
800,
3726,
3726,
31,
589,
568,
3724,
99,
5119,
20,
3934,
279,
263,
38,
17,
279,
255,
38,
34,
14,
4892,
1145,
19,
21,
6756,
23504,
101,
48,
45,
3724,
99,
5119,
5,
396,
8184,
9,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I open a window's system menu by code?
===
I have a C# WinForms borderless window, for which I override WndProc and handle the WM_NCHITTEST message. For an area of that form, my hit test function returns HTSYSMENU. Double-clicking that area successfully closes the form, but right-clicking it does not show the window's system menu, nor does it show up when right-clicking the window's name in the taskbar.
This form uses these styles:
this.SetStyle( ControlStyles.AllPaintingInWmPaint, true );
this.SetStyle( ControlStyles.UserPaint, true );
this.SetStyle( ControlStyles.OptimizedDoubleBuffer, true );
this.SetStyle( ControlStyles.ResizeRedraw, true );
And has these non-default property values:
this.FormBorderStyle = System.Windows.Forms.FormBorderStyle.None;
this.KeyPreview = true;
this.MaximizeBox = false;
this.MinimizeBox = false;
I've tried handling WM_NCRBUTTONDOWN and WM_NCRBUTTONUP, and send the WM_GETSYSMENU message, but it didn't work. | 0 | [
2,
184,
92,
31,
368,
21,
1463,
22,
18,
329,
11379,
34,
1797,
60,
800,
3726,
3726,
31,
57,
21,
272,
5910,
628,
4190,
18,
1862,
923,
1463,
15,
26,
56,
31,
84,
11891,
619,
706,
15617,
17,
3053,
14,
19312,
1,
14976,
242,
10543,
28... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can someone provide a practical example of how they have used attributes on method parameters in .Net?
===
I know it's possible, and I've seen simple examples in the docs, but I was wondering if anyone on here has actually used them. I use attributes at the class and method level all the time, but have never used them on method parameters. Have any of you guys? If so, what was your reason and can we see the example?
I'm not interested in seeing a textbook example, mind you. There are plenty of those out there. I want to see an actual reason why it solved a particular problem for you. Thanks!
EDIT: Let's place aside the discussion about whether or not to use attributes in the first place. I understand some people don't like them because they "dirty" their code. That's for a different discussion! | 0 | [
2,
92,
737,
1181,
21,
5713,
823,
16,
184,
59,
57,
147,
13422,
27,
2109,
12905,
19,
13,
9,
2328,
60,
800,
3726,
3726,
31,
143,
32,
22,
18,
938,
15,
17,
31,
22,
195,
541,
1935,
3770,
19,
14,
9765,
18,
15,
47,
31,
23,
5712,
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... |
Cursor vs While loop. What are advantage/disadvantages of cursors - mssql
===
Is it a good idea to use while loop instead of cursor. What are advantage/disadvantages of cursors. | 0 | [
2,
29588,
4611,
133,
5293,
9,
98,
50,
3314,
118,
2906,
1283,
17384,
14465,
16,
29588,
18,
13,
8,
4235,
18,
22402,
800,
3726,
3726,
25,
32,
21,
254,
882,
20,
275,
133,
5293,
700,
16,
29588,
9,
98,
50,
3314,
118,
2906,
1283,
17384... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Can Delphi 2009 be installed on the same machine as Delphi 2006 or Delphi 2007?
===
Is there any conflict? | 0 | [
2,
92,
23030,
588,
44,
4066,
27,
14,
205,
1940,
28,
23030,
592,
54,
23030,
624,
60,
800,
3726,
3726,
25,
80,
186,
2930,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
WCF customheader or messagebody for context?
===
I'm witting a WCF service for a customer to send part information to our application. We have multiple customers that will have one or many locations, and part information is scoped to each location for the customer. When the customer calls our service they will need to specify the location.
Options that we have considered are:
1) Placing a location id(s) in a custom header. All part information would apply to all locations listed.
2) Adding a "context" node to the message body. All part information would apply to all locations listed.
3) Adding a location node in the message body over that would contain the part information. Each location would have it's own list of parts.
I'm looking for best practice/standards help in determining how this should be handled. We will have to create other services that will have the customer/location scope as well, and would like to handle this in a consistent manor. | 0 | [
2,
11801,
410,
5816,
1743,
106,
54,
2802,
9760,
26,
4141,
60,
800,
3726,
3726,
31,
22,
79,
14709,
68,
21,
11801,
410,
365,
26,
21,
7705,
20,
2660,
141,
676,
20,
318,
3010,
9,
95,
57,
1886,
5279,
30,
129,
57,
53,
54,
151,
4095,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 the thread /proc/PID/cmdline ?
===
On **Linux/NPTL**, threads are created as some kind of process.
I can see some of my process have a weird cmdline:
cat /proc/5590/cmdline
hald-addon-storage: polling /dev/scd0 (every 2 sec)
Do you have an idea how I could do that for each thread of my process? That would be very helpful for debugging.
*/me now investigating in HAL source*
thanks | 0 | [
2,
2697,
14,
9322,
13,
118,
15617,
118,
11031,
118,
9095,
43,
1143,
13,
60,
800,
3726,
3726,
27,
13,
1409,
1226,
7147,
118,
8157,
7786,
1409,
15,
20396,
50,
679,
28,
109,
825,
16,
953,
9,
31,
92,
196,
109,
16,
51,
953,
57,
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 an open source java enum of ISO 3166-1 country codes
===
Does anyone know of a freely available java 1.5 package that provides a list of ISO 3166-1 country codes as a enum or EnumMap? Specifically I need the "ISO 3166-1-alpha-2 code elements", i.e. the 2 character country code like "us", "uk", "de", etc. Creating one is simple enough (although tedious), but if there's a standard one already out there in apache land or the like it would save a little time. | 0 | [
2,
25,
80,
40,
368,
1267,
8247,
1957,
723,
16,
11899,
203,
13126,
8,
165,
475,
11358,
800,
3726,
3726,
630,
1276,
143,
16,
21,
11298,
904,
8247,
137,
9,
264,
6030,
30,
1927,
21,
968,
16,
11899,
203,
13126,
8,
165,
475,
11358,
28... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How is it possible to build a website with a homemade framework which has no documentation?
===
As a consultant, you are sometimes thrown in difficult situations. How is it possible to build a website with a homemade framework which has no documentation? | 0 | [
2,
184,
25,
32,
938,
20,
1895,
21,
2271,
29,
21,
27269,
6596,
56,
63,
90,
13945,
60,
800,
3726,
3726,
28,
21,
7381,
15,
42,
50,
1030,
6027,
19,
1956,
8329,
9,
184,
25,
32,
938,
20,
1895,
21,
2271,
29,
21,
27269,
6596,
56,
63... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How do I disable referential integrity in Postgres 8.2?
===
Google results on this one are a bit thin, but suggest that it is not easily possible.
My specific problem is that I need to renumber the IDs in two tables that are related to each other such that table B has an "table_a_id" column in it. I can't renumber table A first because then its children in B point to the old IDs. I can't renumber table B first because then they would point to the new IDs before they were created. Now repeat for three or four tables.
I don't really want to have to fiddle around with individual relationships when I could just "start transaction; disable ref integrity; sort IDs out; re-enable ref integrity; commit transaction". Mysql and MSSQL both provide this functionality IIRC so I would be surprised if Postgres didn't.
Thanks! | 0 | [
2,
184,
107,
31,
1460,
579,
5017,
10107,
11961,
19,
678,
6879,
18,
469,
9,
135,
60,
800,
3726,
3726,
8144,
1736,
27,
48,
53,
50,
21,
1142,
2951,
15,
47,
5601,
30,
32,
25,
52,
2351,
938,
9,
51,
1903,
1448,
25,
30,
31,
376,
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... |
Multiple domains for one site: alias or redirect?
===
I'm setting up a number sites right now and many of them have multiple domains. The question is: do I alias the domain (with [ServerAlias][1]) or do I [Redirect][2] the request?
Obviously ServerAlias is better/easier from a readability or scripting perspective. These days however I'm hearing that Google likes it better if everything redirects to one domain. Is this true? If so, what redirect code should be used?
Common vhost examples will have:
ServerName example.net
ServerAlias www.example.net
Is this wrong and should the www also be a redirect in addition to example2.net and www.example2.net? Or is Google smart enough to that all these sites (or at least the www) are the same site?
[1]: http://httpd.apache.org/docs/2.0/mod/core.html#serveralias
[2]: http://httpd.apache.org/docs/2.0/mod/mod_alias.html#redirect
| 0 | [
2,
1886,
15544,
26,
53,
689,
45,
15794,
54,
302,
14706,
60,
800,
3726,
3726,
31,
22,
79,
2697,
71,
21,
234,
3259,
193,
130,
17,
151,
16,
105,
57,
1886,
15544,
9,
14,
1301,
25,
45,
107,
31,
15794,
14,
4603,
13,
5,
1410,
636,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the foolproof way to tell which version(s) of .NET are installed on a production Windows Server?
===
This question is not so much programming related as it is deployment related.
I find myself conversing a lot with the group in my company whose job it is to maintain our production Windows servers and deploy our code on them. For legal and compliance reasons, I do not have direct visibility or any control over the servers so the only way I can tell which version(s) of .NET are installed on any of them is through directions I give to that group.
So far, all of the methods I can think of to tell which version(s) are installed (check for Administrative Tools matching 1.1 or 2.0, check for the entries in the "Add/Remove Programs" list, check for the existence of the directories under c:\Windows\Microsoft.NET) are flawed (I've seen at least one machine with 2.0 but no 2.0 entries under Administrative Tools - and that method tells you nothing about 3.0+, the "Add/Remove Programs" list can get out of sync with reality, and the existence of the directories doesn't necessarily mean anything).
Given that I generally need to know these things are in place in advance (discovering that "oops, this one doesn't have all the versions and service packs you need" doesn't really work well with short maintenance windows) and I have to do the checking "by proxy" since I can't get on the servers directly, what's the foolproof way to tell which version(s) of .NET are installed on a production Windows Server? Preferably some intrinsic way to do so using what the framework installs since it will be quicker and not need some sort of utility to be loaded and also a method which will definitely fail if the frameworks are not properly installed but still have files in place (i.e., there's a directory and gacutil.exe is inded there but that version of the framework is not really "installed") | 0 | [
2,
98,
22,
18,
14,
5345,
13266,
161,
20,
494,
56,
615,
5,
18,
6,
16,
13,
9,
2328,
50,
4066,
27,
21,
637,
1936,
8128,
60,
800,
3726,
3726,
48,
1301,
25,
52,
86,
212,
3143,
1597,
28,
32,
25,
10475,
1597,
9,
31,
477,
992,
106... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to submit form with data before logging someone out?
===
I'm using the document.form.submit() function for a rather large input form (hundreds of fields, it's an inventory application). I'm calling this after the user has been idle for a certain amount of time and I would like to save any data they've typed. When I try this the page reloads (the action is #) but any new text typed in the fields is not passed in the REQUEST, so I don't get to put it in the DB. Is there some fundamental reason why this happens or is my code just not playing nice together (I'm using the EXTJS grid view to show the form and a library for tracking idle time)?
Thanks,
Robert | 0 | [
2,
184,
20,
12298,
505,
29,
1054,
115,
13,
13919,
737,
70,
60,
800,
3726,
3726,
31,
22,
79,
568,
14,
4492,
9,
4190,
9,
7563,
5130,
5,
6,
1990,
26,
21,
864,
370,
6367,
505,
13,
5,
20701,
18,
16,
2861,
15,
32,
22,
18,
40,
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... |
Regular expression to match common SQL syntax?
===
I was writing some Unit tests last week for a piece of code that generated some SQL statements.
I was trying to figure out a regex to match SELECT,INSERT and UPDATE syntax so I could verify that my methods were generating valid SQL, and after 3-4 hours of searching and messing around with various regex editors I gave up.
I managed to get partial matches but because a section in quotes can contain any characters it quickly expands to match the whole statment.
Any help would be appreciated, I'm not very good with regular expressions but I'd like to learn more about them.
By the way it's C# regex that I'm after. | 0 | [
2,
1290,
1803,
20,
730,
757,
4444,
255,
22649,
60,
800,
3726,
3726,
31,
23,
1174,
109,
1237,
4894,
236,
877,
26,
21,
1855,
16,
1797,
30,
6756,
109,
4444,
255,
9015,
9,
31,
23,
749,
20,
1465,
70,
21,
7953,
1706,
20,
730,
5407,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 buffered version of CComBSTR that makes string concatenation more efficient?
===
I have several projects where I need to append strings to a BSTR/CComBSTR/\_bstr\_t object (e.g. building a dynamic SQL statement). Is there an out-of-the-box type in the WinAPI to buffer the concatenation (like StringBuilder in .NET), or do I have to write my own? From what I know about the append methods, they perform re-allocation. | 0 | [
2,
25,
80,
21,
17497,
69,
615,
16,
272,
10204,
9729,
30,
1364,
3724,
1065,
9530,
7914,
91,
8243,
60,
800,
3726,
3726,
31,
57,
238,
2314,
113,
31,
376,
20,
4865,
2451,
7887,
20,
21,
334,
9729,
118,
150,
10204,
9729,
118,
1,
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... |
Where can one find free software icons / images?
===
This may not be directly related to programming, but I always find it hard to get quality icons that can be used for software.
I'm currently have the need for some type of "green checkmark image", and I always seem to be looking for print, save, delete, icons...
Anybody have good resources?
**Note:** I rather not be stealing someone's intellectual property.
| 4 | [
2,
113,
92,
53,
477,
551,
2306,
9801,
18,
13,
118,
3502,
60,
800,
3726,
3726,
48,
123,
52,
44,
1703,
1597,
20,
3143,
15,
47,
31,
550,
477,
32,
552,
20,
164,
2190,
9801,
18,
30,
92,
44,
147,
26,
2306,
9,
31,
22,
79,
871,
57... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Need some ASP.NET MVC Routing Help
===
I've started with ASP.NET MVC recently, reading blogs, tutorials, trying some routes, etc. Now, i've stumbled on a issue where i need some help.
Basically, i have an URL like /products.aspx?categoryid=foo&productid=bar
Most tutorials/examples propose to map this to something like: /products/category/foo/bar where "products" is the controller, "category" is the action, etc.
But i need to map it to /products/foo/bar. (without "category")
Is it possible? Am i missing something? Help will be highly appreciated. Thank you advance :)
P.S. Sorry for my bad English. | 0 | [
2,
376,
109,
28,
306,
9,
2328,
307,
8990,
19880,
448,
800,
3726,
3726,
31,
22,
195,
373,
29,
28,
306,
9,
2328,
307,
8990,
1989,
15,
1876,
8146,
18,
15,
29724,
18,
15,
749,
109,
5050,
15,
2722,
9,
130,
15,
31,
22,
195,
10282,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MSBuild directory structure limit workarounds
===
Does anyone have a method to overcome the 260 character limit of the MSBuild tool for building Visual Studio projects and solutions from the command line? I'm trying to get the build automated using CruiseControl (CruiseControl.NET isn't an option, so I'm trying to tie it into normal ant scripts) and I keep on running into problems with the length of the paths.
I've also tried using DevEnv which sometimes works and sometimes throws an exception, which isn't good for an automated build on a separate machine. So please don't suggest using this as a replacement.
And to top it all, the project builds fine when using Visual Studio through the normal IDE. | 0 | [
2,
4235,
29361,
16755,
1411,
4496,
170,
10037,
18,
800,
3726,
3726,
630,
1276,
57,
21,
2109,
20,
9059,
14,
13,
13675,
925,
4496,
16,
14,
4235,
29361,
5607,
26,
353,
3458,
1120,
2314,
17,
6776,
37,
14,
1202,
293,
60,
31,
22,
79,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SqlParameter Size - negative effects of setting to max size?
===
I have a SqlCommand that I want to call Prepare() on whose CommandType = Text (it **cannot** be a stored procedure). In order to do this, I need to set the Size attribute on the parameters to be non-zero otherwise an exception is thrown. Are there any negative effects from setting the Size on all parameters to the maximum possible size even if the size of the actual values will never come close to that? Is there a better way to do this? | 0 | [
2,
4444,
255,
6351,
7307,
1072,
13,
8,
3682,
2292,
16,
2697,
20,
2049,
1072,
60,
800,
3726,
3726,
31,
57,
21,
4444,
255,
16239,
30,
31,
259,
20,
645,
5723,
5,
6,
27,
1196,
1202,
4474,
800,
1854,
13,
5,
242,
13,
1409,
1245,
127... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Committing a Directory to Subversion
===
Kind of a newbie question, but I am having problems using SNVKit.
I am using SVNKit in an application to commit changes to files. I have it successfully adding the files and folders to the working copy, but I am having problems committing it to the respository.
The command I am trying to run is 'commit -m "Test Add" /mysvnroot/mydirectory/' but I keep getting "svn: '/home/user' is not a working copy"
I have a structure similar to this:
* /svnroot/
* /svnroot/project1/
* /svnroot/project1/grouping1/
* /svnroot/project1/grouping1/myfilesarehere
If I try to commit the file, I get the following message: "'/java/svn/svn_local/ARLIBR20/QPGMSRC' is not under version control and is not part of the commit, yet its child is part of the commit."
What might I be doing wrong? | 0 | [
2,
19524,
21,
16755,
20,
972,
10898,
800,
3726,
3726,
825,
16,
21,
78,
5893,
1301,
15,
47,
31,
589,
452,
1716,
568,
13,
18,
20763,
13703,
9,
31,
589,
568,
13,
18,
16578,
13703,
19,
40,
3010,
20,
9686,
1693,
20,
6488,
9,
31,
57... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do generic interfaces in C# prevent boxing? (.NET vs Mono performance)
===
I have a C# interface with certain method parameters declared as `object` types. However, the actual type passed around can differ depending on the class implementing the interface:
public interface IMyInterface
{
void MyMethod(object arg);
}
public class MyClass1 : IMyInterface
{
public void MyMethod(object arg)
{
MyObject obj = (MyObject) arg;
// do something with obj...
}
}
public class MyClass2 : IMyInterface
{
public void MyMethod(object arg)
{
byte[] obj = (byte[]) arg;
// do something with obj...
}
}
The problem with MyClass2 is that the conversion of `byte[]` to and from `object` is [boxing and unboxing][1], which are computationally expensive operations affecting performance.
Would solving this problem with a [generic interface][2] avoid boxing/unboxing?
public interface IMyInterface<T>
{
void MyMethod(T arg);
}
public class MyClass1 : IMyInterface<MyObject>
{
public void MyMethod(MyObject arg)
{
// typecast no longer necessary
//MyObject obj = (MyObject) arg;
// do something with arg...
}
}
public class MyClass2 : IMyInterface<byte[]>
{
public void MyMethod(byte[] arg)
{
// typecast no longer necessary
//byte[] obj = (byte[]) arg;
// do something with arg...
}
}
How is this implemented in .NET vs Mono? Will there be any performance implications on either platform?
Thank you!
[1]: http://msdn.microsoft.com/en-us/library/yz2be5wk.aspx
[2]: http://msdn.microsoft.com/en-us/library/kwtft8ak.aspx | 0 | [
2,
107,
12733,
6573,
18,
19,
272,
5910,
2501,
8131,
60,
13,
5,
9,
2328,
4611,
4129,
956,
6,
800,
3726,
3726,
31,
57,
21,
272,
5910,
6573,
29,
1200,
2109,
12905,
2482,
28,
13,
1,
23793,
1,
2551,
9,
207,
15,
14,
3463,
1001,
1100... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Replacing QuickTest Professional (QTP) -- I need a tool to test Java Applications
===
Right now, I'm testing a Java Application with QTP (really expensive software).
I decided to move my web application testing to Selenium (using Java) and I was wondering if there were any other good tools to test my Java Application or if there are some libraries that tell allow me to click/type into Java Applications like Selenium does for web applications.
I'm looking for something like Selenium but for Java Applications (ie. if you wanted to test Eclipse IDE, you'd use this). | 0 | [
2,
5496,
2231,
10543,
736,
13,
5,
1251,
13726,
6,
13,
8,
8,
31,
376,
21,
5607,
20,
1289,
8247,
3767,
800,
3726,
3726,
193,
130,
15,
31,
22,
79,
4431,
21,
8247,
3010,
29,
2593,
13726,
13,
5,
15257,
5381,
2306,
6,
9,
31,
868,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 advice would you have for someone who wants to start in the BI (Business Intelligence) domain?
===
What advice would you have for someone who wants to start in the BI (Business Intelligence) domain?
I where and what I should start with: Books, Blogs, WebCasts...
What I should pay attention to and what I should stay away from.
Are the Microsoft technologies worth while ?
| 0 | [
2,
98,
4978,
83,
42,
57,
26,
737,
72,
2846,
20,
799,
19,
14,
1732,
13,
5,
18717,
2872,
6,
4603,
60,
800,
3726,
3726,
98,
4978,
83,
42,
57,
26,
737,
72,
2846,
20,
799,
19,
14,
1732,
13,
5,
18717,
2872,
6,
4603,
60,
31,
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... |
How do i make my colleagues not despising SVN?
===
Many of my colleagues use SVN in groups of 1-5 people partly working on the specific project. Half of them are inexperienced students. In fact non of us are real software developers with year-long experience. Most of them use Eclipse and subclipse to read and write their contributions to the SVN repositories.
Some of them have problems with the difference of:
- checking out (confused with update and merge)
- commiting (confused with update)
- updating (confused with commit and check out)
- merging (is the hardest. Whats a merge? Do i have to merge my code "into the SVN"?)
They fear that the SVN might kill their work (they don't call it working branch) if they press the wrong button.
They are committing their eclipse .project files to the repository, after adding some arbitrary library dependencies to their java projects. The other colleagues get compilation errors from these comitts and find it hard to resolve these.
In general they say: I'd like to work without SVN, i don't like it. It's too complex.
Is there a e-learning project like "SVN for kids"? How can i make them like version control? | 0 | [
2,
184,
107,
31,
233,
51,
8493,
52,
1746,
8954,
68,
13,
18,
16578,
60,
800,
3726,
3726,
151,
16,
51,
8493,
275,
13,
18,
16578,
19,
1170,
16,
137,
8,
264,
148,
5794,
638,
27,
14,
1903,
669,
9,
519,
16,
105,
50,
27624,
573,
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... |
Which java.awt.Image implementation is serializable?
===
I have a Serializable object which is supposed to hold an image as its member. Which image implementation implements Serializable? | 0 | [
2,
56,
8247,
9,
3885,
38,
9,
22039,
6123,
25,
5956,
3186,
579,
60,
800,
3726,
3726,
31,
57,
21,
5956,
3186,
579,
3095,
56,
25,
2293,
20,
1027,
40,
1961,
28,
82,
322,
9,
56,
1961,
6123,
8713,
18,
5956,
3186,
579,
60,
3,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I change the Status labels in Bugzilla
===
I don't want to change how the Status field works I just want to change the labels to
the states that the old system uses. (the old systems consists of spreadsheets and paper :P | 0 | [
2,
184,
107,
31,
753,
14,
1782,
13173,
19,
6256,
380,
3247,
800,
3726,
3726,
31,
221,
22,
38,
259,
20,
753,
184,
14,
1782,
575,
693,
31,
114,
259,
20,
753,
14,
13173,
20,
14,
202,
30,
14,
315,
329,
2027,
9,
13,
5,
124,
315,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
VBScript: How to utiliize a dictionary object returned from a function?
===
I'm trying to return a dictionary from a function. I believe the function is working correctly, but I'm not sure how to utilize the returned dictionary.
Here is the relevant part of my function:
Function GetSomeStuff()
'
' Get a recordset...
'
Dim stuff
Set stuff = CreateObject("Scripting.Dictionary")
rs.MoveFirst
Do Until rs.EOF
stuff.Add rs.Fields("FieldA").Value, rs.Fields("FieldB").Value
rs.MoveNext
Loop
GetSomeStuff = stuff
End Function
How do I call this function and use the returned dictionary? | 0 | [
2,
13,
20468,
8741,
45,
184,
20,
13,
14255,
49,
2952,
21,
9186,
3095,
587,
37,
21,
1990,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
788,
21,
9186,
37,
21,
1990,
9,
31,
985,
14,
1990,
25,
638,
12044,
15,
47,
31,
22,
79,
52,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Checking Unix script ftp return codes.
===
I am currently creating an overnight job that calls a Unix script which in turn creates and ftps a file. I would like to check all possible return codes. The unix man for ftp doesn't list return codes. Does anyone know where to find a list? Anyone with experience with this? We have other scripts that grep for certain return strings in the log, and they send an email when in error. However, they often miss unanticipated codes.
I am then putting the reason into the log and the email.
Thanks,
Glenn | 0 | [
2,
9886,
22540,
3884,
1187,
306,
788,
11358,
9,
800,
3726,
3726,
31,
589,
871,
2936,
40,
12341,
1205,
30,
3029,
21,
22540,
3884,
56,
19,
805,
9695,
17,
1187,
1919,
21,
3893,
9,
31,
83,
101,
20,
2631,
65,
938,
788,
11358,
9,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Writing a Domain Specific Language for selecting rows from a table
===
I'm writing a server that I expect to be run by many different people, not all of whom I will have direct contact with. The servers will communicate with each other in a cluster. Part of the server's functionality involves selecting a small subset of rows from a potentially very large table. The exact choice of what rows are selected will need some tuning, and it's important that it's possible to update the selection criteria without getting each and every server administrator to deploy a new version of the server. Simply writing the function in Python isn't really an option, since nobody is going to want to install a server that downloads and executes arbitrary code at runtime.
What I need are suggestions on the simplest way to implement a Domain Specific Language to achieve this goal. The language needs to be capable of simple expression evaluation, as well as querying table indexes and iterating through the returned rows. Ease of writing and reading the language is secondary to ease of implementing it.
I realise this question sounds a lot like I'm asking for SQL. However, I don't want to require that the datastore backing this data be a relational database, and I don't want the overhead of trying to reimplement SQL myself. Something much simpler would be far preferable. | 0 | [
2,
1174,
21,
4603,
1903,
816,
26,
20764,
11295,
37,
21,
859,
800,
3726,
3726,
31,
22,
79,
1174,
21,
8128,
30,
31,
4186,
20,
44,
485,
34,
151,
421,
148,
15,
52,
65,
16,
1368,
31,
129,
57,
1744,
2203,
29,
9,
14,
17595,
129,
87... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Possible causes of Java VM EXCEPTION_ACCESS_VIOLATION?
===
When a Java VM crashes with an EXCEPTION\_ACCESS\_VIOLATION and produces an hs\_err\_pidXXX.log file, what does that indicate? The error itself is basically a null pointer exception. Is it always caused by a bug in the JVM, or are there other causes like malfunctioning hardware or software conflicts? | 0 | [
2,
938,
4047,
16,
8247,
13,
20147,
5391,
1,
20604,
1,
13327,
10832,
60,
800,
3726,
3726,
76,
21,
8247,
13,
20147,
21563,
29,
40,
5391,
1,
20604,
1,
13327,
10832,
17,
6700,
40,
746,
18,
1,
106,
139,
1,
11031,
13290,
9,
5567,
3893... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
boost::shared_ptr STL container question
===
Assume I have a class foo, and wish to use a std::map to store some boost::shared_ptrs, e.g.:
class foo;
typedef boost::shared_ptr<foo> foo_sp;
typeded std::map<int, foo_sp> foo_sp_map;
foo_sp_map m;
If I add a new foo_sp to the map but the key used already exists, will the existing entry be deleted? For example:
foo_sp_map m;
foo_sp p(new foo);
m[0] = p;
...
foo_sp p2(new foo);
m[0] = p2;
Will the original pointer (p) be freed when it is replaced by p2? I'm pretty sure it will be, but I thought it was worth asking/sharing. | 0 | [
2,
10419,
45,
45,
16608,
43,
1,
4417,
139,
354,
255,
12147,
1301,
800,
3726,
3726,
7158,
31,
57,
21,
718,
4310,
111,
15,
17,
2536,
20,
275,
21,
354,
43,
45,
45,
15022,
20,
1718,
109,
10419,
45,
45,
16608,
43,
1,
4417,
1224,
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... |
Loop through all Resources in ResourceManager - C#
===
How do I loop into all the resources in the resourcemanager?
Ie:
foreach (string resource in ResourceManager)
//Do something with the recource.
Thanks | 0 | [
2,
5293,
120,
65,
2566,
19,
6577,
22256,
13,
8,
272,
5910,
800,
3726,
3726,
184,
107,
31,
5293,
77,
65,
14,
2566,
19,
14,
6577,
22256,
60,
13,
660,
45,
26,
14322,
13,
5,
11130,
6577,
19,
6577,
22256,
6,
12894,
537,
301,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
RightNow CRM XML API - Anyone familiar with it?
===
I need to create a user control in either vb.net or c# to search a RightNow CRM database. I have the documentation on their XML API, but I'm not sure how to post to their parser and then catch the return data and display it on the page.
Any sample code would be greatly appreciated! | 0 | [
2,
193,
1387,
6186,
79,
23504,
21,
2159,
13,
8,
1276,
3694,
29,
32,
60,
800,
3726,
3726,
31,
376,
20,
1600,
21,
4155,
569,
19,
694,
13,
20468,
9,
2328,
54,
272,
5910,
20,
2122,
21,
193,
1387,
6186,
79,
6018,
9,
31,
57,
14,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
AVR or PIC to start programming Microcontroller?
===
Which family should I start to learn? (Never did any programming on microcontroller) | 0 | [
2,
21,
6938,
54,
9327,
20,
799,
3143,
2899,
12898,
1252,
60,
800,
3726,
3726,
56,
190,
378,
31,
799,
20,
2484,
60,
13,
5,
9018,
144,
186,
3143,
27,
2899,
12898,
1252,
6,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Using InstallUtil and silently setting a windows service logon username/password
===
I need to use InstallUtil to install a C# windows service. I need to set the service logon credentials (username and password). All of this needs to be done silently.
Is there are way to do something like this:
installutil.exe myservice.exe /customarg1=username /customarg2=password
| 0 | [
2,
568,
16146,
14255,
17,
8555,
2697,
21,
1936,
365,
6449,
103,
4155,
7259,
118,
6201,
9587,
800,
3726,
3726,
31,
376,
20,
275,
16146,
14255,
20,
16146,
21,
272,
5910,
1936,
365,
9,
31,
376,
20,
309,
14,
365,
6449,
103,
5059,
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... |
Java: Advice on handling large data volumes. (Part Deux)
===
Alright. So I have a very large amount of binary data (let's say, 10GB) distributed over a bunch of files (let's say, 5000) of varying lengths.
I am writing a Java application to process this data, and I wish to institute a good design for the data access. Typically what will happen is such:
* One way or another, all the data will be read during the course of processing.
* Each file is (typically) read sequentially, requiring only a few kilobytes at a time. However, it is often necessary to have, say, the first few kilobytes of _each file simultaneously_, or the middle few kilobytes of each file simultaneously, etc.
* There are times when the application will want random access to a byte or two here and there.
Currently I am using the RandomAccessFile class to read into byte buffers (and ByteBuffers). My ultimate goal is to encapsulate the data access into some class such that it is fast and I never have to worry about it again. The basic functionality is that I will be asking it to read frames of data from specified files, and I wish to minimize the I/O operations given the considerations above.
Examples for typical access:
* Give me the first 10 kilobytes of all my files!
* Give me byte 0 through 999 of file F, then give me byte 1 through 1000, then give me 2 through 1001, etc, etc, ...
* Give me a megabyte of data from file F starting at such and such byte!
Any suggestions for a good design?
| 0 | [
2,
8247,
45,
4978,
27,
7988,
370,
1054,
6127,
9,
13,
5,
3091,
26590,
6,
800,
3726,
3726,
11885,
9,
86,
31,
57,
21,
253,
370,
2006,
16,
14171,
1054,
13,
5,
1336,
22,
18,
395,
15,
332,
11400,
6,
4387,
84,
21,
7653,
16,
6488,
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... |
When to use dynamic vs. static libraries
===
When creating a class library in C++, you can choose between dynamic (.dll) and static (.lib) libraries. What is the difference between them and when is it appropriate to use which? | 0 | [
2,
76,
20,
275,
7782,
4611,
9,
12038,
8649,
800,
3726,
3726,
76,
2936,
21,
718,
1248,
19,
272,
20512,
15,
42,
92,
3538,
128,
7782,
13,
5,
9,
43,
211,
6,
17,
12038,
13,
5,
9,
8326,
6,
8649,
9,
98,
25,
14,
2841,
128,
105,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0... |
Where should a Subversion repository be?
===
Should it be on the development servers or a Subversion server?
I suppose this could be expanded to any client-server version control system. | 0 | [
2,
113,
378,
21,
972,
10898,
24869,
44,
60,
800,
3726,
3726,
378,
32,
44,
27,
14,
522,
17595,
54,
21,
972,
10898,
8128,
60,
31,
5787,
48,
110,
44,
2766,
20,
186,
6819,
8,
10321,
106,
615,
569,
329,
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... |
Is MVC-ARS preferable to classic MVC to prevent overloading?
===
The popular design pattern MVC (Model/View/Controller) has an extended cousin MVC-ARS (Action/Representation/State). The added components all live within the database layer and while are not part of the model, they are invoked by it. Details are as follows:
1. State, as in state machine. This follows the classic state machine pattern. There is a current state which is matched with an event which results in a continue or stop condition and perhaps a state change.
2. Action, as in the objective of all information technology systems, act on the data. This means our transaction, the CRUD (Create/Read/Update/Delete) of data in the database. This may have been blocked by the state machine.
3. Representation, as in what data are we sending back that will become the model. The data model and the MVC model are likely very different, relational vs. XML hierarchical for instance. Nothing wrong with that if it is explicit and understood. This is the representation.
Doesn't this extension prevent overloading of the either the model or the controller by a separation of state control, transaction control, and data snapshot? | 0 | [
2,
25,
307,
8990,
8,
5446,
6369,
579,
20,
2732,
307,
8990,
20,
2501,
84,
16866,
60,
800,
3726,
3726,
14,
844,
704,
3732,
307,
8990,
13,
5,
13998,
118,
4725,
118,
12898,
1252,
6,
63,
40,
1984,
4191,
307,
8990,
8,
5446,
13,
5,
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... |
How can I return a custom HTTP status code from a WCF REST method?
===
If something goes wrong in a WCF REST call, such as the requested resource is not found, how can I play with the HTTP response code (setting it to something like HTTP 404, for example) in my OperationContract method? | 0 | [
2,
184,
92,
31,
788,
21,
5816,
7775,
1782,
1797,
37,
21,
11801,
410,
760,
2109,
60,
800,
3726,
3726,
100,
301,
1852,
1389,
19,
21,
11801,
410,
760,
645,
15,
145,
28,
14,
6602,
6577,
25,
52,
216,
15,
184,
92,
31,
418,
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... |
Sending an arbitrary Signal in Windows?
===
Linux supports sending an arbitrary Posix-Signal such as `SIGINT` or `SIGTERM` to a process using the `kill`-Command. While `SIGINT` and `SIGTERM` are just boring old ways to end a process in a friendly or not-so-friendly kind of way, `SIGQUIT` is meant to trigger a core dump. This can be used to trigger a running Java VM to print out a thread dump, including the stacktraces of all running threads -- neat! After printing the debugging info, the Java VM will continue doing whatever it was doing before; in fact the thread dump just happens in another spawned thread of maximum priority. (You can try this out yourself by using `kill -3 <VM-PID>`.)
Note that you can also register your own signal handlers using the (unsupported!) `Signal` and `SignalHandler` classes in the `sun.misc`-package, so you can have all kinds of fun with it.
*However, I have yet to find a way to send a signal to a Windows process.* Signals are created by certain user inputs: `Ctrl-C` triggers a `SIGINT` on both platforms, for instance. But there does not seem to be any utility to manually send a signal to a running, but non-interactive process on Windows. The obvious solution is to use the Cygwin `kill` executable, but while it can end Windows processes using the appropriate Windows API, I could not send a `SIGBREAK` (the Windows equivalent to `SIGQUIT`) with it; in fact I think the only signal it is able to send to Windows processes is `SIGTERM`.
So, to make a long story short and to repeat the headline: How to I send an arbitrary signal to a process in Windows? | 0 | [
2,
4907,
40,
17237,
2800,
19,
1936,
60,
800,
3726,
3726,
13024,
6747,
4907,
40,
17237,
2353,
6742,
8,
11255,
192,
145,
28,
13,
1,
18,
2816,
6391,
1,
54,
13,
1,
18,
2816,
3964,
1,
20,
21,
953,
568,
14,
13,
1,
7577,
1,
8,
1623... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Consume Webservice using https protocol
===
I want to consume a web service over https from a java client.
What steps will i need to take in order to do this? | 0 | [
2,
16447,
2741,
11449,
568,
7775,
18,
8494,
800,
3726,
3726,
31,
259,
20,
16447,
21,
2741,
365,
84,
7775,
18,
37,
21,
8247,
6819,
9,
98,
2382,
129,
31,
376,
20,
247,
19,
389,
20,
107,
48,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Reading hidden share in C#
===
So I have a small C# app that needs to periodically check the contents of directories on multiple machines on the network. I thought I could just read \\hostname\C$ as a directory path, but with the normal Directory class there doesn't seem to be a way to authenticate against the other servers so you can access the hidden share.
I'm sure there's an easy way to do this that I've overlooked, but at the moment I'm a bit stumpted. | 0 | [
2,
1876,
3689,
1891,
19,
272,
5910,
800,
3726,
3726,
86,
31,
57,
21,
284,
272,
5910,
4865,
30,
2274,
20,
19886,
2631,
14,
8478,
16,
559,
1596,
27,
1886,
6035,
27,
14,
982,
9,
31,
289,
31,
110,
114,
1302,
13,
1,
11694,
7259,
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... |
Available space left on drive - WinAPI - Windows CE
===
I've forgotten the WinAPI call to find out how much space is remaining on a particular drive and pinvoke.net isn't giving me any love.
It's compact framework by the way, so I figure coredll.dll.
Can anyone with a better memory jog mine? | 0 | [
2,
904,
726,
225,
27,
1493,
13,
8,
628,
2552,
49,
13,
8,
1936,
4000,
800,
3726,
3726,
31,
22,
195,
5562,
14,
628,
2552,
49,
645,
20,
477,
70,
184,
212,
726,
25,
1846,
27,
21,
1498,
1493,
17,
3459,
2625,
1048,
9,
2328,
2532,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Invoking Web Services From a Java Client
===
I have a simple web app that runs inside Tomcat. I need to call a web service from this web app and I'm not sure how to go about it. It seems there are two methods depending on whether you are using a managed or unmanaged environment:
JNDI service lookup (managed)
and
JAX-RPC ServiceFactory (unmanaged)
...So which technique should I use? | 0 | [
2,
19,
2625,
1581,
2741,
687,
37,
21,
8247,
6819,
800,
3726,
3726,
31,
57,
21,
1935,
2741,
4865,
30,
1461,
572,
2067,
5782,
9,
31,
376,
20,
645,
21,
2741,
365,
37,
48,
2741,
4865,
17,
31,
22,
79,
52,
562,
184,
20,
162,
88,
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... |
Convert a string representation of a hex dump to a byte array using Java?
===
I am looking for a way to convert a long string (from a dump), that represents hex values into a byte array.
I couldn't have phrased it better than the person that posted the same question here:
[http://www.experts-exchange.com/Programming/Programming_Languages/Java/Q_21062554.html][1]
But to keep it original, I'll phrase it my own way: suppose I have a string "00A0BF" that I would like interpreted as the byte[] {0x00,0xA0,0xBf} what should I do?
I am a Java novice and ended up using BigInteger and watching out for leading hex zeros. But I think it is ugly and I am sure I am missing something simple...
[1]: http://www.experts-exchange.com/Programming/Programming_Languages/Java/Q_21062554.html | 0 | [
2,
8406,
21,
3724,
5442,
16,
21,
24,
396,
11424,
20,
21,
34,
591,
7718,
568,
8247,
60,
800,
3726,
3726,
31,
589,
699,
26,
21,
161,
20,
8406,
21,
175,
3724,
13,
5,
2665,
21,
11424,
6,
15,
30,
4719,
24,
396,
4070,
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... |
How would I raise an event (jQuery or standalone Javascript) when a popup window is closed?
===
I want to raise an event when a popup window is closed, or preferably, just before closing. I'm storing the popup window object as an object, but I don't know of any way to bind to the close event, or an event just before the window is closed.
var popupWindow = window.open("/popup.aspx", "popupWindow", "height=550,width=780");
Is there any way to subscribe to the close event using jQuery, or just raw javascript? I'm using jQuery and can't add another library, so if it can't be done in jQuery I'll have to roll my own event system somehow so that it will work across all browsers. | 0 | [
2,
184,
83,
31,
3972,
40,
807,
13,
5,
728,
8190,
93,
54,
26986,
8247,
8741,
6,
76,
21,
1675,
576,
1463,
25,
827,
60,
800,
3726,
3726,
31,
259,
20,
3972,
40,
807,
76,
21,
1675,
576,
1463,
25,
827,
15,
54,
6369,
4801,
15,
114,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Creating a custom error page in Umbraco CMS
===
I'm working on a client site who is using Umbraco as a CMS. I need to create a custom 404 error page. I've tried doing it in the IIS config but umbraco overrides that.
Does anyone know how to create a custom 404 error page in Umbraco?
Is there a way to create a custom error page for runtime errors? | 0 | [
2,
2936,
21,
5816,
7019,
2478,
19,
13,
723,
2559,
716,
2390,
18,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
6819,
689,
72,
25,
568,
13,
723,
2559,
716,
28,
21,
2390,
18,
9,
31,
376,
20,
1600,
21,
5816,
13,
23397,
7019,
2478,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Deleting Windows performance counter categories
===
I have a custom performance counter category. Visual Studio Server Explorer refuses to delete it, claiming it is 'not registered or a system category'. Short of doing it programmatically, how can I delete the category? Is there a registry key I can delete? | 0 | [
2,
121,
1336,
68,
1936,
956,
2105,
6422,
800,
3726,
3726,
31,
57,
21,
5816,
956,
2105,
3230,
9,
3458,
1120,
8128,
8520,
10864,
20,
27448,
32,
15,
5865,
32,
25,
13,
22,
1270,
3801,
54,
21,
329,
3230,
22,
9,
502,
16,
845,
32,
62... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 access Subversion from Oracle PL/SQL ?
===
For a governmental agency, we build a release management system developped in PHP and Oracle. The data for this application is stored in database tables and is processed with PL/SQL packages and procedures.
The release management process is extensively based on metadata coming from Subversion repositories. We access the repositories from PL/SQL through the internal Oracle JVM to execute svn commands on the unix server on which resides the Oracle instances. The results from svn commands are received in XML and parsed before beeing processed by PL/SQL. Accessing Subversion this way is not very performant for frequent repeated use.
Currently, what we do is storing the Subversion metadata in database tables at each commit in the Subversion repositories (via Subversion hooks). We extract the log information for each Subversion transaction and keep it in some oracle tables. We are then able to obtain Subversion metadata with normal SQL queries.
Is there better ways to access Subversion from PL/SQL ? | 0 | [
2,
184,
20,
1381,
972,
10898,
37,
15759,
12443,
118,
18,
22402,
13,
60,
800,
3726,
3726,
26,
21,
16589,
2344,
15,
95,
1895,
21,
830,
1097,
329,
2803,
3631,
19,
13,
26120,
17,
15759,
9,
14,
1054,
26,
48,
3010,
25,
8214,
19,
6018,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 triggers ConstraintException when loading DataSet?
===
How can I find out which column and value is violating the constraint? The exception message isn't helpful at all:
> Failed to enable constraints. One or
> more rows contain values violating
> non-null, unique, or foreign-key
> constraints. | 0 | [
2,
98,
7286,
18,
28804,
10066,
872,
76,
12797,
1054,
3554,
60,
800,
3726,
3726,
184,
92,
31,
477,
70,
56,
4698,
17,
1923,
25,
23255,
14,
28804,
60,
14,
5391,
2802,
2532,
22,
38,
15600,
35,
65,
45,
13,
1,
1702,
20,
9240,
16747,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.lang.String in jndi default context with Apache Geronimo - How?
===
In a servlet I do the following:
Context context = new InitialContext();
value = (String) context.lookup("java:comp/env/propertyName");
On an Apache Geronimo instance (WAS CE 2.1) how do i associate a value with the key *propertyName*?
In Websphere AS 6 i can configure these properties for JNDI lookup under the "Name Space Bindings" page in the management console, but for the life of me I can find no way to do this in community edition on the web. | 0 | [
2,
8247,
9,
9949,
9,
11130,
19,
487,
9805,
12838,
4141,
29,
17140,
5389,
218,
11947,
13,
8,
184,
60,
800,
3726,
3726,
19,
21,
13,
10321,
1336,
31,
107,
14,
249,
45,
4141,
4141,
800,
78,
2104,
1126,
11969,
5,
6,
73,
1923,
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... |
What's the ideal humidity level for a room full of servers?
===
What is the ideal humidity level (or range) for a room dedicated to computer servers? | 2 | [
2,
98,
22,
18,
14,
5628,
20663,
662,
26,
21,
337,
503,
16,
17595,
60,
800,
3726,
3726,
98,
25,
14,
5628,
20663,
662,
13,
5,
248,
978,
6,
26,
21,
337,
2360,
20,
1428,
17595,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Getting the Boss to pay for training?
===
We all know that keeping your skills fresh and up to date not only benefit us as developers but also the companies we work for. It therefore makes perfect sense to me, and I am willing to bet you as well, that training is a good investment.
What is obvious to one person is not always obvious to someone else however. Does anybody have any ideas, metrics, vodoo or whatever to help me (and others) enlighten the companies we work for? | 0 | [
2,
1017,
14,
4054,
20,
1372,
26,
838,
60,
800,
3726,
3726,
95,
65,
143,
30,
2882,
154,
3207,
3180,
17,
71,
20,
1231,
52,
104,
4234,
182,
28,
10168,
47,
67,
14,
1532,
95,
170,
26,
9,
32,
1793,
1364,
2107,
1259,
20,
55,
15,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Regular expressions but for writing in the match
===
When using regular expressions we generally, if not always use them to extract some kind of information. What I need is to replace the match value with some other value...
Right now I'm doing this...
def getExpandedText(pattern, text, replaceValue):
"""
One liner... really ugly but it's only used in here.
"""
return text.replace(text[text.find(re.findall(pattern, text)[0]):], replaceValue) + \
text[text.find(re.findall(pattern, text)[0]) + len(replaceValue):]
so if I do sth like
>>> getExpandedText("aaa(...)bbb", "hola aaaiiibbb como estas?", "ooo")
'hola aaaooobbb como estas?'
It changes the (...) with 'ooo'.
Do you guys know whether with python regular expressions we can do this?
thanks a lot guys!! | 0 | [
2,
1290,
13832,
47,
26,
1174,
19,
14,
730,
800,
3726,
3726,
76,
568,
1290,
13832,
95,
1469,
15,
100,
52,
550,
275,
105,
20,
10962,
109,
825,
16,
676,
9,
98,
31,
376,
25,
20,
3934,
14,
730,
1923,
29,
109,
89,
1923,
9,
9,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best way to have a C++ member function get called by a C callback ?
===
Given a typical class:
<pre>
struct Whatever
{
void Doit();
};
Whatever w;
</pre>
what is the best way to get the member function to be called by a C void* based callback such as pthread_create() or a signal handler ?
<pre>
pthread_t pid;
pthread_create(&pid, 0, ... &w.Doit() ... );
</pre>
| 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
57,
21,
272,
20512,
322,
1990,
164,
227,
34,
21,
272,
645,
1958,
13,
60,
800,
3726,
3726,
504,
21,
3874,
718,
45,
13,
1,
3515,
1,
13,
10346,
2099,
13,
1,
11364,
107,
242,
5,
6,
73,
13,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Combining split date ranges in a SQL query
===
I'm working on a query that needs to have some data rows combined based on date ranges. These rows are duplicated in all the data values, except the date ranges are split. For example the table data may look like
StudentID StartDate EndDate Field1 Field2
1 9/3/2007 10/20/2007 3 True
1 10/21/2007 6/12/2008 3 True
2 10/10/2007 3/20/2008 4 False
The result of the query should have the split ranges combined. The rows that don't have a split date range should come through unchanged. The result would look like
StudentID StartDate EndDate Field1 Field2
1 9/3/2007 6/12/2008 3 True
2 10/10/2007 3/20/2008 4 False
What would be the SELECT statement for this query?
| 0 | [
2,
12803,
2132,
1231,
9230,
19,
21,
4444,
255,
25597,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
25597,
30,
2274,
20,
57,
109,
1054,
11295,
2461,
432,
27,
1231,
9230,
9,
158,
11295,
50,
19429,
43,
19,
65,
14,
1054,
4070,
15,
1613... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you use gdb to debug your code?
===
As a developer, how do you use gdb to track down bugs within your code? What techniques tricks do you use to make your life easier? | 0 | [
2,
184,
107,
42,
275,
489,
9007,
20,
121,
16254,
154,
1797,
60,
800,
3726,
3726,
28,
21,
10058,
15,
184,
107,
42,
275,
489,
9007,
20,
792,
125,
13925,
363,
154,
1797,
60,
98,
4212,
13747,
107,
42,
275,
20,
233,
154,
201,
4950,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Reusable code / class Repositories
===
I've got several modules containing functions, classes and templates that I keep in a directory called (hah!) 'reuse'. I know the content reasonably well, so to find a particular class or bit of code doesn't take too long, but it is slowly growing in size and I need some sensible method to store them for easy search & retrieval.
How should I do this? | 0 | [
2,
302,
267,
579,
1797,
13,
118,
718,
302,
14882,
262,
2829,
800,
3726,
3726,
31,
22,
195,
330,
238,
17113,
3503,
3719,
15,
2684,
17,
22894,
18,
30,
31,
643,
19,
21,
16755,
227,
13,
5,
994,
252,
187,
6,
13,
22,
99,
3699,
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... |
What is a good issue tracker for both project managers and developers?
===
There's a feature that I'd like to see in issue tracking software that just doesn't seem to be all that common, and that is the ability to divide a ticket (bug, feature request, etc) into sub-tasks and view them in a hierarchical fashion, perhaps with some kind of progress bar style report of progress on a particular ticket and its child tickets.
My thinking is that this would be useful for both developers and project managers: project managers like to have a fairly broad overview of what is going on, whereas developers need to drill down to the details, and very often need to divide a task into sub-tasks. This would also come in handy if someone put two issues into one ticket.
Does anyone know of an issue tracker which does this? So far the ones I've looked at (Trac, FogzBugz, and Basecamp) all have a flat organisation of tickets, so they're either useful for the developers or for the project managers but not for both. [Assembla][1] does allow a ticket to have child tickets (and multiple parent tickets) but it doesn't do a very good job of usability on this specific feature.
If there is such an issue tracker, has anyone used it for both developers and project managers, and if so, how much success did you have with it? Alternatively, is there a better approach that can be usable by both categories of users?
[1]: http://www.assembla.com/ | 0 | [
2,
98,
25,
21,
254,
1513,
792,
106,
26,
156,
669,
12657,
17,
10168,
60,
800,
3726,
3726,
80,
22,
18,
21,
1580,
30,
31,
22,
43,
101,
20,
196,
19,
1513,
10353,
2306,
30,
114,
1437,
22,
38,
2260,
20,
44,
65,
30,
757,
15,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Targeting .NET Framework 3.5, Using .NET 2.0 Runtime. Caveats?
===
I'm developing an application that is targeting the .NET 3.5 Framework. The application's setup installs the .NET **2.0** runtime on the target machine. So far I haven't had any issues with doing this, but I'm wondering what problems I'm going to have down the line. Do I *need* to be installing the **3.5** runtime?
I must package the .NET runtime installer into our installation (no network install). The size of the runtime installer is the issue. The .NET 2.0 runtime installer is 23MBs (manageable), the .NET 3.0 runtime installer is 50MBs (getting big) and the .NET 3.5 runtime installer is 200MBs (yikes!). What the heck is in those extra 170MBs? | 0 | [
2,
15972,
13,
9,
2328,
6596,
203,
9,
264,
15,
568,
13,
9,
2328,
172,
9,
387,
485,
891,
9,
3542,
721,
18,
60,
800,
3726,
3726,
31,
22,
79,
3561,
40,
3010,
30,
25,
15972,
14,
13,
9,
2328,
203,
9,
264,
6596,
9,
14,
3010,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.