unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Declaring variables - best practices
===
I found a while ago (and i want to confirm again) that if you declare a class level variable, you should not call its constructor until the class constructor or load has been called. The reson was performance - but are thier other reasons to do or not do this? Are there exceptions to this rule?
**ie: this is what i do based on what i think the best practice is:**
public class SomeClass
{
private PersonObject _person;
public SomeClass()
{
_person = new PersonObject("Smitface");
}
}
**opposed to:**
public class SomeClass
{
private PersonObject _person = new PersonObject("Smitface");
public SomeClass()
{
}
}
| 0 | [
2,
15594,
12157,
13,
8,
246,
5242,
800,
3726,
3726,
31,
216,
21,
133,
1464,
13,
5,
290,
31,
259,
20,
10265,
188,
6,
30,
100,
42,
10123,
21,
718,
662,
7612,
15,
42,
378,
52,
645,
82,
6960,
248,
163,
14,
718,
6960,
248,
54,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you graph with Silverlight inside an 3.5 ASP.NET application?
===
I have the need to do some graphing (bar, chart, pie, trend) and instead of using Infragistics or manually drawing the graphs I want to use Silverlight.
My current ASP.NET application was upgraded to 3.5 and I have added a Silverlight Application project. Consuming the output inside of the existing master.page layout or inside of user controls does not seem to be as intuitive as I was hoping for.
Nor is the ability to create a graph from a generics listing of data even a control (like I have seen in several demonstrations at PDC08).
Any ideas? | 0 | [
2,
184,
107,
42,
7210,
29,
1172,
3130,
572,
40,
203,
9,
264,
28,
306,
9,
2328,
3010,
60,
800,
3726,
3726,
31,
57,
14,
376,
20,
107,
109,
7210,
68,
13,
5,
1850,
15,
1795,
15,
5470,
15,
8703,
6,
17,
700,
16,
568,
19,
22133,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# - Dumping a list to a dropdownlist
===
List<String> nameList = new List<String>();
DropDownList ddl = new DropDownList();
List is populated here, then sorted:
nameList.Sort();
Now i need to drop it into the dropdownlist, which is where I'm having issues (using foreach):
foreach (string name in nameList){
ddl.Items.Add(new ListItem(nameList[name].ToString()));
}
No workie - any suggestions? it's giving me compile errors:
Error - The best overloaded method match for 'System.Collections.Generic.List<string>.this[int]' has some invalid arguments
Error - Argument '1': cannot convert from 'string' to 'int'
| 0 | [
2,
272,
5910,
13,
8,
26523,
21,
968,
20,
21,
2804,
2968,
5739,
800,
3726,
3726,
968,
1,
11130,
1,
204,
5739,
800,
78,
968,
1,
11130,
1,
5,
6,
73,
2804,
2968,
5739,
13,
43,
8643,
800,
78,
2804,
2968,
5739,
5,
6,
73,
968,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Pattern name for flippable data structure?
===
I'm trying to think of a naming convention that accurately conveys what's going on within a class I'm designing. On a secondary note, I'm trying to decide between two almost-equivalent user APIs.
Here's the situation:
I'm building a scientific application, where one of the central data structures has three phases: 1) accumulation, 2) analysis, and 3) query execution.
In my case, it's a spatial modeling structure, internally using a KDTree to partition a collection of points in 3-dimensional space. Each point describes one or more attributes of the surrounding environment, with a certain level of confidence about the measurement itself.
After adding (a potentially large number of) measurements to the collection, the owner of the object will query it to obtain an interpolated measurement at a new data point somewhere within the applicable field.
The API will look something like this (the code is in Java, but that's not really important; the code is divided into three sections, for clarity):
// SECTION 1:
// Create the aggregation object, and get the zillion objects to insert...
ContinuousScalarField field = new ContinuousScalarField();
Collection<Measurement> measurements = getMeasurementsFromSomewhere();
// SECTION 2:
// Add all of the zillion objects to the aggregation object...
// Each measurement contains its xyz location, the quantity being measured,
// and a numeric value for the measurement. For example, something like
// "68 degrees F, plus or minus 0.5, at point 1.23, 2.34, 3.45"
foreach (Measurement m : measurements) {
field.add(m);
}
// SECTION 3:
// Now the user wants to ask the model questions about the interpolated
// state of the model. For example, "what's the interpolated temperature
// at point (3, 4, 5)
Point3d p = new Point3d(3, 4, 5);
Measurement result = field.interpolateAt(p);
For my particular problem domain, it will be possible to perform a small amount of incremental work (partitioning the points into a balanced KDTree) during SECTION 2.
And there will be a small amount of work (performing some linear interpolations) that can occur during SECTION 3.
But there's a huge amount of work (constructing a kernel density estimator and performing a Fast Gauss Transform, using Taylor series and Hermite functions, but that's totally beside the point) that must be performed **between** sections 2 and 3.
Sometimes in the past, I've just used lazy-evaluation to construct the data structures (in this case, it'd be on the first invocation of the "interpolateAt" method), but then if the user calls the "field.add()" method again, I have to completely discard those data structures and start over from scratch.
In other projects, I've required the user to explicitly call an "object.flip()" method, to switch from "append mode" into "query mode". The nice this about a design like this is that the user has better control over the exact moment when the hard-core computation starts. But it can be a nuisance for the API consumer to keep track of the object's current mode. And besides, in the standard use case, the caller never adds another value to the collection after starting to issue queries; data-aggregation almost always fully precedes query preparation.
How have you guys handled designing a data structure like this?
Do you prefer to let an object lazily perform its heavy-duty analysis, throwing away the intermediate data structures when new data comes into the collection? Or do you require the programmer to explicitly flip the data structure from from append-mode into query-mode?
And do you know of any naming convention for objects like this? Is there a pattern I'm not thinking of? | 0 | [
2,
3732,
204,
26,
8805,
306,
579,
1054,
1411,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
277,
16,
21,
10929,
3087,
30,
16353,
11266,
18,
98,
22,
18,
228,
27,
363,
21,
718,
31,
22,
79,
15026,
9,
27,
21,
2277,
1945,
15,
31,
22,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When is memory allocated in the .NET compact framework?
===
When is memory allocated in the .NET compact framework? If there is a difference between value and reference types, please detail. Documentation or steps to confirm are appreciated.
In particular, consider this scenario...
private MyClass item; // here?
public void MyMethod()
{
item = new MyClass(); // or here?
} | 0 | [
2,
76,
25,
1912,
11685,
19,
14,
13,
9,
2328,
8285,
6596,
60,
800,
3726,
3726,
76,
25,
1912,
11685,
19,
14,
13,
9,
2328,
8285,
6596,
60,
100,
80,
25,
21,
2841,
128,
1923,
17,
2801,
2551,
15,
2247,
6110,
9,
13945,
54,
2382,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to require commit messages in VisualSVN server?
===
We've got VisualSVN set up as our Subversion server on Windows, and we use Ankhsvn + TortoiseSVN on our client workstations.
How can you configure the server to require commit messages to be non-empty? | 0 | [
2,
184,
20,
4077,
9686,
7561,
19,
3458,
18,
16578,
8128,
60,
800,
3726,
3726,
95,
22,
195,
330,
3458,
18,
16578,
309,
71,
28,
318,
972,
10898,
8128,
27,
1936,
15,
17,
95,
275,
40,
4278,
18,
16578,
2754,
25691,
18,
16578,
27,
318... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
is there an 'free' viusal studio addin for nunit?
===
I'm cheap and don't want to pay for resharper or testdriven.net, is there an 'free' viusal studio addin for nunit? | 0 | [
2,
25,
80,
40,
13,
22,
4639,
22,
1790,
267,
192,
1120,
3547,
108,
26,
10210,
242,
60,
800,
3726,
3726,
31,
22,
79,
9148,
17,
221,
22,
38,
259,
20,
1372,
26,
302,
23646,
106,
54,
1289,
14489,
9,
2328,
15,
25,
80,
40,
13,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... |
Copy SQL 2005 database from production to development
===
We have a production SQL 2005 database server with the production version of our application's database on it. I would like to be able to copy down the data contents of the production database to a development server for testing, but I don't have backup authority on our production database.
I've tried using the SQL Import/Export Wizard in SQL 2005, but it always reports primary key voilations. How can I copy the contents of a database from the production server to development without using the "Backup/Restore" method? | 0 | [
2,
4344,
4444,
255,
812,
6018,
37,
637,
20,
522,
800,
3726,
3726,
95,
57,
21,
637,
4444,
255,
812,
6018,
8128,
29,
14,
637,
615,
16,
318,
3010,
22,
18,
6018,
27,
32,
9,
31,
83,
101,
20,
44,
777,
20,
4344,
125,
14,
1054,
8478... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Prevent Tab Hell With Visual Studio And FireFox Debugging?
===
How do I keep VS from opening a new tab in Firefox every time I hit F5 to debug a web application? I would *really* like it to re-use the same tab. | 0 | [
2,
184,
20,
2501,
6523,
1094,
29,
3458,
1120,
17,
535,
18219,
121,
16254,
2762,
60,
800,
3726,
3726,
184,
107,
31,
643,
4611,
37,
1214,
21,
78,
6523,
19,
535,
18219,
352,
85,
31,
770,
398,
264,
20,
121,
16254,
21,
2741,
3010,
60... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0... |
What is the simplest way to work with associative strings (key/values)?
===
I have a lot of constants that are somehow related, at some point I need to pair them, something like this:
const
key1 = '1';
key2 = '2';
key3 = '3';
value1 = 'a';
value2 = 'b';
value3 = 'c';
I want to avoid doing:
if MyValue = key1 then Result := value1;
I know how to do it with string lists using:
MyStringList.Add(key1 + '=' + value1);
Result := MyStringList.Values[key1];
But, is there any simpler way to do this? | 0 | [
2,
98,
25,
14,
24384,
161,
20,
170,
29,
28,
18,
16325,
3366,
7887,
13,
5,
4237,
118,
15165,
18,
6,
60,
800,
3726,
3726,
31,
57,
21,
865,
16,
3587,
18,
30,
50,
3625,
1597,
15,
35,
109,
454,
31,
376,
20,
2146,
105,
15,
301,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to get the value of an item contained in Django's "changed_data" list?
===
I have the following code in my Django application:
if 'book' in authorForm.changed_data:
#Do something here...
I realize Django can tell me which values have changed in my form by utilizing the "changed_data" list object, but I'd like to know the new values of the fields that have changed.
Any thoughts? | 0 | [
2,
25,
32,
938,
20,
164,
14,
1923,
16,
40,
9101,
3437,
19,
3857,
14541,
22,
18,
13,
7,
16229,
43,
1,
18768,
7,
968,
60,
800,
3726,
3726,
31,
57,
14,
249,
1797,
19,
51,
3857,
14541,
3010,
45,
100,
13,
22,
5199,
22,
19,
1314,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 large files via HTTP
===
I have a PHP client that requests an XML file over HTTP (i.e. loads an XML file via URL). As of now, the XML file is only several KB in size. A problem I can foresee is that the XML becomes several MBs or Gbs in size. I know that this is a huge question and that there are probably a myriad of solutions, but What ideas do you have to transport this data to the client?
Thanks! | 0 | [
2,
4907,
370,
6488,
1197,
7775,
800,
3726,
3726,
31,
57,
21,
13,
26120,
6819,
30,
12279,
40,
23504,
3893,
84,
7775,
13,
5,
49,
9,
62,
9,
19069,
40,
23504,
3893,
1197,
287,
6362,
6,
9,
28,
16,
130,
15,
14,
23504,
3893,
25,
104,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to set postgre table names in rails with schema information?
===
I have to connect my rails app in a legacy Postgre database. It uses schemas so in a SQL its is common to use something like
SELECT * FROM "Financial".budget
I want to write a Budget model but I don't know how to set the table name in this case. I've tried the following:
- set\_table\_name 'budget'
- set\_table\_name '"Financial".budget'
None have worket.
| 0 | [
2,
184,
20,
309,
678,
6879,
859,
1817,
19,
2240,
18,
29,
23874,
676,
60,
800,
3726,
3726,
31,
57,
20,
6379,
51,
2240,
18,
4865,
19,
21,
7780,
678,
6879,
6018,
9,
32,
2027,
23874,
18,
86,
19,
21,
4444,
255,
82,
25,
757,
20,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PHP Constants: Advantages/Disadvantages
===
Lately I've been in the habit of assigning integer values to constants and simply using the constant name as a means of identifying its purpose. However, in some cases this has resulted in the need to write a function like typeToString($const) when a string representation is needed. Obviously this is inefficient and unneccesary, but is only an issue every once and a while.
So my question is, are there any other tradeoffs I should consider? Which case is considered to be cleaner/more standards-compliant? Also, is the performance difference negligable for most cases?
**Case 1: (faster when a string version is not needed?)**
class Foo {
const USER_TYPE_ADMIN = 0;
const USER_TYPE_USER = 1;
const USER_TYPE_GUEST = 2;
public $userType = self::USER_TYPE_ADMIN;
public function __construct($type) {
$this->userType = $type;
}
public function typeToString() {
switch($this->userType) {
case self::USER_TYPE_ADMIN:
return 'admin';
break;
case self::USER_TYPE_USER:
return 'user';
break;
case self::USER_TYPE_GUEST:
return 'guest';
break;
default:
return 'unknown';
break;
}
}
}
$foo = new Foo(Foo::USER_TYPE_GUEST);
echo $foo->typeToString();
// Displays "guest"
**Case 2:(faster/easier when a string version is needed)**
class Foo {
const USER_TYPE_ADMIN = 'admin';
const USER_TYPE_USER = 'user';
const USER_TYPE_GUEST = 'guest';
public $userType = self::USER_TYPE_ADMIN;
public function __construct($type) {
$this->userType = $type;
}
}
$foo = new Foo(Foo::USER_TYPE_GUEST);
echo $foo->userType();
// Displays "guest" | 0 | [
2,
13,
26120,
3587,
18,
45,
14683,
118,
2906,
1283,
17384,
14465,
800,
3726,
3726,
10434,
31,
22,
195,
74,
19,
14,
9474,
16,
13952,
68,
13820,
4070,
20,
3587,
18,
17,
1659,
568,
14,
3587,
204,
28,
21,
1108,
16,
13785,
82,
2131,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 mono singleton?
===
A friend of mine was recently asked in a job interview to tell the differnece between a standard singleton and a mono singleton. I have never heard the term before and a simple google search does not return any meaningful results.
My friend suggested that it is an object where the constructor is public but all the members are static. This seems a little silly to me as it would simply be a static object that would not require a constructor at all.
Does anyone have a better definition of a mono singleton? Is it something useful versus a standard singledon? | 0 | [
2,
98,
25,
21,
4129,
345,
444,
60,
800,
3726,
3726,
21,
860,
16,
1114,
23,
1989,
411,
19,
21,
1205,
2421,
20,
494,
14,
11394,
556,
1105,
128,
21,
1236,
345,
444,
17,
21,
4129,
345,
444,
9,
31,
57,
243,
752,
14,
981,
115,
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... |
Handling a Click for all controls on a Form
===
I have a .NET UserControl (FFX 3.5). This control contains several child Controls - a Panel, a couple Labels, a couple TextBoxes, and yet another custom Control. I want to handle a right click anywhere on the base Control - so a right click on any child control (or child of a child in the case of the Panel). I'd like to do it so that it's maintainable if someone makes changes to the Control without having to wire in handlers for new Controls for example.
First I tried overriding the WndProc, but as I suspected, I only get messages for clicks on the Form directly, not any of its children. As a semi-hack, I added the following after InitializeComponent:
foreach (Control c in this.Controls)
{
c.MouseClick += new MouseEventHandler(
delegate(object sender, MouseEventArgs e)
{
// handle the click here
});
}
This now gets clicks for controls that support the event, but Labels, for example, still don't get anything. Is there a simple way to do this that I'm overlooking? | 0 | [
2,
7988,
21,
10840,
26,
65,
8671,
27,
21,
505,
800,
3726,
3726,
31,
57,
21,
13,
9,
2328,
4155,
12898,
13,
5,
2460,
396,
203,
9,
264,
6,
9,
48,
569,
1588,
238,
850,
8671,
13,
8,
21,
4113,
15,
21,
1335,
13173,
15,
21,
1335,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is There a Better Way of Checking Nil or Length == 0 of a String in Ruby?
===
Is there a better way than the following to check to see if a string is nil OR has a length of 0 in Ruby?
if my_string or my_string.length == 0
return true
else
return false
In C# there's the handy
string.IsNullOrEmpty(myString)
Anything similar to that in Ruby? | 0 | [
2,
25,
80,
21,
574,
161,
16,
9886,
1781,
255,
54,
1476,
800,
3726,
713,
16,
21,
3724,
19,
10811,
60,
800,
3726,
3726,
25,
80,
21,
574,
161,
119,
14,
249,
20,
2631,
20,
196,
100,
21,
3724,
25,
1781,
255,
54,
63,
21,
1476,
16,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Fade between Tab Pages in a Tab Control
===
I have a Tab Control with multiple Tab Pages. I want to be able to fade the tabs back and forth. I don't see an opacity option on the Tab Controls. Is there a way to cause a fade effect when I switch from one Tab Page to another? | 0 | [
2,
11381,
128,
6523,
4434,
19,
21,
6523,
569,
800,
3726,
3726,
31,
57,
21,
6523,
569,
29,
1886,
6523,
4434,
9,
31,
259,
20,
44,
777,
20,
11381,
14,
6523,
18,
97,
17,
5882,
9,
31,
221,
22,
38,
196,
40,
13,
11490,
5788,
4255,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 get a list of files under a subversion-url in ant?
===
I want with ant access a subversion-repository and get a list of files available under a specific svn-url like https://svn.myhost.de/repository/path/into/repo. I want to list all items, subdirectories or files, in some form I can work with later in the ant-file. A comma-separated list is fine, it can be input for the foreach-task of ant-contrib. | 0 | [
2,
184,
164,
21,
968,
16,
6488,
131,
21,
972,
10898,
8,
911,
255,
19,
40,
38,
60,
800,
3726,
3726,
31,
259,
29,
40,
38,
1381,
21,
972,
10898,
8,
99,
14882,
14599,
17,
164,
21,
968,
16,
6488,
904,
131,
21,
1903,
13,
18,
16578... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Open Source SharePoint?
===
Is there an open source alternative to SharePoint?
I'd like something that gives the same hierarchical structure and portlet-based design of SharePoint, but is open in source. Web based administration and customization is also a plus.
| 0 | [
2,
368,
1267,
1891,
3132,
60,
800,
3726,
3726,
25,
80,
40,
368,
1267,
2676,
20,
1891,
3132,
60,
31,
22,
43,
101,
301,
30,
2352,
14,
205,
21376,
4272,
1411,
17,
1295,
1336,
8,
1281,
704,
16,
1891,
3132,
15,
47,
25,
368,
19,
126... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
C# - Sorting a list when it has more than one value per 'row' ?
===
Exception: Failed to compare two elements in the array.
if (ddl != null)
{
ddl.ClearSelection();
ddl.Items.Add(new ListItem("Select Author"));
foreach (string key in names.Keys)
{
nameList.Add(new ListItem(names[key].ToString(), key));
}
nameList.Sort();
}
So how can I use Sort() to compare on the "names" and not get stuck on the key? | 0 | [
2,
272,
5910,
13,
8,
2058,
68,
21,
968,
76,
32,
63,
91,
119,
53,
1923,
416,
13,
22,
5417,
22,
13,
60,
800,
3726,
3726,
5391,
45,
1702,
20,
11590,
81,
2065,
19,
14,
7718,
9,
100,
13,
5,
43,
8643,
13,
187,
3726,
16203,
6,
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... |
Maintaining a Programmer Wiki
===
I was recently put in charge of the wiki for the development team. The wiki is still in its infancy, so I have a lot of room to work with. It goal is to house internal to the development team. Currently, the main piece of information that the wiki holds is Coding Standards.
- What are some best practices your dev team uses for its internal wiki?
- What information is important to have on a dev wiki?
- If you were to go to the wiki for your dev team what information would you expect to see?
- Is there some information that shouldn't go on the wiki even though it seems like a good idea? | 0 | [
2,
8215,
21,
17968,
13,
17375,
800,
3726,
3726,
31,
23,
1989,
442,
19,
1906,
16,
14,
13,
17375,
26,
14,
522,
173,
9,
14,
13,
17375,
25,
174,
19,
82,
24530,
15,
86,
31,
57,
21,
865,
16,
337,
20,
170,
29,
9,
32,
1195,
25,
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... |
SharePoint and deployment of global.asax code
===
I want to start logging some custom messages [into the ULS](http://stackoverflow.com/questions/136672/programmatically-logging-to-the-sharepoint-uls) from my custom SharePoint code. My code is running inside list item receivers attached to some lists. I'd like to configure this logging mechanism within the application start event handler in global.asax. What's the best-practices way to deploy a SharePoint solution package that modifies global.asax?
| 0 | [
2,
1891,
3132,
17,
10475,
16,
2062,
9,
8588,
396,
1797,
800,
3726,
3726,
31,
259,
20,
799,
13,
13919,
109,
5816,
7561,
636,
108,
262,
14,
13,
1287,
18,
500,
5,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
13690,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 prevent DateTime from including zone offset in SOAP xsd:dateTime element?
===
I have this in some WSDL:
<element name="startDate" type="xsd:dateTime"/>
<element name="endDate" type="xsd:dateTime"/>
Which results in the following text in the SOAP envelope:
<startDate>2008-10-29T12:01:05</endDate>
<endDate>2008-10-29T12:38:59.65625-04:00</endDate>
Only some times have the milliseconds and zone offset. This causes me a headache because I'm trying to get a range of 37 minutes and 54 seconds in this example, but because of the offset I end up with 4 hours, 37 minutes, 54.65625 seconds. Is this some kind of rounding error in DateTime? How do I prevent this from happening? | 0 | [
2,
184,
107,
31,
2501,
1231,
891,
37,
215,
2464,
17493,
19,
6447,
993,
18,
43,
45,
8209,
891,
4520,
60,
800,
3726,
3726,
31,
57,
48,
19,
109,
619,
18,
8643,
45,
13,
1,
27567,
204,
3726,
7,
13680,
8209,
7,
1001,
3726,
7,
396,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
DUnit Testing in a Midas/DataSnap project
===
How does one setup DUnit Testing in a Midas/DataSnap project in Delphi 2006 | 0 | [
2,
4731,
242,
4431,
19,
21,
907,
472,
118,
18768,
18,
325,
306,
669,
800,
3726,
3726,
184,
630,
53,
18161,
4731,
242,
4431,
19,
21,
907,
472,
118,
18768,
18,
325,
306,
669,
19,
23030,
592,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
displaying a Drupal view without a page template around it
===
I would like to display a Drupal view without the page template that normally surrounds it - I want just the plain HTML content of the view's nodes.
This view would be included in another, non-Drupal site.
I expect to have to do this with a number of views, so a solution that lets me set these up rapidly and easily would be the best - I'd prefer not to have to create a .tpl.php file every time I need to include a view somewhere. | 0 | [
2,
17418,
21,
15708,
6720,
1418,
366,
21,
2478,
22894,
140,
32,
800,
3726,
3726,
31,
83,
101,
20,
3042,
21,
15708,
6720,
1418,
366,
14,
2478,
22894,
30,
4147,
12215,
18,
32,
13,
8,
31,
259,
114,
14,
3748,
13,
15895,
2331,
16,
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... |
Wrapping GPL Code in a Service, Kernel Driver or Other License Avoidance Mechanism
===
Regarding the following excerpt of [this comment][1]:
> AFAIK, it's fine to interact with GPL
> code over a network adapter. It's not
> normally OK (again, AFAIK) to have
> code that's more tightly coupled than
> that, particularly if your code can't
> function without the GPL code, but
> that's a gray area.
So if I want to use a graphics library that's GPL (and not LGPL), could I decide to make it part of a graphics service available on a linux computer as long as I release my code that implements this service with this library?
Say the library implements SVG, and I decide I want to do all of my screen drawing in vector graphics with SVG. Rather then rolling SVG into my several apps (and thus opening their source code), I create a service (or kernel driver even) that listens on a socket (or implements a graphics device) which takes SVG data and renders it to the screen using the library. I release the service/kernel driver code as per the library's GPL. I do not release code for any of my programs that use that service or kernel driver. I publish the API for the service/kernel driver so others can implement it, replace it, and still run my binaries with a different service/driver, or develop reflectors, etc.
- Am I violating the legal clauses of GPL
- Am I violating the spirit of the GPL
I'm certain others have thought about this - has it occurred, and what was the community reaction?
-Adam
[1]: http://stackoverflow.com/questions/247389/please-help-me-understand-the-specifics-of-the-gpl#247428 | 0 | [
2,
13437,
489,
5727,
1797,
19,
21,
365,
15,
17007,
2425,
54,
89,
3962,
26799,
6534,
800,
3726,
3726,
3467,
14,
249,
13,
25523,
16,
636,
1565,
6484,
500,
2558,
165,
500,
45,
13,
1,
21,
1473,
2883,
15,
32,
22,
18,
1123,
20,
10001,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 wrap text in a pre tag
===
pre tags are super-useful for code blocks and for debugging output when writing scripts, but how do I make the text word-wrap instead of running one long line? | 0 | [
2,
184,
107,
31,
8118,
1854,
19,
21,
782,
3383,
800,
3726,
3726,
782,
3383,
18,
50,
1026,
8,
3699,
1566,
26,
1797,
5198,
17,
26,
121,
16254,
2762,
5196,
76,
1174,
17505,
15,
47,
184,
107,
31,
233,
14,
1854,
833,
8,
499,
10817,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Has .NET removed the distinction between various languages?
===
We have always had languages that were preferable to be used in a particular scenario. For a quick prototype development, VB6 was an obvious choice. VB6 was chosen in projects that had a simple desktop user interface and standard and un-complicated database interaction requirements. If you wanted to develop a device driver using low-level routines, you probably relied on C or Visual C++. ASP was a standard choice for development of web interfaces. Every language had a particular 'domain' or 'specialization', speaking crudely.
With .NET framework, all languages are interoperable and presumably consistent. You can have a project with modules from different languages all together but all ultimately being treated fairly similary (all get compiled to IL).
Does this mean that the distinction we had earlier no longer exists? That differentiation was not necessarily bad rather something that was there by design and not due to any constraint. That apparently is diminshed somewhat with the .NET framework and its treatment of various languages.
What is the experience of everyone, specially if you have worked in both managed and non-managed environments? | 0 | [
2,
63,
13,
9,
2328,
1974,
14,
6519,
128,
617,
2556,
60,
800,
3726,
3726,
95,
57,
550,
41,
2556,
30,
46,
6369,
579,
20,
44,
147,
19,
21,
1498,
12705,
9,
26,
21,
2231,
7063,
522,
15,
13,
20468,
379,
23,
40,
4674,
1837,
9,
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... |
SMTP Relay Limits
===
We have set up a system where notifications get sent to a user with the following From address format: **user-{0}@aol.com** (replace {0} with an ID)
This way we can track what user we sent the message to originally. This format is not likely to change for various reasons. The issue we are running into is this: every email we send out with a dynamic address is creating a new SMTP relay.
My knowledge of relays is very limited. Our host (GoDaddy) limits SMTP relays to 250 per day. This is an application that potentially will be sending out thousands of emails per day.
*Is my assumption that every 'unregistered' email address we use opens a new relay, correct? If so, are there any services or hosts that provide unlimited relays for a reasonable price?*
Thanks. | 0 | [
2,
7613,
13726,
6953,
5887,
800,
3726,
3726,
95,
57,
309,
71,
21,
329,
113,
52,
4634,
18,
164,
795,
20,
21,
4155,
29,
14,
249,
37,
3218,
2595,
45,
13,
1409,
16704,
8,
1,
387,
1,
58,
1823,
9,
960,
1409,
13,
5,
99,
5119,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get image transparency working on IE
===
I have a GIF image that has an alpha set, and when my site loads in Firefox 3.0, it acts transparently on the parts of the image that should. However, when I try to load the GIF image in IE7, it comes back as a solid block. Actually, it is like the color from the image bled into the transparent area.
Do anyone have any suggestions for resolving this kind of problem? Pointers on what to look into, or a route you've used to solve this kind of problem.
I've been controlling this in CSS -- and while I'd like to avoid the conditional comments route and multiple CSSes, I'd be willing if the suggestion tangibly shows how I can resolve the IE compatibility problems.
Thanks,
Sean | 2 | [
2,
184,
20,
164,
1961,
19668,
638,
27,
13,
660,
800,
3726,
3726,
31,
57,
21,
489,
821,
1961,
30,
63,
40,
5705,
309,
15,
17,
76,
51,
689,
19069,
19,
535,
18219,
203,
9,
387,
15,
32,
3167,
14862,
102,
27,
14,
1341,
16,
14,
196... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Deploy application with SQLExpress
===
I've been creating some applications with SQLExpress and find my self, scripting the database creation, tables and other entities etc. after application installation. Is this the normal way?
Thanks | 0 | [
2,
17617,
3010,
29,
4444,
255,
21230,
800,
3726,
3726,
31,
22,
195,
74,
2936,
109,
3767,
29,
4444,
255,
21230,
17,
477,
51,
1119,
15,
3884,
68,
14,
6018,
2502,
15,
7484,
17,
89,
12549,
2722,
9,
75,
3010,
7758,
9,
25,
48,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
I'm I done with this linkedlist array code or still ?
===
Hi I'm practicing on the linkedlist array and thats what I've done.
I Defined an Object class - Student's data as the following.
public class Student
{
protected string Student_Name;
protected int Student_ID;
protected int Student_Mark;
protected char Student_Grade;
public Student() // default Constructor
{
Student_Name = " ";
Student_ID = 0;
Student_Mark = 0;
Student_Grade = ‘ ';
}
public Student(string Sname, int Sid, int Smark, char Sgrade) // Constructor
{
int len = sname.Length;
Student_Name = sname.Substring(0, len);
//Student_Name = sname.Substring(0, sname.Length);
Student_ID = Sid;
Student_Mark = Smark;
Student_Grade = Sgrade;
}
}
and then I Define Node class - Student's data as the following
public class S_Node
{
public Student Element;
public S_Node Link;
public S_Node()
{
Element = new Student();
Link = null;
}
public Node(Student theElement)
{
Element = theElement;
Link = null;
}
}
and then I Defined The LinkedList Class
public class S_LinkedList
{
protected S_Node header;
protected S_Node tail;
public S_LinkedList()
{
header = new S_Node();
Tail = new S_Node();
header.Link = Tail;
}
// METHODS which i don't know how to do it (never use linkedlist before)
}
I need to organize this data using “linkedlist data structure type”.
contain all methods of linkedlist as Adding nodes to the list as I've learned -->(Insert),Deleting nodes from the list,as I've learned -->((Remove),Traversing the listas I've learned -->((PrintList),Finding a node in the listas I've learned -->((Find , FindPrevious) the problem I'm selflearning and I've tried to search the net and read more from the stupid C# that was a disaster.
I've done too much that I'm so sad that i don't know how to complete it .
I'm trying hard to Use this classes to write an executable program and to Test it .
If you don't want to help in completing this program (hope not) at least show me some real examples or ideas , after all I'm a selflearner geek :-)
| 0 | [
2,
31,
22,
79,
31,
677,
29,
48,
4727,
5739,
7718,
1797,
54,
174,
13,
60,
800,
3726,
3726,
4148,
31,
22,
79,
13640,
27,
14,
4727,
5739,
7718,
17,
30,
18,
98,
31,
22,
195,
677,
9,
31,
2811,
40,
3095,
718,
13,
8,
1209,
22,
18... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 change the background color of a single cell in reporting services 2005
===
I'm trying to change the background color of single cell be based on a string value and wanted to see this expression code.
I was reading a similar question [here][1], but this is not the exact same issue I'm trying to solve.
[1]: http://stackoverflow.com/questions/44376/add-alternating-row-color-to-sql-server-reporting-services-report | 0 | [
2,
184,
20,
753,
14,
2395,
1665,
16,
21,
345,
1667,
19,
6670,
687,
812,
800,
3726,
3726,
31,
22,
79,
749,
20,
753,
14,
2395,
1665,
16,
345,
1667,
44,
432,
27,
21,
3724,
1923,
17,
417,
20,
196,
48,
1803,
1797,
9,
31,
23,
1876... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does Oracle allow an ORDER BY within an IN clause?
===
Oracle is giving me an error (ORA-00907: missing right parenthesis) when I run this query:
select * from reason_for_appointment where reason_for_appointment_id in (select reason_for_appointment_id from appointment_reason where appointment_id = 11 order by appointment_reason_id)
However, when I run just the subquery, there's no error.
Can anyone explain what the problem is? | 0 | [
2,
630,
15759,
1655,
40,
389,
34,
363,
40,
19,
9040,
60,
800,
3726,
3726,
15759,
25,
1438,
55,
40,
7019,
13,
5,
6055,
8,
387,
2545,
2984,
45,
2863,
193,
4766,
438,
4557,
6,
76,
31,
485,
48,
25597,
45,
5407,
1637,
37,
1215,
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 improve this SQL query?
===
I'm checking for existing of a row in in_fmd, and the ISBN I look up can be the ISBN parameter, or another ISBN in a cross-number table that may or may not have a row.
select count(*)
from in_fmd i
where (description='GN')
and ( i.isbn in
(
select bwi_isbn from bw_isbn where orig_isbn = ?
union all
select cast(? as varchar) as isbn
)
)
I don't actually care about the count of the rows, but rather mere existence of at least one row.
This used to be three separate queries, and I squashed it into one, but I think there's room for more improvement. It's PostgreSQL 8.1, if it matters. | 0 | [
2,
184,
92,
31,
3545,
48,
4444,
255,
25597,
60,
800,
3726,
3726,
31,
22,
79,
9886,
26,
3149,
16,
21,
3131,
19,
19,
1,
5223,
43,
15,
17,
14,
1488,
31,
361,
71,
92,
44,
14,
1488,
18906,
15,
54,
226,
1488,
19,
21,
919,
8,
162... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In DotNetNuke, how can I get a ModuleInfo object if I just have a ModuleId (and not a TabId)
===
The only method provided by the DNN framework to get a module by ID also required a tab ID. What can I do if I don't _have_ a tab ID? | 0 | [
2,
19,
14123,
2328,
4215,
1048,
15,
184,
92,
31,
164,
21,
12613,
108,
4120,
3095,
100,
31,
114,
57,
21,
12613,
1340,
13,
5,
290,
52,
21,
6523,
1340,
6,
800,
3726,
3726,
14,
104,
2109,
1173,
34,
14,
13,
43,
9377,
6596,
20,
164,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 retrieve the version of an Assembly in C#?
===
I have a reference to a type, for which I would like to retrieve the version number of the Assembly in which it is located.
What is the best way to do this? | 0 | [
2,
184,
107,
31,
11917,
14,
615,
16,
40,
1475,
19,
272,
5910,
60,
800,
3726,
3726,
31,
57,
21,
2801,
20,
21,
1001,
15,
26,
56,
31,
83,
101,
20,
11917,
14,
615,
234,
16,
14,
1475,
19,
56,
32,
25,
335,
9,
98,
25,
14,
246,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Evil use of extension methods?
===
Evil or not evil?
public static void Raise<T>(this EventHandler handler, object sender, EventArgs args)
{
if (handler != null)
{
handler(sender, args);
}
}
// Usage:
MyButtonClicked.Raise(this, EventArgs.Empty);
Note that due to the nature of extension methods, MyButtonClicked.Raise will not throw a NullReferenceException if MyButtonClicked is null. (E.g. there are no listeners to MyButtonClicked event).
Evil or not? | 0 | [
2,
3215,
275,
16,
3896,
3195,
60,
800,
3726,
3726,
3215,
54,
52,
3215,
60,
317,
12038,
11364,
3972,
1,
38,
1,
5,
1565,
807,
3203,
1252,
24641,
15,
3095,
2660,
106,
15,
807,
10663,
18,
13,
10663,
18,
6,
13,
1,
100,
13,
5,
3203,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 perferred method to update apps that use an EJB?
===
I have a java app that works with an EJB, however if:
1. The EJB gets updated, the app is broken.
2. The app server is updated, the app is broken.
Without human involvement, is there a preferred method to update the client jars for the app server and bean?
If there preferred method depends on the app server, then assume jboss. | 0 | [
2,
25,
80,
21,
416,
2407,
2095,
2109,
20,
11100,
4865,
18,
30,
275,
40,
13,
10022,
220,
60,
800,
3726,
3726,
31,
57,
21,
8247,
4865,
30,
693,
29,
40,
13,
10022,
220,
15,
207,
100,
45,
137,
9,
14,
13,
10022,
220,
3049,
6372,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Windows API for detecting out of paper on specific printer tray
===
I'm looking for a way to determine if a specific tray on a given printer in Windows is out of paper. Currenly I'm using the WMI Win32_Printer object to get the status of the entire printer, and if one of the trays is out of paper I do get a status that tells me the entire printer is out of paper.
But I'd like to know if a specific tray is out of paper. Copious Google searches have come up with nothing.
I'm writing the app in c# but pointers to examples in any language would do.
Thanks, in advance.. | 0 | [
2,
1936,
21,
2159,
26,
9092,
68,
70,
16,
1397,
27,
1903,
12925,
10121,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
161,
20,
3746,
100,
21,
1903,
10121,
27,
21,
504,
12925,
19,
1936,
25,
70,
16,
1397,
9,
5087,
2789,
102,
31,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
System.IO.IOException: The symbolic link cannot be followed because its type is disabled
===
What does this mean exactly? I'm doing something like this:
File.Copy(@"\\foo\bar\baz.txt", @"c:\test\baz.txt");
MSDN doesn't describe this exception except in general terms, and googling around just yields tables of error codes.
I've confirmed the source file exists, and I'm 99% sure that I have the permissions to copy the file to the destination location. | 0 | [
2,
329,
9,
1963,
9,
1963,
10066,
872,
45,
14,
12882,
3508,
1967,
44,
709,
185,
82,
1001,
25,
10154,
800,
3726,
3726,
98,
630,
48,
884,
1890,
60,
31,
22,
79,
845,
301,
101,
48,
45,
3893,
9,
19625,
5,
1,
7,
1,
4120,
111,
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... |
Inserting a value into a SQL float column generates a weird result
===
I am working on a legacy ASP application. I am attempting to insert a value (40.33) into a field in SQL Server 2000 that happens to be a float type. Every place I can see (via some logging) in the application is sending 40.33 to the Stored Procedure. When I run SQL Profiler against the database while the call is happening, the value that I see in the trace is 4.033000183105469e+001
Where is all the extra garbage coming from (the 183105469)?
Why is it that when I pass in 40, or 40.25 there is nothing extra?
Is this just one of the weird side effects of using float? When I am writing something I normally use money or decimal or something else, so not that familiar with the float datatype. | 0 | [
2,
14692,
68,
21,
1923,
77,
21,
4444,
255,
11510,
4698,
7920,
18,
21,
5455,
829,
800,
3726,
3726,
31,
589,
638,
27,
21,
7780,
28,
306,
3010,
9,
31,
589,
6314,
20,
14692,
21,
1923,
13,
5,
2602,
9,
4048,
6,
77,
21,
575,
19,
44... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I experiment with garbage collection?
===
I'm interested in how garbage collection works. I've read up on how some work such as mark-and-sweep, stop-and-copy, generational GC, etc... I'd like to experiment with implementing some of these and comparing their behaviors. What's a good way to get started experimenting with my own? Ideally something in C, Java or Python (although the last two are themselves garbage-collected so it seems it'd be hard to use them...)
| 0 | [
2,
184,
92,
31,
5737,
29,
15024,
1206,
60,
800,
3726,
3726,
31,
22,
79,
3158,
19,
184,
15024,
1206,
693,
9,
31,
22,
195,
1302,
71,
27,
184,
109,
170,
145,
28,
943,
8,
290,
8,
18,
458,
3492,
15,
747,
8,
290,
8,
19625,
15,
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... |
Remove surrounding whitespace from an image
===
I have a block of product images we received from a customer. Each product image is a picture of something and it was taken with a white background. I would like to crop all the surrounding parts of the image but leave only the product in the middle. Is this possible?
As an example: <a href="http://www.5dnet.de/media/catalog/product/d/r/dress_shoes_5.jpg" target="_new">http://www.5dnet.de/media/catalog/product/d/r/dress_shoes_5.jpg</a>
I don't want all white pixels removed, however I do want the image cropped so that the top-most row of pixels contains one non-white pixel, the left-most vertical row of pixels contains one non-white pixel, bottom-most horizontal row of pixels contains one non-white pixel, etc.
Code in C# or VB.net would be appreciated.
Thanks,
Kyle | 0 | [
2,
4681,
2470,
359,
5582,
37,
40,
1961,
800,
3726,
3726,
31,
57,
21,
1921,
16,
2374,
3502,
95,
420,
37,
21,
7705,
9,
206,
2374,
1961,
25,
21,
2151,
16,
301,
17,
32,
23,
658,
29,
21,
359,
2395,
9,
31,
83,
101,
20,
9833,
65,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should I catch exceptions thrown when closing java.sql.Connection
===
`Connection.close()` may throw `SqlException`, but I have always assumed that it is safe to ignore any such exceptions (and I have never seen code that does not ignore them).
Normally I would write:
try{
connection.close();
}catch(Exception e) {}
Or
try{
connection.close();
}catch(Exception e) {
logger.log(e.getMessage(), e);
}
The question is:
1. Is it bad practice (and has anyone had problems when ignoring such exeptions).
2. When `Connection.close()` does throw any exception.
3. If it is bad how should I handle the exception.
| 0 | [
2,
378,
31,
2949,
13392,
6027,
76,
4239,
8247,
9,
18,
22402,
9,
25996,
872,
800,
3726,
3726,
13,
1,
25996,
872,
9,
14330,
5,
6,
1,
123,
3814,
13,
1,
18,
22402,
10066,
872,
1,
15,
47,
31,
57,
550,
3632,
30,
32,
25,
1834,
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... |
openCV doesn't compile on Leopard
===
I've been for the past few hours trying to figure out why openCV doesn't compile on leopard. I've been googling searching for references but all point to a dead google group.
So my question here is quite simple, i've read INSTALL file, read all documentation i could find and still couldn't figure a solution for this.
The compile breaks here (this is generated through the Makefile):
> rm -fr
> .libs/libcxcore.lax/lib_cxcore.a mkdir
> .libs/libcxcore.lax/lib_cxcore.a
> Extracting /Users/fmsf/Projects/Motion
> Tracking/Libs/opencv-1.1.0/cxcore/src/./.libs/lib_cxcore.a (cd .libs/libcxcore.lax/lib_cxcore.a
> && ar x /Users/fmsf/Projects/Motion
> Tracking/Libs/opencv-1.1.0/cxcore/src/./.libs/lib_cxcore.a) ar: /Users/fmsf/Projects/Motion: No
> such file or directory make[2]: ***
> [libcxcore.la] Error 1 make[1]: ***
> [check-recursive] Error 1 make: ***
> [check-recursive] Error 1
Does anyone know what i could do to build it?
I'm using mac os 1.5 leopard, while reading i found the full port for mac os is still unfinished, but i don't really believe it's the missing of this library.
Any sugestions would be most welcome. | 0 | [
2,
368,
12732,
1437,
22,
38,
26561,
27,
15446,
800,
3726,
3726,
31,
22,
195,
74,
26,
14,
640,
310,
974,
749,
20,
1465,
70,
483,
368,
12732,
1437,
22,
38,
26561,
27,
15446,
9,
31,
22,
195,
74,
162,
5598,
802,
5792,
26,
7231,
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... |
How can I apply David Allen's "Getting Things Done" as a programmer?
===
Off and on I have read David Allen's "Getting Things Done" productivity books but never really implemented it.
What tools do you use to track tasks and projects?
How do you organize tasks when 95% of your tasks would be in the @Computer folder? | 0 | [
2,
184,
92,
31,
5645,
684,
3675,
22,
18,
13,
7,
27380,
564,
677,
7,
28,
21,
17968,
60,
800,
3726,
3726,
168,
17,
27,
31,
57,
1302,
684,
3675,
22,
18,
13,
7,
27380,
564,
677,
7,
18211,
964,
47,
243,
510,
6807,
32,
9,
98,
46... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Palindrome detection efficiency
===
I got curious by [Jon Limjap's interview mishap][1] and started to look for efficient ways to do palindrome detection. I checked the [palindrome golf][2] answers and it seems to me that in the answers are two algorithms only, reversing the string and checking from tail and head.
def palindrome_short(s):
length = len(s)
for i in xrange(0,length/2):
if s[i] != s[(length-1)-i]: return False
return True
def palindrome_reverse(s):
return s == s[::-1]
I think neither of these methods are used in the detection of exact palindromes in huge DNA sequences. I looked around a bit and didn't find any free article about what an ultra efficient way for this might be.
A good way might be parallelizing the first version in a divide-and-conquer approach, assigning a pair of char arrays 1..n and length-1-n..length-1 to each thread or processor.
What would be a better way?
Do you know any?
[1]: http://dotnet.kapenilattex.com/?p=93
[2]: http://stackoverflow.com/questions/228518/palindrome-golf | 0 | [
2,
4370,
108,
22264,
11643,
7836,
800,
3726,
3726,
31,
330,
7686,
34,
636,
9782,
13687,
1004,
306,
22,
18,
2421,
2462,
10463,
500,
2558,
165,
500,
17,
373,
20,
361,
26,
8243,
2847,
20,
107,
4370,
108,
22264,
11643,
9,
31,
6505,
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... |
WCF Callbacks and network traffic.
===
I like using WCF callbacks when I can because to me it is better than the client having to poll the server and its more real time than polling. The question I have is when I subscribe to a WCF service event is there any kind of heart beat that keeps the connection alive between the client and the server. I starting to think that there is not because when the server goes away the subscription is lost and the client does not throw an exception (could be the exception is be swallowed by the WCF runtime). Same is true for the server, when the client goes away and the server attempts to invoke the callback and exception is throw. Any thoughts?
Thanks
| 0 | [
2,
11801,
410,
645,
1958,
18,
17,
982,
2227,
9,
800,
3726,
3726,
31,
101,
568,
11801,
410,
645,
1958,
18,
76,
31,
92,
185,
20,
55,
32,
25,
574,
119,
14,
6819,
452,
20,
4994,
14,
8128,
17,
82,
91,
683,
85,
119,
20734,
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... |
Binding DataList Containing Checkboxes to a Dictionary
===
I have a DataList like so:
<asp:DataList ID="dlMyList" runat="server" RepeatColumns="5"
RepeatDirection="Horizontal" CellSpacing="5" >
<ItemTemplate>
<asp:CheckBox ID="cbMyBox" Runat="server" Text='<%# Container.DataItem%>' ToolTip=''></asp:CheckBox>
</ItemTemplate>
</asp:DataList>
I'm binding this to a Dictionary:
Dictionary<string, string> l_CheckboxData = GetCheckboxData();
this.dlMyList.DataSource = l_CheckboxData;
this.dlMyList.DataBind();
At the moment, both the key and the value from the dictionary are set as the Text for each checkbox. I'd like to have it such that they Dictionary's key is the Text property and the Dictionary's value is the ToolTip. How would I go about this? Thanks. | 0 | [
2,
8728,
1054,
5739,
3503,
2631,
5309,
160,
20,
21,
9186,
800,
3726,
3726,
31,
57,
21,
1054,
5739,
101,
86,
45,
13,
1,
472,
306,
45,
18768,
5739,
4924,
3726,
7,
8643,
915,
5739,
7,
485,
721,
3726,
7,
10321,
106,
7,
6830,
716,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 perfect code generation tool to generate MVC Storefront?
===
Does anybody know a good code generation tool (other than Subsonic because it doesn't support IQueryable in current version) to generate repository and other projects in a way Rob Conery worked in MVC Storefront? | 0 | [
2,
25,
80,
21,
2107,
1797,
2782,
5607,
20,
7920,
307,
8990,
29619,
60,
800,
3726,
3726,
630,
11181,
143,
21,
254,
1797,
2782,
5607,
13,
5,
9539,
119,
972,
17766,
185,
32,
1437,
22,
38,
555,
13,
5312,
622,
579,
19,
866,
615,
6,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Creating a VS .Net 2003 property macro/variable
===
I'd like to create a macro/variable for my project properties, similar to $(ConfigurationName), $(OutDir), etc - without making environment variables. I've found that this can be done in later versions of Visual Studio, but I do not have the option of updating my IDE. Can this be done in the .Net 2003 version (if so, how?) - or is the only way to do this through environment varibles? | 0 | [
2,
2936,
21,
4611,
13,
9,
2328,
973,
1354,
9069,
118,
8220,
579,
800,
3726,
3726,
31,
22,
43,
101,
20,
1600,
21,
9069,
118,
8220,
579,
26,
51,
669,
3704,
15,
835,
20,
5579,
5,
1126,
13549,
857,
7259,
6,
15,
5579,
5,
1320,
9035... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Lisp DO variable
===
In Peter Seibel's [i]Practical Common Lisp[/i], he gives this example:
(do ((nums nil) (i 1 (1+ i)))
((> i 10) (nreverse nums))
(push i nums))
I can see how it works, using nums inside the loop but not giving it a step-form. Why would you put nums in the variable-definition rather than do this:
(let (nums) (do ((i 1 (+ i 1)))
((> i 10) (nreverse nums))
(push i nums)))
I'm sure there's a good reason, but I don't get it yet. | 0 | [
2,
2093,
3401,
107,
7612,
800,
3726,
3726,
19,
936,
8546,
3512,
22,
18,
636,
49,
500,
7310,
150,
18142,
757,
2093,
3401,
2558,
118,
49,
500,
15,
24,
2352,
48,
823,
45,
13,
5,
537,
13,
5,
5,
6336,
18,
1781,
255,
6,
13,
5,
49,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using Subversion and Apache
===
I've never used any kind of source control before although I understand the concept. What I am confused about (and perhaps just not aware) is what benefit do I achieve and/or why would I want to configure Subversion and Apache? Do I need to configure it with Apache to be able to access my repositories from other computers over a network? Please feel free to provide any other details you feel are relevant?
My setup right now is a laptop (XP Pro) and a virtual machine (XP Pro). On my virtual machine I have Apache 2.2, MySQL 5 and PHP 5. This setup is my main concern although I'm happy to hear examples/situations that deviate from my scenario.
P.S. Would this be a community wiki or a regular question? I'm not trying to rack up points or anything. | 0 | [
2,
568,
972,
10898,
17,
17140,
800,
3726,
3726,
31,
22,
195,
243,
147,
186,
825,
16,
1267,
569,
115,
419,
31,
1369,
14,
2420,
9,
98,
31,
589,
4230,
88,
13,
5,
290,
1774,
114,
52,
3854,
6,
25,
98,
4234,
107,
31,
4689,
17,
118... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
My C++ ActiveMQ client can send messages, but not receive messages
===
I have the ActiveMQ-CPP 2.2.1 Visual Studio 2005 project compiling and running. In the console window, it shows the messages are being sent, though they're not being received. I can both send and receive messages with ActiveMQ-CPP 2.0.1, but not 2.2.1. I'm new to ActiveMQ and don't even know where to begin troubleshooting. Any thoughts/suggestions/good place to start would be a great help.
It if helps, I'm using the ActiveMQ 5.1.0 binary.
Thanks in advance! | 0 | [
2,
51,
272,
20512,
1348,
79,
1251,
6819,
92,
2660,
7561,
15,
47,
52,
2588,
7561,
800,
3726,
3726,
31,
57,
14,
1348,
79,
1251,
8,
150,
3421,
172,
9,
135,
9,
165,
3458,
1120,
812,
669,
24378,
17,
946,
9,
19,
14,
8650,
1463,
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... |
Service needs to detect if workstation is locked, and screen saver is active
===
I'm working on a service that needs to detect user states for all user(s) logged on to a single machine. Specifically, I want to check to see whether or not the screen saver is active and whether or not their session is locked.
This code will run under a system-level service, and has no visible UI, so that may rule out several options (trapping WM messages, etc).
Aside from normal workstations, I'd like for this to work on terminal servers that have multiple users logged in to it. Due to these requirements I'm wondering if several Win32 APIs will need to be involved.
Any ideas on where to begin? | 0 | [
2,
365,
2274,
20,
9092,
100,
170,
10839,
25,
4011,
15,
17,
2324,
2079,
139,
25,
1348,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
365,
30,
2274,
20,
9092,
4155,
202,
26,
65,
4155,
5,
18,
6,
13,
19287,
27,
20,
21,
345,
1940,
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... |
mysql import sql via cli from remote server
===
i know how to import an sql file via the cli:
mysql -u USER -p DBNAME < dump.sql
but that's if the dump.sql file is local. how could i use a file on a remote server? | 0 | [
2,
51,
18,
22402,
9010,
4444,
255,
1197,
19391,
37,
5388,
8128,
800,
3726,
3726,
31,
143,
184,
20,
9010,
40,
4444,
255,
3893,
1197,
14,
19391,
45,
51,
18,
22402,
13,
8,
291,
4155,
13,
8,
306,
13,
9007,
7259,
13,
1,
11424,
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... |
COM calling convention on x64
===
I am trying to get a definitive answer regarding the way COM behaves on a x64 machine. Does Windows use the normal x64 calling convention when dispatching calls to COM interfaces on x64 machines (assuming the COM implementation is 64 bits)? Specifically, I dynamically generate my vtbl entries to point to a chunk of assembly that's dynamically loaded during runtime. This assembly needs to know how to get parameters correctly from whomever is calling it. Thus, I'd like to know if COM sets up the call to my assembly using the standard x64 calling convention (pretty much fastcall). | 0 | [
2,
13,
960,
2555,
3087,
27,
993,
3470,
800,
3726,
3726,
31,
589,
749,
20,
164,
21,
15676,
1623,
3467,
14,
161,
13,
960,
14149,
18,
27,
21,
993,
3470,
1940,
9,
630,
1936,
275,
14,
1826,
993,
3470,
2555,
3087,
76,
14226,
68,
3029,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Method Overloading. Can you overuse it?
===
What's better practice when defining several methods that return the same shape of data with different filters? Explicit method names or overloaded methods?
For example. If I have some Products and I'm pulling from a database
explicit way:
public List<Product> GetProduct(int productId) { // return a List }
public List<Product> GetProductByCategory(Category category) { // return a List }
public List<Product> GetProductByName(string Name ) { // return a List }
overloaded way:
public List<Product> GetProducts() { // return a List of all products }
public List<Product> GetProducts(Category category) { // return a List by Category }
public List<Product> GetProducts(string searchString ) { // return a List by search string }
I realize you may get into a problem with **similar signatures**, but if you're passing objects instead of base types (string, int, char, DateTime, etc) this will be less of an issue. So... is it a good idea to **overload a method** to reduce the number of methods you have and for clarity, **or** should **each method** that filters the data a different way **have a different method name**?
| 0 | [
2,
2109,
84,
16866,
9,
92,
42,
84,
3699,
32,
60,
800,
3726,
3726,
98,
22,
18,
574,
1345,
76,
14684,
238,
3195,
30,
788,
14,
205,
2539,
16,
1054,
29,
421,
21062,
60,
14990,
2109,
1817,
54,
84,
22546,
3195,
60,
26,
823,
9,
100,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CodeRush Xpress Colors
===
I downloaded the free CodeRush Xpress version to try it. Is there a way to change the colors it uses for it's highlighting and line drawing? ie the matching braces. I have a dark color scheme and my monitor I have VS on must suck because I can't see the lines. Yet on the LCD I can. Is there a way to change the colors? | 0 | [
2,
1797,
15770,
993,
5890,
5268,
800,
3726,
3726,
31,
23887,
14,
551,
1797,
15770,
993,
5890,
615,
20,
1131,
32,
9,
25,
80,
21,
161,
20,
753,
14,
5268,
32,
2027,
26,
32,
22,
18,
23102,
17,
293,
3533,
60,
13,
660,
14,
10120,
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... |
Tool to find duplicate sections in a text (XML) file?
===
I have an XML file, and I want to find nodes that have duplicate CDATA. Are there any tools that exist that can help me do this?
I'd be fine with a tool that does this generally for text documents. | 0 | [
2,
5607,
20,
477,
19429,
4501,
19,
21,
1854,
13,
5,
396,
8184,
6,
3893,
60,
800,
3726,
3726,
31,
57,
40,
23504,
3893,
15,
17,
31,
259,
20,
477,
16272,
30,
57,
19429,
1745,
4375,
9,
50,
80,
186,
4672,
30,
3182,
30,
92,
448,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ruby support for namespaces
===
I work at a small company and our production system uses a hand-rolled RESTful API, implemented in Java with JAXB. We now find that we're taking on customers who use Ruby on Rails, and I have to come up with a reference implementation to show customers how to use our API in Ruby. I'd love to be able to just tell them to use ActiveResource, but the XML required by our API uses (and absolutely requires) namespaces. Unfortunately, we've already got a number of other customers who've already integrated this API, so removing the usage of namespaces is out of the question. What's the best way to generate XML with namespaces in Ruby ? | 0 | [
2,
10811,
555,
26,
204,
5582,
18,
800,
3726,
3726,
31,
170,
35,
21,
284,
237,
17,
318,
637,
329,
2027,
21,
224,
8,
8694,
69,
760,
1566,
21,
2159,
15,
6807,
19,
8247,
29,
11712,
220,
9,
95,
130,
477,
30,
95,
22,
99,
741,
27,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to solve this compatibility-problem regarding large file support?
===
A library using off\_t as a parameter for one function (seek). Library and application are compiled differently, one with large file support switched off, the other with large file support. This situation results in strange runtime errors, because both interpret off\_t differently. How can the library check at runtime the size of off\_t for the app? Or is there another solution, so that at least the user gets a meaningful error? | 0 | [
2,
184,
20,
8402,
48,
13,
21618,
8,
2740,
2854,
79,
3467,
370,
3893,
555,
60,
800,
3726,
3726,
21,
1248,
568,
168,
1,
38,
28,
21,
18906,
26,
53,
1990,
13,
5,
1798,
197,
6,
9,
1248,
17,
3010,
50,
9316,
12670,
15,
53,
29,
370,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is RIGHT JOIN Ever Required?
===
Do any queries exist that require RIGHT JOIN, or can they always be re-written with LEFT JOIN? | 0 | [
2,
25,
193,
1865,
462,
1390,
60,
800,
3726,
3726,
107,
186,
9386,
2829,
3182,
30,
4077,
193,
1865,
15,
54,
92,
59,
550,
44,
302,
8,
6390,
29,
225,
1865,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Stateful tail (only shows the new lines from the last execution)
===
I want to be able to see how many lines were added to a file since the last quering without reading the whole file again.
Something like :
ptail my_file | fgrep "[ERROR]" | wc -l
A solution in simple Perl would be prefered, since I don't have an easy access to a compiler. | 0 | [
2,
146,
1566,
3424,
13,
5,
4965,
1285,
14,
78,
1560,
37,
14,
236,
5769,
6,
800,
3726,
3726,
31,
259,
20,
44,
777,
20,
196,
184,
151,
1560,
46,
905,
20,
21,
3893,
179,
14,
236,
13,
8190,
68,
366,
1876,
14,
979,
3893,
188,
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... |
Why can't I declare C# methods virtual and static?
===
I have a helper class that is just a bunch of static methods and would like to subclass the helper class. Some behavior is unique depending on the subclass so I would like to call a virtual method from the base class, but since all the methods are static I can't create a plain virtual method (need object reference in order to access virtual method).
Is there any way around this? I guess I could use a singleton.. HelperClass.Instance.HelperMethod() isn't so much worse than HelperClass.HelperMethod(). Brownie points for anyone that can point out some languages that support virtual static methods. | 0 | [
2,
483,
92,
22,
38,
31,
10123,
272,
5910,
3195,
6599,
17,
12038,
60,
800,
3726,
3726,
31,
57,
21,
448,
106,
718,
30,
25,
114,
21,
7653,
16,
12038,
3195,
17,
83,
101,
20,
972,
1898,
14,
448,
106,
718,
9,
109,
3257,
25,
2619,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Windows FTP client with SOCKS support
===
Does anybody know of a Windows FTP client with SOCKS support?
I need it to build a deployment script... I tried Filezilla but its command-line support seems quite poor, I need something completely non-interactive. | 0 | [
2,
1936,
1187,
306,
6819,
29,
17188,
555,
800,
3726,
3726,
630,
11181,
143,
16,
21,
1936,
1187,
306,
6819,
29,
17188,
555,
60,
31,
376,
32,
20,
1895,
21,
10475,
3884,
9,
9,
9,
31,
794,
3893,
380,
3247,
47,
82,
1202,
8,
1143,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... |
ASP.NET MVC framework port for Java EE?
===
So I've played some with the new, not yet final release of ASP.NET MVC framework and I find it to be very nice and elegant. However at work we are tied to Java for the time being, so I'm wondering this: is there a port of the framework out there for Java people like myself? I realize that webforms isn't going to be available unfortunately but what about the routing framework?
/Adam | 0 | [
2,
28,
306,
9,
2328,
307,
8990,
6596,
1295,
26,
8247,
13,
2851,
60,
800,
3726,
3726,
86,
31,
22,
195,
257,
109,
29,
14,
78,
15,
52,
768,
426,
830,
16,
28,
306,
9,
2328,
307,
8990,
6596,
17,
31,
477,
32,
20,
44,
253,
2210,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Count number of Mondays in a given date range
===
Given a date range, I need to know how many Mondays (or Tuesdays, Wednesdays, etc) are in that range.
I am currently working in C#. | 0 | [
2,
2468,
234,
16,
5745,
18,
19,
21,
504,
1231,
978,
800,
3726,
3726,
504,
21,
1231,
978,
15,
31,
376,
20,
143,
184,
151,
5745,
18,
13,
5,
248,
9369,
18,
15,
8885,
18,
15,
2722,
6,
50,
19,
30,
978,
9,
31,
589,
871,
638,
19,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
APIs in C# for grabbing CPU IDs and drive volume IDs
===
I'm aware that I can grab the CPU identifier and the volume ID for a physical drive by querying WMI, but WMI usually takes its sweet time. What other speedier options, if any, are available to retrieve this information? Are there Win32 APIs that would accomplish this? | 0 | [
2,
21,
8954,
19,
272,
5910,
26,
9910,
17578,
13,
9178,
17,
1493,
2310,
13,
9178,
800,
3726,
3726,
31,
22,
79,
3854,
30,
31,
92,
4931,
14,
17578,
25570,
17,
14,
2310,
4924,
26,
21,
1825,
1493,
34,
25597,
68,
619,
1435,
15,
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... |
Where can I find a step-by-step guide (tutorial) on how to migrate a webb site to a wep app?
===
I have an ASP.NET website and I need to migrate it to a web application. I have not had much luck so far. How do I figure out how to do this? | 0 | [
2,
113,
92,
31,
477,
21,
1424,
8,
779,
8,
8375,
3378,
13,
5,
2473,
9819,
192,
6,
27,
184,
20,
22985,
21,
10192,
689,
20,
21,
95,
306,
4865,
60,
800,
3726,
3726,
31,
57,
40,
28,
306,
9,
2328,
2271,
17,
31,
376,
20,
22985,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do i update a table column based on a condition?
===
Two table:
StoreInfo:
UserId uniqueidentifier
StoreNo nvarchar
UserName nvarchar
Password nvarchar
UserInfo:
UserId uniqueidentifier
UserName nvarchar
Password nvarchar
the UserId on StoreInfo is currently null. How do i update StoreInfo's UserId with UserInfo's UserId based on StoreInfo's UserName and Password is match to the UserName and Password from UserInfo.
the following is the query that i wrote which update the entire UserId in StoreInfo with the first UserId from UserInfo so i know it's wrong. Can someone help a tsql noob out?
declare @UserName nvarchar(255)
declare @Password nvarchar(25)
declare @UserId uniqueidentifier
select @UserName = UserName, @Password = Password, @UserId = UserId
from UserInfo
select UserI, UserID, Password from FranchiseInfo where UserID = @UserName and Password = @Password
update FranchiseInfo
set UserI = @UserId | 0 | [
2,
184,
107,
31,
11100,
21,
859,
4698,
432,
27,
21,
2874,
60,
800,
3726,
3726,
81,
859,
45,
1718,
108,
4120,
45,
275,
5175,
2619,
13384,
16292,
1718,
251,
13,
103,
3311,
5433,
4155,
7259,
13,
103,
3311,
5433,
20884,
13,
103,
3311,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Strange behaviour when dynamically resizing Flash / Flex embed object
===
I have a simple Flex application that is a panel with a repeater inside of it; albeit a little simplified, it is like such:
<pre>
<code>
<mx:Panel id="pnl">
<mx:Repeater id="rp">
<mx:Label text = "foo" />
</mx:Repeater>
</mx:Panel>
</code>
</pre>
I am then embedding this Flex application into an HTML wrapper. I am then attempting to dynamically re size the embedded Flash object in the HTML as the Flex panel changes size (thus allowing the Flex application to consume as much of the HTML page as it needs).
I am doing this by doing the following actionscipt:
<pre>
<code>
pnl.addEventListener(ResizeEvent.RESIZE,function(event:Event):void {
ExternalInterface.call("resize",event.target.height);
});
</code>
</pre>which in turn calls this javascript function:
<pre>
<code>
function resize(height) {
// the embed or object that contains the flex app
var e = document.getElementById('flex_object');
if(e) e.height = height;
}
</code>
</pre>
This seems to work perfect in IE, however I get strange results in Firefox / Safari, the repeater works for *n* number of times, and then the text seems to get cut off / disappear in the repeater, see the attached image:
![alt text][1]
Can anyone explain why this is happening, and if there are any workarounds / ways of doing the same thing?
[1]: http://img528.imageshack.us/img528/9538/rpre0.jpg | 0 | [
2,
2578,
7727,
76,
7782,
1326,
10719,
3335,
4433,
13,
118,
14409,
11911,
69,
3095,
800,
3726,
3726,
31,
57,
21,
1935,
14409,
3010,
30,
25,
21,
4113,
29,
21,
6830,
106,
572,
16,
32,
73,
15080,
21,
265,
13,
11268,
15,
32,
25,
101,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best DirectSound specific book for .NET?
===
I'm looking for the best single book for implementing DirectSound solution with .NET (C# preferred). If I had 1 book to buy, it would be this one.
It can be overall DirectX, but I will only care about DirectSound.
Also, if there are any good upcoming books about XAudio2, love to hear about that too! | 0 | [
2,
246,
1744,
8489,
1903,
360,
26,
13,
9,
2328,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
14,
246,
345,
360,
26,
17333,
1744,
8489,
4295,
29,
13,
9,
2328,
13,
5,
150,
5910,
5981,
6,
9,
100,
31,
41,
137,
360,
20,
3034,
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... |
Using "this" with jQuery Selectors.
===
I have some HTML that looks like this:
<ul class="faq">
<li class="open">
<a class="question" href="">This is my question?</a>
<p>Of course you can, it will be awesome. </p>
</li>
</ul>
Using CSS I'm setting the 'p' tag to display:none;. I want to use jQuery to display or hide the 'p' tag when the anchor is clicked, but I'm having some troubles with the sibling selector.
Just trying to get the selector working, I tried:
$("a.question").click(function () {
$(this + " ~ p").css("background-color", "red");
});
to test it out. Seemingly, the sibling selector can't really be used like that, and as I'm completely new to jQuery I don't know the appropriate means to make that happen.
Thanks in advance! | 0 | [
2,
568,
13,
7,
1565,
7,
29,
487,
8190,
93,
23946,
18,
9,
800,
3726,
3726,
31,
57,
109,
13,
15895,
30,
1879,
101,
48,
45,
13,
1,
1287,
718,
3726,
7,
1473,
1251,
7,
1,
13,
1,
1210,
718,
3726,
7,
10157,
7,
1,
13,
1,
58,
718... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 storage for SQL SERVER 2000 ?
===
I want to access my sql server database files in a INTEL SS4000-E storage. It´s a NAS Storage. Could it be possible to work with it as a storage for sql server 2000? If not, what is the best solution? | 0 | [
2,
98,
13,
18,
14,
246,
4326,
26,
4444,
255,
8128,
824,
13,
60,
800,
3726,
3726,
31,
259,
20,
1381,
51,
4444,
255,
8128,
6018,
6488,
19,
21,
14635,
13,
18,
18,
300,
3993,
8,
62,
4326,
9,
32,
13,
18,
21,
7938,
4326,
9,
110,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way of executing tasks in parallel in Ksh, Perl?
===
I have this large C++ project that I need to build on a platform that does not have a parallel make (like make -j on Linux). The server has 6 CPU's and I want to do a parallel build manually.
I can generate a task list like this for about 300 object files: (I use the Makefile for the dependency checks and incremental build.)
make -f Makefile obj1.o
make -f Makefile obj2.o
make -f Makefile obj3.o
...
How would I execute these tasks in parallel with no more then 6 tasks running at a time using Ksh, Perl? (Java or Python are not available :-( )
| 0 | [
2,
246,
161,
16,
25836,
8674,
19,
3821,
19,
680,
1635,
15,
416,
255,
60,
800,
3726,
3726,
31,
57,
48,
370,
272,
20512,
669,
30,
31,
376,
20,
1895,
27,
21,
2452,
30,
630,
52,
57,
21,
3821,
233,
13,
5,
1403,
233,
13,
8,
728,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Config values in DB or File?
===
I have some configuration values for an asp.net web app. They will be maintained by a system admin once the system goes live. Should I store these values in the database or in a config file? Is there a best practice for this sort of thing?
| 0 | [
2,
13,
14093,
2816,
4070,
19,
13,
9007,
54,
3893,
60,
800,
3726,
3726,
31,
57,
109,
8091,
4070,
26,
40,
28,
306,
9,
2328,
2741,
4865,
9,
59,
129,
44,
3926,
34,
21,
329,
21,
43,
2160,
382,
14,
329,
1852,
515,
9,
378,
31,
1718... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
"spurious" leading in latex
===
the following latex input:
\rule{1cm}{1cm}\\
\rule{1cm}{1cm}
leaves a gap of about .35mm between the boxes. what is the length that defines this gap? | 0 | [
2,
13,
7,
18,
2051,
5907,
7,
1005,
19,
456,
396,
800,
3726,
3726,
14,
249,
456,
396,
6367,
45,
13,
1,
16154,
1,
165,
9095,
1,
165,
9095,
1,
13,
1,
16154,
1,
165,
9095,
1,
165,
9095,
1,
2084,
21,
4127,
16,
88,
13,
9,
2599,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Winform create table in RichTextBox control
===
I need to create a simple editor using a RichTextBox control in a windows forms application that includes the ability to create tables.
Is it possible to create a table in a RichTextBox control?
If so, any pointers on the best way to do this would be appreciated. | 0 | [
2,
628,
4190,
1600,
859,
19,
2042,
11969,
5309,
569,
800,
3726,
3726,
31,
376,
20,
1600,
21,
1935,
1835,
568,
21,
2042,
11969,
5309,
569,
19,
21,
1936,
1997,
3010,
30,
1103,
14,
2165,
20,
1600,
7484,
9,
25,
32,
938,
20,
1600,
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... |
Functional body of a program
===
Sorry if this question is too "silly"...
But I need to know what the "functional body" of a program is, and I can't find it in the web.. Can any body help me?
I thought it was its functions' prototypes, is it?
Thank you very much!
alcuadrado | 0 | [
2,
7652,
358,
16,
21,
625,
800,
3726,
3726,
1875,
100,
48,
1301,
25,
266,
13,
7,
18,
11802,
7,
9,
9,
9,
47,
31,
376,
20,
143,
98,
14,
13,
7,
27983,
358,
7,
16,
21,
625,
25,
15,
17,
31,
92,
22,
38,
477,
32,
19,
14,
2741... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I change the locale that Jasper uses?
===
The windows installed on my machine has the locale en_AU and that's what Japer uses. I already tried changing the locale of all users, including the Administrator but it still uses en_AU.
How can I change that locale? Is it possible to change the REPORT_LOCALE parameter on my report? | 0 | [
2,
184,
107,
31,
753,
14,
375,
62,
30,
16750,
2027,
60,
800,
3726,
3726,
14,
1936,
4066,
27,
51,
1940,
63,
14,
375,
62,
1957,
1,
1346,
17,
30,
22,
18,
98,
3009,
1432,
2027,
9,
31,
614,
794,
4226,
14,
375,
62,
16,
65,
3878,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 create a javascript badge or widget?
===
I want to create a javascript badge that displays a list of links. We host the javascript on our domain. Other sites can put an empty div tag on their page and at the bottom a reference to our javascript that would render the content in the div tag. How do you implement something like this? | 0 | [
2,
184,
92,
31,
1600,
21,
8247,
8741,
8715,
54,
4807,
43,
3060,
60,
800,
3726,
3726,
31,
259,
20,
1600,
21,
8247,
8741,
8715,
30,
9412,
21,
968,
16,
6271,
9,
95,
2015,
14,
8247,
8741,
27,
318,
4603,
9,
89,
3259,
92,
442,
40,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Java GUI LayoutManagers
===
I'm busy with an asignment where i have to make a graphical interface for a simple program. But i'm strugling with the layout.
This is the idea:
![Layout Example][1]
What is the easiest way to accomplish such a layout?
And what method do you use to make layouts in java. Just code it, or use an IDE like netbeans?
[1]: http://www.freeimagehosting.net/uploads/6efb4b544f.png "Layout Example"
| 0 | [
2,
8247,
9457,
9106,
22256,
18,
800,
3726,
3726,
31,
22,
79,
4394,
29,
40,
21,
11255,
1130,
113,
31,
57,
20,
233,
21,
21755,
6573,
26,
21,
1935,
625,
9,
47,
31,
22,
79,
13,
11602,
263,
802,
29,
14,
9106,
9,
48,
25,
14,
882,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I find out which line of which stored procedure an error occurred on?
===
When I try to run a particular stored procedure on my MS SQL 2005 database, I get an error like the following:
Subquery returned more than 1 value. This is not permitted when
the subquery follows =, !=, <, <= , >, >= or when the subquery
is used as an expression
The SP in query is very long and calls other SPs. This error is obviously being produced by SQL itself, and returned all the way up the call stack, but without mentioning which SP or line number caused the problem. How can I find out from where the error was thrown so I can debug it more easily? | 0 | [
2,
184,
107,
31,
477,
70,
56,
293,
16,
56,
8214,
7004,
40,
7019,
2437,
27,
60,
800,
3726,
3726,
76,
31,
1131,
20,
485,
21,
1498,
8214,
7004,
27,
51,
4235,
4444,
255,
812,
6018,
15,
31,
164,
40,
7019,
101,
14,
249,
45,
972,
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... |
What's the best open source Ruby on Rails project to learn from?
===
I am a .net developer who would like to learn more about Ruby on Rails. I have followed the 5-minute(?!) marketware tutorials, etc, out on the rails site, but would like to learn more by reading real live code.
So what's the best open source resource for learning about RoR in depth? | 0 | [
2,
98,
22,
18,
14,
246,
368,
1267,
10811,
27,
2240,
18,
669,
20,
2484,
37,
60,
800,
3726,
3726,
31,
589,
21,
13,
9,
2328,
10058,
72,
83,
101,
20,
2484,
91,
88,
10811,
27,
2240,
18,
9,
31,
57,
709,
14,
331,
8,
5556,
5,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Workflow Tools Comparison?
===
There is a pretty strong need for us to design some workflows around various processes. The problem is none of us actually know any workflow technology yet, and finding good data to compare the available options has been tedious and not entirely fruitful.
So I figured I'd ask you guys.
The main technologies we are looking at are Windows Workflow Foundation and eDocs Workflow. What other options are there? Sharepoint 2007 has workflow functionality too, right? Is that just based on WWF?
What are the pros and cons of the various technologies? How do they compare?
| 0 | [
2,
170,
9990,
4672,
6050,
60,
800,
3726,
3726,
80,
25,
21,
1772,
966,
376,
26,
182,
20,
704,
109,
170,
9990,
18,
140,
617,
5102,
9,
14,
1448,
25,
2369,
16,
182,
1121,
143,
186,
170,
9990,
1099,
768,
15,
17,
3007,
254,
1054,
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... |
Batch File
===
I am writing a batch file script using Windows command and want to change each occurrence of some blank space with "," What is the simplest way to do that? | 0 | [
2,
13064,
3893,
800,
3726,
3726,
31,
589,
1174,
21,
13064,
3893,
3884,
568,
1936,
1202,
17,
259,
20,
753,
206,
12933,
16,
109,
6463,
726,
29,
13,
7,
15,
7,
98,
25,
14,
24384,
161,
20,
107,
30,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
MDX: Calculated Dimensions?
===
I don't know if this is possible or not, or if my limited knowledge of MDX is pushing me in the wrong direction...
The cube I'm dealing with has two different dimensions for dates, [Statement Dates] and [Premium Dates]. Further in the hierarchy of each looks like this:
[Statement Dates].[Statement Year].[2008]
[Premium Dates].[Premium Year].[2008]
For the business logic I'm implementing I need to do something like:
select
({ [Measures].[Commission] }) on columns,
({[Products].[Product Category]}) on rows
from [Cube]
where
(
IIF( [Products].[Product Category].CurrentMember.Name = "Some Category",
[Statement Dates].[Statement Year].[2008], [Payment Dates].[Payment Year].[2008])
)
So I need it to discriminate what dimension to use for filtering the year based on what product category is being used.
This parses ok and the query runs, but the numbers seem to suggest that the IIF statement is always returning false.
| 0 | [
2,
8138,
396,
45,
10785,
9913,
60,
800,
3726,
3726,
31,
221,
22,
38,
143,
100,
48,
25,
938,
54,
52,
15,
54,
100,
51,
1317,
1918,
16,
8138,
396,
25,
5076,
55,
19,
14,
1389,
1400,
9,
9,
9,
14,
13682,
31,
22,
79,
5746,
29,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Please recommend an open source projects with quality comments in good english
===
English is not my mother tongue. However, I have to write comments in english. I want to improve my "comment english" by studying a piece of code which is commented in a good english. Please recommend an open source project which contains a lot of meaningful comments written by people with an excellent command of the language. | 0 | [
2,
2247,
12360,
40,
368,
1267,
2314,
29,
2190,
7534,
19,
254,
486,
800,
3726,
3726,
486,
25,
52,
51,
449,
2561,
9,
207,
15,
31,
57,
20,
2757,
7534,
19,
486,
9,
31,
259,
20,
3545,
51,
13,
7,
960,
1130,
486,
7,
34,
4493,
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... |
Finding non-prime numbers in C++
===
So I have a range of random number. The range is actually determined by the user but it will be up to 1000 integers. They are placed in this:
vector<int> n
and the values are inserted like this:
srand(1);
for (i = 0; i < n; i++)
v[i] = rand() % n;
So I'm creating a separate function to find all the non prime values. Here is what I have now but I know it's completely wrong as I get both prime and non prime in the series.
void sieve(vector<int> v, int n)
{
int i,j;
for(i = 2; i <= n; i++)
{
cout << i << " % ";
for(j = 0; j <= n; j++)
{
if(i % v[j] == 0)
cout << v[j] << endl;
}
}
}
So this method typically worked when I just had a series of numbers from 1-1000, but it doesn't seem to be working now when I have numbers out of order and there are duplicates. Is there a better method to find non prime numbers in a vector that I'm not thinking of? I'm tempted to just create another vector, fill it with n amount of numbers and just find the non prime numbers that way but I wonder if that would be ineffecient? | 0 | [
2,
3007,
538,
8,
21108,
2116,
19,
272,
20512,
800,
3726,
3726,
86,
31,
57,
21,
978,
16,
5477,
234,
9,
14,
978,
25,
1121,
2734,
34,
14,
4155,
47,
32,
129,
44,
71,
20,
6150,
13820,
18,
9,
59,
50,
1037,
19,
48,
45,
7497,
1,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
java thread question
===
I have some thread-related questions , assuming the following code (please ignore the possible inefficiency of the code,I'm only interested in the thread part):
<pre><code>
//code without thread use
public static int getNextPrime(int from) {
int nextPrime = from+1;
boolean superPrime = false;
while(!superPrime) {
boolean prime = true;
for(int i = 2;i < nextPrime;i++) {
if(nextPrime % i == 0) {
prime = false;
}
}
if(prime) {
superPrime = true;
}
else {
nextPrime++;
}
}
return nextPrime;
}
public static void main(String[] args) {
int primeStart = 5;
ArrayList list = new ArrayList();
for(int i = 0;i < 10000;i++) {
list.add(primeStart);
primeStart = getNextPrime(primeStart);
}
}
</code></pre>
If I'm running the code like this , it takes about 56 seconds . If,however,I have the following code ( as an alternative ) :
<pre><code>
public class PrimeRunnable implements Runnable {
private int from;
private int lastPrime;
public PrimeRunnable(int from) {
this.from = from;
}
public boolean isPrime(int number) {
for(int i = 2;i < from;i++) {
if((number % i) == 0) {
return false;
}
}
lastPrime = number;
return true;
}
public int getLastPrime() {
return lastPrime;
}
public void run() {
while(!isPrime(++from))
;
}
}
public static void main(String[] args) {
int primeStart = 5;
ArrayList list = new ArrayList();
for(int i = 0;i < 10000;i++) {
PrimeRunnable pr = new PrimeRunnable(primeStart);
Thread t = new Thread(pr);
t.start();
t.join();
primeStart = pr.getLastPrime();
list.add(primeStart);
}
}
</code></pre>
the whole operation takes about 7 seconds . I am almost certain that even though I only create one thread at a time , a thread doesn't always finish when another is created . Is that right ? I am also curious : why is the operation ending so fast ?
Another question would be :
- when I'm joining a thread , do other threads keep running in the background , or is the joined thread the only one that's running ? | 0 | [
2,
8247,
9322,
1301,
800,
3726,
3726,
31,
57,
109,
9322,
8,
6203,
2346,
13,
15,
11704,
14,
249,
1797,
13,
5,
6744,
7174,
14,
938,
19,
9039,
9198,
8883,
16,
14,
1797,
15,
49,
22,
79,
104,
3158,
19,
14,
9322,
141,
6,
45,
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... |
Thread safety of Matlab engine API
===
I have discovered through trial and error that the MATLAB engine function is not completely thread safe.
Does anyone know the rules?
Here is one I have discovered in Windows (not tested in UNIX):
- `engOpenSingleUse` and `engClose` must be called from the same thread.
- It appears to be safe to call `engOutputBuffer`, `engEvalString`, `engPutVariable`, and `engGetVariable` from a different thread than `engOpenSingleUse`. I have not tried calling them concurrently. | 0 | [
2,
9322,
2108,
16,
4277,
9086,
1406,
21,
2159,
800,
3726,
3726,
31,
57,
1848,
120,
2178,
17,
7019,
30,
14,
4277,
9086,
1406,
1990,
25,
52,
1524,
9322,
1834,
9,
630,
1276,
143,
14,
1761,
60,
235,
25,
53,
31,
57,
1848,
19,
1936,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Global.asax and handling exceptions that occur in spawned Threads
===
I have an exception handler .
In my asp.net application.
It’s written in Global.asax.
In the the Application_Error() method.
It works for Exceptions that happen in the context of pages and classes that are called as a result of a request to the application.
But if I spawn a thread, as a result of a request (or other reason, like an application-based timer), and an Exception in that thread.
It isn’t handled by the Global.asax.
It causes Asp.net’s worker process to kill my application.
Dead.
If I plug into the AppDomain.CurrentDomain.UnhandledException handler, I see the exception that occurs in my Thread, but alas, this is too late.
And the application still dies.
Dead.
Any advice?
| 0 | [
2,
2062,
9,
8588,
396,
17,
7988,
13392,
30,
3744,
19,
21305,
20396,
800,
3726,
3726,
31,
57,
40,
5391,
24641,
13,
9,
19,
51,
28,
306,
9,
2328,
3010,
9,
32,
1,
18,
642,
19,
2062,
9,
8588,
396,
9,
19,
14,
14,
3010,
1,
29992,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best Practice for following Subversion repository Trunk: Git (Mirror), Git-Svn, Subversion?
===
I want to checkout, and then update as necessary, the [Django Subversion trunk][1] on a Mac OS X Leopard 10.5.5 machine.
I am only interested in having updated Django code on my Mac. I am not interested in contributing patches to the Django project. I do not need the Subversion history for the Django trunk.
I plan to use Git as the DVCS/SCM for all of my personal projects.
----------
**What is the best practice for keeping my Mac updated with the latest Django trunk and why?**
I am new to Git so understanding why you chose your option will be very helpful.
<p>
1. Use Subversion 1.4.4 installed on my Mac: svn co [http://code.djangoproject.com/svn/django/trunk/][2]. Essentially using Subversion to fetch Subversion repos and Git for my personal projects.
2. Use Git SVN to fetch the [Django Subversion repo][3]. Instructions on how to do this for a Git newbie?
3. Use Git to fetch a [Git mirror of the Django repo][4]. I'm a little concerned that the mirror might go away in the future, but I'm willing to use it if it's the best option.
[1]: http://code.djangoproject.com/
[2]: http://code.djangoproject.com/svn/django/trunk/
[3]: http://code.djangoproject.com/svn/django/trunk/
[4]: http://spinlock.ch/pub/git/?p=django/django.git;a=summary | 0 | [
2,
246,
1345,
26,
249,
972,
10898,
24869,
6436,
45,
13,
10404,
13,
5,
8635,
139,
248,
6,
15,
13,
10404,
8,
18,
16578,
15,
972,
10898,
60,
800,
3726,
3726,
31,
259,
20,
2631,
1320,
15,
17,
94,
11100,
28,
2378,
15,
14,
636,
1436... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 improve cold startup performance for a VSTO2SE MS Office add-in?
===
If you create a simple "Hello World" VSTO2SE add-in targeting Microsoft Office Excel 2003, it takes 15 seconds to load on a cold startup. During that time, Excel is completely unresponsive.
The cold-startup time is always poor in Excel 2003. I have seen one test machine where the startup time is instant in Excel 2007, but all my other test machines take 15 seconds to initialize. (test environment - windows xp pro + VSTO2SE runtime + XP SP3)
How can this performance be improved?
Things I've already tried with no success:
1. Disasble CRL (certificate revoke list) checking - this doesn't seem to help, plus I can't expect users to do this.
2. Use NGEN to create native assemblies.
a) It seems that Office 2003 never uses the native assemblies.
b) My office 2007 test client that starts fast, does so even with IL assemblies.
c) Even if I NGEN my entire depencency tree, there are still VSTO dependencies that may not have native images.
3. Delay load the add-in - this is the workaround "stock response" i get from Microsoft. The thing is, my add-in is launched from a menu item - how can I delay load the add-in and still get my menus? I could use a VB6 add-in to draw the menus and forward the calls via interop, but then why would I even write a VSTO add-in in the first place? | 0 | [
2,
184,
92,
31,
3545,
1191,
20205,
956,
26,
21,
4611,
262,
135,
870,
4235,
488,
3547,
8,
108,
60,
800,
3726,
3726,
100,
42,
1600,
21,
1935,
13,
7,
11515,
126,
7,
4611,
262,
135,
870,
3547,
8,
108,
15972,
7099,
488,
20700,
973,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Total download size of *initial* page of major websites
===
I'm quite surprised how large some major websites homepages are.
This is the total amount downloaded just when opening the homepage.
cnn.com - 845kb
microsoft.com - 470kb
yahoo.com - 235kb
gillette.com (flash) - 3.8Mb
abc.com - 3.4Mb
nbc.com - 1.4Mb
youtube.com - 530kb
Anyone care to add to the list? I'm just trying to justify the size of a site by comparing it to major sites out there. Obviously some of these sites are quite media intensive and wouldn't be much fun at 200kb. Im quite surprised how huge some sites actually are.
To do this I used [fiddler][1]. **Clear your cache first**, go to the site, select all the items in fiddler and under the 'statistics' tab it will show the total.
[1]: http://fiddlertool.com | 0 | [
2,
600,
7121,
1072,
16,
1637,
27313,
2483,
2478,
16,
394,
13931,
800,
3726,
3726,
31,
22,
79,
1450,
2948,
184,
370,
109,
394,
13931,
213,
6486,
18,
50,
9,
48,
25,
14,
600,
2006,
23887,
114,
76,
1214,
14,
213,
6486,
9,
14429,
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... |
Hooking into Windows with C# to Produce Windows 7 New Feature
===
I just saw a really useful UI feature of the forthcoming Windows 7 ( visit <http://www.gizmodo.com.au/2008/10/windows_7_walkthrough_boot_video_and_impressions-2.html> and scroll down to the video entitled Super Scientific Video of New Window Resizing Feature)
In a nutshell you can drag a window by the title bar to the top of the screen to maximise it, drag it back down to restore and drag it to the left edge or the right edge of the screen to have it snap into position butted up against the edge you dragged it to, and resized to occupy half the screen.
Now I know there are a bunch of keyboard-based apps that do "similar" things but I've not seen a mouse-based program that does JUST the above, simple, useful and nothing more. If you know of one (or are smart enough to write one) please post the URL :)
Anyway, if I wanted to try and write a small app to do this I have a question:
**If I wanted to try and write a small app to do this, could I write it as a .NET app? I guess hooking into Windows' window drag/drop handling is pretty low-level and maybe not something that could be done in C#.NET?**
*any smartypants here who can knock a small app like this out in their lunchbreak? ;) I'm sure anything mimicing Windows 7 features would prove very popular, at least pre Windows 7's launch.*
| 0 | [
2,
5559,
68,
77,
1936,
29,
272,
5910,
20,
2213,
1936,
453,
78,
1580,
800,
3726,
3726,
31,
114,
441,
21,
510,
4811,
13,
5661,
1580,
16,
14,
19978,
1936,
453,
13,
5,
2139,
13,
1,
21127,
6903,
6483,
9,
2234,
380,
1293,
537,
9,
96... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP.NEt Parsing raw HTML into Controls
===
Is it possible in ASP.NET to take a string containing some HTML and make ASP.NET to parse it and create a Control for me? For example:
string rawHTML = "<table><td><td>Cell</td></tr></table>";
HTMLTable table = MagicClass.ParseTable(rawHTML);
I know that this is a bad thing to do but I am in the unfortunate situation that this is really the only way I can achieve what I need (as I cannot modify this particular coworker's code).
Also, I know that LiteralControl allows you to have a control with arbitrary HTML in it, but unfortunately I need to have them converted to proper control.
Thanks. | 0 | [
2,
28,
306,
9,
2328,
2017,
18,
68,
4333,
13,
15895,
77,
8671,
800,
3726,
3726,
25,
32,
938,
19,
28,
306,
9,
2328,
20,
247,
21,
3724,
3503,
109,
13,
15895,
17,
233,
28,
306,
9,
2328,
20,
2017,
870,
32,
17,
1600,
21,
569,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.