unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
what is the difference between adobe true type font and type one font?
===
what is the difference between adobe true type font and type one font? | 0 | [
2,
98,
25,
14,
2841,
128,
20299,
1151,
1001,
9978,
17,
1001,
53,
9978,
60,
800,
3726,
3726,
98,
25,
14,
2841,
128,
20299,
1151,
1001,
9978,
17,
1001,
53,
9978,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How can I extract a range of lines from a text file on unix?
===
I have a ~23000 line sql dump containing several databases worth of data. I need to extract a certain section of this file (i.e. the data for a single database) and place it in a new file. I know both the start and end line numbers of the data that I want.
Does anyone know a unix command (or series of commands) to extract all lines from a file between say line 16224 and 16482 and then redirect them into a new file? | 0 | [
2,
184,
92,
31,
10962,
21,
978,
16,
1560,
37,
21,
1854,
3893,
27,
22540,
60,
800,
3726,
3726,
31,
57,
21,
13,
1,
2001,
3993,
293,
4444,
255,
11424,
3503,
238,
6018,
18,
2715,
16,
1054,
9,
31,
376,
20,
10962,
21,
1200,
1050,
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... |
strpos function problem in PHP not finding the needle
===
In php I have open a .php file and want to evaluate certain lines. Specifically when the $table_id and $line variables are assigned a value.
Within the text file I have:
...
$table_id = 'crs_class'; // table name
$screen = 'crs_class.detail.screen.inc'; // file identifying screen structure
...
amongst other lines. The if statement below never detects the occurance of $table_id or $screen (even without the $ prepended). I can't understand why it won't work as the strpos statement below looking for 'require' works fine.
So, why isn't this if statement getting a hit?
while ($line=fgets($fh)) {
//echo "Evaluating... $line <br>";
**if ((($pos = stripos($line, '$table_id')) === true) || (($pos = stripos($line, '$screen'))===true))**
{
// TODO: Not evaluating tableid and screen lines correctly fix.
// Set $table_id and $screen variables from task scripts
eval($line);
}
if (($pos=stripos($line, 'require')) === true) {
$controller = $line;
}
} | 0 | [
2,
13,
9729,
12551,
1990,
1448,
19,
13,
26120,
52,
3007,
14,
11931,
800,
3726,
3726,
19,
13,
26120,
31,
57,
368,
21,
13,
9,
26120,
3893,
17,
259,
20,
13,
15599,
1200,
1560,
9,
3524,
76,
14,
5579,
5924,
1,
1340,
17,
5579,
1143,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Interacting with Outlook appointments using rails
===
I have a rails application running on a Linux server. I would like to interact with Outlook/Exchange 2003 appointments from the rails application. For example, certain actions should trigger sending an appointment, and then preferably accepting/canceling the appointment in Outlook should trigger events in the application.
Failing this, is it possible to publish calendars that Outlook 2003 can read without requiring Outlook plugins? I note that Outlook 2003 does not support ical without plugins for example. Similarly, if this is not easily doable in Ruby, but is in another language (such as Perl for example) running on Linux then those suggestions would be welcome.
Any advice on how to achieve this, or where to start looking for answers would be gratefully received. | 0 | [
2,
24747,
29,
19837,
17368,
568,
2240,
18,
800,
3726,
3726,
31,
57,
21,
2240,
18,
3010,
946,
27,
21,
13024,
8128,
9,
31,
83,
101,
20,
10001,
29,
19837,
118,
1706,
16229,
973,
17368,
37,
14,
2240,
18,
3010,
9,
26,
823,
15,
1200,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XML Parser for Javascript
===
I am looking for a good JavaScript library for parsing XML data. It should be much easier to use than the built-in [XML DOM parsers][1] bundled with the browsers.
I got spoiled a bit working with JSON and looking forward to something on similar lines for XML.
[1]: http://www.w3schools.com/Xml/xml_parser.asp | 0 | [
2,
23504,
2017,
4104,
26,
8247,
8741,
800,
3726,
3726,
31,
589,
699,
26,
21,
254,
8247,
8741,
1248,
26,
2017,
18,
68,
23504,
1054,
9,
32,
378,
44,
212,
4950,
20,
275,
119,
14,
392,
8,
108,
636,
396,
8184,
11859,
2017,
18,
445,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 call an Sql Server stored procedure from Powershell?
===
I have a large csv file and I want to execute a stored procedure for each line.
What's the best way to execute a stored procedure from Powershell? | 0 | [
2,
184,
107,
31,
645,
40,
4444,
255,
8128,
8214,
7004,
37,
414,
15984,
60,
800,
3726,
3726,
31,
57,
21,
370,
272,
18,
710,
3893,
17,
31,
259,
20,
15644,
21,
8214,
7004,
26,
206,
293,
9,
98,
22,
18,
14,
246,
161,
20,
15644,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Stored procedures a no-go in the php/mysql world?
===
I'm quoting part of an answer which I received for another question of mine:
> In the PHP/MySQL world I would say
> stored procedures are no-go
I would like to know: Is that so? Why? Why not? | 0 | [
2,
8214,
8876,
21,
90,
8,
839,
19,
14,
13,
26120,
118,
915,
18,
22402,
126,
60,
800,
3726,
3726,
31,
22,
79,
28146,
141,
16,
40,
1623,
56,
31,
420,
26,
226,
1301,
16,
1114,
45,
13,
1,
19,
14,
13,
26120,
118,
915,
18,
22402,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Remove spaces from std::string in C++
===
What is the perferred way to remove spaces from a string in C++? I could loop through all the characters and build a new string, but is there a better way?
| 0 | [
2,
4681,
7644,
37,
354,
43,
45,
45,
11130,
19,
272,
20512,
800,
3726,
3726,
98,
25,
14,
416,
2407,
2095,
161,
20,
4681,
7644,
37,
21,
3724,
19,
272,
20512,
60,
31,
110,
5293,
120,
65,
14,
1766,
17,
1895,
21,
78,
3724,
15,
47,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Starting javascript development - what to do?
===
What it a good starting point for learning javascript? I'm a well versed C and Java programmer and I have some decent experience in C++, so I'm looking for few suggestions:
- What is some good reference material?
- Is there a particular IDE/editor that is worth looking at? I use vim for C/C++ development and I used IntelliJ Idea for Java. I'm limited to either Linux or Mac based tools.
- How do you debug javascript code? Is it just a series of <code>alert()</code>'s?
- Am I required to run a webserver to test javascript, or can I load the .js file directly? If so, are there limitations to this approach?
- Any other advice for a javascript beginner?
Thanks | 0 | [
2,
1422,
8247,
8741,
522,
13,
8,
98,
20,
107,
60,
800,
3726,
3726,
98,
32,
21,
254,
1422,
454,
26,
2477,
8247,
8741,
60,
31,
22,
79,
21,
134,
7573,
43,
272,
17,
8247,
17968,
17,
31,
57,
109,
12238,
1496,
19,
272,
20512,
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... |
String list in SqlCommand through Parameters in C#
===
Working with a SqlCommand in C# I've created a query that contains a IN (list...) part in the where clause. Instead of looping through my string list generating the list I need for the query (dangerous if you think in sqlInjection). I thought that I could create a parameter like:
SELECT blahblahblah WHERE blahblahblah IN @LISTOFWORDS
Then in the code I try to add a parameter like this:
DataTable dt = new DataTable();
dt.Columns.Add("word", typeof(string));
foreach (String word in listOfWords)
{
dt.Rows.Add(word);
}
comm.Parameters.Add("LISTOFWORDS", System.Data.SqlDbType.Structured).Value = dt;
But this doesn't work.
Questions:
- Am I trying something impossible?
- Did I took the wrong approach?
- Do I have mistakes in this approach?
Thanks for your time :)
| 0 | [
2,
3724,
968,
19,
4444,
255,
16239,
120,
12905,
19,
272,
5910,
800,
3726,
3726,
638,
29,
21,
4444,
255,
16239,
19,
272,
5910,
31,
22,
195,
679,
21,
25597,
30,
1588,
21,
19,
13,
5,
5739,
9,
9,
9,
6,
141,
19,
14,
113,
9040,
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... |
Deleting Rows from a SQL
===
I erroneously delete all the rows from a MS SQL 2000 table that is used in merge replication (the table is on the publisher). I then compounded the issue by using a DTS operation to retrieve the rows from a backup database and repopulate the table.
This has created the following issue:
The delete operation marked the rows for deletion on the clients but the DTS operation bypasses the replication triggers so the imported rows are not marked for insertion on the subscribers. In effect the subscribers lose the data although it is on the publisher.
So I thought "no worries" I will just delete the rows again and then add them correctly via an insert statement and they will then be marked for insertion on the subscribers.
This is my problem:
I cannot delete the DTSed rows because I get a "Cannot insert duplicate key row in object 'MSmerge_tombstone' with unique index 'uc1MSmerge_tombstone'." error. What I would like to do is somehow delete the rows from the table bypassing the merge replication trigger. Is this possible? I don't want to remove and redo the replication because the subscribers are 50+ windows mobile devices.
| 0 | [
2,
121,
1336,
68,
11295,
37,
21,
4444,
255,
800,
3726,
3726,
31,
24406,
102,
27448,
65,
14,
11295,
37,
21,
4235,
4444,
255,
824,
859,
30,
25,
147,
19,
12666,
23841,
13,
5,
124,
859,
25,
27,
14,
5916,
6,
9,
31,
94,
6089,
69,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Google Authentication API: How to get the user's gmail address
===
I've been studying the Google authentication API (AuthSub)...My question is, how do I get the user's account information (at least his Gmail address) after the authentication has passed?
Because currently, all I get back from the authentication process is a token granting me access to which ever Google service I have specified in the scope, but there's no easy way to even get the user's login id (gmail address) as far as I can tell...
Thanks,
| 0 | [
2,
8144,
27963,
21,
2159,
45,
184,
20,
164,
14,
4155,
22,
18,
489,
8079,
3218,
800,
3726,
3726,
31,
22,
195,
74,
4493,
14,
8144,
27963,
21,
2159,
13,
5,
1346,
96,
7563,
6,
9,
9,
9,
915,
1301,
25,
15,
184,
107,
31,
164,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL Select Upcoming Birthdays
===
I'm trying to write a stored procedure to select employees who have birthdays that are upcoming.
`SELECT * FROM Employees WHERE Birthday > @Today AND Birthday < @Today + @NumDays`
This will not work because the birth year is part of Birthday, so if my birthday was '09-18-1983' that will not fall between '09-18-2008' and '09-25-2008'.
Is there a way to ignore the year portion of date fields and just compare month/days? | 0 | [
2,
4444,
255,
5407,
9078,
4455,
18,
800,
3726,
3726,
31,
22,
79,
749,
20,
2757,
21,
8214,
7004,
20,
5407,
3716,
72,
57,
4455,
18,
30,
50,
9078,
9,
13,
1,
18,
16964,
1637,
37,
3716,
113,
4455,
13,
1,
13,
1,
15260,
17,
4455,
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... |
Open Source FTP Client that supports synchronizing?
===
Does anyone know of a good open source FTP client that allows for scheduled synchronizing? I'm needing something also very....very... user friendly. | 0 | [
2,
368,
1267,
1187,
306,
6819,
30,
6747,
13,
16023,
3335,
60,
800,
3726,
3726,
630,
1276,
143,
16,
21,
254,
368,
1267,
1187,
306,
6819,
30,
2965,
26,
3758,
13,
16023,
3335,
60,
31,
22,
79,
12210,
301,
67,
253,
9,
9,
9,
9,
7864... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Algorithm to find which numbers from a list of size n sum to another number
===
I have a decimal number (let's call it **goal**) and an array of other decimal numbers (let's call the array **elements**) and I need to find all the combinations of numbers from **elements** which sum to goal.
I have a preference for a solution in C# (.Net 2.0) but may the best algorithm win irrespective.
Your method signature might look something like:
public decimal[][] Solve(decimal goal, decimal[] elements) | 0 | [
2,
9083,
20,
477,
56,
2116,
37,
21,
968,
16,
1072,
13,
103,
3907,
20,
226,
234,
800,
3726,
3726,
31,
57,
21,
26380,
234,
13,
5,
1336,
22,
18,
645,
32,
13,
1409,
839,
192,
1409,
6,
17,
40,
7718,
16,
89,
26380,
2116,
13,
5,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to tie into a domain server's login for program access rights
===
I need to write a program used internally where different users will have different abilities within the program.
Rather than making users have a new username and password, how do I tie into an existing domain server's login system?
Assume .NET (C#, VB, ASP, etc)
-Adam | 0 | [
2,
184,
20,
3795,
77,
21,
4603,
8128,
22,
18,
6738,
108,
26,
625,
1381,
1096,
800,
3726,
3726,
31,
376,
20,
2757,
21,
625,
147,
17739,
113,
421,
3878,
129,
57,
421,
7009,
363,
14,
625,
9,
864,
119,
544,
3878,
57,
21,
78,
4155,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 know whether given client side startup script is already registered or not in asp.net page?
===
I have a asp.net page, and would like to know whether "script1" is already registerd as startup script or not? | 0 | [
2,
184,
20,
143,
1472,
504,
6819,
270,
20205,
3884,
25,
614,
3801,
54,
52,
19,
28,
306,
9,
2328,
2478,
60,
800,
3726,
3726,
31,
57,
21,
28,
306,
9,
2328,
2478,
15,
17,
83,
101,
20,
143,
1472,
13,
7,
8741,
165,
7,
25,
614,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Is there an efficient algorithm to generate a 2D a 'concave' hull?
===
Having a set of (2D) points from a GIS file (a city map), I need to generate the polygon that defines the 'contour' for that map (its boundary). Its input parameters would be the points set and a 'maximum edge length'. It would then output the corresponding (probably non-convex) polygon.
The best solution I found so far was to generate the Delaunay triangles and then remove the external edges that are longer than the maximum edge length. After all the external edges are shorter than that, I simply remove the internal edges and get the polygon I want. The problem is, this is very time-consuming and I'm wondering if there's a better way. | 0 | [
2,
25,
80,
40,
8243,
9083,
20,
7920,
21,
172,
43,
21,
13,
22,
1126,
793,
195,
22,
5542,
60,
800,
3726,
3726,
452,
21,
309,
16,
13,
5,
135,
43,
6,
819,
37,
21,
16004,
3893,
13,
5,
58,
136,
2942,
6,
15,
31,
376,
20,
7920,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WCF DataContracts and underlying data structures
===
I am wondering what makes sense in relation to what objects to expose through a WCF service - should I add WCF Serialization specifications to my business entities or should I implement a converter that maps my business entities to the DataContracts that I want to expose through my WCF service?
Right now I have entities on different levels: DataAccess, Business and Contract. I have converters in place that can map entities from DataAccess to Business and from Business to Contract and vice versa. Implementing and Maintaining those is time consuming and pretty tedious. What are best practices in relation to this?
If I were using an OR/M such as NHibernate or Entity Framework should I be exposing the entities from the ORM directly or should I abstract them the same way I am doing now?
Thanks in advance. | 0 | [
2,
11801,
410,
1054,
23311,
18,
17,
10974,
1054,
3815,
800,
3726,
3726,
31,
589,
5712,
98,
1364,
1259,
19,
5827,
20,
98,
3916,
20,
13833,
120,
21,
11801,
410,
365,
13,
8,
378,
31,
3547,
11801,
410,
5956,
1829,
17971,
20,
51,
508,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Shorthand if + nullable types (C#)
===
The following returns
> Type of conditional expression cannot be determined because there is no implicit conversion between 'double' and '<null>'
aNullableDouble = (double.TryParse(aString, out aDouble)?aDouble:null)
----------
The reason why I can't just use aNullableBool instead of the roundtrip with aDouble is because aNullableDouble is a property of a generated EntityFramework class which cannot be used as an out par. | 0 | [
2,
502,
3203,
100,
2754,
16203,
579,
2551,
13,
5,
150,
5910,
6,
800,
3726,
3726,
14,
249,
4815,
13,
1,
1001,
16,
21206,
1803,
1967,
44,
2734,
185,
80,
25,
90,
20290,
6263,
128,
13,
22,
14368,
22,
17,
13,
22,
1569,
255,
38,
73,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Volumetric particles
===
I'm toying with the idea of volumetric particles. By 'volumetric' I don't mean actually 3D model per particle - usually it's more expensive and harder to blend with other particles. What I mean is 2D particles that will look as close as possible to be volumetric.
Right now what I/we have tried is particles with additional local Z texture (spherical for example), and we conduct the alpha transparency according to the combination of the alpha value and the closeness by Z which is improved by the fact that particle does not have a single planar Z.
I think a cool add would be interaction with lighting (and shadows as well), but here the question is how will the lighting formula look like (taking transparency into account, let's assume that we are talking about smoke and dust/clouds and not additive blend) - any suggestions would be welcomed.
I also though about adding normal so I can actually squeeze all in two textures:
- Diffuse & Alpha texture.
- Normal & 256 level precision Z channel texture.
I ask this question to see what other directions can be thought of and to get your ideas regarding the proper lighting equation that might be used.
| 0 | [
2,
2310,
8731,
9497,
800,
3726,
3726,
31,
22,
79,
20,
8173,
29,
14,
882,
16,
2310,
8731,
9497,
9,
34,
13,
22,
15949,
8731,
22,
31,
221,
22,
38,
884,
1121,
203,
43,
1061,
416,
11534,
13,
8,
951,
32,
22,
18,
91,
5381,
17,
5229... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Mixing ActiveRecord find Conditions
===
I want to find records on a combination of created_on >= some date AND name IN some list of names.
For ">=" I'd have to use sql condition. For "IN" I'd have to use a hash of conditions where the key is :name and the value is the array of names.
Is there a way to combine the two? | 0 | [
2,
5826,
1348,
14953,
477,
2039,
800,
3726,
3726,
31,
259,
20,
477,
742,
27,
21,
3733,
16,
679,
1,
218,
13,
1,
3726,
109,
1231,
17,
204,
19,
109,
968,
16,
1817,
9,
26,
13,
7,
1,
3726,
7,
31,
22,
43,
57,
20,
275,
4444,
255,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 display a substitute password character in a UILabel?
===
I have a need to display a UITableView containing a user's account credentials. For this, I'm using UILabels in UITableViewCells. When I display their password, I'd obviously like to just display a placeholder password character instead of their actual password, similar to a UITextField when it's set to secure text entry mode. In fact, I'd like to use the same character as UITextField uses, instead of '*'.
My question is, what is the character code for the password character the UITextField when it's in secure mode? | 0 | [
2,
184,
107,
31,
3042,
21,
6558,
20884,
925,
19,
21,
13,
5661,
21018,
60,
800,
3726,
3726,
31,
57,
21,
376,
20,
3042,
21,
13,
11193,
579,
4725,
3503,
21,
4155,
22,
18,
2176,
5059,
43,
10107,
18,
9,
26,
48,
15,
31,
22,
79,
56... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Strategy for Fixing Layout Bugs in IE6?
===
Generally, what's the best way to tackle a layout bug in IE6? What are the most common bugs or problems that one should look for when trying to figure out why your page suddenly looks like a monkey coded it?
| 0 | [
2,
4427,
26,
20047,
9106,
13925,
19,
13,
660,
379,
60,
800,
3726,
3726,
1469,
15,
98,
22,
18,
14,
246,
161,
20,
9723,
21,
9106,
6256,
19,
13,
660,
379,
60,
98,
50,
14,
127,
757,
13925,
54,
1716,
30,
53,
378,
361,
26,
76,
749... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Who's responsibility is it, anyway? A design question.
===
In the application I am writing I have a Policy class. There are 4 different types of Policy. Each Policy is weighted against the other Policies such that PolicyA > PolicyB > PolicyC > PolicyD.
Who's responsibility is it to implement the logic to determine whether one Policy is greather than another? My initial thought is to overload the > and < operators and implement the logic in the Policy type itself.
Does that violate the SRP? | 0 | [
2,
72,
22,
18,
4024,
25,
32,
15,
2774,
60,
21,
704,
1301,
9,
800,
3726,
3726,
19,
14,
3010,
31,
589,
1174,
31,
57,
21,
1486,
718,
9,
80,
50,
268,
421,
2551,
16,
1486,
9,
206,
1486,
25,
23350,
149,
14,
89,
4845,
145,
30,
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... |
Allow user@example or user@localhost in email validation?
===
I'm working on an email validation check and we need to decided whether to allow user@localhost and user@example (notice no .anything) to be validated as a valid email address. This is for an open source project that has a number of use cases on both the web at large and intranets.
[RFC 2822][1] (Internet Message Format Standard) allows it but [RFC 2821][2] (SMTP Standard) says it should fail.
Thoughts?
[1]: http://www.ietf.org/rfc/rfc2822.txt
[2]: http://www.ietf.org/rfc/rfc2821.txt | 0 | [
2,
1655,
4155,
1,
29041,
54,
4155,
1,
15580,
11694,
19,
8517,
27999,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
40,
8517,
27999,
2631,
17,
95,
376,
20,
868,
1472,
20,
1655,
4155,
1,
15580,
11694,
17,
4155,
1,
29041,
13,
5,
1270,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 interrupt would you hook from DOS to get the real-time clock
===
what interrupt would you hook from DOS to get the real-time clock | 0 | [
2,
98,
15811,
83,
42,
5559,
37,
107,
18,
20,
164,
14,
683,
8,
891,
4229,
800,
3726,
3726,
98,
15811,
83,
42,
5559,
37,
107,
18,
20,
164,
14,
683,
8,
891,
4229,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Best way to aggregate multiple log files from several servers
===
I need a simple way to monitor multiple text log files distributed over a number of HP-UX servers. They are a mix of text and XML log files from several distributed legacy systems. Currently we just ssh to the servers and use *tail -f* and *grep*, but that doesn't scale when you have many logs to keep track of.
Since the logs are in different formats and just files in folders (automatically rotated when they reach a certain size) I need to both collect them remotely and parse each one differently.
My initial thought was to make a simple daemon process that I can run on each server using a custom file reader for each file type to parse it into a common format that can be exported over the network via a socket. Another viewer program running locally will connect to these sockets and show the parsed logs in some simple tabbed GUI or aggregated to a console.
What log format should I try to convert to if I am to implement it this way?
Is there some other easier way? Should I attempt to translate the log files to the log4j format to use with [Chainsaw][1] or are there better log viewers that can connect to remote sockets? Could I use [BareTail][2] as suggested in [another log question][3]? This is not a [massivly distributed system][4] and changing the current logging implementations for all applications to use UDP broadcast or put messages on a JMS queue is not an option.
[1]: http://logging.apache.org/chainsaw/
[2]: http://www.baremetalsoft.com/baretail/
[3]: http://stackoverflow.com/questions/18632/how-to-monitor-a-text-file-in-realtime#18690
[4]: http://stackoverflow.com/questions/35292/log-files-in-massively-distributed-systems | 0 | [
2,
246,
161,
20,
8544,
1886,
6738,
6488,
37,
238,
17595,
800,
3726,
3726,
31,
376,
21,
1935,
161,
20,
7626,
1886,
1854,
6738,
6488,
4387,
84,
21,
234,
16,
5301,
8,
7147,
17595,
9,
59,
50,
21,
2917,
16,
1854,
17,
23504,
6738,
648... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to access custom fields from the global class in a webhandler?
===
I added some custom fields (public booleans) to the global class in global.asax.cs which are initialized during the Application_Start event. How do I access them in a webhandler (ashx)? | 0 | [
2,
184,
20,
1381,
5816,
2861,
37,
14,
2062,
718,
19,
21,
2741,
3203,
1252,
60,
800,
3726,
3726,
31,
905,
109,
5816,
2861,
13,
5,
12259,
9827,
413,
5950,
6,
20,
14,
2062,
718,
19,
2062,
9,
8588,
396,
9,
6824,
56,
50,
2104,
1333... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Semantic Web Framework
===
What semantic web frameworks are there, and what are the advantages / disadvantages of each? I've made extensive use of [Jena][1], and I have looked at [Sesame][2] briefly. Are there others I should consider as well?
[1]: http://jena.sourceforge.net/
[2]: http://www.openrdf.org/ | 0 | [
2,
17220,
2741,
6596,
800,
3726,
3726,
98,
17220,
2741,
6596,
18,
50,
80,
15,
17,
98,
50,
14,
14683,
13,
118,
13387,
18,
16,
206,
60,
31,
22,
195,
117,
3386,
275,
16,
636,
1969,
325,
500,
2558,
165,
500,
15,
17,
31,
57,
292,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to programmatically enable/disable network interfaces? (Windows XP)
===
I need to enable/disable completely network interfaces from a script in Windows XP. I'm looking for a python solution, but any general way (eg WMI, some command-line à la netsh, some windows call) is welcome and will be adjusted. Thanks. | 0 | [
2,
184,
20,
625,
6732,
1326,
9240,
118,
2906,
579,
982,
6573,
18,
60,
13,
5,
27508,
18,
23045,
6,
800,
3726,
3726,
31,
376,
20,
9240,
118,
2906,
579,
1524,
982,
6573,
18,
37,
21,
3884,
19,
1936,
23045,
9,
31,
22,
79,
699,
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... |
Dynamically add CalendarExtender to Textbox subclass server control?
===
I'm trying to create a server control, which inherits from TextBox, that will automatically have a [CalendarExtender](http://www.asp.net/AJAX/AjaxControlToolkit/Samples/Calendar/Calendar.aspx) attached to it. Is it possible to do this, or does my new control need to inherit from CompositeControl instead? I've tried the former, but I'm not clear during which part of the control lifecycle I should create the new instance of the CalendarExtender, and what controls collection I should add it to. I don't seem to be able to add it to the Page or Form's controls collection, and if I add it to the (TextBox) control's collection, I get none of the pop-up calendar functionality. | 0 | [
2,
7782,
1326,
3547,
7036,
1706,
38,
13630,
20,
1854,
5309,
972,
1898,
8128,
569,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
1600,
21,
8128,
569,
15,
56,
17569,
18,
37,
1854,
5309,
15,
30,
129,
7499,
57,
21,
636,
3430,
16776,
99,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there any Fuzzy Search or String Similarity Functions libraries written for C#?
===
There are similar question, but not regarding C# libraries I can use in my source code.
Thanks.
| 0 | [
2,
25,
80,
186,
20631,
2122,
54,
3724,
17204,
3719,
8649,
642,
26,
272,
5910,
60,
800,
3726,
3726,
80,
50,
835,
1301,
15,
47,
52,
3467,
272,
5910,
8649,
31,
92,
275,
19,
51,
1267,
1797,
9,
3669,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to build ad-hoc queries real quick OR how does Excel PivotTable work?
===
I've used Excel PivotTable to analyze data from my database because it allows me to "slice and dice" very quickly. As we know what is in our database tables, we all can write SQL queries that do what PivotTable does.
But I am wondering why PivotTable can construct the queries so fast while it knows *nothing* about the data and the meanings/relationship between the data fields we give it?
Put the question in another way, how can we build *ad-hoc* SQL queries in such a fast and efficient way? ("Use PivotTable, of course!", yep, but what I want is a programmatic way). | 0 | [
2,
184,
20,
1895,
21,
43,
8,
1807,
150,
9386,
2829,
683,
2231,
54,
184,
630,
20700,
20670,
5924,
170,
60,
800,
3726,
3726,
31,
22,
195,
147,
20700,
20670,
5924,
20,
16051,
1054,
37,
51,
6018,
185,
32,
2965,
55,
20,
13,
7,
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... |
Rails books?
===
Hey ya guys ...do you know good books for ruby on rails .I know 'Grails'.Keeping that in mind please suggest some good books for Rails ! | 4 | [
2,
2240,
18,
964,
60,
800,
3726,
3726,
8409,
2167,
2776,
13,
9,
9,
9,
537,
42,
143,
254,
964,
26,
10811,
27,
2240,
18,
13,
9,
49,
143,
13,
22,
263,
7301,
18,
22,
9,
15880,
30,
19,
594,
2247,
5601,
109,
254,
964,
26,
2240,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I find the definition of a system-named constraint in Oracle?
===
All I know about the constraint is it's name (`SYS_C003415`), but I want to see it's definition. | 0 | [
2,
184,
107,
31,
477,
14,
5465,
16,
21,
329,
8,
11482,
28804,
19,
15759,
60,
800,
3726,
3726,
65,
31,
143,
88,
14,
28804,
25,
32,
22,
18,
204,
13,
5,
1,
4980,
18,
1,
150,
2032,
3965,
1193,
1,
6,
15,
47,
31,
259,
20,
196,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Home key go to start of line in Visual Studio?
===
Where is the option in Visual Studio to make the Home key go to the start of the line?
Right now you have to do
Home, Home
or
Home, Ctrl+Left Arrow
i'd prefer that home goes to the start of the line. i saw it before, but now i cannot find it. | 0 | [
2,
213,
1246,
162,
20,
799,
16,
293,
19,
3458,
1120,
60,
800,
3726,
3726,
113,
25,
14,
4255,
19,
3458,
1120,
20,
233,
14,
213,
1246,
162,
20,
14,
799,
16,
14,
293,
60,
193,
130,
42,
57,
20,
107,
213,
15,
213,
54,
213,
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... |
Is there a Functional Programming library for C# .NET?
===
For example, in Java there is [Functional Java](http://functionaljava.org/) and [Higher-Order Java](http://www.cs.chalmers.se/~bringert/hoj/). Both essentially give a small API for manipulating higher-order, curried functions, and perhaps a few new data types (tuples, immutable lists). | 0 | [
2,
25,
80,
21,
7652,
3143,
1248,
26,
272,
5910,
13,
9,
2328,
60,
800,
3726,
3726,
26,
823,
15,
19,
8247,
80,
25,
636,
27983,
8247,
500,
5,
21127,
6903,
27983,
1004,
1385,
9,
5583,
118,
6,
17,
636,
4542,
106,
8,
7861,
8247,
500... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
how to replace multiple strings together in Oracle
===
I have a string coming from a table like "can no pay{1},as your payment{2}due on {3}". I want to replace {1} with some value , {2} with some value and {3} with some value .
Is it Possible to replace all 3 in one replace function ? or is there any way I can directly write query and get replaced value ? | 0 | [
2,
184,
20,
3934,
1886,
7887,
429,
19,
15759,
800,
3726,
3726,
31,
57,
21,
3724,
880,
37,
21,
859,
101,
13,
7,
1245,
90,
1372,
1,
165,
1,
15,
472,
154,
7582,
1,
135,
1,
12633,
27,
13,
1,
240,
1,
7,
9,
31,
259,
20,
3934,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I create and develop new database projects in Visual Studio?
===
I want to find a way to develop database projects quickly in Visual Studio. Any ideas? | 0 | [
2,
184,
92,
31,
1600,
17,
2803,
78,
6018,
2314,
19,
3458,
1120,
60,
800,
3726,
3726,
31,
259,
20,
477,
21,
161,
20,
2803,
6018,
2314,
976,
19,
3458,
1120,
9,
186,
3478,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is there any way to detect the target class in PHP 5 static methods?
===
Below is an example class hierarchy and code. What I'm looking for is a way to determine if 'ChildClass1' or 'ChildClass2' had the static method whoAmI() called on it without re-implementing it in each child class.
<?php
abstract class ParentClass {
public static function whoAmI () {
// NOT correct, always gives 'ParentClass'
$class = __CLASS__;
// NOT correct, always gives 'ParentClass'.
// Also very round-about and likely slow.
$trace = debug_backtrace();
$class = $trace[0]['class'];
return $class;
}
}
class ChildClass1 extends ParentClass {
}
class ChildClass2 extends ParentClass {
}
// Shows 'ParentClass'
// Want to show 'ChildClass1'
print ChildClass1::whoAmI();
print "\n";
// Shows 'ParentClass'
// Want to show 'ChildClass2'
print ChildClass2::whoAmI();
print "\n"; | 0 | [
2,
25,
80,
186,
161,
20,
9092,
14,
2935,
718,
19,
13,
26120,
331,
12038,
3195,
60,
800,
3726,
3726,
1021,
25,
40,
823,
718,
14417,
17,
1797,
9,
98,
31,
22,
79,
699,
26,
25,
21,
161,
20,
3746,
100,
13,
22,
11287,
1898,
165,
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... |
What is a good tool to debug email lists on an Exchange server
===
We have a Exchange 2003 server that does not send mail to all the users in an alias.
Is there any way to get a detailed look at the headers? | 0 | [
2,
98,
25,
21,
254,
5607,
20,
121,
16254,
8517,
7227,
27,
40,
1950,
8128,
800,
3726,
3726,
95,
57,
21,
1950,
973,
8128,
30,
630,
52,
2660,
4216,
20,
65,
14,
3878,
19,
40,
15794,
9,
25,
80,
186,
161,
20,
164,
21,
6036,
361,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to update a field with random data?
===
I've got a new varchar(10) field in a database with 1000+ records. I'd like to update the table so I can have random data in the field. I'm looking for a SQL solution.
I know I can use a cursor, but that seems inelegant.
MS-SQL 2000,BTW | 0 | [
2,
184,
20,
11100,
21,
575,
29,
5477,
1054,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
78,
4033,
5433,
5,
1036,
6,
575,
19,
21,
6018,
29,
6150,
2430,
742,
9,
31,
22,
43,
101,
20,
11100,
14,
859,
86,
31,
92,
57,
5477,
1054,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Listview Multiple Selection
===
Is there any way to force a listview control to treat all clicks as though they were done through the Control key?
I need to replicate the functionality of using the control key (selecting an item sets and unsets its selection status) in order to allow the user to easily select multiple items at the same time.
Thank you in advance. | 0 | [
2,
968,
4725,
1886,
3155,
800,
3726,
3726,
25,
80,
186,
161,
20,
558,
21,
968,
4725,
569,
20,
5752,
65,
10840,
18,
28,
362,
59,
46,
677,
120,
14,
569,
1246,
60,
31,
376,
20,
22156,
14,
18548,
16,
568,
14,
569,
1246,
13,
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... |
is it a gcc optimization bug or a C code problem?
===
Test the following code:
#include <stdio.h>
#include <stdlib.h>
main()
{
const char *yytext="0";
const float f=(float)atof(yytext);
size_t t = *((size_t*)&f);
printf("t should be 0 but is %d\n", t);
}
Compile it with:
gcc -O3 test.c
The GOOD output should be :
"t should be 0 but is 0"
But with my gcc 4.1.3, I have:
"t should be 0 but is -1209357172"
Is it a gcc bug or a bad C code?
| 0 | [
2,
25,
32,
21,
489,
3384,
21597,
6256,
54,
21,
272,
1797,
1448,
60,
800,
3726,
3726,
1289,
14,
249,
1797,
45,
6926,
22640,
13,
1,
384,
6921,
9,
252,
1,
6926,
22640,
13,
1,
384,
43,
8326,
9,
252,
1,
407,
5,
6,
13,
1,
11608,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Log4net with SyslogAppender, 1kb message limit
===
Has anyone found a way to get around this? Or a better technique to conglomerate logging from multiple web servers reliably?
Any ideas on good log4net log file analysis tools too (plain text not XML) - apart from good 'ol grep of course :) | 0 | [
2,
6738,
300,
2328,
29,
10315,
18,
5567,
22358,
1157,
15,
137,
18167,
2802,
4496,
800,
3726,
3726,
63,
1276,
216,
21,
161,
20,
164,
140,
48,
60,
54,
21,
574,
4873,
20,
22162,
13,
13919,
37,
1886,
2741,
17595,
13,
19003,
4801,
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... |
How can I provide dynamic CSS styles or custom theme for web site?
===
There are plenty of ways to provide a dynamic style/theme for a web site, but I am looking for some help on some best practices or techniques that have worked well for others.
I am creating a web site that needs to provide the ability for customers to create or specify their own colors, style, theme, or layout. I'm not convinced how much flexibility I need yet, but basically I need to provide Branding capabilities.
I will be using ASP.NET, and am open to any ideas that will fit within the ASP.NET framework. | 0 | [
2,
184,
92,
31,
1181,
7782,
272,
18,
18,
6443,
54,
5816,
3184,
26,
2741,
689,
60,
800,
3726,
3726,
80,
50,
7062,
16,
2847,
20,
1181,
21,
7782,
1034,
118,
124,
790,
26,
21,
2741,
689,
15,
47,
31,
589,
699,
26,
109,
448,
27,
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... |
Why isn't the 'Len' function inherited by dictionaries and lists in Python
===
example:
a_list = [1, 2, 3]
a_list.len() # doesn't work
len(a_list) # works
Python being (very) object oriented, I don't understand why the 'len' function isn't inherited by the object.
Plus I keep trying the wrong solution since it appears as the logical one to me | 0 | [
2,
483,
2532,
22,
38,
14,
13,
22,
2284,
22,
1990,
7179,
34,
29783,
17,
7227,
19,
20059,
800,
3726,
3726,
823,
45,
21,
1,
5739,
800,
636,
165,
15,
172,
15,
203,
500,
21,
1,
5739,
9,
2284,
5,
6,
6926,
1437,
22,
38,
170,
10655,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 the filename or the whole URL used as a key in browser caches?
===
It's common to want browsers to cache resources - JavaScript, CSS, images, etc. until there is a new version available, and then ensure that the browser fetches and caches the new version instead.
One solution is to embed a version number in the resource's filename, but will placing the resources to be managed in this way in a directory with a revision number in it do the same thing? Is the whole URL to the file used as a key in the browser's cache, or is it just the filename itself and some meta-data?
If my code changes from fetching '/r20/example.js' to '/r21/example.js', can I be sure that revision 20 of example.js was cached, but now revision 21 has been fetched instead and it is now cached? | 0 | [
2,
25,
32,
14,
3893,
7259,
54,
14,
979,
287,
6362,
147,
28,
21,
1246,
19,
16495,
16522,
18,
60,
800,
3726,
3726,
32,
22,
18,
757,
20,
259,
16495,
18,
20,
16522,
2566,
13,
8,
8247,
8741,
15,
272,
18,
18,
15,
3502,
15,
2722,
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... |
How do I change the IP address on Oracle 10g
===
What steps do I need to take to change an IP address for Oracle 10g? | 0 | [
2,
184,
107,
31,
753,
14,
15735,
3218,
27,
15759,
332,
263,
800,
3726,
3726,
98,
2382,
107,
31,
376,
20,
247,
20,
753,
40,
15735,
3218,
26,
15759,
332,
263,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
ReSharper sluggishness
===
I like ReSharper, but it is a total memory hog. It can quickly swell up and consume a half-gig of RAM without too much effort and bog down the IDE. Does anybody know of any way to configure it to be not as slow? | 0 | [
2,
302,
23646,
106,
15850,
263,
1595,
720,
800,
3726,
3726,
31,
101,
302,
23646,
106,
15,
47,
32,
25,
21,
600,
1912,
13716,
9,
32,
92,
976,
18621,
71,
17,
16447,
21,
519,
8,
2234,
263,
16,
2843,
366,
266,
212,
2150,
17,
6509,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 it the quickest way to find the shortest distance between two polygons
===
I have **1 red polygon** say and **50 randomly placed blue polygons** - they are situated in geographical space. What is the quickest/speediest algorithim to find the the shortest distance between 2 polygons? This is harder than it sounds! | 0 | [
2,
98,
32,
14,
2231,
1430,
161,
20,
477,
14,
23576,
1583,
128,
81,
21309,
18,
800,
3726,
3726,
31,
57,
13,
1409,
165,
402,
21309,
1409,
395,
17,
13,
1409,
2290,
21324,
1037,
705,
21309,
18,
1409,
13,
8,
59,
50,
2692,
19,
10490,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Derby DB Editor?
===
I would like to modify some Derby DB's structure, do you know any good editor for doing this?
thanks! | 0 | [
2,
186,
254,
6473,
13,
9007,
1835,
60,
800,
3726,
3726,
31,
83,
101,
20,
17579,
109,
6473,
13,
9007,
22,
18,
1411,
15,
107,
42,
143,
186,
254,
1835,
26,
845,
48,
60,
3669,
187,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What is a good GUI / Widget toolkit for windows?
===
So I'm pretty much fed up with WTL and Windows Forms, and not entirely convinced of the direction WPF is heading, I use it but I think it still has some quirks, and there's the fact that you need to ship the .NET framework with it. I know there is QT and GTK.
Are there any other modern solutions? Adobe AiR/Flex comes to mind, but that again needs an entire runtime just for it to work.
Recommendations for toolkits that work with .NET / c# are fine, but I'm also looking for other cross-platform (support for windows a must), open source solutions that use open gl and allow for quick gui prototypes that work in other languages (not necessarily c/c++ however) | 0 | [
2,
98,
25,
21,
254,
9457,
13,
118,
4807,
43,
3060,
5607,
13703,
26,
1936,
60,
800,
3726,
3726,
86,
31,
22,
79,
1772,
212,
6068,
71,
29,
619,
7786,
17,
1936,
1997,
15,
17,
52,
2894,
5329,
16,
14,
1400,
619,
7721,
25,
4582,
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... |
Is .NET a write once, run anywhere (WORA) platform like Java claims to be?
===
I remember Sun's slogan so vividly... ["Write Once, Run Anywhere"](http://en.wikipedia.org/wiki/Write_once,_run_anywhere). The idea being that since programs are compiled into standard byte codes, any device with a Java Virtual Machine could run it. Over the years, Java seems to have made it onto many platforms/devices.
Is this the intention or was it ever the intention of .NET. If so, what kind of efforts are being put forth to make this a reality? | 0 | [
2,
25,
13,
9,
2328,
21,
2757,
382,
15,
485,
4922,
13,
5,
10041,
58,
6,
2452,
101,
8247,
2810,
20,
44,
60,
800,
3726,
3726,
31,
1518,
939,
22,
18,
14355,
86,
14339,
102,
9,
9,
9,
636,
7,
23716,
382,
15,
485,
4922,
7,
500,
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... |
SQLBindParameter to prepare for SQLPutData using C++ and SQL Native Client
===
I'm trying to use SQLBindParameter to prepare my driver for input via SQLPutData. My query is crafted based on MS's example [here][1].
I've setup the environment, made the connection, and prepared my statement successfully but when I call SQLBindParam (using code below) it consistently fails reporting: [Microsoft][SQL Native Client]Invalid precision value
int col_num = 1;
SQLINTEGER length;
retcode = SQLBindParameter( StatementHandle,
col_num,
SQL_PARAM_INPUT,
SQL_C_BINARY,
SQL_LONGVARBINARY,
NULL,
NULL,
(SQLPOINTER) col_num,
NULL,
&length );
Am I staring at the documentation too hard and not seeing where I'm going wrong? How do I call bind so I can call SQLPutData later and send my large data strings in chunks?
[1]: http://msdn.microsoft.com/en-us/library/ms713824(VS.85).aspx | 0 | [
2,
4444,
255,
4772,
43,
6351,
7307,
20,
5723,
26,
4444,
255,
4881,
18768,
568,
272,
20512,
17,
4444,
255,
1275,
6819,
800,
3726,
3726,
31,
22,
79,
749,
20,
275,
4444,
255,
4772,
43,
6351,
7307,
20,
5723,
51,
2425,
26,
6367,
1197,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Open source library in c# to communicate with a WebDAV server.
===
Does anybody know of an open source library written in C# that makes it easy to communicate with a WebDAV server?
For a project I need to communicate with a server using the WebDAV protocol. I'm using VS 2008 and the .NET framework 3.5. Using Google I found multiple samples written in C# on how to make a WebDAV request. It is simple enough but all the samples are creating there own WebDAV request from the ground up. I don't want to be bothered with all the syntactical details of building a valid WebDAV request.
On the web site of [webdav.org][1] I found a lot of links to software and libraries for all kinds of languages but nothing for .NET (C#). There is also an Apache project that looks very interesting ([Jakarta Slide][2]) but this project is retired and again... this is all java code.
I know there are commercial libraries available that seem to do just what I need but I prefer an open source alternative if possible. However, if I can't find anything useful I might consider a commercial product so any recommendations are also welcome.
[1]: http://www.webdav.org/projects
[2]: http://jakarta.apache.org/slide/ | 0 | [
2,
368,
1267,
1248,
19,
272,
5910,
20,
8709,
29,
21,
2741,
43,
5214,
8128,
9,
800,
3726,
3726,
630,
11181,
143,
16,
40,
368,
1267,
1248,
642,
19,
272,
5910,
30,
1364,
32,
2010,
20,
8709,
29,
21,
2741,
43,
5214,
8128,
60,
26,
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... |
Setting the default ssh key location
===
ssh will look for its keys by default in the ~/.ssh folder. I want to force it to always look in another location.
The workaround I'm using is to add the keys from the non-standard location to the agent:
ssh-agent
ssh-add /path/to/where/keys/really/are/id_rsa
(Linux, MingW32 shell) | 0 | [
2,
2697,
14,
12838,
13,
18,
1635,
1246,
1474,
800,
3726,
3726,
13,
18,
1635,
129,
361,
26,
82,
5534,
34,
12838,
19,
14,
13,
1,
118,
9,
18,
1635,
19294,
9,
31,
259,
20,
558,
32,
20,
550,
361,
19,
226,
1474,
9,
14,
170,
10037,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 idiomatic code?
===
I'd be interested in some before-and-after c# examples, some non-idiomatic vs idiomatic examples. Non-c# examples would be fine as well if they get the idea across. Thanks. | 0 | [
2,
98,
25,
28380,
12479,
1797,
60,
800,
3726,
3726,
31,
22,
43,
44,
3158,
19,
109,
115,
8,
290,
8,
5162,
272,
5910,
3770,
15,
109,
538,
8,
20347,
6732,
4611,
28380,
12479,
3770,
9,
538,
8,
150,
5910,
3770,
83,
44,
1123,
28,
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,
0,
0,
0,
0,
0,
0,
0,
0... |
Is there any free C++ code coverage tool which is useful?
===
AFAIK, there isn't a free code coverage tool for C++. | 0 | [
2,
25,
80,
186,
551,
272,
20512,
1797,
5245,
5607,
56,
25,
4811,
60,
800,
3726,
3726,
21,
1473,
2883,
15,
80,
2532,
22,
38,
21,
551,
1797,
5245,
5607,
26,
272,
20512,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What 8-bit embedded platform have you used for a design?
===
I'm looking for an off-the-shelf 8-bit processor module or even an entire hardware platform you used in a design. You used this product and essentially put your software on it.
If you could mention the processor type and vendor it would be great. A small summary of the platform characteristics would also be great (e.g. 2 serial port, 1 10-base ethernet)
Think of this as an informal survey, so the actual capabilities of the platform don't really matter. | 4 | [
2,
98,
469,
8,
3326,
12138,
2452,
57,
42,
147,
26,
21,
704,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
40,
168,
8,
124,
8,
1079,
9641,
469,
8,
3326,
14762,
12613,
54,
166,
40,
1078,
7610,
2452,
42,
147,
19,
21,
704,
9,
42,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
OO PHP explanation For a braindead n00b
===
I've been writing PHP for about six years now and have got to a point where I feel I should be doing more to write better code. I know that Object Oriented code is the way to go but I can't get my head around the concept.
Can anyone explain in terms that any idiot can understand, OO and how it works in PHP or point me to an idiots guide tutorial? | 0 | [
2,
13,
4328,
13,
26120,
5764,
26,
21,
1964,
14260,
13,
103,
2032,
220,
800,
3726,
3726,
31,
22,
195,
74,
1174,
13,
26120,
26,
88,
490,
122,
130,
17,
57,
330,
20,
21,
454,
113,
31,
583,
31,
378,
44,
845,
91,
20,
2757,
574,
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... |
Finding errors / warnings in Visual Studio
===
I have experienced an annoying issue with Visual Studio 2005... sometimes when I rebuild, and even if I do a Rebuild Solution, it will come back with no errors or warnings, but then when I later edit another code file, even without changing it, and rebuild, it will find an error or warning in that other file. Clearly, the earlier Rebuild Solution did not recompile that file! How can I force VS to completely recompile every file? | 0 | [
2,
3007,
11908,
13,
118,
3590,
18,
19,
3458,
1120,
800,
3726,
3726,
31,
57,
3882,
40,
17610,
1513,
29,
3458,
1120,
812,
9,
9,
9,
1030,
76,
31,
16128,
15,
17,
166,
100,
31,
107,
21,
16128,
4295,
15,
32,
129,
340,
97,
29,
90,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Uninstall Sharepoint Infrastructure Update
===
I installed WSS Infrastructure Update and MOSS Infrastructure Update (http://technet.microsoft.com/en-us/office/sharepointserver/bb735839.aspx) and now I can't restore the content database on an older version. Do you know if there is a way to uninstall it ? | 2 | [
2,
367,
108,
21300,
1891,
3132,
5282,
11100,
800,
3726,
3726,
31,
4066,
619,
18,
18,
5282,
11100,
17,
8188,
5282,
11100,
13,
5,
21127,
6903,
6524,
2328,
9,
22019,
12980,
9,
960,
118,
219,
8,
267,
118,
17047,
118,
16608,
3132,
10321,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 programming paradigm will be most successful in future multi-core computers?
===
Many of us have two or more CPU cores on our desktop today. Most applications work quite similarly to what they did when we had only one core.
But what when a typical desktop machine has 1000+ cores?
What programming paradigms will we use then. Our current threading and synchronization solutions seldom scale well to that many cores.
Do you think the Thread class be deprecated in the JDK? | 0 | [
2,
98,
3143,
20234,
129,
44,
127,
1300,
19,
1022,
1889,
8,
10375,
7774,
60,
800,
3726,
3726,
151,
16,
182,
57,
81,
54,
91,
17578,
2884,
18,
27,
318,
17404,
786,
9,
127,
3767,
170,
1450,
5843,
20,
98,
59,
144,
76,
95,
41,
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... |
org.eclipse.swt.SWTError: Item not added
===
Dows somebody know how to recover a never-starting eclipse when the error "org.eclipse.swt.SWTError: Item not added" is raising againg and again? | 0 | [
2,
13,
5583,
9,
3319,
6013,
870,
9,
18,
499,
38,
9,
18,
499,
38,
29992,
45,
9101,
52,
905,
800,
3726,
3726,
14103,
18,
8861,
143,
184,
20,
7635,
21,
243,
8,
13680,
68,
11652,
76,
14,
7019,
13,
7,
5583,
9,
3319,
6013,
870,
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... |
Web Scripting for Java
===
What is a good way to render data produced by a Java process in the browser?
I've made extensive use of JSP and the various associated frameworks ([JSTL][1], [Struts][2], [Tapestry][3], etc), as well as more comprehensive frameworks not related to JSP ([GWT][4], [OpenLaszlo][5]). None of the solutions have ever been entirely satisfactory - in most cases the framework is too constrained or too complex for my needs, while others would require extensive refactoring of existing code. Additionally, most frameworks seem to have performance problems.
Currently I'm leaning towards the solution of exposing my java data via a simple servlet that returns JSON, and then rendering the data using PHP or Ruby. This has the added benefit of instantly exposing my service as a web service as well, but I'm wondering if I'm reinventing the wheel here.
[1]: http://java.sun.com/products/jsp/jstl/
[2]: http://struts.apache.org/
[3]: http://tapestry.apache.org/
[4]: http://code.google.com/webtoolkit/
[5]: http://www.openlaszlo.org/ | 0 | [
2,
2741,
3884,
68,
26,
8247,
800,
3726,
3726,
98,
25,
21,
254,
161,
20,
16535,
1054,
671,
34,
21,
8247,
953,
19,
14,
16495,
60,
31,
22,
195,
117,
3386,
275,
16,
487,
3401,
17,
14,
617,
1598,
6596,
18,
13,
5,
2558,
728,
18,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I cycle through pages?
===
Here's a challenge that I was tasked with recently. I still haven't figured out the best way to do it, maybe someone else has an idea.
Using PHP and/or HTML, create a page that cycles through any number of other pages at a given interval.
For instance, we would load this page and it would take us to google for 20 seconds, then on to yahoo for 10 seconds, then on to stackoverflow for 180 seconds and so on an so forth. | 0 | [
2,
184,
92,
31,
4150,
120,
4434,
60,
800,
3726,
3726,
235,
22,
18,
21,
2404,
30,
31,
23,
14605,
29,
1989,
9,
31,
174,
2933,
22,
38,
5700,
70,
14,
246,
161,
20,
107,
32,
15,
913,
737,
962,
63,
40,
882,
9,
568,
13,
26120,
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 I prevent static variable sharing in the .NET runtime?
===
I'm working on a game (C#) that uses a [Robocode-like](http://robocode.sourceforge.net/) programming model: participants inherit a base Class and add strategic behaviors. The game then loads instances of participants' Classes and the competition begins. Unfortunately, participants can "cheat" by sharing static variables between instances of their competitor Class.
How do I prevent static variable sharing between Class instances in a .NET language? I know this is accomplished in Java by using a separate ClassLoader per instance. What's the .NET equivalent?
Thanks in advance... | 0 | [
2,
184,
107,
31,
2501,
12038,
7612,
6126,
19,
14,
13,
9,
2328,
485,
891,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
250,
13,
5,
150,
5910,
6,
30,
2027,
21,
636,
661,
1192,
9375,
8,
1403,
500,
5,
21127,
6903,
661,
1192,
93... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Cross-Database information_schema Joins in SQL Server
===
I am attempting to provide a general solution for the migration of data from one schema version to another. A problem arises when the column data type from the source schema does not match that of the destination. I would like to create a query that will perform a preliminary compare on the columns data types to return which columns need to be fixed before migration is possible.
My current approach is to return the table and column names from `information_schema.columns` where `DATA_TYPE`'s between catalogs do not match. However, querying `information_schema` directly will only return results from the catalog of the connection.
Has anyone written a query like this?
| 0 | [
2,
919,
8,
18768,
8436,
676,
1,
7526,
540,
10612,
19,
4444,
255,
8128,
800,
3726,
3726,
31,
589,
6314,
20,
1181,
21,
297,
4295,
26,
14,
8443,
16,
1054,
37,
53,
23874,
615,
20,
226,
9,
21,
1448,
21461,
76,
14,
4698,
1054,
1001,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Service factory: extremely long path/filenames problems
===
I have been trying out [Service Factory][1] and have run into some problems in regards to long filenames - surpassing the limit in Vista/XP. The problem is that when generating code from the models service factory prefixes everything with the namespace specified. Making the folder structure huge. For example starting in
c:\work\sftest\MyWebService
I create each of the models with moderate length of names in data contracts and service interface. I set the namespace to be MyCompany.SFTest.MyWebservice
After generating code I end up with
<pre>
c:\work\sftest\MyWebService\MyCompany.SFTest.MyWebService
c:\work\sftest\MyWebService\MyCompany.SFTest.MyWebService
c:\work\sftest\MyWebService\MyCompany.SFTest.MyWebService\Source
c:\work\sftest\MyWebService\MyCompany.SFTest.MyWebService\Source\Business Logic
c:\work\sftest\MyWebService\MyCompany.SFTest.MyWebService\Source\Resource Access
c:\work\sftest\MyWebService\MyCompany.SFTest.MyWebService\Source\Service Interface
c:\work\sftest\MyWebService\MyCompany.SFTest.MyWebService\Source\Service Interface\MyCompany.SFTest.MyWebService.DataContracts
c:\work\sftest\MyWebService\MyCompany.SFTest.MyWebService\Source\Service Interface\MyCompany.SFTest.MyWebService.FaultContracts
c:\work\sftest\MyWebService\MyCompany.SFTest.MyWebService\Source\Service Interface\MyCompany.SFTest.MyWebService.MessageContracts
c:\work\sftest\MyWebService\MyCompany.SFTest.MyWebService\Source\Service Interface\MyCompany.SFTest.MyWebService.ServiceContracts
c:\work\sftest\MyWebService\MyCompany.SFTest.MyWebService\Source\Service Interface\MyCompany.SFTest.MyWebService.ServiceImplementation
c:\work\sftest\MyWebService\MyCompany.SFTest.MyWebService\Source\Tests
</pre>
Under each of the folders is a project file with the same prefix
<pre>
c:\work\sftest\MyWebService\MyCompany.SFTest.MyWebService\Source\Service Interface\MyCompany.SFTest.MyWebService.ServiceImplementation\MyCompany.SFTest.MyWebService.ServiceImplementation.proj
</pre>
This blows up the recipe as windows can't accept filenames exceeding a specific length.
Is it necessary to explicitly include the namespace in each of the foldernames?
Obviously at some point I might want to branch a service to another location but for the same reason as above might be unable to.
Is there a workaround for this?
[1]: http://www.codeplex.com/servicefactory | 0 | [
2,
365,
3129,
45,
3898,
175,
2013,
118,
16877,
7259,
18,
1716,
800,
3726,
3726,
31,
57,
74,
749,
70,
636,
11449,
3129,
500,
2558,
165,
500,
17,
57,
485,
77,
109,
1716,
19,
14179,
20,
175,
3893,
7259,
18,
13,
8,
3645,
6201,
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... |
How do I implement the Post Commit Hook with Trac & SVN in a Windows Environment?
===
I'm running in a windows environment with Trac / SVN and I want commits to the repository to integrate to Trac and close the bugs that were noted in the SVN Comment.
I know there's some post commit hooks to do that, but there's not much information about how to do it on windows.
Anyone done it successfully? And what were the steps you followed to achive it?
Here's the hook I need to put in place in SVN, but I'm not exactly sure how to do this in the Windows environment.
[Trac Post Commit Hook][1]
[1]: http://trac.edgewall.org/browser/trunk/contrib/trac-post-commit-hook?rev=920 | 0 | [
2,
184,
107,
31,
8713,
14,
678,
9686,
5559,
29,
13,
38,
5797,
279,
13,
18,
16578,
19,
21,
1936,
2307,
60,
800,
3726,
3726,
31,
22,
79,
946,
19,
21,
1936,
2307,
29,
13,
38,
5797,
13,
118,
13,
18,
16578,
17,
31,
259,
9686,
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... |
Samba, other non interactive accounts - noshell, nologin, or blank?
===
Conducting a user account cleanup accross Solaris and Redhat linux systems, many of which have a number of Samba shares.
What preference do people have for creating the local unix accounts for non interactive Samba users? In particular, the shell entry:
1. noshell
2. nologin
3. blank
And why?
JB | 0 | [
2,
13,
18,
7483,
15,
89,
538,
9194,
5310,
13,
8,
90,
15984,
15,
90,
5567,
108,
15,
54,
6463,
60,
800,
3726,
3726,
9202,
21,
4155,
2176,
26862,
21,
150,
7703,
4535,
403,
17,
402,
6775,
13024,
1242,
15,
151,
16,
56,
57,
21,
234,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Preferred logging infrastructure for .Net
===
What is your preferred logging infrastructure for .Net - NLog, log4net, other? Please, specify why you would use one vs. another (pros and cons). | 0 | [
2,
5981,
13,
13919,
5282,
26,
13,
9,
2328,
800,
3726,
3726,
98,
25,
154,
5981,
13,
13919,
5282,
26,
13,
9,
2328,
13,
8,
13,
103,
5567,
15,
6738,
300,
2328,
15,
89,
60,
2247,
15,
19077,
483,
42,
83,
275,
53,
4611,
9,
226,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
SSRS 2005 - Looping Through Report Parameters
===
I would like to be able to loop through all of the defined parameters on my reports and build a display string of the parameter name and value. I'd then display the results on the report so the user knows which parameters were used for that specific execution. The only problem is that I cannot loop through the Parameters collection. There doesn't seem to be an indexer on the Parameters collection, nor does it seem to implement IEnumerable. Has anyone been able to accomplish this? I'm using SSRS 2005 and it must be implemented within the Report Code (i.e., no external assembly). Thanks! | 0 | [
2,
22118,
18,
812,
13,
8,
5293,
68,
120,
1330,
12905,
800,
3726,
3726,
31,
83,
101,
20,
44,
777,
20,
5293,
120,
65,
16,
14,
2811,
12905,
27,
51,
2813,
17,
1895,
21,
3042,
3724,
16,
14,
18906,
204,
17,
1923,
9,
31,
22,
43,
94... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Vertical line after a certain amount characters in Visual Studio
===
I've always been searching for a way to make Visual Studio draw a vertical line after a certain amount of characters. I recently found a simple solution I would like to share:
If you are using Visual Studio 2005 (*) open the registry at `HKEY_CURRENT_USER\Software\Microsoft\VisualStudio\8.0\Text Editor` and add a new string called `Guides` with the value `RGB(230,230,230), 80`. The first part specifies the color, while the other one (`80`) is the column the line will be displayed.
If you restart Visual Studio, the vertical line will appear:
![Screenshot of Visual Studio][1]
(*) The registry key may be different for other versions of Visual Studio.
[1]: http://img168.imageshack.us/img168/4044/previewvk7.jpg | 0 | [
2,
7035,
293,
75,
21,
1200,
2006,
1766,
19,
3458,
1120,
800,
3726,
3726,
31,
22,
195,
550,
74,
5792,
26,
21,
161,
20,
233,
3458,
1120,
2003,
21,
7035,
293,
75,
21,
1200,
2006,
16,
1766,
9,
31,
1989,
216,
21,
1935,
4295,
31,
83... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Fade splash screen in and out
===
In a C# windows forms application. I have a splash screen with some multi-threaded processes happening in the background. What I would like to do is when I display the splash screen initially, I would like to have it appear to "fade in". And then, once all the processes finish, I would like it to appear as though the splash screen is "fading out". I'm using C# and .NET 2.0. Thanks. | 0 | [
2,
11381,
13873,
2324,
19,
17,
70,
800,
3726,
3726,
19,
21,
272,
5910,
1936,
1997,
3010,
9,
31,
57,
21,
13873,
2324,
29,
109,
1889,
8,
96,
10647,
69,
5102,
4942,
19,
14,
2395,
9,
98,
31,
83,
101,
20,
107,
25,
76,
31,
3042,
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 set up a custom build step in Visual Studio 6?
===
Unfortunately it looks like for various reasons I'm going to have to use Visual Studio 6 instead of a newer version of VS.
It's been a long time since I've used it. I'm looking through its menus and don't see any obvious way to set up any custom build steps (pre-build, post-build, pre-link... anything would help actually).
Can anyone give me instructions on how to set up steps like this? | 0 | [
2,
184,
107,
31,
309,
71,
21,
5816,
1895,
1424,
19,
3458,
1120,
400,
60,
800,
3726,
3726,
6200,
32,
1879,
101,
26,
617,
2932,
31,
22,
79,
228,
20,
57,
20,
275,
3458,
1120,
400,
700,
16,
21,
12372,
615,
16,
4611,
9,
32,
22,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a single resource which explains windows memory thoroughly?
===
Seriously, I've trawled MSDN and only got half answers - what do the columns on the Task Manager mean? Why can't I calculate the VM Usage by enumerating threads, modules, heaps &c.? How can I be sure I am accurately reporting to clients of my memory manager how much address space is left? Are their myriad collisions in the memory glossary namespace? | 0 | [
2,
25,
80,
21,
345,
6577,
56,
7346,
1936,
1912,
13632,
60,
800,
3726,
3726,
4818,
15,
31,
22,
195,
13,
38,
12404,
1294,
4235,
43,
103,
17,
104,
330,
519,
6709,
13,
8,
98,
107,
14,
7498,
27,
14,
3005,
1382,
884,
60,
483,
92,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Please help me with my .NET abstract classes.
===
I'm designing a web site navigation hierarchy. It's a tree of nodes.
Most nodes are pages. Some nodes are links (think shortcuts in Windows).
Most pages hold HTML content. Some execute code.
I'd like to represent these as this collection of classes and abstract (MustInherit) classes…
![class diagram][1]
This is the database table where I'm going to store all this…
![database table][2]
Here's where I'm stumped. PageNodes may or may not be roots.
How should I handle the root class?
![class diagram][3]
I don't want to have to have all four of…
- HtmlPageNode
- CodePageNode
- Html**Root**PageNode
- Code**Root**PageNode
I want the HtmlPageNode and CodePageNode classes to inherit *either* from PageNode or else from RootPageNode. Is that possible?
[1]: http://img396.imageshack.us/img396/1711/nodeclassinheritanceej0.gif
[2]: http://img178.imageshack.us/img178/8573/nodetablefm8.gif
[3]: http://img396.imageshack.us/img396/5758/rootclasshf9.gif | 0 | [
2,
2247,
448,
55,
29,
51,
13,
9,
2328,
8502,
2684,
9,
800,
3726,
3726,
31,
22,
79,
15026,
21,
2741,
689,
8368,
14417,
9,
32,
22,
18,
21,
1541,
16,
16272,
9,
127,
16272,
50,
4434,
9,
109,
16272,
50,
6271,
13,
5,
10550,
502,
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... |
Using Component Object Model (COM) on non-Microsoft platforms
===
I'm regularly running into similar situations :
I have a bunch of COM .DLLs (no IDL files) which I need to use and invoke to be able to access some foreign (non-open, non-documented) data format.
Microsoft's Visual Studio platform has very nice capabilities to import such COM DLLs and use them in my project (Visual C++'s #import directive, or picking and adding them using Visual Basic .NET's dialogs) - and that's the vendors recommended way to use them.
I would be interested into finding a way to use those DLLs on non-microsoft development platforms. Namely, using these COM classes in C++ project compiled with MinGW or Cygwin, or even Wine's GCC port to linux (compiles C++ targeting Win32 into binary running natively on Linux).
I have got some limited success using <a href="http://www.codeproject.com/KB/COM/comdispatchdriver.aspx">this</a> driver, but this isn't successful in 100% of situations (I can't use COM objects returned by some methods).
Has someone had success in similar situations ? | 0 | [
2,
568,
5912,
3095,
1061,
13,
5,
960,
6,
27,
538,
8,
22019,
12980,
6843,
800,
3726,
3726,
31,
22,
79,
4217,
946,
77,
835,
8329,
13,
45,
31,
57,
21,
7653,
16,
13,
960,
13,
9,
43,
211,
18,
13,
5,
251,
31,
8643,
6488,
6,
56,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 an IIS worker process clear session variables when it recycles?
===
We're writing an asp.net web app on IIS 6 and are planning on storing our user login variables in a session. Will this be removed when the worker process recycles? | 0 | [
2,
630,
40,
595,
18,
7444,
953,
1207,
3723,
12157,
76,
32,
302,
12467,
18,
60,
800,
3726,
3726,
95,
22,
99,
1174,
40,
28,
306,
9,
2328,
2741,
4865,
27,
595,
18,
400,
17,
50,
2334,
27,
25615,
318,
4155,
6738,
108,
12157,
19,
21... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0... |
How do I use RelativeSource Bindings in WPF?
===
Short examples for copy&paste. | 0 | [
2,
184,
107,
31,
275,
4543,
12097,
8728,
18,
19,
619,
7721,
60,
800,
3726,
3726,
502,
3770,
26,
4344,
1569,
19802,
62,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What can you use to get an application to be able to receive sms message?
===
- Do you need to use some kind of provider?
- Can you setup your own SMS server?
- Does any open source solutions exist?
I am an SMS newbie so any insight on how this is accomplished would be great. I am partial to Java but any language is fine. | 0 | [
2,
98,
92,
42,
275,
20,
164,
40,
3010,
20,
44,
777,
20,
2588,
7613,
18,
2802,
60,
800,
3726,
3726,
13,
8,
107,
42,
376,
20,
275,
109,
825,
16,
11747,
60,
13,
8,
92,
42,
18161,
154,
258,
7613,
18,
8128,
60,
13,
8,
630,
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... |
Is there any tool which can generate a report for a valid C program
===
is there any tool that can parse a valid C program and generate a report which contains list of functions, global variables, #define constants, local variables in each function etc.
| 0 | [
2,
25,
80,
186,
5607,
56,
92,
7920,
21,
1330,
26,
21,
7394,
272,
625,
800,
3726,
3726,
25,
80,
186,
5607,
30,
92,
2017,
870,
21,
7394,
272,
625,
17,
7920,
21,
1330,
56,
1588,
968,
16,
3719,
15,
2062,
12157,
15,
6926,
546,
7509... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Getting a full list of the URLS in a rails application
===
How do I get a a complete list of all the urls that my rails application could generate?
I don't want the routes that I get get form rake routes, instead I want to get the actul URLs corrosponding to all the dynmically generated pages in my application...
Is this even possible?
(Background: I'm doing this because I want a complete list of URLs for some load testing I want to do, which has to cover the entire breadth of the application) | 0 | [
2,
1017,
21,
503,
968,
16,
14,
13,
911,
7532,
19,
21,
2240,
18,
3010,
800,
3726,
3726,
184,
107,
31,
164,
21,
21,
1279,
968,
16,
65,
14,
13,
911,
7532,
30,
51,
2240,
18,
3010,
110,
7920,
60,
31,
221,
22,
38,
259,
14,
5050,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Code/Document Management for a very small company
===
I work for a very small company (~5 employees, 2.5 coders). We have gotten away with no code or document management for several years, but it's starting to catch up with us as we grow a bit.
Any suggestions for a management system. Free is better, but cheap is acceptable. We just don't want to spend more time on installation/configuration than it is going to save us.
We use mostly VC++ 6, but we're branching into VC# 2008. Also, we need to keep track of mechanical drawings and circuit diagrams for several pieces of hardware, as well as user manuals for both hardware and software (but I don't really expect to find one tool that will do all of this, just hoping). | 0 | [
2,
1797,
118,
28132,
1097,
26,
21,
253,
284,
237,
800,
3726,
3726,
31,
170,
26,
21,
253,
284,
237,
13,
5,
1,
264,
3716,
15,
172,
9,
264,
1797,
1224,
6,
9,
95,
57,
4094,
229,
29,
90,
1797,
54,
4492,
1097,
26,
238,
122,
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 indicate the SQL default library in an IBM iSeries 2 connection string to an AS/400?
===
I'm connecting to an AS/400 stored procedure layer using the IBM iSeries Access for Windows package. This provides a .NET dll with classes similar to those in the System.Data namespace. As such we use their implementation of the connection class and provide it with a connection string.
Does anyone know how I can amend the connection string to indicate the default library it should use? | 0 | [
2,
184,
107,
4342,
14,
4444,
255,
12838,
1248,
19,
40,
10233,
31,
8231,
172,
2760,
3724,
20,
40,
28,
118,
7114,
60,
800,
3726,
3726,
31,
22,
79,
6440,
20,
40,
28,
118,
7114,
8214,
7004,
5385,
568,
14,
10233,
31,
8231,
1381,
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... |
What are the perldoc perlxxx options?
===
It appears that using perldoc perl gives the list of, e.g. perlre, perlvar, etc.
Is this the best place to find the list of what's available as an overview or tutorial or reference manual section? Is there another, better list? | 0 | [
2,
98,
50,
14,
416,
255,
13799,
416,
255,
13290,
6368,
60,
800,
3726,
3726,
32,
1780,
30,
568,
416,
255,
13799,
416,
255,
2352,
14,
968,
16,
15,
13,
62,
9,
263,
9,
416,
255,
99,
15,
416,
255,
3311,
15,
2722,
9,
25,
48,
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... |
MySql - Create Table If Not Exists Else Truncate?
===
I've been having a hard time trying to figure out if the following is possible in MySql without having to write block sql:
<pre>
CREATE TABLE fubar IF NOT EXISTS ELSE TRUNCATE TABLE fubar
</pre>
If I run truncate separately before the create table, and the table doesn't exist, then I get an error message. I'm trying to eliminate that error message without having to add any more queries.
This code will be executed using PHP. | 0 | [
2,
51,
18,
22402,
13,
8,
1600,
859,
100,
52,
5636,
962,
22328,
62,
60,
800,
3726,
3726,
31,
22,
195,
74,
452,
21,
552,
85,
749,
20,
1465,
70,
100,
14,
249,
25,
938,
19,
51,
18,
22402,
366,
452,
20,
2757,
1921,
4444,
255,
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... |
Access form won't close
===
My Access 2000 DB causes me problems - sometimes (haven't pinpointed the cause) the "book" form won't close. Clicking its close button does nothing, File -> Close does nothing, even closing Access results in no action. I don't have an OnClose handler for this form (nor do I have any subforms). The only workaround I can find involves opening the Vba editor, making a change to the code for that form (even adding a space and then immediately deleting the space), and then going back to close the "book" form, closing it, and saying "no, I don't want to save the changes". Only then will it close. Any help? | 0 | [
2,
1381,
505,
230,
22,
38,
543,
800,
3726,
3726,
51,
1381,
824,
13,
9007,
4047,
55,
1716,
13,
8,
1030,
13,
5,
9671,
22,
38,
27446,
69,
14,
1679,
6,
14,
13,
7,
5199,
7,
505,
230,
22,
38,
543,
9,
25590,
82,
543,
5167,
630,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to implement in-process full text search engine
===
In one of our commercial applications (Win32, written in Delphi) we'd like to implement full text search. The application is storing user data in some kind of binary format that is not directly recognizable as a text.
Ideally, I'd like to find either an in-process solution (DLL would be OK) or a local server that I could access via TCP (preferably). The API should allow me to submit a textual information to the server (along with the metadata representing the binary blob it came from) and, of course, it should allow me to do a full-text search with at least minimal support for logical operators and substring searching. Unicode support is required.
I found extensive list of search engines on Stack Overflow ([What are some Search Servers out there?](http://stackoverflow.com/questions/66922/what-are-some-search-servers-out-there)) but I don't really understand which of those engines could satisfy my needs. I thought of asking The Collective for opinion before I spend a day or two testing each of them.
Any suggestions? | 0 | [
2,
184,
20,
8713,
19,
8,
16835,
503,
1854,
2122,
1406,
800,
3726,
3726,
19,
53,
16,
318,
1439,
3767,
13,
5,
4181,
3125,
15,
642,
19,
23030,
6,
95,
22,
43,
101,
20,
8713,
503,
1854,
2122,
9,
14,
3010,
25,
25615,
4155,
1054,
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... |
Why learn Perl, Python, Ruby if the company is using C++, C# or Java as the application language?
===
I wonder why would a C++, C#, Java developer want to learn a dynamic language?
Assuming the company won't switch its main development language from C++/C#/Java to a dynamic one what use is there for a dynamic language?
What helper tasks can be done by the dynamic languages faster or better after only a few days of learning than with the static language that you have been using for several years?
| 0 | [
2,
483,
2484,
416,
255,
15,
20059,
15,
10811,
100,
14,
237,
25,
568,
272,
20512,
15,
272,
5910,
54,
8247,
28,
14,
3010,
816,
60,
800,
3726,
3726,
31,
2666,
483,
83,
21,
272,
20512,
15,
272,
5910,
15,
8247,
10058,
259,
20,
2484,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 override the library path when loading a core file in gdb on Linux
===
I have a core file generated on a remote system that I don't have direct access to. I also have local copies of the library files from the remote system, and the executable file for the crashing program.
I'd like to analyse this core dump in gdb.
For example:
gdb path/to/executable path/to/corefile
My libraries are in:
./usr
In the past I've seen debuggers implement this by supplying the option "-p ." or "-p /=."; so my question is:
How can I specify that libraries be loaded first from paths relative to my current directory when analysing a corefile in gdb? | 0 | [
2,
184,
107,
31,
84,
11891,
14,
1248,
2013,
76,
12797,
21,
2884,
3893,
19,
489,
9007,
27,
13024,
800,
3726,
3726,
31,
57,
21,
2884,
3893,
6756,
27,
21,
5388,
329,
30,
31,
221,
22,
38,
57,
1744,
1381,
20,
9,
31,
67,
57,
375,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
create an index on a mysql column based on the length its contents?
===
How do I create an index on a column in mysql v 5.0 (myisam db engine) based upon the length of its value its a TEXT data type up to 7000 characters, do I have to add another column with the length of the first column.
Any help kindly received, cheers
| 0 | [
2,
1600,
40,
4348,
27,
21,
51,
18,
22402,
4698,
432,
27,
14,
1476,
82,
8478,
60,
800,
3726,
3726,
184,
107,
31,
1600,
40,
4348,
27,
21,
4698,
19,
51,
18,
22402,
566,
331,
9,
387,
13,
5,
915,
49,
6101,
13,
9007,
1406,
6,
432,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
I need a WYSIWYG web editor (Web Based).
===
I am **not** looking for a Windows based editor. I am looking for a web based editor that has some of the following. I know of this [post][1], but its not what I want. Please don't mention it.
1. A **lot of mark up capabilities**. Exp. Bold, Italics, Indent, Left & right align, etc...
2. Has **Live Preview** just by typing, don't want to have to push a button to get it.
3. Looking for a **.NET Editor** or **cross platform editor**.
**Point:** I must make it clear that I have seen FreeTextBox, tinymce, markdown etc...
**To Compare:** I am looking for something with the capabilities of *TinyMCE* but has the live preview of *MarkDown*
[1]: http://stackoverflow.com/questions/5833/looking-for-wysiwyg-html-editor | 0 | [
2,
31,
376,
21,
5809,
18,
49,
7913,
263,
2741,
1835,
13,
5,
14113,
432,
6,
9,
800,
3726,
3726,
31,
589,
13,
1409,
1270,
1409,
699,
26,
21,
1936,
432,
1835,
9,
31,
589,
699,
26,
21,
2741,
432,
1835,
30,
63,
109,
16,
14,
249,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
div class vs id
===
When using divs when is it best to use a class vs id?
Is it best to use class, on say font variant or elements within the html? Then use id for the structure/containers?
This is something I've always been a little uncertain on, any help would be great.
| 0 | [
2,
13,
12916,
718,
4611,
4924,
800,
3726,
3726,
76,
568,
13,
12916,
18,
76,
25,
32,
246,
20,
275,
21,
718,
4611,
4924,
60,
25,
32,
246,
20,
275,
718,
15,
27,
395,
9978,
8320,
54,
2065,
363,
14,
13,
15895,
60,
94,
275,
4924,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using Visual Studio's 'cl' from a normal command line
===
Visual Studio 2003 and 2005 (and perhaps 2008 for all I know) require the command line user to run in the 'Visual Studio Command Prompt'. When starting this command prompt it sets various environment variables that the C++ compiler, cl, uses when compiling.
Is there an easy way to run cl without having to run from within the Visual Studio command prompt? | 0 | [
2,
568,
3458,
1120,
22,
18,
13,
22,
5316,
22,
37,
21,
1826,
1202,
293,
800,
3726,
3726,
3458,
1120,
973,
17,
812,
13,
5,
290,
1774,
570,
26,
65,
31,
143,
6,
4077,
14,
1202,
293,
4155,
20,
485,
19,
14,
13,
22,
20893,
1120,
12... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you override the string representation the HTML helper methods use for a model’s properties?
===
The html helper methods check the ViewDataDictionary for a value. The value can either be in the dictionary or in the Model, as a property. To extract the value, an internal sealed class named the ViewDataEvaluator uses PropertyDescriptor to get the value. Then, Convert.ToString() is called to convert the object returned to a string.
The view can render a HTML textbox and extract the string representation of the property with this line of code:
<pre>
<%=Html.TextBox(“UnitPrice”) %>
</pre>
For the textbox’s value, the UnitPrice property’s value from the model instance is converted to a string. I need to override this behavior with my own conversion to a string, which is per property – not per type. For example, I need a different string representation of a **decimal** for UnitPrice and another string representation of a **decimal** for UnitQuantity.
Just like the IModelBinder is the _Parse_ for each property of the model, I need a _Format_ for each property. This would enable the model to round-trip and have proper formatting.
Please note I need **property specific** formatting for a specific model, not type specific formatting. | 0 | [
2,
184,
107,
42,
84,
11891,
14,
3724,
5442,
14,
13,
15895,
448,
106,
3195,
275,
26,
21,
1061,
1,
18,
3704,
60,
800,
3726,
3726,
14,
13,
15895,
448,
106,
3195,
2631,
14,
1418,
18768,
22595,
1857,
26,
21,
1923,
9,
14,
1923,
92,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Converting an integer to a hexadecimal string in Ruby
===
Is there a built in way to convert an integer in Ruby into its hexadecimal equivalent.
The opposite of
"0A".to_i(16)
=>10
or
"0A".hex
=>10
I know how to roll my own, but it's probably more efficient to use a built in ruby function | 0 | [
2,
19583,
40,
13820,
20,
21,
24,
6791,
9522,
49,
3482,
3724,
19,
10811,
800,
3726,
3726,
25,
80,
21,
392,
19,
161,
20,
8406,
40,
13820,
19,
10811,
77,
82,
24,
6791,
9522,
49,
3482,
4602,
9,
14,
2794,
16,
13,
7,
387,
58,
7,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.