unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Anyone implemented Endeca with .NET? Would you recommend Endeca or FAST?
===
Which search engine would you recommend for a Commerce website?
We have millions of products in a catalog and we want it to be as quick as possible.
We would also want to make sure that the marketing driven through the search engine will be fast and effective.
What are your opinions? | 0 | [
2,
1276,
6807,
1957,
16512,
29,
13,
9,
2328,
60,
83,
42,
12360,
1957,
16512,
54,
1512,
60,
800,
3726,
3726,
56,
2122,
1406,
83,
42,
12360,
26,
21,
5577,
2271,
60,
95,
57,
11999,
16,
1985,
19,
21,
10594,
17,
95,
259,
32,
20,
44... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I read multiple tables into a dataset?
===
I have a stored procedure that returns multiple tables. How can I execute and read both tables?
I have something like this:
<pre>
<code>
SqlConnection conn = new SqlConnection(CONNECTION_STRING);
SqlCommand cmd = new SqlCommand("sp_mult_tables",conn);
cmd.CommandType = CommandType.StoredProcedure);
IDataReader rdr = cmd.ExecuteReader();
</code>
</pre>
I'm not sure how to read it...whats the best way to handle this type of query, I am guessing I should read the data into a DataSet? How is the best way to do this?
Thanks. | 0 | [
2,
184,
92,
31,
1302,
1886,
7484,
77,
21,
1054,
3554,
60,
800,
3726,
3726,
31,
57,
21,
8214,
7004,
30,
4815,
1886,
7484,
9,
184,
92,
31,
15644,
17,
1302,
156,
7484,
60,
31,
57,
301,
101,
48,
45,
13,
1,
3515,
1,
13,
1,
9375,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Application Object and Concurrency Concerns
===
In some asp tutorials, like <a href="http://www.4guysfromrolla.com/webtech/050900-1.shtml">this</a>, i observe the following pattern:
>Application.Lock
>'do some things with the application object
>Application.Unlock
However, since web pages can have multiple instances, there is an obvious concurrency problem. So my questions are the following:
What if one page tries to lock while the object is already locked?
Is there a way to detect whether the application object is locked?
Is it better to just work on un unlocked application object or does that have other consequences? | 0 | [
2,
3010,
3095,
17,
25547,
4823,
800,
3726,
3726,
19,
109,
28,
306,
29724,
18,
15,
101,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
6483,
9,
300,
19979,
18,
2665,
8694,
58,
9,
960,
118,
14113,
6524,
118,
22974,
10289,
8,
165,
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... |
Is there a caching script for classic asp?
===
PHP has a number of opcode caches, which as i understand it are scripts that handle the caching aspects of an application. Is there something similar for classic asp, especially something that does not require component installation? | 0 | [
2,
25,
80,
21,
1658,
7192,
3884,
26,
2732,
28,
306,
60,
800,
3726,
3726,
13,
26120,
63,
21,
234,
16,
3088,
9375,
16522,
18,
15,
56,
28,
31,
1369,
32,
50,
17505,
30,
3053,
14,
1658,
7192,
4842,
16,
40,
3010,
9,
25,
80,
301,
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,
0,
0... |
What is the simplest, most maintainable way to create a SQL Server ODBC Data Source?
===
I can do this by directly accessing the Registry. It would be better if this could be done via an available (SQL Server/Windows) API to protect against changes in the registry keys with updated SQL Server drivers. | 0 | [
2,
98,
25,
14,
24384,
15,
127,
4027,
579,
161,
20,
1600,
21,
4444,
255,
8128,
12340,
7229,
1054,
1267,
60,
800,
3726,
3726,
31,
92,
107,
48,
34,
1703,
1381,
68,
14,
18269,
9,
32,
83,
44,
574,
100,
48,
110,
44,
677,
1197,
40,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
makefiles - compile all c files at once
===
I want to experiment with GCC whole program optimizations. To do so I have to pass all C-files at once to the compiler frontend. However, I use makefiles to automate my build process, and I'm not an expert when it comes to makefile magic.
How should I modify the makefile if I want to compile (maybe even link) using just one call to GCC?
For reference - my makefile looks like this:
LIBS = -lkernel32 -luser32 -lgdi32 -lopengl32
CFLAGS = -Wall
OBJ = 64bitmath.o \
monotone.o \
node_sort.o \
planesweep.o \
triangulate.o \
prim_combine.o \
welding.o \
test.o \
main.o
%.o : %.c
gcc -c $(CFLAGS) $< -o $@
test: $(OBJ)
gcc -o $@ $^ $(CFLAGS) $(LIBS)
| 0 | [
2,
233,
16877,
18,
13,
8,
26561,
65,
272,
6488,
35,
382,
800,
3726,
3726,
31,
259,
20,
5737,
29,
489,
3384,
979,
625,
21597,
18,
9,
20,
107,
86,
31,
57,
20,
1477,
65,
272,
8,
16877,
18,
35,
382,
20,
14,
21486,
431,
2451,
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... |
Data exceeds field length after being hex-sanitized
===
The problem is you can't really tell the user how many characters are allowed in the field, because the escaped value, obviously, has more characters than the unescaped one.
I see a few solutions, but none looks very good:
- One whitelist for each field *(too much work and doesn't quite solve the problem)*
- One blacklist for each field *(same as above)*
- Use a field length that could hold the data even if all characters are escaped *(bad)*
- Uncap the size for the database field *(worse)*
- Save the data hex-unescaped and pass the responsibility entirely to output filtering *(not very good)*
- Let the user guess the maximum size *(worst)*
Are there other options? Is there a "best practice" for this case? | 0 | [
2,
1054,
11976,
18,
575,
1476,
75,
142,
24,
396,
8,
2729,
242,
1333,
800,
3726,
3726,
14,
1448,
25,
42,
92,
22,
38,
510,
494,
14,
4155,
184,
151,
1766,
50,
1159,
19,
14,
575,
15,
185,
14,
5409,
1923,
15,
4409,
15,
63,
91,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Out of Memory - Infinite Loop - ASP.NET AJAX Framework
===
We're running on .NET 3.5 SP1.
Recently, in IE, some of our users started getting "Out of Memory" errors once in a while. This doesn't happen all the time. I managed to replicate it a couple times and I found that this code, from the AjaxControlToolkit.Common.Common.js file, was causing an infinite loop:
AjaxControlToolkit.TextBoxWrapper.registerClass('AjaxControlToolkit.TextBoxWrapper',
Sys.UI.Behavior);AjaxControlToolkit.TextBoxWrapper.validatorGetValue =
function(id) {
var control = $get(id);if (control && control.AjaxControlToolkitTextBoxWrapper)
{
return control.AjaxControlToolkitTextBoxWrapper.get_Value();}
return AjaxControlToolkit.TextBoxWrapper._originalValidatorGetValue(id);}
The last line (which calls _originalValidatorGetValue) basically calls back this exact function over and over because control.AjaxControlToolkitTextBoxWrapper is undefined.
The function defined right above it is AjaxControlToolkit.TextBoxWrapper.get_Wrapper(control) and could be use to create the wrapper if it doesn't exist, but I don't get the feeling I want to be changing the framework if I'm the only one who's seen this bug in the wild.
The bug does not always occur. It seems to occur when the first URL that is loaded contains an AJAX history point. If you open up a page and play with it, causing history points to be added, it works fine. But if you copy-paste the URL into another browser windows, you will get this problem.
Therefore, my guess is I am doing something wrong with the history control that doesn't setup the wrappers properly. Even so, there appears to be an infinite loop in there.
Any ideas/clues? | 0 | [
2,
70,
16,
1912,
13,
8,
9698,
5293,
13,
8,
28,
306,
9,
2328,
20624,
6596,
800,
3726,
3726,
95,
22,
99,
946,
27,
13,
9,
2328,
203,
9,
264,
3782,
165,
9,
1989,
15,
19,
13,
660,
15,
109,
16,
318,
3878,
373,
1017,
13,
7,
1320,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Either OR non-null constraints in MySQL
===
What's the best way to create a non-NULL constraint in MySQL such that fieldA and fieldB can't both be NULL. I don't care if either one is NULL by itself, just as long as the other field has a non-NULL value. And if they both have non-NULL values, then it's even better. | 0 | [
2,
694,
54,
538,
8,
4215,
211,
16747,
19,
51,
18,
22402,
800,
3726,
3726,
98,
22,
18,
14,
246,
161,
20,
1600,
21,
538,
8,
4215,
211,
28804,
19,
51,
18,
22402,
145,
30,
575,
58,
17,
575,
220,
92,
22,
38,
156,
44,
16203,
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... |
Language features to implement relational algebra
===
I've been trying to encode a relational algebra in Scala (which to my knowlege has one of the most advanced type systems) and just don't seem to find a way to get where I want.
As I'm not that experienced with the academic field of programming language design I don't really know what feature to look for.
So what language features would be needed, and what language has those features, to implement a statically verified relational algebra?
Some of the requirements:
A Tuple is a function mapping names from a statically defined set of valid names for the tuple in question to values of the type specified by the name. Lets call this name-type set the domain.
A Relation is a Set of Tuples with the same domain such that the range of any tuple is uniqe in the Set
So far the model can eaisly be modeled in Scala simply by
trait Tuple
trait Relation[T<Tuple] extends Set[T]
The vals, vars and defs in Tuple is the name-type set defined above. But there should'n be two defs in Tuple with the same name. Also vars and impure defs should probably be restricted too.
Now for the tricky part:
A join of two relations is a relation where the domain of the tuples is the union of the domains from the operands tuples. Such that only tuples having the same ranges for the intersection of their domains is kept.
def join(r1:Relation[T1],r2:Relation[T2]):Relation[T1 with T2]
should do the trick.
A projection of a Relation is a Relation where the domain of the tuples is a subset of the operands tuples domain.
def project[T2](r:Relation[T],?1):Relation[T2>:T]
This is where I'm not sure if it's even possible to find a sollution. What do you think? What language features are needed to define project?
Implied above offcourse is that the API has to be usable. Layers and layers of boilerplate is not acceptable. | 0 | [
2,
816,
967,
20,
8713,
5827,
192,
10999,
800,
3726,
3726,
31,
22,
195,
74,
749,
20,
20523,
21,
5827,
192,
10999,
19,
25975,
13,
5,
2140,
20,
51,
143,
413,
834,
63,
53,
16,
14,
127,
2255,
1001,
1242,
6,
17,
114,
221,
22,
38,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Commandline Jabber client
===
I need a simple scriptable/commandline jabber client. What is the best and/or simplest one to install? | 0 | [
2,
1202,
1143,
11284,
2102,
6819,
800,
3726,
3726,
31,
376,
21,
1935,
3884,
579,
118,
16239,
1143,
11284,
2102,
6819,
9,
98,
25,
14,
246,
17,
118,
248,
24384,
53,
20,
16146,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Other than IronPython and F#, what other .NET languages might be useful?
===
After falling in love with F# after only reading the website, and having a friend convince me to try IronPython, what else is there aside from those already included with Visual Studio 2008? | 0 | [
2,
89,
119,
1751,
6448,
11570,
17,
398,
5910,
15,
98,
89,
13,
9,
2328,
2556,
530,
44,
4811,
60,
800,
3726,
3726,
75,
3106,
19,
339,
29,
398,
5910,
75,
104,
1876,
14,
2271,
15,
17,
452,
21,
860,
6218,
55,
20,
1131,
1751,
6448,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Reset @@FETCH_STATUS stored procedure
===
How can I reset the @@FETCH_STATUS variable or set it to 0 in a stored procedure?
| 0 | [
2,
23422,
13,
1,
410,
19913,
1,
10631,
267,
8214,
7004,
800,
3726,
3726,
184,
92,
31,
23422,
14,
13,
1,
410,
19913,
1,
10631,
267,
7612,
54,
309,
32,
20,
713,
19,
21,
8214,
7004,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Java: Safe objects in a textfile? Are there ready solutions?
===
i want to safe the objects, which i generated in a programm. After restart the App should load automaticly all Objects in an Array. I want to write them in a file and parse them after restart. Are the other smarter possibilities than do it by hand?
Thanks you | 0 | [
2,
8247,
45,
1834,
3916,
19,
21,
1854,
16877,
60,
50,
80,
1451,
6776,
60,
800,
3726,
3726,
31,
259,
20,
1834,
14,
3916,
15,
56,
31,
6756,
19,
21,
625,
79,
9,
75,
22767,
14,
4865,
378,
6305,
6715,
102,
65,
3916,
19,
40,
7718,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Maintaining consistency when using temp backup tables
===
This is related to the accepted answer for [What’s your #1 way to be careful with a live database][1]?
Suppose you create a temp table for backup purpose and make your changes in the original. The changes break the system and you want to restore the backup. In the meantime some other records have also changed in the original table (it is a live db). Now if you restore the backup, the system will be in an inconsistent state.
Whats the best way to tackle this
[1]: http://stackoverflow.com/questions/168486/whats-your-1-way-to-be-careful-with-a-live-database | 0 | [
2,
8215,
22061,
76,
568,
13,
9577,
10119,
7484,
800,
3726,
3726,
48,
25,
1597,
20,
14,
2217,
1623,
26,
636,
608,
1,
18,
154,
4253,
161,
20,
44,
5186,
29,
21,
515,
6018,
500,
2558,
165,
500,
60,
5787,
42,
1600,
21,
13,
9577,
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... |
When will most libraries by Python 3 compliant?
===
Does anyone have an idea how long it will take before "almost all" widely used Python libraries work with Python 3.0?
I am planning to stay on 2.X for a while because I don't want to start porting stuff over and then find that some library I already rely on or a new library I might start using doesn't work yet with py3k.
My understanding is that the py3k beta process was drawn out specifically to give library developers time to move their stuff over. Has this been happening?
Examples of the sorts of libraries I am talking about would be PIL, numpy/ scipy, SQLAlchemy, BeautifulSoup, CherryPy... | 0 | [
2,
76,
129,
127,
8649,
34,
20059,
203,
13,
25509,
60,
800,
3726,
3726,
630,
1276,
57,
40,
882,
184,
175,
32,
129,
247,
115,
13,
7,
18135,
65,
7,
2525,
147,
20059,
8649,
170,
29,
20059,
203,
9,
387,
60,
31,
589,
2334,
20,
1179,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Operation must use an updatable query. (Error 3073) Microsoft Access
===
On some Microsoft Access queries, I get the following message: Operation must use an updatable query. (Error 3073). I work around it by using temporary tables, but I'm wondering if there's a better way. All the tables involved have a primary key. Here's the code:
UPDATE CLOG SET CLOG.NEXTDUE =
(SELECT H1.paidthru FROM CTRHIST as H1
WHERE (H1.ACCT = clog.ACCT and ((H1.SEQNO)=(select max(SEQNO) from CTRHIST where
CTRHIST.ACCT=Clog.ACCT and CTRHIST.AMTPAID > 0 and
CTRHIST.DATEPAID < CLOG.UPDATED_ON))))
WHERE (((CLOG.NEXTDUE) Is Null));
| 0 | [
2,
1453,
491,
275,
40,
71,
593,
5924,
25597,
9,
13,
5,
29992,
712,
4440,
6,
7099,
1381,
800,
3726,
3726,
27,
109,
7099,
1381,
9386,
2829,
15,
31,
164,
14,
249,
2802,
45,
1453,
491,
275,
40,
71,
593,
5924,
25597,
9,
13,
5,
2999... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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# 2.0 to c# 3.5 worth it?
===
I have read on StackOverflow some people that have converting to C#2.0 to C#3 or C#3.5, but is it really worth it?
I have a project that is done at 75% before going in maintenance phase, I am asking to myself if is it worth it to switch to C#3.5? | 0 | [
2,
272,
5910,
172,
9,
387,
20,
272,
5910,
203,
9,
264,
2715,
32,
60,
800,
3726,
3726,
31,
57,
1302,
27,
7566,
2549,
9990,
109,
148,
30,
57,
19583,
20,
272,
5910,
135,
9,
387,
20,
272,
5910,
240,
54,
272,
5910,
240,
9,
264,
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... |
UNIX socket implementation for Java?
===
I realize that since UNIX sockets are platform-specific, so there has to be some non-Java code involved. Specifically, we're interested in using JDBC to connect to a MySQL instance which only has UNIX domain sockets enabled.
It doesn't look like this is supported, but from what I've read it should be at least possible to write a SocketFactory for JDBC based on UNIX sockets *if* we can find a decent implementation of UNIX sockets for Java.
Has anyone tried this? Does anyone know of such an implementation? | 0 | [
2,
22540,
18482,
6123,
26,
8247,
60,
800,
3726,
3726,
31,
4007,
30,
179,
22540,
18482,
18,
50,
2452,
8,
9219,
15,
86,
80,
63,
20,
44,
109,
538,
8,
1004,
1385,
1797,
1013,
9,
3524,
15,
95,
22,
99,
3158,
19,
568,
487,
43,
7229,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Objective-C Tidy
===
I have a somewhat messily-formatted Objective-c code base. Is there a way to have Xcode reformat an entire project to conform to a coding standard (i.e., properly indent, spaces v. tabs, etc.)? Are there other tools that might accomplish this? | 0 | [
2,
7038,
8,
150,
28028,
800,
3726,
3726,
31,
57,
21,
4131,
3957,
5768,
8,
29850,
7038,
8,
150,
1797,
1000,
9,
25,
80,
21,
161,
20,
57,
993,
9375,
3202,
721,
40,
1078,
669,
20,
13620,
20,
21,
13,
15458,
1236,
13,
5,
49,
9,
62... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I find the install time and date of Windows?
===
This might sound like a little bit of a crazy question, but how can I find out (hopefully via an API/registry key) the install time and date of Windows?
The best I can come up with so far is to look at various files in C:\Windows and try to guess... but that's not exactly a nice solution. | 0 | [
2,
184,
107,
31,
477,
14,
16146,
85,
17,
1231,
16,
1936,
60,
800,
3726,
3726,
48,
530,
646,
101,
21,
265,
1142,
16,
21,
3328,
1301,
15,
47,
184,
92,
31,
477,
70,
13,
5,
18930,
5655,
1197,
40,
21,
2159,
118,
12463,
702,
622,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Image Resize
===
does anyone knows how to resize image proportionaly using javascript?, i have tried to modify the DOM adding attributes height & Width on the fly, but seems did not work on IE6 | 0 | [
2,
8247,
8741,
1961,
302,
10454,
800,
3726,
3726,
630,
1276,
3620,
184,
20,
302,
10454,
1961,
13822,
93,
568,
8247,
8741,
60,
15,
31,
57,
794,
20,
17579,
14,
11859,
4721,
13422,
2947,
279,
9456,
27,
14,
2855,
15,
47,
2206,
144,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Eclipse plugin manifest problem - empty package inconsistency between mac and PC
===
I am developing a collection of plugins on Eclipse 3.4 (official) on both mac and a PC.
At present (I'm aware it is not the best practice) some of my common plugins export all of their packages.
The problem is this: many of the listed packages are empty because subpackages are not,
for example: prefix.core may be empty while prefix.core.model may not be.
Even though I use the same manifest file, having the empty packages listed on one platform raises an error in the manifest file on the other platform. If I omit the packages in that platform, then when I come to the other platform I'm told that the plugin does not export everything.
Any idea what is going on? I have no idea why there would be differences between the PC and the Mac on a non-UI related issue. The only significant difference is that the mac is running Java 5 (still not Eclipse for Java 6) while the PC is running Java 6, but the manifests should have nothing to do with it. | 0 | [
2,
11652,
10922,
108,
13160,
1448,
13,
8,
2424,
6030,
19,
12124,
702,
8883,
128,
1572,
17,
5168,
800,
3726,
3726,
31,
589,
3561,
21,
1206,
16,
10922,
108,
18,
27,
11652,
203,
9,
300,
13,
5,
16168,
6,
27,
156,
1572,
17,
21,
5168,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why have object oriented databases not been succesful (yet) ?
===
That the question. Give only one reason you think why have OODB failed or why many systems nowadays still use relational databases. | 0 | [
2,
483,
57,
3095,
13,
6800,
6018,
18,
52,
74,
21792,
5052,
1566,
13,
5,
16480,
6,
13,
60,
800,
3726,
3726,
30,
14,
1301,
9,
590,
104,
53,
1215,
42,
277,
483,
57,
13,
17312,
220,
1702,
54,
483,
151,
1242,
15694,
174,
275,
5827,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Rich Text in Windows Forms application
===
I would like to update a Windows Forms application to provide the following features:
- spell checking
- limited formatting of text: bold, italics, bulleted lists
Ideally the formatted text could be accessed in a plain text way for reporting through tools that don't support the formatting, but could also be rendered as HTML for tools that support HTML tags when rendering text.
It seems to me that the WPF RichTextBox would provide this functionality. What is the best way to incorporate it? Would you suggest other alternatives? | 0 | [
2,
2042,
1854,
19,
1936,
1997,
3010,
800,
3726,
3726,
31,
83,
101,
20,
11100,
21,
1936,
1997,
3010,
20,
1181,
14,
249,
967,
45,
13,
8,
4762,
9886,
13,
8,
1317,
2595,
1203,
16,
1854,
45,
5657,
15,
21620,
15,
6812,
69,
7227,
5628,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 .NET library for parsing and generating Excel spreadsheets?
===
Open-source or not. What's your experience using it? How's the learning curve? | 0 | [
2,
98,
22,
18,
14,
246,
13,
9,
2328,
1248,
26,
2017,
18,
68,
17,
13500,
20700,
1789,
17627,
18,
60,
800,
3726,
3726,
368,
8,
12097,
54,
52,
9,
98,
22,
18,
154,
1496,
568,
32,
60,
184,
22,
18,
14,
2477,
7101,
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... |
Library Error for Ruby/QT
===
When trying to create a Ruby Qt application I get this error.
/usr/lib64/ruby/site_ruby/1.8/Qt/qtruby4.rb:2144: [BUG] Segmentation fault
ruby 1.8.6 (2008-03-03) [x86_64-linux]
I am using:
require 'Qt'
And am running the 64bit version of Novell OpenSUSE 11 with KDE4 installed. | 0 | [
2,
1248,
7019,
26,
10811,
118,
1251,
38,
800,
3726,
3726,
76,
749,
20,
1600,
21,
10811,
2593,
38,
3010,
31,
164,
48,
7019,
9,
13,
118,
267,
139,
118,
8326,
3470,
118,
1820,
779,
118,
9097,
1,
1820,
779,
11698,
9,
12530,
1251,
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... |
Can I put a caching server in front of my web site?
===
I have a web site using apache httpd as the server and mysql as the backend. It publishes a "thought for the day" that has gotten so popular that the server is crashing due to the number of requests. Since the same page is been requested (the thought only changes once a day), is it possible to put a caching server in front of my main server, so that when the same request is made by different clients, the caching server returns the page without having to go to the database? | 0 | [
2,
92,
31,
442,
21,
1658,
7192,
8128,
19,
431,
16,
51,
2741,
689,
60,
800,
3726,
3726,
31,
57,
21,
2741,
689,
568,
17140,
7775,
43,
28,
14,
8128,
17,
51,
18,
22402,
28,
14,
97,
2451,
9,
32,
13829,
21,
13,
7,
20131,
26,
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 you design a good permgen space string in Java?
===
I'm wondering how you would go about designing a good permgen space string in Java. Based on my research and understanding I've come up with the following:
| 0 | [
2,
184,
107,
42,
704,
21,
254,
416,
79,
1863,
726,
3724,
19,
8247,
60,
800,
3726,
3726,
31,
22,
79,
5712,
184,
42,
83,
162,
88,
15026,
21,
254,
416,
79,
1863,
726,
3724,
19,
8247,
9,
432,
27,
51,
527,
17,
3260,
31,
22,
195,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
"Helper" functions
===
Back in VB6, I wrote a few functions that would let me code without having to care about the difference between null and '' for strings, null and 0 for numbers, etc. Nothing kills my productivity more when coding than having to add special case code for dealing with data that might cause some irrelevant error; 9999/10000 if something I'm using as a number is null, then really I treat it as 0.
I'm now in C#, and the difference between VB6 and C# 2005 is quite extensive...so I don't really know where to start to write my new set of helper functions, or if I even need to do them at all.
So, I need to write a function that would accept a string, a database field, a request form/querysting field, ???, and then do whatever it could do to turn that into a Double, and return that to the calling procedure.
I'd also need to do this for shorts, int16, int32, long, everything else I could possibly care about.
Then I'd do this for strings. And Dates.
Is this a worthwhile pursuit? Is there something in the framework or C# that I can use instead? I really desire something that would allow me to use data inline in calling other functions, and not having to create temporary variables, etc. | 0 | [
2,
13,
7,
14593,
106,
7,
3719,
800,
3726,
3726,
97,
19,
13,
20468,
379,
15,
31,
738,
21,
310,
3719,
30,
83,
408,
55,
1797,
366,
452,
20,
781,
88,
14,
2841,
128,
16203,
17,
13,
7,
26,
7887,
15,
16203,
17,
713,
26,
2116,
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... |
Best open XML parser for C++
===
Looking for a simple, clean, correct XML parser to use in my C++ project. Read and write my own..extension? You know what I mean.
Thanks | 4 | [
2,
246,
368,
23504,
2017,
4104,
26,
272,
20512,
800,
3726,
3726,
699,
26,
21,
1935,
15,
2745,
15,
4456,
23504,
2017,
4104,
20,
275,
19,
51,
272,
20512,
669,
9,
1302,
17,
2757,
51,
258,
9,
9,
1706,
25573,
60,
42,
143,
98,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Row Level Security with Entity Framework
===
I've been trying to consider how Row Level Security could be implemented with the Entity Framework. The idea is to have a database agnostic means that would offer methods to restrict the rows coming from the ObjectContext.
Some of my inital ideas have involved modifying the partial classes created by the EDMGEN tool and that has offered some limited support. Users are still able to get around this solution by using their own eSQL statements and a QueryObject.
I've been looking for a comprehensive solution that would exist above the database providers so that it would remain agnostic. | 0 | [
2,
3131,
662,
1221,
29,
9252,
6596,
800,
3726,
3726,
31,
22,
195,
74,
749,
20,
3563,
184,
3131,
662,
1221,
110,
44,
6807,
29,
14,
9252,
6596,
9,
14,
882,
25,
20,
57,
21,
6018,
21,
21944,
1108,
30,
83,
1994,
3195,
20,
15436,
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... |
Soap with C#
===
What is the best tutorial for learning SOAP with C# 3.5 with winforms? | 0 | [
2,
6447,
29,
272,
5910,
800,
3726,
3726,
98,
25,
14,
246,
29724,
26,
2477,
6447,
29,
272,
5910,
203,
9,
264,
29,
628,
4190,
18,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
To host or not to host?
===
What are the pros and cons of using a hosting provider for a Subversion repository versus maintaining it in-house? I'm sure there are benefits in terms of ease of set up and use. And it would be nice to have somebody else make sure that our code is backed up properly.
However, Visual SVN Server is dirt simple to set up, and we already have a pre-established set of servers that are maintained by another department and backed up regularly. So with that said, what are the big pros and cons of using a hosted service versus maintaining it ourselves? | 0 | [
2,
20,
2015,
54,
52,
20,
2015,
60,
800,
3726,
3726,
98,
50,
14,
895,
18,
17,
11608,
16,
568,
21,
10637,
11747,
26,
21,
972,
10898,
24869,
5706,
8215,
32,
19,
8,
1682,
60,
31,
22,
79,
562,
80,
50,
5800,
19,
1663,
16,
6378,
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... |
Best way to use sessions with MVC and OO PHP
===
I've been working with sessions, MVC design and object oriented PHP. Where should I save or retrieve data from a session? I would like to retrieve it from within methods so I don't have to pass the data to the methods. Whats the best practice? | 0 | [
2,
246,
161,
20,
275,
5763,
29,
307,
8990,
17,
13,
4328,
13,
26120,
800,
3726,
3726,
31,
22,
195,
74,
638,
29,
5763,
15,
307,
8990,
704,
17,
3095,
13,
6800,
13,
26120,
9,
113,
378,
31,
2079,
54,
11917,
1054,
37,
21,
3723,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
is it time to try merb?
===
With Merb 1.0 rapidly approaching, I would like to know what Merb/Rails users recommend?
Is it time to try Merb? What was downside for you when you switched to Merb from Rails?
| 0 | [
2,
25,
32,
85,
20,
1131,
55,
7549,
60,
800,
3726,
3726,
29,
55,
7549,
137,
9,
387,
4805,
8371,
15,
31,
83,
101,
20,
143,
98,
55,
7549,
118,
7301,
18,
3878,
12360,
60,
25,
32,
85,
20,
1131,
55,
7549,
60,
98,
23,
125,
1416,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What techniques have you actually used successfully to improve code coverage?
===
I regularly achieve 100% coverage of libraries using TDD, but not always, and there always seem to be parts of applications left over that are untested and uncovered.
Then there are the cases when you start with legacy code that has very few tests and very little coverage.
Please say what your situation is and what has worked that at least *improved* coverage.
I'm assuming that you are measuring coverage during unit testing, but say if you are using other techniques. | 0 | [
2,
98,
4212,
57,
42,
1121,
147,
3673,
20,
3545,
1797,
5245,
60,
800,
3726,
3726,
31,
4217,
4689,
12849,
5245,
16,
8649,
568,
15596,
43,
15,
47,
52,
550,
15,
17,
80,
550,
2260,
20,
44,
1341,
16,
3767,
225,
84,
30,
50,
367,
2237... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where can i find a good in depth guide to C# 3 ?
===
It seems that C# 3 hit me without me even noticing, could you guys tell me about good in depth guides to C# 3? from lambda to linq to everything else that was introduced with the third version of the language.
Printed books would be nice, but online guides would be even better! | 0 | [
2,
113,
92,
31,
477,
21,
254,
19,
5204,
3378,
20,
272,
5910,
203,
13,
60,
800,
3726,
3726,
32,
2206,
30,
272,
5910,
203,
770,
55,
366,
55,
166,
18130,
15,
110,
42,
2776,
494,
55,
88,
254,
19,
5204,
14838,
20,
272,
5910,
203,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CruiseControl.net failing with HTTP Error 500 on Vista x64
===
I installed CruiseControl.net ( from the CruiseControl.NET-1.4-Setup.exe installer ) on my Vista x64 development machine. The server portion is running fine; however, the webdashboard piece is not working.
The first error message I saw when I tried to pull up http://localhost/ccnet squawked about not being able to run in integrated pipeline mode. Easily fixed. I opened up the IIS7 admin panel and changed the ccnet application to use the "Classic .NET App Pool" application pool.
However, I am now getting a persistent HTTP Error 500 when I try to connect. I set the NTFS permissions on the webdashboard folder wide open in the hopes that maybe it was a file permissions issue. No joy.
After a bit of digging and trial and error I found a set of steps which seems to fix the problem. I'll post a follow up answer right after this, but wanted to share this out on stackoverflow in the hopes that it might aid someone else down the line. Also, if there's a better configuration solution I'm all ears :)
| 0 | [
2,
6581,
12898,
9,
2328,
7250,
29,
7775,
7019,
3033,
27,
13520,
993,
3470,
800,
3726,
3726,
31,
4066,
6581,
12898,
9,
2328,
13,
5,
37,
14,
6581,
12898,
9,
2328,
8,
165,
9,
300,
8,
3554,
576,
9,
1706,
62,
16146,
106,
13,
6,
27,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to serialize SettingsContext and SettingsPropertyCollection
===
I need to serialize the System.Configuration.SettingsContext and System.Configuration.SettingsPropertyCollection types as i am implementing my own profile provider. Any suggestions on how to do it in the most simplest way. | 0 | [
2,
184,
20,
5956,
2952,
12410,
1126,
11969,
17,
12410,
10890,
106,
1084,
15015,
872,
800,
3726,
3726,
31,
376,
20,
5956,
2952,
14,
329,
9,
1126,
13549,
857,
9,
19831,
18,
1126,
11969,
17,
329,
9,
1126,
13549,
857,
9,
19831,
18,
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... |
How do I know if Windows has just recovered from a BSOD?
===
From [http://support.microsoft.com/kb/317277][1]:
If Windows XP restarts because of a serious error, the Windows Error Reporting tool prompts you...
How can *my* app know that "Windows XP has restarted because of a serious error"?
[1]: http://support.microsoft.com/kb/317277 | 0 | [
2,
184,
107,
31,
143,
100,
1936,
63,
114,
5863,
37,
21,
334,
656,
43,
60,
800,
3726,
3726,
37,
636,
21127,
6903,
24168,
9,
22019,
12980,
9,
960,
118,
18167,
118,
22051,
24032,
500,
2558,
165,
500,
45,
100,
1936,
23045,
22767,
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 can I get an OpenFileDialog in a custom control's property grid?
===
I'm creating a .net custom control and it should be able to load multiple text files. I have a public property named ListFiles with those properties set :
<pre><code>
[Browsable(true), Category("Configuration"), Description("List of Files to Load")]
public string ListFiles
{
get { return m_oList; }
set { m_oList = value; }
}
</code></pre>
Depending upon the type of object, (string, string[], List<string>, ...), the property grid will allow the user to enter some data.. My goal would be to have a filtered openfiledialog in the Properties Grid of my component that would enable the user to choose multiple files and return it as an array or string (or something else...).
Sooo... Here's my question : **How can I get an OpenFileDialog in a custom control's property grid?**
Thanks a lot! | 0 | [
2,
184,
92,
31,
164,
40,
368,
16877,
4286,
5567,
19,
21,
5816,
569,
22,
18,
1354,
7354,
60,
800,
3726,
3726,
31,
22,
79,
2936,
21,
13,
9,
2328,
5816,
569,
17,
32,
378,
44,
777,
20,
6305,
1886,
1854,
6488,
9,
31,
57,
21,
317,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is .NET WCSF the way to go?
===
We are in the process of building a web site which would display news headlines and news. It would be a public site to start with but going forward might include portal functionalities like personalized web pages.
The site also needs to build web 2.0 features around the news stories being displayed, and needs to be extensible and highly customizable, allowing the business to change templates in which the stories are defined and use different templates based on business logic etc..
The core business logic is being built using windows work flow and windows communication foundation, we are now looking for UI stack, is WCSF a good choice? | 0 | [
2,
25,
13,
9,
2328,
11801,
18,
410,
14,
161,
20,
162,
60,
800,
3726,
3726,
95,
50,
19,
14,
953,
16,
353,
21,
2741,
689,
56,
83,
3042,
996,
10596,
18,
17,
996,
9,
32,
83,
44,
21,
317,
689,
20,
799,
29,
47,
228,
917,
530,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Embedding HWND into external process using SetParent
===
I'm trying to embed a window from my process into the window of an external process using the **SetParent** function and have encountered a few problems that I'm hoping someone can help me out with. First off, here is an outline of what I am currently doing to embed my window into the application:
HWND myWindow; //Handle to my application window
HWND externalWindow; //Handle to external application window
SetParent(myWindow,externalWindow);
//Remove WS_POPUP style and add WS_CHILD style
DWORD style = GetWindowLong(myWindow,GWL_STYLE);
style = style & ~(WS_POPUP);
style = style | WS_CHILD;
SetWindowLong(myWindow,GWL_STYLE,style);
This code works and my window appears in the other application, but introduces the following issues:
- When my window gains input focus, the main application window of the external process loses focus (i.e. title bar changes color)
- Keyboard shortcut commands of the main application do not work while my window has focus
Does anybody know a workaround for this? I would like my window to be treated as just another child window of the main application. | 0 | [
2,
11911,
69,
3258,
746,
6156,
43,
77,
4886,
953,
568,
309,
18908,
800,
3726,
3726,
31,
22,
79,
749,
20,
11911,
69,
21,
1463,
37,
51,
953,
77,
14,
1463,
16,
40,
4886,
953,
568,
14,
13,
1409,
3554,
18908,
1409,
1990,
17,
57,
82... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
websites - server side codeing - why not languages like java, c++, etc
===
Is there any real reason why no one makes there dynamic webpages in say c++ rather than interpreted languages like php that are many times slower?
I can see several reasons why I wouldn't mind my entire site being just one dll, with each page being represented by a function or something.
* Varibles can be shared between page requests, and even across multiple diffrent pages, eg a list of all the users currently logged in
* Multithreading would be easyer. Eg allowing multiple pages to be requested at once, since everything is running in the same program, varibles can be shared easily (eg lock handles) (does php even support doing this at all?).
* Resources can be pooled far more easily, eg db connections which under php are oftern created for every page request
And if there isn't a real reason why not, then how could I go about doing it? | 0 | [
2,
13931,
13,
8,
8128,
270,
1797,
68,
13,
8,
483,
52,
2556,
101,
8247,
15,
272,
20512,
15,
2722,
800,
3726,
3726,
25,
80,
186,
683,
1215,
483,
90,
53,
1364,
80,
7782,
2741,
6486,
18,
19,
395,
272,
20512,
864,
119,
10394,
2556,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Date class different in Ruby stdlib and Rails stdlib
===
I want to use the Date::ABBR_MONTHS constant in my rails application. I see the Ruby stdlib documentation at [http://www.ruby-doc.org/stdlib/][1] which does not seem to have this constant.
However, this constant is there at [http://stdlib.rubyonrails.org/][1]
What is the difference between these two libraries?
This constant is working on my unix deployment machine but not on my dev machine on windows. Can anybody explain whats going on?
[1]: http://www.ruby-doc.org/stdlib/ | 0 | [
2,
1231,
718,
421,
19,
10811,
354,
43,
8326,
17,
2240,
18,
354,
43,
8326,
800,
3726,
3726,
31,
259,
20,
275,
14,
1231,
45,
45,
2297,
5145,
1,
6444,
18,
3587,
19,
51,
2240,
18,
3010,
9,
31,
196,
14,
10811,
354,
43,
8326,
13945,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 serialize System.Configuration.SettingsProperty
===
I need to serialize the System.Configuration.SettingsProperty and System.Configuration.SettingsPropertyValue class object through WCF. | 0 | [
2,
184,
20,
5956,
2952,
329,
9,
1126,
13549,
857,
9,
19831,
18,
10890,
106,
1084,
800,
3726,
3726,
31,
376,
20,
5956,
2952,
14,
329,
9,
1126,
13549,
857,
9,
19831,
18,
10890,
106,
1084,
17,
329,
9,
1126,
13549,
857,
9,
19831,
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,
0,
0,
0,
0,
0,
0,
0,
0... |
Anyone really using CAS to protect their assemblies and/or methods?
===
Seems to me most of developers completely ignoring this features. People prefer threating security exception as generic ones relying on standard windows roles and rights instead of learning to use CAS ways of handling security.- probably because CAS is quite confusingin its logic and naming.
Can anyone suggest any general rule-of-thumb/best practices for using CAS at his best in a clean way? | 0 | [
2,
1276,
510,
568,
7167,
20,
2196,
66,
21066,
17,
118,
248,
3195,
60,
800,
3726,
3726,
2206,
20,
55,
127,
16,
10168,
1524,
9321,
48,
967,
9,
148,
6369,
3603,
68,
1221,
5391,
28,
12733,
53,
18,
21760,
27,
1236,
1936,
2954,
17,
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... |
Parsing T-SQL to Parameterize a Query
===
The application I am currently working on generates a lot of SQL inline queries. All generated SQL is then handed off to a database execution class. I want to write a parsing service for the data execution class that will take a query like this:
SELECT field1, field2, field3 FROM tablename WHERE foo=1 AND bar="baz"
and turn it into something like this:
SELECT field1, field2, field3 FROM tablename WHERE foo=@p1 AND bar=@p2 blah blah blah
Any thing already written that will accomplish this for me in c# or vb.net? This is intended as a stop gap prior to refactoring the DAL for this project. | 0 | [
2,
2017,
18,
68,
13,
38,
8,
18,
22402,
20,
18906,
2952,
21,
25597,
800,
3726,
3726,
14,
3010,
31,
589,
871,
638,
27,
7920,
18,
21,
865,
16,
4444,
255,
19,
1143,
9386,
2829,
9,
65,
6756,
4444,
255,
25,
94,
3988,
168,
20,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Emulating user input for java.util.Scanner
===
I'm writing a game in Java, and I want the user to be able to provide input from both the command line and my GUI. Currently, I use this method to get input:<br>
static String getInput(){
System.out.println("Your move:");
Scanner sc = new Scanner(System.in);
return sc.nextLine();
}
I want to keep using this, but let a mousePressed event emulate the user actually typing in their input as well. It's not that efficient of a solution, but it makes sense in my application. So the question is: how do I simulate a user typing to System.in from the code side?
| 0 | [
2,
3579,
10038,
4155,
6367,
26,
8247,
9,
14255,
9,
18,
1245,
1031,
800,
3726,
3726,
31,
22,
79,
1174,
21,
250,
19,
8247,
15,
17,
31,
259,
14,
4155,
20,
44,
777,
20,
1181,
6367,
37,
156,
14,
1202,
293,
17,
51,
9457,
9,
871,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a way to maximise the current tab in Visual Studio?
===
I sometimes need to use Visual Studio when I have limited screen real estate (remote desktopping from a laptop for example). **It would be really useful to be able to make the currently selected code tab maximise to take the whole screen for a limited time.**
Is that possible? Is there a keyboard shortcut? | 0 | [
2,
25,
80,
21,
161,
20,
10584,
2628,
14,
866,
6523,
19,
3458,
1120,
60,
800,
3726,
3726,
31,
1030,
376,
20,
275,
3458,
1120,
76,
31,
57,
1317,
2324,
683,
2028,
13,
5,
99,
20209,
17404,
3181,
37,
21,
12294,
26,
823,
6,
9,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Avoiding duplicate content in asp.net MVC due to case insensetive URLs and defaults
===
First post - go easy if I've marked this up wrong or tagged it badly :P
In Microsoft's new ASP.NET MVC framework it seems there are two things that could cause your content to be served up at multiple URLs (something which Google penalise for and will cause your PageRank to be split across them):
- Case-insensitive URLs
- Default URL
You can set the default controller/action to serve up for requests to the root of your domain. Let's say we choose HomeController/Index. We end up with the following URLs serving up the same content:
- mydomain.com/
- mydomain.com/Home/Index
Now if people start linking to both of these then PageRank would be split. Google would also consider it duplicate content and penalise one of them to avoid duplicates in their results.
On top of this, the URLs are not case sensitive, so we actually get the same content for these URLs too:
- mydomain.com/Home/Index
- mydomain.com/home/index
- mydomain.com/Home/index
- mydomain.com/home/Index
- (the list goes on)
So, the question... How do I avoid these penalties? I would like:
- All requests for the default action to be redirected (301 status) to the same url
- All URLs to be case sensitive
Possible? | 0 | [
2,
10298,
19429,
2331,
19,
28,
306,
9,
2328,
307,
8990,
397,
20,
610,
19,
18,
6498,
6142,
13,
911,
7532,
17,
12838,
18,
800,
3726,
3726,
64,
678,
13,
8,
162,
2010,
100,
31,
22,
195,
2739,
48,
71,
1389,
54,
27945,
32,
5730,
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... |
Is there a downside to adding an anonymous empty delegate on event declaration?
===
I have seen a few mentions of this idiom (including [on SO][1]):
public event EventHandler AskQuestion = delegate {}; // deliberately empty subscriber
The upside is clear - it avoids the need to check for null before raising the event.
**However, I am keen to understand if there are any downsides.** For example, is it something that is in widespread use and is transparent enough that it won't cause a maintenance headache? Is there any appreciable performance hit of the empty event subscriber call?
[1]: http://stackoverflow.com/questions/9033/hidden-features-of-c#9282 | 0 | [
2,
25,
80,
21,
125,
1416,
20,
4721,
40,
10364,
2424,
11300,
27,
807,
7098,
60,
800,
3726,
3726,
31,
57,
541,
21,
310,
10292,
16,
48,
28380,
13,
5,
3970,
636,
218,
86,
500,
2558,
165,
500,
6,
45,
317,
807,
807,
3203,
1252,
1349... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Making a Nonblocking socket for WinSocks and *nix
===
In C/C++, how would I turn a blocking socket into a non blocking socket in both WinSocks and *nix; so that select() would work correctly. You can use the pre-processor for the platform specific code. | 0 | [
2,
544,
21,
538,
12048,
68,
18482,
26,
4041,
5668,
18,
17,
1637,
14064,
800,
3726,
3726,
19,
272,
118,
150,
20512,
15,
184,
83,
31,
805,
21,
11828,
18482,
77,
21,
538,
11828,
18482,
19,
156,
4041,
5668,
18,
17,
1637,
14064,
73,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is SVNAutoversioning directive in apache subversion imporant?
===
If so why? I know setting this on will result in more number of automatically committed revisions. Is it good to have more auto commits? | 0 | [
2,
25,
13,
18,
16578,
18042,
10898,
68,
15626,
19,
17140,
972,
10898,
5420,
248,
1830,
60,
800,
3726,
3726,
100,
86,
483,
60,
31,
143,
2697,
48,
27,
129,
829,
19,
91,
234,
16,
7499,
4164,
11323,
18,
9,
25,
32,
254,
20,
57,
91,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
F# books question
===
I am now reading Foundations of F# by Robert Pickering and parallelly the book in progress 'Real World Functional Programming' by Tomas Petricek.
My question is, what is the added value I would get from buying and reading the following books:
1) Expert F# by Don Syme and others
2) F# for Scientists by John Harrop
Also I want to learn more about datamining techniques with F# as a tool for this. What are good books to read next on this topic? | 4 | [
2,
398,
5910,
964,
1301,
800,
3726,
3726,
31,
589,
130,
1876,
11716,
16,
398,
5910,
34,
822,
28550,
17,
3821,
102,
14,
360,
19,
3455,
13,
22,
7467,
126,
7652,
3143,
22,
34,
13048,
24912,
21940,
9,
51,
1301,
25,
15,
98,
25,
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... |
To learn python 2 then 3, or 3 from the start?
===
I would like to learn python and currently have access to some good python 2 books. However python 3 is not guaranteed to be backward compatible with python 2. If I were to learn to learn python 2 I have to unlearn and relearn some things when I upgrade to python 3. Also, is there any use/point in learning python 2 or should I just learn python 3 from the start? | 4 | [
2,
20,
2484,
20059,
172,
94,
203,
15,
54,
203,
37,
14,
799,
60,
800,
3726,
3726,
31,
83,
101,
20,
2484,
20059,
17,
871,
57,
1381,
20,
109,
254,
20059,
172,
964,
9,
207,
20059,
203,
25,
52,
13572,
20,
44,
8540,
14961,
29,
20059... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Replace an item in a list in lisp?
===
I have a list of things (I'll call it L), an index(N) and a new thing(T). If I want to replace the thing in L at N with T, what is the best way to do this? Should I get the sublist up to N and from N to the end of the list and then glue together a new list from the first part, T, and the last part using list? Or is there a better way to do this? | 0 | [
2,
3934,
40,
9101,
19,
21,
968,
19,
2093,
3401,
60,
800,
3726,
3726,
31,
57,
21,
968,
16,
564,
13,
5,
49,
22,
211,
645,
32,
644,
6,
15,
40,
4348,
5,
103,
6,
17,
21,
78,
584,
5,
38,
6,
9,
100,
31,
259,
20,
3934,
14,
584... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 reasonable to use Processing.js?
===
I am thinking about making a website with some fairly intense javascript/canvas usage and I have been looking at processing.js and it seems to me that it would make manipulating the canvas significantly easier. Does anyone know any reasons why I **shouldn't** use processing.js? I understand that older browsers won't be able to use it, but for now that's ok.
-fREW | 0 | [
2,
25,
32,
9954,
20,
275,
5511,
9,
728,
18,
60,
800,
3726,
3726,
31,
589,
1440,
88,
544,
21,
2271,
29,
109,
6647,
5339,
8247,
8741,
118,
1245,
8471,
7514,
17,
31,
57,
74,
699,
35,
5511,
9,
728,
18,
17,
32,
2206,
20,
55,
30,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the default time after which an HTTP request is deemed to have timed out?
===
For PHP, what is the default time after which an HTTP request is deemed to have timed out?
I'm using the PECL HTTP extension to make HTTP requests. I can set a timeout limit when making a request, however I'd like to know what the default is if nothing is explicitly specified.
I've hunted through the PHP manual to no avail. I'd appreciate answers supported by evidence, such as a link to the relevant manual page, as opposed to speculative suggestions.
I'm keen to find out what the default timeout *actually* is not just what it *probably* is. I can guess it may *probably* be 30 seconds as this seems a reasonable value, however I can find nothing to confirm or deny this. | 0 | [
2,
98,
25,
14,
12838,
85,
75,
56,
40,
7775,
3772,
25,
7997,
20,
57,
85,
43,
70,
60,
800,
3726,
3726,
26,
13,
26120,
15,
98,
25,
14,
12838,
85,
75,
56,
40,
7775,
3772,
25,
7997,
20,
57,
85,
43,
70,
60,
31,
22,
79,
568,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to specify the hardware your software needs?
===
That is a problem I'm facing right now.
I need to specify the hardware that will run my piece of software.
The thing is: the project isn't finished yet, and I need it running in "real" conditions before I can go on, conditions which I cannot reproduce at home; what I can test at home barely scratches them. We don't have much money to spend (it's a research at college). Feels like a catch-22.
How can one get a good approximation of what setup is needed without having the means to simulate accurate work conditions? | 0 | [
2,
184,
20,
19077,
14,
7610,
154,
2306,
2274,
60,
800,
3726,
3726,
30,
25,
21,
1448,
31,
22,
79,
4325,
193,
130,
9,
31,
376,
20,
19077,
14,
7610,
30,
129,
485,
51,
1855,
16,
2306,
9,
14,
584,
25,
45,
14,
669,
2532,
22,
38,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best CRLF handling strategy with git?
===
It's easy to loose hours trying to find the best line endings solution.
Please share only one best practice per answer. | 0 | [
2,
98,
22,
18,
14,
246,
6186,
9641,
7988,
4427,
29,
13,
10404,
60,
800,
3726,
3726,
32,
22,
18,
2010,
20,
4675,
974,
749,
20,
477,
14,
246,
293,
3119,
18,
4295,
9,
2247,
1891,
104,
53,
246,
1345,
416,
1623,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
NHibernate - Difference between session.Merge and session.SaveOrUpdate?
===
I noticed sometimes with my parent/child objects, or many-to-many relationships, I need to call either SaveOrUpdate, or Merge. Usually, when I need to call SaveOrUpdate, the exception I get on calling Merge has to do with transient objects not being saved first... Please explain the difference between the two. | 0 | [
2,
12109,
15191,
8820,
13,
8,
2841,
128,
3723,
9,
1263,
834,
17,
3723,
9,
19863,
248,
576,
8209,
60,
800,
3726,
3726,
31,
2711,
1030,
29,
51,
4766,
118,
11287,
3916,
15,
54,
151,
8,
262,
8,
14842,
5833,
15,
31,
376,
20,
645,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
One to One database relation?
===
In my free time I started writing a small multiplayer game with a database backend. I was looking to separate player login information from other in game information (inventory mostly) and a friend brought up this might not be the best idea.
Would it be better to lump everything together in one table? | 0 | [
2,
53,
20,
53,
6018,
5827,
60,
800,
3726,
3726,
19,
51,
551,
85,
31,
373,
1174,
21,
284,
20262,
250,
29,
21,
6018,
97,
2451,
9,
31,
23,
699,
20,
1725,
517,
6738,
108,
676,
37,
89,
19,
250,
676,
13,
5,
108,
6645,
7159,
1555,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 method for adding select options from json array with jQuery
===
What is the best method for adding options to a select from a JSON array using jQuery?
I'm looking for something that I don't need a plugin to do, but would also be interested in the plugins that are out there. | 0 | [
2,
246,
2109,
26,
4721,
5407,
6368,
37,
487,
528,
7718,
29,
487,
8190,
93,
800,
3726,
3726,
98,
25,
14,
246,
2109,
26,
4721,
6368,
20,
21,
5407,
37,
21,
487,
528,
7718,
568,
487,
8190,
93,
60,
31,
22,
79,
699,
26,
301,
30,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get the charset from an HTML page
===
I'm trying to get the charset attribute in any HTML meta tag.
(ie.< meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1" >)
Is there any way to do that in C++ under linux. I was using HTML tidy as a parser but I can't get that attribute to return me anything different from us-ascii (even if the encoding is utf-8)<br>this is the output I got:
*.*4 Node: meta<br>
Name attr: http-equiv<br>
Value attr: Content-Type<br>
Name attr: content<br>
Value attr: text/html; charset=us-ascii<br>
<br>
Thanks in advance,<br>
Alejo | 0 | [
2,
184,
20,
164,
14,
4892,
3554,
37,
40,
13,
15895,
2478,
800,
3726,
3726,
31,
22,
79,
749,
20,
164,
14,
4892,
3554,
35,
14755,
19,
186,
13,
15895,
7618,
3383,
9,
13,
5,
660,
9,
1,
7618,
7775,
8,
9629,
710,
3726,
7,
25424,
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... |
jQuery remove table row
===
What is the best method for removing a table row with jQuery? | 0 | [
2,
487,
8190,
93,
4681,
859,
3131,
800,
3726,
3726,
98,
25,
14,
246,
2109,
26,
9096,
21,
859,
3131,
29,
487,
8190,
93,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I make an onclientclick post back using jquery? asp.net
===
I need help. I want to recreate the the update panel postback without using a update panel to do the postback. What is the generic method for doing this?
For example, on stack overflow, when you vote up or down on a question it does a postback to update the database and I would bet they didn't use an update panel.
What do I have?
I have a table with table data. When I click on the "td" item as a whole column, I want to do a update to the database and also update a gridview on the page it self. The gridview shows all the currently clicked items in the table because it was updated via "our method"...
Please help, looking for a good generic method I could use for a lot of async postbacks without update panel.
Looking for a good tutorial of some sorts?
Thanks guys.
Scott. | 0 | [
2,
184,
107,
31,
233,
40,
27,
150,
18513,
6668,
10129,
678,
97,
568,
487,
8190,
93,
60,
28,
306,
9,
2328,
800,
3726,
3726,
31,
376,
448,
9,
31,
259,
20,
21119,
14,
14,
11100,
4113,
678,
1958,
366,
568,
21,
11100,
4113,
20,
107... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
iphone <-> real world connection
===
Any pointers on how to initiate serial communication with the iphone? Or any other idea to interact with external hardware? | 0 | [
2,
21024,
13,
1,
8,
1,
683,
126,
2760,
800,
3726,
3726,
186,
454,
445,
27,
184,
20,
17014,
5956,
3291,
29,
14,
21024,
60,
54,
186,
89,
882,
20,
10001,
29,
4886,
7610,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Accepting client certificates from any CA
===
I am setting up support for users to sign in with client certificates. Unfortunately IIS refuses to acknowledge any certificate not chained to an installed CA ([see this article][1]).
As the feature is implemented only for users´ convenience, it would be great to allow any client certificate. Is there any way to accomplish this?
My server is running Windows Server 2003 and IIS 6, but the behaviour is no different on my IIS 7 running locally. If IIS 7 could be customized to support any client certificate, I would be able to change though (given no solution for IIS 6 is available).
[1]: http://support.microsoft.com/kb/257587 "Description of the Server Authentication Process During the SSL Handshake" | 0 | [
2,
10894,
6819,
6259,
18,
37,
186,
1658,
800,
3726,
3726,
31,
589,
2697,
71,
555,
26,
3878,
20,
1676,
19,
29,
6819,
6259,
18,
9,
6200,
595,
18,
10864,
20,
11762,
186,
6259,
52,
2858,
69,
20,
40,
4066,
1658,
13,
5,
2558,
1798,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Close point of approch detection
===
I have a large set of 3rd order polynomials in 3D.
in matrix form
[Pn](t) = [1,t,t^2,t^4]*[An] // [Pn] and [An] are matrices
each function has a weight Wn. I want to, for some n, m, T and t0 find the first t where t>t0 such that
Wn*Wm / |[Pn](t)-[Pm](t)|^2 > T
aside from a the O(n^2) "try everything" approach I'm not even sure where to start, For that matter, I'm not shure how to answer this even for the known n & m.
Any ideas
| 0 | [
2,
543,
454,
16,
4865,
15682,
11643,
800,
3726,
3726,
31,
57,
21,
370,
309,
16,
203,
897,
389,
15039,
18,
19,
203,
43,
9,
19,
8187,
505,
636,
17479,
500,
5,
38,
6,
800,
636,
165,
15,
38,
15,
38,
1,
135,
15,
38,
1,
300,
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... |
jQuery add table row
===
What is the best method in jQuery to add an additional row to a table as the last row? | 0 | [
2,
487,
8190,
93,
3547,
859,
3131,
800,
3726,
3726,
98,
25,
14,
246,
2109,
19,
487,
8190,
93,
20,
3547,
40,
1351,
3131,
20,
21,
859,
28,
14,
236,
3131,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Creating a stage environment on network with port 80 blocked
===
I currently use my local web server to allow costumers to preview some applications and also to allow downloads of "nightly builds" of my open source library.
Problem is I changed my ISP and now my port 80 is blocked.
Altough I know I could easily change the port on the Apache server, I'd like to avoid that unless there's no alternative.
Do you know any third party service (free or paid) that would do a port forward to my website, making it transparent to someone accessing it?
One other idea I heard about was using mod rewrite from my current webhost to rewrite to my domain, but I'd also prefer not go this path. Besides that, do you know any .htaccess examples that actually work? I have tried this:
RewriteEngine on
RewriteRule ^/(.*) http://www.example.com:8080/$1
But it doesn't seem to be working.
Thanks in advance for any ideas. | 0 | [
2,
2936,
21,
876,
2307,
27,
982,
29,
1295,
2972,
8388,
800,
3726,
3726,
31,
871,
275,
51,
375,
2741,
8128,
20,
1655,
8852,
1224,
20,
16121,
109,
3767,
17,
67,
20,
1655,
7121,
18,
16,
13,
7,
4893,
102,
1895,
18,
7,
16,
51,
368,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Adobe Air and .NET
===
I Adobe Air completly JavaScript? Can't I use a .NET language like VB.NET or C#.NET?
Thanks | 0 | [
2,
20299,
282,
17,
13,
9,
2328,
800,
3726,
3726,
31,
20299,
282,
6479,
1336,
102,
8247,
8741,
60,
92,
22,
38,
31,
275,
21,
13,
9,
2328,
816,
101,
13,
20468,
9,
2328,
54,
272,
5910,
9,
2328,
60,
3669,
3,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
onmousemove in firefox
===
How do you implement onmousemove in firefox. I have it working in ie7 but no alert pops in firefox. Is is not supported or done differently?
<esri:Map ID="Map1" runat="server" MapResourceManager="MapResourceManager1"
Height="100%" Width="100%" VirtualDirectory=""
PrimaryMapResource="ESRI_Imagery_World_2D" Extent="-130,37,-117,46"
onmousemove="alert()" >
</esri:Map> | 0 | [
2,
27,
14002,
62,
16598,
19,
535,
18219,
800,
3726,
3726,
184,
107,
42,
8713,
27,
14002,
62,
16598,
19,
535,
18219,
9,
31,
57,
32,
638,
19,
13,
660,
465,
47,
90,
7863,
1675,
18,
19,
535,
18219,
9,
25,
25,
52,
1827,
54,
677,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I change the "level" of validation that Ant's XMLValidate task provides?
===
I am attempting to use Ant's XMLValidate task to validate an XML document against a DTD. The problem is not that it doesn't work, but that it works too well. My DTD contains an xref element with an "@linkend" attribute of type IDREF. Most of these reference IDs outside of the current document. Because of this, my build fails, since the parser complains that the ID that the IDREF is referencing doesn't exist. So, is there any way that I can validate my XML document against the DTD, but ignore errors of this type?
A few things I've tried: Setting the "lenient" option on XMLValidate makes the task only check the document's well-formedness, not it's validity against a DTD. [The XMLValidate task in the Ant manual][1] lists some JAXP and SAX options you can set, but none seem applicable.
Here's my code:
<target name="validate">
<echo message="Validating ${input}"/>
<xmlvalidate file="${input}" failonerror="yes"
classname="org.apache.xml.resolver.tools.ResolvingXMLReader">
<classpath refid="xslt.processor.classpath"/>
</xmlvalidate>
</target>
As you can see, I'm using ResolvingXMLReader to resolve the DTD against a catalog of public identifiers. However, I get the same behavior if I specify the DTD directly using a nested xmlcatalog element.
[1]: http://ant.apache.org/manual/OptionalTasks/xmlvalidate.html | 0 | [
2,
184,
107,
31,
753,
14,
13,
7,
3906,
7,
16,
27999,
30,
40,
38,
22,
18,
23504,
18506,
8209,
3005,
1927,
60,
800,
3726,
3726,
31,
589,
6314,
20,
275,
40,
38,
22,
18,
23504,
18506,
8209,
3005,
20,
7394,
1373,
40,
23504,
4492,
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... |
Sensible HTTP POST timeout values to use when programmatically issuing requests?
===
When programmatically issuing HTTP POST requests, what timeout values would be sensible?
In my case, I'm looking to set 'sensible' timeout values when making POST requests in PHP, however this applies to any language.
I need to be able to issue a set of requests, each to a user-specified URL. If I do need to process requests consecutively instead of concurrently, I'd like to specify a sensible time beyond which a request is deemed to have timed out.
PHP's [default socket timeout][1] is 60 seconds. This seems an unnecessarily long time to wait before deciding a request is not going to be completed.
As these are POST requests they should complete quickly - there's no data to be retrieved and returned as with a GET request.
We should be able to assume, *most of the time*, that the failure to issue a response to a request within X seconds means the host is unlikely to issue a response within a reasonable time for values of X *significantly* less than 60.
Surely hosts rarely take more than 60 seconds to respond to a simple POST request. Do they even rarely take more than 10 seconds? 5 seconds?
What might be sensible values for X in practice? Justifications accompanying suggestions would be extremely beneficial.
[1]: http://stackoverflow.com/questions/170938/what-is-the-default-time-after-which-an-http-request-is-deemed-to-have-timed-out | 0 | [
2,
24599,
7775,
678,
85,
1320,
4070,
20,
275,
76,
625,
6732,
1326,
17502,
12279,
60,
800,
3726,
3726,
76,
625,
6732,
1326,
17502,
7775,
678,
12279,
15,
98,
85,
1320,
4070,
83,
44,
24599,
60,
19,
51,
610,
15,
31,
22,
79,
699,
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... |
Allowing users to post pictures to web application via mobile phone?
===
There are several web applications which allow you to send photos from your mobile phone and post them to web site/application. How do these work and what sort of technologies would one use to implement such a feature? Is it an MMS server or does one need to get into socket programming? For example, some applications provide you with an email address to email your photos to via mobile phone. I'm curious to know how these things work. I can somewhat figure out on my own how they work, but I would like to know this feature is normally implemented.
Thanks | 0 | [
2,
2719,
3878,
20,
678,
3104,
20,
2741,
3010,
1197,
3241,
1132,
60,
800,
3726,
3726,
80,
50,
238,
2741,
3767,
56,
1655,
42,
20,
2660,
7064,
37,
154,
3241,
1132,
17,
678,
105,
20,
2741,
689,
118,
2552,
20669,
9,
184,
107,
158,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Standard connection libraries for MySQL, MSSQL, and Oracle in PHP?
===
I'm looking for a standard way to connect to databases in PHP. We've all been there - first start with some rudimentary code to connect/query/iterate/insert/disconnect, then the code grew as the program grew, and it ended up with a mess that's hardly reusable.
I know there are many PEAR, PECL, and other user-written PHP libraries/classes out there that can fit my description - but which ones are maintained, used, and have proven to be bug-free and efficient? | 0 | [
2,
1236,
2760,
8649,
26,
51,
18,
22402,
15,
4235,
18,
22402,
15,
17,
15759,
19,
13,
26120,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
1236,
161,
20,
6379,
20,
6018,
18,
19,
13,
26120,
9,
95,
22,
195,
65,
74,
80,
13,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Standard/good way to integrate AJAX and PHP
===
I've been writing PHP-powered web applications for some time, and have come across very nice Javascript frameworks, such as JQuery, ExtJS, Scriptaculous, etc. I can't say the same about the PHP side - I always coded that part of the client-server dialog from scratch.
I've used CodeIgniter ([http://codeigniter.com/][1]) and it is nice, but doesn't deal with AJAX as a whole - rather providing input checking, image manipulation, and some output helpers.
Is there a standard PHP library/class/framework out there that deals/integrates with Javascript frameworks? Something that can catch users' responses/requests, validate identity and input, provide progress status, keep track of sessions, be aware of asynchronous events, etc.
[1]: http://codeigniter.com/ | 0 | [
2,
1236,
118,
3264,
161,
20,
18399,
20624,
17,
13,
26120,
800,
3726,
3726,
31,
22,
195,
74,
1174,
13,
26120,
8,
9844,
2741,
3767,
26,
109,
85,
15,
17,
57,
340,
464,
253,
2210,
8247,
8741,
6596,
18,
15,
145,
28,
487,
8190,
93,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Learning C/C++ from beginner to advanced
===
I've taken a few courses on C, C++ and data structures back a few years ago but never got to use that knowledge. Nothing advanced, just some simple programming concepts that you'd learn in an introductory class.
Now I've transferred into a Computer Science major as junior, and all of a sudden realized that I'll need that knowledge, and in good condition, to pass some of the classes.
Question is, where to start and what to do? Should I just buy a textbook and work through all of its exercises? Which book to pick? What if I get stuck and there's no solution and nobody to ask advice from? Should I look up some online tutorials, but again, how reliable are they?
In essence, I'm looking for a quick and reliable way to learn enough C/C++ to be comfortable completing exercises with it. | 0 | [
2,
2477,
272,
118,
150,
20512,
37,
26931,
20,
2255,
800,
3726,
3726,
31,
22,
195,
658,
21,
310,
4392,
27,
272,
15,
272,
20512,
17,
1054,
3815,
97,
21,
310,
122,
1464,
47,
243,
330,
20,
275,
30,
1918,
9,
626,
2255,
15,
114,
109... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Autostart spring app
===
So is there a way to initialize and start a command line Spring app without writing a main method. It seems like all such main methods have the same form
public static void main(final String[] args) throws Exception {
ApplicationContext ctx = new ClassPathXmlApplicationContext("context.xml", Boot.class);
FooService fooService = (FooService) ctx.getBean("fooService");
fooService.bar();
}
I suppose that's not complicated, but has someone found a way to provide a way to just specify the `context.xml` at the command line or, better yet, in a manifest file? | 0 | [
2,
3108,
13680,
1573,
4865,
800,
3726,
3726,
86,
25,
80,
21,
161,
20,
2104,
2952,
17,
799,
21,
1202,
293,
1573,
4865,
366,
1174,
21,
407,
2109,
9,
32,
2206,
101,
65,
145,
407,
3195,
57,
14,
205,
505,
317,
12038,
11364,
407,
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... |
Cost-effective team software development for small business or group?
===
I've seen many medium and large businesses set up elaborate processes for their software development and testing, be it Windows or Linux-based, web or local, for-profit or internal.
How would a small business or group of developers go about setting up such environment, with minimal software and hardware costs? The idea is have an environment that is **easy to setup, learn and administer**, can be **accessed remotely**, allows levels of **privileges**, prevents **code loss**, allows for easy **testing and integration**, is **secure** from intrusion, and just **stays out of the way** by letting developers do what they do - write code.
Please be as specific as possible. Answers such as "Use SVN with Apache front-end and backup with FTP to a remote server!" are not enlightening. | 4 | [
2,
1516,
8,
14659,
173,
2306,
522,
26,
284,
508,
54,
214,
60,
800,
3726,
3726,
31,
22,
195,
541,
151,
4152,
17,
370,
4426,
309,
71,
7541,
5102,
26,
66,
2306,
522,
17,
4431,
15,
44,
32,
1936,
54,
13024,
8,
1281,
15,
2741,
54,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I flip a bit in SQL Server?
===
I'm trying to perform a bitwise NOT in SQL Server. I'd like to do something like this:
update foo
set Sync = NOT @IsNew
| 0 | [
2,
184,
107,
31,
8805,
21,
1142,
19,
4444,
255,
8128,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
2985,
21,
1142,
10474,
52,
19,
4444,
255,
8128,
9,
31,
22,
43,
101,
20,
107,
301,
101,
48,
45,
11100,
4310,
111,
309,
6063,
150,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Has anyone here worked on KOFAX-SharePoint 2007 integration?
===
We want to be able to advance our business by utilizing both of the power of KOFAX and SharePoint 2007. Any pointers Development-wise? | 0 | [
2,
63,
1276,
235,
577,
27,
1584,
18947,
8,
16608,
3132,
624,
8078,
60,
800,
3726,
3726,
95,
259,
20,
44,
777,
20,
3612,
318,
508,
34,
19894,
156,
16,
14,
414,
16,
1584,
18947,
17,
1891,
3132,
624,
9,
186,
454,
445,
522,
8,
104... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Looking for the suffix tree implementation in C#?
===
For a learning project... | 0 | [
2,
699,
26,
14,
15447,
1541,
6123,
19,
272,
5910,
60,
800,
3726,
3726,
26,
21,
2477,
669,
9,
9,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Java maximum memory on Windows XP
===
I've always been able to allocate 1400 megabytes for Java SE running on 32-bit Windows XP (Java 1.4, 1.5 and 1.6).
java -Xmx1400m ...
Today I tried the same option on a new Windows XP machine using Java 1.5\_16 and 1.6.0\_07 and got the error:
Error occurred during initialization of VM
Could not reserve enough space for object heap
Could not create the Java virtual machine.
Through trial and error it seems 1200 megabytes is the most I can allocate on this machine.
Any ideas why one machine would allow 1400 and another only 1200?
Edit: The machine has 2GB of RAM with about 1600MB free after a fresh reboot.
| 0 | [
2,
8247,
2979,
1912,
27,
1936,
23045,
800,
3726,
3726,
31,
22,
195,
550,
74,
777,
20,
65,
111,
9530,
23861,
5957,
23246,
18,
26,
8247,
1353,
946,
27,
2512,
8,
3326,
1936,
23045,
13,
5,
1004,
1385,
137,
9,
300,
15,
137,
9,
264,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 block running two instances of the same program?
===
I need to make sure that user can run only one instance of my program at a time.
Which means, that I have to check programatically, whether the same program is already running, and quit in such case.
The first thing that came to my mind was to create a file somewhere, when the program starts. Then, each other instance of the program would check for this file and exit if it found it.
The trouble is, that the program must always exit gracefully and be able to delete the file it created, for this to work.
In case of, say, power outage, the lock file remains in place and the program can't be started again.
To solve this, I decided to store the first program's process ID into the lock file and when another instance starts, it checks if the PID from the file is attached to some running process.
If the file doesn't exist, is empty, or the PID doesn't correspond to any existing process, the program continues to run and writes its own PID to the file.
This seems to work quite fine - even after an unexpected shutdown, the chance that the (now obsolete) process ID will be associated with some other program, seems to be quite low.
But it still doesn't feel right (there *is* a chance of getting locked by some unrelated process) and working with process IDs seems to go beyond the standard C++ and probably isn't very portable either.
So, is there another (more clean and secure) way of doing this? Ideally one that would work with the ISO 98 C++ standard and on Windows and *nix alike.
If it cannot be done platform-independently, Linux/Unix is a priority for me. | 0 | [
2,
184,
20,
1921,
946,
81,
13946,
16,
14,
205,
625,
60,
800,
3726,
3726,
31,
376,
20,
233,
562,
30,
4155,
92,
485,
104,
53,
4851,
16,
51,
625,
35,
21,
85,
9,
56,
1108,
15,
30,
31,
57,
20,
2631,
625,
721,
8438,
15,
1472,
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... |
Php access to itunes tags in an RSS feed
===
I need to get access to the itunes tags in an RSS feed using php. I've used simplepie before for podcast feeds, but I'm not sure how to get the itunes tags using it. Is there a way to use simplepie to do it or is there a better way? | 0 | [
2,
13,
26120,
1381,
20,
12952,
3383,
18,
19,
40,
13,
1224,
18,
4063,
800,
3726,
3726,
31,
376,
20,
164,
1381,
20,
14,
12952,
3383,
18,
19,
40,
13,
1224,
18,
4063,
568,
13,
26120,
9,
31,
22,
195,
147,
1935,
9903,
115,
26,
15124... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Apache Webserver security and optimization tips
===
I'm about to deal with managing and running my first Internet connected Apache webserver and I was wondering if there are any sys admins and developers out there that would like to share some of their knowledge regarding security and optimization tips for running Apache webserver.
Maybe you can share your top five (or ten) list of things you immediately do after installing Apache webserver (on a Linux box).
Any help very much appreciated.
| 0 | [
2,
17140,
2741,
10321,
106,
1221,
17,
21597,
11034,
800,
3726,
3726,
31,
22,
79,
88,
20,
1183,
29,
5616,
17,
946,
51,
64,
2620,
2587,
17140,
2741,
10321,
106,
17,
31,
23,
5712,
100,
80,
50,
186,
10315,
18,
21,
43,
2160,
18,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Programming on the Asus EEE Pc in Visual Studio
===
Has anybody tried programming on the EEE Pc in Visual Studio?
I'm considering buying one so I can show some apps on the fly, but also make small changes to them if necessary, without the inconvenience of a large laptop.
Some key points I'm after:
- How fast it is
- Would it suit the needs of a developer making small changes to code?
It sounds like the specs would get completely owned, but I've heard/seen strangely good things about the EEE Pc, like how it launches Word 2007 super quick on a nLite'd XP install. :) | 0 | [
2,
3143,
27,
14,
28,
267,
13,
62,
2851,
5168,
19,
3458,
1120,
800,
3726,
3726,
63,
11181,
794,
3143,
27,
14,
13,
62,
2851,
5168,
19,
3458,
1120,
60,
31,
22,
79,
5154,
9459,
53,
86,
31,
92,
298,
109,
4865,
18,
27,
14,
2855,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I merge the properties two JavaScript objects dynamically?
===
I need to be able to merge two (very simple) JavaScript objects at runtime. For example I'd like to:
var obj1 = { food: 'pizza', car: 'ford' }
var obj2 = { animal: 'dog' }
obj1.merge(obj2);
//obj1 now has three properties: food, car, and animal
Does anyone have a script for this or know of a built in way to do this? I do not need recursion, and I do not need to merge functions, just methods on flat objects. | 0 | [
2,
184,
92,
31,
12666,
14,
3704,
81,
8247,
8741,
3916,
7782,
1326,
60,
800,
3726,
3726,
31,
376,
20,
44,
777,
20,
12666,
81,
13,
5,
7864,
1935,
6,
8247,
8741,
3916,
35,
485,
891,
9,
26,
823,
31,
22,
43,
101,
20,
45,
4033,
51... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can you use javascript to modify onmousedown of div at runtime
===
I want to write some JavaScript that will change the onmousedown of a div at runtime. So on load a mouse down on the div will do one thing and if a JavaScript fuction is called a mouse down on the div will do something else. Is this possible? | 0 | [
2,
92,
42,
275,
8247,
8741,
20,
17579,
27,
14002,
62,
2968,
16,
13,
12916,
35,
485,
891,
800,
3726,
3726,
31,
259,
20,
2757,
109,
8247,
8741,
30,
129,
753,
14,
27,
14002,
62,
2968,
16,
21,
13,
12916,
35,
485,
891,
9,
86,
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... |
UNIX shell written in a reasonable language?
===
Has anyone ever heard of a UNIX shell written in a reasonable language, like Python?
| 0 | [
2,
22540,
3593,
642,
19,
21,
9954,
816,
60,
800,
3726,
3726,
63,
1276,
462,
752,
16,
21,
22540,
3593,
642,
19,
21,
9954,
816,
15,
101,
20059,
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... | [
1,
1,
1,
1,
1,
1,
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... |
Silverlight: Empty Storyboard vs BackgroundWorker
===
Which one performs better to run a game main loop? | 0 | [
2,
1172,
3130,
45,
2424,
609,
2806,
4611,
2395,
22560,
800,
3726,
3726,
56,
53,
11563,
574,
20,
485,
21,
250,
407,
5293,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Sorting music
===
So over the years, I've bought music off iTunes, Urge, and Rhapsody and all these files are lying mixed with my non-DRM'd MP3 files that I've ripped off my CDs. Now some of these files have licenses that have expired, and some of them have valid licenses.
I want to sort my music by various DRM/license restrictions that they have on them. This will make it easier for my to delete the music that I don't have subscription to, and all know which files I can carry on which music player.
Does anyone know if this is possible in .NET/Perl/Python i.e. are there any libraries available that will help me do this? | 0 | [
2,
2058,
68,
232,
800,
3726,
3726,
86,
84,
14,
122,
15,
31,
22,
195,
2448,
232,
168,
12952,
15,
7773,
15,
17,
29664,
17,
65,
158,
6488,
50,
3262,
2198,
29,
51,
538,
8,
43,
6538,
22,
43,
4628,
240,
6488,
30,
31,
22,
195,
9263... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 convert a character code back to a character?
===
How to I get the Fixnum returned by the following:
"abc"[2]
Back into a character?
| 0 | [
2,
184,
107,
31,
8406,
21,
925,
1797,
97,
20,
21,
925,
60,
800,
3726,
3726,
184,
20,
31,
164,
14,
6098,
6336,
587,
34,
14,
249,
45,
13,
7,
21880,
7,
2558,
135,
500,
97,
77,
21,
925,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
merb_auth_password_slice does not maintain the session
===
Having integrated `merb_auth_password_slice` as per the README, I can successfully login as `redirect_after_login` is being triggered, although `session.authenticated?` returns false.
Just trying the basic auth strategy for now (password form), can't seem to get it working, any ideas?
My init file:
require 'dm-validations'
dependencies "merb-more", "merb_helpers", "merb-slices", "merb_auth_password_slice"
Merb::BootLoader.before_app_loads do
DataMapper.setup(:default, "sqlite3://config/dev.db")
end
Merb::BootLoader.after_app_loads do
# have already done this
# raise "You must specify a valid openid in Merb.root/config/open_id to use this example app" unless File.exists?(Merb.root / "config" / "open_id")
# # DataMapper.auto_migrate!
# User.create(:login => "admin",
# :password => "password", :password_confirmation => "password",
# :email => "admin@example.com",
# :identity_url => File.read(Merb.root / "config" / "open_id"))
end
Merb::Config.use do |c|
c[:session_secret_key] = 'my key'
c[:session_store] = 'cookie'
end
Setup.rb
class Authentication
def store_user(user)
return nil unless user
user.id
end
def fetch_user(session_info)
User.get(session_info)
end
end # Authentication
| 0 | [
2,
55,
7549,
1,
1346,
96,
1,
6201,
9587,
1,
18,
11909,
630,
52,
4027,
14,
3723,
800,
3726,
3726,
452,
5547,
13,
1,
1263,
220,
1,
1346,
96,
1,
6201,
9587,
1,
18,
11909,
1,
28,
416,
14,
1302,
790,
15,
31,
92,
3673,
6738,
108,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Logging entry and exit of methods along with parameters automagically?
===
Is there a way for me to add logging so that entering and exiting methods gets logged along with parameters automatically somehow for tracing purposes? How would I do so?
I am using Log4Net. | 0 | [
2,
13,
13919,
2792,
17,
4350,
16,
3195,
303,
29,
12905,
3108,
21200,
1326,
60,
800,
3726,
3726,
25,
80,
21,
161,
26,
55,
20,
3547,
13,
13919,
86,
30,
4604,
17,
24999,
3195,
3049,
13,
19287,
303,
29,
12905,
7499,
3625,
26,
20005,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What's the maximum number of keys for an array in php
===
I'm writing a php script where I call
$lines = file('base_list.txt');
to break a file up into an array. The file has over 100,000 lines in it, which should be 100,000 elements in the array, but when I run
print_r($lines);
exit;
the array only contains 7280 elements.
So I'm curious, WTF? Is there a limit on the amount of keys an array can have? I'm running this locally on a dual-core 2.0Ghz with 2GB of RAM (Vista & IIS though); so I'm a little confused how a 4MB file could throw results like this. | 0 | [
2,
98,
22,
18,
14,
2979,
234,
16,
5534,
26,
40,
7718,
19,
13,
26120,
800,
3726,
3726,
31,
22,
79,
1174,
21,
13,
26120,
3884,
113,
31,
645,
5579,
7939,
800,
3893,
5,
22,
8436,
1,
5739,
9,
38,
396,
38,
22,
6,
73,
20,
1442,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.