unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
C# ResetBinding flip the DataGridView
===
I had a [problem][1] that was partially solved. To explain it quickly : I have a grid binded to a complex object that require to be serialized. When the object is build back from the serialization, event like on the grid doesn't refresh the table display. Someone told me to rebuild the event once unserialize, it works! But the event that refresh the grid doesn't seems to fire at all.
I had to build an event from my complex object that told me that something change inside. From this event I added this code :
this.bindingSource1.ResetBindings(false);
The problem is the grid is flipping and the user doesn't have a good feeling (rows are moving up and down and than stop).
How can I reset the binding without having this kind of flipping?
How can I solve the [original problem][2]? (This will solve automaticly everything).
[1]: http://stackoverflow.com/questions/118051/c-grid-binding-not-update
[2]: http://stackoverflow.com/questions/118051/c-grid-binding-not-update | 2 | [
2,
272,
5910,
23422,
22260,
8805,
14,
1054,
16375,
4725,
800,
3726,
3726,
31,
41,
21,
636,
2740,
2854,
79,
500,
2558,
165,
500,
30,
23,
5933,
15091,
9,
20,
3271,
32,
976,
13,
45,
31,
57,
21,
7354,
10193,
69,
20,
21,
1502,
3095,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 persist a ByRef variable into .net winforms dialog form?
===
I am creating a "department picker" form that is going to serve as a modal popup form with many of my "primary" forms of a Winforms application. Ideally the user is going to click on an icon next to a text box that will pop up the form, they will select the department they need, and when they click OK, the dialog will close and I will have the value selected for me to update the textbox with.
I've already done the route with passing the owner of the dialog box into the dialog form and having the OK button click event do the proper update, but this forces me to do a DirectCast to the form type and I can then only reuse the picker on the current form.
I have been able to use a ByRef variable in the constructor and successfully update a value, but it works only in the constructor. If I attempt to assign the ByRef value to some internal variable in the Department Picker class, I lose the reference aspect of it. This is my basic code attached to my form:
Public Class DeptPicker
Private m_TargetResult As String
Public Sub New(ByRef TargetResult As String)
InitializeComponent()
' This works just fine, my "parent" form has the reference value properly updated.
TargetResult = "Booyah!"
' Once I leave the constructor, m_TargetResult is a simple string value that won't update the parent
m_TargetResult = TargetResult
End Sub
Private Sub btnOK_Click(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles btnOK.Click
DialogResult = Windows.Forms.DialogResult.OK
' I get no love here. m_TargetResult is just a string and doesn't push the value back to the referenced variable I want.
m_TargetResult = "That department I selected."
Me.Close()
End Sub
Private Sub btnCancel_Click(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles btnCancel.Click
DialogResult = Windows.Forms.DialogResult.Cancel
Me.Close()
End Sub
End Class
Can somebody tell me what I'm missing here or a different approach to make this happen?
*Note: Code sample is in VB.NET, but I'll take any C# answers too. 8^D* | 0 | [
2,
184,
107,
31,
22084,
21,
34,
14057,
7612,
77,
13,
9,
2328,
628,
4190,
18,
28223,
505,
60,
800,
3726,
3726,
31,
589,
2936,
21,
13,
7,
29263,
2036,
106,
7,
505,
30,
25,
228,
20,
1884,
28,
21,
13,
20756,
1675,
576,
505,
29,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Precision of reals through writeln/readln in Delphi
===
My clients application exports and imports quite a few variables of type real through a text file using writeln and readln. I've tried to increase the width of the fields written so the code looks like:
writeln(file, exportRealvalue:30); //using excess width of field
....
readln(file, importRealvalue);
When I export and then import and export again and compare the files I get a difference in the last two digits, e.g (might be off on the actual number of digits here but you get it):
-1.23456789012E-0002
-1.23456789034E-0002
This actually makes a difference in the app so the client wants to know what I can do about it. Now I'm not sure it's only the write/read that does it but I thought I'd throw a quick question out there before I dive into the hey stack again. Do I need to go binary on this? | 0 | [
2,
13133,
16,
683,
18,
120,
2757,
16600,
118,
10647,
16600,
19,
23030,
800,
3726,
3726,
51,
7421,
3010,
16716,
17,
20617,
1450,
21,
310,
12157,
16,
1001,
683,
120,
21,
1854,
3893,
568,
2757,
16600,
17,
1302,
16600,
9,
31,
22,
195,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Load in memory text into WebBrowser control
===
On the .Net WebBrowser control the only way I can see to load a page to it is to set the URL property. But I would like to instead give it some HTML code that I already have in memory without writing it out to a file first. Is there any way to do this? Or are there any controls that will do this? | 0 | [
2,
6305,
19,
1912,
1854,
77,
10192,
5417,
4104,
569,
800,
3726,
3726,
27,
14,
13,
9,
2328,
10192,
5417,
4104,
569,
14,
104,
161,
31,
92,
196,
20,
6305,
21,
2478,
20,
32,
25,
20,
309,
14,
287,
6362,
1354,
9,
47,
31,
83,
101,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Case Sensitivity when querying SQL Server 2005 from .NET using OleDB
===
I have a query that I'm executing from a .NET application to a SQL Server database and it seems to take quite a while to complete (5+ Minutes). I created a test app in c# to try to see what was talking so long (the query should return quickly).
As I was reconstructing the query by adding in elements to see which portion was taking so long, I ended up reconstructing the query practically verbatim where the only difference was the spaces in the original query and a capitalization difference. This difference returned a result in about 100 milliseconds.
Has anybody seen this before? I'm wondering if there are services turned off in our server (since a coworker has the same problem) or on our computers.
Thanks in advance for any help with this.
Code Sample Below (The Difference in in the first line of the query at the end (fk_source vs. fk _Source):
//Original
OleDbCommand comm = new OleDbCommand("select min(ctc.serial_no) as MIN_INTERVAL from countstypecode ctc, source s, countstype ct, counts c where ct.value_id=c.value_id and s.c_id=ct.fk_source and " +
"ct.timeinterval=ctc.typename and ct.timeinterval in ('15min','1h','1day') and c.time_stamp >= CONVERT(datetime,'01-01-2008',105) and c.time_stamp < " +
"CONVERT(datetime,'01-01-2009',105) and s.c_id = '27038dbb19ed93db011a315297df3b7a'", dbConn);
//Rebuilt
OleDbCommand comm = new OleDbCommand("select min(ctc.serial_no) as MIN_INTERVAL from countstypecode ctc, source s, countstype ct, counts c where ct.value_id=c.value_id and s.c_id=ct.fk_Source and " +
"ct.timeinterval=ctc.typename and ct.timeinterval in ('15min','1h','1day') and c.time_stamp >= CONVERT(datetime,'01-01-2008',105) and c.time_stamp < " +
"CONVERT(datetime,'01-01-2009',105) and s.c_id='27038dbb19ed93db011a315297df3b7a'", dbConn); | 0 | [
2,
610,
17018,
76,
25597,
68,
4444,
255,
8128,
812,
37,
13,
9,
2328,
568,
12116,
9007,
800,
3726,
3726,
31,
57,
21,
25597,
30,
31,
22,
79,
25836,
37,
21,
13,
9,
2328,
3010,
20,
21,
4444,
255,
8128,
6018,
17,
32,
2206,
20,
247,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 needs checking in for a Grails app?
===
What parts of a Grails application need to be stored in source-control? Some obvious parts that are needed:
- grails-app directory
- test directory
- web-app directory
Now we reach questions like:
- If we use a Grails plug-in (like gldapo), do we need to check in that plugin?
- Do Grails plugins install in the Grails directory, or your project?
I'm not looking to start a religious war about .project, so please ignore that, but are there any "hidden" project files I need to worry about, along with the plugin issues? | 0 | [
2,
98,
2274,
9886,
19,
26,
21,
489,
7301,
18,
4865,
60,
800,
3726,
3726,
98,
1341,
16,
21,
489,
7301,
18,
3010,
376,
20,
44,
8214,
19,
1267,
8,
12898,
60,
109,
4674,
1341,
30,
50,
851,
45,
13,
8,
489,
7301,
18,
8,
7753,
1675... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Has anyone run into problems in TortoiseSVN where the 'author' isn't written to the log?
===
I have someone connecting to my repository using the url (substituted the IP address):
**svn+ssh://craig@123.45.67.89/subversion**
Yet when they commit files, the author entry is "null".
According to this article: http://tortoisesvn.net/node/80
it should be working fine.
Does anyone have any suggestions? | 0 | [
2,
63,
1276,
485,
77,
1716,
19,
25691,
18,
16578,
113,
14,
13,
22,
10007,
22,
2532,
22,
38,
642,
20,
14,
6738,
60,
800,
3726,
3726,
31,
57,
737,
6440,
20,
51,
24869,
568,
14,
287,
6362,
13,
5,
7563,
384,
12866,
1427,
14,
15735... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Implementing rulers in C# form
===
Does anyone have a good technique (or tutorial) to implement rulers within a C# Windows form? I want to display an image while showing rulers that indicate your mouse position to allow a more accurate positioning of the cursor. Just like the image below:
![alt text][1]
I tried using splitter controls to hold the tick marks but I don't know how to make the topleft the gray blank area. Any advice? Thanks.
[1]: http://www.codeguru.com/img/legacy/splitter/rulers.jpg | 0 | [
2,
17333,
12401,
19,
272,
5910,
505,
800,
3726,
3726,
630,
1276,
57,
21,
254,
4873,
13,
5,
248,
29724,
6,
20,
8713,
12401,
363,
21,
272,
5910,
1936,
505,
60,
31,
259,
20,
3042,
40,
1961,
133,
3187,
12401,
30,
4342,
154,
7567,
64... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ideas to replace Stored Procedure in Cash Flow report
===
We have a Cash flow report which is basically in this structure:
Date |Credit|Debit|balance|
09/29| 20 | 10 | 10 |
09/30| 0 | 10 | 0 |
The main problem is the balance, and as we are using a DataSet for the Data, it's kinda hard to calculate the balance on the DataSet, because we always need the balance from the previous day.
Also this data comes from several tables and it's been hard to maintain this procedure, because the database metadata is changing frequently.
Anyone could give me some possible different solutions? for the problem?
This report is being displayed on a DataGrid.
| 2 | [
2,
3478,
20,
3934,
8214,
7004,
19,
3392,
3312,
1330,
800,
3726,
3726,
95,
57,
21,
3392,
3312,
1330,
56,
25,
11374,
19,
48,
1411,
45,
1231,
13,
1,
21740,
1,
546,
3326,
1,
24140,
1,
13,
2545,
118,
2738,
1,
434,
13,
1,
332,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Regular expression to match non-english characters?
===
What is the easiest way to match non-english characters in a Regex? I would like to match all words individually in an input string, but the language may not be English, so I will need to match things like ü, ö, ß, and ñ. Also, this is in javascript/jquery, so any solution will need to apply to that. | 0 | [
2,
1290,
1803,
20,
730,
538,
8,
6024,
1766,
60,
800,
3726,
3726,
98,
25,
14,
27237,
161,
20,
730,
538,
8,
6024,
1766,
19,
21,
7953,
1706,
60,
31,
83,
101,
20,
730,
65,
715,
16579,
19,
40,
6367,
3724,
15,
47,
14,
816,
123,
52... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to wire a middle tier of Objects to a data tier consisting of a DataSet?
===
I have a middle tier containing several related objects and a data tier that is using a DataSet with several DataTables and relationships.
I want to call a Save method on one of my objects (a parent object) and have its private variable data transformed into a DataRow and added to a DataTable. Some of the private variable data are actually other objects (child object) that each need to have their own Save method called and their own variable data persisted.
How do I "lace" this together? What parts of a DataSet should be instantiated in the ParentObject and what needs to be passed to the ChildObjects so they can add themselves to the dataset?
Also, how do I wire the relationships together for 2 tables?
The examples I have seen for an Order OrderDetail relationship create the OrderRow and the OrderDetailRow then call OrderDetailRow.SetParentRow(OrderDetail)
I do not think this will work for me since my Order and OrderDetail (using their examples naming) are in separate classes and the examples have it all happening in a Big Honking Method.
Thank you,
Keith | 0 | [
2,
184,
20,
6511,
21,
772,
7197,
16,
3916,
20,
21,
1054,
7197,
4160,
16,
21,
1054,
3554,
60,
800,
3726,
3726,
31,
57,
21,
772,
7197,
3503,
238,
1597,
3916,
17,
21,
1054,
7197,
30,
25,
568,
21,
1054,
3554,
29,
238,
1054,
5924,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 regEx can I use to Split a string into whole words but only if they start with # ?
===
I have tried this...
Dim myMatches As String() = System.Text.RegularExpressions.Regex.Split(postRow.Item("Post"), "\b\#\b")
But it is splitting all words, I want an array of words that start with#
Thanks! | 0 | [
2,
98,
7953,
1706,
92,
31,
275,
20,
2132,
21,
3724,
77,
979,
715,
47,
104,
100,
59,
799,
29,
6926,
13,
60,
800,
3726,
3726,
31,
57,
794,
48,
9,
9,
9,
5937,
51,
12280,
160,
28,
3724,
5,
6,
800,
329,
9,
11969,
9,
25049,
2899... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 asp:content markup more than once in the masterpage
===
I'm new to ASP.NET and want to have an asp:content control for the page title, but I want that value to be used for the <title> tag and for a page header. When I tried to do this with two <asp:ContentPlaceHolder> tags with the same id, it complained that I couldn't have two tags with the same id. Is there a way to achieve this with contentplaceholders, and if not what would be the easiest way to use a single parameter to the masterpage twice in one page? | 0 | [
2,
568,
28,
306,
45,
25424,
943,
576,
91,
119,
382,
19,
14,
1129,
6486,
800,
3726,
3726,
31,
22,
79,
78,
20,
28,
306,
9,
2328,
17,
259,
20,
57,
40,
28,
306,
45,
25424,
569,
26,
14,
2478,
581,
15,
47,
31,
259,
30,
1923,
20,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Good LINQ cheatsheets with VB.NET syntax?
===
I've been looking for a cheatsheet to help me remember LINQ syntax but the only ones I've found have been for C#. It seems like the C# syntax for LINQ is pretty different from the VB.NET syntax.
Any suggestions for a good, concise list of LINQ syntax for VB.NET?
| 0 | [
2,
254,
6294,
1251,
18585,
17627,
18,
29,
13,
20468,
9,
2328,
22649,
60,
800,
3726,
3726,
31,
22,
195,
74,
699,
26,
21,
18585,
17627,
20,
448,
55,
1518,
6294,
1251,
22649,
47,
14,
104,
53,
18,
31,
22,
195,
216,
57,
74,
26,
272... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MSBuild - Getting the target called from command line
===
Does anyone know how to get the name of the TARGET (/t) called from the MSBuild command line? There are a few types of targets that can be called and I want to use that property in a notification to users.
Example:
msbuild Project.proj **/t:ApplicationDeployment** /p:Environment=DEV
I want access to the target words **ApplicationDeployment** in my .Proj file.
Is there a property I can access? Any clue how to do this? | 0 | [
2,
4235,
29361,
13,
8,
1017,
14,
2935,
227,
37,
1202,
293,
800,
3726,
3726,
630,
1276,
143,
184,
20,
164,
14,
204,
16,
14,
2935,
13,
5,
118,
38,
6,
227,
37,
14,
4235,
29361,
1202,
293,
60,
80,
50,
21,
310,
2551,
16,
7767,
30... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to run Visual Studio post-build events for debug build only
===
How can I limit my post-build events to running only for one type of build? I'm using the events to copy DLLs to a local IIS virtual directory but I don't want this happening on the build server in release mode. | 0 | [
2,
184,
20,
485,
3458,
1120,
678,
8,
29361,
963,
26,
121,
16254,
1895,
104,
800,
3726,
3726,
184,
92,
31,
4496,
51,
678,
8,
29361,
963,
20,
946,
104,
26,
53,
1001,
16,
1895,
60,
31,
22,
79,
568,
14,
963,
20,
4344,
13,
43,
21... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
mysql "drop database" takes time -- why?
===
mysql5.0 with a pair of databases "A" and "B", both with large innodb tables. "drop database A;" freezes database "B" for a couple minutes. Nothing is using "A" at that point, so why is this such an intensive operation?
Bonus points: Given that we use "A", upload data into "B", and then switch to using "B", how can we do this faster? Dropping databases isn't the sort of thing one typically has to do all the time, so this is a bit off the charts. | 0 | [
2,
51,
18,
22402,
13,
7,
12361,
6018,
7,
1384,
85,
13,
8,
8,
483,
60,
800,
3726,
3726,
51,
18,
22402,
264,
9,
387,
29,
21,
2146,
16,
6018,
18,
13,
7,
58,
7,
17,
13,
7,
220,
7,
15,
156,
29,
370,
19,
251,
9007,
7484,
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 Authenticate to ActiveResource to Avoid the InvalidAuthenticityToken Response?
===
I created a Rails application normally. Then created the scaffold for an event class. Then tried the following code. When run it complains about a InvalidAuthenticityToken when the destroy method is executed. How do I authenticate to avoid this response?
require 'rubygems'
require 'activeresource'
class Event < ActiveResource::Base
self.site = "http://localhost:3000"
end
e = Event.create(
:name => "Shortest Event Ever!",
:starts_at => 1.second.ago,
:capacity => 25,
:price => 10.00)
e.destroy
| 0 | [
2,
184,
107,
31,
14351,
1373,
20,
1348,
99,
12097,
20,
2658,
14,
16671,
1346,
2504,
1786,
856,
262,
2853,
1627,
60,
800,
3726,
3726,
31,
679,
21,
2240,
18,
3010,
4147,
9,
94,
679,
14,
27322,
26,
40,
807,
718,
9,
94,
794,
14,
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... |
Abstracting storage data structures within XPath
===
I have a collection of data stored in XDocuments and DataTables, and I'd like to address both as a single unified data space with XPath queries. So, for example, "/Root/Tables/Orders/FirstName" would fetch the value of the Firstname column in every row of the DataTable named "Orders".
Is there a way to do this without copying all of the records in the DataTable into the XDocument?
I'm using .Net 3.5 | 0 | [
2,
8502,
68,
4326,
1054,
3815,
363,
993,
8353,
800,
3726,
3726,
31,
57,
21,
1206,
16,
1054,
8214,
19,
993,
28132,
18,
17,
1054,
5924,
18,
15,
17,
31,
22,
43,
101,
20,
3218,
156,
28,
21,
345,
11496,
1054,
726,
29,
993,
8353,
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... |
Ruby - Regex String Insertion
===
I need to substitute the value of a string into my regular expression in Ruby. Is there an easy way to do this? For example:
foo = "0.0.0.0"
goo = "here is some other stuff 0.0.0.0"
if goo =~ /foo's value goes here/
puts "success!"
end | 0 | [
2,
10811,
13,
8,
7953,
1706,
3724,
24245,
800,
3726,
3726,
31,
376,
20,
6558,
14,
1923,
16,
21,
3724,
77,
51,
1290,
1803,
19,
10811,
9,
25,
80,
40,
2010,
161,
20,
107,
48,
60,
26,
823,
45,
4310,
111,
800,
13,
7,
387,
9,
387,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Exception Thrown Causes RunTime Error.
===
We have developed a website that uses MVC, C#, and jQuery. In one of my controller classes we are validating inputs from the user and if it fails we throw an exception that the Ajax error parameter(aka option) handles. (We use Block UI to display the error message. BlockUI is a jQuery plugIn that blocks the screen and displays a message box.)
(Yes, the message has text in it with no funny characters or non-sense)
When running the website locally or on a server we receive different effects from the exception being thrown.
Locally: The proper exception is displayed in BlockUI.
Server: The message "Runtime Error" is displayed instead of the exception message.
print(
public ActionResult FailUpdateStatus(string id)
{
string message = Request.Form["message"];
throw new Exception(message);
});
I have been able to run the website on the server and remote attach to the website. While debugging the exception gets thrown as it should but block UI shows the Runtime error.
Any ideas?
| 0 | [
2,
5391,
6027,
4047,
485,
891,
7019,
9,
800,
3726,
3726,
95,
57,
885,
21,
2271,
30,
2027,
307,
8990,
15,
272,
5910,
15,
17,
487,
8190,
93,
9,
19,
53,
16,
51,
9919,
2684,
95,
50,
7394,
1880,
6367,
18,
37,
14,
4155,
17,
100,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Error sending mail with System.Web.Mail
===
An older application using System.Web.Mail is throwing an exception on emails coming from <em>hr@domain.com</em>. Other addresses appear to be working correctly. We changed our mail server to Exchange 2007 when the errors started, so I assume that is where the problem is. Does anyone know what is happening?
Here is the exception and stack trace:
> System.Web.HttpException: Could not access 'CDO.Message' object. ---> System.Reflection.TargetInvocationException: Exception has been thrown by the target of an invocation. ---> System.Runtime.InteropServices.COMException (0x80040212): The transport lost its connection to the server.<br/>
><br/>
> --- End of inner exception stack trace ---<br/>
> at System.RuntimeType.InvokeDispMethod(String name, BindingFlags invokeAttr, Object target, Object[] args, Boolean[] byrefModifiers, Int32 culture, String[] namedParameters)<br/>
> at System.RuntimeType.InvokeMember(String name, BindingFlags invokeAttr, Binder binder, Object target, Object[] args, ParameterModifier[] modifiers, CultureInfo culture, String[] namedParameters)<br/>
> at System.Web.Mail.LateBoundAccessHelper.CallMethod(Object obj, String methodName, Object[] args)<br/>
> --- End of inner exception stack trace ---<br/>
> at System.Web.Mail.LateBoundAccessHelper.CallMethod(Object obj, String methodName, Object[] args)<br/>
> at System.Web.Mail.CdoSysHelper.Send(MailMessage message)<br/>
> at System.Web.Mail.SmtpMail.Send(MailMessage message)<br/>
> at ProcessEmail.Main()<br/> | 0 | [
2,
7019,
4907,
4216,
29,
329,
9,
14113,
9,
8079,
800,
3726,
3726,
40,
1234,
3010,
568,
329,
9,
14113,
9,
8079,
25,
6033,
40,
5391,
27,
8517,
18,
880,
37,
13,
1,
1503,
1,
3112,
1,
537,
6232,
9,
960,
1,
118,
1503,
1,
9,
89,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Parsing Performance (If, TryParse, Try-Catch)
===
I know plenty about the different ways of handling parsing text for information. For parsing integers for example, what kind of performance can be expected. I am wondering if anyone knows of any good stats on this. I am looking for some real numbers from someone who has tested this.
Which of these offers the best performance in which situations?
Parse(...)
If (SomethingIsValid)
Parse(...)
TryParse(...)
try
{
Parse(...)
}
catch
{
} | 0 | [
2,
2017,
18,
68,
956,
13,
5,
821,
15,
1131,
3574,
870,
15,
1131,
8,
18208,
6,
800,
3726,
3726,
31,
143,
7062,
88,
14,
421,
2847,
16,
7988,
2017,
18,
68,
1854,
26,
676,
9,
26,
2017,
18,
68,
13820,
18,
26,
823,
15,
98,
825,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# .NET / javascript : Collapsable Table Rows - what about this is wrong?
===
I have a C# .NET page where I want to make rows collapse when a button is pressed. I found many tutorials like this one (http://codingforums.com/archive/index.php?t-90375.html), tried to implement their solutions, but none of them do anything for me when I click my button. To make sure I wasn't going crazy, I made a small test page just to see if the idea works. For some reason, it isn't. The browser is IE6. I'm running Visual Studio 2005. Does anyone have any idea why this isn't working? The rendered page shows a button and a line of text as I would expect; the line of text does not disappear when I click the button. I know I could use divs, but remember this is just a proof of concept; in my real application it is table rows that must collapse.
<%@ Page Language="C#" AutoEventWireup="true" CodeBehind="Test.aspx.cs" Inherits="Project.Web.Auth.Test" %>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" >
<head id="Head1" runat="server">
<title>Shop Financials</title>
<link href="../StyleSheets/ClaimsV2.css" rel="stylesheet" type="text/css" />
<script type="text/javascript">
function btnClick(control)
{
try
{
var id_table = document.getElementById(control).style;
if(id_table.display == "block")
{
id_table.display = "none";
}
else
{
id_table.display = "block";
}
}
catch(e)
{
alert(e);
}
}
function toDepositPrinterFriendly()
{
}
</script>
</head>
<body>
<form id="form1" runat="server">
<table>
<tr>
<td><asp:Button runat="server" OnClientClick="javascript:btnClick('HeaderRow')"/></td>
</tr>
<tr id="HeaderRow" runat="server">
<td>TEST2</td>
</tr>
</table>
</form>
</body>
</html> | 0 | [
2,
272,
5910,
13,
9,
2328,
13,
118,
8247,
8741,
13,
45,
9470,
2552,
18,
579,
859,
11295,
13,
8,
98,
88,
48,
25,
1389,
60,
800,
3726,
3726,
31,
57,
21,
272,
5910,
13,
9,
2328,
2478,
113,
31,
259,
20,
233,
11295,
6529,
76,
21,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is a Lambda?
===
Could someone provide a good description of what a Lambda is? We have a tag for them and they're on the secrets of C# question, but I have yet to find a good definition and explanation of what they are in the first place. | 0 | [
2,
98,
25,
21,
13,
24187,
60,
800,
3726,
3726,
110,
737,
1181,
21,
254,
5318,
16,
98,
21,
13,
24187,
25,
60,
95,
57,
21,
3383,
26,
105,
17,
59,
22,
99,
27,
14,
7818,
16,
272,
5910,
1301,
15,
47,
31,
57,
768,
20,
477,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0... |
Any success rendering HDVideo with WPF MediaElement? Is there a better video player option for WPF?
===
I'm using a WPF MediaElement to render HD video in an application. When the size of the MediaElement gets over about 300 units square the video stutters and the computer is nearly totally unresponsive. I need to render the video full screen.
Has anybody had success rendering fullscreen video using the WPF MediaElement?
What were the processor/video specs of the computer used?
Is there a better way to get video displayed in a WPF application? | 0 | [
2,
186,
1280,
15307,
8590,
14785,
29,
619,
7721,
941,
27567,
60,
25,
80,
21,
574,
763,
517,
4255,
26,
619,
7721,
60,
800,
3726,
3726,
31,
22,
79,
568,
21,
619,
7721,
941,
27567,
20,
16535,
8590,
763,
19,
40,
3010,
9,
76,
14,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Separation of Presentation and Business Tiers with Spring
===
In my just-completed project, I was working getting distributed transactions working.
We implemented this using JBoss's Arjuna Transaction Manager, and Spring's declarative transaction boundaries.
Our request sequence looked like:
browser -> secured servlet -> 'wafer-thin' SLSB -> spring TX-aware proxy -> request-handler POJO
What this meant is that we had a WAR to serve our secured servlet and an EAR to serve our SLSB.
Our SLSB had a static initialiser block to bootstrap our Spring application context.
I don't like the mix of technologies, but I do like the separation of presentation and business tiers, which could reside on different physical locations.
I would be interested to know what others propose to separate tiers when using Spring?
| 0 | [
2,
8312,
16,
6364,
17,
508,
7197,
18,
29,
1573,
800,
3726,
3726,
19,
51,
114,
8,
15990,
43,
669,
15,
31,
23,
638,
1017,
4387,
13147,
638,
9,
95,
6807,
48,
568,
487,
10349,
18,
22,
18,
21377,
58,
12799,
1382,
15,
17,
1573,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I share a menu definition between a context menu and a regular menu in WPF
===
I have a defined MenuItem that I would like to share between two different menus on one page. The menu contains functionallity that is the same between both menus and I do not want two copies of it. Is there anyway to define a MenuItem in the Page.Resources and reference it in the ContextMenu XAML below?
<Page.Resources>
<MenuItem x:Key="123"/>
</Page.Resources>
<ContextMenu>
<MenuItem>Something hardcoded</MenuItem>
<!-- include shared menu here -->
</ContextMenu>
| 0 | [
2,
184,
107,
31,
1891,
21,
11379,
5465,
128,
21,
4141,
11379,
17,
21,
1290,
11379,
19,
619,
7721,
800,
3726,
3726,
31,
57,
21,
2811,
11379,
2119,
79,
30,
31,
83,
101,
20,
1891,
128,
81,
421,
11379,
18,
27,
53,
2478,
9,
14,
113... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to improve performance and memory usage with a large number of polygons on a canvas?
===
The project I'm working on needs to render an ESRI shape file, which can have a large number of polygons/shapes. When I add all these polygons, lines, points, etc to the canvas I'm using, it gets really slow.
To draw the shapes on the map, I'm creating a Path object, and setting it's Data property to a StreamGeometry. I originally used a Polygon, but according to MSDN a StreamGeometry is much lighter weight.
How can I improve the performance? Would converting the finished product to a Bitmap, or VisualBrush help? Is there a more efficient way of to render all these shapes onto the canvas? | 0 | [
2,
184,
20,
3545,
956,
17,
1912,
7514,
29,
21,
370,
234,
16,
21309,
18,
27,
21,
9696,
60,
800,
3726,
3726,
14,
669,
31,
22,
79,
638,
27,
2274,
20,
16535,
40,
13,
160,
928,
2539,
3893,
15,
56,
92,
57,
21,
370,
234,
16,
21309,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
NHibernate ICriteria - Does the sort allow for null?
===
Using NHibernate ICriteria and adding .AddOrder ... I want to sort by a property that is sometimes null with all the populated ones at the top. Will .AddOrder allow me to do this? If not is there an alternative?
The sorting options for ILists leave a lot to be desired.
| 0 | [
2,
12109,
15191,
8820,
31,
16063,
9605,
13,
8,
630,
14,
2058,
1655,
26,
16203,
60,
800,
3726,
3726,
568,
12109,
15191,
8820,
31,
16063,
9605,
17,
4721,
13,
9,
14854,
7861,
13,
9,
9,
9,
31,
259,
20,
2058,
34,
21,
1354,
30,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Waiting for user input with a timeout
===
I have searched but apparently my google foo is weak. What I need is a way to prompt for user input in the console and have the request time out after a period of time and continue executing the script if no input comes in. As near as I can tell, Read-Host does not provide this functionality. Neither does $host.UI.PromptForChoice() nor does $host.UI.RawUI.ReadKey(). Thanks in advance for any pointers. | 0 | [
2,
1672,
26,
4155,
6367,
29,
21,
85,
1320,
800,
3726,
3726,
31,
57,
9036,
47,
3083,
51,
8144,
4310,
111,
25,
3910,
9,
98,
31,
376,
25,
21,
161,
20,
11443,
4417,
26,
4155,
6367,
19,
14,
8650,
17,
57,
14,
3772,
85,
70,
75,
21,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I list / export private keys from a keystore?
===
How do I list and export a private key from a keystore?
| 0 | [
2,
184,
107,
31,
968,
13,
118,
7487,
932,
5534,
37,
21,
1246,
16828,
60,
800,
3726,
3726,
184,
107,
31,
968,
17,
7487,
21,
932,
1246,
37,
21,
1246,
16828,
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... |
transaction isolation problem or wrong approach?
===
I was helping out some colleagues of mine with an SQL problem. Mainly they wanted to move all the rows from table A to table B (both tables having the same columns (names and types)). Although this was done in Oracle 11g I don't think it really matters.
Their initial naive implementation was something like
BEGIN
INSERT INTO B SELECT * FROM A
DELETE FROM A
COMMIT;
END
Their concern was if there were INSERTs made to table A during copying from A to B and the "DELETE FROM A" (or TRUNCATE for what was worth) would cause data loss (having the newer inserted rows in A deleted).
Ofcourse I quickly recommended storing the IDs of the copied rows in a temporary table and then deleting just the rows in A that matched the IDS in the temporary table.
However for curiosity's sake we put up a little test by adding a wait command (don't remember the PL/SQL syntax) between INSERT and DELETE. THen from a different connection we would insert rows *DURING THE WAIT*.
We observed that was a data loss by doing so. I reproduced the whole context in SQL Server and wrapped it all in a transaction but still the fresh new data was lost too in SQL Server. This made me think there is a systematic error/flaw in the initial approach.
However I can't tell if it was the fact that the TRANSACTION was not (somehow?) isolated from the fresh new INSERTs or the fact that the INSERTs came during the WAIT command.
In the end it was implemented using the temporary table suggested by me but we couldn't get the answer to "Why the data loss". Do you know why?
| 0 | [
2,
12799,
13300,
1448,
54,
1389,
2141,
60,
800,
3726,
3726,
31,
23,
3713,
70,
109,
8493,
16,
1114,
29,
40,
4444,
255,
1448,
9,
2011,
59,
417,
20,
780,
65,
14,
11295,
37,
859,
21,
20,
859,
334,
13,
5,
8110,
7484,
452,
14,
205,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
send e-mail and check status
===
Using Java mail, I would like to send an e-mail and check the status. Possible statuses include:
* Hard-bounce: No mail server found
* Soft-bounce: Mail server found, but account not found
* Success
Is it even possible to send an e-mail and get some feedback about the delivery attempt in the manner I've described above?
Cheers,
Don | 0 | [
2,
2660,
13,
62,
8,
8079,
17,
2631,
1782,
800,
3726,
3726,
568,
8247,
4216,
15,
31,
83,
101,
20,
2660,
40,
13,
62,
8,
8079,
17,
2631,
14,
1782,
9,
938,
1782,
160,
468,
45,
1637,
552,
8,
220,
11792,
45,
90,
4216,
8128,
216,
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 to order headers in .NET C++ projects
===
I'm trying to build a new .NET C++ project from scratch. I am planning to mix managed and unmanaged code in this project.
this forum thread
[IDataObject : ambiguous symbol error][1] answers a problem I've seen multiple times.
Post #4 states
"Move all 'using namespace XXXX' from .h to .cpp"
this looks like a good idea but now in my header files I need to reference parameters from the .NET Framework like
void loadConfigurations(String^ pPathname);
How am I supposed to move using statements in the .cpp file and use the according namespaces in the .h file?
[1]: http://www.daniweb.com/forums/thread29742.html | 0 | [
2,
184,
20,
389,
157,
445,
19,
13,
9,
2328,
272,
20512,
2314,
800,
3726,
3726,
31,
22,
79,
749,
20,
1895,
21,
78,
13,
9,
2328,
272,
20512,
669,
37,
12395,
9,
31,
589,
2334,
20,
2917,
1471,
17,
367,
177,
8030,
1797,
19,
48,
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... |
In firebug, how do I find out all of the css styles being applied to a particular element?
===
I'm way buried in many nested levels of css, and I can't tell which style layer/level is messing up my display. How can I find out everything that's being applied to a particular element?
| 0 | [
2,
19,
535,
16254,
15,
184,
107,
31,
477,
70,
65,
16,
14,
272,
18,
18,
6443,
142,
2435,
20,
21,
1498,
4520,
60,
800,
3726,
3726,
31,
22,
79,
161,
2253,
19,
151,
5618,
69,
2216,
16,
272,
18,
18,
15,
17,
31,
92,
22,
38,
494,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 underscores in Java variables and method names
===
Even nowadays I often see underscores in Java variables and methods, an example are member variables (like "m_count" or "_count"). As far as I remember, to use underscores in these cases is called bad style by Sun.
The only place they should be used is in constants (like in "public final static int IS_OKAY = 1;"), because constants should be all upper case and not camel case. Here, the underscore should make the code more readable.
Do you think using underscores in Java is bad style? If so (or not), why? | 0 | [
2,
568,
131,
15077,
18,
19,
8247,
12157,
17,
2109,
1817,
800,
3726,
3726,
166,
15694,
31,
478,
196,
131,
15077,
18,
19,
8247,
12157,
17,
3195,
15,
40,
823,
50,
322,
12157,
13,
5,
1403,
13,
7,
79,
1,
16549,
7,
54,
13,
7,
1,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using "Remember Me" functionality for auethentication .NET 2.0
===
My client wants me to enable a "Remember Me" checkbox when the user logs in. I am encrypting and storing both the usernamd and password in a cookie.
However, you cannot write to a textbox when it's in password mode.
I've seen this done numerous times, so how are they doing it?
thanks in advance!
| 0 | [
2,
568,
13,
7,
18342,
55,
7,
18548,
26,
21,
4185,
2504,
1786,
857,
13,
9,
2328,
172,
9,
387,
800,
3726,
3726,
51,
6819,
2846,
55,
20,
9240,
21,
13,
7,
18342,
55,
7,
2631,
5309,
76,
14,
4155,
18893,
19,
9,
31,
589,
1957,
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... |
How do I convert HTML to RTF (Rich Text) in .NET without paying for a component?
===
Is there a free third-party or .NET class that will convert HTML to RTF (for use in a rich-text enabled Windows Forms control)?
The "free" requirement comes from the fact that I'm only working on a prototype and can just load the BrowserControl and just render HTML if need be (even if it is slow) and that Developer Express is going to be releasing their own such control soon-ish.
I don't want to learn to write RTF by hand, and I already know HTML, so I figure this is the quickest way to get some demonstrable code out the door quickly. | 0 | [
2,
184,
107,
31,
8406,
13,
15895,
20,
761,
11720,
13,
5,
3920,
1854,
6,
19,
13,
9,
2328,
366,
6605,
26,
21,
5912,
60,
800,
3726,
3726,
25,
80,
21,
551,
422,
8,
9635,
54,
13,
9,
2328,
718,
30,
129,
8406,
13,
15895,
20,
761,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 use LINQ to query for items, but also include missing items?
===
I'm trying to chart the number of registrations per day in our registration system. I have an Attendee table in sql server that has a smalldatetime field A_DT, which is the date and time the person registered.
I started with this:
var dailyCountList =
(from a in showDC.Attendee
let justDate = new DateTime(a.A_DT.Year, a.A_DT.Month, a.A_DT.Day)
group a by justDate into DateGroup
orderby DateGroup.Key
select new RegistrationCount
{
EventDateTime = DateGroup.Key,
Count = DateGroup.Count()
}).ToList();
That works great, but it won't include the dates where there were no registrations, because there are no attendee records for those dates. I want every date to be included, and when there is no data for a given date, the count should just be zero.
So this is my current working solution, but I KNOW THAT IT IS TERRIBLE.
I added the following to the code above:
// Create a new list of data ranging from the beginning to the end of the first list, specifying 0 counts for missing data points (days with no registrations)
var allDates = new List<RegistrationCount>();
for (DateTime date = (from dcl in dailyCountList select dcl).First().EventDateTime; date <= (from dcl in dailyCountList select dcl).Last().EventDateTime; date = date.AddDays(1))
{
DateTime thisDate = date; // lexical closure issue - see: http://www.managed-world.com/2008/06/13/LambdasKnowYourClosures.aspx
allDates.Add(new RegistrationCount
{
EventDateTime = date,
Count = (from dclInner in dailyCountList
where dclInner.EventDateTime == thisDate
select dclInner).DefaultIfEmpty(new RegistrationCount
{
EventDateTime = date,
Count = 0
}).Single().Count
});
}
So I created ANOTHER list, and loop through a sequence of dates I generate based on the first and last registrations in the query, and for each item in the sequence of dates, I QUERY the results of my first QUERY for the information regarding the given date, and supply a default if nothing comes back. So I end up doing a subquery here and I want to avoid this.
Can anyone thing of an elegant solution? Or at least one that is less embarrassing? | 0 | [
2,
184,
107,
31,
275,
6294,
1251,
20,
25597,
26,
3755,
15,
47,
67,
468,
2863,
3755,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
1795,
14,
234,
16,
8587,
18,
416,
208,
19,
318,
8587,
329,
9,
31,
57,
40,
3702,
2851,
859,
19,
444... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 2005 Express Edition - Install new instance
===
Looking for a way to programatically, or otherwise, add a new instance of SQL 2005 Express Edition to a system that already has it installed without actually installing it again. What I'm using right now is the following command line and switches switches as part of my installation pre-requisites:
SQLEXPR32.EXE /qb ADDLOCAL=ALL INSTANCENAME=user SECURITYMODE=SQL SAPWD=password SQLAUTOSTART=1 DISABLENETWORKPROTOCOLS=0
I'd go into great detail about why I want to do this but I'd simply bore everyone. Suffice to say, having this ability would greatly assist me for the deployment of my application. If makes any difference to anyone, I'm using a combination of NSIS and Advanced Installer for this installation project.
| 0 | [
2,
4444,
255,
812,
2999,
1322,
13,
8,
16146,
78,
4851,
800,
3726,
3726,
699,
26,
21,
161,
20,
625,
721,
8438,
15,
54,
3190,
15,
3547,
21,
78,
4851,
16,
4444,
255,
812,
2999,
1322,
20,
21,
329,
30,
614,
63,
32,
4066,
366,
1121,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best Visual Studio Hardware Upgrade
===
I have a reasonably modern developer desktop (E6600, ASUS PN5-E, 2GB RAM, 350GB SATA2, Vista Ultimate x32), but I'd like to squeeze some more out of it. I am wondering what the best bang-for-bucks hardware upgrade would be.
If I limit my budget to £150GBP (~$300USD), what would people say would give me the best performance increase when developing? (Note that I have MSDN so can go for x64 if that's going to give me anything.)
I've been reading Jeff Atwood's [Ultimate][1] [Developer][2] [Rig][3] [series][4] and am thinking that adding a 10,000K RPM Raptor and booting off that would be the best (presumably I would run all my projects off the other drive, if that matters??).
[1]: http://www.codinghorror.com/blog/archives/000905.html
[2]: http://www.codinghorror.com/blog/archives/000907.html
[3]: http://www.codinghorror.com/blog/archives/000908.html
[4]: http://www.codinghorror.com/blog/archives/000918.html | 0 | [
2,
246,
3458,
1120,
7610,
9483,
800,
3726,
3726,
31,
57,
21,
19531,
773,
10058,
17404,
13,
5,
62,
379,
7664,
15,
28,
267,
13,
17479,
264,
8,
62,
15,
172,
11400,
2843,
15,
12053,
11400,
847,
58,
135,
15,
13520,
6612,
993,
3125,
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... |
While-clause in T-SQL that loops forever
===
I was recently tasked with debugging a strange problem within an e-commerce application. After an application upgrade the site started to hang from time to time and I was sent in to debug. After checking the event log I found that the SQL-server wrote ~200 000 events in a couple of minutes with the message saying that a constraint had failed. After much debugging and some tracing I found the culprit. I've removed some unnecessary code and cleaned it up a bit but essentially this is it
WHILE EXISTS (SELECT * FROM ShoppingCartItem WHERE ShoppingCartItem.PurchID = @PurchID)
BEGIN
SELECT TOP 1
@TmpGFSID = ShoppingCartItem.GFSID,
@TmpQuantity = ShoppingCartItem.Quantity,
@TmpShoppingCartItemID = ShoppingCartItem.ShoppingCartItemID,
FROM
ShoppingCartItem INNER JOIN GoodsForSale on ShoppingCartItem.GFSID = GoodsForSale.GFSID
WHERE ShoppingCartItem.PurchID = @PurchID
EXEC @ErrorCode = spGoodsForSale_ReverseReservations @TmpGFSID, @TmpQuantity
IF @ErrorCode <> 0
BEGIN
Goto Cleanup
END
DELETE FROM ShoppingCartItem WHERE ShoppingCartItem.ShoppingCartItemID = @TmpShoppingCartItemID
-- @@ROWCOUNT is 1 after this
END
Facts:
1. There's only one or two records matching the first select-clause
2. RowCount from the DELETE statement indicates that it has been removed
3. The WHILE-clause will loop forever
The procedure has been rewritten to select the rows that should be deleted into a temporary in-memory table instead so the immediate problem is solved but this really sparked my curiosity.
Why does it loop forever? | 0 | [
2,
133,
8,
7232,
3699,
19,
13,
38,
8,
18,
22402,
30,
19661,
3818,
800,
3726,
3726,
31,
23,
1989,
14605,
29,
121,
16254,
2762,
21,
2578,
1448,
363,
40,
13,
62,
8,
26470,
3010,
9,
75,
40,
3010,
9483,
14,
689,
373,
20,
4546,
37,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the difference between __reduce__ and __reduce_ex__ ?
===
I understand that these methods are for pickling/unpickling and have no relation to the reduce built-in function, but what's the difference between the 2 and why do we need both?
| 0 | [
2,
98,
25,
14,
2841,
128,
13,
1,
99,
16041,
1,
17,
13,
1,
99,
16041,
1,
1706,
1,
13,
60,
800,
3726,
3726,
31,
1369,
30,
158,
3195,
50,
26,
2036,
802,
118,
1020,
16855,
802,
17,
57,
90,
5827,
20,
14,
4136,
392,
8,
108,
1990... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 get the CPU cache page size in C++?
===
I'd like my program to read the cache line size of the CPU it's running on in C++.
I know that this can't be done portably, so I will need a solution for Linux and another for Windows (Solutions for other systems could be usefull to others, so post them if you know them).
For Linux I could read the content of /proc/cpuinfo and parst the line begining with cache_alignment. Maybe there is a better way involving a call to an API.
For Windows I simply have no idea.
Thanks for your help. | 0 | [
2,
184,
20,
625,
6732,
1326,
164,
14,
17578,
16522,
2478,
1072,
19,
272,
20512,
60,
800,
3726,
3726,
31,
22,
43,
101,
51,
625,
20,
1302,
14,
16522,
293,
1072,
16,
14,
17578,
32,
22,
18,
946,
27,
19,
272,
20512,
9,
31,
143,
30,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I extract the address information from a Compressed ESRI shapefile datasource?
===
When I download the zip file from the website it contains files with the following extensions:
.dbf
.prj
.sbn
.sbx
.shp
.shp.xml
.shx
Is this is a common data file format that I download or purchase a converter?
I think this is some kind of mapping data file but I all need are the addresses it contains to push into our existing database.
Specifically and related to programming. How can I setup a .NET Datasource to this group of files or just the .dbf file that actually contains the information? | 0 | [
2,
184,
92,
31,
10962,
14,
3218,
676,
37,
21,
18472,
13,
160,
928,
2539,
16877,
1054,
12097,
60,
800,
3726,
3726,
76,
31,
7121,
14,
12133,
3893,
37,
14,
2271,
32,
1588,
6488,
29,
14,
249,
17529,
45,
13,
9,
43,
12425,
13,
9,
48... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
404 page that displays requested page
===
I recently migrated a website to a new CMS (Umbraco). A lot of the links have changed, but they can be easily corrected by searching for patters in the url, so I would like to write something that will redirect to the correct page if the old one is not found. That part isn't a problem.
How can I obtain the requested URL after the browser is redirected to my custom 404 page. I tried using:
request.systemvariables("REFERER")
But that didn't work.
Any Ideas? | 0 | [
2,
13,
23397,
2478,
30,
9412,
6602,
2478,
800,
3726,
3726,
31,
1989,
14204,
21,
2271,
20,
21,
78,
2390,
18,
13,
5,
723,
2559,
716,
6,
9,
21,
865,
16,
14,
6271,
57,
1015,
15,
47,
59,
92,
44,
2351,
15642,
34,
5792,
26,
2678,
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 can I create Exchange distribution list inside the GAL using .NET?
===
We need to remotely create an Exchange 2007 distribution list from Asp.Net.
Near as I can tell, the only way to create a distribution list in the GAL is via the exchange management tools. Without installing this on our web server, is there any way to create a distribution list remotely? There are some third party components that allow you to create personal distribution lists, but these only live in a users Contacts folder and are not available to all users within the company.
Ideally there would be some kind of web services call to exchange or an API we could work with. The Exchange SDK provides the ability to managing Exchange data (e.g. emails, contacts, calendars etc.). There doesn't appear to be an Exchange management API.
It looks like the distribution lists in AD are just standard group objects with a few special Exchange attributes. Is there an API that I can use to manage the distribution lists in Active Directory without going through Exchange?
| 0 | [
2,
184,
92,
31,
1600,
1950,
2523,
968,
572,
14,
5027,
568,
13,
9,
2328,
60,
800,
3726,
3726,
95,
376,
20,
23288,
1600,
40,
1950,
624,
2523,
968,
37,
28,
306,
9,
2328,
9,
424,
28,
31,
92,
494,
15,
14,
104,
161,
20,
1600,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Generating an Excel file in ASP.NET
===
I am about to add a section to an ASP.NET app (VB.NET codebehind) that will allow a user to get data returned to them as an Excel file, which I will generate based on database data. While there are several ways of doing this, each has its own drawbacks. How would _you_ return the data? I'm looking for something that's as clean and straightforward as possible. | 0 | [
2,
13500,
40,
20700,
3893,
19,
28,
306,
9,
2328,
800,
3726,
3726,
31,
589,
88,
20,
3547,
21,
1050,
20,
40,
28,
306,
9,
2328,
4865,
13,
5,
20468,
9,
2328,
1797,
24878,
6,
30,
129,
1655,
21,
4155,
20,
164,
1054,
587,
20,
105,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
TDD and Mocking out TcpClient
===
How do people approach mocking out TcpClient (or things like TcpClient)?
I have a service that takes in a TcpClient. Should I wrap that in something else more mockable? How should I approach this? | 0 | [
2,
15596,
43,
17,
18446,
70,
13,
6668,
5779,
18513,
38,
800,
3726,
3726,
184,
107,
148,
2141,
18446,
70,
13,
6668,
5779,
18513,
38,
13,
5,
248,
564,
101,
13,
6668,
5779,
18513,
38,
6,
60,
31,
57,
21,
365,
30,
1384,
19,
21,
13,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Programmatically find the number of cores on a machine
===
This is more of a curiosity question than something that needs actual solving, but is there a way to determine how many cores a machine has from C++ in a platform-independent way? If no such thing exists, what about determining it per-platform (Windows/*nix/Mac)? | 0 | [
2,
625,
6732,
1326,
477,
14,
234,
16,
2884,
18,
27,
21,
1940,
800,
3726,
3726,
48,
25,
91,
16,
21,
11581,
1301,
119,
301,
30,
2274,
3463,
17533,
15,
47,
25,
80,
21,
161,
20,
3746,
184,
151,
2884,
18,
21,
1940,
63,
37,
272,
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 do I use for ChangeKey in EWS UpdateItem?
===
I'm trying to use Exchange Web Services to update a calendar item. I'm creating an ItemChangeType, and then an ItemIdType. I have a unique ID to use for ItemIdType.Id, but I have nothing to use for the ChangeKey. When I leave it out, I get an ErrorChangeKeyRequiredForWriteOperations. But when i try to just put something in there, I get an ErrorInvalidChangeKey.
What can I use for this to get it to work?
| 0 | [
2,
98,
107,
31,
275,
26,
753,
4237,
19,
13,
4460,
18,
11100,
2119,
79,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
275,
1950,
2741,
687,
20,
11100,
21,
7036,
9101,
9,
31,
22,
79,
2936,
40,
9101,
16229,
4474,
15,
17,
94,
40,
91... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you break into the debugger from Python source code?
===
What do you insert into Python source code to have it break into pdb (when execution gets to that spot)? | 0 | [
2,
184,
107,
42,
1442,
77,
14,
121,
2345,
11356,
37,
20059,
1267,
1797,
60,
800,
3726,
3726,
98,
107,
42,
14692,
77,
20059,
1267,
1797,
20,
57,
32,
1442,
77,
351,
9007,
13,
5,
3185,
5769,
3049,
20,
30,
1999,
6,
60,
3,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
text that only exists if css is enabled
===
I have a website in which I provide tooltips for certain things using a hidden <span> tag and javascript to track various mouse events. It works excellently. This site somewhat caters towards people with vision issues, so I try to make things degrade as well as possible if there is no javascript or css and generally I would say that it is successful in this regard.
So my question is, is it possible for these <span> to only exist if css is being used? I have though about writing out the tooltips in javacsript on document load. But I was wondering if there is a better solution. | 0 | [
2,
1854,
30,
104,
5636,
100,
272,
18,
18,
25,
9338,
800,
3726,
3726,
31,
57,
21,
2271,
19,
56,
31,
1181,
5607,
10169,
18,
26,
1200,
564,
568,
21,
3689,
279,
255,
38,
73,
18,
3206,
1569,
263,
38,
73,
3383,
17,
8247,
8741,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.NET File Sync Library
===
Is there a good .NET file syncing library? It can be pretty basic and only needs to work on local and mapped drives (no server client model like rsync is needed).
And yes, I know there is the MS Sync Services, but that is *a lot* more than what I need. | 0 | [
2,
13,
9,
2328,
3893,
6063,
150,
1248,
800,
3726,
3726,
25,
80,
21,
254,
13,
9,
2328,
3893,
6063,
6302,
1248,
60,
32,
92,
44,
1772,
2125,
17,
104,
2274,
20,
170,
27,
375,
17,
20877,
10396,
13,
5,
251,
8128,
6819,
1061,
101,
76... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Desktop Applications: Architectural Frameworks?
===
I was wondering if there are any architectural frameworks out there to create desktop or standalone applications, in Java or C# for instance. It seems that there are tons of them available for web applications but I can't find many good resources on frameworks or architectural best-practices for desktop development.
Ideally I would like to know if there is any source code available of desktop applications that would be considered to have a good architecture or a build with a certain framework. | 0 | [
2,
17404,
3767,
45,
5350,
6596,
18,
60,
800,
3726,
3726,
31,
23,
5712,
100,
80,
50,
186,
5350,
6596,
18,
70,
80,
20,
1600,
17404,
54,
26986,
3767,
15,
19,
8247,
54,
272,
5910,
26,
4851,
9,
32,
2206,
30,
80,
50,
5278,
16,
105,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the easiest way to read/manipulate query string params using javascript?
===
The examples I've seen online seem much more complex than I expected *(manually parsing &/?/= into pairs, using regular expressions, etc).* We're using asp.net ajax *(don't see anything in their client side reference)* and would consider adding jQuery if it would really help.
I would think there is a more elegant solution out there - so far [this is the best code I've found](http://www.bloggingdeveloper.com/post/JavaScript-QueryString-ParseGet-QueryString-with-Client-Side-JavaScript.aspx) but I would love to find something more along the lines of the HttpRequest.QueryString object *(asp.net server side)*. Thanks in advance,
Shane | 0 | [
2,
98,
25,
14,
27237,
161,
20,
1302,
118,
177,
4307,
12383,
25597,
3724,
2258,
79,
18,
568,
8247,
8741,
60,
800,
3726,
3726,
14,
3770,
31,
22,
195,
541,
2087,
2260,
212,
91,
1502,
119,
31,
1727,
1637,
5,
177,
291,
1326,
2017,
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... |
Will upgrading Php 5.2.5 to 5.2.6 result in any problems?
===
We're currently running with php 5.2.5. We have now encountered a bug that creates a seg fault. Our first idea at the solution is upgrading to version 5.2.6 but are skeptical of problems that it will create. We are running Apache and host a dozen or so sites.
- Will any existing code break?
- Are there any significant changes to be aware of. I was reading the change log but didn't notice any.
- Is it easy to revert back to 5.2.5 if something goes wrong?
- Anything else to be aware of?
| 0 | [
2,
129,
26939,
13,
26120,
331,
9,
135,
9,
264,
20,
331,
9,
135,
9,
379,
829,
19,
186,
1716,
60,
800,
3726,
3726,
95,
22,
99,
871,
946,
29,
13,
26120,
331,
9,
135,
9,
264,
9,
95,
57,
130,
8208,
21,
6256,
30,
9695,
21,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Generating 'neigbours' for users based on rating
===
I'm looking for techniques to generate 'neighbours' (people with similar taste) for users on a site I am working on; something similar to the way last.fm works.
Currently, I have a compatibilty function for users which could come into play. It ranks users on having 1) rated similar items 2) rated the item similarly. The function weighs point 2 heigher and this would be the most important if I had to use only one of these factors when generating 'neighbours'.
One idea I had would be to just calculate the compatibilty of every combination of users and selecting the highest rated users to be the neighbours for the user. The downside of this is that as the number of users go up then this process couls take a very long time. For just a 1000 users, it needs 1000C2 (0.5 * 1000 * 999 = = 499 500) calls to the compatibility function which could be very heavy on the server also.
So I am looking for any advice, links to articles etc on how best to achieve a system like this. | 0 | [
2,
13500,
13,
22,
556,
2816,
14251,
18,
22,
26,
3878,
432,
27,
4647,
800,
3726,
3726,
31,
22,
79,
699,
26,
4212,
20,
7920,
13,
22,
556,
6872,
14251,
18,
22,
13,
5,
10171,
29,
835,
3576,
6,
26,
3878,
27,
21,
689,
31,
589,
638... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tracking Globalization progress
===
With our next major release we are looking to globalize our ASP.Net application and I was asked to think of a way to keep track of what code has been already worked on in this effort.
My thought was to use a custom Attribute and place it on all classes that have been "fixed".
What do you think?
Does anyone have a better idea? | 0 | [
2,
10353,
27175,
3455,
800,
3726,
3726,
29,
318,
328,
394,
830,
95,
50,
699,
20,
2062,
2952,
318,
28,
306,
9,
2328,
3010,
17,
31,
23,
411,
20,
277,
16,
21,
161,
20,
643,
792,
16,
98,
1797,
63,
74,
614,
577,
27,
19,
48,
2150,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Retrieve NTLM Active Directory user data to Rails w/o IIS
===
I believe that we can allow Firefox to sent NTLM data to SharePoint sites to do automatic authentication, and I think that this is doable with IIS.
I'd like to do the same thing with an internal Rails site.
Does anyone know of way that I could authenticate NTLM type user information through a Apache/mongrel setup (provided of course that it's already running on a Windows box inside of an Active Directory domain)?
| 0 | [
2,
11917,
13,
2877,
10363,
1348,
16755,
4155,
1054,
20,
2240,
18,
619,
118,
111,
595,
18,
800,
3726,
3726,
31,
985,
30,
95,
92,
1655,
535,
18219,
20,
795,
13,
2877,
10363,
1054,
20,
1891,
3132,
3259,
20,
107,
6715,
27963,
15,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ruby on Rails Content Management Systems?
===
Is there a viable open source Ruby on Rails content management system out there?
I need a CMS with the ability to manage structured content, content relationships, classification (structured taxonomy and free tagging) and simple publishing workflow. I'd prefer the content ultimately be persisted as XML. Also content needs to be abstracted away from the page(s) it's published.
Thanks,
Mike | 4 | [
2,
10811,
27,
2240,
18,
2331,
1097,
1242,
60,
800,
3726,
3726,
25,
80,
21,
17347,
368,
1267,
10811,
27,
2240,
18,
2331,
1097,
329,
70,
80,
60,
31,
376,
21,
2390,
18,
29,
14,
2165,
20,
4705,
17784,
2331,
15,
2331,
5833,
15,
4039,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can a Sequence Diagram realistically capture your logic in the same depth as code?
===
I use UML Sequence Diagrams all the time, and am familiar with the UML2 notation.
But I only ever use them to capture the essence of what I intend to do. In other words the diagram always exists at a level of abstraction above the actual code. Every time I use them to try and describe **exactly** what I intend to do I end up using so much horizontal space and so many alt/loop frames that its not worth the effort.
So it may be possible in theory but has anyone every really used the diagram in this level of detail? If so can you provide an example please?
| 0 | [
2,
92,
21,
4030,
14161,
12786,
1326,
3683,
154,
7085,
19,
14,
205,
5204,
28,
1797,
60,
800,
3726,
3726,
31,
275,
13,
723,
255,
4030,
14161,
18,
65,
14,
85,
15,
17,
589,
3694,
29,
14,
13,
723,
255,
135,
15591,
9,
47,
31,
104,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I detect when someone shakes an iPhone?
===
I want to react when somebody shakes the iPhone. I don't particularly care how they shake it, just that it was waved vigorously about for a split second. Does anyone know how to detect this? | 0 | [
2,
184,
107,
31,
9092,
76,
737,
11957,
40,
21024,
60,
800,
3726,
3726,
31,
259,
20,
7749,
76,
8861,
11957,
14,
21024,
9,
31,
221,
22,
38,
1653,
781,
184,
59,
4657,
32,
15,
114,
30,
32,
23,
6433,
24251,
88,
26,
21,
2132,
153,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 some way to make variables like $a and $b in regard to strict?
===
I like <tt>strict</tt>. I use strict, especially in development.
I know that strict allows unqualified use of <tt>$a</tt> and <tt>$b</tt> without complaining. I have a module that I think provides clean code for processing hashes, and I know how to manage the creation and deletion of local <tt>$k</tt> and <tt>$v</tt> (which intuitively stand for *key* and *value*).
Why doesn't <tt>strict</tt> understand the TMTOWTDI principle?
It seems like there should be some way to make it work like this:
use strict accept => [ qw<k v> ];
| 0 | [
2,
25,
80,
109,
161,
20,
233,
12157,
101,
5579,
58,
17,
5579,
220,
19,
6731,
20,
8170,
60,
800,
3726,
3726,
31,
101,
13,
1,
38,
38,
1,
27245,
1,
118,
38,
38,
1,
9,
31,
275,
8170,
15,
1118,
19,
522,
9,
31,
143,
30,
8170,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Interfacing with Compris POS
===
Does anyone have any data on how to interface with a Compris POS? I have a Compris POS, and I need to grab data from the database. I can't get information from NCR regarding the underlying data format, and I was wondering if anyone had reverse engineered the device, or had any documentation on the device. | 0 | [
2,
1480,
17231,
29,
6479,
2777,
12928,
800,
3726,
3726,
630,
1276,
57,
186,
1054,
27,
184,
20,
6573,
29,
21,
6479,
2777,
12928,
60,
31,
57,
21,
6479,
2777,
12928,
15,
17,
31,
376,
20,
4931,
1054,
37,
14,
6018,
9,
31,
92,
22,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Order of items in classes: Fields, Properties, Constructors, Methods
===
Is there a C# official guideline for the order of items in terms of class structure?
Does it go:
- Public Fields
- Private Fields
- Properties
- Constructors
- Methods
?
I threw together a quick Timer class at RefactorMyCode.com:
[http://refactormycode.com/codes/507-timer-class#refactor_39149][1]
And I'm curious if there is a hard and fast rule about the order of items? I'm kind of all over the place. I want to stick with a particular standard so I can do it everywhere.
Any tips/suggestions?
[1]: http://refactormycode.com/codes/507-timer-class#refactor_39149 | 0 | [
2,
389,
16,
3755,
19,
2684,
45,
2861,
15,
3704,
15,
6960,
248,
18,
15,
3195,
800,
3726,
3726,
25,
80,
21,
272,
5910,
989,
3378,
1143,
26,
14,
389,
16,
3755,
19,
1663,
16,
718,
1411,
60,
630,
32,
162,
45,
13,
8,
317,
2861,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Adding AutoComplete to an Infragisitcs UltraDateTimeEditor control
===
I'm attempting to modify an Infragisitcs UltraDateTimeEditor control so that the current year and a default time are inserted when the user only enters values for the month and day.
The control has an AutoFillDate property, however setting this to "year" seems to overwrite user input entirely. Also changing the InvalidTextBehavior doesn't seem to help since the control stops out empty.
What event(s) would I need to modify in order get the fill-in data to populate before the validation reverts to an empty string? | 0 | [
2,
4721,
3108,
15990,
20,
40,
19,
22133,
11368,
6668,
18,
6885,
8209,
891,
13401,
569,
800,
3726,
3726,
31,
22,
79,
6314,
20,
17579,
40,
19,
22133,
11368,
6668,
18,
6885,
8209,
891,
13401,
569,
86,
30,
14,
866,
159,
17,
21,
12838,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Slicehost installation profile
===
I'm no UNIX Guru, but I've had to set up a handful of slices for various web projects. I've used the articles on there to set up users, a basic firewall, nginx or apache, and other bits and pieces of a basic web server.
I foresee more slice administration in my future. **Is there a more efficient way to set up users, permissions, and software on a clean slice than configuration by hand?** | 0 | [
2,
12982,
11694,
7758,
5296,
800,
3726,
3726,
31,
22,
79,
90,
22540,
10334,
15,
47,
31,
22,
195,
41,
20,
309,
71,
21,
8893,
16,
12982,
18,
26,
617,
2741,
2314,
9,
31,
22,
195,
147,
14,
3376,
27,
80,
20,
309,
71,
3878,
15,
21... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Django: Capturing url parameters in request.GET
===
I am currently defining regular expressions in order to capture parameters in a url, as described in the tutorial. How do I access parameters from the url as part the HttpRequest object? My HttpRequest.GET currently returns an empty QueryDict object.
I'd like to learn how to do this without a library so I can get to know Django better. | 0 | [
2,
3857,
14541,
45,
12859,
287,
6362,
12905,
19,
3772,
9,
3060,
800,
3726,
3726,
31,
589,
871,
14684,
1290,
13832,
19,
389,
20,
3683,
12905,
19,
21,
287,
6362,
15,
28,
745,
19,
14,
29724,
9,
184,
107,
31,
1381,
12905,
37,
14,
28... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Get list of available Windows audio file formats
===
I've got a C# program that's supposed to play audio files. I've figured out how to play any sound file for which Windows has a codec by using DirectShow, but now I want to properly fill in the filter box on the Open dialog. I'd like to automatically list any file format for which Windows has a codec. If some random user installs a codec for an obscure format, it needs to show up in the list.
Any ideas? | 0 | [
2,
164,
968,
16,
904,
1936,
4023,
3893,
13767,
800,
3726,
3726,
31,
22,
195,
330,
21,
272,
5910,
625,
30,
22,
18,
2293,
20,
418,
4023,
6488,
9,
31,
22,
195,
5700,
70,
184,
20,
418,
186,
646,
3893,
26,
56,
1936,
63,
21,
1797,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
HTML input style to hide the box but show the contents
===
I have a form in HTML where our users fill in the data and then print it. The data isn't saved anywhere. These forms come from outside our company and are built as html pages to resemble the original as closely as possible and then stuffed away and forgotten in a folder on the intranet. Normally another developer does them, but I have to do a few while he's out. Looking through his code, all his forms have a bunch of server-side code to take the inputs and re-write the page with only the contents. It seems like there should be a better way.
I want to find to style the text inputs using a media selector so that when it prints you can see the text, but nothing of the box surrounding it. Any thoughts? | 0 | [
2,
13,
15895,
6367,
1034,
20,
3077,
14,
1649,
47,
298,
14,
8478,
800,
3726,
3726,
31,
57,
21,
505,
19,
13,
15895,
113,
318,
3878,
3509,
19,
14,
1054,
17,
94,
4793,
32,
9,
14,
1054,
2532,
22,
38,
4377,
4922,
9,
158,
1997,
340,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Custom method in model to return an object
===
In the database I have a field named 'body' that has an XML in it. The
method I created in the model looks like this:
def self.get_personal_data_module(person_id)
person_module = find_by_person_id(person_id)
item_module = Hpricot(person_module.body)
personal_info = Array.new
personal_info = {:studies => (item_module/"studies").inner_html,
:birth_place => (item_module/"birth_place").inner_html,
:marrital_status => (item_module/"marrital_status").inner_html}
return personal_info
end
I want the function to return an object instead of an array. So I can
use Module.studies instead of Model[:studies].
Thank you for your time.
Silviu
p.s I am new to rails and ruby. I have a C background. | 0 | [
2,
5816,
2109,
19,
1061,
20,
788,
40,
3095,
800,
3726,
3726,
19,
14,
6018,
31,
57,
21,
575,
377,
13,
22,
9760,
22,
30,
63,
40,
23504,
19,
32,
9,
14,
2109,
31,
679,
19,
14,
1061,
1879,
101,
48,
45,
6312,
1119,
9,
3060,
1,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Send file using POST from a Python script
===
This is an almost-duplicate of [http://stackoverflow.com/questions/68477/send-file-using-post-from-a-python-script][1], but I'd like to add a caveat: I need something that properly handles the encoding of fields and attached files. The solutions I've been able to find blow up when you throw unicode strings containing non-ascii characters into the mix. Also, most of the solutions don't base64-encode data to keep things 7-bit clean.
[1]: http://stackoverflow.com/questions/68477/send-file-using-post-from-a-python-script | 0 | [
2,
2660,
3893,
568,
678,
37,
21,
20059,
3884,
800,
3726,
3726,
48,
25,
40,
557,
8,
2323,
26811,
16,
636,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
4279,
2918,
9816,
18,
2451,
8,
16877,
8,
12655,
8,
6962,
8,
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... |
Restlet - serving up static content
===
Using Restlet I needed to serve some simple static content in the same context as my web service. I've configured the component with a Directory, but in testing, I've found it will only serve 'index.html', everything else results in a 404.
router.attach("/", new Directory(context, new Reference(baseRef, "./content"));
So...
http://service and http://service/index.html both work,
but
http://service/other.html gives me a 404
Can anyone shed some light on this? I want any file within the ./content directory to be available.
PS: I eventually plan to use a reverse proxy and serve all static content off another web server, but for now I need this to work as is.
[1]: http://www.restlet.org/
[2]: https://jersey.dev.java.net/ | 0 | [
2,
760,
1336,
13,
8,
1799,
71,
12038,
2331,
800,
3726,
3726,
568,
760,
1336,
31,
851,
20,
1884,
109,
1935,
12038,
2331,
19,
14,
205,
4141,
28,
51,
2741,
365,
9,
31,
22,
195,
28895,
14,
5912,
29,
21,
16755,
15,
47,
19,
4431,
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... |
Looking to Read Bytes from File in Python
===
Similar to [this](http://stackoverflow.com/questions/5415/convert-bytes-to-floating-point-numbers-in-python) question, I am trying to read in an ID3v2 tag header and am having trouble figuring out how to get individual bytes in python.
I first read all ten bytes into a string. I then want to parse out the individual pieces of information.
I can grab the two version number chars in the string, but then I have no idea how to take those two chars and get an integer out of them.
The struct package seems to be what I want, but I can't get it to work. | 0 | [
2,
699,
20,
1302,
34,
3231,
37,
3893,
19,
20059,
800,
3726,
3726,
835,
20,
636,
1565,
500,
5,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
18133,
20284,
118,
1126,
8122,
8,
23246,
18,
8,
262,
8,
14712,
1880,
8,
3132,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Jagged Button edges in Internet Explorer
===
How do you remove the jagged edges from a wide button in internet explorer? For example:
![alt text][1]
[1]: http://latrine.dgx.cz/images/explorer-buttons6-en.gif | 0 | [
2,
20409,
5167,
7840,
19,
2620,
8520,
800,
3726,
3726,
184,
107,
42,
4681,
14,
20409,
7840,
37,
21,
1051,
5167,
19,
2620,
8520,
60,
26,
823,
45,
13,
187,
2558,
192,
38,
1854,
500,
2558,
165,
500,
636,
165,
500,
45,
7775,
6903,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How robust is the asp.net profile system? Is it ready for prime time?
===
I've used asp.net profiles (using the AspNetSqlProfileProvider) for holding small bits of information about my users. I started to wonder how it would handle a robust profile for a large number of users. Does anyone have experience using this on a large website with large numbers of simultaneous users? What are the performance implications? How about maintenance? | 0 | [
2,
184,
15313,
25,
14,
28,
306,
9,
2328,
5296,
329,
60,
25,
32,
1451,
26,
1621,
85,
60,
800,
3726,
3726,
31,
22,
195,
147,
28,
306,
9,
2328,
5296,
18,
13,
5,
12655,
14,
28,
306,
2328,
18,
22402,
14503,
26735,
139,
6,
26,
133... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Forward an invocation of a variadic function in C
===
In C, is it possible to forward the invocation of a variadic function? As in,
<pre>int my_printf(char *fmt, ...) {
fprintf(stderr, "Calling printf with fmt %s", fmt);
return SOMEHOW_INVOKE_LIBC_PRINTF;
}
</pre>
Forwarding the invocation in the manner above obviously isn't strictly necessary in this case (since you could log invocations in other ways, or use vfprintf), but the codebase I'm working on requires the wrapper to do some actual work, and doesn't have (and can't have added) a helper function akin to vfprintf. | 0 | [
2,
917,
40,
19,
2625,
16893,
16,
21,
4033,
549,
4673,
1990,
19,
272,
800,
3726,
3726,
19,
272,
15,
25,
32,
938,
20,
917,
14,
19,
2625,
16893,
16,
21,
4033,
549,
4673,
1990,
60,
28,
19,
15,
13,
1,
3515,
1,
6391,
51,
1,
10299,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can you catch a native exception in C# code?
===
In C# code can you catch a native exception thrown from deep in some unmanaged library? If so do you need to do anything differently to catch it or does a standard try...catch get it? | 0 | [
2,
92,
42,
2949,
21,
1275,
5391,
19,
272,
5910,
1797,
60,
800,
3726,
3726,
19,
272,
5910,
1797,
92,
42,
2949,
21,
1275,
5391,
6027,
37,
855,
19,
109,
367,
177,
8030,
1248,
60,
100,
86,
107,
42,
376,
20,
107,
602,
12670,
20,
29... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... |
In ActionScript (NaN==parseFloat(input.text)) warns that it will always be false. Why?
===
Despite the rather clear [documentation](http://www.adobe.com/support/flash/action_scripts/actionscript_dictionary/actionscript_dictionary620.html) which says that parseFloat() can return NaN as a value, when I write a block like:
if ( NaN == parseFloat(input.text) ) {
errorMessage.text = "Please enter a number."
}
I am warned that the comparison will always be false. And testing shows the warning to be correct.
Where is the corrected documentation, and how can I write this to work with AS3?
| 0 | [
2,
19,
1028,
8741,
13,
5,
3198,
3726,
3726,
3574,
870,
14712,
721,
5,
108,
4881,
9,
11969,
6,
6,
9296,
18,
30,
32,
129,
550,
44,
4997,
9,
483,
60,
800,
3726,
3726,
869,
14,
864,
1207,
636,
28132,
857,
500,
5,
21127,
6903,
6483... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Executing dynamic SQL in a SQLServer 2005 function
===
I will preface this question by saying, I do not think it is solvable. I also have a workaround, I can create a stored procedure with an OUTPUT to accomplish this, it is just easier to code the sections where I need this checksum using a function.
This code will not work because of the Exec SP_ExecuteSQL @SQL calls. Anyone know how to execute dynamic SQL in a function? (and once again, I do not think it is possible. If it is though, I'd love to know how to get around it!)
/***##SQL##***/
Create Function Get_Checksum
(
@DatabaseName varchar(100),
@TableName varchar(100))
RETURNS FLOAT
as
BEGIN
Declare @SQL nvarchar(4000)
Declare @ColumnName varchar(100)
Declare @i int
Declare @Checksum float
Declare @intColumns table (idRecord int identity(1,1), ColumnName varchar(255))
Declare @CS table (MyCheckSum bigint)
Set @SQL =
'Insert Into @IntColumns(ColumnName)' + Char(13) +
'Select Column_Name' + Char(13) +
'From ' + @DatabaseName + '.Information_Schema.Columns (NOLOCK)' + Char(13) +
'Where Table_Name = ''' + @TableName + '''' + Char(13) +
' and Data_Type = ''int'''
-- print @SQL
exec sp_executeSql @SQL
Set @SQL =
'Insert Into @CS(MyChecksum)' + Char(13) +
'Select '
Set @i = 1
While Exists(
Select 1
From @IntColumns
Where IdRecord = @i)
begin
Select @ColumnName = ColumnName
From @IntColumns
Where IdRecord = @i
Set @SQL = @SQL + Char(13) +
CASE WHEN @i = 1 THEN
' Sum(Cast(IsNull(' + @ColumnName + ',0) as bigint))'
ELSE
' + Sum(Cast(IsNull(' + @ColumnName + ',0) as bigint))'
END
Set @i = @i + 1
end
Set @SQL = @SQL + Char(13) +
'From ' + @DatabaseName + '..' + @TableName + ' (NOLOCK)'
-- print @SQL
exec sp_executeSql @SQL
Set @Checksum = (Select Top 1 MyChecksum From @CS)
Return isnull(@Checksum,0)
END
GO
/***##END SQL##***/ | 0 | [
2,
25836,
7782,
4444,
255,
19,
21,
4444,
255,
10321,
106,
812,
1990,
800,
3726,
3726,
31,
129,
20910,
48,
1301,
34,
1148,
15,
31,
107,
52,
277,
32,
25,
86,
8916,
579,
9,
31,
67,
57,
21,
170,
10037,
15,
31,
92,
1600,
21,
8214,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the minimum length number the luhn algorithm will work on?
===
Excluding the check digit, what is the minimum length number the luhn algorithm will work on?
My thoughts are that it would work on any number greater than 2 digits (again, excluding the check digit).
The reason I ask is because if i have a condition like i%2 == 0, to find alternating positions in the number; it will fail if the number is equal to or less than 3 digits (e.g. 125). Does this mean I need to implement how alternating digits are figured out differently? | 0 | [
2,
98,
25,
14,
5187,
1476,
234,
14,
1612,
5905,
9083,
129,
170,
27,
60,
800,
3726,
3726,
13,
14938,
14,
2631,
15611,
15,
98,
25,
14,
5187,
1476,
234,
14,
1612,
5905,
9083,
129,
170,
27,
60,
51,
3064,
50,
30,
32,
83,
170,
27,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
RSS or ATOM to syndicate content?
===
Which is best? I always produce ATOM feeds, as they seem more comprehensive, but I'm not sure whichh is technically better. | 0 | [
2,
13,
1224,
18,
54,
14571,
20,
17013,
2331,
60,
800,
3726,
3726,
56,
25,
246,
60,
31,
550,
2213,
14571,
17058,
15,
28,
59,
2260,
91,
7041,
15,
47,
31,
22,
79,
52,
562,
56,
252,
25,
12345,
574,
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,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to find out if a Timer is running?
===
If I have an instance of a System.Timers.Timer that has a long interval - say 1 minute, how can I find out if it is started without waiting for the Tick? | 0 | [
2,
184,
20,
477,
70,
100,
21,
85,
139,
25,
946,
60,
800,
3726,
3726,
100,
31,
57,
40,
4851,
16,
21,
329,
9,
891,
1224,
9,
891,
139,
30,
63,
21,
175,
14422,
13,
8,
395,
137,
2038,
15,
184,
92,
31,
477,
70,
100,
32,
25,
37... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Which browser has the best support for HTML 5 currently?
===
Where can I test HTML 5 functionality today - is there any test build of any rendering engines which would allow testing, or is it to early? I'm aware that much of the spec hasn't been finalised, but some has, and it would be good to try it out! | 3 | [
2,
56,
16495,
63,
14,
246,
555,
26,
13,
15895,
331,
871,
60,
800,
3726,
3726,
113,
92,
31,
1289,
13,
15895,
331,
18548,
786,
13,
8,
25,
80,
186,
1289,
1895,
16,
186,
15307,
4016,
56,
83,
1655,
4431,
15,
54,
25,
32,
20,
274,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When to use IEnumerable over IEnumerable<>
===
Due to the lack of generic variance in the .NET framework, is it more "correct" to have methods that handle the non-generic versions of the System.Collection interfaces, if the methods are being designed to handle multiple types?
Ideally, once moved to .NET 3.5, the code would modified to change these methods into extension methods. | 0 | [
2,
76,
20,
275,
13,
660,
6336,
106,
579,
84,
13,
660,
6336,
106,
579,
1,
800,
3726,
3726,
397,
20,
14,
1792,
16,
12733,
24619,
19,
14,
13,
9,
2328,
6596,
15,
25,
32,
91,
13,
7,
25345,
7,
20,
57,
3195,
30,
3053,
14,
538,
8,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How much difference does BLOB make in comparison with VARCHAR()?
===
If I don't know the length of a text entry (e.g. a blog post, description or other long text), what's the best way to store it in MYSQL? | 0 | [
2,
184,
212,
2841,
630,
334,
10904,
233,
19,
6050,
29,
4033,
5433,
5,
6,
60,
800,
3726,
3726,
100,
31,
221,
22,
38,
143,
14,
1476,
16,
21,
1854,
2792,
13,
5,
62,
9,
263,
9,
21,
8146,
678,
15,
5318,
54,
89,
175,
1854,
6,
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,
0... |
Using Alfresco Communtiy in production?
===
Anyone out there using the community (not enterprise subscription) version of Alfresco in production? Anyone with an enterprise subscription have any comments on doing so? | 0 | [
2,
568,
14307,
99,
8328,
13,
14869,
1388,
93,
19,
637,
60,
800,
3726,
3726,
1276,
70,
80,
568,
14,
514,
13,
5,
1270,
6002,
14213,
6,
615,
16,
14307,
99,
8328,
19,
637,
60,
1276,
29,
40,
6002,
14213,
57,
186,
7534,
27,
845,
86,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Whats the best way to start using Mylyn?
===
I've heard a lot of good things about Mylyn in eclipse.
What should I try and set up to give me a taste of how I could use it?
Thanks
| 0 | [
2,
98,
18,
14,
246,
161,
20,
799,
568,
51,
4859,
60,
800,
3726,
3726,
31,
22,
195,
752,
21,
865,
16,
254,
564,
88,
51,
4859,
19,
11652,
9,
98,
378,
31,
1131,
17,
309,
71,
20,
590,
55,
21,
3576,
16,
184,
31,
110,
275,
32,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to select from Varchar where where `Value` is not part of a group
===
I'm trying to do this
SELECT `Name`,`Value` FROM `Constants` WHERE `Name` NOT IN ('Do not get this one'|'or this one');
But it doesn't seem to work.
How do I get all the values, except for a select few, without doing this:
SELECT `Name`,`Value` FROM `Constants` WHERE `Name` != 'Do not get this one' AND `Name` != 'or this one'
The first one works with int values, but doesn't work with varchar, is there a syntax like the first one, that performs like the second query? | 0 | [
2,
184,
20,
5407,
37,
4033,
5433,
113,
113,
13,
1,
15165,
1,
25,
52,
141,
16,
21,
214,
800,
3726,
3726,
31,
22,
79,
749,
20,
107,
48,
5407,
13,
1,
7259,
1,
15,
1,
15165,
1,
37,
13,
1,
29639,
18,
1,
113,
13,
1,
7259,
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 are the built in functions in PHP so randomly named?
===
It seems that there is no real pattern to the way functions are named, str_replace, strrpos, strip_tags, stripslashes are just some.
Why is this the case? | 0 | [
2,
483,
50,
14,
392,
19,
3719,
19,
13,
26120,
86,
21324,
377,
60,
800,
3726,
3726,
32,
2206,
30,
80,
25,
90,
683,
3732,
20,
14,
161,
3719,
50,
377,
15,
13,
9729,
1,
99,
5119,
15,
354,
5932,
12551,
15,
4998,
1,
8628,
18,
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,
0,
0,
0... |
Ruby off the rails
===
Sometimes it feels that my company is the only company in the world using Ruby but not Ruby on Rails, to the point that Rails has almost become synonymous with Ruby.
I'm sure this isn't really true, but it'd be fun to hear some stories about non-Rails Ruby usage out there. | 0 | [
2,
10811,
168,
14,
2240,
18,
800,
3726,
3726,
1030,
32,
5121,
30,
51,
237,
25,
14,
104,
237,
19,
14,
126,
568,
10811,
47,
52,
10811,
27,
2240,
18,
15,
20,
14,
454,
30,
2240,
18,
63,
557,
533,
24459,
29,
10811,
9,
31,
22,
79,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When ThreadPool.QueueUserWorkItem returns false
===
The MSDN states that the method returns
> true if the method is successfully
> queued; NotSupportedException is
> thrown if the work item is not queued.
For testing purposes how to get the method to return false? Or it is just a "suboptimal" class design? | 0 | [
2,
76,
9322,
13378,
9,
2005,
4185,
16704,
3783,
2119,
79,
4815,
4997,
800,
3726,
3726,
14,
4235,
43,
103,
202,
30,
14,
2109,
4815,
13,
1,
1151,
100,
14,
2109,
25,
3673,
13,
1,
22521,
43,
73,
52,
24909,
10066,
872,
25,
13,
1,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How Do I Create a New Excel File Using JXL?
===
I'm trying to create a new Excel file using jxl, but am having a hard time finding examples in their API documentation and online. | 0 | [
2,
184,
107,
31,
1600,
21,
78,
20700,
3893,
568,
487,
396,
255,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
1600,
21,
78,
20700,
3893,
568,
487,
396,
255,
15,
47,
589,
452,
21,
552,
85,
3007,
3770,
19,
66,
21,
2159,
13945,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to create a custom log filter in enterprise library 4.0?
===
I am using Enterprise Library 4.0 and I can't find any documentation on creating a custom logging filter. Has anyone done this or seen any good online documentation on this? | 0 | [
2,
184,
20,
1600,
21,
5816,
6738,
11945,
19,
6002,
1248,
268,
9,
387,
60,
800,
3726,
3726,
31,
589,
568,
6002,
1248,
268,
9,
387,
17,
31,
92,
22,
38,
477,
186,
13945,
27,
2936,
21,
5816,
13,
13919,
11945,
9,
63,
1276,
677,
48,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0... |
Microformats, RDF, Dublin Core or other types of sematic markup?
===
Do you use any of these technologies? Which ones are current and hence sensible to include in a site?
Documentation on any seems to be relatively sparse, and usage of any of them limited, as search engines get better, are they even relevant any more? | 0 | [
2,
2899,
23588,
18,
15,
13,
897,
410,
15,
4571,
2884,
54,
89,
2551,
16,
1353,
6732,
943,
576,
60,
800,
3726,
3726,
107,
42,
275,
186,
16,
158,
5740,
60,
56,
53,
18,
50,
866,
17,
5796,
24599,
20,
468,
19,
21,
689,
60,
13945,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Find the prefix substring which gives best compression
===
**Problem:**
Given a list of strings, find the substring which, if subtracted from the beginning of all strings where it matches and replaced by an escape byte, gives the shortest total length.
**Example:**
`"foo"`, `"fool"`, `"bar"`
The result is: "foo" as the base string with the strings `"\0"`, `"\0l"`, `"bar"` and a total length of 9 bytes. `"\0"` is the escape byte. The sum of the length of the original strings is 10, so in this case we only saved one byte.
**A naive algorithm would look like:**
for string in list
for i = 1, i < length of string
calculate total length based on prefix of string[0..i]
if better than last best, save it
return the best prefix
That will give us the answer, but it's something like O((n*m)^2), which is too expensive. | 0 | [
2,
477,
14,
14315,
972,
11130,
56,
2352,
246,
14864,
800,
3726,
3726,
13,
1409,
2740,
2854,
79,
45,
1409,
504,
21,
968,
16,
7887,
15,
477,
14,
972,
11130,
56,
15,
100,
27031,
69,
37,
14,
997,
16,
65,
7887,
113,
32,
1717,
17,
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... |
Where are all the places Sql Reporting Server Logs Errors?
===
It seems like Sql Reporting Services Server logs information in several places including web server logs and logging tables in the database. Where are all the locations SSRS logs to, and what type of errors are logged in each place?
| 0 | [
2,
113,
50,
65,
14,
1489,
4444,
255,
6670,
8128,
18893,
11908,
60,
800,
3726,
3726,
32,
2206,
101,
4444,
255,
6670,
687,
8128,
18893,
676,
19,
238,
1489,
215,
2741,
8128,
18893,
17,
13,
13919,
7484,
19,
14,
6018,
9,
113,
50,
65,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why is dd better than cat?
===
Suppose I want to clone my hard drive (`hda`) to another drive (`hdb`) in the same computer. As I see it, there's two easy, rough and do-it-yourself ways:
<pre>cat /dev/hda > /dev/hdb</pre>
and
<pre>dd if=/dev/hda of=/dev/hdb</pre>
What technical reasons are there to that the latter is often/always said to be better than the former?
_under no circumstances try these commands at home, or your UNIX is fubar'd_ | 0 | [
2,
483,
25,
13,
8096,
574,
119,
2008,
60,
800,
3726,
3726,
5787,
31,
259,
20,
13871,
51,
552,
1493,
13,
5,
1,
252,
593,
1,
6,
20,
226,
1493,
13,
5,
1,
252,
9007,
1,
6,
19,
14,
205,
1428,
9,
28,
31,
196,
32,
15,
80,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.