unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Why is there a gap between my image and its containing box?
===
When my browser renders the following test case, there's a gap below the image. From my understanding of CSS, the bottom of the blue box should touch the bottom of the red box. But that's not the case. Why?
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head><title>foo</title></head>
<body>
<div style="border: solid blue 2px; padding: 0px;">
<img alt='' style="border: solid red 2px; margin: 0px;"
src="http://stackoverflow.com/Content/Img/stackoverflow-logo-250.png" />
</div>
</body>
</html>
| 0 | [
2,
483,
25,
80,
21,
4127,
128,
51,
1961,
17,
82,
3503,
1649,
60,
800,
3726,
3726,
76,
51,
16495,
16535,
18,
14,
249,
1289,
610,
15,
80,
22,
18,
21,
4127,
1021,
14,
1961,
9,
37,
51,
3260,
16,
272,
18,
18,
15,
14,
2129,
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... |
Passing Exceptions to an error screen in ASP.net/C#
===
Coming from a desktop background I'm not sure exactly how to pass the exceptions I have caught to an Error page in order to avoid the standard exception screen being seen by my users.
My general question is how do I pass the exception from page X to my Error page in ASP.net? | 0 | [
2,
2848,
13392,
20,
40,
7019,
2324,
19,
28,
306,
9,
2328,
118,
150,
5910,
800,
3726,
3726,
880,
37,
21,
17404,
2395,
31,
22,
79,
52,
562,
1890,
184,
20,
1477,
14,
13392,
31,
57,
1383,
20,
40,
7019,
2478,
19,
389,
20,
2658,
14,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What user-installed applications cause the most trouble when developing a PC-based application?
===
I work on windows-based PC applications and have run across issues with Pop-up blockers, Anti-virus and firewall issues breaking my application (some are web applications with ActiveX and others are .NET Winforms)
Listening to our support staff, there are other applications that users install and use that have caused issues with our applications. What unexpected issues have you run across related to incompatible programs with your application and what are the 'offending' applications? (or maybe your application has been one of the 'offenders')
What components/applications do you install in your test systems to ensure that there are not compatibility issues? | 0 | [
2,
98,
4155,
8,
108,
21300,
69,
3767,
1679,
14,
127,
2572,
76,
3561,
21,
5168,
8,
1281,
3010,
60,
800,
3726,
3726,
31,
170,
27,
1936,
8,
1281,
5168,
3767,
17,
57,
485,
464,
1549,
29,
1675,
8,
576,
1921,
445,
15,
1082,
8,
14792... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 output progress messages from a SELECT statement?
===
I have a SQL script that I want to output progress messages as it runs. Having it output messages between SQL statements is easy, however I have some very long running INSERT INTO SELECTs. Is there a way to have a select statement output messages as it goes, for example after every 1000 rows, or every 5 seconds?
Note: This is for SQL Anywhere, but answers in any SQL dialect will be fine. | 0 | [
2,
184,
107,
31,
5196,
3455,
7561,
37,
21,
5407,
3331,
60,
800,
3726,
3726,
31,
57,
21,
4444,
255,
3884,
30,
31,
259,
20,
5196,
3455,
7561,
28,
32,
1461,
9,
452,
32,
5196,
7561,
128,
4444,
255,
9015,
25,
2010,
15,
207,
31,
57,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is a good project to work on to learn modern patterns and practices?
===
I'm trying to teach myself how to use modern Persistence patterns (OR/M, Repository, etc) and development practices (TDD, etc). Because the best way (for me) to learn is by doing, I'd like to build some sort of demo application for myself. The problem is, I've got no idea what sort of application to build. I'd like to blog about my experience, so I'd like to build something of some worth to the community, but at the same time I want to avoid things that others are actively doing ([web commerce][1], [forums][2]) or have been done to death (blog engines). Does anybody have any suggestions for a good pet project I could work on and maybe blog about my experiences with?
[1]: http://blog.wekeroad.com/mvc-storefront/
[2]: http://weblogs.asp.net/stephenwalther/archive/2008/09/05/asp-net-mvc-application-building-forums-1-create-the-perfect-application.aspx | 0 | [
2,
98,
25,
21,
254,
669,
20,
170,
27,
20,
2484,
773,
6282,
17,
5242,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
5348,
992,
184,
20,
275,
773,
28584,
6282,
13,
5,
248,
118,
79,
15,
24869,
15,
2722,
6,
17,
522,
5242,
13,
5,
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... |
postgreSQL - psql \i : how to execute script in a given path
===
I'm new to postgreSQL and I have a simple question:
I'm trying to create a simple script that creates a DB so I can later call it like this:
psql -f createDB.sql
I want the script to call other scripts (separate ones for creating tables, adding constraints, functions etc), like this:
\i script1.sql
\i script2.sql
It works fine provided that createDB.sql is in the same dir
But if I move script2 to a directory under the one with createDB, and modify the createDB so it looks like this:
\i script1.sql
\i somedir\script2.sql
I got an error:
psql:createDB.sql:2: somedir: Permission denied
I'm using Postgres Plus 8.3 for windows, default postgres user. | 0 | [
2,
678,
6879,
18,
22402,
13,
8,
8613,
22402,
13,
1,
49,
13,
45,
184,
20,
15644,
3884,
19,
21,
504,
2013,
800,
3726,
3726,
31,
22,
79,
78,
20,
678,
6879,
18,
22402,
17,
31,
57,
21,
1935,
1301,
45,
31,
22,
79,
749,
20,
1600,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JavaScript or Java String Subtraction
===
If you are using Java or JavaScript, is there a good way to do something like a String subtraction so that given two strings:
org.company.project.component
org.company.project.component.sub_component
you just get
sub_component
I know that I could just write code to walk the string comparing characters, but I was hoping there was a way to do it in really compact way. | 0 | [
2,
8247,
8741,
54,
8247,
3724,
27031,
872,
800,
3726,
3726,
100,
42,
50,
568,
8247,
54,
8247,
8741,
15,
25,
80,
21,
254,
161,
20,
107,
301,
101,
21,
3724,
27031,
872,
86,
30,
504,
81,
7887,
45,
13,
5583,
9,
28359,
9,
21011,
9,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.NET EventHandlers - Generic or no?
===
Every time I start in deep in a C# project, I end up with lots of events that really just need to pass a single item. I stick with the <code>EventHandler</code>/<code>EventArgs</code> practice, but what I like to do is have something like:
public delegate void EventHandler<T>(object src, EventArgs<T> args);
public class EventArgs<T>: EventArgs {
private T item;
public EventArgs(T item) {
this.item = item;
}
public T Item {
get { return item; }
}
}
Later, I can have my
public event EventHandler<Foo> FooChanged;
public event EventHandler<Bar> BarChanged;
However, it seems that the standard for .NET is to create a new delegate and <code>EventArgs</code> subclass for each type of event. Is there something wrong with my generic approach? | 0 | [
2,
13,
9,
2328,
807,
3203,
1252,
18,
13,
8,
12733,
54,
90,
60,
800,
3726,
3726,
352,
85,
31,
799,
19,
855,
19,
21,
272,
5910,
669,
15,
31,
241,
71,
29,
7503,
16,
963,
30,
510,
114,
376,
20,
1477,
21,
345,
9101,
9,
31,
5258... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Performance gains in stored procs for long running transactions
===
I have several long running report type transactions that take 5-10 minutes. Would I see any performance increase by using stored procs?
each query runs once a night. | 0 | [
2,
956,
11897,
19,
8214,
13,
15617,
18,
26,
175,
946,
13147,
800,
3726,
3726,
31,
57,
238,
175,
946,
1330,
1001,
13147,
30,
247,
331,
8,
1036,
902,
9,
83,
31,
196,
186,
956,
1839,
34,
568,
8214,
13,
15617,
18,
60,
206,
25597,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I wrap text in a UITableViewCell
===
This is on iPhone 0S 2.0. Answers for 2.1 are fine too, though I am unaware of any differences regarding tables.
It feels like it should be possible to get text to wrap without creating a custom cell, since a UITableViewCell contains a UILabel by default. I know I can make it work if I create a custom cell, but that's not what I'm trying to achieve - I want to understand why my current approach doesn't work.
I've figured out that the label is created on demand (since the cell supports text and image access, so it doesn't create the data view until necessary), so if I do something like this:
cell.text = @""; // create the label
UILabel* label = (UILabel*)[[cell.contentView subviews] objectAtIndex:0];
then I get a valid label, but setting numberOfLines on that (and lineBreakMode) doesn't work - I still get single line text. There is plenty of height in the UILabel for the text to display - I'm just returning a large value for the height in heightForRowAtIndexPath. | 0 | [
2,
184,
107,
31,
8118,
1854,
19,
21,
13,
11193,
579,
4725,
9725,
800,
3726,
3726,
48,
25,
27,
21024,
713,
18,
172,
9,
387,
9,
6709,
26,
172,
9,
165,
50,
1123,
266,
15,
362,
31,
589,
12100,
16,
186,
4921,
3467,
7484,
9,
32,
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... |
How do you test that a Python function throws an exception?
===
How does one write a test that fails only if a function doesn't throw an expected exception?
| 0 | [
2,
184,
107,
42,
1289,
30,
21,
20059,
1990,
13566,
40,
5391,
60,
800,
3726,
3726,
184,
630,
53,
2757,
21,
1289,
30,
13614,
104,
100,
21,
1990,
1437,
22,
38,
3814,
40,
1727,
5391,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is it a bad idea to reload routes dynamically in Rails?
===
I have an application I'm writing where I'm allowing the administrators to add aliases for pages, categories, etc, and I would like to use a controller/action depending on the alias (without redirecting). I spent quite a while trying to figure out how I could execute and render a different controller/action, but without luck. (I've found that render doesn't actually call the method. I just renders the template)
The solution for this I've come up with is dynamically generated routes when the server is started, and using callbacks from the Alias model to reload routes when an alias is created/updated/destroyed.
Is this against Rails best practices? Is there a better solution?
| 0 | [
2,
25,
32,
21,
896,
882,
20,
27339,
5050,
7782,
1326,
19,
2240,
18,
60,
800,
3726,
3726,
31,
57,
40,
3010,
31,
22,
79,
1174,
113,
31,
22,
79,
2719,
14,
18618,
20,
3547,
15794,
160,
26,
4434,
15,
6422,
15,
2722,
15,
17,
31,
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... |
Donations for open source tools
===
I use several open source tools in my day to day development - and they save me a lot of money.
In the absense of donating any time to these projects I decided to donate some cash to a project once per year.
If you were going to donate $100 which project would get your vote? | 0 | [
2,
12465,
26,
368,
1267,
4672,
800,
3726,
3726,
31,
275,
238,
368,
1267,
4672,
19,
51,
208,
20,
208,
522,
13,
8,
17,
59,
2079,
55,
21,
865,
16,
875,
9,
19,
14,
12178,
6498,
16,
221,
1880,
186,
85,
20,
158,
2314,
31,
868,
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... |
Anyone know of a solid .NET Framework 2.0 installer script for Inno Setup?
===
I've spent a good part of the day searching, writing and finally scrapping a script that I can use with my Inno Setup install script that will download and install the appropriate .NET 2.0 Framework if needed.
There are definitely a number of examples out there, but they:
1. Want to install Internet Explorer if needed which I wouldn't dare to in an automated way
2. Only handle x86 .NET distributions, no x64 and IA64 support
3. Don't install the appropriate language pack when needed -- a tough problem (when I saw there were different language packs for different x86/x64/language combos I threw in the towel)
4. Don't handle getting the .NET 2.0 SP1 (maybe Windows Update will handle that once 2.0 is installed?)
This seems like such a common problem that _someone_ must have solved it. All I found though were 20 different posts all pointing to the same two or three code snippets.
Insight welcomed :)
| 0 | [
2,
1276,
143,
16,
21,
2941,
13,
9,
2328,
6596,
172,
9,
387,
16146,
106,
3884,
26,
19,
251,
18161,
60,
800,
3726,
3726,
31,
22,
195,
1111,
21,
254,
141,
16,
14,
208,
5792,
15,
1174,
17,
722,
10241,
3181,
21,
3884,
30,
31,
92,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way of handling non-validating SSL certificates in C#
===
I'm using the following code to make sure all certificates pass, even invalid ones, but I would like to know if there is a better way, as this event gets called globally and I only want the certificate to pass for a certain HTTP call and not for any others that are happening asynchronously.
// This delegate makes sure that non-validating SSL certificates are passed
ServicePointManager.ServerCertificateValidationCallback = delegate(object certsender, X509Certificate cert, X509Chain chain, System.Net.Security.SslPolicyErrors error)
{
return true;
}; | 0 | [
2,
98,
25,
14,
246,
161,
16,
7988,
538,
8,
18506,
43,
1880,
13,
18,
18,
255,
6259,
18,
19,
272,
5910,
800,
3726,
3726,
31,
22,
79,
568,
14,
249,
1797,
20,
233,
562,
65,
6259,
18,
1477,
15,
166,
16671,
53,
18,
15,
47,
31,
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 has your QA/tester team said or done for the development team that made your day (as a developer).
===
There are lots of questions on how to improve communication between teams. One way to start is to identify what one team actually does that the other team really values and do more of that.
For example. Our QA team provided a VM for us with:
- The latest release of our server-based commercial software installed and configured (not an easy task in that an installation on-site takes at least 2 days)
- A database backup of the configured system including sample data
- an auto-install and configure application that mostly works. (with 12 install packages for the components needed, this is a big time saver)
While we still do most of our testing on our own desktops, this allows us to have a relatively clean environment we can run locally.
What has your QA team done for you lately? Conversely, what have you done for your QA team?
| 0 | [
2,
98,
63,
154,
7234,
118,
38,
6930,
173,
87,
54,
677,
26,
14,
522,
173,
30,
117,
154,
208,
13,
5,
472,
21,
10058,
6,
9,
800,
3726,
3726,
80,
50,
7503,
16,
2346,
27,
184,
20,
3545,
3291,
128,
952,
9,
53,
161,
20,
799,
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... |
Best rule for maximum function size?
===
In another question, a popular answer suggested that large functions demonstrate poor form.
How large would you let a function get before you broke it up?
(This could be in lines of code or a more qualitative answer, your choice. This is probably a language-dependent question to some extent, so you might want to indicate that and how compactly you normally write code--IOCCC style or space-o-plenty?--in your answer.) | 0 | [
2,
246,
1828,
26,
2979,
1990,
1072,
60,
800,
3726,
3726,
19,
226,
1301,
15,
21,
844,
1623,
2347,
30,
370,
3719,
10847,
1696,
505,
9,
184,
370,
83,
42,
408,
21,
1990,
164,
115,
42,
1842,
32,
71,
60,
13,
5,
1565,
110,
44,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Am I a bad developer because I can't answer 99% of the questions here?
===
I really enjoy browsing StackOverflow. I've learned quite a few things just from perusing the questions. But, I have to admit, it's really bruising my confidence when I realize how much I DON'T know.
Anyone else feel the same?
I suppose this will probably get voted down since it's not really a programming/development question. | 4 | [
2,
589,
31,
21,
896,
10058,
185,
31,
92,
22,
38,
1623,
13,
26014,
16,
14,
2346,
235,
60,
800,
3726,
3726,
31,
510,
4696,
10175,
68,
7566,
2549,
9990,
9,
31,
22,
195,
2691,
1450,
21,
310,
564,
114,
37,
416,
12655,
14,
2346,
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... |
Profiling SQL Server and/or ASP.NET
===
How would one go about profiling a few queries that are being run from an ASP.NET application? There is some software where I work that runs extremely slow because of the database (I think). The tables have indexes but it still drags because it's working with so much data. How can I profile to see where I can make a few minor improvements that will hopefully lead to larger speed improvements? | 0 | [
2,
8721,
49,
802,
4444,
255,
8128,
17,
118,
248,
28,
306,
9,
2328,
800,
3726,
3726,
184,
83,
53,
162,
88,
8721,
49,
802,
21,
310,
9386,
2829,
30,
50,
142,
485,
37,
40,
28,
306,
9,
2328,
3010,
60,
80,
25,
109,
2306,
113,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the difference between my and local in Perl
===
I am seeing both of them used in this script I am trying to debug and the literature is just not clear. Can someone demystify this for me? | 0 | [
2,
98,
25,
14,
2841,
128,
51,
17,
375,
19,
416,
255,
800,
3726,
3726,
31,
589,
2078,
156,
16,
105,
147,
19,
48,
3884,
31,
589,
749,
20,
121,
16254,
17,
14,
2233,
25,
114,
52,
1207,
9,
92,
737,
121,
915,
384,
8612,
48,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Cannot Access http://<tfs-server>:8080
===
I've installed TFS 2008, but I can't seem to access the server. When I try to connect to it in Visual Studio, I can't. If I try by browser on a remote PC, I get a generic page cannot be displayed. On the server, I get a 403. Nothing was touched in IIS and the service is running as a Network Service. Any ideas? | 0 | [
2,
1967,
1381,
7775,
6903,
1,
11720,
18,
8,
10321,
106,
1,
45,
2887,
2887,
800,
3726,
3726,
31,
22,
195,
4066,
13,
11720,
18,
570,
15,
47,
31,
92,
22,
38,
2260,
20,
1381,
14,
8128,
9,
76,
31,
1131,
20,
6379,
20,
32,
19,
3458... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 declarative programming?
===
I keep hearing this term tossed around in several different contexts. What is it? | 0 | [
2,
98,
25,
121,
12078,
3366,
3143,
60,
800,
3726,
3726,
31,
643,
3229,
48,
981,
6975,
140,
19,
238,
421,
4141,
18,
9,
98,
25,
32,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to create a C# Login handler
===
How would I go about creating a web app login handler in C#?
In Java I would use a JSP that posts the username and password to a servlet, which then delegates to a POJO - for the db lookup and validation. If validation fails the servlet forwards onto the login.jsp for another attempt, if successfull then forwards to the secure resource. | 0 | [
2,
184,
20,
1600,
21,
272,
5910,
6738,
108,
24641,
800,
3726,
3726,
184,
83,
31,
162,
88,
2936,
21,
2741,
4865,
6738,
108,
24641,
19,
272,
5910,
60,
19,
8247,
31,
83,
275,
21,
487,
3401,
30,
9868,
14,
4155,
7259,
17,
20884,
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 play a sound file
===
With C#, How do I play (Pause, Forward...) a sound file (mp3, ogg) ? The file could be on the hard disk, or on the internet.
Is there any library or Class out there that can ease me the work ?
Thanks | 0 | [
2,
184,
20,
418,
21,
646,
3893,
800,
3726,
3726,
29,
272,
5910,
15,
184,
107,
31,
418,
13,
5,
1060,
3699,
15,
917,
9,
9,
9,
6,
21,
646,
3893,
13,
5,
2554,
240,
15,
7096,
263,
6,
13,
60,
14,
3893,
110,
44,
27,
14,
552,
85... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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# + Castle ActiveRecord: HasAndBelongsToMany and collections
===
Let's say I have many-to-many relationship (using the ActiveRecord attribute HasAndBelongsToMany) between Posts and Tags (domain object names changed to protect the innocent), and I wanted a method like <pre>FindAllPostByTags(IList<Tag> tags)</pre> that returns all Posts that have all (not just some of) the Tags in the parameter. Any way I could accomplish this either with NHibernate Expressions or HQL? I've searched through the HQL documentation and couldn't find anything that suited my needs. I hope I'm just missing something obvious! | 0 | [
2,
272,
5910,
2754,
1339,
1348,
14953,
45,
63,
290,
863,
2701,
18,
262,
14842,
17,
5721,
800,
3726,
3726,
408,
22,
18,
395,
31,
57,
151,
8,
262,
8,
14842,
1429,
13,
5,
12655,
14,
1348,
14953,
35,
14755,
63,
290,
863,
2701,
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 do I keep a DIV from expanding to take up all available width?
===
In the following HTML, I'd like the frame around the image to be snug -- not to stretch out and take up all the available width in the parent container. I know there are a couple of ways to do this (including horrible things like manually setting its width to a particular number of pixels), but what is the *right* way?
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head><title>foo</title>
<style type="text/css">
.pictureframe {
display: block;
margin: 5px;
padding: 5px;
border: solid brown 2px;
background-color: #ffeecc;
}
</style>
</head>
<body>
<div style="border: solid blue 2px; float: left;">
<span class="pictureframe">
<img alt='' style="display: block;"
src="http://stackoverflow.com/favicon.ico" />
</span>
<p>
Why is the beige rectangle so wide?
</p>
</div>
</body>
</html>
| 0 | [
2,
184,
107,
31,
643,
21,
13,
12916,
37,
9393,
20,
247,
71,
65,
904,
9456,
60,
800,
3726,
3726,
19,
14,
249,
13,
15895,
15,
31,
22,
43,
101,
14,
3523,
140,
14,
1961,
20,
44,
22988,
13,
8,
8,
52,
20,
6363,
70,
17,
247,
71,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Survey: How do you define the term "bug"?
===
We've probably all heard the programming cliché "That's not a bug; that's a feature." I know my question may seem off-topic, but I think it's an interesting question nonetheless.
***How do you define the term "bug"?***
I'm just getting caught up on the Stackoverflow podcast, and in [Episode 21][1] (at around 27:20, (transcript [here][2]) Jeff talks about the developer who wrote the scoring code for Rock Band and how there were ways to score that he didn't even understand. I found that very interesting, and it brought to my mind the question:
"Is that a bug, or a hidden feature?"
Given that no one will ever write bug free software (or so I believe), my question here is "What is a bug?"
Is it any time an application does something you didn't expect? Must it be catastrohpic? Something else entirely?
[1]: http://itc.conversationsnetwork.org/audio/download/ITC.SO-Episode21-2008.09.09.mp3
[2]: https://stackoverflow.fogbugz.com/default.asp?W24224 | 2 | [
2,
3431,
45,
184,
107,
42,
9267,
14,
981,
13,
7,
16254,
7,
60,
800,
3726,
3726,
95,
22,
195,
910,
65,
752,
14,
3143,
24477,
13,
7,
887,
22,
18,
52,
21,
6256,
73,
30,
22,
18,
21,
1580,
9,
7,
31,
143,
51,
1301,
123,
2260,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 method for sanatizing user input with PHP?
===
Is there a catchall function somewhere that works well for sanatizing user input for sql injection and XSS attacks, while still allowing certain types of html tags?
It sure seems like their should be... | 0 | [
2,
98,
22,
18,
14,
246,
2109,
26,
523,
721,
3335,
4155,
6367,
29,
13,
26120,
60,
800,
3726,
3726,
25,
80,
21,
2949,
1233,
1990,
3493,
30,
693,
134,
26,
523,
721,
3335,
4155,
6367,
26,
4444,
255,
13646,
17,
993,
18,
18,
3080,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is duplicated code more tolerable in unit tests?
===
I ruined several unit tests some time ago when I went through and refactored them to make them more [DRY][1]--the intent of each test was no longer clear. It seems there is a trade-off between tests' readability and maintainability. If I leave duplicated code in unit tests, they're more readable, but then if I change the [SUT][2], I'll have to track down and change each copy of the duplicated code.
Do you agree that this trade-off exists? If so, do you prefer your tests to be readable, or maintainable?
[1]: http://en.wikipedia.org/wiki/Don%27t_repeat_yourself
[2]: http://en.wikipedia.org/wiki/System_Under_Test | 0 | [
2,
25,
19429,
43,
1797,
91,
20,
1252,
579,
19,
1237,
4894,
60,
800,
3726,
3726,
31,
10508,
238,
1237,
4894,
109,
85,
1464,
76,
31,
296,
120,
17,
302,
17455,
69,
105,
20,
233,
105,
91,
636,
12611,
500,
2558,
165,
500,
8,
8,
124... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Parse Fast Infoset documents in PHP?
===
Is there a library which allows PHP to decode [application/fastinfoset][1] binary XML?
[1]: http://java.sun.com/developer/technicalArticles/xml/fastinfoset/ | 0 | [
2,
2017,
870,
1512,
15404,
3554,
4374,
19,
13,
26120,
60,
800,
3726,
3726,
25,
80,
21,
1248,
56,
2965,
13,
26120,
20,
121,
9375,
636,
2552,
20669,
118,
13088,
108,
4120,
3554,
500,
2558,
165,
500,
14171,
23504,
60,
636,
165,
500,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Any good collection module in perl?
===
Can someone suggest a good module in perl which can be used to store collection of objects?
Or is ARRAY a good enough substitute for most of the needs? | 0 | [
2,
186,
254,
1206,
12613,
19,
416,
255,
60,
800,
3726,
3726,
92,
737,
5601,
21,
254,
12613,
19,
416,
255,
56,
92,
44,
147,
20,
1718,
1206,
16,
3916,
60,
54,
25,
7718,
21,
254,
511,
6558,
26,
127,
16,
14,
2274,
60,
3,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Problem using JConsole remotely with JBoss 4.2.2 with app that uses JWS
===
I am trying to set up JBoss 4.2.2 and JConsole for remote monitoring. As per many of the how-to's I have found on the web to do this you need to enable jmxremote by setting the following options in run.conf. (I realize the other two opts disable authentication)
JAVA_OPTS="$JAVA_OPTS -Dcom.sun.management.jmxremote.port=11099"
JAVA_OPTS="$JAVA_OPTS -Dcom.sun.management.jmxremote.authenticate=false"
JAVA_OPTS="$JAVA_OPTS -Dcom.sun.management.jmxremote.ssl=false"
Which results in the following exception:
13:06:56,418 INFO [TomcatDeployer] performDeployInternal :: deploy, ctxPath=/services, warUrl=.../tmp/deploy/tmp34585xxxxxxxxx.ear-contents/mDate-Services-exp.war/
13:06:57,706 WARN [AbstractServerConfig] getWebServicePort :: Unable to calculate 'WebServicePort', using default '8080'
13:06:57,711 WARN [AbstractServerConfig] getWebServicePort :: Unable to calculate 'WebServicePort', using default '8080'
13:06:58,070 WARN [AbstractServerConfig] getWebServicePort :: Unable to calculate 'WebServicePort', using default '8080'
13:06:58,071 WARN [AbstractServerConfig] getWebServicePort :: Unable to calculate 'WebServicePort', using default '8080'
13:06:58,138 ERROR [MainDeployer] start :: Could not start deployment: file:/opt/jboss-4.2.2.GA/server/default/tmp/deploy/tmp34585xxxxxxxxx.ear-contents/xxxxx-Services.war
java.lang.NullPointerException
at org.jboss.wsf.stack.jbws.WSDLFilePublisher.getPublishLocation(WSDLFilePublisher.java:303)
at org.jboss.wsf.stack.jbws.WSDLFilePublisher.publishWsdlFiles(WSDLFilePublisher.java:103)
at org.jboss.wsf.stack.jbws.PublishContractDeploymentAspect.create(PublishContractDeploymentAspect.java:52)
at org.jboss.wsf.framework.deployment.DeploymentAspectManagerImpl.deploy(DeploymentAspectManagerImpl.java:115)
at org.jboss.wsf.container.jboss42.ArchiveDeployerHook.deploy(ArchiveDeployerHook.java:97)
...
My application uses JWS which according to this bug:
https://jira.jboss.org/jira/browse/JBWS-1943
Suggests this workaround:
JAVA_OPTS="$JAVA_OPTS -Djavax.management.builder.initial=org.jboss.system.server.jmx.MBeanServerBuilderImpl"
JAVA_OPTS="$JAVA_OPTS -Djboss.platform.mbeanserver"
JAVA_OPTS="$JAVA_OPTS -Dcom.sun.management.jmxremote"
(http://jbossws.jboss.org/mediawiki/index.php?title=FAQ#How_to_use_JDK_JMX_JConsole_with_JBossWS.3F)
I've tried that however that then throws the following exception while trying to deploy a sar file in my ear which only contains on class which implements Schedulable for a couple of scheduled jobs my application requires:
Caused by: java.lang.NullPointerException
at EDU.oswego.cs.dl.util.concurrent.ConcurrentReaderHashMap.hash(ConcurrentReaderHashMap.java:298)
at EDU.oswego.cs.dl.util.concurrent.ConcurrentReaderHashMap.get(ConcurrentReaderHashMap.java:410)
at org.jboss.mx.server.registry.BasicMBeanRegistry.getMBeanMap(BasicMBeanRegistry.java:959)
at org.jboss.mx.server.registry.BasicMBeanRegistry.contains(BasicMBeanRegistry.java:577)
Any suggestions on where to go from here?
EDIT:
I have also tried the following variation:
Djavax.management.builder.initial=org.jboss.system.server.jmx.MBeanServerBuilderImpl
-Djboss.platform.mbeanserver
-Dcom.sun.management.jmxremote.port=11099
-Dcom.sun.management.jmxremote.authenticate=false
-Dcom.sun.management.jmxremote.ssl=false
I'm using JDK 1.6.0_01-b06 | 0 | [
2,
1448,
568,
487,
12124,
6069,
23288,
29,
487,
10349,
18,
268,
9,
135,
9,
135,
29,
4865,
30,
2027,
487,
10268,
800,
3726,
3726,
31,
589,
749,
20,
309,
71,
487,
10349,
18,
268,
9,
135,
9,
135,
17,
487,
12124,
6069,
26,
5388,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to begin WPF development?
===
I've been using Winforms since .NET 1.1 and I want to start learning WPF.
I'm looking for good resources for a beginner in WPF. What should I read, what Tools I need and what are the best practices I need to follow.
| 0 | [
2,
184,
20,
2348,
619,
7721,
522,
60,
800,
3726,
3726,
31,
22,
195,
74,
568,
628,
4190,
18,
179,
13,
9,
2328,
137,
9,
165,
17,
31,
259,
20,
799,
2477,
619,
7721,
9,
31,
22,
79,
699,
26,
254,
2566,
26,
21,
26931,
19,
619,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
NHibernate : map to fields or properties ?
===
When you create your mapping files, do you map your properties to fields or properties :
<hibernate-mapping xmlns="urn:nhibernate-mapping-2.2" assembly="Foo" namespace="Foo.Bar" >
<class name="Foo" table="FOOS" batch-size="100">
[...]
<property name="FooProperty1" access="field.camelcase" column="FOO_1" type="string" length="50" />
<property name="FooProperty2" column="FOO_2" type="string" length="50" />
[...]
</class>
</hibernate-mapping>
Of course, please explain why :)
Usually, I map to properties, but mapping to fields can enable to put some "logic" in the getters/setters of the properties.
Is it "bad" to map to fields ? Is there a best practice ? | 0 | [
2,
12109,
15191,
8820,
13,
45,
2942,
20,
2861,
54,
3704,
13,
60,
800,
3726,
3726,
76,
42,
1600,
154,
13305,
6488,
15,
107,
42,
2942,
154,
3704,
20,
2861,
54,
3704,
13,
45,
13,
1,
8630,
106,
8820,
8,
540,
5574,
23504,
2172,
3726,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Miracles! How do you deal with clients who have no processes, have no methodology and ask for things to be done for yesterday?
===
As a consultant you are sometimes thrown into difficult circumstances. How do you deal with clients who have no processes, have no methodology and ask for things to be done for yesterday even though they do not fully know what they want?
| 0 | [
2,
8162,
18,
187,
184,
107,
42,
1183,
29,
7421,
72,
57,
90,
5102,
15,
57,
90,
18653,
17,
1349,
26,
564,
20,
44,
677,
26,
7124,
60,
800,
3726,
3726,
28,
21,
7381,
42,
50,
1030,
6027,
77,
1956,
5072,
9,
184,
107,
42,
1183,
29,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 find out what category a product belongs to?
===
Basically, when a user inputs a product name (such as "iPhone 3g"), I would like to know the parent categories of that item (such as Electronics / Mobile phones). Is there a web api (ie. for ebay, amazon etc.) or any other way to figure out that information? | 0 | [
2,
184,
92,
31,
477,
70,
98,
3230,
21,
2374,
7034,
20,
60,
800,
3726,
3726,
11374,
15,
76,
21,
4155,
6367,
18,
21,
2374,
204,
13,
5,
4289,
28,
13,
7,
49,
7709,
203,
263,
7,
6,
15,
31,
83,
101,
20,
143,
14,
4766,
6422,
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... |
Code or formula for intersection of to parabolas in any rotation
===
I am working on a geometry problem that requires finding the intersection of two parabolic arcs in any rotation. I was able to intesect a line and a parabolic arc by rotating the plane to align the arc with an axis, but two parabolas cannot both align with an axis. I am working on deriving the formulas, but I would like to know if there is a resource already available for this. | 0 | [
2,
1797,
54,
3729,
26,
5351,
16,
20,
2258,
20546,
18,
19,
186,
9431,
800,
3726,
3726,
31,
589,
638,
27,
21,
11689,
1448,
30,
4781,
3007,
14,
5351,
16,
81,
2258,
6966,
596,
4686,
18,
19,
186,
9431,
9,
31,
23,
777,
20,
19,
3231,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
telneting backspace key is wrong
===
When I telnet into our works sun station my backspace key doesn't work. I use a temporary workaround of:
$ stty erase ^H
This works but each time I telnet in I have to retype this. How can I set this to work properly in my .cshrc file? | 0 | [
2,
6757,
2328,
68,
97,
5582,
1246,
25,
1389,
800,
3726,
3726,
76,
31,
6757,
2328,
77,
318,
693,
939,
312,
51,
97,
5582,
1246,
1437,
22,
38,
170,
9,
31,
275,
21,
4700,
170,
10037,
16,
45,
5579,
354,
1084,
23593,
13,
1,
252,
48,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Slipping podcasts through a filter
===
My workplace filters our internet traffic by forcing us to go through a proxy, and unfortunately sites such as IT Conversations and Libsyn are blocked. However, mp3 files in general are not filtered, if they come from sites not on the proxy's blacklist.
So is there a website somewhere that will let me give it a URL and then download the MP3 at that URL and send it my way, thus slipping through the proxy?
Alternatively, is there some other easy way for me to get the mp3 files for these podcasts from work? | 0 | [
2,
12723,
15124,
18,
120,
21,
11945,
800,
3726,
3726,
51,
16932,
21062,
318,
2620,
2227,
34,
6135,
182,
20,
162,
120,
21,
27188,
15,
17,
6200,
3259,
145,
28,
32,
13527,
17,
13,
8326,
9507,
50,
8388,
9,
207,
15,
4628,
240,
6488,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Forms in SharePoint
===
If I want to put a form up on SharePoint, is it easier to use InfoPath or build a custom web part in C#? Are there other options that I should consider?
What are the requirements and hurdles for each option?
| 0 | [
2,
1997,
19,
1891,
3132,
800,
3726,
3726,
100,
31,
259,
20,
442,
21,
505,
71,
27,
1891,
3132,
15,
25,
32,
4950,
20,
275,
15404,
8353,
54,
1895,
21,
5816,
2741,
141,
19,
272,
5910,
60,
50,
80,
89,
6368,
30,
31,
378,
3563,
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,
0,
0,
0,
0,
0,
0,
0... |
How can I query the name of the current SQL Server database instance?
===
It is a bit of a "chicken or egg" kind of query, but can someone dreamup a query that can return the name of the current database in which the query executes? Believe me when I say I understand the paradox: why do you need to know the name of the database if you're already connected to execute the query? Auditing in a multi-database environment.
I've looked at all the @@ globals in Books Online. "SELECT @@servername" comes close, but I want the name of the database instance rather than the server. | 0 | [
2,
184,
92,
31,
25597,
14,
204,
16,
14,
866,
4444,
255,
8128,
6018,
4851,
60,
800,
3726,
3726,
32,
25,
21,
1142,
16,
21,
13,
7,
25256,
219,
54,
6387,
7,
825,
16,
25597,
15,
47,
92,
737,
1868,
576,
21,
25597,
30,
92,
788,
14,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I write a generic memoize function?
===
I'm writing a function to find [triangle numbers](http://projecteuler.net/index.php?section=problems&id=12) and the natural way to write it is recursively:
function triangle (x)
if x == 0 then return 0 end
return x+triangle(x-1)
end
But attempting to calculate the first 100,000 triangle numbers fails with a stack overflow after a while. This is an ideal function to [memoize](http://perl.plover.com/Memoize/), but I want a solution that will memoize any function I pass to it.
| 0 | [
2,
184,
107,
31,
2757,
21,
12733,
22236,
2952,
1990,
60,
800,
3726,
3726,
31,
22,
79,
1174,
21,
1990,
20,
477,
636,
3367,
15427,
2116,
500,
5,
21127,
6903,
21011,
5770,
1252,
9,
2328,
118,
25671,
9,
26120,
60,
10579,
3726,
2740,
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... |
Easy acceptance testing with specification
===
I look for a tool/framework to make automatic acceptance-testing. The interface to create new tests should be so easy, that a non-programmer (customer, boss) will be able to add specifications for which will be tested automatically.
It should be some way to execute the tests from commandline, to include a run of the tests in automatic builds.
I prefer Java and Open-Source, but my question isn't restricted in that way.
What do you can recommend and please explain why your tool/framework is the best in the world. | 0 | [
2,
2010,
10156,
4431,
29,
14177,
800,
3726,
3726,
31,
361,
26,
21,
5607,
118,
8361,
3783,
20,
233,
6715,
10156,
8,
10543,
68,
9,
14,
6573,
20,
1600,
78,
4894,
378,
44,
86,
2010,
15,
30,
21,
538,
8,
19746,
1263,
13,
5,
4636,
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... |
Pass NSMutableArray object
===
I'm getting lost in pointer land, I believe. I've got this (code syntax might be a little off, I am not looking at the machine with this code on it...but all the pertinent details are correct):
NSMutableArray *tmp = [[NSMutableArray alloc] init];
I them pass that to a routine in another class
- (BOOL)myRoutine: (NSMutableArray *)inArray
{
// Adds items to the array -- if I break at the end of this function, the inArray variable has a count of 10
}
But when the code comes back into the calling routine, [tmp count] is 0.
I must be missing something very simple and yet very fundamental, but for the life of me I can't see it. Can anyone point out what I'm doing wrong? | 0 | [
2,
1477,
13,
2172,
7903,
579,
8576,
93,
3095,
800,
3726,
3726,
31,
22,
79,
1017,
529,
19,
454,
106,
476,
15,
31,
985,
9,
31,
22,
195,
330,
48,
13,
5,
9375,
22649,
530,
44,
21,
265,
168,
15,
31,
589,
52,
699,
35,
14,
1940,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Javascript and session variables
===
I have a database that stores events in it and a page with a calander object on it. When rendering the days it looks through the months events and if any match the current day being rendered it creates a linkbutton to represent the event in the day on the calander and adds it to that cell. I add some javascript to the linkbutton to change the window.location to a page to view event details passing EventID in the querystring ( I tried setting the postbackurl of the newly created linkbutton but it wasnt causing a postback... no luck). I need to set a Session variable ie. Session("EditMode") = "Edit" So the new page will know it is to get an existing event info rather than prepare to create a new event? Any SUGGESTIONS? | 0 | [
2,
8247,
8741,
17,
3723,
12157,
800,
3726,
3726,
31,
57,
21,
6018,
30,
4134,
963,
19,
32,
17,
21,
2478,
29,
21,
1658,
10313,
3095,
27,
32,
9,
76,
15307,
14,
509,
32,
1879,
120,
14,
818,
963,
17,
100,
186,
730,
14,
866,
208,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 adding data to a segment in flash memory screw up a program's timing?
===
I have a real-time embedded app with the major cycle running at 10KHz. It runs on a TI TMS320C configured to boot from flash. I recently added an initialized array to a source file, and all of a sudden the timing is screwed up (in a way too complex to explain well - esentially a serial port write is no longer completing on time.)
The things about this that baffle me:
- I'm **_not even accessing the new data_**, just declaring an initialized array.
- It is size dependant - the problem only appears if the array is >40 words.
- I know I'm not overflowing any data segments in the link map.
- There is no data caching, so it's not due to disrupting cache consistency.
Any ideas on how simply increasing the size of the .cinit segment in flash can affect the timing of your code?
| 0 | [
2,
184,
92,
4721,
1054,
20,
21,
5631,
19,
4433,
1912,
8513,
71,
21,
625,
22,
18,
11812,
60,
800,
3726,
3726,
31,
57,
21,
683,
8,
891,
12138,
4865,
29,
14,
394,
4150,
946,
35,
332,
4278,
380,
9,
32,
1461,
27,
21,
4174,
13,
38... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Getting Python to use the ActiveTcl libraries
===
Is there any way to get Python to use my ActiveTcl installation instead of having to copy the ActiveTcl libraries into the Python/tcl directory?
| 0 | [
2,
1017,
20059,
20,
275,
14,
1348,
38,
5316,
8649,
800,
3726,
3726,
25,
80,
186,
161,
20,
164,
20059,
20,
275,
51,
1348,
38,
5316,
7758,
700,
16,
452,
20,
4344,
14,
1348,
38,
5316,
8649,
77,
14,
20059,
118,
38,
5316,
16755,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
<ProjectName.ProjectUI sucks as a name for my Netbeans java OS X app.
===
What property in Netbeans to I need to change to set the name of my java swing app in the OS X menubar and dock? I found info.plist, but changing @PROJECTNAMEASIDENTIFIEER@ in multiple keys here had no effect.
Thanks,
hating netbeans. | 0 | [
2,
13,
1,
21011,
7259,
9,
21011,
5661,
8466,
18,
28,
21,
204,
26,
51,
4275,
863,
5950,
8247,
13,
759,
993,
4865,
9,
800,
3726,
3726,
98,
1354,
19,
4275,
863,
5950,
20,
31,
376,
20,
753,
20,
309,
14,
204,
16,
51,
8247,
5587,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to launch a web browser with a custom url from a C# application?
===
It's common knowledge that using System.Diagnostics.Process.Start is the way to launch a url from a C# applicaiton:
System.Diagnostics.Process.Start("http://www.mywebsite.com");
However, if this url is invalid the application seems to have no way of knowing that the call failed or why. Is there a better way to launch a web browser? If not, what is my best option for url validation?
| 0 | [
2,
98,
25,
14,
246,
161,
20,
3394,
21,
2741,
16495,
29,
21,
5816,
287,
6362,
37,
21,
272,
5910,
3010,
60,
800,
3726,
3726,
32,
22,
18,
757,
1918,
30,
568,
329,
9,
4286,
21944,
18,
9,
16835,
9,
13680,
25,
14,
161,
20,
3394,
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... |
C++ (Builder) How to populate a database with filenames from a dir and its subdirs.
===
I have an application which behaves as a slideshow for all pictures in a folder. It is written in Borland's C++ Builder (9). It currently uses some borrowed code to throw the filenames into a listbox and save the listbox items as a text file.
I want to update this so that the filenames are stored in a proper database so that I can include extra fields and do proper SQL things with it.
So basically I would be able to work it out if I saw some 'sample' code doing the same thing.
So if anyone knows of any code that does this I would be greatful. It needs to be able to do it on certain file types... not just all the files. | 0 | [
2,
272,
20512,
13,
5,
20904,
6,
184,
20,
1675,
12383,
21,
6018,
29,
3893,
7259,
18,
37,
21,
13,
9035,
17,
82,
972,
9035,
18,
9,
800,
3726,
3726,
31,
57,
40,
3010,
56,
14149,
18,
28,
21,
18066,
1544,
26,
65,
3104,
19,
21,
192... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 sign your Firefox extensions?
===
I have developed a couple of extensions for Firefox, and am annoyed that it is so hard to get the extension signed. When an extension isn't signed, it says "Author not verified" when it is installed, and to me that just looks wrong.
I have a simple build script that builds my .xpi file from sources, and I have a licenced copy of PKZip (which according to a number of tutorials is required to build a signed xpi file that Firefox requires), but I haven't found a way to get a free/cheap certificate that actually works or a set of instructions that do the trick.
Since my extensions are free, I don't want to spend $400 on a commercial certificate, but I don't mind spending $50 or so to get it done. I have both Linux and Windows machines, although my build script currently uses Windows and that would be most convenient to use.
How have you solved this? What do I need to do to automatically and securely sign my extensions when they are built? | 0 | [
2,
184,
107,
42,
1676,
154,
535,
18219,
17529,
60,
800,
3726,
3726,
31,
57,
885,
21,
1335,
16,
17529,
26,
535,
18219,
15,
17,
589,
13008,
30,
32,
25,
86,
552,
20,
164,
14,
3896,
908,
9,
76,
40,
3896,
2532,
22,
38,
908,
15,
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... |
What is MVC (Model View Controller)?
===
I've heard the term MVC (Model View Controller) tossed about with a ton of Buzz lately, but what really is it? | 0 | [
2,
98,
25,
307,
8990,
13,
5,
13998,
1418,
9919,
6,
60,
800,
3726,
3726,
31,
22,
195,
752,
14,
981,
307,
8990,
13,
5,
13998,
1418,
9919,
6,
6975,
88,
29,
21,
13,
444,
16,
9122,
10434,
15,
47,
98,
510,
25,
32,
60,
3,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What's the best way to generate a Text file in a .net website?
===
I have a page in my vb.net web application that needs to toss a bunch of data into a text file and then present it to the user for download. What's the best / most efficient way to build such a text file on a .net web server? | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
7920,
21,
1854,
3893,
19,
21,
13,
9,
2328,
2271,
60,
800,
3726,
3726,
31,
57,
21,
2478,
19,
51,
13,
20468,
9,
2328,
2741,
3010,
30,
2274,
20,
20,
18,
18,
21,
7653,
16,
1054,
77,
21,
1854,
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... |
What does "0 but true" mean in Perl?
===
Can someone explain what exactly the string "0 but true" means in Perl? As far as I understand, it equals zero in an integer comparison, but evaluates to true when used as a boolean. Is this correct? Is this a normal behavior of the language or is this a special string treated as a special case in the interpreter? | 0 | [
2,
98,
630,
13,
7,
387,
47,
1151,
7,
884,
19,
416,
255,
60,
800,
3726,
3726,
92,
737,
3271,
98,
1890,
14,
3724,
13,
7,
387,
47,
1151,
7,
1108,
19,
416,
255,
60,
28,
463,
28,
31,
1369,
15,
32,
2747,
18,
4606,
19,
40,
13820,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best way to keep multiple servers running Linux, all with changing data, synced?
===
I have several different locations in a fairly wide area, each with a Linux server storing company data. This data changes every day in different ways at each different location. I need a way to keep this data up-to-date and synced between all these locations.
For example:
In one location someone places a set of images on their local server. In another location, someone else places a group of documents on their local server. In two other locations, no changes are made to their local servers at all. By the next morning, I need the servers at all four locations to have all those images and documents.
My first instinct to use rsync and a cron job to do the syncing over night (1 a.m. to 6 a.m. or so), when none of the bandwidth at our locations is being used. Would it work best to have one server be the "central" server, that pulls all the changes from the other servers, then pushes those changes back out? Or is there another, better way to perform this function? | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
643,
1886,
17595,
946,
13024,
15,
65,
29,
4226,
1054,
15,
6063,
11014,
60,
800,
3726,
3726,
31,
57,
238,
421,
4095,
19,
21,
6647,
1051,
217,
15,
206,
29,
21,
13024,
8128,
25615,
237,
1054,
9,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 convert a JTS-Geometry into an AWT-Shape?
===
Is it possible to convert a com.vividsolutions.jts.geom.Geometry (or a subclass of it) into a class that implements java.awt.Shape? Which library/method can I use to achieve that goal? | 0 | [
2,
184,
92,
31,
8406,
21,
487,
38,
18,
8,
834,
25564,
77,
40,
13,
3885,
38,
8,
25096,
60,
800,
3726,
3726,
25,
32,
938,
20,
8406,
21,
13,
960,
9,
21081,
43,
18,
18687,
3309,
18,
9,
728,
38,
18,
9,
834,
2636,
9,
834,
25564,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Convert an image to XAML?
===
Does anyone know of any way to convert a simple gif to xaml? E.G. A tool that would look at an image and create elipses, rectangles and paths based upon a gif / jpg / bitmap? | 0 | [
2,
8406,
40,
1961,
20,
13,
6791,
8184,
60,
800,
3726,
3726,
630,
1276,
143,
16,
186,
161,
20,
8406,
21,
1935,
489,
821,
20,
13,
6791,
8184,
60,
13,
62,
9,
263,
9,
21,
5607,
30,
83,
361,
35,
40,
1961,
17,
1600,
8161,
1919,
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... |
Initial skeleton for Firefox extensions?
===
I always seem to have a hard time starting a new Firefox extension. Can anyone recommend a good extension skeleton, scaffold, or code generator? Ideally one that follows all the best practices for FF extensions? | 0 | [
2,
2104,
11714,
26,
535,
18219,
17529,
60,
800,
3726,
3726,
31,
550,
2260,
20,
57,
21,
552,
85,
1422,
21,
78,
535,
18219,
3896,
9,
92,
1276,
12360,
21,
254,
3896,
11714,
15,
27322,
15,
54,
1797,
15286,
60,
5628,
102,
53,
30,
241... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Need to run a TCP server besides a Rails app
===
I have a Rails 2.0.2 application running with a postgresql db. The machine will receive data on a TCP port. I already have coded a working ruby multithreaded tcp server to receive the requests, but I need this code to run alongside my Rails app.
So I guess I need to know how to span a new process inside Rails, or how to create a worker thread that will run my threaded tcp server loop. My ruby tcp server could have access to ActiveRecord, but it's not necessary (I can always create an http request, posting the received data to the original Rails server) | 0 | [
2,
376,
20,
485,
21,
13,
38,
7439,
8128,
3410,
21,
2240,
18,
4865,
800,
3726,
3726,
31,
57,
21,
2240,
18,
172,
9,
387,
9,
135,
3010,
946,
29,
21,
678,
6879,
18,
22402,
13,
9007,
9,
14,
1940,
129,
2588,
1054,
27,
21,
13,
38,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Dropdownlist control with <optgroup>s for asp.net?
===
Can anyone recommend a dropdownlist control for asp.net (3.5) that can render option groups? Thanks | 0 | [
2,
2804,
2968,
5739,
569,
29,
13,
1,
2594,
38,
8024,
1,
18,
26,
28,
306,
9,
2328,
60,
800,
3726,
3726,
92,
1276,
12360,
21,
2804,
2968,
5739,
569,
26,
28,
306,
9,
2328,
13,
5,
240,
9,
264,
6,
30,
92,
16535,
4255,
1170,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How can I make two browser windows share the same "session"?
===
I have an app that needs to open a new window (in the same domain) so the user can view a report, but on some browsers* the new window doesn't share the non-persistent cookie of the original window, which causes the user to have to sign in again. Is there anything I can do to stop the user having to sign in again in the new window?
*In fact, in IE7 it is sporadic - sometimes new windows share cookies, sometimes not. | 0 | [
2,
184,
92,
31,
233,
81,
16495,
1936,
1891,
14,
205,
13,
7,
7202,
5991,
7,
60,
800,
3726,
3726,
31,
57,
40,
4865,
30,
2274,
20,
368,
21,
78,
1463,
13,
5,
108,
14,
205,
4603,
6,
86,
14,
4155,
92,
1418,
21,
1330,
15,
47,
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... |
Multi-line string in a PropertyGrid
===
Is there a built-in editor for a multi-line string in a `PropertyGrid`. | 0 | [
2,
1889,
8,
1143,
3724,
19,
21,
1354,
16375,
800,
3726,
3726,
25,
80,
21,
392,
8,
108,
1835,
26,
21,
1889,
8,
1143,
3724,
19,
21,
13,
1,
10890,
106,
1084,
16375,
1,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
how are serial generators / cracks developed?
===
I mean, I always was wondered about how the hell somebody can develop algorithms to break/cheat the constraints of legal use in many shareware programs out there.
Just for curiosity. | 0 | [
2,
184,
50,
5956,
20495,
13,
118,
19376,
885,
60,
800,
3726,
3726,
31,
884,
15,
31,
550,
23,
3519,
88,
184,
14,
1094,
8861,
92,
2803,
15935,
20,
1442,
118,
2569,
721,
14,
16747,
16,
1517,
275,
19,
151,
1891,
5011,
1726,
70,
80,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Book and tutorial recommedations for Django 1.0
===
Please share your book or tutorial recommendations for the latest release (1.0) of Django. | 0 | [
2,
360,
17,
29724,
302,
960,
4688,
7504,
26,
3857,
14541,
137,
9,
387,
800,
3726,
3726,
2247,
1891,
154,
360,
54,
29724,
12121,
26,
14,
5736,
830,
13,
5,
165,
9,
387,
6,
16,
3857,
14541,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
OS Development
===
I want to make my own operating system for the X86 architecture.
What would be the best language to use? (Along with assem of course)
What would the best compiler for the language be on a windows environment?
Are there any good tutorials on this subject?
Is it better to test it using an emulator or physical pc? | 0 | [
2,
13,
759,
522,
800,
3726,
3726,
31,
259,
20,
233,
51,
258,
2455,
329,
26,
14,
993,
3274,
2607,
9,
98,
83,
44,
14,
246,
816,
20,
275,
60,
13,
5,
11501,
29,
28,
18,
1503,
16,
674,
6,
98,
83,
14,
246,
21486,
26,
14,
816,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best server Performance Monitoring Tool for Java Servers
===
At work, we are trying to combat the monstrosity that our application servers have become - we are now running out of server resources after many months of resource-creep.
I would like to begin the process of finding out what to investigate by seeing what people think the best server monitoring tools are.
Specifically, I'm interested in tools that work with Java and provide method hit counts and runtime, can run stress testing, report on Exception throws, uptime, load, etc. They don't necessarily all need to be a single tool, although that would be great.
What are the best tools out there for this sort of thing? How has your experience been with them? What are the costs involved?
Thanks! | 0 | [
2,
246,
8128,
956,
8984,
5607,
26,
8247,
17595,
800,
3726,
3726,
35,
170,
15,
95,
50,
749,
20,
2535,
14,
3521,
18,
3996,
18,
856,
30,
318,
3010,
17595,
57,
533,
13,
8,
95,
50,
130,
946,
70,
16,
8128,
2566,
75,
151,
818,
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... |
Is there an inverse function for time.gmtime() that parses a UTC tuple to seconds since the epoch ?
===
python's time module seems a little haphazard. For example, here is a list of methods in there, from the docstring:
time() -- return current time in seconds since the Epoch as a float
clock() -- return CPU time since process start as a float
sleep() -- delay for a number of seconds given as a float
gmtime() -- convert seconds since Epoch to UTC tuple
localtime() -- convert seconds since Epoch to local time tuple
asctime() -- convert time tuple to string
ctime() -- convert time in seconds to string
mktime() -- convert local time tuple to seconds since Epoch
strftime() -- convert time tuple to string according to format specification
strptime() -- parse string to time tuple according to format specification
tzset() -- change the local timezone
Looking at localtime() and its inverse mktime(), why is there no inverse for gmtime() ?
Bonus questions: what would you name the method ? How would you implement it ? | 0 | [
2,
25,
80,
40,
19,
9453,
1990,
26,
85,
9,
14020,
891,
5,
6,
30,
2017,
7202,
21,
13,
11440,
2289,
5106,
20,
2582,
179,
14,
24612,
13,
60,
800,
3726,
3726,
20059,
22,
18,
85,
12613,
2206,
21,
265,
13,
10463,
22961,
43,
9,
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... |
CouchDB Document Model Changes?
===
Rails uses the concept of migrations to deal with model changes using the ActiveRecord API.
CouchDB uses JSON (nested maps and arrays) to represent its model objects.
In working with CouchDB so far, I don't see good ways of recognizing when the document's structure has changed (other than being disciplined as a developer), or for migrating documents from an old to a new model.
Are there existing features or do you have best practices for handling model changes in CouchDB? | 0 | [
2,
4914,
9007,
4492,
1061,
1693,
60,
800,
3726,
3726,
2240,
18,
2027,
14,
2420,
16,
8443,
18,
20,
1183,
29,
1061,
1693,
568,
14,
1348,
14953,
21,
2159,
9,
4914,
9007,
2027,
487,
528,
13,
5,
2696,
1427,
6867,
17,
7718,
18,
6,
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... |
Real world Prolog usage
===
Many study Prolog in college, but I have personally not come in contact with it professionally. The traditional examples given are AI and expert system applications, but what have you used it for and what made Prolog a suitable language for the task? | 4 | [
2,
683,
126,
895,
5567,
7514,
800,
3726,
3726,
151,
949,
895,
5567,
19,
314,
15,
47,
31,
57,
7200,
52,
340,
19,
2203,
29,
32,
13550,
9,
14,
1361,
3770,
504,
50,
21,
49,
17,
5390,
329,
3767,
15,
47,
98,
57,
42,
147,
32,
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,
0,
0,
0,
0... |
Command line .cmd/.bat script, how to get directory of running script
===
How can you get the directory of the script that was run and use it within the .cmd file? | 0 | [
2,
1202,
293,
13,
9,
9095,
43,
118,
9,
4900,
3884,
15,
184,
20,
164,
16755,
16,
946,
3884,
800,
3726,
3726,
184,
92,
42,
164,
14,
16755,
16,
14,
3884,
30,
23,
485,
17,
275,
32,
363,
14,
13,
9,
9095,
43,
3893,
60,
3,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
DOS batch command(s) to read first line from text file
===
How can I read the first line from a text file using DOS batch commands? Since the file is large I only want to deal with the first line. | 0 | [
2,
107,
18,
13064,
1202,
5,
18,
6,
20,
1302,
64,
293,
37,
1854,
3893,
800,
3726,
3726,
184,
92,
31,
1302,
14,
64,
293,
37,
21,
1854,
3893,
568,
107,
18,
13064,
14294,
60,
179,
14,
3893,
25,
370,
31,
104,
259,
20,
1183,
29,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
throwing exceptions out of a destructor
===
Most people say *never* throw an exception out of a destructor - doing so results in undefined behavior. Stroustrup makes the point that *"the vector destructor explicitly invokes the destructor for every element. This implies that if an element destructor throws, the vector destruction fails... There is really no good way to protect against exceptions thrown from destructors, so the library makes no guarantees if an element destructor throws" (from Appendix E3.2)*.
[This article][1] seems to say otherwise - that throwing destructors are more or less okay.
*So my question is this - if throwing from a destructor results in undefined behavior, how do you handle errors that occur during a destructor?*
If an error occurs during a cleanup operation, do you just ignore it? If it is an error that can potentially be handled up the stack but not right in the destructor, doesn't it make sense to throw an exception out of the destructor?
Obviously these kinds of errors are rare, but possible.
[1]: http://www.kolpackov.net/projects/c++/eh/dtor-1.xhtml | 0 | [
2,
6033,
13392,
70,
16,
21,
13,
20137,
248,
800,
3726,
3726,
127,
148,
395,
1637,
9018,
2483,
3814,
40,
5391,
70,
16,
21,
13,
20137,
248,
13,
8,
845,
86,
1736,
19,
367,
13439,
3257,
9,
354,
6947,
38,
7964,
1364,
14,
454,
30,
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... |
Starteam 2005 COM API
===
Has anyone worked with the StarTeam COM API (Specifically, intergrating with C#).
I need to write a helper function that returns a directory structure out of Starteam, but all I've been able to retrieve using this API has been a list of views.
Has anyone else tried this? | 0 | [
2,
778,
6575,
812,
13,
960,
21,
2159,
800,
3726,
3726,
63,
1276,
577,
29,
14,
778,
6575,
13,
960,
21,
2159,
13,
5,
9219,
1326,
15,
1480,
15125,
68,
29,
272,
5910,
6,
9,
31,
376,
20,
2757,
21,
448,
106,
1990,
30,
4815,
21,
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... |
Windows Forms Threading and Events - most efficient way to hand off events?
===
My form receives asynchronous callbacks from another object on random worker threads. I have been passing the data to the main thread (where it can be used to update onscreen controls) using delegates as shown below. Performance is dreadful -- once I reach 500 updates per second, the program completely locks up. My GUI processing itself is not the problem, as I can simulate this level of updating within the form and have no problems. Is there a more efficient mechanism I should be using to hand off the data from thread to thread?
delegate void DStatus( MyStatus obj );
DStatus _status; // set to MainThreadOnStatus during construction
// this function only called on form's owner thread
void MainThreadOnStatus( MyStatus obj )
{
// screen updates here as needed
}
// this function called by arbitrary worker threads in external facility
void OnStatus( MyStatus obj )
{
this.BeginInvoke( _status, obj );
}
| 0 | [
2,
1936,
1997,
9322,
68,
17,
963,
13,
8,
127,
8243,
161,
20,
224,
168,
963,
60,
800,
3726,
3726,
51,
505,
8359,
21,
16023,
1291,
645,
1958,
18,
37,
226,
3095,
27,
5477,
7444,
20396,
9,
31,
57,
74,
2848,
14,
1054,
20,
14,
407,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
IE6 issues with transparent PNGs
===
I've gotten used to the idea that if I want/need to use alpha-trans PNGs in a cross-browser manner, that I use a background image on a div and then, in IE6-only CSS, mark the background as "none" and include the proper "filter" argument.
Is there another way? A better way? Is there a way to do this with the img tag and not with background images?
| 0 | [
2,
13,
660,
379,
1549,
29,
14862,
351,
2723,
18,
800,
3726,
3726,
31,
22,
195,
4094,
147,
20,
14,
882,
30,
100,
31,
259,
118,
556,
69,
20,
275,
5705,
8,
7028,
351,
2723,
18,
19,
21,
919,
8,
25699,
4104,
3832,
15,
30,
31,
275... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP.NET not seeing Radio Button value change
===
I have a form with some radio buttons that are disabled by default.
When a value gets entered into a text box, the radio buttons are enabled via javascript. The user then selects one of the radio buttons and clicks on a submit button which posts back to the server.
When I get back to the server, the radio button that user clicked is not showing as checked. I'll use 'rbSolid' as the radio button I'm focusing on.
I handle the 'onclick' event of the radio buttons, but I don't have the function doing anything yet other than firing:
> Me.rbSolid.Attributes.Add("onclick", "styleLookupChanged(this);")
On the client, this enables the radio button when the textbox value is changed:
> document.getElementById("ctl00_MainLayoutContent_WebPanel4_rbSolid").disabled = false;
I then click the radio button then post back via a button, but back on the server this is always false:
> If Me.rbSolid.Checked Then...
If I have the radio button enabled by default, it shows as checked correctly.
Thanks for any help! | 0 | [
2,
28,
306,
9,
2328,
52,
2078,
603,
5167,
1923,
753,
800,
3726,
3726,
31,
57,
21,
505,
29,
109,
603,
12861,
30,
50,
10154,
34,
12838,
9,
76,
21,
1923,
3049,
1297,
77,
21,
1854,
1649,
15,
14,
603,
12861,
50,
9338,
1197,
8247,
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... |
config file syntax for configuring WCF Webservice Client Target EndPoint
===
What is the web config syntax for specifying a WCF WebService Proxy's Default Target Endpoint?
Specifically, I'm trying to configure the address that the client uses for locating the .asmx of the webservice | 0 | [
2,
13,
14093,
2816,
3893,
22649,
26,
1065,
13549,
68,
11801,
410,
2741,
11449,
6819,
2935,
241,
3132,
800,
3726,
3726,
98,
25,
14,
2741,
13,
14093,
2816,
22649,
26,
19077,
68,
21,
11801,
410,
2741,
11449,
27188,
22,
18,
12838,
2935,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 free/pay web service that I can query to get MLS data?
===
Given an MLS#, I'd like to get an XML document with details about the listing, like address, price and such. | 0 | [
2,
25,
80,
21,
551,
118,
12224,
2741,
365,
30,
31,
92,
25597,
20,
164,
19164,
1054,
60,
800,
3726,
3726,
504,
40,
19164,
5910,
15,
31,
22,
43,
101,
20,
164,
40,
23504,
4492,
29,
3289,
88,
14,
9554,
15,
101,
3218,
15,
2162,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to restore and save a selection in internet explorer
===
I'm using javascript to save and restore the selection in internet explorer, but it doesn't seem to always work. What I'm doing in IE this:
// Save the selection
var selection = document.selection;
var range = selection.createRange();
// Restore the selection
range.select();
This is all that I'm doing, there is no Step 3 in between the saving and restoring the selection, and yet in certain circumstances the cursor moves. It doesn't seem to happen unless the selection is empty (ie. I have a blinking cursor, but no text), and it depends on the markup. It seems that whenever the cursor is at the end of a text node that immediately precedes a block node, the saved selection is wrong. An example of the markup is this:
<div>Some text|
<p>Next text</p>
</div>
The cursor is at the position of the pipe character. After the javascript above, it becomes:
<div>Some text
<p>|Next text</p>
</div>
It seems that the range is still in the correct position (if I call parentElement on the range it returns the div), but if I get a new range from the current selection, the new range is inside the paragraph tag, and that is its parentElement. How do I work around this and consistently save and restore the selection in internet explorer?
| 0 | [
2,
184,
20,
8454,
17,
2079,
21,
3155,
19,
2620,
8520,
800,
3726,
3726,
31,
22,
79,
568,
8247,
8741,
20,
2079,
17,
8454,
14,
3155,
19,
2620,
8520,
15,
47,
32,
1437,
22,
38,
2260,
20,
550,
170,
9,
98,
31,
22,
79,
845,
19,
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 can i change this view?
===
I want to index this view but because it has subquery i cant index. Can anyone suggest how to change this view so that i can index it.
ALTER VIEW [dbo].[Recon2]
WITH SCHEMABINDING
AS
SELECT
dbo.Transactions.CustomerCode,
dbo.Customer_Master.CustomerName,
dbo.Transactions.TransDate,
dbo.Transactions.PubCode,
dbo.Transactions.TransType,
dbo.Transactions.Copies,
SUM(dbo.Transactions.TotalAmount) AS TotalAmount,
'0' AS ReceiptNo,
'2008-01-01' AS PaymentDate,
0 AS Amount,
dbo.Transactions.Period,
dbo.Transactions.Year,
dbo.Publication_Master.PubName,
dbo.Customer_Master.SalesCode,
COUNT_BIG(*) AS COUNT
FROM
dbo.Publication_Master INNER JOIN
dbo.Customer_Master INNER JOIN
dbo.Transactions ON dbo.Customer_Master.CustomerCode = dbo.Transactions.CustomerCode ON
dbo.Publication_Master.PubCode = dbo.Transactions.PubCode
WHERE
(dbo.Customer_Master.CustomerCode NOT IN
(SELECT CustomerCode
FROM dbo.StreetSaleRcpt
WHERE (PubCode = dbo.Transactions.PubCode) AND
(TransactionDate = dbo.Transactions.TransDate) AND
(Updated = 1) AND
(PeriodMonth = dbo.Transactions.Period) AND
(PeriodYear = dbo.Transactions.Year)))
GROUP BY dbo.Transactions.CustomerCode, dbo.Customer_Master.CustomerName, dbo.Transactions.TransDate, dbo.Transactions.PubCode,
dbo.Publication_Master.PubName, dbo.Customer_Master.SalesCode, dbo.Transactions.[Update], dbo.Transactions.TransType,
dbo.Transactions.Copies, dbo.Transactions.Period, dbo.Transactions.Year, dbo.Transactions.TotalAmount | 0 | [
2,
184,
92,
31,
753,
48,
1418,
60,
800,
3726,
3726,
31,
259,
20,
4348,
48,
1418,
47,
185,
32,
63,
972,
8190,
93,
31,
2973,
4348,
9,
92,
1276,
5601,
184,
20,
753,
48,
1418,
86,
30,
31,
92,
4348,
32,
9,
7835,
1418,
636,
43,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Expressing an is-a relationship in a relational database
===
I was wondering if there is a clean way to represent an is-a relationship as illustrated by this example:
This DB stores recording times for three types of programs: movies, game shows, drama. In an object oriented sense each of these is-a program. Each of these subclasses have different properties. Here are the tables (fk prefix indicates a foreign key):
*movie*<br>
id<br>
name<br>
fkDirector<br>
*gameShow*<br>
id<br>
name<br>
fkHost<br>
fkContestant<br>
*drama*<br>
id<br>
name<br>
In OO terms the record table would in sense look like this:<br><br>
*record*<br>
id<br>
fkProgram<br>
startTime<br>
endTime<br>
The only way I can think of doing this without violating the normal forms is to have three record tables namely *recordMovie*, *recordGameShow*, and *recordDrama*.
Is there a way to consolidate these tables into one without violating the principles of database normalization?
Here are some non-working examples to illustrate the idea:
*program*<br>
id<br>
fkMovie<br>
fkGameShow<br>
fkDrama<br>
This table violates the first normal form because it will contain nulls. For each row only one of the 3 entries will be non null.
*program*<br>
id<br>
fkSpecific ← fkMovie OR fkGameShow OR fkDrama<br>
fkType ← would indicate what table to look into<br>
Here I will not be able to enforce referential integrity because the fkSpecific could potentially point to one of three tables.
I'm just trying to save the overhead of having 3 tables here instead of one. Maybe this simply isn't applicable to an RDB. | 0 | [
2,
16621,
40,
25,
8,
58,
1429,
19,
21,
5827,
192,
6018,
800,
3726,
3726,
31,
23,
5712,
100,
80,
25,
21,
2745,
161,
20,
3501,
40,
25,
8,
58,
1429,
28,
6607,
34,
48,
823,
45,
48,
13,
9007,
4134,
1576,
436,
26,
132,
2551,
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... |
Is it possible to modify a registry entry via a .bat/.cmd script?
===
Is it possible to modify a registry value (whether string or DWORD) via a .bat/.cmd script? | 0 | [
2,
25,
32,
938,
20,
17579,
21,
18269,
2792,
1197,
21,
13,
9,
4900,
118,
9,
9095,
43,
3884,
60,
800,
3726,
3726,
25,
32,
938,
20,
17579,
21,
18269,
1923,
13,
5,
26340,
3724,
54,
13,
43,
9587,
6,
1197,
21,
13,
9,
4900,
118,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What's the best way to instantiate a generic from its name?
===
Assuming I have only the class name of a generic as a string in the form of "MyCustomGenericCollection(of MyCustomObjectClass)" and don't know the assembly it comes from, what is the easiest way to create an instance of that object?
If it helps, I know that the class implements IMyCustomInterface and is from an assembly loaded into the current AppDomain.
Markus Olsson gave an excellent example [here][1], but I don't see how to apply it to generics.
[1]: http://stackoverflow.com/questions/31238/c-instantiating-classes-from-xml | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
6322,
15882,
21,
12733,
37,
82,
204,
60,
800,
3726,
3726,
11704,
31,
57,
104,
14,
718,
204,
16,
21,
12733,
28,
21,
3724,
19,
14,
505,
16,
13,
7,
915,
4636,
6015,
17083,
596,
15015,
872,
5,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is a good algorithm for compacting records in a blocked file?
===
Suppose you have a large file made up of a bunch of fixed size blocks. Each of these block contains some number of variable sized records. Each record must fit completely within a single block and then such records by definition are never larger than a full block. Over time, records are added to and deleted from these blocks as records come and go from this "database".
At some point, especially after perhaps many records are added to the database and several are removed - many of the blocks may end up only partially filled.
What is a good algorithm to shuffle the records around in this database to compact out unnecessary blocks at the end of the file by better filling up the partially filled blocks?
Requirements of the algorithm:
- The compaction must happen in place of the original file without temporarily extending the file by more than a few blocks at most from its starting size
- The algorithm should not unnecessary disturb blocks that are already mainly full
- Only entire blocks can be read or written from/to the file at one time
- If records are moved from one block to another they must be added at their new location before being removed from their starting position so that in case the operation is interrupted no records are lost as a result of the "failed" compaction. (Assume that this temporary duplication of such records can be detected at recovery).
- The memory that can be used for this operation can only be on the order of perhaps several blocks which is a very small percentage of the overall file size
- Assume that records are on the order of 10 bytes to 1K bytes with an average size of maybe 100 bytes. The fixed sized blocks are on the order of 4K or 8K and that the file is on the order of 1000's of blocks.
| 0 | [
2,
98,
25,
21,
254,
9083,
26,
8285,
68,
742,
19,
21,
8388,
3893,
60,
800,
3726,
3726,
5787,
42,
57,
21,
370,
3893,
117,
71,
16,
21,
7653,
16,
3535,
1072,
5198,
9,
206,
16,
158,
1921,
1588,
109,
234,
16,
7612,
13,
6560,
742,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 do a SVN export without shell access?
===
I started using subversion for one of my projects and it would be absolutely amazing if I could just export the latest version from the repository on my production server by for example running a php or perl script.
The production site is hosted with a shared hosting provider who doesn't allow shell access or for example the php [exec][1] command. (I don't know much about perl; I only know that my hoster allows perl and custom cgi scripts).
Is it possible to perform a SVN export in this environment?
[1]: http://uk2.php.net/manual/en/function.exec.php | 0 | [
2,
25,
32,
938,
20,
107,
21,
13,
18,
16578,
7487,
366,
3593,
1381,
60,
800,
3726,
3726,
31,
373,
568,
972,
10898,
26,
53,
16,
51,
2314,
17,
32,
83,
44,
6916,
5289,
100,
31,
110,
114,
7487,
14,
5736,
615,
37,
14,
24869,
27,
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... |
How to package a Linux binary for my Open Source application?
===
I have an Open Source app and I currently only post the binary for the Windows build. At this point Linux users have to get the source and compile it. Is there a standard way for posting a Linux binary?
My app is in c / c++ and compiled with gcc, the only external Linux code I use is X Windows and CUPS.
| 0 | [
2,
184,
20,
6030,
21,
13024,
14171,
26,
51,
368,
1267,
3010,
60,
800,
3726,
3726,
31,
57,
40,
368,
1267,
4865,
17,
31,
871,
104,
678,
14,
14171,
26,
14,
1936,
1895,
9,
35,
48,
454,
13024,
3878,
57,
20,
164,
14,
1267,
17,
26561... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Sending an HTTP request to a different IP than what the hostname resolves to?
===
I want to be able to send an HTTP request to "admin.foo.com", but have the request go to an IP which does not map to "admin.foo.com" in DNS. I know I can edit **/etc/hosts** to do this, but I'd like to avoid doing that.
To explicate, normally when you browse to `"http://admin.foo.com"`, it sends an HTTP request that looks something like this:
GET / HTTP/1.0
User-Agent: Wget/1.10.2 (well, it'd be Firefox, but you get the point)
Accept: */*
Host: admin.foo.com
Connection: Keep-Alive
...and that request is sent to admin.foo.com's IP, which (let's say) is 10.0.0.1. The "Host" header is extracted from the URL, and that header is what Apache uses to determine which virtual host to use. If I put the IP address of admin.foo.com into Firefox, it sends the request to the right server, but the Host field has the IP address in it, and then Apache doesn't know what vhost to use, and defaults to using no vhost at all, which (in its config) causes a 403/Forbidden, so I can't navigate to the new server's IP to test this.
Again, I know I can use **/etc/hosts** for this, but I'd like to avoid doing so, and I figure Firefox must have some sekrit way to do this ;)
| 2 | [
2,
4907,
40,
7775,
3772,
20,
21,
421,
15735,
119,
98,
14,
2015,
7259,
9854,
18,
20,
60,
800,
3726,
3726,
31,
259,
20,
44,
777,
20,
2660,
40,
7775,
3772,
20,
13,
7,
1283,
2160,
9,
4120,
111,
9,
960,
7,
15,
47,
57,
14,
3772,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I use a generated variable name in PHP?
===
I have a bunch a values I would like to add together which are entered into a form. Right now, the form has 11 lines but it could get larger in the future. I can easily add all the values together with something like:
$total = $value1 + $value2 + ... + $value11;
All the values I want to add together are coming from an HTML form. I want to avoid javascript.
But, I want to avoid having to manually do it, especially if it grows much larger. This is my attempt at adding all the values together using a loop but it returns an "undefined variable" error (it is just some test code to try out the idea):
<?php
$tempTotal = 0;
$pBalance1 = 5;
$pBalance2 = 5;
$pBalance3 = 5;
for ($i = 1 ; $i <= 3 ; $i++){
$tempTotal = $tempTotal + $pBalance.$i;
}
echo $tempTotal;
?>
Is what I want to do possible in PHP?
| 0 | [
2,
92,
31,
275,
21,
6756,
7612,
204,
19,
13,
26120,
60,
800,
3726,
3726,
31,
57,
21,
7653,
21,
4070,
31,
83,
101,
20,
3547,
429,
56,
50,
1297,
77,
21,
505,
9,
193,
130,
15,
14,
505,
63,
547,
1560,
47,
32,
110,
164,
1662,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I efficiently filter computed values within a Python list comprehension?
===
The Python list comprehension syntax makes it easy to filter values within a comprehension. For example:
result = [x**2 for x in mylist if type(x) is int]
Will return a list of the squares of integers in mylist. However, what if the test involves some (costly) computation and you want to filter on the result? One option is:
result = [expensive(x) for x in mylist if expensive(x)]
This will result in a list of non-"false" expensive(x) values, however expensive() is called twice for each x. Is there a comprehension syntax that allows you to do this test while only calling expensive once per x?
| 0 | [
2,
184,
107,
31,
20519,
11945,
26331,
4070,
363,
21,
20059,
968,
27300,
60,
800,
3726,
3726,
14,
20059,
968,
27300,
22649,
1364,
32,
2010,
20,
11945,
4070,
363,
21,
27300,
9,
26,
823,
45,
829,
800,
636,
396,
1409,
135,
26,
993,
19... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Impact of AWS Account Identifiers
===
I'm using Amazon's tools to build a web app. I'm very happy with them, but I have a security concern.
Right now, I'm using multiple EC2 instances, S3, SimpleDB and SQS. In order to authenticate requests to the different services, you include your [Access Identifiers][1] (login required).
For example, to upload a file to S3 from an EC2 instance, your EC2 instance needs to have your *Access Key ID* and your *Secret Access Key*.
That basically means your username and password need to be in your instances.
If one of my instances were to be compromised, all of my Amazon assets would be compromised. The keys can be used upload/replace S3 and SimpleDB data, start and stop EC2 instances, etc.
How can I minimize the damage of a single compromised host?
My first thought is to get multiple identifiers per account so I can track changes made and quickly revoke the 'hacked' account. Amazon doesn't support more than one set of credentials per account.
My second thought was to create multiple accounts and use ACL's to control access. Unfortunately, not all the services support granting other accounts access to your data. Plus bandwidth is cheaper the more that you use, so having it all go through one account is ideal.
Has anyone dealt with, or at least thought about this problem?
[1]: https://aws-portal.amazon.com/gp/aws/developer/account/index.html?ie=UTF8&awscredential=&action=access-key | 0 | [
2,
2261,
16,
21,
10268,
2176,
25570,
18,
800,
3726,
3726,
31,
22,
79,
568,
8059,
22,
18,
4672,
20,
1895,
21,
2741,
4865,
9,
31,
22,
79,
253,
1700,
29,
105,
15,
47,
31,
57,
21,
1221,
3630,
9,
193,
130,
15,
31,
22,
79,
568,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Lots of the tests int the test suite are failing! Any advice on debugging it?
===
I already solved this but thought I'd ask anyway...
I have a large application with a reasonably comprehensive test suite and unit test system. I was working on it and made a change that shouldn't have broken anything and suddenly dozens of test are failing. What should I do?
| 0 | [
2,
7503,
16,
14,
4894,
19,
38,
14,
1289,
6160,
50,
7250,
187,
186,
4978,
27,
121,
16254,
2762,
32,
60,
800,
3726,
3726,
31,
614,
15091,
48,
47,
289,
31,
22,
43,
1349,
2774,
9,
9,
9,
31,
57,
21,
370,
3010,
29,
21,
19531,
7041... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 eager load objects with a custom join in rails?
===
###Background
Normal rails eager-loading of collections works like this:
Person.find(:all, :include=>:companies)
This generates some sql which does
LEFT OUTER JOIN companies ON people.company_id = companies.id
###Question
However, I need a custom join (this could also arise if I was using `find_by_sql`) so I can't use the vanilla `:include => :companies`
The custom join/sql will get me all the data I need, but how can I tell activerecord that it belongs to the associated `Company` objects rather than just being a pile of extra rows? | 0 | [
2,
184,
20,
8705,
6305,
3916,
29,
21,
5816,
1865,
19,
2240,
18,
60,
800,
3726,
3726,
6926,
5910,
5910,
1958,
8810,
1826,
2240,
18,
8705,
8,
16866,
16,
5721,
693,
101,
48,
45,
840,
9,
19811,
5,
45,
1233,
15,
13,
45,
22640,
3726,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.cmd and .bat file converting return code to an error message
===
I'm trying to automate a program I made with a test suite via a .cmd file.
I can get the program that I ran's return code via %errorlevel%.
My program has certain return codes for each type of error.
For example:
1 - means failed for such and such a reason
2 - means failed for some other reason
...
echo FAILED: Test case failed, error level: %errorlevel% >> TestSuite1Log.txt
Instead I'd like to somehow say:
echo FAILED: Test case failed, error reason: lookupError(%errorlevel%) >> TestSuite1Log.txt
Is this possible with a .bat file? Or do I have to move to a scripting language like python/perl? | 0 | [
2,
13,
9,
9095,
43,
17,
13,
9,
4900,
3893,
19583,
788,
1797,
20,
40,
7019,
2802,
800,
3726,
3726,
31,
22,
79,
749,
20,
3108,
5281,
21,
625,
31,
117,
29,
21,
1289,
6160,
1197,
21,
13,
9,
9095,
43,
3893,
9,
31,
92,
164,
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... |
streaming wav files
===
I have a server that sends data via a socket, the data is a wav 'file'. I can easily write the data to disk and then play it in WMP, but I have no idea how I can play it as I read it from the socket. Is it possible?
Bonus question: how would I do it if the stream was in mp3 or other format?
This is for windows in native C++.
| 0 | [
2,
11920,
3142,
710,
6488,
800,
3726,
3726,
31,
57,
21,
8128,
30,
11350,
1054,
1197,
21,
18482,
15,
14,
1054,
25,
21,
3142,
710,
13,
22,
16877,
22,
9,
31,
92,
2351,
2757,
14,
1054,
20,
8582,
17,
94,
418,
32,
19,
619,
2554,
15,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the proper way to inject a data access dependency for lazy loading?
===
What is the proper way to inject a data access dependency when I do lazy loading?
For example I have the following class structure
class CustomerDao : ICustomerDao
public Customer GetById(int id) {...}
class Transaction {
int customer_id; //Transaction always knows this value
Customer _customer = null;
ICustomerDao _customer_dao;
Customer GetCustomer() {
if(_customer == null)
_customer = _customer_dao.GetById(_customer_id);
return _customer
}
How do I get the reference to _customer_dao into the transaction object? Requiring it for the constructor seems like it wouldn't really make sense if I want the Transaction to at least look like a POCO. Is it ok to have the Transaction object reference the Inversion of Control Container directly? That also seems awkward too.
How do frameworks like NHibernate handle this? | 0 | [
2,
98,
25,
14,
4119,
161,
20,
20316,
21,
1054,
1381,
26835,
26,
16792,
12797,
60,
800,
3726,
3726,
98,
25,
14,
4119,
161,
20,
20316,
21,
1054,
1381,
26835,
76,
31,
107,
16792,
12797,
60,
26,
823,
31,
57,
14,
249,
718,
1411,
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... |
Getting stated with NHibernate. Real world project example?
===
One of my goals over the next few months is to get familiar with NHibernate and am curious if anyone out there has any suggestions of where to begin. Preferably, I'd like to find a example project that demonstrates what you would see in an in-the-field application. | 0 | [
2,
1017,
1240,
29,
12109,
15191,
8820,
9,
683,
126,
669,
823,
60,
800,
3726,
3726,
53,
16,
51,
1547,
84,
14,
328,
310,
818,
25,
20,
164,
3694,
29,
12109,
15191,
8820,
17,
589,
7686,
100,
1276,
70,
80,
63,
186,
18389,
16,
113,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Cross-model relationships in NSManagedObjectModel from merged models?
===
Is it possible to model relationships between entities that are defined in separate NSManagedObjectModels if the entities are always used within an NSManagedObjectModel that is created by merging the relevant models?
For example, say model 1 defines an entity `Foo` with relationship (one-to-one) `toBar` and that model 2 defines an entity `Bar` with a relationship (one-to-one) `toFoo`. I will build a CoreData stack using `NSManagedObjectModel.mergedModelFromModels`, merging model 1 and model 2. Is there any way to define these relationships either in the data modeler or programatically so that they behave as if they were in-model relationships? | 0 | [
2,
919,
8,
13998,
5833,
19,
13,
2172,
177,
8030,
23793,
13998,
37,
3901,
2761,
60,
800,
3726,
3726,
25,
32,
938,
20,
1061,
5833,
128,
12549,
30,
50,
2811,
19,
1725,
13,
2172,
177,
8030,
23793,
13998,
18,
100,
14,
12549,
50,
550,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Haskell newbie: use layout or not? What are the pro's and con's (use examples)
===
I cant seem to find much info on haskells layout features, as I understand it is something like pythons formatting requirements except that is optional. How can I choose not to use this option correctly? Would it be a good idea to start without it so that I get a solid feel for the language itself? | 0 | [
2,
63,
16507,
78,
5893,
45,
275,
9106,
54,
52,
60,
98,
50,
14,
895,
22,
18,
17,
1065,
22,
18,
13,
5,
3699,
3770,
6,
800,
3726,
3726,
31,
2973,
2260,
20,
477,
212,
15404,
27,
63,
16507,
18,
9106,
967,
15,
28,
31,
1369,
32,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 pass a member function pointer?
===
I am trying to pass a member function within a class to a function that takes a member function class pointer. The problem I am having is that I am not sure how to properly do this within the class using the this pointer. Does anyone have suggestions?
Here is a copy of the class that is passing the member function:
class testMenu : public MenuScreen{
public:
bool draw;
MenuButton<testMenu> x;
testMenu():MenuScreen("testMenu"){
x.SetButton(100,100,TEXT("buttonNormal.png"),TEXT("buttonHover.png"),TEXT("buttonPressed.png"),100,40,&this->test2);
draw = false;
}
void test2(){
draw = true;
}
};
The function x.SetButton(...) is contained in another class, where "object" is a template.
void SetButton(int xPos, int yPos, LPCWSTR normalFilePath, LPCWSTR hoverFilePath, LPCWSTR pressedFilePath, int Width, int Height, void (object::*ButtonFunc)()) {
BUTTON::SetButton(xPos, yPos, normalFilePath, hoverFilePath, pressedFilePath, Width, Height);
this->ButtonFunc = &ButtonFunc;
}
If anyone has any advice on how I can properly send this function so that I can use it later. | 0 | [
2,
184,
107,
42,
1477,
21,
322,
1990,
454,
106,
60,
800,
3726,
3726,
31,
589,
749,
20,
1477,
21,
322,
1990,
363,
21,
718,
20,
21,
1990,
30,
1384,
21,
322,
1990,
718,
454,
106,
9,
14,
1448,
31,
589,
452,
25,
30,
31,
589,
52,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
nhibernate problem
===
nHibernate is not able to retrieve manually changed data from repository table? I have disabled second level cache also but looks like it(nhibernate) is retrieving sometimes from cache and sometimes from repository table.
| 0 | [
2,
12109,
15191,
8820,
1448,
800,
3726,
3726,
12109,
15191,
8820,
25,
52,
777,
20,
11917,
23671,
1015,
1054,
37,
24869,
859,
60,
31,
57,
10154,
153,
662,
16522,
67,
47,
1879,
101,
32,
5,
13880,
15191,
8820,
6,
25,
13,
6239,
3272,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.