unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Avoiding Mixup of Language Details
===
Today someone asked me what was wrong with their source code. It was obvious. "Use double equals in place of that single equal in that if statement. Um, i think..." As i remember some languages actually take a single equals for comparison. Since i sometimes forget or mix up the syntax details among the several languages i use, i stepped over to my laptop to try a quickie experiment...
It costs a bit of time and is a break in the flow to try "quick" experiments (though maybe the practice is good for memory.) What tips do you have for keeping straight in your mind the syntax (and other) details of multiple languages?
(And nowadays, this applies just as well to the many wiki-like markups!) | 0 | [
2,
10298,
2917,
576,
16,
816,
3289,
800,
3726,
3726,
786,
737,
411,
55,
98,
23,
1389,
29,
66,
1267,
1797,
9,
32,
23,
4674,
9,
13,
7,
3699,
1494,
2747,
18,
19,
209,
16,
30,
345,
2747,
19,
30,
100,
3331,
9,
13,
723,
15,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I Fail a WebTest?
===
I'm using Microsoft WebTest and want to be able to do something similar to NUnit's `Assert.Fail()`. The best i have come up with is to `throw new webTestException()` but this shows in the test results as an `Error` rather than a `Failure`.
Other than reflecting on the `WebTest` to set a private member variable to indicate the failure, is there something I've missed? | 0 | [
2,
184,
92,
31,
7476,
21,
2741,
10543,
60,
800,
3726,
3726,
31,
22,
79,
568,
7099,
2741,
10543,
17,
259,
20,
44,
777,
20,
107,
301,
835,
20,
10210,
242,
22,
18,
13,
1,
22220,
38,
9,
24910,
5,
6,
1,
9,
14,
246,
31,
57,
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... |
iframe shimming or ie6 (and below) select z-index bug
===
uhm im not sure if anyone has encountered this problem <br>
a brief description is on IE6 any `<select>` objects get displayed over any other item, even div's... meaning if you have a fancy javascript effect that displays a div that's supposed to be on top of everything (e.g: lightbox, multibox etc..) onclick of a certain element and that div overlaps a `<select>` your div get's to be displayed as if its under the `<select>` [on this case a max and minimum z-index doesnt work ]
i've tried googling and found the iframe shim solution <br>
but i wanted some pretty clean alternatives
or better yet has anyone found a better solution? | 0 | [
2,
31,
8361,
17279,
3863,
54,
13,
660,
379,
13,
5,
290,
1021,
6,
5407,
2052,
8,
25671,
6256,
800,
3726,
3726,
10863,
79,
797,
52,
562,
100,
1276,
63,
8208,
48,
1448,
13,
1,
5145,
1,
21,
2698,
5318,
25,
27,
13,
660,
379,
186,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
No suitable MySQL driver found for JBoss application
===
I am new to creating Java web applications and came across this problem when trying to interact with my database (called ccdb) through my application:
`java.sql.SQLException: No suitable driver found for jdbc:mysql://localhost/ccdb/`
My application runs on JBoss and uses Hibernate to interact with the MySQL database. I have the MySQL Driver in lib\mysql-connector-java-5.1.6-bin.jar of my project and I have the .jar configured in Eclipse as a "Java EE Module Dependency" so that it gets copied over to web-inf\lib\ when I deploy it to JBoss through Eclipse. I double checked and the driver is definitely in the .war file with the project, so it should be findable, right?
My hibernate.cfg.xml contains this line which should point hibernate to the driver.
`<property name="hibernate.connection.driver_class">com.mysql.jdbc.Driver</property>`
Does anyone know what I need to do to get this to work?
Thanks in advance.
| 0 | [
2,
90,
6445,
51,
18,
22402,
2425,
216,
26,
487,
10349,
18,
3010,
800,
3726,
3726,
31,
589,
78,
20,
2936,
8247,
2741,
3767,
17,
281,
464,
48,
1448,
76,
749,
20,
10001,
29,
51,
6018,
13,
5,
4580,
8093,
9007,
6,
120,
51,
3010,
45... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get a webserice to serialize/deserialize the same type in .net
===
I want to use typed parameters in the web methods. But when visual studio 2005 creates the web reference on for the client it automatically creates it's own types. I am using a .net web service and a .net client.
For example:
< WebMethod > _
Public Function Foo() as ServerNamespace.Bar
...
End Function
at the client the method becomes
WebServiceInstance.Foo() as ClientNamespace.Webservice.Bar
returning a different type.
I started writing my own serialization helper class to convert the type, but I would have thought there would be a better way....
| 0 | [
2,
184,
20,
164,
21,
2741,
870,
12412,
20,
5956,
2952,
118,
3196,
106,
2815,
2952,
14,
205,
1001,
19,
13,
9,
2328,
800,
3726,
3726,
31,
259,
20,
275,
1001,
43,
12905,
19,
14,
2741,
3195,
9,
47,
76,
3458,
1120,
812,
9695,
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... |
It is possible to use Full Text Search (FTS) with LINQ?
===
I wonder if is possible to use FTS with LINQ using .NET Framework 3.5. I'm searching around the documentation that I didn't find anything useful yet.
Does anyone have any experience on this? | 0 | [
2,
32,
25,
938,
20,
275,
503,
1854,
2122,
13,
5,
3072,
18,
6,
29,
6294,
1251,
60,
800,
3726,
3726,
31,
2666,
100,
25,
938,
20,
275,
1187,
18,
29,
6294,
1251,
568,
13,
9,
2328,
6596,
203,
9,
264,
9,
31,
22,
79,
5792,
140,
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... |
Creating a custom Hibernate UserType - What does isMutable() mean?
===
I am creating a custom UserType in Hibernate for a project. It has been relatively straightforward until I came to the isMutable method. I am trying to figure out what this method means, contract-wise.
Does it mean the class I am creating the UserType for is immutable or does it mean the object that holds a reference to an instance of this class will never point to a different instance?
I found some examples in the [Hibernate Community Wiki](http://www.hibernate.org/37.html) where they returned true, because the object itself was mutable - <http://www.hibernate.org/73.html>.
Other examples in the community wiki returned false without addressing why, even though they were also mutable.
I have checked the JavaDoc, but it's not very clear either.
From the JavaDoc for [UserType](http://www.hibernate.org/hib_docs/v3/api/org/hibernate/usertype/UserType.html):
public boolean isMutable()
Are objects of this type mutable?
Returns:
boolean
From JavaDoc for [Type](http://www.hibernate.org/hib_docs/v3/api/org/hibernate/type/Type.html):
public boolean isMutable()
Are objects of this type mutable. (With respect to the referencing
object ... entities and collections are considered immutable because
they manage their own internal state.)
Returns:
boolean
| 0 | [
2,
2936,
21,
5816,
4148,
2102,
8820,
4155,
4474,
13,
8,
98,
630,
25,
7903,
579,
5,
6,
884,
60,
800,
3726,
3726,
31,
589,
2936,
21,
5816,
4155,
4474,
19,
4148,
2102,
8820,
26,
21,
669,
9,
32,
63,
74,
3109,
22262,
163,
31,
281,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 the query strings in my ASP.NET MVC route?
===
On an ASP.NET MVC (Beta) site that I am developing sometimes calls to ActionLink will return to me URLs containing querying strings. I have isolated the circumstances that produce this behavior, but I still do not understand why, instead of producing a clean URL, it decides to using a query string parameter. I know that functionally they are the same, but for consistency (and appearance) of the URLs this is not what I want.
Here are my routes:
routes.MapRoute(
"Photo Gallery Shortcut",
"group/{groupname}",
new { controller = "Photos", action = "All", Id = "" });
routes.MapRoute(
"Tagged Photos", //since the Tagged action takes an extra parameter, put it first
"group/{groupname}/Photos/Tagged/{tagname}/{sortby}",
new { controller = "Photos", action = "Tagged", Id = "", SortBy = "" });
routes.MapRoute(
"Photo Gallery", //since the Gallery's defualt action is "All" not "Index" its listed seperatly
"group/{groupname}/Photos/{action}/{sortby}",
new { controller = "Photos", action = "All", Id = "", SortBy = "" });
routes.MapRoute(
"Group", //<-- "Group" Category defined above
"group/{groupname}/{controller}/{action}/{id}",
new {controller = "Photos", action = "Index", Id = ""});
Now the problem only occurs when I am looking at the view described by the route named "Tagged Photos" and execute ActionLink via:
Html.ActionLink<PhotosController>(p => p.All((string)ViewData["group"], ""), "Home")
Which produces the URL:
http://domain/group/GROUPNAME?sortBy=
From any other view the URL produced is:
http://domain/group/GROUPNAME
I have pulled down Phil's [ASP.NET Routing Debugger][1], and everything appears in order. This one has me stumped. Any ideas?
[1]: http://haacked.com/archive/2008/03/13/url-routing-debugger.aspx | 0 | [
2,
483,
14,
25597,
7887,
19,
51,
28,
306,
9,
2328,
307,
8990,
858,
60,
800,
3726,
3726,
27,
40,
28,
306,
9,
2328,
307,
8990,
13,
5,
24398,
6,
689,
30,
31,
589,
3561,
1030,
3029,
20,
1028,
6258,
129,
788,
20,
55,
13,
911,
753... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Cursor in SQL Very Slow
===
I am using a Cursor in my stored procedure. It works on a database that has a huge number of data. for every item in the cursor i do a update operation. This is taking a huge amount of time to complete. Almost 25min. :( .. Is there anyway i can reduce the time consumed for this? | 0 | [
2,
29588,
19,
4444,
255,
253,
2276,
800,
3726,
3726,
31,
589,
568,
21,
29588,
19,
51,
8214,
7004,
9,
32,
693,
27,
21,
6018,
30,
63,
21,
2329,
234,
16,
1054,
9,
26,
352,
9101,
19,
14,
29588,
31,
107,
21,
11100,
1453,
9,
48,
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... |
.NET CF mobile device application - best methodology to handle potential offline-ness?
===
I'm building a mobile application in VB.NET (compact framework), and I'm wondering what the best way to approach the potential offline interactions on the device. Basically, the devices have cellular and 802.11, but may still be offline (where there's poor reception, etc). A driver will scan boxes as they leave his truck, and I want to update the new location - immediately if there's network signal, or queued if it's offline and handled later. It made me think, though, about how to handle offline-ness in general.
- Do I cache as much data to the device as I can so that I use it if it's offline - Essentially, each device would have a copy of the (relevant) production data on it? Or is it better to disable certain functionality when it's offline, so as to avoid the headache of synchronization later? I know this is a pretty specific question that depends on my app, but I'm curious to see if others have taken this route.
- Do I build the application itself to act as though it's always offline, submitting everything to a local queue of sorts that's owned by a local class (essentially abstracting away the online/offline thing), and then have the class submit things to the server as it can? What about data lookups - how can those be handled in a "Semi-live" fashion?
- Or should I have the application attempt to submit requests to the server directly, in real-time, and handle it if it itself request fails? I can see a potential problem of making the user wait for the timeout, but is this the most reliable way to do it?
I'm not looking for a specific solution, but really just stories of how developers accomplish this with the smoothest user experience possible, with a link to a how-to or heres-what-to-consider or something like that. Thanks for your pointers on this! | 0 | [
2,
13,
9,
2328,
10084,
3241,
3646,
3010,
13,
8,
246,
18653,
20,
3053,
2222,
168,
1143,
8,
720,
60,
800,
3726,
3726,
31,
22,
79,
353,
21,
3241,
3010,
19,
13,
20468,
9,
2328,
13,
5,
11103,
5183,
6596,
6,
15,
17,
31,
22,
79,
57... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to calculate word frequency in VB.NET?
===
There are some good examples on how to calculate word frequencies in C#, but none of them are comprehensive and I really need one in VB.NET.
My current approach is limited to one word per frequency count. What is the best way to change this so that I can get a completely accurate word frequency listing?
wordFreq = New Hashtable()
Dim words As String() = Regex.Split(inputText, "(\W)")
For i As Integer = 0 To words.Length - 1
If words(i) <> "" Then
Dim realWord As Boolean = True
For j As Integer = 0 To words(i).Length - 1
If Char.IsLetter(words(i).Chars(j)) = False Then
realWord = False
End If
Next j
If realWord = True Then
If wordFreq.Contains(words(i).ToLower()) Then
wordFreq(words(i).ToLower()) += 1
Else
wordFreq.Add(words(i).ToLower, 1)
End If
End If
End If
Next
Me.wordCount = New SortedList
For Each de As DictionaryEntry In wordFreq
If wordCount.ContainsKey(de.Value) = False Then
wordCount.Add(de.Value, de.Key)
End If
Next
I'd prefer an actual code snippet, but generic 'oh yeah...use this and run that' would work as well. | 0 | [
2,
98,
25,
14,
246,
161,
20,
18469,
833,
5328,
19,
13,
20468,
9,
2328,
60,
800,
3726,
3726,
80,
50,
109,
254,
3770,
27,
184,
20,
18469,
833,
14798,
19,
272,
5910,
15,
47,
2369,
16,
105,
50,
7041,
17,
31,
510,
376,
53,
19,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does "Edit and continue" work in Visual Studio?
===
I have always found this to be a very useful feature in Visual Studio. For those who don't know about it, it allows you to edit code while you are debugging a running process, re-compile the code *while the binary is still running* and continue using the application seamlessly with the new code, without the need to restart it.
How is this feature implemented? If the code I am modifying is in a DLL loaded by the application, does the application simply unload the DLL and reload it again? This would seem to me like it would be prone to instability issues, so I assume it would be smarter than this. Any ideas? | 0 | [
2,
184,
630,
13,
7,
69,
242,
17,
1816,
7,
170,
19,
3458,
1120,
60,
800,
3726,
3726,
31,
57,
550,
216,
48,
20,
44,
21,
253,
4811,
1580,
19,
3458,
1120,
9,
26,
273,
72,
221,
22,
38,
143,
88,
32,
15,
32,
2965,
42,
20,
9392,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Repeating background image in native iPhone app
===
Short of putting a UIWebView as the back-most layer in my nib file, how can I add a repeating background image to an iPhone app (like the corduroy look in the background of a grouped UITableView)?
Do I need to create an image that's the size of the iPhone's screen and manually repeat it using copy and paste?
| 0 | [
2,
17389,
2395,
1961,
19,
1275,
21024,
4865,
800,
3726,
3726,
502,
16,
3873,
21,
13,
5661,
14113,
4725,
28,
14,
97,
8,
4630,
5385,
19,
51,
1781,
220,
3893,
15,
184,
92,
31,
3547,
21,
17389,
2395,
1961,
20,
40,
21024,
4865,
13,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why is this line breaking Rails with Passenger on DreamHost?
===
Ok, so I have a Rails app set up on DreamHost and I had it working a while ago and now it's broken. I don't know a lot about deployment environments or anything like that so please forgive my ignorance. Anyway, it looks like the app is crashing at this line in config/environment.rb:
require File.join(File.dirname(__FILE__), 'boot')
config/boot.rb is pretty much normal, but I'll include it here anyway.
# Don't change this file!
# Configure your app in config/environment.rb and config/environments/*.rb
RAILS_ROOT = "#{File.dirname(__FILE__)}/.." unless defined?(RAILS_ROOT)
module Rails
class << self
def boot!
unless booted?
preinitialize
pick_boot.run
end
end
def booted?
defined? Rails::Initializer
end
def pick_boot
(vendor_rails? ? VendorBoot : GemBoot).new
end
def vendor_rails?
File.exist?("#{RAILS_ROOT}/vendor/rails")
end
def preinitialize
load(preinitializer_path) if File.exist?(preinitializer_path)
end
def preinitializer_path
"#{RAILS_ROOT}/config/preinitializer.rb"
end
end
class Boot
def run
load_initializer
Rails::Initializer.run(:set_load_path)
end
end
class VendorBoot < Boot
def load_initializer
require "#{RAILS_ROOT}/vendor/rails/railties/lib/initializer"
Rails::Initializer.run(:install_gem_spec_stubs)
end
end
class GemBoot < Boot
def load_initializer
self.class.load_rubygems
load_rails_gem
require 'initializer'
end
def load_rails_gem
if version = self.class.gem_version
gem 'rails', version
else
gem 'rails'
end
rescue Gem::LoadError => load_error
$stderr.puts %(Missing the Rails #{version} gem. Please `gem install -v=#{version} rails`, update your RAILS_GEM_VERSION setting in config/environment.rb for the Rails version you do have installed, or comment out RAILS_GEM_VERSION to use the latest version installed.)
exit 1
end
class << self
def rubygems_version
Gem::RubyGemsVersion if defined? Gem::RubyGemsVersion
end
def gem_version
if defined? RAILS_GEM_VERSION
RAILS_GEM_VERSION
elsif ENV.include?('RAILS_GEM_VERSION')
ENV['RAILS_GEM_VERSION']
else
parse_gem_version(read_environment_rb)
end
end
def load_rubygems
require 'rubygems'
min_version = '1.1.1'
unless rubygems_version >= min_version
$stderr.puts %Q(Rails requires RubyGems >= #{min_version} (you have #{rubygems_version}). Please `gem update --system` and try again.)
exit 1
end
rescue LoadError
$stderr.puts %Q(Rails requires RubyGems >= #{min_version}. Please install RubyGems and try again: http://rubygems.rubyforge.org)
exit 1
end
def parse_gem_version(text)
$1 if text =~ /^[^#]*RAILS_GEM_VERSION\s*=\s*["']([!~<>=]*\s*[\d.]+)["']/
end
private
def read_environment_rb
File.read("#{RAILS_ROOT}/config/environment.rb")
end
end
end
end
# All that for this:
Rails.boot!
Does anyone have any ideas? I am not getting any errors in the log or on the page.
-fREW | 0 | [
2,
483,
25,
48,
293,
3892,
2240,
18,
29,
3093,
27,
1868,
11694,
60,
800,
3726,
3726,
5854,
15,
86,
31,
57,
21,
2240,
18,
4865,
309,
71,
27,
1868,
11694,
17,
31,
41,
32,
638,
21,
133,
1464,
17,
130,
32,
22,
18,
2023,
9,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
redirect puts to a log file
===
I am working on creating a daemon in Ruby using the daemons gem. I want to add output from the daemon into a log file. So I am wondering what is the easiest way to redirect `puts` from the console to a log file? | 0 | [
2,
302,
14706,
11179,
20,
21,
6738,
3893,
800,
3726,
3726,
31,
589,
638,
27,
2936,
21,
13127,
19,
10811,
568,
14,
13127,
18,
8551,
9,
31,
259,
20,
3547,
5196,
37,
14,
13127,
77,
21,
6738,
3893,
9,
86,
31,
589,
5712,
98,
25,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do Microsoft (and other software companies with a large installed base) manage patch dependencies?
===
OS (usually security-based) patches and hotfixes that Microsoft releases to the community normally consist of, in my understanding, a series of updated DLLs or other binaries.
How does Microsoft, and other companies like it, ensure that that hotfixes don't clash with each other? Do they always go for a cumulative patch approach, where a single hotfix will includes all of the fixes in previous hotfixes? This doesn't *seem* to be the case, because many hotfixes seem to be focused on fixing specific problems. If they are focused hotfixes, how do they prevent one hotfix from trashing another one (e.g. incompatible DLLs being installed with each other).
I have always admired Microsoft's ability to manage this process. The company I work for is much smaller, and when I worked on the patch process a few years ago, we always went for the cumulative approach, where a single patch immediately superseded all previous patches based on that release. This meant that the patches got progressively larger in size, until the next "official" release came out.
What are some good practices for managing patch dependencies? | 0 | [
2,
184,
107,
7099,
13,
5,
290,
89,
2306,
1532,
29,
21,
370,
4066,
1000,
6,
4705,
7331,
29411,
60,
800,
3726,
3726,
13,
759,
13,
5,
13075,
1221,
8,
1281,
6,
16359,
17,
1047,
18594,
160,
30,
7099,
7073,
20,
14,
514,
4147,
7929,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 estimate a EAI project using Function point?
===
How do you estimate a EAI project using Function point? | 0 | [
2,
184,
107,
42,
10243,
21,
13507,
49,
669,
568,
1990,
454,
60,
800,
3726,
3726,
184,
107,
42,
10243,
21,
13507,
49,
669,
568,
1990,
454,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Loosely coupled events in WPF without using Prism
===
I'm working on a WPF application and is using the Model-View-ViewModel pattern.
The application consists of two modules at the moment:
- Left Panel to browse a tree and select a node
- Main Panel to show the content of the selected tree node.
I want to keep these two modules seperated, but when I select a node in the Left Panel I need to fire an event that the Main Panel can subscribe to. I don't want to couple the Left and the Main panel, so I don't want to share instances of the ViewModel classes.
Optimally I would love to use Prism (WPF Composite Application Guidance), but I'm currently extending an existing application and cannot introduce more dependencies. The project is also on .NET 3.0 (not 3.5), so I would have to convert Prism back to .NET 3.0 as it is written for .NET 3.5.
In Prism I would solve this using the Loosely Coupled eventing infrastructure. It allows you to fire an event in any class in any layer, and listen to any event in any class in any layer. Basically the publisher and subscriber of the event is decoupled.
I use Commands to achieve this loose coupling between my View and my ViewModel, but I'm not sure how to do proper cross-View communication.
Any tips or suggestions are greatly appreciated.
**I'm specifically looking for a *really* light weigh pub/sub event model for .NET 2.0/3.0 (no LINQ stuff), or some thing else to implement cross View (module) communication without coupling the two modules.**
| 0 | [
2,
13166,
13420,
963,
19,
619,
7721,
366,
568,
21985,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
619,
7721,
3010,
17,
25,
568,
14,
1061,
8,
4725,
8,
4725,
13998,
3732,
9,
14,
3010,
2043,
16,
81,
17113,
35,
14,
688,
45,
13,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
are XML standard parsers faster than other kind of custom written parsers?
===
Are xML parsers(provided by standard libraries ) faster than custom written parsers
if so, Why ?
| 0 | [
2,
50,
23504,
1236,
2017,
18,
445,
4233,
119,
89,
825,
16,
5816,
642,
2017,
18,
445,
60,
800,
3726,
3726,
50,
23504,
2017,
18,
445,
5,
26735,
43,
34,
1236,
8649,
13,
6,
4233,
119,
5816,
642,
2017,
18,
445,
100,
86,
15,
483,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Best book/article for ASP.NET and IIS internals
===
Looking for the gory details on extensibility, ISAPI, HTTP.sys, ... | 0 | [
2,
246,
360,
118,
20360,
26,
28,
306,
9,
2328,
17,
595,
18,
3117,
18,
800,
3726,
3726,
699,
26,
14,
162,
622,
3289,
27,
1396,
8710,
14264,
15,
25,
2552,
49,
15,
7775,
9,
4980,
18,
15,
13,
9,
9,
9,
3,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Unlinked web pages on a server - security hole?
===
On my website, I have several html files I do not link off the main portal page. Without other people linking to them, is it possible for Jimmy Evil Hacker to find them? | 0 | [
2,
367,
6258,
69,
2741,
4434,
27,
21,
8128,
13,
8,
1221,
3990,
60,
800,
3726,
3726,
27,
51,
2271,
15,
31,
57,
238,
13,
15895,
6488,
31,
107,
52,
3508,
168,
14,
407,
8281,
2478,
9,
366,
89,
148,
12585,
20,
105,
15,
25,
32,
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,
0,
0,
0,
0,
0,
0,
0,
0... |
Graphically laying out wx app
===
Being really new to wx, I'm wondering if there is an IDE (especially for Linux) which would help me lay out a frame or dialog or whatever just to help me see what I'm doing. That means also creating the code for those changes.
I remember way back when using resource compilers for OS/2 and Windows that produced binaries that would then create the window, and was hoping for something similar (though obviously not binary if wx doesn't support that). | 0 | [
2,
21755,
102,
11514,
70,
619,
396,
4865,
800,
3726,
3726,
142,
510,
78,
20,
619,
396,
15,
31,
22,
79,
5712,
100,
80,
25,
40,
13,
3448,
13,
5,
12183,
26,
13024,
6,
56,
83,
448,
55,
1815,
70,
21,
3523,
54,
28223,
54,
2099,
11... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Basic C Question
===
I am reading over the KR book, and am a little stuck.
What is wrong with the following?
<pre>
1. void getInput(int* output) {
2. int c, i;
3. for(i=0; (c = getchar()) != '\n'; i++)
4. output[i] = c; // printf("%c", c) prints the c value as expected
5. output[++i] = '\0';
6. }
</pre>
When I run the program it never gets out of the loop and I have to ctrl-c to exit. However if I replace the 5th line with printf("%c", c); it prints out all the input just fine after hitting enter and creating the new line.
Thanks for the help. | 0 | [
2,
2125,
272,
1301,
800,
3726,
3726,
31,
589,
1876,
84,
14,
9645,
360,
15,
17,
589,
21,
265,
4549,
9,
98,
25,
1389,
29,
14,
249,
60,
13,
1,
3515,
1,
137,
9,
11364,
164,
108,
4881,
5,
6391,
2483,
5196,
6,
13,
1,
172,
9,
19,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Server.Transfer Vs. Response.Redirect
===
what is difference between Server.Transfer & Response.Redirect & what are advantages & disadvantages of one over another ? | 0 | [
2,
8128,
9,
7028,
2407,
4611,
9,
1627,
9,
99,
14706,
800,
3726,
3726,
98,
25,
2841,
128,
8128,
9,
7028,
2407,
279,
1627,
9,
99,
14706,
279,
98,
50,
14683,
279,
13387,
18,
16,
53,
84,
226,
13,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to remove the background from a fingerprint image?
===
I have a fingerprint image taken from a sliding scanner. However the output does not have clean background. It looks like this:
![dirty][1]
I want to remove the background so that further processing will be more accurate. Something like this:
![cleaned][2]
How to do that? What image processing technique (if any) can be used? Thank you.
[1]: http://img208.imageshack.us/img208/2622/dirtyie0.png
[2]: http://img515.imageshack.us/img515/7530/cleanhh6.png | 0 | [
2,
184,
20,
4681,
14,
2395,
37,
21,
21564,
1961,
60,
800,
3726,
3726,
31,
57,
21,
21564,
1961,
658,
37,
21,
7609,
23195,
9,
207,
14,
5196,
630,
52,
57,
2745,
2395,
9,
32,
1879,
101,
48,
45,
13,
187,
2558,
28067,
500,
2558,
165... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
sql2005: nvarchar(50) as primary key
===
I'm considering altering some tables to use nvarchar(50) as primary key instead of an int primary key. Using an int ID for a key really is irrelevant data, it's the string I'm interested in. What sort of performance hit will occur, or where do you research this? Other than cut and try that is.
| 0 | [
2,
4444,
255,
2835,
45,
13,
103,
3311,
5433,
5,
2290,
6,
28,
1256,
1246,
800,
3726,
3726,
31,
22,
79,
5154,
7835,
68,
109,
7484,
20,
275,
13,
103,
3311,
5433,
5,
2290,
6,
28,
1256,
1246,
700,
16,
40,
19,
38,
1256,
1246,
9,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Deep-Initialising Java Bean properties
===
Do you bother initialising java bean values? Say, for example:
([g|s]etters omitted)
public class SomeClass {
private String foo;
private Date bar;
private Baz someObject;
}
(Yes, this is a POJO being used as a bean rather than a Java Bean in the strictest sense)
In the empty constructor, do you initialise these members, or simply do nothing? Likewise, would Baz initialise it's members as well?
Or do you just leave them as null?
| 0 | [
2,
855,
8,
27313,
7552,
8247,
15322,
3704,
800,
3726,
3726,
107,
42,
8006,
2104,
7552,
8247,
15322,
4070,
60,
395,
15,
26,
823,
45,
13,
5,
2558,
263,
1,
18,
500,
22323,
18,
18761,
6,
317,
718,
109,
1898,
13,
1,
932,
3724,
4310,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Books on animation, recommendations?
===
I would like to better understand the math behind animations, 3d and 2d. I recently came across this example via Digg.
http://maettig.com/code/javascript/3d_dots.html
It is pretty interesting and another animation experiment on the same site is just as impressive.
http://maettig.com/code/javascript/swirl.html
With FF 3.1 and WebKit-based browsers (Safari, Chrome and AIR apps) animation with JavaScript is more realistic.
Do you have any suggestions for books on animation?
| 4 | [
2,
964,
27,
6236,
15,
12121,
60,
800,
3726,
3726,
31,
83,
101,
20,
574,
1369,
14,
5057,
439,
6236,
18,
15,
203,
43,
17,
172,
43,
9,
31,
1989,
281,
464,
48,
823,
1197,
6131,
263,
9,
7775,
6903,
540,
8109,
263,
9,
960,
118,
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... |
div, div, div
===
<div>foo</div><div>bar</div><div>baz</div>
I would like then to display a b c
not:
a
b
c | 0 | [
2,
13,
12916,
15,
13,
12916,
15,
13,
12916,
800,
3726,
3726,
13,
1,
12916,
1,
4120,
111,
1,
118,
12916,
1,
12916,
1,
1850,
1,
118,
12916,
1,
12916,
1,
969,
380,
1,
118,
12916,
1,
31,
83,
101,
94,
20,
3042,
21,
334,
272,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is MSMQ thread safe?
===
If I enqueue or dequeue an MSMQ queue, will the operation be thread safe? | 0 | [
2,
25,
4235,
79,
1251,
9322,
1834,
60,
800,
3726,
3726,
100,
31,
1957,
2005,
4185,
54,
121,
2005,
4185,
40,
4235,
79,
1251,
22521,
15,
129,
14,
1453,
44,
9322,
1834,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Loader scripts for ARM STR7xx
===
I'm trying to program ARM using Eclipse + CDT + yagarto (gnu toolchain) + OpenOCD. In several sample projects (from yagarto site for example) I found linker scripts (*.ld) where a lot of linking information specified (along with sections definitions). Actually I haven't faced this files before (IAR doesn't need them), and I find them somewhat difficult to understand from a first glance. So my question is can I use one single such script file for my target processor (STR710FZ2T6) with all my projects or I have to get familiar in writing this scripts and write them for each project. If I can use single file for all projects for particular target processor can you please advice where I can find such universal one. | 0 | [
2,
6305,
106,
17505,
26,
813,
13,
9729,
465,
8962,
800,
3726,
3726,
31,
22,
79,
749,
20,
625,
813,
568,
11652,
2754,
1745,
38,
2754,
2167,
2063,
262,
13,
5,
263,
4215,
5607,
17317,
6,
2754,
368,
2499,
43,
9,
19,
238,
5717,
2314,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JSP custom tag library (Passing Attributes)
===
I m passing multiple attributes in my custom tag like
< mytag Firstname="Thadeus" Lastname="Jones" >
Then how would I access the individual attributes in the TagHandler class..
Kindly specify any suggestions..
Regards,
Vinayak
| 0 | [
2,
487,
3401,
5816,
3383,
1248,
13,
5,
6201,
68,
13422,
6,
800,
3726,
3726,
31,
307,
2848,
1886,
13422,
19,
51,
5816,
3383,
101,
279,
255,
38,
51,
8628,
64,
7259,
3726,
7,
96,
5165,
267,
7,
236,
7259,
3726,
7,
18994,
7,
279,
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... |
Portability of Java Swing applications to OSX
===
Recently I wrote an extremely basic Java Swing program with a couple of text fields and buttons. The program works fine for me on Ubuntu with Java 1.5. But when I try to run it on OSX (10.4), the main window is displayed correctly but the program seems unresponsive. Nothing seems to happen, no matter which button I click on.
I know next to nothing about Mac OSX, so is there something I might be doing wrong? | 0 | [
2,
1295,
4091,
16,
8247,
5587,
3767,
20,
13,
759,
396,
800,
3726,
3726,
1989,
31,
738,
40,
3898,
2125,
8247,
5587,
625,
29,
21,
1335,
16,
1854,
2861,
17,
12861,
9,
14,
625,
693,
1123,
26,
55,
27,
287,
12968,
2473,
29,
8247,
137,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Questions for an OOP library in Lua
===
I implemented a small OOP library in Lua, and two things are not quite right yet. I need your advice!
##How to call super()?
I need to make a choice. The three arguments I need to resolve a call to super() are:
* The class from where the call is being made (CallerClass?)
* The instance to be passed (self)
* The name of the method (method)
I hesitate between these three forms:
--# Current way:
self:super(CallerClass):method()
--# Variant, which I now find cleaner:
CallerClass:super(self):method()
--# Python style, which is nice too:
super(CallerClass, self):method()
Which one looks nicer and or easier to remember to you?
## Do I need a Class symbol?
In the current version, the only concept is a table named `Object`, which you can subclass. I have another version where I introduced a Class symbol.
Its use is to tell instances from classes. I.e. :
assert(Object:isKindOf(Class))
local object = Object:new()
assert(not object:isKindOf(Class))
I find it very handy to document and enforce that a method must be called from a class, by starting the method with:
assert(self:isKindOf(Class))
Is it usefull in Lua? What do you think? Thanks! | 0 | [
2,
2346,
26,
40,
13,
21709,
1248,
19,
1612,
58,
800,
3726,
3726,
31,
6807,
21,
284,
13,
21709,
1248,
19,
1612,
58,
15,
17,
81,
564,
50,
52,
1450,
193,
768,
9,
31,
376,
154,
4978,
187,
6926,
5910,
1544,
20,
645,
1026,
5,
6,
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... |
Incoming poplib refactoring using windows python 2.3
===
Hi Guys could you please help me refactor this so that it is sensibly pythonic.
import sys
import poplib
import string
import StringIO, rfc822
import datetime
import logging
def _dump_pop_emails(self):
self.logger.info("open pop account %s with username: %s" % (self.account[0], self.account[1]))
self.popinstance = poplib.POP3(self.account[0])
self.logger.info(self.popinstance.getwelcome())
self.popinstance.user(self.account[1])
self.popinstance.pass_(self.account[2])
try:
(numMsgs, totalSize) = self.popinstance.stat()
for thisNum in range(1, numMsgs+1):
(server_msg, body, octets) = self.popinstance.retr(thisNum)
text = string.join(body, '\n')
mesg = StringIO.StringIO(text)
msg = rfc822.Message(mesg)
name, email = msg.getaddr("From")
emailpath = str(self._emailpath + self._inboxfolder + "\\" + email + "_" + msg.getheader("Subject") + ".eml")
emailpath = self._replace_whitespace(emailpath)
file = open(emailpath,"wb")
file.write(text)
file.close()
self.popinstance.dele(thisNum)
finally:
self.logger.info(self.popinstance.quit())
def _replace_whitespace(self,name):
name = str(name)
return name.replace(" ", "_")
| 0 | [
2,
17126,
1675,
8326,
302,
17455,
68,
568,
1936,
20059,
172,
9,
240,
800,
3726,
3726,
4148,
2776,
110,
42,
2247,
448,
55,
302,
17455,
48,
86,
30,
32,
25,
8252,
18,
49,
8818,
20059,
596,
9,
9010,
10315,
18,
9010,
1675,
8326,
9010,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Setting AssociatedControlID on label fails
===
I have a composite control that adds a TextBox and a Label control to its Controls collection. When i try to set the Label's AssociatedControlID to the ClientID of the Textbox i get this error
Unable to find control with id
'ctl00_MainContentPlaceholder_MatrixSetControl_mec50_tb'
that is associated with the Label 'lb'.
Ok so a little background. I got this main-composite control that dynamically adds a number of 'elements' to its control collection. One of these elements happen to be this 'MatrixTextBox' which is the control consisting of a TextBox and a Label.
I hold the Label and TextBox as protected class variables and init them in CreateChildControls:
ElementTextBox = new TextBox();
ElementTextBox.ID = "tb";
Controls.Add(ElementTextBox);
ElementLabel = new Label();
ElementLabel.ID = "lb";
Controls.Add(ElementLabel);
I tried setting the
ElementLabel.AssociatedControlID = ElementTextBox.ClientID;
both right after adding the controls to the Controls collection and even in PreRender - both yield the same error. What am i doing wrong?
| 0 | [
2,
2697,
1598,
12898,
1340,
27,
1899,
13614,
800,
3726,
3726,
31,
57,
21,
12639,
569,
30,
10621,
21,
1854,
5309,
17,
21,
1899,
569,
20,
82,
8671,
1206,
9,
76,
31,
1131,
20,
309,
14,
1899,
22,
18,
1598,
12898,
1340,
20,
14,
6819,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Correct Rails 2.1 way of doing things
===
Some of the answers to a [question][1] I had about redirect_to made me think about some other questions.
Basically I'm writing a blog application using Rails 2.1. I've been trying to do most of it myself (as I know a bit of rails), but with reference to tutorials and references on the internet when I need it.
I managed to get a simple blog working, then I tried to add comments. By myself I managed to get it to the stage where I could add comments from `script/console` but I had trouble getting the form to work.
One of the tutorials I followed suggested creating a 'comment' action in the posts controller, which adds the comment. My question is: is that the 'standard' way to do it? One of the answers to my other question seemed to suggest that there should be a CommentsController involved...should there be?
I've managed to fix the problem I asked in my other question, but I'm a little concerned if I'm just making dirty quick hacks rather than programming rails well.
[1]: http://stackoverflow.com/questions/223354/rails-ignoring-render-and-redirectto | 0 | [
2,
4456,
2240,
18,
172,
9,
165,
161,
16,
845,
564,
800,
3726,
3726,
109,
16,
14,
6709,
20,
21,
636,
24652,
500,
2558,
165,
500,
31,
41,
88,
302,
14706,
1,
262,
117,
55,
277,
88,
109,
89,
2346,
9,
11374,
31,
22,
79,
1174,
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... |
Git: Find duplicate blobs (files) in this tree
===
This is sort of a follow-up to [this question](http://stackoverflow.com/questions/223678).
If there are multiple blobs with the same contents, they are only stored once in the git repository because their SHA-1's will be identical. How would one go about finding all duplicate files for a given tree?
Would you have to walk the tree and look for duplicate hashes, or does git provide backlinks from each blob to all files in a tree that reference it?
| 0 | [
2,
13,
10404,
45,
477,
19429,
334,
10904,
18,
13,
5,
16877,
18,
6,
19,
48,
1541,
800,
3726,
3726,
48,
25,
2058,
16,
21,
1740,
8,
576,
20,
636,
1565,
1301,
500,
5,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
15718,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Transactions in .net
===
What are the best practices to do transactions in C# .Net 2.0. What are the classes that should be used? What are the pitfalls to look out for etc. All that commit and rollback stuff. I'm just starting a project where I might need to do some transactions while inserting data into the DB. Any responses or links fro even basic stuff about transactions are welcome. | 0 | [
2,
13147,
19,
13,
9,
2328,
800,
3726,
3726,
98,
50,
14,
246,
5242,
20,
107,
13147,
19,
272,
5910,
13,
9,
2328,
172,
9,
387,
9,
98,
50,
14,
2684,
30,
378,
44,
147,
60,
98,
50,
14,
4175,
5660,
18,
20,
361,
70,
26,
2722,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to make search engines find my AJAX content.
===
I have a page which dynamically loads a section of content via AJAX. I'm concerned that this means the content will not be found by search engines.
To show you what I mean, the site is at <http://www.gold09.net> and the dynamic content is at [/speakers.php](http://www.gold09.net/speakers.php) - Normally no one would visit that second link, it's just loaded into the first page.
I know I can tell the crawlers to read the `speakers.php` by using a `sitemap.xml`, but then I'll get links to the speakers.php showing up in search results.
I guess the ultimate solution would be so that if someone requests `/speakers.php` it redirects them to the main page, whereas it lets crawlers read the data.
Any suggestions? | 0 | [
2,
184,
20,
233,
2122,
4016,
477,
51,
20624,
2331,
9,
800,
3726,
3726,
31,
57,
21,
2478,
56,
7782,
1326,
19069,
21,
1050,
16,
2331,
1197,
20624,
9,
31,
22,
79,
3518,
30,
48,
1108,
14,
2331,
129,
52,
44,
216,
34,
2122,
4016,
9,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the exact rules for structure alignment on iPhone OS?
===
I'm using the Objective-C NSMethodSignature / @encode facilities to do some cross-language data type translation, which means that I need to be able to programmatically copy values into a structure described in @encode() format. e.g., I may have 4 floats and need to insert them into a CGRect, which is a structure containing 2 structures, each of which contains 2 floats each. In @encode terminology, the type is this:
{CGRect={CGPoint=ff}{CGSize=ff}}
To do this I need to be able to guess the structure layout knowing only the data types of the primitive structure members -- in this case 4 floats.
It appears that historically there have been two different conventions for ARM struct alignment. One was to align all members of the struct on a boundary size which would satisfy the largest member. The other was to align all members on the boundary size appropriate to each member's data type.
Which is used in OS X / iPhone OS, both on ARM and on x86 / x86_64?
| 0 | [
2,
98,
50,
14,
5340,
1761,
26,
1411,
12448,
27,
21024,
13,
759,
60,
800,
3726,
3726,
31,
22,
79,
568,
14,
7038,
8,
150,
13,
2172,
5909,
1807,
43,
18,
2816,
20609,
13,
118,
13,
1,
219,
9375,
2450,
20,
107,
109,
919,
8,
7020,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
boost lambda or phoenix problem: using std::for_each to operate on each element of a container
===
I ran into a problem while cleaning up some old code. This is the function:
uint32_t ADT::get_connectivity_data( std::vector< std::vector<uint8_t> > &output )
{
output.resize(chunks.size());
for(chunk_vec_t::iterator it = chunks.begin(); it < chunks.end(); ++it)
{
uint32_t success = (*it)->get_connectivity_data(output[it-chunks.begin()]);
}
return TRUE;
}
What i am interested in doing is cleaning up the for loop to be a lambda expression but quickly got stuck on how exactly I would pass the correct argument to get_connectivity_data. get_connectivity_data takes a std::vector<uint8_t> by reference and fills it with some data. output contains a std::vector<uint8_t> for each "chunk".
Basically my conclusion for this was that it was substantially easier, cleaner and *shorter* to leave my code as-is. | 0 | [
2,
10419,
13,
24187,
54,
6014,
1448,
45,
568,
354,
43,
45,
45,
1106,
1,
14322,
20,
4055,
27,
206,
4520,
16,
21,
12147,
800,
3726,
3726,
31,
717,
77,
21,
1448,
133,
9724,
71,
109,
315,
1797,
9,
48,
25,
14,
1990,
45,
287,
6391,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Provide password using Shell script
===
I had setup my clients & server for passwordless login.
Like passwordless login by copying RSA key of server to all client's /root/.ssh/id-rsa.pub. but this, I have done manually. I like to automate this process using shell script and providing password to the machines through script.
If this problem is solved then I also want to use rsync to automate push items to all servers.
Can any body help me in this regard.
Thank you | 0 | [
2,
1181,
20884,
568,
3593,
3884,
800,
3726,
3726,
31,
41,
18161,
51,
7421,
279,
8128,
26,
20884,
923,
6738,
108,
9,
101,
20884,
923,
6738,
108,
34,
4344,
68,
13,
22038,
1246,
16,
8128,
20,
65,
6819,
22,
18,
13,
118,
14032,
118,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Full Text Search vs LIKE
===
I just read a post mentioning "full text search" in SQL.
I was just wondering what the difference between FTS and LIKE are. I did read a couple of articles but couldn't find anything that explained it well.
Thanks. | 0 | [
2,
98,
25,
503,
1854,
2122,
4611,
101,
800,
3726,
3726,
31,
114,
1302,
21,
678,
21215,
13,
7,
13727,
1854,
2122,
7,
19,
4444,
255,
9,
31,
23,
114,
5712,
98,
14,
2841,
128,
1187,
18,
17,
101,
50,
9,
31,
144,
1302,
21,
1335,
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,
0,
0... |
Mocking static methods in abstract classes with JMockit?
===
I have the following two classes:
public abstract class AbstractParent {
static String method() {
return "OriginalOutput";
}
}
and
public class RealParent extends AbstractParent {
public String methodB() {
return method();
}
}
I want to test methodB. I decide to use [JMockit][1]. So I create a mock class:
public class MockParent {
static String method() {
return "MOCK";
}
}
And my test code looks like this:
public class RealParentTest {
@Before
public void setUp() throws Exception {
Mockit.redefineMethods( AbstractParent.class, MockParent.class );
}
@Test
public void testMethodB() {
assertEquals(MockParent.method(),new RealParent().methodB());
}
}
Unfortunately this test says that RealParent returns "OriginalOutput" instead of "MOCK". Any ideas why? Am I doing something wrong? I've tried declaring my mock class as abstract as well, to no avail.
[1]: http://jmockit.dev.java.net | 0 | [
2,
18446,
12038,
3195,
19,
8502,
2684,
29,
487,
79,
5668,
242,
60,
800,
3726,
3726,
31,
57,
14,
249,
81,
2684,
45,
317,
8502,
718,
8502,
18908,
13,
1,
12038,
3724,
2109,
5,
6,
13,
1,
788,
13,
7,
13989,
1320,
4881,
7,
73,
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... |
Tips for writing fluent interfaces in C# 3
===
I'm after some good tips for fluent interfaces in C#. I'm just learning about it myself but keen to hear what others think outside of the articles I am reading. In particular I'm after:
- when is fluent too much?
- are there any fluent patterns?
- what is in C# that makes fluent interfaces more fluent (e.g. extension methods)
- is a complex fluent interface still a fluent one?
- refactoring to arrive at a fluent interface or refactoring an existing fluent interface
- any good examples out there that you have worked with or could recommend?
If you could post one tip or thought, or whatever per post. I want to see how they get voted on, too.
Thank you in advance. | 0 | [
2,
11034,
26,
1174,
19252,
6573,
18,
19,
272,
5910,
203,
800,
3726,
3726,
31,
22,
79,
75,
109,
254,
11034,
26,
19252,
6573,
18,
19,
272,
5910,
9,
31,
22,
79,
114,
2477,
88,
32,
992,
47,
7194,
20,
990,
98,
654,
277,
719,
16,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Open Source Profiling Frameworks?
===
Have you ever wanted to test and quantitatively show whether your application would perform better as a static build or shared build, stripped or non-stripped, upx or no upx, gcc -O2 or gcc -O3, hash or btree, etc etc. If so this is the thread for you. There are hundreds of ways to tune an application, but how do we collect, organize, process, visualize the consequences of each experiment.
I have been looking for several months for an open source application performance engineering/profiling framework similar in concept to Mozilla's [Perftastic][1] where I can develop/build/test/profile hundreds of incarnations of different tuning experiments.
Some requirements:
Platform
--------
SUSE32 and SUSE64
Data Format
-----------
Very flexible, compact, simple, hierarchical. There are several possibilities including
- Custom [CSV][2]
- [RRD][3]
- [Protocol Buffers][4]
- [JSON][5]
- No XML. There is lots of data and XML is tooo verbose
Data Acquisition
----------------
Flexible and Customizable plugins. There is lots of data to collect from the application including performance data from /proc, sys time, wall time, cpu utilization, memory profile, leaks, valgrind logs, arena fragmentation, I/O, localhost sockets, binary size, open fds, etc. And some from the host system. My language of choice for this is Python, and I would develop these plugins to monitor and/or parse data in all different formats and store them in the data format of the framework.
Tagging
-------
All experiments would be tagged including data like GCC version and compile options, platform, host, app options, experiment, build tag, etc.
Graphing
--------
History, Comparative, Hierarchical, Dynamic and Static.
- The application builds are done by a custom CI sever which releases a new app version several times per day the last 3 years straight. This is why we need a continuous trend analysis. When we add new features, make bug fixes, change build options, we want to automatically gather profiling data and see the trend. This is where generating various static builds is needed.
- For analysis [Mozilla dynamic graphs][6] are great for doing comparative graphing. It would be great to have comparative graphing between different tags. For example compare N build versions, compare platforms, compare build options, etc.
- We have a test suite of 3K tests, data will be gathered per test, and grouped from inter-test data, to per test, to per tagged group, to complete regression suite.
- Possibilities include [RRDTool][7], [Orca][8], [Graphite][9]
Analysis on a grouping basis
--------
- Min
- Max
- Median
- Avg
- Standard Deviation
- etc
Presentation
------------
All of this would be presented and controlled through a app server, preferably Django or TG would be best.
Inspiration
-----------
- [Centreon][10]
- [Cacti][11]
[1]: http://graphs.mozilla.org
[2]: http://en.wikipedia.org/wiki/Comma-separated_values
[3]: http://en.wikipedia.org/wiki/RRDtool
[4]: http://en.wikipedia.org/wiki/Protocol_buffers
[5]: http://en.wikipedia.org/wiki/Json
[6]: http://graphs.mozilla.org
[7]: http://oss.oetiker.ch/rrdtool/index.en.html
[8]: http://www.orcaware.com/orca/example_sites.html
[9]: http://graphite.wikidot.com/screen-shots
[10]: http://www.centreon.com/Product/Pre-requisits-Centreon-2.x.html
[11]: http://cactiusers.org/index.php | 0 | [
2,
368,
1267,
8721,
49,
802,
6596,
18,
60,
800,
3726,
3726,
57,
42,
462,
417,
20,
1289,
17,
22122,
102,
298,
1472,
154,
3010,
83,
2985,
574,
28,
21,
12038,
1895,
54,
2592,
1895,
15,
10841,
54,
538,
8,
19992,
3631,
15,
71,
396,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Most optmized Paging SQL query?
===
I know several ways of writing paged query in SQL Server 2005. But I have no idea about their performance. Which one is the best and most optimized way for writing paging sql queries?
1. Using Row_Number()
2. Using Partition by
3. Using Temporary tables
4. Using nested Top N with Order by
5. Some other way? | 0 | [
2,
127,
17034,
79,
1333,
19006,
68,
4444,
255,
25597,
60,
800,
3726,
3726,
31,
143,
238,
2847,
16,
1174,
2478,
43,
25597,
19,
4444,
255,
8128,
812,
9,
47,
31,
57,
90,
882,
88,
66,
956,
9,
56,
53,
25,
14,
246,
17,
127,
22864,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JSP custom tag library (Unable to find setter method for the attribute)
===
I'm having trouble with a custom tag:-
The TLD (the relevant bits):-
<?xml version="1.0" encoding="ISO-8859-1"?>
<!DOCTYPE taglib PUBLIC "-//Sun Microsystems, Inc.//DTD JSP Tag Library 1.2//EN" "http://java.sun.com/dtd/web-jsptaglibrary_1_2.dtd";>
<taglib>
<tlib-version>1.2</tlib-version>
<jsp-version>1.2</jsp-version>
<short-name>sf</short-name>
<uri>http://stuff.com/tag</uri> <name>myTag</name>
<tag-class>com.stuff.MyTag</tag-class>
<body-content>empty</body-content>
<attribute>
<name>yCoord</name>
<required>true</required>
<rtexprvalue>true</rtexprvalue>
<type>double</type>
</attribute>
<attribute>
<name>xCoord</name>
<required>true</required>
<rtexprvalue>true</rtexprvalue>
<type>double</type>
</attribute>
</taglib> The Tag class...
public class MyTag extends TagSupport
{
private double xCoord;
private double yCoord;
... other stuff in here including doStartTag() ....
public double getXCoord()
{
return xCoord;
}
/**
* @param coord the xCoord to set
*/
public void setXCoord(double val)
{
this.xCoord = val;
}
/**
* @return the yCoord
*/
public double getYCoord()
{
return yCoord;
}
/**
* @param coord the yCoord to set
*/
public void setYCoord(double val)
{
this.yCoord = val;
}
}
The jsp...
<%@ page language="java" contentType="text/html; charset=ISO-8859-1"
pageEncoding="ISO-8859-1"%>
<%@ taglib uri="http://stuff.com/tag"; prefix="atag" %>
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>Insert title here</title>
</head>
<body>
<atag:myTag
xCoord="1.0"
yCoord="0.0"
/>
</body>
</html>
The problem is that I'm continually getting a runtime exception--org.apache.jasper.JasperException: "Unable to find setter method for attribute: xCoord"
Things I have tried already:-
setting the attrbute type to String, eg omitting the <type> in the tld and having the setter method take a String.
I have checked that the code is recompiled and deployed correctly etc etc....
So, the question is , why can't it find the setter method??? | 0 | [
2,
487,
3401,
5816,
3383,
1248,
13,
5,
1020,
579,
20,
477,
309,
815,
2109,
26,
14,
35,
14755,
6,
800,
3726,
3726,
31,
22,
79,
452,
2572,
29,
21,
5816,
3383,
45,
8,
14,
13,
38,
6252,
13,
5,
124,
7480,
10181,
6,
45,
8,
13,
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... |
Splitting WPF interface across multiple Xaml files
===
I am trying to create a user interface using XAML. However, the file is quickly becoming very large and difficult to work with. What is the best way for splitting it across several files.
I would like to be able to set the content of an element such as a ComboBox to an element that is defined in a different xaml file (but in the same VS project).
thanks | 0 | [
2,
17282,
619,
7721,
6573,
464,
1886,
13,
6791,
8184,
6488,
800,
3726,
3726,
31,
589,
749,
20,
1600,
21,
4155,
6573,
568,
13,
6791,
8184,
9,
207,
15,
14,
3893,
25,
976,
1535,
253,
370,
17,
1956,
20,
170,
29,
9,
98,
25,
14,
246... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 programmatically add playlists or views to iTunes?
===
Is there a way to programmatically interface with iTunes to add new playlists or smart views?
For example, say I download 10 new mp3 files from a website, is there a way of programmatically adding this list of mp3s to a new playlist called "New Album xx"? A new smart view could be okay too if this is easier.
Thanks! </br>
-Greg
| 0 | [
2,
184,
92,
31,
625,
6732,
1326,
3547,
27063,
18,
54,
4146,
20,
12952,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
625,
6732,
1326,
6573,
29,
12952,
20,
3547,
78,
27063,
18,
54,
3978,
4146,
60,
26,
823,
15,
395,
31,
7121,
332,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
how to use cursor for reading multiple files in database in python
===
In python how to read multiple files from mysql database using cursor or loop one by one and store in separate table
| 0 | [
2,
184,
20,
275,
29588,
26,
1876,
1886,
6488,
19,
6018,
19,
20059,
800,
3726,
3726,
19,
20059,
184,
20,
1302,
1886,
6488,
37,
51,
18,
22402,
6018,
568,
29588,
54,
5293,
53,
34,
53,
17,
1718,
19,
1725,
859,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to embed Ruby in an XNA engine?
===
I'm wondering if it's possible to embed Ruby as a scripting language in Microsoft XNA, and what's the best way to do that. I'm looking for something like <a href="http://www.xnua.com/xna_lua_xnua">Xnua</a>, except for Ruby.
I've stumbled upon Ruby.NET and IronRuby and both seem to be in very early stages, so I'm not sure how usable they are. Furthermore, I'm not sure if they'd work on Xbox 360. This <a href="http://forums.xna.com/forums/t/1464.aspx">topic at XNA forums</a> says that IronPython wouldn't work, for example. | 0 | [
2,
184,
20,
11911,
69,
10811,
19,
40,
993,
325,
1406,
60,
800,
3726,
3726,
31,
22,
79,
5712,
100,
32,
22,
18,
938,
20,
11911,
69,
10811,
28,
21,
3884,
68,
816,
19,
7099,
993,
325,
15,
17,
98,
22,
18,
14,
246,
161,
20,
107,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Thread local storage with __declspec(thread) fails in C++/CLI
===
I'm working on a project where we mix .NET code and native C++ code via a C++/CLI layer. In this solution I want to use Thread Local Storage via the __declspec(thread) declaration:
__declspec(thread) int lastId = 0;
However, at the first access of the variable, I get a NullReferenceException.
To be more precise, the declaration is done within a *ref class* (a .NET class implemented in C++/CLI).
I have already read something about __declspec(thread) does not work with delay loaded DLLs.
Am I using delay loaded DLLs automatically if I use .NET? | 0 | [
2,
9322,
375,
4326,
29,
13,
1,
9522,
7532,
12610,
5,
96,
10647,
6,
13614,
19,
272,
20512,
118,
150,
1210,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
669,
113,
95,
2917,
13,
9,
2328,
1797,
17,
1275,
272,
20512,
1797,
1197,
21,
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... |
Visual Studio reference x64 GAC
===
How can one get Visual Studio 2005/2008 to reference assemblies in the 64-bit GAC instead of the 32-bit GAC? We are settin the target platfom to x64 and the compiler is throwing the error of
> Error 2 Warning as Error: Assembly generation -- Referenced assembly 'System.Data.dll' targets a different processor Common
>
> Error 3 Warning as Error: Assembly generation -- Referenced assembly 'mscorlib.dll'
> targets a different processor Common
>
> Error 4 Assembly signing failed; output may not be signed -- The system cannot find the file specified. Common
| 0 | [
2,
3458,
1120,
2801,
993,
3470,
4369,
150,
800,
3726,
3726,
184,
92,
53,
164,
3458,
1120,
812,
118,
2753,
20,
2801,
21066,
19,
14,
4384,
8,
3326,
4369,
150,
700,
16,
14,
2512,
8,
3326,
4369,
150,
60,
95,
50,
309,
2864,
14,
2935,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I generate a report file (ODF, PDF) from a django view
===
I would like to generate a report file from a view&template in django.
Preferred file formats would be OpenOffice/ODF or PDF.
What is the best way to do this?
I do want to reuse the page layout defined in the template, possibly by redefining some blocks in a derived template.
Ideally, the report should be inserted into an existing template file so I can provide the overall page layout, headers and footer in the generated output format. | 0 | [
2,
184,
92,
31,
7920,
21,
1330,
3893,
13,
5,
111,
8736,
15,
13,
11124,
6,
37,
21,
3857,
14541,
1418,
800,
3726,
3726,
31,
83,
101,
20,
7920,
21,
1330,
3893,
37,
21,
1418,
1569,
9577,
6554,
19,
3857,
14541,
9,
5981,
3893,
13767,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
End win32 process vbscript
===
I've got the following code to end a process, but I still receive an error code 2(Access Denied).
strComputer = "."
Set objWMIService = GetObject("winmgmts:\\" & strComputer & "\root\cimv2")
Set colProcessList = objWMIService.ExecQuery("SELECT * FROM Win32_Process WHERE Name = 'MSSEARCH.exe'")
For each objProcess in colProcessList
wscript.echo objProcess.processid
intrc = objProcess.Terminate()
if intrc = 0 then wscript.echo "succesfully killed process" else wscript.echo "Could not kill process. Error code: " & intrc End if
| 0 | [
2,
241,
628,
3125,
953,
13,
20468,
8741,
800,
3726,
3726,
31,
22,
195,
330,
14,
249,
1797,
20,
241,
21,
953,
15,
47,
31,
174,
2588,
40,
7019,
1797,
172,
5,
20604,
5265,
6,
9,
13,
9729,
18448,
800,
13,
7,
9,
7,
309,
5122,
728... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Bitwise Flags abandoned ?
===
I've noticed that plenty of opensource project doesn't use BITWISE flags anymore, even if it's fully supported by programming enviroment common for web ( php/Mysql).
It's that a "lost practise" for some effective problem, or is just that a lot of php programmers doesn't know how to handle this type of implementation?
Nothing too important, just very curious :)
thanks to you all | 0 | [
2,
1142,
10474,
9318,
3092,
13,
60,
800,
3726,
3726,
31,
22,
195,
2711,
30,
7062,
16,
368,
12097,
669,
1437,
22,
38,
275,
1142,
10474,
9318,
3375,
15,
166,
100,
32,
22,
18,
2337,
1827,
34,
3143,
21314,
661,
1130,
757,
26,
2741,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
does regex comparison sconsume lots of resources?
===
i dunno, but will your machine suffer great slowdown if you use a very complex regex?
like for example the famous email validation module proposed just recently? | 0 | [
2,
630,
7953,
1706,
6050,
13,
18,
12124,
9472,
7503,
16,
2566,
60,
800,
3726,
3726,
31,
4731,
251,
15,
47,
129,
154,
1940,
6586,
374,
2276,
2968,
100,
42,
275,
21,
253,
1502,
7953,
1706,
60,
101,
26,
823,
14,
1561,
8517,
27999,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How do you pass arguments to anonymous functions in javascript?
===
I'm trying to figure out how to pass arguments to an anonymous function in javascript.
Check out this sample code and I think you will see what I mean:
<input type="button" value="Click me" id="myButton" />
<script type="text/javascript">
var myButton = document.getElementById("myButton");
var myMessage = "it's working";
myButton.onclick = function(myMessage) { alert(myMessage); };
</script>
When clicking the button the message "it's working" should appear... but the myMessage-variable inside the anonymous function is null.
This problem becomes much more evident when using jQuery since it uses alot of anonymous functions.
How do you do this? | 0 | [
2,
184,
107,
42,
1477,
10553,
20,
10364,
3719,
19,
8247,
8741,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
1465,
70,
184,
20,
1477,
10553,
20,
40,
10364,
1990,
19,
8247,
8741,
9,
2631,
70,
48,
5717,
1797,
17,
31,
277,
42,
129,
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 delete temp ASP.net files in Prod env.
===
I have deployed a new build on Production server, but I dont see the change in this version. I found out that it was caused due to old version of the DLL file under the temporary ASP.net folder C:\WINDOWS\Microsoft.NET\Framework\v2.0.50727\Temporary ASP.NET Files
In DEV environment, I can delete, but in Prod. I have restricted access to delete files inside the ASP.net temporary folder.
Can anyone tell me how can I get the new DLL files recreated immediately after I deploy the new files?
thanks. | 0 | [
2,
184,
20,
27448,
13,
9577,
28,
306,
9,
2328,
6488,
19,
895,
43,
1957,
710,
9,
800,
3726,
3726,
31,
57,
6698,
21,
78,
1895,
27,
637,
8128,
15,
47,
31,
1049,
196,
14,
753,
19,
48,
615,
9,
31,
216,
70,
30,
32,
23,
1497,
397... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tips for optimizing an sqlite database with over a gig of data in it?
===
I am working with a larger than average sqlite database (for use on both on windows and linux) and am looking to maximize the performance I get out of it. The database is to be installed on commodity hardware along with an sqlite gui. The users I am delivering this to are sql savvy but are unlikely to undertake their own optimizations (creation of indexes, setting of pragma etc.) so I am keen to get as much out of the box performance as possible (to ensure maximum usage of the data).
One issue Windows seems to throttle the execution of queries much more than Linux and another is that I am less familiar with sqlite's approach to indexing (compared to other databases such as postgres). | 3 | [
2,
11034,
26,
19259,
3335,
40,
4444,
10601,
6018,
29,
84,
21,
7175,
16,
1054,
19,
32,
60,
800,
3726,
3726,
31,
589,
638,
29,
21,
1662,
119,
862,
4444,
10601,
6018,
13,
5,
1106,
275,
27,
156,
27,
1936,
17,
13024,
6,
17,
589,
69... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I set a SQL Server script's timeout from within the script?
===
I have a large script file (nearly 300MB, and feasibly bigger in the future) that I am trying to run. It has been suggested in the comments of Gulzar's answer to my [question about it][1] that I should change the script timeout to 0 (no timeout).
What is the best way to set this timeout from within the script? At the moment I have all of this at the top of the script file in the hopes that one of them does something:
sp_configure 'remote login timeout', 600
go
sp_configure 'remote query timeout', 0
go
sp_configure 'query wait', 0
go
reconfigure with override
go
However, I'm still getting the same result and I can't tell if I'm succeeding in setting the timeout because the response from sqlcmd.exe is the world's least helpful error message:
> Sqlcmd: Error: Scripting error.
Thanks.
[1]: http://stackoverflow.com/questions/222442/sql-server-running-large-script-files | 0 | [
2,
184,
107,
31,
309,
21,
4444,
255,
8128,
3884,
22,
18,
85,
1320,
37,
363,
14,
3884,
60,
800,
3726,
3726,
31,
57,
21,
370,
3884,
3893,
13,
5,
14114,
102,
3565,
5024,
15,
17,
3686,
8198,
8818,
6197,
19,
14,
1022,
6,
30,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ruby Daemons will not start
===
I am using the ruby daemons gem to create a custom daemon for my rails project. The only problem is that when I try to start the daemons `ruby lib/daemons/test_ctl start` that it fails and will not start. The log file has this output.
\# Logfile created on Wed Oct 22 16:14:23 +0000 2008 by /
\*\*\* below you find the most recent exception thrown, this will be likely (but not certainly) the exception that made the application exit abnormally \*\*\*
\# MissingSourceFile: no such file to load -- utf8proc_native
\*\*\* below you find all exception objects found in memory, some of them may have been thrown in your application, others may just be in memory because they are standard exceptions \*\*\*
\# NoMemoryError: failed to allocate memory>
\# SystemStackError: stack level too deep>
\# fatal: exception reentered>
\# LoadError: no such file to load -- daemons>
\# LoadError: no such file to load -- active_support>
\# MissingSourceFile: no such file to load -- lib/string>
\# MissingSourceFile: no such file to load -- utf8proc_native>
It even happens when I generate a daemon (from the rails plugin) and try to run it. Does anybody know how to fix this problem? | 0 | [
2,
10811,
13127,
18,
129,
52,
799,
800,
3726,
3726,
31,
589,
568,
14,
10811,
13127,
18,
8551,
20,
1600,
21,
5816,
13127,
26,
51,
2240,
18,
669,
9,
14,
104,
1448,
25,
30,
76,
31,
1131,
20,
799,
14,
13127,
18,
13,
1,
1820,
779,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Dragging & dropping items from one list to another in a ASP.NET page?
===
I would like to move items from one list to another on a page, and I'm pretty flexible about what type of a list it is. What's the best way to do that? ASP.NET Ajax? jQuery? Anything else? | 0 | [
2,
13052,
279,
6780,
3755,
37,
53,
968,
20,
226,
19,
21,
28,
306,
9,
2328,
2478,
60,
800,
3726,
3726,
31,
83,
101,
20,
780,
3755,
37,
53,
968,
20,
226,
27,
21,
2478,
15,
17,
31,
22,
79,
1772,
13568,
88,
98,
1001,
16,
21,
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 get all installed fixed-width fonts?
===
I'm wondering if there are any simple ways to get a list of all fixed-width (monospaced) fonts installed on a user's system in C#?
I'm using .net 3.5 so have access to the WPF System.Windows.Media namespace and LINQ to get font information, but I'm not sure what I'm looking for.
I want to be able to provide a filtered list of monospaced fonts and/or pick out monospaced fonts from a larger list of fonts (as seen in the VS options dialog). | 0 | [
2,
184,
107,
31,
164,
65,
4066,
3535,
8,
3976,
43,
96,
9978,
18,
60,
800,
3726,
3726,
31,
22,
79,
5712,
100,
80,
50,
186,
1935,
2847,
20,
164,
21,
968,
16,
65,
3535,
8,
3976,
43,
96,
13,
5,
20027,
18,
15265,
6,
9978,
18,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Easy, simple to use LRU cache in java
===
I know it's simple to implement, but I want to reuse something that already exist.
Problem I want to solve is that I load configuration (from XML so I want to cache them) for different pages, roles, ... so the combination of inputs can grow quite much (but in 99% will not). To handle this 1%, I want to have some max number of items in cache...
Till know I have found org.apache.commons.collections.map.LRUMap in apache commons and it looks fine but want to check also something else. Any recommendations? | 0 | [
2,
2010,
15,
1935,
20,
275,
644,
1820,
16522,
19,
8247,
800,
3726,
3726,
31,
143,
32,
22,
18,
1935,
20,
8713,
15,
47,
31,
259,
20,
302,
3699,
301,
30,
614,
3182,
9,
1448,
31,
259,
20,
8402,
25,
30,
31,
6305,
8091,
13,
5,
266... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Nested predicates in xslt
===
Is it possible to do the equivalent of the following in xslt:
.//TagA[./TagB/[@AttrA='AttrAValue'] = 'TagBValue']
This is failing within Visual Studio 2008 with the following error:
error: Unexpected token '[' in the expression.
.//TagA[./TagB/ -->[<-- @AttrA='AttrAValue'] = 'TagBValue']
Should this be working? Is this a problem in the MS implementation of XSLT, or is there a way I can get all TagA nodes that have a TagB node whose AttrA is equal to AttrAValue and whose TagB innerText is equal to TagBValue.
Thanks in advance for your help.
Tim
| 0 | [
2,
5618,
69,
28712,
18,
19,
993,
18,
255,
38,
800,
3726,
3726,
25,
32,
938,
20,
107,
14,
4602,
16,
14,
249,
19,
993,
18,
255,
38,
45,
13,
9,
118,
118,
38,
5193,
2558,
9,
118,
8628,
220,
118,
2558,
1,
721,
1939,
3726,
22,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Find number range intersection
===
What is the best way to find out whether two number ranges intersect?
My number range is **3023-7430**, now I want to test which of the following number ranges intersect with it: <3000, 3000-6000, 6000-8000, 8000-10000, >10000. The answer should be **3000-6000** and **6000-8000**.
What's the nice, efficient mathematical way to do this in any programming language? | 0 | [
2,
477,
234,
978,
5351,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
477,
70,
1472,
81,
234,
9230,
17822,
60,
51,
234,
978,
25,
13,
1409,
1762,
2001,
8,
3828,
1762,
1409,
15,
130,
31,
259,
20,
1289,
56,
16,
14,
249,
234,
9230,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 insert/move/delete nodes in xml with Groovy?
===
for example, I have the following xml document:
def CAR_RECORDS = '''
<records>
<car name='HSV Maloo' make='Holden' year='2006'/>
<car name='P50' make='Peel' year='1962'/>
<car name='Royale' make='Bugatti' year='1931'/>
</records>
'''
and I want to move the car "Royale" up to first one, and insert a new car just after car"HSV Maloo", the result would be:
'''
<records>
<car name='Royale' make='Bugatti' year='1931'/>
<car name='HSV Maloo' make='Holden' year='2006'/>
<car name='My New Car' make='Peel' year='1962'/>
<car name='P50' make='Peel' year='1962'/>
</records>
'''
How to do it with Groovy? comments are welcome.
| 0 | [
2,
184,
20,
14692,
118,
16598,
118,
24249,
591,
16272,
19,
23504,
29,
3452,
2026,
93,
60,
800,
3726,
3726,
26,
823,
15,
31,
57,
14,
249,
23504,
4492,
45,
6312,
349,
1,
14953,
18,
800,
13,
7,
22,
13,
1,
14953,
18,
1,
13,
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... |
dynamic fonts in AS3
===
Imagine you're creating a presentation that will be translated into a dozen different languages, including ones with non-latin characters (Chinese, for instance). The client's branding style guide dictates that certain fonts are acceptable for certain languages. The content itself is required to be externalized, so that the text can be replaced without ever opening an .fla, or re-saving a graphic.
So we're talking dynamic TextField s, populated from XML, with the font swapped out to accommodate the viewer's locale - what's the most painless way to dynamically load only the fonts required, and apply them as necessary?
*(recommending that they use a font that includes characters for all languages is a cop-out, as is creating a different instance of each TextField with the font appropriate for that region embedded and showing or hiding them as need be.)* | 0 | [
2,
7782,
9978,
18,
19,
28,
240,
800,
3726,
3726,
4382,
42,
22,
99,
2936,
21,
6364,
30,
129,
44,
4331,
77,
21,
5550,
421,
2556,
15,
215,
53,
18,
29,
538,
8,
10577,
1766,
13,
5,
5824,
15,
26,
4851,
6,
9,
14,
6819,
22,
18,
19... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should Timezone be a constant or a variable?
===
I have a few places in the code where I need to use the TimeZone. I can get the timezone name using DateTime::TimeZone.
Is it reasonable to put the timezone name in a constant? Or should it be in a variable?
| 0 | [
2,
378,
85,
11661,
44,
21,
3587,
54,
21,
7612,
60,
800,
3726,
3726,
31,
57,
21,
310,
1489,
19,
14,
1797,
113,
31,
376,
20,
275,
14,
85,
11661,
9,
31,
92,
164,
14,
85,
11661,
204,
568,
1231,
891,
45,
45,
891,
11661,
9,
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... |
Raw partition access in Windows Vista
===
Accessing a raw disk partition in Windows Vista requires kernel mode control, as opposed to for instance WinXP where you can access it from user mode.
However, I've heard that when it comes to USB flash memory, a partition can still be accessed from user mode even on Windows Vista.
Is this true?
Regards
/Robert | 0 | [
2,
4333,
10711,
1381,
19,
1936,
13520,
800,
3726,
3726,
1381,
68,
21,
4333,
8582,
10711,
19,
1936,
13520,
4781,
17007,
3740,
569,
15,
28,
3499,
20,
26,
4851,
628,
396,
306,
113,
42,
92,
1381,
32,
37,
4155,
3740,
9,
207,
15,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Add warning for missing @Override annotation for interface implementation in Eclipse
===
In Eclipse 3.4.1 how can I activate a warning on a missing `@Override` annotation on a method that implements an interface method?
In the Preferences window this option:
> Java > Compiler > Errors / Warnings >
> Annotations > Missing '@Override'
> annotation
works fine for missing annotations on methods that override a superclass method, but it does nothing for interface methods.
An [answer][1] to another question suggested it is possible, but how?
[1]: http://stackoverflow.com/questions/212614/should-a-method-that-implements-an-interface-method-be-annotated-with-override#212630 | 0 | [
2,
3547,
3590,
26,
2863,
13,
1,
2549,
11891,
40,
1270,
857,
26,
6573,
6123,
19,
11652,
800,
3726,
3726,
19,
11652,
203,
9,
300,
9,
165,
184,
92,
31,
18163,
21,
3590,
27,
21,
2863,
13,
1,
2549,
11891,
1,
40,
1270,
857,
27,
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... |
Most concise way to read the contents of a file/input stream in Java?
===
What ist most concise way to read the contents of a file or input stream in Java? Do I always have to create a buffer, read (at most) line by line and so on or is there a more concise way? I wish I could do just
String content = new File("test.txt").readFully(); | 0 | [
2,
127,
29455,
161,
20,
1302,
14,
8478,
16,
21,
3893,
118,
108,
4881,
3766,
19,
8247,
60,
800,
3726,
3726,
98,
25,
38,
127,
29455,
161,
20,
1302,
14,
8478,
16,
21,
3893,
54,
6367,
3766,
19,
8247,
60,
107,
31,
550,
57,
20,
1600... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Private and Protected Members : C++
===
Can someone enlighten me as to the difference between private and protected members in classes? I understand from best practice conventions that variables and functions which are not called outside the class should be made private - but looking at my MFC project, MFC seems to favour protected.
Whats the difference and which should I use?
Thanks. | 0 | [
2,
932,
17,
3803,
443,
13,
45,
272,
20512,
800,
3726,
3726,
92,
737,
1957,
3130,
219,
55,
28,
20,
14,
2841,
128,
932,
17,
3803,
443,
19,
2684,
60,
31,
1369,
37,
246,
1345,
15117,
30,
12157,
17,
3719,
56,
50,
52,
227,
719,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I make the children appear in a custom webcontrol for ASP.NET?
===
For example, I have a custom control called SampleControl. To simplify things for this question, pretend I'm making just a Panel Control clone from scratch.
<CC:SampleControl ID="Sample1" runat="server">
<asp:Label ID="Label1" runat="server" Text="Hi"></asp:Label>
<asp:Button ID="Button1" runat="server" Text="Button1"></asp:Label>
</CC:SampleControl>
To Output:
<div id="Sample1">
<span id=Label1>Hi</span>
etc.....
</div>
Where the Code is:
public class SampleControl: WebControl
{
.....Render Stuff Goes Here.....
}
The ASP controls in the middle aren't being registered by ASP.NET. When I did a Reflector on the Panel control, I couldn't find out how they got the middle controls to render. It doesn't look like they are using a Templated Control.
When I do it, I get this error:
Parser Error
Description: An error occurred during the parsing of a resource required to service this request. Please review the following specific parse error details and modify your source file appropriately.
Any Ideas? | 0 | [
2,
184,
107,
31,
233,
14,
391,
1893,
19,
21,
5816,
2741,
12898,
26,
28,
306,
9,
2328,
60,
800,
3726,
3726,
26,
823,
15,
31,
57,
21,
5816,
569,
227,
5717,
12898,
9,
20,
28257,
564,
26,
48,
1301,
15,
8019,
31,
22,
79,
544,
114... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 xunit in a new programming language
===
Some of us still "live" in a programming environment where unit testing has not yet been embraced. To get started, the obvious first step would be to try to implement a decent framework for unit testing, and I guess xUnit is the "standard".
So what is a good starting point for implementing xUnit in a new programming language? | 0 | [
2,
17333,
993,
15464,
19,
21,
78,
3143,
816,
800,
3726,
3726,
109,
16,
182,
174,
13,
7,
5928,
7,
19,
21,
3143,
2307,
113,
1237,
4431,
63,
52,
768,
74,
15843,
9,
20,
164,
373,
15,
14,
4674,
64,
1424,
83,
44,
20,
1131,
20,
871... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Spring-WS: How to access MessageContext from Endpoint
===
What is the "canonical" way to access the MessageContext from an Endpoint?
We are using [PayloadEndpoint][1] and [AbstractMarshallingPayloadEndpoint][2] which do not expose the MessageContext to their invoke / invokeinternal methods.
[1]: http://static.springframework.org/spring-ws/sites/1.5/apidocs/org/springframework/ws/server/endpoint/PayloadEndpoint.html
[2]: http://static.springframework.org/spring-ws/sites/1.5/apidocs/org/springframework/ws/server/endpoint/AbstractMarshallingPayloadEndpoint.html | 0 | [
2,
1573,
8,
10268,
45,
184,
20,
1381,
2802,
1126,
11969,
37,
241,
3132,
800,
3726,
3726,
98,
25,
14,
13,
7,
1245,
218,
4272,
7,
161,
20,
1381,
14,
2802,
1126,
11969,
37,
40,
241,
3132,
60,
95,
50,
568,
636,
12224,
8294,
2451,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 motivate new employees?
===
COs, Managers, PMs, senior developers may i hear a few words on your experience in motivating and guiding new programmers.
| 4 | [
2,
184,
20,
13,
24271,
1373,
78,
3716,
60,
800,
3726,
3726,
326,
18,
15,
12657,
15,
6736,
18,
15,
1101,
10168,
123,
31,
990,
21,
310,
715,
27,
154,
1496,
19,
13,
24271,
1880,
17,
17273,
78,
17968,
18,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Should I create CUDA apps now, or wait for DirectX 11?
===
With Windows 7 probably going to RTM next October (and DirectX 11 with it), would it be worth waiting for DirectX 11's explicit GPGPU features, meaning it will be cross-platform (ATI/Nvidia, not Windows/Linux/Mac/Whatever); or should I create a CUDA application now? | 0 | [
2,
378,
31,
1600,
272,
5729,
4865,
18,
130,
15,
54,
1760,
26,
1744,
396,
547,
60,
800,
3726,
3726,
29,
1936,
453,
910,
228,
20,
13,
5256,
79,
328,
311,
13,
5,
290,
1744,
396,
547,
29,
32,
6,
15,
83,
32,
44,
2715,
1672,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I stop IE asking me which debugger to choose?
===
When debugging in IE, I get the option every time to chose between 'New instance of Microsoft script debugger' and 'New instance of Visual studio'. I'm fed up of having to click the yes button again after having clicking it once already in the main browser.
| 0 | [
2,
184,
107,
31,
747,
13,
660,
3379,
55,
56,
121,
2345,
11356,
20,
3538,
60,
800,
3726,
3726,
76,
121,
16254,
2762,
19,
13,
660,
15,
31,
164,
14,
4255,
352,
85,
20,
3305,
128,
13,
22,
2681,
4851,
16,
7099,
3884,
121,
2345,
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 identify a font as symbolic in java?
===
I'm currently looking for a possibility in Java to identify a font as symbolic like OpenOffice does.
Characters with the font Windings or Webdings and so on should be rendered with the correct "pictures".
Anyone an idea how to distinguish between normal fonts and fonts with symbols? | 0 | [
2,
184,
20,
5808,
21,
9978,
28,
12882,
19,
8247,
60,
800,
3726,
3726,
31,
22,
79,
871,
699,
26,
21,
4813,
19,
8247,
20,
5808,
21,
9978,
28,
12882,
101,
368,
17047,
630,
9,
1766,
29,
14,
9978,
14600,
18,
54,
2741,
3258,
18,
17,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Code Coverage on Visual Studio Team System 2008 Developer Edition (on an NUnit application)
===
Is this possible? I am looking forward to a tutorial which explains the steps to achieve this.
| 0 | [
2,
1797,
5245,
27,
3458,
1120,
173,
329,
570,
10058,
1322,
13,
5,
218,
40,
10210,
242,
3010,
6,
800,
3726,
3726,
25,
48,
938,
60,
31,
589,
699,
917,
20,
21,
29724,
56,
7346,
14,
2382,
20,
4689,
48,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
FizzBuzz using Ternary Operator
===
I've been reading up on conditional style expressions in ruby, however I came across one I couldn't quite understand(I'm still a noob!) to define the classic FizzBuzz problem. I understand the FizzBuzz problem and even wrote my own before finding the following quick solution utilising the ternary operator. If someone can explain to me how this chain works to satisfy the FizzBuzz problem it would be very much appreciated :)
for i in 0...100
puts i%3==0 ? i%5==0 ? "FizzBuzz" : "Buzz" : i%5==0 ? "Fizz" : i
end | 0 | [
2,
398,
17470,
2345,
5092,
568,
13,
8766,
1857,
6022,
800,
3726,
3726,
31,
22,
195,
74,
1876,
71,
27,
21206,
1034,
13832,
19,
10811,
15,
207,
31,
281,
464,
53,
31,
711,
22,
38,
1450,
1369,
5,
49,
22,
79,
174,
21,
90,
4995,
187... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 KeyDown event in the parent window of a Delphi Mdi Application
===
How do I get the KeyDown event to work in a Delphi (2007) MDI Applications Parent window, even if a Child window has focus?
I would like to implement a shortcut key (F1) that brings up a help screen in a MDI application, I have added the KeyDown procedure to the MDI Parent window and enabled KeyPreview in both the Parent and Child windows, but it does not work as expected.
If I put a break point in the Parents KeyDown code I can see it never executes, even it there are no child windows open. But if I add the same code to the child window it works fine.
Is there a way to get the parent window to receive the key presses, even if the child window has focus, as adding the code to 25+ forms seams a little wasteful? | 0 | [
2,
568,
1246,
2968,
807,
19,
14,
4766,
1463,
16,
21,
23030,
8138,
49,
3010,
800,
3726,
3726,
184,
107,
31,
164,
14,
1246,
2968,
807,
20,
170,
19,
21,
23030,
13,
5,
2727,
6,
8138,
49,
3767,
4766,
1463,
15,
166,
100,
21,
850,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
groovy inside ant: how to access refids from grooy that are defined by ant tags
===
I'm using a groovy code snippet in an ant build file. Inside the groovy code I'm trying to reference a fileset that has been defined outside of the groovy part, like this:
<target name="listSourceFiles" >
<fileset id="myfileset" dir="${my.dir}">
<patternset refid="mypatterns"/>
</fileset>
<groovy>
def ant = new AntBuilder()
scanner = ant.fileScanner {
fileset(refid:"myfileset")
}
...
</groovy>
</target>
When I execute this I get the following error message:
Buildfile: build.xml
listSourceFiles:
[groovy]
BUILD FAILED
d:\workspace\Project\ant\build.xml:13:
Reference myfileset not found.
What am I missing?
| 0 | [
2,
3452,
2026,
93,
572,
40,
38,
45,
184,
20,
1381,
302,
15817,
18,
37,
3452,
7452,
30,
50,
2811,
34,
40,
38,
3383,
18,
800,
3726,
3726,
31,
22,
79,
568,
21,
3452,
2026,
93,
1797,
13,
29061,
19,
40,
40,
38,
1895,
3893,
9,
572... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Testing what's written to a Java OutputStream
===
I am about to write junit tests for a XML parsing Java class that outputs directly to an OutputStream. For example `xmlWriter.writeString("foo");` would produce something like `<aTag>foo</aTag>` to be written to the outputstream held inside the XmlWriter instance. The question is how to test this behaviour. One solution would of course be to let the OutputStream be a FileOutputStream and then read the results by opening the written file, but it isn't very elegant. | 0 | [
2,
4431,
98,
22,
18,
642,
20,
21,
8247,
5196,
11260,
800,
3726,
3726,
31,
589,
88,
20,
2757,
7446,
242,
4894,
26,
21,
23504,
2017,
18,
68,
8247,
718,
30,
5196,
18,
1703,
20,
40,
5196,
11260,
9,
26,
823,
13,
1,
396,
8184,
9657,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 stream video from my application to the web?
===
I have an application that grabs video from multiple webcams, does some image processing, and displays the result on the screen. I'd like to be able to stream the video output on to the web - preferably to some kind of distribution service rather than connecting to clients directly myself.
So my questions are:
- Do such streaming distribution services exist? I'm thinking of something like ShoutCAST relays, but for video. I'm aware of ustream.tv, but I think they just take a direct webcam connection rather than allow you to send any stream.
- If so, is there a standard protocol for doing this?
- If so, is there a free library implementation of this protocol for Win32?
Ideally I'd just like to throw a frame of video in DIB format at a SendToServer(bitmap) function, and have it compress, send, and distribute it for me ;)
| 0 | [
2,
184,
92,
31,
3766,
763,
37,
51,
3010,
20,
14,
2741,
60,
800,
3726,
3726,
31,
57,
40,
3010,
30,
15555,
763,
37,
1886,
2741,
8760,
18,
15,
630,
109,
1961,
5511,
15,
17,
9412,
14,
829,
27,
14,
2324,
9,
31,
22,
43,
101,
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... |
ejabberd - LDAP authentication
===
I'm trying to configure an ejabberd installation, using LDAP authentication, but I just can't login, even with the admin user.
This is part of my ejabberd.cfg file:
%...
{auth_method, ldap}.
{ldap_servers, ["server2000.tek2000.local"]}.
{ldap_port,389}.
{ldap_uidattr, "uid"}.
{ldap_base, "dc=server2000,dc=tek2000,dc=com"}.
{ldap_rootdn, "tempadm@tek2000.local"}.
{ldap_password, "secret"}.
%...
What am I missing?
I must say that, with OpenFire, I can connect using this credentials/configuration.
I'm using Spark as my client application.
Thanks
| 2 | [
2,
13,
62,
1004,
17031,
43,
13,
8,
644,
20472,
27963,
800,
3726,
3726,
31,
22,
79,
749,
20,
1065,
15951,
40,
13,
62,
1004,
17031,
43,
7758,
15,
568,
644,
20472,
27963,
15,
47,
31,
114,
92,
22,
38,
6738,
108,
15,
166,
29,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
RFC 1123 Date Representation in Python?
===
Is there a fairly easy way to convert a datetime object into an RFC 1123 (HTTP/1.1) date/time string, i.e. a string with the format
Sun, 06 Nov 1994 08:49:37 GMT
Using `strftime` does not work, since the strings are locale-dependant. Do I have to build the string by hand?
| 0 | [
2,
17492,
547,
2001,
1231,
5442,
19,
20059,
60,
800,
3726,
3726,
25,
80,
21,
6647,
2010,
161,
20,
8406,
21,
1231,
891,
3095,
77,
40,
17492,
547,
2001,
13,
5,
21127,
11698,
9,
165,
6,
1231,
118,
891,
3724,
15,
31,
9,
62,
9,
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 you store uploaded files in a filesystem?
===
I'm trying to figure out the best way to store user uploaded files in a file system. The files range from personal files to wiki files. Of course, the DB will point to those files by someway which I have yet to figure out.
Basic Requirements:
- Fairy Decent Security so People Can't Guess Filenames
(Picture001.jpg, Picture002.jpg,
Music001.mp3 is a big no no)
- Easily Backed Up & Mirrorable (I prefer a way so I don't have to copy the entire HDD every single time I want to backup. I like the idea of backing up just the newest items but I'm flexible with the options here.)
- Scalable to millions of files on multiple servers if needed.
| 0 | [
2,
184,
107,
42,
1718,
23782,
6488,
19,
21,
3893,
10724,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
1465,
70,
14,
246,
161,
20,
1718,
4155,
23782,
6488,
19,
21,
3893,
329,
9,
14,
6488,
978,
37,
1319,
6488,
20,
13,
17375,
6488,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Initialisation of memeber inside structure
===
Why can't we initialize members inside the structure ?
example:
struct s {
int i=10;
};
Thanks in advance | 0 | [
2,
2104,
4330,
16,
55,
790,
2102,
572,
1411,
800,
3726,
3726,
483,
92,
22,
38,
95,
2104,
2952,
443,
572,
14,
1411,
13,
60,
823,
45,
13,
10346,
13,
18,
13,
1,
19,
38,
31,
3726,
1036,
73,
13,
1,
73,
3669,
19,
3612,
3,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
RJS/Javascript conventions in rails
===
I'm starting to look into the whole world of RJS and Prototype/jQuery in rails and am a little bit confused. There seems to be no clear line of where to use one or the other.
Say i wanted one of the "Active, Hot, Week" tabs like the ones here on SO. When pressing one of them i want to remove a css class (like "active-tab") from the one i was on and add it to the one i clicked on. Then i also want to reload the div containing the items and put in the new items into it.
Seems the class-changing thing would be easiest to do in pure javascript, say put the code in application.js and then updating the div with the content would obviously be easiest in RJS. But what _should_ one do? | 0 | [
2,
13,
23008,
18,
118,
1004,
1385,
8741,
15117,
19,
2240,
18,
800,
3726,
3726,
31,
22,
79,
1422,
20,
361,
77,
14,
979,
126,
16,
13,
23008,
18,
17,
7063,
118,
728,
8190,
93,
19,
2240,
18,
17,
589,
21,
265,
1142,
4230,
9,
80,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
A little help with class hierarchy
===
Okay I need a little help, mainly because what I've done feels messy but I can't think of a another solution that fits better.
I'm writing a MUD engine and I've just started on the game object model, which needs to be extensible.
Now I have a class called MudObject, and another class called Container, A container can contain multiple MudObjects but is a MudObject itself, however MudObjects need to know what they are contained in
So they look something like this
public abstract class MudObject
{
Container containedBy;
}
public abstract class Container : MudObject
{
List<MudObject> Contains;
}
<small>(please note these are just example and some qualifiers and access modifiers, properties and such are missed off)</small>
Now just this in itself seems messy. But lets add something else to the mix
Item is a MudObject that all visual items (such as weapons) will be inherited from, however some of these need to be containers too (like chests). But theres no such as multiple inheritance in c#, So it comes down to interfaces, the best choice would be to make the container an interface (as far as I can see) However there was a reason I didn't want it to be, that being that adding an MudObject to a container will cause the container to update the MudObjects containedBy value.
So question is, any ideas that would make this work, or am I falling into the trap of making things too complicated? If so what else could you suggest? | 0 | [
2,
21,
265,
448,
29,
718,
14417,
800,
3726,
3726,
1705,
31,
376,
21,
265,
448,
15,
2011,
185,
98,
31,
22,
195,
677,
5121,
21503,
47,
31,
92,
22,
38,
277,
16,
21,
226,
4295,
30,
2742,
18,
574,
9,
31,
22,
79,
1174,
21,
5006,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Reszie a JPanel in line with a JDialog
===
I've got a JDialog which contains a series of JPanels in a CardLayout. Some of these panels contain JTables which I would like to be resized in line with any resizing of the JDialog. I am not sure how to achieve this and any help would be greatly appreciated.
At present the tables simply remain their current size and do not scale. I'm sure its something simple but I'm having trouble locating the exact approach needed.
Many thanks in advance. I will provide any more information if required. | 0 | [
2,
10719,
9544,
21,
487,
3206,
532,
19,
293,
29,
21,
487,
4286,
5567,
800,
3726,
3726,
31,
22,
195,
330,
21,
487,
4286,
5567,
56,
1588,
21,
231,
16,
487,
3206,
6798,
19,
21,
2056,
4414,
1320,
9,
109,
16,
158,
9449,
3717,
487,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's each SVN automatic conflict resolution action performs?
===
I wrote a batch script which recursively updates my source code against the company's working base. When conflicts occur, it prompts for an action. What is the difference between 'base' and 'theirs-full'? Does 'mine-full' means "keep my changes at the working copy, I'll commit them later"? | 0 | [
2,
98,
22,
18,
206,
13,
18,
16578,
6715,
2930,
4302,
1028,
11563,
60,
800,
3726,
3726,
31,
738,
21,
13064,
3884,
56,
302,
24244,
102,
16779,
51,
1267,
1797,
149,
14,
237,
22,
18,
638,
1000,
9,
76,
10344,
3744,
15,
32,
11443,
135... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tooltip for a line of text
===
<td title="this is a really long line that I'm going to truncate">this is a really long line that I'm going to trunc ...</td>
Is this the correct way to do it? | 0 | [
2,
5607,
10169,
26,
21,
293,
16,
1854,
800,
3726,
3726,
13,
1,
38,
43,
581,
3726,
7,
1565,
25,
21,
510,
175,
293,
30,
31,
22,
79,
228,
20,
22328,
62,
7,
1,
1565,
25,
21,
510,
175,
293,
30,
31,
22,
79,
228,
20,
8600,
6897,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Moving away from VSS
===
We are team of few Delphi developers who have been using VSS since years (I know it's a pity), but we don't use any of the advanced features of VCS, so it was working fine in many cases (but some times it was driving me crazy :( ).
The good thing that we have with VSS that we use third-party plug-ings to integrate VSS with Delphi, which is working great, but now when our projects becomes larger, and we would like to move a way from VSS>
I have looked at few other VCS (free and commercial) and found most of them seems be made for Linux guys, and you have to use command line for many admin work(I know I'm windows guy :P).
What I'm looking for the new Version control that it should be easy to use and to maintain and Integrated nicely with Delphi IDE (D2007), or at least have a good UI for the Admins an developers. | 0 | [
2,
1219,
229,
37,
4611,
18,
800,
3726,
3726,
95,
50,
173,
16,
310,
23030,
10168,
72,
57,
74,
568,
4611,
18,
179,
122,
13,
5,
49,
143,
32,
22,
18,
21,
13340,
6,
15,
47,
95,
221,
22,
38,
275,
186,
16,
14,
2255,
967,
16,
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... |
Profiler for Sql CE
===
i wonder if there is something similar to Sql Profiler for Sql Server Compact Edition?
i use SqlCE as backend for a desktop application and it would be really great to have something like sql profiler for this embedded database.
or at least something simliar to the NHibernate show_sql feature...
any ideas?
thanks
j. | 0 | [
2,
5296,
139,
26,
4444,
255,
4000,
800,
3726,
3726,
31,
2666,
100,
80,
25,
301,
835,
20,
4444,
255,
5296,
139,
26,
4444,
255,
8128,
8285,
1322,
60,
31,
275,
4444,
255,
1105,
28,
97,
2451,
26,
21,
17404,
3010,
17,
32,
83,
44,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.