unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
T-SQL: How do I get the rows from one table whose values completely match up with values in another table?
===
Given the following:
declare @a table
(
pkid int,
value int
)
declare @b table
(
otherID int,
value int
)
insert into @a values (1, 1000)
insert into @a values (1, 1001)
insert into @a values (2, 1000)
insert into @a values (2, 1001)
insert into @a values (2, 1002)
insert into @b values (-1, 1000)
insert into @b values (-1, 1001)
insert into @b values (-1, 1002)
How do I query for all the values in @a that completely match up with @b?
{@a.pkid = 1, @b.otherID = -1} would not be returned (only 2 of 3 values match)
{@a.pkid = 2, @b.otherID = -1} would be returned (3 of 3 values match)
Refactoring tables can be an option.
| 0 | [
2,
13,
38,
8,
18,
22402,
45,
184,
107,
31,
164,
14,
11295,
37,
53,
859,
1196,
4070,
1524,
730,
71,
29,
4070,
19,
226,
859,
60,
800,
3726,
3726,
504,
14,
249,
45,
10123,
13,
1,
58,
859,
13,
5,
351,
14927,
19,
38,
15,
1923,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 GnuPG compatible with McAfee eBusiness Server 7.1?
===
Right now, we're using PGP command line 9.0. Does anybody know if GnuPG will work? It'd be a lot cheaper. | 0 | [
2,
25,
26092,
9623,
14961,
29,
18531,
16572,
13,
62,
18717,
8128,
453,
9,
165,
60,
800,
3726,
3726,
193,
130,
15,
95,
22,
99,
568,
351,
13321,
1202,
293,
561,
9,
387,
9,
630,
11181,
143,
100,
26092,
9623,
129,
170,
60,
32,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
TIGER shapefiles - using and interpreting
===
I know *of* the US GIS TIGER file format from years ago, but have never used it.
I'm very shortly going to need to very quickly implement simple geocoding and vector graphics of roads and other features.
- Where do I go for information - are there tutorials, example queries, etc?
Are there other ways to include geocoding and basic mapping in a mobile (no internet) device?
-Adam | 0 | [
2,
5825,
2539,
16877,
18,
13,
8,
568,
17,
11584,
68,
800,
3726,
3726,
31,
143,
1637,
1041,
2483,
14,
182,
16004,
5825,
3893,
2595,
37,
122,
1464,
15,
47,
57,
243,
147,
32,
9,
31,
22,
79,
253,
2100,
228,
20,
376,
20,
253,
976,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 merge a 2D array in Python into one string with List Comprehension?
===
List Comprehension for me seems to be like the opaque block of granite that regular expressions are for me. I need pointers.
Say, I have a 2D list:
li = [[0,1,2],[3,4,5],[6,7,8]]
I would like to merge this either into one long list
li2 = [0,1,2,3,4,5,6,7,8]
or into a string with separators:
s = "0,1,2,3,4,5,6,7,8"
Really, I'd like to know how to do both.
| 0 | [
2,
184,
107,
31,
12666,
21,
172,
43,
7718,
19,
20059,
77,
53,
3724,
29,
968,
27300,
60,
800,
3726,
3726,
968,
27300,
26,
55,
2206,
20,
44,
101,
14,
29068,
1921,
16,
9604,
30,
1290,
13832,
50,
26,
55,
9,
31,
376,
454,
445,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is Your Favourite Area of the Java API?
===
I'm curious to know what other Java programmers feel is their favorite part of the language, why they feel that way, and why other programmers should want an intimate knowledge of it as well. I'm looking for reasons like simplicity, performance, etc. Thanks. | 0 | [
2,
98,
25,
154,
7740,
217,
16,
14,
8247,
21,
2159,
60,
800,
3726,
3726,
31,
22,
79,
7686,
20,
143,
98,
89,
8247,
17968,
18,
583,
25,
66,
3839,
141,
16,
14,
816,
15,
483,
59,
583,
30,
161,
15,
17,
483,
89,
17968,
18,
378,
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... |
Favorite Bash Prompt
===
What are some elements in your favorite bash prompt?
I like to have an indicator of the success of the most recent command, like so (in .bashrc):
function exitstatus {
EXITSTATUS="$?"
BOLD="\[\033[1m\]"
RED="\[\033[1;31m\]"
GREEN="\[\e[32;1m\]"
BLUE="\[\e[34;1m\]"
OFF="\[\033[m\]"
PROMPT="[\u@\h ${BLUE}\W${OFF}"
if [ "${EXITSTATUS}" -eq 0 ]
then
PS1="${PROMPT} ${BOLD}${GREEN}:)${OFF} ]\$ "
else
PS1="${PROMPT} ${BOLD}${RED}:(${OFF} ]\$ "
fi
PS2="${BOLD}>${OFF} "
}
PROMPT_COMMAND=exitstatus
| 4 | [
2,
3839,
13158,
11443,
4417,
800,
3726,
3726,
98,
50,
109,
2065,
19,
154,
3839,
13158,
11443,
4417,
60,
31,
101,
20,
57,
40,
13310,
16,
14,
1280,
16,
14,
127,
1764,
1202,
15,
101,
86,
13,
5,
108,
13,
9,
6093,
3112,
150,
6,
45,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Communicating between Java and Flash without a Flash-specific server
===
I have Java and Flash client applications. What is the best way for the two to communicate without special Flash-specific servers such as BlazeDS or Red5? I am looking for a light client-only solution. | 0 | [
2,
23284,
128,
8247,
17,
4433,
366,
21,
4433,
8,
9219,
8128,
800,
3726,
3726,
31,
57,
8247,
17,
4433,
6819,
3767,
9,
98,
25,
14,
246,
161,
26,
14,
81,
20,
8709,
366,
621,
4433,
8,
9219,
17595,
145,
28,
9849,
43,
18,
54,
402,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... |
How does Authorize.net Silent POST work?
===
Authorize.net offers a "Silent POST" feature for their Automated Recurring Billing. It's supposed to POST data to a url of your choosing, telling you whether they were able to charge the customer, how much, etc. The problem is, it isn't very well documented.
- Is there any way to test a post to that URL? I've signed up for a developer account, but there's no way to specify that URL like you could in the actual system. Hence, there doesn't seem to be a way to test it out.
- If not, is there a list of possible values it could return? It appears to send `x_first_name`, `x_amount` - I've seen code that uses those values - but since I can't actually get it to send a response, I'm not sure.
- Is there documentation for this feature anywhere? Or even class that implements it fully? | 0 | [
2,
184,
630,
1314,
2952,
9,
2328,
2690,
678,
170,
60,
800,
3726,
3726,
1314,
2952,
9,
2328,
2486,
21,
13,
7,
8556,
2291,
678,
7,
1580,
26,
66,
14904,
11344,
1071,
68,
9,
32,
22,
18,
2293,
20,
678,
1054,
20,
21,
287,
6362,
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... |
Automate a Ruby Gem install that has input
===
I am trying to install the ibm_db gem so that I can access DB2 from Ruby. When I try:
sudo gem install ibm_db
I get the following request for clarification:
<pre>
Select which gem to install for your platform (i486-linux)
1. ibm_db 0.10.0 (ruby)
2. ibm_db 0.10.0 (mswin32)
3. ibm_db 0.9.5 (mswin32)
4. ibm_db 0.9.5 (ruby)
5. Skip this gem
6. Cancel installation
</pre>
I am always going to be installing the linux version (which I assume is the "ruby" version), so is there a way to pick which one I will install straight from the gem install command?
The reason this is a problem is that I need to automate this install via a bash script, so I would like to select that I want the "ruby" version ahead of time. | 0 | [
2,
3108,
5281,
21,
10811,
8551,
16146,
30,
63,
6367,
800,
3726,
3726,
31,
589,
749,
20,
16146,
14,
10233,
1,
9007,
8551,
86,
30,
31,
92,
1381,
13,
9007,
135,
37,
10811,
9,
76,
31,
1131,
45,
13,
18,
18601,
8551,
16146,
10233,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you implement a before_filter in Rails which gets only executed if a template is rendered?
===
I want to store the current URL in a session variable to reference the previous visited page.
If I store every URL (via a before_filter on ApplicationController), also actions which end in a redirect (create, update, etc) are considered as last visited page.
Is there a way to tell Rails only to execute a function if a template is rendered, or a way to determine the ActionView (?) status in a before_filter? | 0 | [
2,
184,
107,
42,
8713,
21,
115,
1,
11924,
815,
19,
2240,
18,
56,
3049,
104,
5557,
100,
21,
22894,
25,
10877,
60,
800,
3726,
3726,
31,
259,
20,
1718,
14,
866,
287,
6362,
19,
21,
3723,
7612,
20,
2801,
14,
1158,
3120,
2478,
9,
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... |
ResultSet not closed when connection closed?
===
I ve been doing code review (mostly using tools like FindBug) of one of our pet projects and FindBug marked following code as errorneus (pseudocode_):
Connection conn = dataSource.getConnection();
try{
PreparedStatement stmt = conn.prepareStatement();
//initialize the statement
stmt.execute();
ResultSet rs = stmt.getResultSet();
//get data
}finally{
conn.close();
}
The error was that that this code could might not release resources. I figured out that the ResultSet and Statement were not closed, so I closed them in finally.
finally{
try{
rs.close()
}catch(SqlException se){
//log it
}
try{
stmt.close();
}catch(SqlException se){
//log it
}
conn.close();
}
But I encountered the above pattern in many projects (from quite a few companies), and noone was closing ResultSets or Statements.
Did you have troubles with ResultSets and Statements not being closed when Connection is closed?
I found only [this][1] and it refers to Oracle having problems with closing ResultSets when closing Connections (we use Oracle db, hence my corrections). java.sql.api says nothing in Connection.close() javadoc.
[1]: http://www.theserverside.com/discussions/thread.tss?thread_id=41036 | 0 | [
2,
1736,
1198,
52,
827,
76,
2760,
827,
60,
800,
3726,
3726,
31,
13,
195,
74,
845,
1797,
1487,
13,
5,
18397,
568,
4672,
101,
477,
16254,
6,
16,
53,
16,
318,
3170,
2314,
17,
477,
16254,
2739,
249,
1797,
28,
7019,
17521,
18,
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... |
Real-time history export amongst bash terminal windows
===
Is it possible to share the same bash history file instance amongst all the terminal windows in real time? I want commands executed in one window to be available to all other terminal windows without having to restart them. | 0 | [
2,
683,
8,
891,
447,
7487,
4667,
13158,
3855,
1936,
800,
3726,
3726,
25,
32,
938,
20,
1891,
14,
205,
13158,
447,
3893,
4851,
4667,
65,
14,
3855,
1936,
19,
683,
85,
60,
31,
259,
14294,
5557,
19,
53,
1463,
20,
44,
904,
20,
65,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Flex: Custom Item Renderer For Combobox controls truncates text
===
I've implemented a custom item renderer that I'm using with a combobox on a flex project I'm working on. It displays and icon and some text for each item. The only problem is that when the text is long the width of the menu is not being adjusted properly and the text is being truncated when displayed. I've tried tweaking all of the obvious properties to alleviate this problem but have not had any success. Does anyone know how to make the combobox menu width scale appropriately to whatever data it's rendering?
My custom item renderer implementation is:
<?xml version="1.0" encoding="utf-8"?>
<mx:HBox xmlns:mx="http://www.adobe.com/2006/mxml"
styleName="plain" horizontalScrollPolicy="off">
<mx:Image source="{data.icon}" />
<mx:Label text="{data.label}" fontSize="11" fontWeight="bold" truncateToFit="false"/>
</mx:HBox>
And my combobox uses it like so:
<mx:ComboBox id="quicklinksMenu" change="quicklinkHandler(quicklinksMenu.selectedItem.data);" click="event.stopImmediatePropagation();" itemRenderer="renderers.QuickLinkItemRenderer" width="100%"/>
| 0 | [
2,
14409,
45,
5816,
9101,
16535,
106,
26,
22621,
5309,
8671,
22328,
160,
1854,
800,
3726,
3726,
31,
22,
195,
6807,
21,
5816,
9101,
16535,
106,
30,
31,
22,
79,
568,
29,
21,
22621,
5309,
27,
21,
14409,
669,
31,
22,
79,
638,
27,
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... |
SSRS - ReportViewer LocalReport Set SubReport parameter value
===
How can you programmatically set the parameters for a subreport? For the top-level report, you can do the following:
<pre>
reportViewer.LocalReport.SetParameters
(
new Microsoft.Reporting.WebForms.ReportParameter[]
{
new Microsoft.Reporting.WebForms.ReportParameter("ParameterA", "Test"),
new Microsoft.Reporting.WebForms.ReportParameter("ParameterB", "1/10/2009 10:30 AM"),
new Microsoft.Reporting.WebForms.ReportParameter("ParameterC", "1234")
}
);
</pre>
Passing parameters like the above only seems to pass them to the top-level report, not the subreports.
The LocalReport allows you to handle the SubreportProcessing event. That passes you an instance of SubreportProcessingEventArgs, which has a property of Type ReportParameterInfoCollection. The values in this collection are read-only. | 0 | [
2,
22118,
18,
13,
8,
1330,
4725,
106,
375,
17437,
309,
972,
17437,
18906,
1923,
800,
3726,
3726,
184,
92,
42,
625,
6732,
1326,
309,
14,
12905,
26,
21,
972,
17437,
60,
26,
14,
371,
8,
3906,
1330,
15,
42,
92,
107,
14,
249,
45,
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... |
Specifying location of new inlineshape in Word VBA?
===
I'm working on a document "wizard" for the company that I work for. It's a .dot file with a header consisting of some text and some form fields, and a lot of VBA code. The body of the document is pulled in as an OLE object from a separate .doc file.
Currently, this is being done as a `Shape`, rather than an `InlineShape`. I did this because I can absolutely position the Shape, whereas the InlineShape always appears at the beginning of the document.
The problem with this is that a `Shape` doesn't move when the size of the header changes. If someone needs to add or remove a line from the header due to a special case, they also need to move the object that defines the body. This is a pain, and I'd like to avoid it if possible.
Long story short, how do I position an `InlineShape` using VBA in Word?
Oh, and this is for a 10-year-old system setup, so Office '97. | 0 | [
2,
19077,
68,
1474,
16,
78,
19,
1143,
25096,
19,
833,
566,
969,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
4492,
13,
7,
23527,
1514,
7,
26,
14,
237,
30,
31,
170,
26,
9,
32,
22,
18,
21,
13,
9,
12527,
3893,
29,
21,
157,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 full string value of variable in VC6 watch window?
===
I'm wanting to get the full value of a char[] variable in the VC6 watch window, but it only shows a truncated version. I can copy the value from a debug memory window, but that contains mixed lines of hex and string values. Surely there is a better way?? | 0 | [
2,
184,
92,
31,
164,
503,
3724,
1923,
16,
7612,
19,
13,
8990,
379,
1455,
1463,
60,
800,
3726,
3726,
31,
22,
79,
4638,
20,
164,
14,
503,
1923,
16,
21,
4892,
2558,
500,
7612,
19,
14,
13,
8990,
379,
1455,
1463,
15,
47,
32,
104,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Localize Strings in Javascript
===
I'm currently using .resx files to manage my server side resources for .Net. The application that I am dealing with also allows developers to plugin javascript into various event handlers for client side validation, etc.. What is the best way for me to localize my javascript messages and strings? Ideally, I would like to store the strings in the .resx files to keep them with the rest of the localized resources. I'm open to suggestions. | 0 | [
2,
375,
2952,
7887,
19,
8247,
8741,
800,
3726,
3726,
31,
22,
79,
871,
568,
13,
9,
99,
18,
396,
6488,
20,
4705,
51,
8128,
270,
2566,
26,
13,
9,
2328,
9,
14,
3010,
30,
31,
589,
5746,
29,
67,
2965,
10168,
20,
10922,
108,
8247,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Callstack that has has AV reported I see FunctionName() + some Hex value?
===
What is this offset hex value? | 0 | [
2,
645,
25325,
30,
63,
63,
14026,
1117,
31,
196,
1990,
7259,
5,
6,
2754,
109,
24,
396,
1923,
60,
800,
3726,
3726,
98,
25,
48,
17493,
24,
396,
1923,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Can yum be used to list the contents of a package?
===
I know how to use rpm to list the contents of a package `(rpm -qpil package.rpm)`. Is there any way to do this with yum?
| 0 | [
2,
92,
13,
18105,
44,
147,
20,
968,
14,
8478,
16,
21,
6030,
60,
800,
3726,
3726,
31,
143,
184,
20,
275,
12936,
20,
968,
14,
8478,
16,
21,
6030,
13,
1,
5,
6952,
79,
13,
8,
1251,
10091,
6030,
9,
6952,
79,
6,
1,
9,
25,
80,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0... |
SQL Server 2005 - clicking on job->Properties yields "New Job" window.
===
Recently, I've started having a problem with my SQL Server 2005 client running on Windows XP where right-clicking on any job and selecting Properties instead brings me to the New Job window. Also, if I select "View History", I get the history for all jobs, instead of the one I right-clicked on.
This happened to me once before, and I found that I hadn't installed a service pack for SQL 2005. Once I installed it, the problem went away, and I haven't seen it in about a year. I haven't run any updates on it since, and I'm not sure what could have caused this.
As a possibly related note, I've tried installing XP Service Pack 3 on my machine twice, and it just hung on my machine(I started running it on Friday before leaving for the weekend, and it hadn't gone more than5-10% when I got back on Monday). I'm not sure if that fact is related at all, but I thought it possible that the XP update somehow overwrote something that SQL 2005 used before hanging.
Any ideas on what could cause this? I've included the current version info that shows up in SQL 2005.
Microsoft SQL Server Management Studio - 9.00.1399.00
Microsoft Analysis Services Client Tools - 2005.090.1399.00
Microsoft Data Access Components (MDAC) - 2000.085.1117.00 (xpsp_sp2_rtm.040803-2158)
Microsoft MSXML - 2.6 3.0 4.0 5.0 6.0
Microsoft Internet Explorer - 7.0.5730.13
Microsoft .NET Framework - 2.0.50727.1433
Operating System - 5.1.2600 | 0 | [
2,
4444,
255,
8128,
812,
13,
8,
25590,
27,
1205,
8,
1,
10890,
106,
3915,
18733,
13,
7,
2681,
1205,
7,
1463,
9,
800,
3726,
3726,
1989,
15,
31,
22,
195,
373,
452,
21,
1448,
29,
51,
4444,
255,
8128,
812,
6819,
946,
27,
1936,
2304... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
System.Convert.ToInt vs (int)
===
I noticed in another post, someone had done something like:
double d = 3.1415;
int i = Convert.ToInt32(Math.Floor(d));
Why did they use the convert function, rather than:
double d = 3.1415;
int i = (int)d;
which has an implicit floor and convert.
Also, more concerning, I noticed in some production code I was reading:
double d = 3.1415;
float f = Convert.ToSingle(d);
Is that the same as:
float f = (float)d;
Are all those otherwise implicit conversions just in the Convert class for completeness, or do they serve a purpose? I can understand a need for .ToString(), but not the rest. | 0 | [
2,
329,
9,
1126,
8122,
9,
262,
6391,
4611,
13,
5,
6391,
6,
800,
3726,
3726,
31,
2711,
19,
226,
678,
15,
737,
41,
677,
301,
101,
45,
1494,
13,
43,
800,
203,
9,
1419,
1193,
73,
19,
38,
31,
800,
8406,
9,
262,
6391,
3125,
5,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I troubleshoot performance problems with an Oracle SQL statement
===
I have two insert statements, almost exactly the same, which run in two different schemas on the same Oracle instance. What the insert statement looks like doesn't matter - I'm looking for a troubleshooting strategy here.
Both schemas have 99% the same structure. A few columns have slightly different names, other than that they're the same. The insert statements are almost exactly the same. The explain plan on one gives a cost of 6, the explain plan on the other gives a cost of 7. The tables involved in both sets of insert statements have exactly the same indexes. Statistics have been gathered for both schemas.
One insert statement inserts 12,000 records in 5 seconds.
The other insert statement inserts 25,000 records in 4 minutes 19 seconds.
The number of records being insert is correct. It's the vast disparity in execution times that confuses me. Given that nothing stands out in the explain plan, how would you go about determining what's causing this disparity in runtimes?
(I am using Oracle 10.2.0.4 on a Windows box). | 0 | [
2,
184,
107,
31,
2572,
12511,
956,
1716,
29,
40,
15759,
4444,
255,
3331,
800,
3726,
3726,
31,
57,
81,
14692,
9015,
15,
557,
1890,
14,
205,
15,
56,
485,
19,
81,
421,
23874,
18,
27,
14,
205,
15759,
4851,
9,
98,
14,
14692,
3331,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Optional Parameters in VB.NET Work
===
Let's say we have the following method declaration:
Public Function MyMethod(ByVal param1 As Integer, _
Optional ByVal param2 As Integer = 0, _
Optional ByVal param3 As Integer = 1) As Integer
Return param1 + param2 + param3
End Function
How does VB.NET make the optional parameters work within the confines of the CLR? Are optional parameters CLS-Compliant? | 0 | [
2,
184,
107,
12832,
12905,
19,
13,
20468,
9,
2328,
170,
800,
3726,
3726,
408,
22,
18,
395,
95,
57,
14,
249,
2109,
7098,
45,
317,
1990,
51,
5909,
1807,
43,
5,
779,
3377,
2258,
79,
165,
28,
13820,
15,
13,
1,
12832,
34,
3377,
225... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Polymorphic Models in Ruby on Rails?
===
For a project I'm working on, the store has two types of products - a real product and a group of products.
For this discussion, let's call them "1 T shirt" and "a box of T shirts". For one t-shirt, I need to store the normal attributes - price, sku, size, color, description, etc. For the box of t-shirts I need to have a price, sku, description, and a list of t-shirts that are included.
So right now, I'm representing this with the Shirt and ShirtCollection models. I can see this causing difficulty down the road when I need to do reporting and order management and making sure SKUs are unique.
So what's the best way of representing this? | 0 | [
2,
3446,
12498,
596,
2761,
19,
10811,
27,
2240,
18,
60,
800,
3726,
3726,
26,
21,
669,
31,
22,
79,
638,
27,
15,
14,
1718,
63,
81,
2551,
16,
1985,
13,
8,
21,
683,
2374,
17,
21,
214,
16,
1985,
9,
26,
48,
5460,
15,
408,
22,
18... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Integration Testing Http Proxy Server
===
I have written a simple HTTP Proxy server in C# that I would like to integration/functional test. Is there a product already created that I could use to do this? If not, what is the best way to write my own tests for this (I already have unit tests)? | 0 | [
2,
8078,
4431,
7775,
27188,
8128,
800,
3726,
3726,
31,
57,
642,
21,
1935,
7775,
27188,
8128,
19,
272,
5910,
30,
31,
83,
101,
20,
8078,
118,
27983,
1289,
9,
25,
80,
21,
2374,
614,
679,
30,
31,
110,
275,
20,
107,
48,
60,
100,
52... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When to use Windows Workflow Foundation?
===
Some things are easier to implement just by hand (code), but some are easier through WWF. It looks like WWF can be used to create (almost) any kind of algorithm. So (theoretically) I can do all my logic in WWF, but it's probably a bad idea to do it for all projects.
In what situations is it a good idea to use WWF and when will it make things harder then they have to be? What are pros and cons/cost of WWF vs. coding by hand? | 0 | [
2,
76,
20,
275,
1936,
170,
9990,
1304,
60,
800,
3726,
3726,
109,
564,
50,
4950,
20,
8713,
114,
34,
224,
13,
5,
9375,
6,
15,
47,
109,
50,
4950,
120,
20844,
9,
32,
1879,
101,
20844,
92,
44,
147,
20,
1600,
13,
5,
18135,
6,
186,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Lowest cost Windows VPS hosting?
===
For a while, I thought I'd host stuff at home because I can do whatever I want. However, hurricane Ike knocked out my power for a week, and I've finally realized this situation won't work.
I have extremely low traffice websites (20 visitors/day), so I don't need tons of CPU or bandwidth. What cheap options are there for VPS hosting that will give me flexiblity to do what I need to configure my server, but not cost very much. | 3 | [
2,
6543,
1516,
1936,
13,
10924,
18,
10637,
60,
800,
3726,
3726,
26,
21,
133,
15,
31,
289,
31,
22,
43,
2015,
3217,
35,
213,
185,
31,
92,
107,
2099,
31,
259,
9,
207,
15,
5195,
13,
7660,
5563,
70,
51,
414,
26,
21,
877,
15,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you increase the maximum heap size for the javac process in Borland JBuilder 2005/2006
===
In most modern IDEs there is a parameter that you can set to ensure javac gets enough heap memory to do its compilation. For reasons that are not worth going into here, we are tied for the time being to JBuilder 2005/2006, and it appears the amount of source code has exceeded what can be handled by javac.
Please keep the answer specific to JBuilder 2005/2006 javac (we cannot migrate away right now, and the Borland Make compiler does not correctly support Java 1.6) | 0 | [
2,
184,
107,
42,
1839,
14,
2979,
15414,
1072,
26,
14,
8247,
150,
953,
19,
3895,
618,
487,
20904,
812,
118,
2821,
800,
3726,
3726,
19,
127,
773,
13,
8153,
80,
25,
21,
18906,
30,
42,
92,
309,
20,
4062,
8247,
150,
3049,
511,
15414,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Maximum # of Results in a Sitecore Droplink field?
===
In Sitecore 6, one of my templates contains a "Droplink" field bound to the results of a particular sitecore query. This query currently returns approximately 200 items.
When I look at an item that implements this template in the content editor, I can only see the first 50 items in the field's dropdown list.
How do I display all of the items returned from this query in the editor's dropdown? | 0 | [
2,
2979,
6926,
16,
1736,
19,
21,
689,
10375,
2804,
6258,
575,
60,
800,
3726,
3726,
19,
689,
10375,
400,
15,
53,
16,
51,
22894,
18,
1588,
21,
13,
7,
12361,
6258,
7,
575,
4138,
20,
14,
1736,
16,
21,
1498,
689,
10375,
25597,
9,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Finding GDI/User resource usage from a crash dump
===
I have a crash dump of an application that is supposedly leaking GDI. The app is running on XP and I have no problems loading it into WinDbg to look at it. Previously we have use the [Gdikdx.dll extension][1] to look at Gdi information but this extension is not supported on XP or Vista.
Does anyone have any pointers for finding GDI object usage in WinDbg.
Alternatively, I do have access to the failing program (and its stress testing suite) so I can reproduce on a running system if you know of any 'live' debugging tools for XP and Vista.
[1]: http://msdn.microsoft.com/en-us/library/cc267206.aspx | 0 | [
2,
3007,
489,
1115,
118,
16704,
6577,
7514,
37,
21,
4597,
11424,
800,
3726,
3726,
31,
57,
21,
4597,
11424,
16,
40,
3010,
30,
25,
11731,
26334,
489,
1115,
9,
14,
4865,
25,
946,
27,
23045,
17,
31,
57,
90,
1716,
12797,
32,
77,
1511... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 "Best Practice" For Comparing to Instances of a Reference Type?
===
I came across this recently, up until now I have been happily overriding the equality operator (**==**) and/or **Equals** method in order to see if two references types actually contained the same **data** (i.e. two different instances that look the same).
I have been using this even more since I have been getting more in to automated testing (comparing reference/expected data against that returned).
While looking over some of the [coding standards guidelines in MSDN][1] I came across an [article][2] that advises against it. Now I understand *why* the article is saying this (because they are not the same *instance*) but it does not answer the question:
1. What is the best way to compare two reference types?**
2. Should we implement [IComparable][3]? (I have also seen mention that this should be reserved for value types only).
3. Is there some interface I don't know about?
4. Should we just roll our own?!
Many Thanks ^_^
[1]:http://msdn.microsoft.com/en-us/library/ms229042(VS.80).aspx
[2]:http://msdn.microsoft.com/en-us/library/7h9bszxx(VS.80).aspx | 0 | [
2,
98,
25,
13,
7,
4936,
1345,
7,
26,
15047,
20,
13946,
16,
21,
2801,
1001,
60,
800,
3726,
3726,
31,
281,
464,
48,
1989,
15,
71,
163,
130,
31,
57,
74,
12356,
84,
5175,
68,
14,
10337,
6022,
13,
5,
1409,
3726,
3726,
1409,
6,
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... |
Is it safe to get values from a java.util.HashMap from multiple threads (no modification)?
===
There is a case where a map will be constructed, and once it is initialized, it will never be modified again. It will however, be accessed (via get(key) only) from multiple threads. Is it safe to use a `java.util.HashMap` in this way?
(Currently, I'm happily using a `java.util.concurrent.ConcurrentHashMap`, and have no measured need to improve performance, but am simply curious if a simple `HashMap` would suffice. Hence, this question is *not* "Which one should I use?" nor is it a performance question. Rather, the question is "Would it be safe?") | 0 | [
2,
25,
32,
1834,
20,
164,
4070,
37,
21,
8247,
9,
14255,
9,
25436,
15022,
37,
1886,
20396,
13,
5,
251,
16135,
6,
60,
800,
3726,
3726,
80,
25,
21,
610,
113,
21,
2942,
129,
44,
2096,
15,
17,
382,
32,
25,
2104,
1333,
15,
32,
129... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JPA is not good enough
===
Working in a medium size project during last 4 months - we
are using JPA and Spring - I'm quite sure that JPA is not
powerfull for projects that requires more than CRUD
screen... Query interface is poor, Hibernate doesn't
respect JPA spec all the time and lot of times I need to use
hibernate classes, annotations and config.
What you guys think about JPA? It's not good enough? | 0 | [
2,
487,
1060,
25,
52,
254,
511,
800,
3726,
3726,
638,
19,
21,
4152,
1072,
669,
112,
236,
268,
818,
13,
8,
95,
50,
568,
487,
1060,
17,
1573,
13,
8,
31,
22,
79,
1450,
562,
30,
487,
1060,
25,
52,
2177,
255,
26,
2314,
30,
4781,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 remove published wmi schema?
===
I've published schema, and no longer have the dll's that contained the wmi provider that the schema was published from. How can I remove the schema? | 0 | [
2,
184,
20,
4681,
467,
619,
1435,
23874,
60,
800,
3726,
3726,
31,
22,
195,
467,
23874,
15,
17,
90,
1045,
57,
14,
13,
43,
211,
22,
18,
30,
3437,
14,
619,
1435,
11747,
30,
14,
23874,
23,
467,
37,
9,
184,
92,
31,
4681,
14,
2387... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Benefits of static code analysis.
===
What are the benefits of doing static code analysis on your source code? I was playing around with FxCop and I was wondering if there any benefits beyond making sure you are following the coding standards. | 0 | [
2,
5800,
16,
12038,
1797,
2495,
9,
800,
3726,
3726,
98,
50,
14,
5800,
16,
845,
12038,
1797,
2495,
27,
154,
1267,
1797,
60,
31,
23,
791,
140,
29,
13,
16488,
9734,
17,
31,
23,
5712,
100,
80,
186,
5800,
1701,
544,
562,
42,
50,
24... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Anyone know of any good Database Diff tools?
===
I can't find any good ones in sourceforge :( Anyone has any success with open source (or retail) database diff tool? | 0 | [
2,
1276,
143,
16,
186,
254,
6018,
20811,
4672,
60,
800,
3726,
3726,
31,
92,
22,
38,
477,
186,
254,
53,
18,
19,
1267,
1106,
834,
13,
45,
5,
1276,
63,
186,
1280,
29,
368,
1267,
13,
5,
248,
5881,
6,
6018,
20811,
5607,
60,
3,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
looking for best practice guidlines (or any guidelines) on using the jax-ws maven plugin
===
My particular use case is using the wsimport goal (which basically maps to the jaxws wsimport.sh tool) to generate java code from wsdl. Looking for ideas on how others have integrated this goal into their development cycle. ie. do you generate all the interfaces only once and check it in. Where do you store the actual wsdl and any xsd's ? in the src/resources or do you always generate against a remote url? I ask as the doc on the tool is pretty thin on the ground. | 0 | [
2,
699,
26,
246,
1345,
9457,
43,
7939,
13,
5,
248,
186,
12629,
6,
27,
568,
14,
11712,
8,
10268,
1216,
3124,
10922,
108,
800,
3726,
3726,
51,
1498,
275,
610,
25,
568,
14,
619,
8672,
1993,
1195,
13,
5,
2140,
11374,
6867,
20,
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... |
cURL in PHP returns different data in _FILE and _RETURNTRANSFER
===
I have noticed that cURL in PHP returns different data when told to output to a file via `CURLOPT_FILE` as it does when told to send the output to a string via `CURLOPT_RETURNTRANSFER`.
`_RETURNTRANSFER` seems to strip newlines and extra white space as if parsing it for display as standard HTML code. `_FILE` on the other hand preserves the file exactly as it was intended.
I have read through the documentation on php.net but haven't found anything that seems to solve my problem. Ideally, I would like to have `_RETURNTRANSFER` return the exact contents so I could eliminate an intermediate file, but I don't see any way of making this possible. | 0 | [
2,
14320,
19,
13,
26120,
4815,
421,
1054,
19,
13,
1,
16877,
17,
13,
1,
24632,
7028,
2407,
800,
3726,
3726,
31,
57,
2711,
30,
14320,
19,
13,
26120,
4815,
421,
1054,
76,
470,
20,
5196,
20,
21,
3893,
1197,
13,
1,
4734,
11362,
38,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you troubleshoot WPF UI problems?
===
I'm working on a WPF application that sometimes exhibits odd problems and appears to *hang* in the UI. It is inconsistent, it happens in different pages, but it happens often enough that it is a big problem. I should mention that it is not a true hang as described below.
My first thought was that the animations of some buttons was the problem since they are used on most pages, but after removing them the hangs still occur, although seemingly a bit less often. I have tried to break into the debugger when the hang occurs; however there is never any code to view. No code of mine is running. I have also noticed that the "hang" is not complete. I have code that lets me drag the form around (it has no border or title) which continues to work. I also have my won close button which functions when I click it. Clicking on buttons appears to actually work as my code runs, but the UI simply never updates to show a new page.
I'm looking for any advice, tools or techniques to track down this odd problem, so if you have any thoughts at all, I will greatly appreciate it.
| 0 | [
2,
184,
107,
42,
2572,
12511,
619,
7721,
13,
5661,
1716,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
619,
7721,
3010,
30,
1030,
11549,
4210,
1716,
17,
1780,
20,
1637,
7065,
2483,
19,
14,
13,
5661,
9,
32,
25,
22380,
15,
32,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Has TRUE always had a value of 1?
===
I have a co-worker that maintains that TRUE used to be defined as 0 and all other values were FALSE. I could swear that every language I've worked with, if you could even get a value for a boolean, that the value for FALSE is 0. Did TRUE used to be 0? If so, when did we switch? | 0 | [
2,
63,
1151,
550,
41,
21,
1923,
16,
137,
60,
800,
3726,
3726,
31,
57,
21,
326,
8,
22560,
30,
9767,
30,
1151,
147,
20,
44,
2811,
28,
713,
17,
65,
89,
4070,
46,
4997,
9,
31,
110,
6688,
30,
352,
816,
31,
22,
195,
577,
29,
15,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
how do I query multiple SQL tables for a specific key-value pair?
===
Situation: A PHP application with multiple installable modules creates a new table in database for each, in the style of mod_A, mod_B, mod_C etc. Each has the column section_id.
Now, I am looking for all entries for a specific section_id, and I'm hoping there's another way besides "Select * from mod_a, mod_b, mod_c ... mod_xyzzy where section_id=value"... or even worse, using a separate query for each module.
| 0 | [
2,
184,
107,
31,
25597,
1886,
4444,
255,
7484,
26,
21,
1903,
1246,
8,
15165,
2146,
60,
800,
3726,
3726,
1858,
45,
21,
13,
26120,
3010,
29,
1886,
16146,
579,
17113,
9695,
21,
78,
859,
19,
6018,
26,
206,
15,
19,
14,
1034,
16,
7226... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 use debugbreak() in C#.
===
What is the syntax and which namespace/class to be imported? Give me a sample code if possible taht will be of great help. | 0 | [
2,
184,
92,
31,
275,
121,
16254,
12008,
5,
6,
19,
272,
5910,
9,
800,
3726,
3726,
98,
25,
14,
22649,
17,
56,
204,
5582,
118,
1898,
20,
44,
11808,
60,
590,
55,
21,
5717,
1797,
100,
938,
13,
12515,
38,
129,
44,
16,
374,
448,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I match one letter or many in a PHP preg_split style regex
===
I'm having an issue with my regex.
I want to capture <% some stuff %> and i need what's inside the <% and the %>
This regex works quite well for that.
$matches = preg_split("/<%[\s]*(.*?)[\s]*%>/i",$markup,-1,(PREG_SPLIT_NO_EMPTY | PREG_SPLIT_DELIM_CAPTURE));
I also want to catch &% some stuff %&gt; so I need to capture <% or &lt;% and %> or %&gt; respectively.
If I put in a second set of parens, it makes preg_split function differently (because as you can see from the flag, I'm trying to capture what's inside the parens.
Preferably, it would only match &lt; to &gt; and < to > as well, but that's not completely necessary
| 0 | [
2,
184,
107,
31,
730,
53,
1748,
54,
151,
19,
21,
13,
26120,
782,
263,
1,
25603,
1034,
7953,
1706,
800,
3726,
3726,
31,
22,
79,
452,
40,
1513,
29,
51,
7953,
1706,
9,
31,
259,
20,
3683,
13,
1,
11881,
109,
3217,
13,
11881,
1,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible in W3C's XML Schema language (XSD) to allow a series of elements to be in any order but still limit occurrences?
===
I know about `all` and `choice`, but they don't account for a case where I do want some elements to be able to occur more than once, such as:
<Root>
<ThingA/>
<ThingB/>
<ThingC/>
<ThingC/>
<ThingC/>
</Root>
I could use `sequence`, but I'd prefer to allow these children to be in any order. I could use `any`, but then I couldn't have more than one `ThingC`. I could use `choice`, but then I couldn't limit `ThingA` and `ThingB` to 0 or 1.
I think I may have read somewhere that this was either difficult or impossible in XSD, but might be possible with RELAX NG. I don't remember where I read that, unfortunately.
Thanks for any help! | 0 | [
2,
25,
32,
938,
19,
619,
240,
150,
22,
18,
23504,
23874,
816,
13,
5,
396,
18,
43,
6,
20,
1655,
21,
231,
16,
2065,
20,
44,
19,
186,
389,
47,
174,
4496,
12933,
18,
60,
800,
3726,
3726,
31,
143,
88,
13,
1,
1233,
1,
17,
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... |
java.io.Console support in Eclipse IDE
===
I use the Eclipse IDE to develop, compile, and run my Java projects. Today, I'm trying to use the java.io.Console class to manage output and, more importantly, user input.
My problem is that System.Console() returns null when an application is run "through" Eclipse. I assume this means Eclipse runs without opening a console that the JVM recognizes.
Is there a code or Eclipse plugin solution to this problem?
Thanks,
Ross | 0 | [
2,
8247,
9,
1963,
9,
12124,
6069,
555,
19,
11652,
13,
3448,
800,
3726,
3726,
31,
275,
14,
11652,
13,
3448,
20,
2803,
15,
26561,
15,
17,
485,
51,
8247,
2314,
9,
786,
15,
31,
22,
79,
749,
20,
275,
14,
8247,
9,
1963,
9,
12124,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
xul: open a local html file relative to "myapp.xul" in xul browser
===
in short: **is there any way to find the current directory full path of a xul application?**
long explanation:
I downloaded http://benjamin.smedbergs.us/xulrunner/mybrowser-0.2.2.xulapp to test browser functionality in xul, specifically if it would be able to load the "processing" javascript port examples: http://ejohn.org/blog/processingjs/
It opened the files just fine if I entered the full path like "file:///c:\temp\processing-sample\index.html"
what i want to do is to open the file relative to my xul application.
I found i can open the user's profile path:
var DIR_SERVICE = new Components.Constructor("@mozilla.org/file/directory_service;1", "nsIProperties");
var path = (new DIR_SERVICE()).get("UChrm", Components.interfaces.nsIFile).path;
var appletPath;
// find directory separator type
if (path.search(/\\/) != -1)
{
appletPath = path + "\\myApp\\content\\applet.html"
}
else
{
appletPath = path + "/myApp/content/applet.html"
}
// Cargar el applet en el iframe
var appletFile = Components.classes["@mozilla.org/file/local;1"].createInstance(Components.interfaces.nsILocalFile);
appletFile.initWithPath(appletPath);
var appletURL = Components.classes["@mozilla.org/network/protocol;1?name=file"].createInstance(Components.interfaces.nsIFileProtocolHandler).getURLSpecFromFile(appletFile);
var appletFrame = document.getElementById("appletFrame");
appletFrame.setAttribute("src", appletURL);
**is there any way to find the current directory full path of a xul application?** | 0 | [
2,
993,
1287,
45,
368,
21,
375,
13,
15895,
3893,
4543,
20,
13,
7,
915,
7753,
9,
396,
1287,
7,
19,
993,
1287,
16495,
800,
3726,
3726,
19,
502,
45,
13,
1409,
403,
80,
186,
161,
20,
477,
14,
866,
16755,
503,
2013,
16,
21,
993,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Flash vs. Silverlight
===
We are building a training website where we need to track viewers watching videos and store detailed info about the viewing (when they paused, if they watched the whole video etc)
What should we consider when deciding between the two technologies?
| 0 | [
2,
4433,
4611,
9,
1172,
3130,
800,
3726,
3726,
95,
50,
353,
21,
838,
2271,
113,
95,
376,
20,
792,
6311,
1953,
6610,
17,
1718,
6036,
15404,
88,
14,
11244,
13,
5,
3185,
59,
4653,
15,
100,
59,
1634,
14,
979,
763,
2722,
6,
98,
378... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Trialware/licensing strategies
===
I wrote a utility for photographers that I plan to sell online pretty cheap ($10). I'd like to allow the user to try the software out for a week or so before asking for a license. Since this is a personal project and the software is not very expensive, I don't think that purchasing the services of professional licensing providers would be worth it and I'm rolling my own.
Currently, the application checks for a registry key that contains an encrypted string that either specifies when the trial expires or that they have a valid license. If the key is not present, a trial period key is created.
**So all you would need to do to get another week for free is delete the registry key.** I don't think many users would do that, especially when the app is only $10, but I'm curious if there's a better way to do this that is not onerous to the legitimate user. I write web apps normally and haven't dealt with this stuff before.
The app is in .NET 2.0, if that matters. | 0 | [
2,
2178,
5011,
118,
4663,
3474,
68,
10272,
800,
3726,
3726,
31,
738,
21,
10082,
26,
5980,
18,
30,
31,
944,
20,
3344,
2087,
1772,
9148,
13,
5,
4403,
1036,
6,
9,
31,
22,
43,
101,
20,
1655,
14,
4155,
20,
1131,
14,
2306,
70,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I change the build directory that MSBuild uses under Team Foundation Build?
===
I'm getting the following error when trying to build my app using Team Foundation Build:
>>C:\WINDOWS\Microsoft.NET\Framework\v3.5\Microsoft.Common.targets(1682,9): error MSB3554: Cannot write to the output file "obj\Release\Company.Redacted.BlahBlah.Localization.Subsystems.Startup_Shutdown_Processing.StartupShutdownProcessingMessages.de.resources". The specified path, file name, or both are too long. The fully qualified file name must be less than 260 characters, and the directory name must be less than 248 characters.
My project builds fine on my development machine as the source is only two folders deep, but TF Build seems to use a really deep directory that is causing it to break. How do I change the folders that are used?
**Edit:** I checked the .proj file for my build that is stored in source control and found the following:
<!-- BUILD DIRECTORY
This property is included only for backwards compatibility. The build directory used for a build
definition is now stored in the database, as the BuildDirectory property of the definition's
DefaultBuildAgent. For compatibility with V1 clients, keep this property in sync with the value
in the database.
-->
<BuildDirectoryPath>UNKNOWN</BuildDirectoryPath>
If this is stored in the database how do I change it? | 0 | [
2,
184,
107,
31,
753,
14,
1895,
16755,
30,
4235,
29361,
2027,
131,
173,
1304,
1895,
60,
800,
3726,
3726,
31,
22,
79,
1017,
14,
249,
7019,
76,
749,
20,
1895,
51,
4865,
568,
173,
1304,
1895,
45,
13,
1,
150,
45,
1,
27508,
18,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I run another web site or web service side by side with Sharepoint?
===
I'm getting a 404 error when trying to run another web service on an IIS 6 server which is also running Sharepoint. I'm pretty sure this is an issue with sharepoint taking over IIS configuration. Is there a way to make a certain web service or web site be ignored by whatever Sharepoint is doing? | 0 | [
2,
184,
107,
31,
485,
226,
2741,
689,
54,
2741,
365,
270,
34,
270,
29,
1891,
3132,
60,
800,
3726,
3726,
31,
22,
79,
1017,
21,
13,
23397,
7019,
76,
749,
20,
485,
226,
2741,
365,
27,
40,
595,
18,
400,
8128,
56,
25,
67,
946,
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... |
Apache module FORM handling in C
===
I'm implementing an Apache 2.0.x module in C, to interface with an existing product we have. I need to handle FORM data, most likely using POST but I want to handle the GET case as well.
Nick Kew's <A HREF="http://www.amazon.com/Apache-Modules-Book-Application-Development/dp/0132409674/ref=sr_1_1?ie=UTF8&s=books&qid=1221847681&sr=8-1">Apache Modules</A> book has a section on handling form data. It provides code examples for POST and GET, which return an apr\_hash\_t of the key+value pairs in the form. parse\_form\_from\_POST marshalls the bucket brigade and flattens it into a buffer, while parse\_form\_from\_GET can simply reference the URL. Both routines rely on a parse\_form\_from\_string routine to walk through each delimited field and extract the information into the hash table.
That would be fine, but it seems like there should be an easier way to do this than adding a couple hundred lines of code to my module. Is there an existing module or routines within apache, apr, or apr-util to extract the field names and associated data from a GET or POST FORM into a structure which C code can more easily access? I cannot find anything relevant, but this seems like a common need for which there should be a solution. | 0 | [
2,
17140,
12613,
505,
7988,
19,
272,
800,
3726,
3726,
31,
22,
79,
17333,
40,
17140,
172,
9,
387,
9,
396,
12613,
19,
272,
15,
20,
6573,
29,
40,
3149,
2374,
95,
57,
9,
31,
376,
20,
3053,
505,
1054,
15,
127,
1720,
568,
678,
47,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you install Boost on MacOS?
===
How do you install Boost on MacOS?
Right now I can't find bjam for the Mac. | 0 | [
2,
184,
107,
42,
16146,
10419,
27,
1572,
759,
60,
800,
3726,
3726,
184,
107,
42,
16146,
10419,
27,
1572,
759,
60,
193,
130,
31,
92,
22,
38,
477,
334,
12976,
26,
14,
1572,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Performance of try-catch in php
===
What kind of performance implications are there to consider when using try-catch statements in php 5?
I've read some old and seemingly conflicting information on this subject on the web before. A lot of the framework I currently have to work with was created on php 4 and lacks many of the niceties of php 5. So, I don't have much experience myself in using try-catchs with php.
| 0 | [
2,
956,
16,
1131,
8,
18208,
19,
13,
26120,
800,
3726,
3726,
98,
825,
16,
956,
14747,
50,
80,
20,
3563,
76,
568,
1131,
8,
18208,
9015,
19,
13,
26120,
331,
60,
31,
22,
195,
1302,
109,
315,
17,
9688,
22297,
676,
27,
48,
1550,
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... |
SQL Query Help: Transforming Dates In A Non-Trivial Way
===
I have a table with a "Date" column, and I would like to do a query that does the following:
If the date is a **Monday**, **Tuesday**, **Wednesday**, or **Thursday**, the displayed date should be shifted up by 1 day, as in <pre>DATEADD(day, 1, [Date])</pre> On the other hand, if it is a **Friday**, the displayed date should be incremented by 3 days (i.e. so it becomes the following _Monday_).
How do I do this in my SELECT statement? As in,
<pre>SELECT somewayofdoingthis([Date]) FROM myTable</pre>
(This is SQL Server 2000.) | 0 | [
2,
4444,
255,
25597,
448,
45,
22335,
4076,
19,
21,
538,
8,
19712,
161,
800,
3726,
3726,
31,
57,
21,
859,
29,
21,
13,
7,
8209,
7,
4698,
15,
17,
31,
83,
101,
20,
107,
21,
25597,
30,
630,
14,
249,
45,
100,
14,
1231,
25,
21,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Any automated tool for silverlight xap deployment with web services
===
Does anyone know of any tools, or even good processes for deploying Web Services and Silverlight applications that rely on those, and have it be able to automatically change the web services url and port nunbers in the config files automatically?
right now I am always finding myself having to change the web service config on the server and then also have to edit the config inside the XAP. This is a pain when deploying small iterations to several servers (test, sales, demo, production, etc). I know i could write custom code, but i want to avoid that if I can.
Its especially painful forgetting to make a change and getting a call later from a tester.
Thanks | 0 | [
2,
186,
14904,
5607,
26,
1172,
3130,
993,
2552,
10475,
29,
2741,
687,
800,
3726,
3726,
630,
1276,
143,
16,
186,
4672,
15,
54,
166,
254,
5102,
26,
17617,
68,
2741,
687,
17,
1172,
3130,
3767,
30,
12139,
27,
273,
15,
17,
57,
32,
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... |
Objective-C switch using objects?
===
I'm doing some Objective-C programming that involves parsing an NSXmlDocument and populating an objects properties from the result.
First version looked like this:
if([elementName compare:@"companyName"] == 0)
[character setCorporationName:currentElementText];
else if([elementName compare:@"corporationID"] == 0)
[character setCorporationID:currentElementText];
else if([elementName compare:@"name"] == 0)
...
But I don't like the if-else-if-else pattern this produces. Looking at the `switch` statement I see that i can only handle `ints`, `chars` etc and not objects... so is there a better implementation pattern I'm not aware of?
BTW I did actually come up with a better solution for setting the object's properties, but I want to know specifically about the `if`-`else` vs `switch` pattern in Objective-C | 0 | [
2,
7038,
8,
150,
5521,
568,
3916,
60,
800,
3726,
3726,
31,
22,
79,
845,
109,
7038,
8,
150,
3143,
30,
6569,
2017,
18,
68,
40,
13,
2172,
396,
8184,
28132,
17,
1675,
10038,
40,
3916,
3704,
37,
14,
829,
9,
64,
615,
292,
101,
48,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
URLSCAN question
===
I have uriscan installed on my Win2003 server and it is blocking an older ColdFusion script. The log entry has the following--
2008-09-19 00:16:57 66.82.162.13 1416208729 GET /Admin/Uploads/Mountain/Wolf%2520Creek%2520gazeebo.jpg Rejected URL+is+double+escaped URL - -
How do I get uriscan to allow submissions like this without turning off the double-escaped url feature? | 0 | [
2,
13,
911,
7532,
1245,
1301,
800,
3726,
3726,
31,
57,
13,
3594,
18,
1245,
4066,
27,
51,
628,
3325,
8128,
17,
32,
25,
11828,
40,
1234,
1191,
9818,
3884,
9,
14,
6738,
2792,
63,
14,
249,
8,
8,
570,
8,
2545,
8,
1433,
13,
2032,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 won't my package upgrade with yum?
===
I'm trying to upgrade a package using yum on Fedora 8. The package is "elfutils". Here's what I have installed locally:
$ yum info elfutils
Installed Packages
Name : elfutils
Arch : x86_64
Version: 0.130
Release: 3.fc8
Size : 436 k
Repo : installed
Summary: A collection of utilities and DSOs to handle compiled objects
There's a bug in this version, and according to the [bug report][1], a newer version has been pushed to the Fedora 8 stable repository. But, if I try to update:
$ yum update elfutils
Setting up Update Process
Could not find update match for elfutils
No Packages marked for Update
Here are my repositories:
$ yum repolist enabled
repo id repo name status
InstallMedia Fedora 8 enabled
fedora Fedora 8 - x86_64 enabled
updates Fedora 8 - x86_64 - Updates enabled
What am I missing?
[1]: https://bugzilla.redhat.com/show_bug.cgi?id=377241
| 0 | [
2,
483,
230,
22,
38,
51,
6030,
9483,
29,
13,
18105,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
9483,
21,
6030,
568,
13,
18105,
27,
26726,
58,
469,
9,
14,
6030,
25,
13,
7,
532,
410,
14255,
18,
7,
9,
235,
22,
18,
98,
31,
57,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tips on refactoring an outdated database schema
===
Being stuck with a legacy database schema that no longer reflects your data model is every developer's nightmare. Yet with all the talk of refactoring code for maintainability I have not heard much of refactoring outdated database schemas.
What are some tips on how to transition to a better schema without breaking all the code that relies on the old one? I will propose a specific problem I am having to illustrate my point but feel free to give advice on other techniques that have proven helpful - those will likely come in handy as well.
----------
My example:
My company receives and ships products. Now a product receipt and a product shipment have some very different data associated with them so the original database designers created a separate table for receipts and for shipments.
In my one year working with this system I have come to the realization that the current schema doesn't make a lick of sense. After all, both a receipt and a shipment are basically a transaction, they each involve changing the amount of a product, at heart only the +/- sign is different. Indeed, we frequently need to find the total amount that the product has changed over a period of time, a problem for which this design is downright intractable.
Obviously the appropriate design would be to have a single Transactions table with the Id being a foreign key to either a ReceiptInfo or a ShipmentInfo table. Unfortunately, the wrong schema has already been in production for some years and has hundreds of stored procedures, and thousands of lines of code written off of it. How then can I transition the schema to work correctly? | 4 | [
2,
11034,
27,
302,
17455,
68,
40,
70,
43,
1669,
6018,
23874,
800,
3726,
3726,
142,
4549,
29,
21,
7780,
6018,
23874,
30,
90,
1045,
11967,
154,
1054,
1061,
25,
352,
10058,
22,
18,
10586,
9,
768,
29,
65,
14,
930,
16,
302,
17455,
68... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
VB6 error : Error accessing the system registry
===
In visual basic 6, when I attempt to access Project > References, it throws an error
"Error accessing system registry"
I'm logged in as the local computer administrator running windows XP professional and I can execute regedt32.exe and access all the registry keys just fine. VB6 was installed as the local administrator.
any ideas why this happens?
thanks in advance
-Phill | 0 | [
2,
13,
20468,
379,
7019,
13,
45,
7019,
1381,
68,
14,
329,
18269,
800,
3726,
3726,
19,
3458,
2125,
400,
15,
76,
31,
1735,
20,
1381,
669,
13,
1,
7231,
15,
32,
13566,
40,
7019,
13,
7,
29992,
1381,
68,
329,
18269,
7,
31,
22,
79,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Information on how to use margins
===
I need some info on how to use margins and how exactly "padding" works:<br> <br>
For example: should I put a line to occupate the whole width of the page (no matter what resolution is used to display the web page) letting just a small border on each side, how could I put this?
Thank you! | 0 | [
2,
676,
27,
184,
20,
275,
5440,
18,
800,
3726,
3726,
31,
376,
109,
15404,
27,
184,
20,
275,
5440,
18,
17,
184,
1890,
13,
7,
1060,
11365,
7,
693,
45,
1,
5145,
1,
13,
1,
5145,
1,
26,
823,
45,
378,
31,
442,
21,
293,
20,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to generate all permutations of a list in Python
===
How do you generate all the permutations of a list in Python, independently of the type of elements in that list.
For example:
permutations ([])
[]
permutations ([1,])
[1]
permutations ([1,2])
[1, 2]
[2, 1]
permutations ([1,2,3])
[1, 2, 3]
[1, 3, 2]
[2, 1, 3]
[2, 3, 1]
[3, 1, 2]
[3, 2, 1]
| 0 | [
2,
184,
20,
7920,
65,
28706,
18,
16,
21,
968,
19,
20059,
800,
3726,
3726,
184,
107,
42,
7920,
65,
14,
28706,
18,
16,
21,
968,
19,
20059,
15,
9029,
16,
14,
1001,
16,
2065,
19,
30,
968,
9,
26,
823,
45,
28706,
18,
13,
5,
2558,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Download the Source for BIRT?
===
The Eclipse projects are all stored in the Eclipse Foundation CVS servers. Using the source is a great way to debug your code and to figure out how to do new things.
Unfortunately in a large software project like BIRT, it can be difficult which projects and versions are required for a particular build. So what is the best way to get the source for a particular build. | 0 | [
2,
184,
107,
31,
7121,
14,
1267,
26,
8719,
38,
60,
800,
3726,
3726,
14,
11652,
2314,
50,
65,
8214,
19,
14,
11652,
1304,
13,
12732,
18,
17595,
9,
568,
14,
1267,
25,
21,
374,
161,
20,
121,
16254,
154,
1797,
17,
20,
1465,
70,
184... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Memory footprint issues with JAVA, JNI, and C application
===
I have a piece of an application that is written in C, it spawns a JVM and uses JNI to interact with a Java application. My memory footprint via Process Explorer gets upto 1GB and runs out of memory. Now as far as I know it should be able to get upto 2GB. One thing I believe is that the memory the JVM is using isn't visible in the Process Explorer. My xmx is set to 256, I added some statements to watch the java side memory and it is peaking at 256 and GC is doing its job and it is all good on that side. So my question is, where is the other 700+ MB being consumed? Anyone out there a Java/JNI/C Memory expert? | 0 | [
2,
1912,
18511,
1549,
29,
8247,
15,
487,
889,
15,
17,
272,
3010,
800,
3726,
3726,
31,
57,
21,
1855,
16,
40,
3010,
30,
25,
642,
19,
272,
15,
32,
13,
22860,
18,
21,
487,
20147,
17,
2027,
487,
889,
20,
10001,
29,
21,
8247,
3010,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Flash - Drag Two Movieclips at Once?
===
I'm trying to create a map application similar to <a href="http://flashden.net/item/zoom-pan-controls-with-dynamic-image-settings/15713">this</a>. Click the SWF Preview tab on the left of the image. Specifically, noticed how you can pan around, and the clickable buttons on the map move with it. Basically, how do they do that?
My application has a map that you can click and pan around using a startDrag() function. I have a separate layer with other, clickable movie clips that I'd like to follow the pans of the map layer. Unfortunately, Flash limits you to dragging only <a href="http://www.adobe.com/support/flash/action_scripts/actionscript_dictionary/actionscript_dictionary681.html">one movie clip at a time</a>. Somebody proposed a solution using a <a href="http://proto.layer51.com/d.aspx?f=845">prototype</a>, but I can't get that working correctly, and I'm not sure if it's because I'm using ActionScript 3.0 or not.
Can anybody outline a better way for me to accomplish what I'm trying to do, or a better way to do what I'm currently doing? Appreciate it. | 0 | [
2,
4433,
13,
8,
5501,
81,
1308,
150,
6013,
18,
35,
382,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
1600,
21,
2942,
3010,
835,
20,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
26694,
817,
9,
2328,
118,
2119,
79,
118,
2500,
2636,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Version control for binaries
===
What version control systems would be useful or have extra features to support projects that are mainly binary files like mp3, wav, or proprietary application-specific file types? | 0 | [
2,
615,
569,
26,
4511,
11301,
800,
3726,
3726,
98,
615,
569,
1242,
83,
44,
4811,
54,
57,
2230,
967,
20,
555,
2314,
30,
50,
2011,
14171,
6488,
101,
4628,
240,
15,
3142,
710,
15,
54,
18856,
3010,
8,
9219,
3893,
2551,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Free SQL Server development tools
===
I usually use Management Studio and SQLCMD to work with SQL Server. For the most part, they work for me. I'm just kind of curious what else is out there. I just want to find out if there are any needs I have that are unfulfilled. So what are some helpful SQL Server tools? There's no particular functionality I'm looking to replace or find a better tool for, so if it's a SQL Server tool and you think it's useful, post it.
Cross-links:
- [What is the best development environment for TSQL / SQL Server][1]
[1]: http://stackoverflow.com/questions/22857/what-is-the-best-development-environment-for-tsql-sql-server | 0 | [
2,
551,
4444,
255,
8128,
522,
4672,
800,
3726,
3726,
31,
951,
275,
1097,
1120,
17,
4444,
6109,
79,
43,
20,
170,
29,
4444,
255,
8128,
9,
26,
14,
127,
141,
15,
59,
170,
26,
55,
9,
31,
22,
79,
114,
825,
16,
7686,
98,
962,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Applying Styles To ListItems in CheckBoxList
===
How can styles be applied to CheckBoxList ListItems. Unlike other controls, such as the Repeater where you can specify <ItemStyle>, you can't seem to specify a style for each individual control.
Is there some sort of work around? | 0 | [
2,
11989,
6443,
20,
968,
2119,
79,
18,
19,
2631,
5309,
5739,
800,
3726,
3726,
184,
92,
6443,
44,
2435,
20,
2631,
5309,
5739,
968,
2119,
79,
18,
9,
2822,
89,
8671,
15,
145,
28,
14,
6830,
106,
113,
42,
92,
19077,
13,
1,
2119,
79... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
For std::map, how will insert behave if it has to resize the container and the memory is not available?
===
For std::map, how will insert behave if it has to resize the container and the memory is not available? | 0 | [
2,
26,
354,
43,
45,
45,
15022,
15,
184,
129,
14692,
14149,
100,
32,
63,
20,
302,
10454,
14,
12147,
17,
14,
1912,
25,
52,
904,
60,
800,
3726,
3726,
26,
354,
43,
45,
45,
15022,
15,
184,
129,
14692,
14149,
100,
32,
63,
20,
302,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Is there a way to force a style to a div element which already has a style="" attribute
===
I'm trying to skin HTML output which I don't have control over. One of the elements is a DIV with a style="overflow: auto" attribute. Is there a way in CSS to force that DIV to use "overflow: hidden"? | 0 | [
2,
25,
80,
21,
161,
20,
558,
21,
1034,
20,
21,
13,
12916,
4520,
56,
614,
63,
21,
1034,
3726,
7,
7,
35,
14755,
800,
3726,
3726,
31,
22,
79,
749,
20,
1188,
13,
15895,
5196,
56,
31,
221,
22,
38,
57,
569,
84,
9,
53,
16,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Mod-rewrites on apache: change all URLs
===
Right now I'm doing something like this:
RewriteRule ^/?logout(/)?$ logout.php
RewriteRule ^/?config(/)?$ config.php
I would much rather have one rules that would do the same thing for each url, so I don't have to keep adding them every time I add a new file.
Also, I like to match things like '/config/new' to 'config_new.php' if that is possible. I am guessing some regexp would let me accomplish this?
Thanks Stack Addicts! | 0 | [
2,
7226,
8,
99,
23716,
18,
27,
17140,
45,
753,
65,
13,
911,
7532,
800,
3726,
3726,
193,
130,
31,
22,
79,
845,
301,
101,
48,
45,
27891,
16154,
13,
1,
118,
60,
5567,
1320,
5,
118,
6,
60,
4403,
6738,
1320,
9,
26120,
27891,
16154,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Cannot store load test results in a TFS 2005 results store
===
I've setup a results store and when I publish results of a load test, I can't view the published test details.
From the test run section of the build report I click on the published build and when I choose View Test Results Details from the Test Runs shortcut menu I get an error that the test results details cannot be viewed because the results were not stored in a results store.
I've looked for the data in the results store database and I don't anything there so the error makes sense.
I've setup a connection string to the results store in the Adminster Test Controller dialog. Is this the only thing that needs to be done to get test reults into the store?
jMM | 0 | [
2,
1967,
1718,
6305,
1289,
1736,
19,
21,
13,
11720,
18,
812,
1736,
1718,
800,
3726,
3726,
31,
22,
195,
18161,
21,
1736,
1718,
17,
76,
31,
10824,
1736,
16,
21,
6305,
1289,
15,
31,
92,
22,
38,
1418,
14,
467,
1289,
3289,
9,
37,
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... |
Oriented Bounding Box vs Oriented Bounding Box intersection test (c/c++)
===
I'd like an optimized implementation for this test. It need not conform exactly to this prototype.
bool OOBBIntersectOOBB(
float center0[3],
float halfExtents0[3], // or some other bounding description
float rotation0[9], // quaternion would also be fine
float center1[3],
float halfExtents1[3],
float rotation1[9]); | 0 | [
2,
13,
6800,
4138,
68,
1649,
4611,
13,
6800,
4138,
68,
1649,
5351,
1289,
13,
5,
150,
118,
150,
20512,
6,
800,
3726,
3726,
31,
22,
43,
101,
40,
22864,
43,
6123,
26,
48,
1289,
9,
32,
376,
52,
13620,
1890,
20,
48,
7063,
9,
1607,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 freely available C# wrapper for BITS?
===
BITS, the Windows background intelligent transfer service.
Looks like there are a few C# wrappers around that manage the interop to BITS, does anybody have any opinions on the best one? | 0 | [
2,
98,
22,
18,
14,
246,
11298,
904,
272,
5910,
28051,
26,
10181,
60,
800,
3726,
3726,
10181,
15,
14,
1936,
2395,
9214,
2617,
365,
9,
1879,
101,
80,
50,
21,
310,
272,
5910,
28051,
18,
140,
30,
4705,
14,
1480,
2594,
20,
10181,
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,
0,
0,
0,
0,
0,
0,
0,
0... |
Calling PHP functions within HEREDOC strings
===
In PHP, the <a href="http://us2.php.net/manual/en/language.types.string.php#language.types.string.syntax.heredoc>HEREDOC</a> string declarations are really useful for outputting a block of html. You can have it parse in variables just by prefixing them with $, but for more complicated syntax (like $var[2][3]), you have to put your expression inside {} braces.
In PHP 5, it _is_ possible to actually make function calls within {} braces inside a HEREDOC string, but you have to go through a bit of work. The function name itself has to be stored in a variable, and you have to call it like it is a dynamically-named function. For example:
<code><pre>
$fn = 'testfunction';
function testfunction() { return 'ok'; }
$string = <<< heredoc
plain text and now a function: {$fn()}
heredoc;
</pre></code>
As you can see, this is a bit more messy than just:
<code><pre>
$string = <<< heredoc
plain text and now a function: {testfunction()}
heredoc;
</pre></code>
There are other ways besides the first code example, such as breaking out of the HEREDOC to call the function, or reversing the issue and doing something like:
<code><pre>
?>
<!-- directly outputting html and only breaking into php for the function -->
plain text and now a function: <?PHP print testfunction(); ?>
</pre></code>
The latter has the disadvantage that the output is directly put into the output stream (unless I'm using output buffering), which might not be what I want.
So, the essence of my question is: is there a more elegant way to approach this? | 0 | [
2,
2555,
13,
26120,
3719,
363,
235,
13799,
7887,
800,
3726,
3726,
19,
13,
26120,
15,
14,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
267,
135,
9,
26120,
9,
2328,
118,
177,
6948,
118,
219,
118,
7020,
9,
4474,
18,
9,
11130,
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... |
WPF Validation for the whole form
===
I have been seriously disappointed with WPF validation system. Anyway! How can I validate the complete form by clicking the "button"?
For some reason everything in WPF is soo complicated! I can do the validation in 1 line of code in ASP.NET which requires like 10-20 lines of code in WPF!!
I can do this using my own ValidationEngine framework:
Customer customer = new Customer();
customer.FirstName = "John";
customer.LastName = String.Empty;
ValidationEngine.Validate(customer);
if (customer.BrokenRules.Count > 0)
{
// do something display the broken rules!
} | 0 | [
2,
619,
7721,
27999,
26,
14,
979,
505,
800,
3726,
3726,
31,
57,
74,
4818,
9644,
29,
619,
7721,
27999,
329,
9,
2774,
187,
184,
92,
31,
7394,
1373,
14,
1279,
505,
34,
25590,
14,
13,
7,
811,
444,
7,
60,
26,
109,
1215,
796,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Warm Backup
===
We have a warm sql backup. full backup nightly, txn logs shipped every so often during the day and restored. I need to move the data files to another disk. These DB's are in a "warm backup" state (such that i can't unmark them as read-only - "Error 5063: Database '<dbname>' is in warm standby. A warm-standby database is read-only.
") and am worried about detaching and re-attaching - how do we obtain the "warm backup" status after detach/attach operations are complete. | 0 | [
2,
2059,
10119,
800,
3726,
3726,
95,
57,
21,
2059,
4444,
255,
10119,
9,
503,
10119,
343,
102,
15,
20225,
103,
18893,
12991,
352,
86,
478,
112,
14,
208,
17,
4617,
9,
31,
376,
20,
780,
14,
1054,
6488,
20,
226,
8582,
9,
158,
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... |
Always have to use .css files?
===
Are .css files always needed? Or may I have a .css "basic" file and store other style items inside the HTML page?
Does padding, borders and so on always have to be defined into a .css file stored separately, or may I use them normally into an HTML page? | 0 | [
2,
550,
57,
20,
275,
13,
9,
6824,
18,
6488,
60,
800,
3726,
3726,
50,
13,
9,
6824,
18,
6488,
550,
851,
60,
54,
123,
31,
57,
21,
13,
9,
6824,
18,
13,
7,
26467,
7,
3893,
17,
1718,
89,
1034,
3755,
572,
14,
13,
15895,
2478,
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... |
What's the best source to learn about database replication mechanisms?
===
What's the widest overview and where are the deepest analysis of different replication methods and problems? | 0 | [
2,
98,
22,
18,
14,
246,
1267,
20,
2484,
88,
6018,
23841,
11626,
60,
800,
3726,
3726,
98,
22,
18,
14,
1051,
384,
21598,
17,
113,
50,
14,
19944,
2495,
16,
421,
23841,
3195,
17,
1716,
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... |
Accessing Greasemonkey metadata from within your script?
===
Is there any way that my script can retrieve metadata values that are declared in its own header? I don't see anything promising in the API, except perhaps `GM_getValue()`. That would of course involve a special name syntax. I have tried, for example: `GM_getValue("@name")`.
The motivation here is to avoid redundant specification.
If GM metadata is not directly accessible, perhaps there's a way to read the body of the script itself. It's certainly in memory somewhere, and it wouldn't be too awfully hard to parse for `"// @"`. (That may be necessary in my case any way, since the value I'm really interested in is `@version`, which is an extended value read by <a href="http://userscripts.org/">userscripts.org</a>.)
| 0 | [
2,
1381,
68,
21167,
2111,
4237,
28057,
37,
363,
154,
3884,
60,
800,
3726,
3726,
25,
80,
186,
161,
30,
51,
3884,
92,
11917,
28057,
4070,
30,
50,
2482,
19,
82,
258,
157,
106,
60,
31,
221,
22,
38,
196,
602,
10466,
19,
14,
21,
215... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CVS and VS.Net 2008 - integration options
===
I'd like to increase developers' "comfort level" in our team a bit.
We are using VS.Net 2008 and TortoiseCVS + WinCVS, but no integration as of yet.
In your CVS/VS.Net experience, what is the best integration tool in terms of "supports basic CVS functionality add/diff/update/commit/annotate/etc", "works out of the box", almost "bug-free"?
- a) commercial
- b) free or open source
| 0 | [
2,
13,
12732,
18,
17,
4611,
9,
2328,
570,
13,
8,
8078,
6368,
800,
3726,
3726,
31,
22,
43,
101,
20,
1839,
10168,
22,
13,
7,
960,
6469,
662,
7,
19,
318,
173,
21,
1142,
9,
95,
50,
568,
4611,
9,
2328,
570,
17,
25691,
12732,
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... |
Does the iPhone SDK allow hardware access to the dock connector?
===
I haven't been able to find any documentation on hardware access via the iPhone SDK so far. I'd like to be able to send signals via the dock connector to an external hardware device but haven't seen any evidence that this is accessible via the SDK (not interested in possibilities on jailbroken iPhones).
Anyone have any pointers to docs for this or some idea of what deep dark corner i should look? | 0 | [
2,
630,
14,
21024,
13,
18,
43,
197,
1655,
7610,
1381,
20,
14,
6120,
17991,
60,
800,
3726,
3726,
31,
2933,
22,
38,
74,
777,
20,
477,
186,
13945,
27,
7610,
1381,
1197,
14,
21024,
13,
18,
43,
197,
86,
463,
9,
31,
22,
43,
101,
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... |
How to configure ResourceBundleViewResolver in Spring Framework 2.0
===
Everywhere I look always the same explanation pop ups.<br/>
Configure the view resolver.
<bean id="viewMappings"
class="org.springframework.web.servlet.view.ResourceBundleViewResolver">
<property name="basename" value="views" />
</bean>
And then put a file in the classpath named view.properties with some key-value pairs (don't mind the names).<br/>
logout.class=org.springframework.web.servlet.view.JstlView
logout.url=WEB-INF/jsp/logout.jsp
What does `logout.class` and `logout.url` mean?<br/>
How does `ResourceBundleViewResolver` uses the key-value pairs in the file?<br/>
My goal is that when someone enters the URI `myserver/myapp/logout.htm` the file `logout.jsp` gets served. | 0 | [
2,
184,
20,
1065,
15951,
6577,
9930,
413,
4725,
99,
5594,
2304,
19,
1573,
6596,
172,
9,
387,
800,
3726,
3726,
6417,
31,
361,
550,
14,
205,
5764,
1675,
71,
18,
9,
1,
5145,
118,
1,
1065,
15951,
14,
1418,
9854,
139,
9,
13,
1,
863... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a good alternative to security questions?
===
> From [Wired][1] magazine:
>
> ...the Palin hack didn't require any
> real skill. Instead, the hacker simply
> reset Palin's password using her
> birthdate, ZIP code and information
> about where she met her spouse -- the
> security question on her Yahoo
> account, which was answered (Wasilla
> High) by a simple Google search.
We cannot trust such security questions to reset forgotten passwords. How do you design a better system?
[1]: http://blog.wired.com/27bstroke6/2008/09/palin-e-mail-ha.html | 0 | [
2,
98,
22,
18,
21,
254,
2676,
20,
1221,
2346,
60,
800,
3726,
3726,
13,
1,
37,
636,
13482,
43,
500,
2558,
165,
500,
1039,
45,
13,
1,
13,
1,
13,
9,
9,
9,
124,
4370,
108,
11835,
223,
22,
38,
4077,
186,
13,
1,
683,
6148,
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... |
Sort on a string that may contain a number
===
I need to write a Java Comparator class that compares Strings, however with one twist. If the two strings it is comparing are the same at the beginning and end of the string are the same, and the middle part that differs is an integer, then compare based on the numeric values of those integers. For example, I want the following strings to end up in order they're shown:
- aaa
- bbb 3 ccc
- bbb 12 ccc
- ccc 11
- ddd
- eee 3 ddd jpeg2000 eee
- eee 12 ddd jpeg2000 eee
As you can see, there might be other integers in the string, so I can't just use regular expressions to break out any integer. I'm thinking of just walking the strings from the beginning until I find a bit that doesn't match, then walking in from the end until I find a bit that doesn't match, and then comparing the bit in the middle to the regular expression "[0-9]+", and if it compares, then doing a numeric comparison, otherwise doing a lexical comparison.
Is there a better way? | 0 | [
2,
2058,
27,
21,
3724,
30,
123,
3717,
21,
234,
800,
3726,
3726,
31,
376,
20,
2757,
21,
8247,
6479,
512,
3457,
718,
30,
11590,
18,
7887,
15,
207,
29,
53,
7844,
9,
100,
14,
81,
7887,
32,
25,
15047,
50,
14,
205,
35,
14,
997,
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... |
Accessing a Collection Through Reflection
===
Is there a way to iterate (through foreach preferably) over a collection using reflection? I'm iterating over the properties in an object using reflection, and when the program gets to a type that is a collection, I'd like it to iterate over the contents of the collection and be able to access the objects in the collection.
At the moment I have an attribute set on all of my properties, with an IsCollection flag set to true on the properties that are collections. My code checks for this flag and if it's true, it gets the Type using reflection. Is there a way to invoke GetEnumerator or Items somehow on a collection to be able to iterate over the items? | 0 | [
2,
1381,
68,
21,
1206,
120,
9138,
800,
3726,
3726,
25,
80,
21,
161,
20,
32,
106,
1373,
13,
5,
11639,
26,
14322,
6369,
4801,
6,
84,
21,
1206,
568,
9138,
60,
31,
22,
79,
32,
106,
1880,
84,
14,
3704,
19,
40,
3095,
568,
9138,
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... |
Run MySQLDump without Locking Tables
===
I want to copy a live production database into my local development database. Is there a way to do this without locking the production database?
I'm currently using:
mysqldump -u root --password=xxx -h xxx my_db1 | mysql -u root --password=xxx -h localhost my_db1
But it's locking each table as it runs. | 0 | [
2,
485,
51,
18,
22402,
43,
11134,
366,
17538,
7484,
800,
3726,
3726,
31,
259,
20,
4344,
21,
515,
637,
6018,
77,
51,
375,
522,
6018,
9,
25,
80,
21,
161,
20,
107,
48,
366,
17538,
14,
637,
6018,
60,
31,
22,
79,
871,
568,
45,
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... |
What is a good tutorial/howto on .net / c# socket programming.
===
I'm porting old VB6 code that uses the Winsock control to C#. I haven't done any socket programming and I wonder if anyone has a good reference/tutorial/howto that I can use to start getting up to speed.
I'm appealing to the hive mind while I proceed with my generally unproductive googling. | 0 | [
2,
98,
25,
21,
254,
29724,
118,
1544,
262,
27,
13,
9,
2328,
13,
118,
272,
5910,
18482,
3143,
9,
800,
3726,
3726,
31,
22,
79,
1295,
68,
315,
13,
20468,
379,
1797,
30,
2027,
14,
4041,
5668,
569,
20,
272,
5910,
9,
31,
2933,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What does -> mean?
===
I've been trying to get into F# on and off for awhile but I keep getting put off. Why?
Because no matter which 'beginners' resource I try to look at I see very simple examples that start using the operator ->
However nowhere have I found as yet that provides a clear simple explanation of what this operator means. Its as though it must be so obvious that it doesn't need explanation even to complete newbie.
I must therefore be really dense or perhaps its nearly 30 decades of previous experience holding me back.
Can someone please, explain it or point to a truely accessable resource that explains it?
| 0 | [
2,
98,
630,
13,
8,
1,
884,
60,
800,
3726,
3726,
31,
22,
195,
74,
749,
20,
164,
77,
398,
5910,
27,
17,
168,
26,
21,
10144,
47,
31,
643,
1017,
442,
168,
9,
483,
60,
185,
90,
1161,
56,
13,
22,
17143,
18005,
18,
22,
6577,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Any good SQL Anywhere database schema comparison tools?
===
Are there any good database schema comparison tools out there that support Sybase SQL Anywhere version 10? I've seen a littany of them for SQL Server, a few for MySQL and Oracle, but nothing that supports SQL Anywhere correctly.
I tried using DB Solo, but it turned all my non-unique indexes into unique ones, and I didn't see any options to change that. | 0 | [
2,
186,
254,
4444,
255,
4922,
6018,
23874,
6050,
4672,
60,
800,
3726,
3726,
50,
80,
186,
254,
6018,
23874,
6050,
4672,
70,
80,
30,
555,
10315,
8436,
4444,
255,
4922,
615,
332,
60,
31,
22,
195,
541,
21,
13,
23956,
6001,
16,
105,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do you still use UML? How? What for?
===
Few years back everybody in our shop was *crazy with UML*. Now everybody seems to have cooled off.
I am curious if there is still widespread use of UML in software projects. If so, is this usage limited to whiteboarding? Do you use it for documentation? Do you use tools to generate code from it? | 0 | [
2,
107,
42,
174,
275,
13,
723,
255,
60,
184,
60,
98,
26,
60,
800,
3726,
3726,
310,
122,
97,
8903,
19,
318,
2546,
23,
1637,
23282,
29,
13,
723,
255,
2483,
9,
130,
8903,
2206,
20,
57,
13,
14437,
168,
9,
31,
589,
7686,
100,
80,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I disable the eclipse server startup timeout?
===
By default when using a webapp server in Eclipse Web Tools, the server startup will fail after a timeout of 45 seconds. I can increase this timeout in the server instance properties, but I don't see a way to disable the timeout entirely (useful when debugging application startup). Is there a way to do this? | 0 | [
2,
184,
92,
31,
1460,
579,
14,
11652,
8128,
20205,
85,
1320,
60,
800,
3726,
3726,
34,
12838,
76,
568,
21,
2741,
7753,
8128,
19,
11652,
2741,
4672,
15,
14,
8128,
20205,
129,
7476,
75,
21,
85,
1320,
16,
2487,
2582,
9,
31,
92,
1839... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 was the first version of MS Office to officially support Unicode?
===
I am doing some research on Unicode for a white-paper I am writing. Does anyone remember the first version of MS Office on the Windows platform that was fully Unicode compliant? Not having much luck Googling this answer out of the net. | 0 | [
2,
98,
23,
14,
64,
615,
16,
4235,
488,
20,
2320,
555,
28010,
60,
800,
3726,
3726,
31,
589,
845,
109,
527,
27,
28010,
26,
21,
359,
8,
17945,
31,
589,
1174,
9,
630,
1276,
1518,
14,
64,
615,
16,
4235,
488,
27,
14,
1936,
2452,
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... |
Specific Client Detection based on headers. Firefox extension?
===
I have a website in which I want to be able to detect a certain user based upon a permanent attribute of a specific user.
My original plan was to use an ip address but those are difficult to maintain since they can change frequently.
Cookie's and Sessions are almost out of question because they expire and tend to be difficult to manipulate.
Basically what i want to be able to do is detect if the current client visiting the website is a special user without having to deal with logins / passwords. To use something more permanent.
The user agent plugin could work but then, if i ever upgrade firefox or whatever i would have to go in and manually update the user agent string.
I found this script: https://addons.mozilla.org/en-US/firefox/addon/6895 but it doesn't work for newest version of firefox 3. It would be a perfect solution because it sends special headers at specific websites.
Short of writing my own extension does anyone have ideas of what to do? Do i need an extension? Should i try to write my own? | 0 | [
2,
1903,
6819,
11643,
432,
27,
157,
445,
9,
535,
18219,
3896,
60,
800,
3726,
3726,
31,
57,
21,
2271,
19,
56,
31,
259,
20,
44,
777,
20,
9092,
21,
1200,
4155,
432,
685,
21,
3032,
35,
14755,
16,
21,
1903,
4155,
9,
51,
501,
944,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 should events in C# take (sender, EventArgs)?
===
[It's known][1] that you should declare events that take as parameters (object sender, EventArgs args). Why?
[1]: http://www.csharphelp.com/archives/archive51.html | 0 | [
2,
483,
378,
963,
19,
272,
5910,
247,
13,
5,
18,
13630,
15,
807,
10663,
18,
6,
60,
800,
3726,
3726,
636,
242,
22,
18,
167,
500,
2558,
165,
500,
30,
42,
378,
10123,
963,
30,
247,
28,
12905,
13,
5,
23793,
2660,
106,
15,
807,
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... |
What are some good security questions?
===
We all know that [security questions suck][1], but still they're often used as the authentication of last resort to reset forgotten passwords. What are some good ones you've used or seen?
Use community owned answers for voting.
[1]: http://stackoverflow.com/questions/104592/whats-a-good-alternative-to-security-questions | 0 | [
2,
98,
50,
109,
254,
1221,
2346,
60,
800,
3726,
3726,
95,
65,
143,
30,
636,
17749,
2346,
8466,
500,
2558,
165,
500,
15,
47,
174,
59,
22,
99,
478,
147,
28,
14,
27963,
16,
236,
4765,
20,
23422,
5562,
20884,
18,
9,
98,
50,
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... |
The future of Functional programming
===
Joel Spolsky [praise][1] compiled version of program. How are with the functional programming? What are compilers for functional languages?
[1]: http://www.joelonsoftware.com/articles/PleaseLinker.html | 0 | [
2,
14,
1022,
16,
7652,
3143,
800,
3726,
3726,
8873,
13,
18,
7332,
2397,
636,
7310,
2628,
500,
2558,
165,
500,
9316,
615,
16,
625,
9,
184,
50,
29,
14,
7652,
3143,
60,
98,
50,
21486,
18,
26,
7652,
2556,
60,
636,
165,
500,
45,
77... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Web application to user instant messaging
===
What options are available for receiving instant alerts from web applications?
I have a time sensitive web application I need to tend to (approving expediated purchase order requests). I have thought of being notified by e-mail and SMS.
Are there any programs to let my website send a popup window directly to my screen? Or any other instant notification options? | 0 | [
2,
2741,
3010,
20,
4155,
6322,
26437,
800,
3726,
3726,
98,
6368,
50,
904,
26,
3396,
6322,
7863,
18,
37,
2741,
3767,
60,
31,
57,
21,
85,
7830,
2741,
3010,
31,
376,
20,
5480,
20,
13,
5,
7753,
6937,
68,
1396,
26132,
1427,
3301,
389... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 determine order for new item?
===
I have a members table in MySQL
CREATE TABLE `members` (
`id` int(10) unsigned NOT NULL auto_increment,
`name` varchar(65) collate utf8_unicode_ci NOT NULL,
`order` tinyint(3) unsigned NOT NULL default '0',
PRIMARY KEY (`id`)
) ENGINE=InnoDB;
And I would like to let users order the members how they like.
I'm storing the order in `order` column.
I'm wondering how to insert new user to be added to the bottom of the list.
This is what I have today:
$db->query('insert into members VALUES (0, "new member", 0)');
$lastId = $db->lastInsertId();
$maxOrder = $db->fetchAll('select MAX(`order`) max_order FROM members');
$db->query('update members
SET
`order` = ?
WHERE
id = ?',
array(
$maxOrder[0]['max_order'] + 1,
$lastId
));
But that's not really precise while when there are several users adding new members at the same time, it might happen the `MAX(order)` will return the same values.
How do you handle such cases? | 0 | [
2,
184,
20,
3746,
389,
26,
78,
9101,
60,
800,
3726,
3726,
31,
57,
21,
443,
859,
19,
51,
18,
22402,
1600,
859,
13,
1,
6990,
18,
1,
13,
5,
13,
1,
1340,
1,
19,
38,
5,
1036,
6,
28839,
52,
16203,
3108,
1,
28461,
15,
13,
1,
72... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Lines of Code
===
We want to invite a third party for reviewing our code and they want to know a ball park figure of number of lines of code we have in all our applications !
Depending on the coding style of each of developer and depending on the language choosen there can be significant difference by measuring the LOC.
I am really interested in knowing,how uou counted your number of Lines Of Code(if at all if you ever did) ?
Thanks | 0 | [
2,
1560,
16,
1797,
800,
3726,
3726,
95,
259,
20,
10275,
21,
422,
346,
26,
18046,
318,
1797,
17,
59,
259,
20,
143,
21,
1592,
405,
1465,
16,
234,
16,
1560,
16,
1797,
95,
57,
19,
65,
318,
3767,
13,
187,
4758,
27,
14,
13,
15458,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.