unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Tool for generating C# classes from NHibernate mappings files?
===
What tool is there for generating C# classes from NHibernate mappings files? | 0 | [
2,
5607,
26,
13500,
272,
5910,
2684,
37,
12109,
15191,
8820,
13305,
18,
6488,
60,
800,
3726,
3726,
98,
5607,
25,
80,
26,
13500,
272,
5910,
2684,
37,
12109,
15191,
8820,
13305,
18,
6488,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
C# Windows Forms - Best Practice Exception Handling?
===
I'm currently in the process of writing my first Windows Forms application. I've read a few C# books now so I've got a relatively good understanding of what language features C# has to deal with exceptions. They're all quite theoretical however so what I haven't got yet is a feel for how to translate the basic concepts into a good exception-handling model in my application.
Would anyone like to share any pearls of wisdom on the subject? Post any common mistakes you've seen newbies like myself make, and any general advice on handling exceptions in a way that will my application more stable and robust.
The main things I'm currently trying to work out are:
- When should I re-throw an exception?
- Should I try to have a central error-handling mechanism of some kind?
- Do handling exceptions which might be thrown have a performance hit compared with pre-emptively testing things like whether a file on disk exists?
- Should all executable code be enclosed in try-catch-finally blocks?
- Are there any times when an empty catch block might be acceptable?
All advice gratefully received!
| 0 | [
2,
272,
5910,
1936,
1997,
13,
8,
246,
1345,
5391,
7988,
60,
800,
3726,
3726,
31,
22,
79,
871,
19,
14,
953,
16,
1174,
51,
64,
1936,
1997,
3010,
9,
31,
22,
195,
1302,
21,
310,
272,
5910,
964,
130,
86,
31,
22,
195,
330,
21,
310... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 does Visual Studio take so long to delete a file
===
Why does Visual studio take so long to delete a file from the solution tree? The app freezes and sits there for what feels like an eternity.
If I delete the file from the file system first, then delete it in the solution it happens instantly.
Is there an option I can set somewhere to avoid this? | 0 | [
2,
483,
630,
3458,
1120,
247,
86,
175,
20,
27448,
21,
3893,
800,
3726,
3726,
483,
630,
3458,
1120,
247,
86,
175,
20,
27448,
21,
3893,
37,
14,
4295,
1541,
60,
14,
4865,
11551,
18,
17,
7550,
80,
26,
98,
5121,
101,
40,
14548,
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 create an ActiveRecord relationship to an ActiveResource object?
===
Let's say I'm writing a Library application for a publishing company who already has a People application.
So in my Library application I have
class Person < ActiveResource::Base
self.site = "http://api.people.mypublisher.com/"
end
and now I want to store `Article`s for each `Person`:
class Article < ActiveRecord::Base
belongs_to :person, :as => :author
end
I imagine I'd have the following table in my database:
Articles
id (PK) | title (string) | body (text) | author_id (integer)
`author_id` isn't exactly a Foreign-Key, since I don't have a People table. That leaves several questions:
1. how do I tell my `Person` `ActiveResource` object that it `has_many` `Articles`?
2. Will `Articles.find(:first).author` work? Will `belongs_to` even work given that there's no `ActiveRecord` and no backing table? | 0 | [
2,
184,
107,
31,
1600,
40,
1348,
14953,
1429,
20,
40,
1348,
99,
12097,
3095,
60,
800,
3726,
3726,
408,
22,
18,
395,
31,
22,
79,
1174,
21,
1248,
3010,
26,
21,
3107,
237,
72,
614,
63,
21,
148,
3010,
9,
86,
19,
51,
1248,
3010,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Comparison Functor Types vs. operator<
===
In the [Google C++ Style Guide][1], the [section on Operator Overloading][2] recommends against overloading *any* operators ("except in rare, special circumstances"). Specifically, it recommends:
> In particular, do not overload
> `operator==` or `operator<` just so that
> your class can be used as a key in an
> STL container; instead, you should
> create equality and comparison functor
> types when declaring the container.
I'm a little fuzzy on what such a functor would look like, but my main question is, *why* would you want to write your own functors for this? Wouldn't defining `operator<`, and using the standard `std::less<T>` function, be simpler? Is there any advantage to using one over the other?
[1]: http://google-styleguide.googlecode.com/svn/trunk/cppguide.xml
[2]: http://google-styleguide.googlecode.com/svn/trunk/cppguide.xml#Operator_Overloading | 0 | [
2,
6050,
2414,
150,
2153,
2551,
4611,
9,
6022,
1,
800,
3726,
3726,
19,
14,
636,
16111,
4875,
272,
20512,
1034,
3378,
500,
2558,
165,
500,
15,
14,
636,
10579,
27,
6022,
84,
16866,
500,
2558,
135,
500,
12360,
18,
149,
84,
16866,
163... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
compare strings in Bourne Shell
===
I need to compare strings in shell:
var1="mtu eth0"
if [ "$var1" == "mtu *" ]
then
# do something
fi
But obviously the "*" doesn't work in Shell. Is there a way to do it?
| 0 | [
2,
11590,
7887,
19,
13,
8095,
3593,
800,
3726,
3726,
31,
376,
20,
11590,
7887,
19,
3593,
45,
4033,
165,
3726,
7,
79,
2473,
13,
6268,
387,
7,
100,
636,
13,
7,
4403,
3311,
165,
7,
800,
3726,
13,
7,
79,
2473,
1637,
7,
13,
500,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best practice for JPA/Hibernate entity classes and synchronization?
===
It seems like most examples of JPA/Hibernate entity bean classes I've seen do no explicit synchronization. Yet, it is possible to call getters/setters on those objects in the context of building up a transaction. And it's possible for those methods to be called across multiple threads (although maybe that's unusual and weird).
It seems like if it is built up across multiple threads then it's possible for changes to object state to be lost, which would be sad.
So, is leaving out synchronization best practice? Is the Hibernate instrumented code taking care of proper synchronization for me?
As an example:
@Entity
public class Ninja {
@Id @GeneratedValue
private Long id;
@Column
private String name;
@Column
private int throwingStars;
public Ninja() {}
public int getThrowingStars() { return throwingStars; }
public void addThrowingStar() { throwingStars += 1; }
}
Do the throwing star methods need synchronization? I sure don't want my ninja to lose any throwing stars. | 0 | [
2,
98,
25,
14,
246,
1345,
26,
487,
1060,
118,
8630,
106,
8820,
9252,
2684,
17,
13,
16023,
1829,
60,
800,
3726,
3726,
32,
2206,
101,
127,
3770,
16,
487,
1060,
118,
8630,
106,
8820,
9252,
15322,
2684,
31,
22,
195,
541,
107,
90,
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... |
Selecting a node in virtualized TreeView with WPF
===
Is there a way to select manually a node in virtualizing TreeView and then bring it into view?
The data model I'm using with my TreeView is implemented based on the VM-M-V model. Each TreeViewItem's IsSelected property is binded to a corresponing property in ViewModel. I've also created a listener for TreeView's ItemSelected event where I call BringIntoView() for the selected TreeViewItem.
The problem with this approach seems to be that the ItemSelected event won't be raised until the actual TreeViewItem is created. So with the virtualization enabled node selection won't do anything until the TreeView is scrolled enough and then it jumps "magically" to the selected node when the event is finally raised.
I'd really like to use virtualization because I have thousands of nodes in my tree and I've already seen quite impressive performance improvements when the virtualization has been enabled. | 0 | [
2,
20764,
21,
15421,
19,
6599,
1333,
1541,
4725,
29,
619,
7721,
800,
3726,
3726,
25,
80,
21,
161,
20,
5407,
23671,
21,
15421,
19,
6599,
3335,
1541,
4725,
17,
94,
1499,
32,
77,
1418,
60,
14,
1054,
1061,
31,
22,
79,
568,
29,
51,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
making my ajax updated div fade in.
===
I have this code that performs an ajax call and loads the results into two duplicate divs every time a dropdown is changed. I want the results to be faded into the div, to give a more obvious indication that something has changed, as its so seamless its sometimes hard to notice the change!
print("$('.ajaxdropdown').change(function(){
$.ajax({
type: "GET",
url: "/includes/html/gsm-tariff.php",
data: "c_name="+escape($(this).val()),
success: function(html){
$("#charges-gsm").html(html);
//i want to fade result into these 2 divs...
$("#charges-gsm-faq").html(html);
$("#charges-gsm-prices").html(html);
}
});
});");
I've tried appending the fadein method and a few other things, but no joy. | 0 | [
2,
544,
51,
20624,
6372,
13,
12916,
11381,
19,
9,
800,
3726,
3726,
31,
57,
48,
1797,
30,
11563,
40,
20624,
645,
17,
19069,
14,
1736,
77,
81,
19429,
13,
12916,
18,
352,
85,
21,
2804,
2968,
25,
1015,
9,
31,
259,
14,
1736,
20,
44... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What do the letter codes in Oracle user_contraints table's constraint_type column stand for?
===
select distinct constraint_type from user_constraints;
C
-
C
P
R
U
Seems P means primary key and R means foreign key, correct? What are U and C?
| 0 | [
2,
98,
107,
14,
1748,
11358,
19,
15759,
4155,
1,
1126,
11809,
38,
18,
859,
22,
18,
28804,
1,
4474,
4698,
1261,
26,
60,
800,
3726,
3726,
5407,
4421,
28804,
1,
4474,
37,
4155,
1,
12124,
11809,
38,
18,
73,
272,
13,
8,
272,
351,
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 Digitally "Sign" a document
===
I don't like paper documents. I like everything stored on a server. I'd like to avoid printing, signing, and scanning, if possible.
<b>How do I get signatures from people to sign-off on forms and still keep it digital?</b>
| 0 | [
2,
184,
20,
21253,
13,
7,
11255,
7,
21,
4492,
800,
3726,
3726,
31,
221,
22,
38,
101,
1397,
4374,
9,
31,
101,
796,
8214,
27,
21,
8128,
9,
31,
22,
43,
101,
20,
2658,
7312,
15,
5479,
15,
17,
15863,
15,
100,
938,
9,
13,
1,
220... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Recommended Hardware to Support Full Text Search in SQL 2005
===
What is the recommended hardware specifications to support full text search in SQL 2005?
We are looking to go in production and I want to make sure the current hardware can accommodate it.
| 0 | [
2,
5773,
7610,
20,
555,
503,
1854,
2122,
19,
4444,
255,
812,
800,
3726,
3726,
98,
25,
14,
5773,
7610,
17971,
20,
555,
503,
1854,
2122,
19,
4444,
255,
812,
60,
95,
50,
699,
20,
162,
19,
637,
17,
31,
259,
20,
233,
562,
14,
866,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Firebird stored procedure solution
===
my goal is to write a stored proc that can collect all field values from multiple rows into one single output variable (maybe varchar(some_length)). It may seem strange solution but i've quite positive its the only one i can use at that situation im in. I have not used Firebird before and stored procs look way different than in other well-known db systems.
My Firebird is 1.5 and dialect 3 (not sure what it means).
So maybe someone could help me with a algorithm example. | 0 | [
2,
535,
8490,
8214,
7004,
4295,
800,
3726,
3726,
51,
1195,
25,
20,
2757,
21,
8214,
13,
15617,
30,
92,
5543,
65,
575,
4070,
37,
1886,
11295,
77,
53,
345,
5196,
7612,
13,
5,
5138,
4033,
5433,
5,
3220,
1,
6325,
6,
6,
9,
32,
123,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# Set collection?
===
Does anyone know if there is a good equivelent to Java's Set collection in C#.
It's one of the few things I miss from having moved to C#.
I am aware that you can have a "pretend" set using a Dictionary or Hashtable and only bothering to populate the keys. But it's not very elegant.
It's wierd every other way I turn in C# somone seems to have thought of a solution and built it into the framework, except for sets... | 0 | [
2,
272,
5910,
309,
1206,
60,
800,
3726,
3726,
630,
1276,
143,
100,
80,
25,
21,
254,
13,
9629,
195,
13465,
20,
8247,
22,
18,
309,
1206,
19,
272,
5910,
9,
32,
22,
18,
53,
16,
14,
310,
564,
31,
1501,
37,
452,
385,
20,
272,
5910... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Gain Exclusive Access to SQL Server 2005 DB to restore?
===
Whenever I restore a backup of my database in SQL Server I am presented with the following error:
Msg 3101, Level 16, State 1, Line 1
Exclusive access could not be obtained because the database is in use.
Msg 3013, Level 16, State 1, Line 1
RESTORE DATABASE is terminating abnormally.
Usually to get around this I just restart the server. This was fine when we were developing on our local instance on our dev machines. But we have a few programmers that need to access the database and the logistics of having everyone script their changes and drop them into Subversion was becoming a nightmare. Regardless our simple solution was to put it on a shared server in the office and backup the server occasionally incase someone screwed up the data.
Well I screwed up the data and need to restore. Unfortunately, I have another co-worker in the office who is working on another project and is using the same database server for development. To be nice I'd like to restore without restarting the SQL Server and possibly disrupting his work.
Is there a way to script in T-SQL to be able to take exclusive access or to drop all connections?
| 0 | [
2,
184,
20,
3288,
6753,
1381,
20,
4444,
255,
8128,
812,
13,
9007,
20,
8454,
60,
800,
3726,
3726,
6634,
31,
8454,
21,
10119,
16,
51,
6018,
19,
4444,
255,
8128,
31,
589,
1831,
29,
14,
249,
7019,
45,
4235,
263,
203,
12811,
15,
662,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Select Poorly Used Start and End Dates From Facility Table
===
I'm using DB2, although a solution using any flavor of SQL would likely be easy enough for me to convert.
I didn't design this database, or the application that uses the database. I haven't the power to change this application, how it works, or the data. Because it defies what I consider to be conventional use of a start and an end date, I am struggling with writing something as simple as a select for a specific point in time.
Here are the relevant/edited parts of the table:
OBJECTID FACILITY_ID START_DATE END_DATE FACILITY_NAME
1001 500 1/1/1980 5/1/2000 Really Old Name
1002 500 1/1/1980 1/1/2006 Old Name
1003 500 1/1/1980 null Current Name
1004 501 1/1/1980 3/1/2008 Closed Facility Name
1004 502 1/1/1980 null Another Current Name
What I want to return, are the records which are valid for 7/1/2005:
OBJECTID FACILITY_ID START_DATE END_DATE FACILITY_NAME
1002 500 1/1/1980 1/1/2006 Old Name
1004 501 1/1/1980 3/1/2008 Closed Facility Name
1004 502 1/1/1980 null Another Current Name
I'm trying to avoid subselects, but understand they may be necessary. If I do need a subselect, I'd like to keep it limited to one. Looking between the start and end date doesn't work, because it doesn't return facilities which have only one record with a null end date. Adding an OR condition to include end dates which are null may return more than one record in some cases. This problem seems so simple on the service, that I must be missing a ridiculously obvious solution. Does anyone have any ideas? | 0 | [
2,
5407,
10614,
147,
799,
17,
241,
4076,
37,
2646,
859,
800,
3726,
3726,
31,
22,
79,
568,
13,
9007,
135,
15,
419,
21,
4295,
568,
186,
11974,
16,
4444,
255,
83,
1720,
44,
2010,
511,
26,
55,
20,
8406,
9,
31,
223,
22,
38,
704,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Access parent's parent from javascript object
===
Somthing like
var life= {
users : {
guys : function(){ this.SOMTHING.mameAndDestroy(this.girls); },
girls : function(){ this.SOMTHING.kiss(this.boys); },
},
mameAndDestroy : function(group){ },
kiss : function(group){ }
};
this.SOMTHING is what I imagine the format is, but it might not be. What will step back up to the parent of an object?
| 0 | [
2,
1381,
4766,
22,
18,
4766,
37,
8247,
8741,
3095,
800,
3726,
3726,
86,
79,
96,
68,
101,
4033,
201,
3726,
13,
1,
3878,
13,
45,
13,
1,
2776,
13,
45,
1990,
5,
6,
1,
48,
9,
10723,
96,
68,
9,
540,
790,
290,
28764,
5,
1565,
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... |
Free oracle development tools.
===
I'm currently using Oracle Developer Tools for Visual Studio. The plug-in plays nicely with VS and I don't have to start another app. to write stored procs etc. I also like the ability to check-in, check-out (from VSS) and run the scripts.
But I have few complaints as well:
- It is inconvenient to use the server
explorer to browse and find stuff. For
example table definitions,
constraints etc.
- The connection to the oracle server
keeps dropping after sometime.
- The quick search doesn't save
previous searches.
So my question is: Are there any free or less expensive tools that can do the above plus the source control stuff (need not be a VS plug-in)?
I have already tried Toad and SQL Developer. Apart from not-so-neat interface Toad looses the cursor position after checking-in - which is frustrating. And SQL Developer doesn't support VSS. Are there special settings for these tools? | 0 | [
2,
551,
15759,
522,
4672,
9,
800,
3726,
3726,
31,
22,
79,
871,
568,
15759,
10058,
4672,
26,
3458,
1120,
9,
14,
10922,
8,
108,
1533,
24050,
29,
4611,
17,
31,
221,
22,
38,
57,
20,
799,
226,
4865,
9,
20,
2757,
8214,
13,
15617,
18... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Resources for working with video feeds in C#
===
I'm starting to get into a side project that I hope to pull in frames from several small IP cameras, perhaps do a bit of motion detection and redisplay them in a form with alerts.
Does anyone have some good resources or similar projects that I could use to get acquainted with the ins and outs? I'm using C# 3.5 with SP1 in VS2008 | 0 | [
2,
2566,
26,
638,
29,
763,
17058,
19,
272,
5910,
800,
3726,
3726,
31,
22,
79,
1422,
20,
164,
77,
21,
270,
669,
30,
31,
1376,
20,
2201,
19,
12809,
37,
238,
284,
15735,
8688,
15,
1774,
107,
21,
1142,
16,
2422,
11643,
17,
402,
40... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you deal with 1..n relationships in a relational database?
===
Let's look at an example - books. A book can have 1..n authors. An author can have 1..m books. What is a good way to represent all of the authors of a book?
I came up with an idea to create a Books table and an Authors table. The Authors table has a primary AuthorID key the author's name. The Books table has a primary Book ID and metadata about the book (title, publication date, so on). However, there needs to be a way to link the books to authors and authors to books. And this is where the problem is.
Let's say we have three books by Bob. However, on one book, he wrote it as Bob, PhD. Another he wrote as Dr. Bob, and a third he wrote as Dr. Robert. I want to be able to identify the fact that these authors are, in reality, the same person but credited under different names. I also want to distinguish Bob from another Bob who wrote different books.
Now let's also add in another part to an application, a Person table that keeps track of interesting people. And let's say that Bob is an interesting person. I want to not only say that the author of all three books is Bob, but that this interesting Bob is the same Bob as the author Bob.
So what strategies exist for such potentially complicated mapping, while ensuring that the book authors are identified by the name on the cover? | 0 | [
2,
184,
107,
42,
1183,
29,
137,
9,
9,
103,
5833,
19,
21,
5827,
192,
6018,
60,
800,
3726,
3726,
408,
22,
18,
361,
35,
40,
823,
13,
8,
964,
9,
21,
360,
92,
57,
137,
9,
9,
103,
5152,
9,
40,
1314,
92,
57,
137,
9,
9,
79,
96... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Persisting Tree Structures as Directory Trees
===
I was wondering as to the practicalities of storing an in memory tree structure as directory tree for persistence purposes.
###What would be the negative performance issues of such an approach ? | 0 | [
2,
22084,
68,
1541,
3815,
28,
16755,
1913,
800,
3726,
3726,
31,
23,
5712,
28,
20,
14,
5713,
3808,
16,
25615,
40,
19,
1912,
1541,
1411,
28,
16755,
1541,
26,
28584,
4612,
9,
6926,
5910,
5910,
608,
83,
44,
14,
3682,
956,
1549,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Flat File Repair Tool
===
Scenario: Attempting to import many (>100), large(>1M recs) flat-files (csv).
Problem: Many records are missing field delimiters.
Asking: Is there a parsing tool that will attempt to define and validate the file and allow you to make "in-line" corrections? | 0 | [
2,
1844,
3893,
5612,
5607,
800,
3726,
3726,
12705,
45,
6314,
20,
9010,
151,
13,
5,
1,
4031,
6,
15,
370,
5,
1,
165,
79,
6042,
18,
6,
1844,
8,
16877,
18,
13,
5,
6824,
710,
6,
9,
1448,
45,
151,
742,
50,
2863,
575,
121,
20565,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 differences between the Builder, Factory Method, and Abstract Factory patterns?
===
A program receives a list of Messages (base type). Each message in the list has to be processed according to it's type (descendant type). However, different messages need different inputs in order to be processed correctly.
What is the following technique called? (I haven't checked this code in a compiler)
abstract class MessageProcessor
{
public static MessageProcessor GetProcessor(Message message, DataDomain data)
{
if (message is FooMessage)
{
return new FooMessageProcessor(data.Name, data.Classification);
}
else if (message is BarMessage)
{
return new BarMessageProcessor(data.AccountNo, data.CreditLimit);
}
else
throw new SomeException("Unrecognized type");
}
public abstract void Process();
}
And this one?
static class MessageProcessorFactory
{
public static MessageProcessor GetProcessor(Message message, DataDomain data)
{
if (message is FooMessage)
{
return new FooMessageProcessor(data.Name, data.Classification);
}
else if (message is BarMessage)
{
return new BarMessageProcessor(data.AccountNo, data.CreditLimit);
}
else
throw new SomeException("Unrecognized type");
}
}
And what is it called if I can inject the ProcessBuilder class into a MessageProcessor (using a property or Setter) and then call Process?
What technique would be the best pattern for solving this problem? | 0 | [
2,
98,
50,
14,
4921,
128,
14,
14960,
15,
3129,
2109,
15,
17,
8502,
3129,
6282,
60,
800,
3726,
3726,
21,
625,
8359,
21,
968,
16,
7561,
13,
5,
8436,
1001,
6,
9,
206,
2802,
19,
14,
968,
63,
20,
44,
16697,
496,
20,
32,
22,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How many active ASP.NET developers are there?
===
I'm looking for metrics on how many ASP.NET developers are actively using ASP.NET.
If you have links to reliable metrics I would be interested to see them. | 4 | [
2,
184,
151,
1348,
28,
306,
9,
2328,
10168,
50,
80,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
11544,
18,
27,
184,
151,
28,
306,
9,
2328,
10168,
50,
8754,
568,
28,
306,
9,
2328,
9,
100,
42,
57,
6271,
20,
11398,
11544,
18,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Organization of JUnit tests in projects
===
What would you consider best practice for organizing JUnit tests in a project, and why? For example, do you keep your tests next to the classes they test? Do you put them in a separate but parallel package structure? Do you use a different organization strategy entirely? | 0 | [
2,
1165,
16,
7446,
242,
4894,
19,
2314,
800,
3726,
3726,
98,
83,
42,
3563,
246,
1345,
26,
11725,
7446,
242,
4894,
19,
21,
669,
15,
17,
483,
60,
26,
823,
15,
107,
42,
643,
154,
4894,
328,
20,
14,
2684,
59,
1289,
60,
107,
42,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Loading content as the user scrolls down.
===
I am building a blog type page, and I want to load items into the page as the user scrolls down, much like Google Reader, or Soup.io. How would you go about achieving this effect? I've seen some examples which read the height of the page, and have an onScroll even attached to the window so that as the user scrolls down we can test to see if they've scrolled down far enough to warrant loading more items. Soup.io's implementation seems to remove the old items as you scroll down so that the browser isn't dealing with an ever-increasingly large DOM tree. Which javascript libraries would be best suited to this task? | 0 | [
2,
12797,
2331,
28,
14,
4155,
12159,
18,
125,
9,
800,
3726,
3726,
31,
589,
353,
21,
8146,
1001,
2478,
15,
17,
31,
259,
20,
6305,
3755,
77,
14,
2478,
28,
14,
4155,
12159,
18,
125,
15,
212,
101,
8144,
7765,
15,
54,
11554,
9,
196... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
c / c++ compiler warnings, do you clean up all your code to remove them or leave them in?
===
I've worked on many projects where I've been given code by others to update. More often than not I compile it and get about 1,000+ compiler warnings. When I see compiler warnings they make me feel dirty, so my first task is to clean up the code and remove them all. Typically I find about a dozen problems like uninitialized variables such.
I don't understand why people leave them in and don't have perfectly clean compiles with no warnings. Am I missing something? Is there any valid reason to just leave them? Any horror stories to share? | 0 | [
2,
272,
13,
118,
272,
20512,
21486,
3590,
18,
15,
107,
42,
2745,
71,
65,
154,
1797,
20,
4681,
105,
54,
767,
105,
19,
60,
800,
3726,
3726,
31,
22,
195,
577,
27,
151,
2314,
113,
31,
22,
195,
74,
504,
1797,
34,
654,
20,
11100,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 would you do a "not in" query with Linq?
===
I have 2 collections which have an Email property in both collections. I need to get a list of the items in the first list where the Email does not exist in the second list. With SQL I would just use "not in" but I do not know the equivalent in Linq.
How is that done?
So far I have a join, like...
var matches = from item1 in list1
join item2 in list2 on item1.Email equals item2.Email
select new { Email = list1.Email };
But I cannot join since I need the difference and the join would fail. I need some way of using Contains or Exists I believe. I just have not found an example to do that yet. | 0 | [
2,
184,
83,
42,
107,
21,
13,
7,
1270,
19,
7,
25597,
29,
6294,
1251,
60,
800,
3726,
3726,
31,
57,
172,
5721,
56,
57,
40,
8517,
1354,
19,
156,
5721,
9,
31,
376,
20,
164,
21,
968,
16,
14,
3755,
19,
14,
64,
968,
113,
14,
8517,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 tell if a URL parameter needs to be encoded in Java
===
I'm writing a Java app that is accepting URL parameter values that may or may not be encoded. I need an easy way to tell whether or not I need to encode the parameter string.
In other words, I want a function `boolean needsEncoding(String param)`, which will return true if I pass in the String "foo@test.com", and false if I pass in "foo%40test.com". The problem with this idea is that this is ambiguous. How would I know whether or not the "%" sign in the latter string should be encoded? One way to handle this is to modify my contract - require clients to pass in un-encoded strings so that I know I always need to encode them. Thoughts? | 0 | [
2,
184,
20,
494,
100,
21,
287,
6362,
18906,
2274,
20,
44,
13665,
19,
8247,
800,
3726,
3726,
31,
22,
79,
1174,
21,
8247,
4865,
30,
25,
10894,
287,
6362,
18906,
4070,
30,
123,
54,
123,
52,
44,
13665,
9,
31,
376,
40,
2010,
161,
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... |
Which graphic file format are supported by browsers?
===
JPEG, GIF and PNG can be displayed with the img tag and will work in all browsers, the object element can be use for displaying images specifying its MIME type, but what other graphic formats are supported by img or object tag in most broswers without installing plugins? (TIF, SVG, PCX, PICT, etc..) | 0 | [
2,
56,
8479,
3893,
2595,
50,
1827,
34,
16495,
18,
60,
800,
3726,
3726,
487,
20427,
15,
489,
821,
17,
351,
2723,
92,
44,
6115,
29,
14,
797,
263,
3383,
17,
129,
170,
19,
65,
16495,
18,
15,
14,
3095,
4520,
92,
44,
275,
26,
17418,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 best tutorials about caching with PHP?
===
What are the best resources or tutorials for caching in PHP 5? I'm looking for something that I could possibly build on my own. Zend Cache, APC, and similar utilities are also options, but I really want to steer away from full-fledged templating systems like Smarty, etc. | 0 | [
2,
98,
50,
14,
246,
29724,
18,
88,
1658,
7192,
29,
13,
26120,
60,
800,
3726,
3726,
98,
50,
14,
246,
2566,
54,
29724,
18,
26,
1658,
7192,
19,
13,
26120,
331,
60,
31,
22,
79,
699,
26,
301,
30,
31,
110,
2879,
1895,
27,
51,
258,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Regex balancing groups expression - matching when not balanced
===
Balancing groups regexes make my head explode. I've got this string i'm trying to match:
other stuff blah blah....
{
stuff stuff
{key:
stuff
stuff
}
} more stuff.....
Here's my regex:
[^{}]*\{(?>[^{}]+|\{(?:\w+:)?(?<DEPTH>)|\}(?<-DEPTH>))*(?(DEPTH)(?!))\}[^{}]*
So, i'm trying to match balancing curly braces, where some of the opening curly braces have an optional word followed by a colon. The above regex matches my example string, but if i remove a curly brace, (i.e. "unbalancing it):
other stuff blah blah....
{
stuff stuff
{key:
stuff
stuff
} more stuff.....
...it still matches!
Can anyone tell me how to fix my regex? Thanks.
| 0 | [
2,
13,
9,
2328,
7953,
1706,
16416,
6302,
1170,
1803,
13,
8,
10120,
76,
52,
13966,
800,
3726,
3726,
16416,
6302,
1170,
7953,
1706,
160,
233,
51,
157,
13383,
9,
31,
22,
195,
330,
48,
3724,
31,
22,
79,
749,
20,
730,
45,
89,
3217,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can Database Mirroring Be Setup On MS SQLServer Between Two Clusters
===
Just like the title says, using Microsoft SQL Server's database mirroring capability, can the mirroring occur between two clusters? All of the examples in MSDN show a topology indicating single servers for both the principal and mirror server. | 0 | [
2,
92,
6018,
3402,
68,
44,
18161,
27,
4235,
4444,
255,
10321,
106,
128,
81,
14497,
800,
3726,
3726,
114,
101,
14,
581,
898,
15,
568,
7099,
4444,
255,
8128,
22,
18,
6018,
3402,
68,
11480,
15,
92,
14,
3402,
68,
3744,
128,
81,
1449... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In Python, what is the difference between '/' and '//' when used for division?
===
Is there a benefit to using one over the other? They both seem to return the same results.
>>> 6/3
2
>>> 6//3
2 | 0 | [
2,
19,
20059,
15,
98,
25,
14,
2841,
128,
13,
22,
118,
22,
17,
13,
22,
118,
118,
22,
76,
147,
26,
460,
60,
800,
3726,
3726,
25,
80,
21,
4234,
20,
568,
53,
84,
14,
89,
60,
59,
156,
2260,
20,
788,
14,
205,
1736,
9,
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,
0,
0,
0,
0,
0... |
How do I LINQify this?
===
Is there any way to clean up this type of loop using LINQ?
List<Car> result;
List<string> makes;
List<string> models;
for (int i = 0; i < makes.Count() && i < models.Count(); i++)
{
result.Add(new Car() { Make = makes[i], Model = models[i] });
}
Basically I'm looking for some way to collate multiple arrays of individual fields into a single array of objects made up of those fields. | 0 | [
2,
184,
107,
31,
6294,
1251,
8612,
48,
60,
800,
3726,
3726,
25,
80,
186,
161,
20,
2745,
71,
48,
1001,
16,
5293,
568,
6294,
1251,
60,
968,
1,
1367,
1,
829,
73,
968,
1,
11130,
1,
1364,
73,
968,
1,
11130,
1,
2761,
73,
26,
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... |
Preferred way to include relative reference to JavaScript in VS 2008 nested Masterpage.
===
Our base Masterpage has something like the following
<head runat="server">
<title></title>
<script type="text/javascript" src="<%= Page.ResolveClientURL("~/javascript/actions.js")%>"></script>
<script type="text/javascript" src="<%= Page.ResolveClientURL("~/javascript/jquery/jquery-1.2.6.min.js")%>"></script>
<asp:contentplaceholder id="cph_htmlhead" runat="server">
</asp:contentplaceholder>
</head>
If this Masterpage is the Masterpage for an ASPX page things work fine.
If this Masterpage is the Masterpage for a child Masterpage and then a new ASPX page uses the child Masterpage as it's MasterPage we see:
Server Error in '' Application.
The Controls collection cannot be modified because the control contains code blocks (i.e. <% ... %>).
**What is the preferred way to include global resources (Javascript/CSS) in a base Masterpage preserving tilde(~) style relative pathing?**
| 0 | [
2,
5981,
161,
20,
468,
4543,
2801,
20,
8247,
8741,
19,
4611,
570,
5618,
69,
1129,
6486,
9,
800,
3726,
3726,
318,
1000,
1129,
6486,
63,
301,
101,
14,
249,
13,
1,
1743,
485,
721,
3726,
7,
10321,
106,
7,
1,
13,
1,
22235,
1,
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... |
How do I add support for a USB-based wireless adapter to an existing Fedora 9 installation?
===
Here is the situation: the customer machine is a Dell Inspiron 6400 running Fedora Core 9 installed from the i686 Live CD (not x86_64 as the [T2400 Core Duo][1] did not have 64-bit support). The customer wireless adapter is a [ENCORE ENUWI-N USB 2.0 802.11n Wireless Adapter][2].
My question is, how do I make this USB-wireless work with this laptop with this operating system?
Linux seems to be pretty well behaved when it comes to the integrated wireless components these days but is much less friendly when it comes to the USB side. [/sbin/lsusb][3] recognizes the adapter as a Ralink Technology, Corp. 2870-based product but it's not clear how to proceed from that information.
[1]: http://processorfinder.intel.com/details.aspx?sSpec=SL8VQ
[2]: http://www.newegg.com/Product/Product.aspx?Item=N82E16833180053
[3]: http://linuxcommand.org/man_pages/lsusb8.html | 0 | [
2,
184,
107,
31,
3547,
555,
26,
21,
182,
220,
8,
1281,
10149,
9924,
106,
20,
40,
3149,
26726,
58,
561,
7758,
60,
800,
3726,
3726,
235,
25,
14,
1858,
45,
14,
7705,
1940,
25,
21,
13,
5491,
19,
3401,
11803,
400,
7114,
946,
26726,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Image Capture in C#
===
I'm working on a home project that involves comparing images to a database of images (using a quadrant - or so - histogram approach). I wanted to know what my options are in regards to web cams or other image capture devices that:
- Are easy to work with with the
Windows SDK (particularly
[DirectShow][1], which I plan to use
with C#)
- Have drivers for both
64-bit and 32-bit Windows Vista (and
Server 2008)
I'm asking primarily so I can avoid pitfalls that other people may have experienced with web cams and to see if there are other image capture devices (or C# usable APIs) available that I should look at. I suspect that any old web cam will do but I'd rather be safe than sorry.
[1]: http://msdn.microsoft.com/en-us/library/ms783323(VS.85).aspx | 0 | [
2,
1961,
3683,
19,
272,
5910,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
213,
669,
30,
6569,
15047,
3502,
20,
21,
6018,
16,
3502,
13,
5,
12655,
21,
27203,
13,
8,
54,
86,
13,
8,
33,
38,
20476,
2141,
6,
9,
31,
417,
20,
143,
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... |
Interesting compiler projects
===
I'm currently in the process of choosing a project for a grad-level compiler course to be done over the next 8 weeks. I'd like to do something related to optimization since I haven't worked much in that area before, but anything in the field is fair game.
What was the most interesting compiler-related project you've done? What did you learn the most from? | 0 | [
2,
4883,
21486,
2314,
800,
3726,
3726,
31,
22,
79,
871,
19,
14,
953,
16,
10883,
21,
669,
26,
21,
13,
7691,
8,
3906,
21486,
674,
20,
44,
677,
84,
14,
328,
469,
1342,
9,
31,
22,
43,
101,
20,
107,
301,
1597,
20,
21597,
179,
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... |
VS 2k8 Doesn't Release File Handle After Debugging Stops: Unable to copy file X to output directory because it is being used by another process.
===
Every once in a while, typically when I stop debugging in our UI assembly, I get the following error which requires a restart of Visual Studio 2008 and it's killing my productivity:
> Error 13 Unable to copy file
> [UI assembly]
> to
> [output directory].
> The process cannot access the file
> [output directory]\[UI assembly]
> because it is being used by another
> process.
I'm using VS 2k8 SP1 on Windows Vista.
I know that it's the VS debugger that's not releasing its file handle by using the handle utility (formerly from Sysinternals). The process is devenv.exe.
I've tried closing and reopening the solution. Didn't work.
I've tried adding a pre-build event, to move the file as described [here][1], but that doesn't work because Windows can't delete the file for the same reason it can't replace it: it's got an open handle.
I even tried manually closing the handle using the handle.exe util described above, then trying the pre-build event. Visual Studio apparently doesn't know its handle has been closed because the VS build fails, but handle.exe shows no open file handles on the file in question.
For the record, here are the add-ins I run:
- ReSharper 4
- Smart Paster 2008
- Typemock Isolator
- TestDriven.NET 2.13.2184
I also use Developer Express controls for this project, so that may have something to do with it as well.
[1]: http://forums.msdn.microsoft.com/en-US/vbide/thread/cd12f3c7-de96-4353-adce-23975e30933f/ | 0 | [
2,
4611,
172,
197,
457,
1437,
22,
38,
830,
3893,
3053,
75,
121,
16254,
2762,
6604,
45,
2343,
20,
4344,
3893,
993,
20,
5196,
16755,
185,
32,
25,
142,
147,
34,
226,
953,
9,
800,
3726,
3726,
352,
382,
19,
21,
133,
15,
2442,
76,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Technologies for centrally storing and publishing perl scripts and "small tools"?
===
**My problem:**
There are numerous (>100) tools the development teams use which are "home" written. They are sometimes a perl script, or a "web page", or just something that does a couple of small functions. I need to find a way (as part of my "Middle Manager in charge of tools" job) to collect these into a single catalogue. None of these tools are "productised" in any way.
I need to be able to somehow measure usage of each tool. Uploading or submitting a tool should be a trivial exercise, as should downloading the tool. Must have version management and control.
Is there a technology for centrally storing and publishing these small tools?
Does anyone have experience of such quixotic ventures in other companies? | 0 | [
2,
5740,
26,
521,
102,
25615,
17,
3107,
416,
255,
17505,
17,
13,
7,
15988,
4672,
7,
60,
800,
3726,
3726,
13,
1409,
915,
1448,
45,
1409,
80,
50,
1548,
13,
5,
1,
4031,
6,
4672,
14,
522,
952,
275,
56,
50,
13,
7,
8167,
7,
642,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Forward Referencing in C++
===
How do I do forward referencing in C++ to avoid circular header file references?
I have the #ifndef guard in the header file, yet memory tells me I need this forward referencing thing - which i've used before >< but can't remember how. | 0 | [
2,
917,
13,
29254,
19,
272,
20512,
800,
3726,
3726,
184,
107,
31,
107,
917,
13,
29254,
19,
272,
20512,
20,
2658,
8155,
157,
106,
3893,
7231,
60,
31,
57,
14,
6926,
821,
103,
13862,
1611,
19,
14,
157,
106,
3893,
15,
768,
1912,
260... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 start PowerShell from Windows Explorer?
===
Does anyone know of a way to start PowerShell in a specific folder from Windows Explorer, e.g. to right-click in a folder and have an option like "Open PowerShell in this Folder".
It's really annoying to have to change directories to my project folder the first time I run MSBuild every day. | 0 | [
2,
184,
20,
799,
414,
15984,
37,
1936,
8520,
60,
800,
3726,
3726,
630,
1276,
143,
16,
21,
161,
20,
799,
414,
15984,
19,
21,
1903,
19294,
37,
1936,
8520,
15,
13,
62,
9,
263,
9,
20,
193,
8,
150,
10129,
19,
21,
19294,
17,
57,
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... |
How do I determine an image loaded successfully from a URI in Silverlight 2.0 (RC0)?
===
In the following code below:
Image img = new Image();
img.Source = new BitmapImage(new Uri("http://someURL/somefilename.jpg", UriKind.Absolute));
how can I determine if the image successfully loaded (when there's a valid URI)? i.e., The URI is a valid format, but the file may not exist.
| 0 | [
2,
184,
107,
31,
3746,
40,
1961,
8572,
3673,
37,
21,
13,
3594,
19,
1172,
3130,
172,
9,
387,
13,
5,
5453,
387,
6,
60,
800,
3726,
3726,
19,
14,
249,
1797,
1021,
45,
1961,
797,
263,
800,
78,
1961,
5,
6,
73,
797,
263,
9,
12097,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 convert unicode escape sequences to unicode characters in a .NET string
===
Say you've loaded a text file into a string and you'd like to convert all unicode escapes into actual unicode characters inside of the string.
Example:
"The following is the top half of an integral character in unicode '\u2320', and this is the lower half '\U2321'."
I found an answer that works for me and if follows.
| 0 | [
2,
184,
107,
8406,
28010,
2220,
11173,
20,
28010,
1766,
19,
21,
13,
9,
2328,
3724,
800,
3726,
3726,
395,
42,
22,
195,
8572,
21,
1854,
3893,
77,
21,
3724,
17,
42,
22,
43,
101,
20,
8406,
65,
28010,
16366,
77,
3463,
28010,
1766,
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... |
[PHP] How do I get the key values from $_POST?
===
echo $_POST["name"]; //returns the value a user typed into the "name" field
I would like to be able to also return the text of the key. In this example, I want to return the text "name". Can I do this? | 0 | [
2,
636,
26120,
500,
184,
107,
31,
164,
14,
1246,
4070,
37,
5579,
1,
6962,
60,
800,
3726,
3726,
8117,
5579,
1,
6962,
2558,
7,
7259,
7,
12660,
12894,
24632,
18,
14,
1923,
21,
4155,
1001,
43,
77,
14,
13,
7,
7259,
7,
575,
31,
83,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Any good git tutorials?
===
Are there any good git tutorials available somewhere, except for [the official tutorial][1]?
I like [the mercurial book][2], but haven't found anything similar for git. I would like to start using git in some projects, and would therefore be able to point my colleagues to some good reading material. In this particular case, they are still mostly used to RCS and CVS.
[1]: http://www.kernel.org/pub/software/scm/git/docs/gittutorial.html
[2]: http://hgbook.red-bean.com/hgbook.html | 4 | [
2,
186,
254,
13,
10404,
29724,
18,
60,
800,
3726,
3726,
50,
80,
186,
254,
13,
10404,
29724,
18,
904,
3493,
15,
1613,
26,
636,
124,
989,
29724,
500,
2558,
165,
500,
60,
31,
101,
636,
124,
9046,
3594,
192,
360,
500,
2558,
135,
500... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to rewrite all queries to not need the .php extension using a mod_rewrite RewriteRule.
===
I'd like all queries like
http://mysite.com/something/otherthing?foo=bar&x=y
to be rewritten as
http://mysite.com/something/otherthing.php?foo=bar&x=y
In other words, just make the .php extension optional, universally.
| 0 | [
2,
184,
20,
27891,
65,
9386,
2829,
20,
52,
376,
14,
13,
9,
26120,
3896,
568,
21,
7226,
1,
99,
23716,
27891,
16154,
9,
800,
3726,
3726,
31,
22,
43,
101,
65,
9386,
2829,
101,
7775,
6903,
915,
9097,
9,
960,
118,
9099,
118,
9539,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Compiler fails converting a constrained generic type.
===
I have a class that has a Generic type "G"
In my class model i have
public class DetailElement : ElementDefinition
Let's say i have a method like this
public void DoSomething<G>(G generic)
where G : ElementDefinition
{
((DetailElement)generic).DescEN = "Hello people"; //line 1
//////
ElementDefinition element = generic;
((DetailElement)element).DescEN = "Hello again"; //line 3
//////
(generic as DetailElement).DescEN = "Howdy"; //line 5
}
Compiler reports one error in line 1:
Cannot convert type 'G' to 'DetailElement'
But line 3 works fine.
I can workaround this issue by doing the code written in line 5.
What i would like to know is why does the compiler reports the error in line 1 and not the one in line 3, given that, as far as i know, they are identical.
edit: I am afraid i might be missing some important piece of the framework logic
Thank you,
Luís
| 0 | [
2,
21486,
13614,
19583,
21,
28751,
12733,
1001,
9,
800,
3726,
3726,
31,
57,
21,
718,
30,
63,
21,
12733,
1001,
13,
7,
263,
7,
19,
51,
718,
1061,
31,
57,
317,
718,
6110,
27567,
13,
45,
4520,
28643,
408,
22,
18,
395,
31,
57,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What win32 API's can be used to find what process has a file open?
===
If I read or write to a file and receive a 33 or 32 error, I would like to log a message containing the name of the other process(es) that have the file opened. There must be win32 API's I can use to get this info. Process explorer displays it. Of course process explorer also has info about all processes in memory. I'd prefer to find the culprit without iterating all processes. | 0 | [
2,
98,
628,
3125,
21,
2159,
22,
18,
92,
44,
147,
20,
477,
98,
953,
63,
21,
3893,
368,
60,
800,
3726,
3726,
100,
31,
1302,
54,
2757,
20,
21,
3893,
17,
2588,
21,
3534,
54,
2512,
7019,
15,
31,
83,
101,
20,
6738,
21,
2802,
3503,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 let PHP to create subdomain automatically for each user?
===
How do I create subdomain like http://user.mywebsite.com ? Do i have to access htaccess somehow? Is it actually simply possible to create it via pure php code or I need to use some external script-server side language? | 0 | [
2,
184,
20,
408,
13,
26120,
20,
1600,
972,
537,
6232,
7499,
26,
206,
4155,
60,
800,
3726,
3726,
184,
107,
31,
1600,
972,
537,
6232,
101,
7775,
6903,
16704,
9,
915,
14113,
9097,
9,
960,
13,
60,
107,
31,
57,
20,
1381,
13,
9020,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why are my PHP sessions dying? And why can't I restore them?
===
I have an app using PHP and the PayPal API. The basic way it works to get a payment is that you do a web service call to PayPal to get a token and then do a browser redirect to PayPal with that token for the user to pay. After the payment details have been confirmed, PayPal redirects back to the URL you originally set in the service call.
This all works, millions of people use it every day, et cetera.
Strange thing is, when PayPal redirects back, the PHP session is gone. It's a [well-documented issue][1].
First question: why is this happening? Both pages are on the same domain, both use HTTPS. The session works for all requests up until the PayPal redirect back.
The linked forum thread suggests a workaround, to persist the session ID in the PayPal request and then to retrieve it later and restore the session. Great, except it doesn't seem to work.
I can add some log statements:
log(session_id());
before and after the various redirects. When coming back from PayPal, I log some more.
log("session id is " . session_id());
$session_id = get_session_id_from_paypal();
log("setting it back to " . $session_id);
session_id($session_id);
session_start();
log("session id is now " . session_id());
The result is not at all what I'd expect:
> `session_id` is fc8f459a186a3f4695ff9ac71b563825
> setting it back to 82460dcf8c8ddd538466e7cb89712e72
> `session_id` is now 360ba3fd99d233e0735397278d2b2e55
Second question: why is the session id not at all what I set it to? What am I doing wrong?
[1]: http://www.paypaldeveloper.com/pdn/board/message?board.id=sandbox&thread.id=8672 | 0 | [
2,
483,
50,
51,
13,
26120,
5763,
4970,
60,
17,
483,
92,
22,
38,
31,
8454,
105,
60,
800,
3726,
3726,
31,
57,
40,
4865,
568,
13,
26120,
17,
14,
1372,
6720,
21,
2159,
9,
14,
2125,
161,
32,
693,
20,
164,
21,
7582,
25,
30,
42,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Add ScriptManager to Page Programmatically?
===
I am developing a WebPart (it will be used in a SharePoint environment, although it does not use the Object Model) that I want to expose AJAX functionality in. Because of the nature of the environment, Adding the Script Manager directly to the page is not an option, and so must be added programmatically. I have attempted to add the ScriptManager control to the page in my webpart code.
protected override void CreateChildControls()
{
if (ScriptManager.GetCurrent(Page) == null)
{
ScriptManager sMgr = new ScriptManager();
// Ensure the ScriptManager is the first control.
Page.Form.Controls.AddAt(0, sMgr);
}
}
However, when this code is executed, I get the following error message:
>"The control collection cannot be modified during DataBind, Init, Load, PreRender or Unload phases."
Is there another way to add the ScriptManager to the page from a WebPart, or am I going to have to just add the ScriptManager to each page (or master page) that will use the WebPart?
| 0 | [
2,
3547,
3884,
22256,
20,
2478,
625,
6732,
1326,
60,
800,
3726,
3726,
31,
589,
3561,
21,
2741,
3091,
13,
5,
242,
129,
44,
147,
19,
21,
1891,
3132,
2307,
15,
419,
32,
630,
52,
275,
14,
3095,
1061,
6,
30,
31,
259,
20,
13833,
206... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Visual Studio 2008 to edit SSRS 2005 Report Projects w/o Installing SQL Business Intelligence Development Studio 2005?
===
I'm trying to determine how to open/edit SQL Server Reporting Services (SSRS) 2005 report projects (.rptproj) and reports (.rdl) with Visual Studio 2008, *without* having to install SQL Business Intelligence Development Studio (BIDS) 2005. | 0 | [
2,
184,
20,
164,
3458,
1120,
570,
20,
9392,
22118,
18,
812,
1330,
2314,
619,
118,
111,
25429,
4444,
255,
508,
2872,
522,
1120,
812,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
3746,
184,
20,
368,
118,
69,
242,
4444,
255,
8128,
667... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Oracle KGL SIMULATOR?
===
What is this thing called a KGL SIMULATOR and how can its memory utilisation be managed by application developers?
The background to the question is that I'm occasionally getting errors like the following and would like to get a general understanding of what is using this heap-space?
> ORA-04031: unable to allocate 4032 bytes of shared memory ("shared pool","select text from > view$ where...","sga heap(3,0)","kglsim heap")
I've read forum posts through Google suggesting that the kglsim is related to the KGL SIMULATOR, but there is no definition of that component, or any tips for developers. | 0 | [
2,
98,
25,
14,
15759,
2997,
255,
24565,
60,
800,
3726,
3726,
98,
25,
48,
584,
227,
21,
2997,
255,
24565,
17,
184,
92,
82,
1912,
13,
14255,
4330,
44,
1471,
34,
3010,
10168,
60,
14,
2395,
20,
14,
1301,
25,
30,
31,
22,
79,
4533,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best or favorite website navigation examples
===
What do you consider to be the best examples of website navigation and why? I'm trying to design a secondary navigation menu and I need a little inspiration, but I'm also interested just in general about learning best practices for navigation and information display. What are some of the more unique solutions you've seen? Links and variety are definitely encouraged in your answers. | 2 | [
2,
246,
54,
3839,
2271,
8368,
3770,
800,
3726,
3726,
98,
107,
42,
3563,
20,
44,
14,
246,
3770,
16,
2271,
8368,
17,
483,
60,
31,
22,
79,
749,
20,
704,
21,
2277,
8368,
11379,
17,
31,
376,
21,
265,
6180,
15,
47,
31,
22,
79,
67,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 commercial and open source competitors are there to Splunk?
===
It's difficult to find any. Please, no answers like `scp + perl + duct tape`. I need a complete solution. | 4 | [
2,
98,
1439,
17,
368,
1267,
10558,
50,
80,
20,
3782,
22033,
60,
800,
3726,
3726,
32,
22,
18,
1956,
20,
477,
186,
9,
2247,
15,
90,
6709,
101,
13,
1,
18,
7439,
2754,
416,
255,
2754,
13,
9351,
5473,
1,
9,
31,
376,
21,
1279,
429... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Does the Microsoft JSON object serialization differ from the "normal" serialization?
===
I recall hearing that the way Microsoft had to implement the JSON serialization for their AJAX framework was different than most other libraries out there. Is this true? And, if so, how is it different? | 0 | [
2,
630,
14,
7099,
487,
528,
3095,
5956,
1829,
11394,
37,
14,
13,
7,
17462,
7,
5956,
1829,
60,
800,
3726,
3726,
31,
7111,
3229,
30,
14,
161,
7099,
41,
20,
8713,
14,
487,
528,
5956,
1829,
26,
66,
20624,
6596,
23,
421,
119,
127,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 divide time between different projects?
===
I am sure we have all been in this boat. You have two or more projects that are both critical and need to get done. How do you split your time to handle each project?
Ideally you could go to the stakeholders and get them to decide the order. Well, that's what I would do. But let's say they both need their projects progressed for some reason. Would you spend the morning on one project and the afternoon on the other? Work on one today and the other tomorrow? Swap every hour?!
What works best for you? How do you deal with the overhead of changing gears?
| 0 | [
2,
184,
107,
42,
8918,
85,
128,
421,
2314,
60,
800,
3726,
3726,
31,
589,
562,
95,
57,
65,
74,
19,
48,
2252,
9,
42,
57,
81,
54,
91,
2314,
30,
50,
156,
2507,
17,
376,
20,
164,
677,
9,
184,
107,
42,
2132,
154,
85,
20,
3053,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 data breakpoint in Visual Studio 2005 on the address of a dereferenced pointer?
===
I wonder if there's a way to do the following: I have a structure containing a member which is a pointer to a block of memory allocated by the kernel when I pass the structure to an API function (the structure is a WAVEHDR, the member is the *reserved* field.)
I can set a data breakpoint on the value of the reserved member - that in itself is not very helpful. What I'd like to do, when the breakpoint is hit, is to dereference the pointer stored in *reserved* and set a new data breakpoint on the memory pointed to by that pointer. I would like VisualStudio to break when that memory is set to a known value.
I know how to set a breakpoint from a macro, and how to have Visual Studio invoke that macro from a breakpoint when it's hit, but I don't know whether I can pass the pointer value to the macro so that it can set the breakpoint on the right address. The UI doesn't provide a way to do it.
Is there a way for the macro to access information about the running program, and do things like evaluate global variables or other expressions? I could accomplish what I'm trying to do if I had that kind of programmatic access to the running code (during a breakpoint) from the macro. | 0 | [
2,
184,
107,
31,
309,
21,
1054,
1442,
3132,
19,
3458,
1120,
812,
27,
14,
3218,
16,
21,
121,
28018,
43,
454,
106,
60,
800,
3726,
3726,
31,
2666,
100,
80,
22,
18,
21,
161,
20,
107,
14,
249,
45,
31,
57,
21,
1411,
3503,
21,
322,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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: what's the purpose of "def" in "def x = 0" ?
===
In the following piece of code (taken from the [Groovy User Guide][1]), why prefix the assignment with the keyword **def** ?
def x = 0
def y = 5
while ( y-- > 0 ) {
println "" + x + " " + y
x++
}
assert x == 5
The def keyword can be removed, and this snippet would produce the same results. So what's the effect of the keyword **def** ?
[1]: http://groovy.codehaus.org/User+Guide "http://groovy.codehaus.org/User+Guide" | 0 | [
2,
3452,
2026,
93,
45,
98,
22,
18,
14,
2131,
16,
13,
7,
13862,
7,
19,
13,
7,
13862,
993,
800,
713,
7,
13,
60,
800,
3726,
3726,
19,
14,
249,
1855,
16,
1797,
13,
5,
4386,
103,
37,
14,
636,
7944,
2026,
93,
4155,
3378,
500,
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... |
How can I do an indexOf() in Lotus Notes Formula language (@ commands)?
===
I can't find this anywhere in the Domino Designer help. It seems so straightforward!
All I need to do is find the position of a character in a string. | 0 | [
2,
184,
92,
31,
107,
40,
4348,
1041,
5,
6,
19,
15175,
2434,
3729,
816,
13,
5,
1,
14294,
6,
60,
800,
3726,
3726,
31,
92,
22,
38,
477,
48,
4922,
19,
14,
23320,
4742,
448,
9,
32,
2206,
86,
22262,
187,
65,
31,
376,
20,
107,
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,
0,
0,
0,
0,
0... |
Best concrete "how-to manual" on MANAGING Test Driven and/or Agile development?
===
**Obligatory up-front clarification**: I have a great boss. Very smart guy. Respectful towards all. Dude is awesome. Seriously.
<h2>Now for my question:</h2>
<h3><u>I am looking for an easily digestible book to possibly present to my boss/team.</u></h3>
-------------------
**Background info:** More and more of our meetings at work involve my boss/team pondering how to implement more "best practices" around here. ("Here" = a very small application development shop. 4 developers)
The following things are items that my whole team agrees that we need:
- Nightly builds
- Decomposing "bugs" in our bug-tracker into smaller, more-specific items
- Automated testing
<h2><b>The problem we face is how to get started.</b></h2>
I believe that if my shop could simply choose ***a clear and specific plan*** or set of rules, then everything else would fall into place. Right now we are stuck in discussions of fuzzy, feel-good ideas and nice-sounding buzzwords.
Please recommend to me your favorite book (or online resource) that contains clear, discrete, sequential steps for implementing a management scheme for guiding a TDD or Agile team/shop.
I realize that there are other paradigms besides TDD and Agile that would also address these concerns, but my own self-interests and biases point toward TDD and Agile so I would love to harness my team's desire for change and "nudge" it in that direction. Or feel free to slap me down if you vehemently disagree with my sentiments! I will take no offense. :)
<h3>As others have stated, I think these questions are answered best when respondents list <u>only one book recommendation</u> per answer.</h3>
------------
Thank you all. | 0 | [
2,
246,
4105,
13,
7,
1544,
8,
262,
5132,
7,
27,
5616,
1289,
5355,
17,
118,
248,
27475,
522,
60,
800,
3726,
3726,
13,
1409,
27849,
71,
8,
8068,
13,
12078,
4634,
1409,
45,
31,
57,
21,
374,
4054,
9,
253,
3978,
1244,
9,
22719,
101... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Serialization of objects: no thread state can be involved, right?
===
I am looking hard at the basic principles of storing the state of an executing program to disk, and bringing it back in again. In the current design that we have, each object (which is a C-level thingy with function pointer lists, kind of low-level home-made object-orientation -- and there are very good reasons for doing it this way) will be called to export its explicit state to a writable and restorable format. The key property to make this work is that all state related to an object is indeed encapsulated in the object data structures.
There are other solutions where you work with active objects, where there is a user-level thread attached to some objects. And thus, the program counter, register contents, and stack contents suddenly become part of the program state. As far as I can see, there is no good way to serialize such things to disk at an arbitrary point in time. The threads have to go park themselves in some special state where nothing is represented by the program counter et al, and thus basically "save" their execution state machine state to the explicit object state.
I have looked at a range of serialization libraries, and as far as I can tell this is a universal property.
Or is this actually not so? Are there save/restore solutions out there that can include thread state, in terms of where in its code a thread is executing?
Note that saving an entire system state in a virtual machine does not count, that is not really serializing the state, but just freezing a machine and moving it. It is an obvious solution, but a bit heavyweight most of the time. | 0 | [
2,
5956,
1829,
16,
3916,
45,
90,
9322,
146,
92,
44,
1013,
15,
193,
60,
800,
3726,
3726,
31,
589,
699,
552,
35,
14,
2125,
5624,
16,
25615,
14,
146,
16,
40,
25836,
625,
20,
8582,
15,
17,
3657,
32,
97,
19,
188,
9,
19,
14,
866,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 disadvantages to using a PHP proxy to bypass the same-origin policy for XMLHttpRequest?
===
[http://developer.yahoo.com/javascript/howto-proxy.html][1]
Are there disadvantages to this technique? The advantage is obvious, that you can use a proxy to get XML or JavaScript on another domain with XMLHttpRequest without running into same-origin restrictions. However, I do not hear about disadvantages over other methods -- are there, and what might they be?
[1]: http://developer.yahoo.com/javascript/howto-proxy.html | 0 | [
2,
98,
50,
14,
13387,
18,
20,
568,
21,
13,
26120,
27188,
20,
8900,
14,
205,
8,
28486,
1486,
26,
23504,
21127,
99,
10351,
60,
800,
3726,
3726,
636,
21127,
6903,
26051,
106,
9,
1046,
8884,
9,
960,
118,
1004,
1385,
8741,
118,
1544,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best practice to pass information between windows.forms
===
What do you do to pass information between forms? Forward is straight forward (sorry) using Properties or maybe parameters in a New() or DoStuff() method, but what about sending something ***back*** when the user is done with the second form? (IE. ID of the item selected) We have used all these:
- **Passed the calling form into the called form as a ref** so the called form could access properties or methods on the calling form. I really don't like this because the two forms are very dependent of each other. Passing the calling form as a object only slightly improves this.
- **Use Events** This somewhat decouples the code, but the signatures must match on the event handler.
- **Use an Public Interface** I'm talking about the .NET built in one, but I suppose you could create your own. This seems like the best to me.
Now raise the bar, what if the forms are in two different DLLs? As long as the forms are not dependent on each other, I would think this wouldn't be a big step. | 0 | [
2,
246,
1345,
20,
1477,
676,
128,
1936,
9,
4190,
18,
800,
3726,
3726,
98,
107,
42,
107,
20,
1477,
676,
128,
1997,
60,
917,
25,
1599,
917,
13,
5,
8959,
6,
568,
3704,
54,
913,
12905,
19,
21,
78,
5,
6,
54,
107,
384,
5386,
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... |
Framework/Language for new web 2.0 sites (2008 and 2009)
===
I know I'll get a thousand "Depends on what you're trying to do" answers, but seriously, there really is no solid information about this online yet. Here are my assumptions - I think they're similar for alot of people right now:
1. It is now October 2008. I want to start writing an application for January 2009. I am willing to use beta code and such but by January, I'd like a site that doesn't have 'strange' problems. With that said, if a language is simply 10% slower than another, I don't care about those things as long as the issue is linear. My main concern is developer productivity.
2. I'll be using Linux, Apache, MySQL for the application.
3. I want the power to do things like run scp and ftp client functions with stable libraries (I only picked those two because they're not web-related but at the same time represent pretty common network protocols that any larger app might use). Technologies like OpenID and Oauth will be used as well.
4. Experienced web developers are readily available (i.e. I don't have to find people from financial companies and such).
5. Whatever the choice is is common and will be around for a while.
6. Here's a kicker. I'd like to be able to use advanced presentation layer tools/languages similar to HAML, SASS. I definitively want to use JQuery.
7. I will be creating a Facebook app and at some point doing things like dealing with SMS messages, iPhone apps, etc...
At this point, the choices for language are PHP (Cake,Symfony,Zend), Python (Django), Ruby (Merb). I'm really between Django and Merb at this point mostly because everybody else seems to be going that way.
Please don't put any technologies in here that aren't made for mainstream. I know Merb is untested mostly, but their stated goal is a solid platform and it has alot of momentum behind it so I'm confident that it's workable. Please don't answer with how great Perl is or .Net.
For Future References - these choices were already made:
- Debian (Lenny) - For converting CPU cycles into something useful. Trac
- 0.11 - For Project Management Gliffy - For wireframes and such
- Google Docs/Apps - For documentation, hosted email, etc...
- Amazon ec2/S3 - For hosting, storage.
Cheers,
Adam | 0 | [
2,
6596,
118,
7020,
26,
78,
2741,
172,
9,
387,
3259,
13,
5,
2753,
17,
588,
6,
800,
3726,
3726,
31,
143,
31,
22,
211,
164,
21,
2996,
13,
7,
19038,
18,
27,
98,
42,
22,
99,
749,
20,
107,
7,
6709,
15,
47,
4818,
15,
80,
510,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Eclipse PDT and .yml file, cannot open?
===
I am using Symphony framework and I have the default sandbox inside the Eclipse IDE. When I double click schema.yml instead of open in Eclipse it requests Windows to select a program to choose. I am a Visual Studio guy and I do not understand why it doesn't open in Eclipse, what should I do? | 2 | [
2,
11652,
13,
9251,
38,
17,
13,
9,
93,
8184,
3893,
15,
1967,
368,
60,
800,
3726,
3726,
31,
589,
568,
5261,
6596,
17,
31,
57,
14,
12838,
1965,
5309,
572,
14,
11652,
13,
3448,
9,
76,
31,
1494,
10840,
23874,
9,
93,
8184,
700,
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... |
Java Application Installers
===
I'm not looking for java-web-start, I'm looking for a thick-client application installation toolkit. I've got a stand-alone application that consists of several files (jar files, data files, etc) and would need to do some pretty standard installation tasks, like asking the user for target directories, have them locate some parts of their system - choose some of the per-machine or per-user configuration options and possibly try to detect some of the machine settings for them.
I'm looking for something which is like the MSI or other wizard driven installation applications. What's a good installer for Java? It would be ideal if it were cross-platform capable (Linux, Mac OSX and Windows).
| 0 | [
2,
8247,
3010,
16146,
445,
800,
3726,
3726,
31,
22,
79,
52,
699,
26,
8247,
8,
14113,
8,
13680,
15,
31,
22,
79,
699,
26,
21,
2318,
8,
150,
18513,
38,
3010,
7758,
5607,
13703,
9,
31,
22,
195,
330,
21,
1261,
8,
17979,
3010,
30,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to run classic ASP scripts under IIS 5.1 (WinXP Pro) alongside .NET & CF?
===
I'm running into a problem setting up my development environment. I've been working on ColdFusion and .NET applications up until recently I haven't needed to touch IIS. Now, I have to set up a classic ASP application for some one-off work.
I added a virtual directory in IIS and pointed it at the actual codebase on my local machine. I then set the security to low (for ISAPI extensions, i.e. ASP) and allowed for script execution. For some reason though, if I hit any .asp page it says the page cannot be found. However, HTML and static files load up just fine. | 0 | [
2,
184,
20,
485,
2732,
28,
306,
17505,
131,
595,
18,
331,
9,
165,
13,
5,
4181,
396,
306,
895,
6,
2387,
13,
9,
2328,
279,
10084,
60,
800,
3726,
3726,
31,
22,
79,
946,
77,
21,
1448,
2697,
71,
51,
522,
2307,
9,
31,
22,
195,
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... |
When, if ever, is "number of lines of code" a useful metric?
===
Some people claim that code's worst enemy is its size, and I tend to agree. Yet every day you keep hearing things like
- I write blah lines of code in a day.
- I own x lines of code.
- Windows is x million lines of code.
Question: When is "#lines of code" useful?
ps: Note that when such statements are made, the tone is "more is better". | 0 | [
2,
76,
15,
100,
462,
15,
25,
13,
7,
16299,
16,
1560,
16,
1797,
7,
21,
4811,
11544,
60,
800,
3726,
3726,
109,
148,
2632,
30,
1797,
22,
18,
4126,
2436,
25,
82,
1072,
15,
17,
31,
5480,
20,
4524,
9,
768,
352,
208,
42,
643,
3229,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 doesn't Visual Studio always render my page correctly when debugging locally?
===
When I debug locally many times my page won't have the styles added properly or the page will not completely render (the end is seemingly cut off). Sometimes it takes multiple refreshes or shift-refreshes to fix this. Is this a common issue or is it just me? Any solutions? | 0 | [
2,
483,
1437,
22,
38,
3458,
1120,
550,
16535,
51,
2478,
12044,
76,
121,
16254,
2762,
6680,
60,
800,
3726,
3726,
76,
31,
121,
16254,
6680,
151,
436,
51,
2478,
230,
22,
38,
57,
14,
6443,
905,
7428,
54,
14,
2478,
129,
52,
1524,
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... |
How to force C# .net app to run only one instance in Windows?
===
How to force C# .net app to run only one instance in Windows? | 0 | [
2,
184,
20,
558,
272,
5910,
13,
9,
2328,
4865,
20,
485,
104,
53,
4851,
19,
1936,
60,
800,
3726,
3726,
184,
20,
558,
272,
5910,
13,
9,
2328,
4865,
20,
485,
104,
53,
4851,
19,
1936,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What is the strongest hashing algorithm commonly available today?
===
I'm building a web application and would like to use the strongest hashing algorithm possible for passwords. What are the differences, if any, between sha512, whirlpool, ripemd160 and tiger192,4? Which one would be considered cryptographically stronger? | 0 | [
2,
98,
25,
14,
11110,
19170,
68,
9083,
2524,
904,
786,
60,
800,
3726,
3726,
31,
22,
79,
353,
21,
2741,
3010,
17,
83,
101,
20,
275,
14,
11110,
19170,
68,
9083,
938,
26,
20884,
18,
9,
98,
50,
14,
4921,
15,
100,
186,
15,
128,
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... |
Best way to navigate duplicate tag definitions in emacs
===
Within emacs, what are the best options out there for navigating to a specific function whose name might show up across several different files? Within etags, you are only allowed to cycle through the tags one-at-a-time which could take a while if the function name you are looking for is popular. | 0 | [
2,
246,
161,
20,
20782,
19429,
3383,
18544,
19,
13,
62,
6893,
18,
800,
3726,
3726,
363,
13,
62,
6893,
18,
15,
98,
50,
14,
246,
6368,
70,
80,
26,
1775,
13227,
1880,
20,
21,
1903,
1990,
1196,
204,
530,
298,
71,
464,
238,
421,
64... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Update multiple rows into SQL table
===
Suppose there is a fully populated array of data String[n][3] myData.
I want to do this:
for (String[] row : myData)
{
SQL = "update mytable set col3 = row[2]
where col1 = row[0] and col2=row[1];"
}
Obviously I've left a lot out, but I want to express the idea as succinctly as possible.
Is there a simple way of doing this in a single DB command?
How about a not so simple way?
| 0 | [
2,
11100,
1886,
11295,
77,
4444,
255,
859,
800,
3726,
3726,
5787,
80,
25,
21,
2337,
11111,
7718,
16,
1054,
3724,
2558,
103,
500,
2558,
240,
500,
51,
18768,
9,
31,
259,
20,
107,
48,
45,
26,
13,
5,
11130,
2558,
500,
3131,
13,
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 can I capture single keystrokes in a unix console app without blocking?
===
I have a very simple TCP server written in C. It runs indefinitely, waiting for connections. On Windows, I use `select` to check for activity on the socket, and if there isn't any, I have the following code to allow me to quit by hitting 'q' on the keyboard:
if( kbhit() ) {
char c = getch();
if( c == 'q' ) break;
}
This doesn't work on unix, since `kbhit` doesn't exist and `getch` works differently. I found some [sample code][1] that uses `tcsetattr` to change the terminal settings and allow character-by-character input. After calling the init function, I open /dev/stdin (with `O_NONBLOCK`) and read a character, but `read( f, &c, 1 )` blocks until a character is hit.
I suppose I could spawn a separate thread and have _it_ wait indefinitely and then signal the first thread if the user hits 'q', but that seems a little heavy-handed. Surely there's an easier way?
[1]: http://www.linuxjournal.com/files/linuxjournal.com/linuxjournal/articles/011/1138/1138l2.html
| 0 | [
2,
184,
92,
31,
3683,
345,
1246,
12962,
18,
19,
21,
22540,
8650,
4865,
366,
11828,
60,
800,
3726,
3726,
31,
57,
21,
253,
1935,
13,
38,
7439,
8128,
642,
19,
272,
9,
32,
1461,
19,
19185,
15,
1672,
26,
6760,
9,
27,
1936,
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... |
What is the optimal length for user password salt?
===
Any salt at all will obviously help when salting and hashing a user's password. Are there any best practices for how long the salt should be? I'll be storing the salt in my user table, so I would like the best tradeoff between storage size and security. Is a random 10 character salt enough? Or do I need something longer? | 0 | [
2,
98,
25,
14,
17586,
1476,
26,
4155,
20884,
2693,
60,
800,
3726,
3726,
186,
2693,
35,
65,
129,
4409,
448,
76,
2693,
68,
17,
19170,
68,
21,
4155,
22,
18,
20884,
9,
50,
80,
186,
246,
5242,
26,
184,
175,
14,
2693,
378,
44,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does Databind consume a DataReader
===
If I have a control on a page that has its Datasource set to a DataReader, does that control consume the reader at the time the Datasource is set, or does the datareader continue to exist until Databind has been executed?
What actually happens under the covers when Databind is executed?
| 0 | [
2,
184,
630,
1054,
4772,
43,
16447,
21,
1054,
10647,
106,
800,
3726,
3726,
100,
31,
57,
21,
569,
27,
21,
2478,
30,
63,
82,
1054,
12097,
309,
20,
21,
1054,
10647,
106,
15,
630,
30,
569,
16447,
14,
7765,
35,
14,
85,
14,
1054,
12... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
"Unix shell"-alike script under Windows
===
I need some help from the shell-script gurus out there.
I have a .txt file (log) that traces the IP addresses of clients on several lines, in a format similar to this one:
Line1 - Client IP [192.168.0.1] Other data
Line2 - Client IP [192.168.0.2] Other data
Line3 - Client IP [192.168.0.3] Other data
Line4 - Client IP [192.168.0.2] Other data
Line5 - Client IP [192.168.0.1] Other data
...
I need to create script that:
- extracts the IP addresses from this file
- groups the IP addresses (the same IP address is reported only once)
- outputs a file with the resulting IP addresses
For the previous example, the resulting file would be:
192.168.0.1
192.168.0.2
192.168.0.3
I am on the Windows OS, but I can use tools like [Cygwin][1] or [Unix Tools][2] (that provide Unix-like commands as grep, sort, etc. under Windows).
A solution without scripting could be good as well.
Thanks in advance for your help.
[1]: http://www.cygwin.com/
[2]: http://unxutils.sourceforge.net/
| 0 | [
2,
13,
7,
1020,
4028,
3593,
7,
8,
58,
1403,
3884,
131,
1936,
800,
3726,
3726,
31,
376,
109,
448,
37,
14,
3593,
8,
8741,
10334,
18,
70,
80,
9,
31,
57,
21,
13,
9,
38,
396,
38,
3893,
13,
5,
5567,
6,
30,
10738,
14,
15735,
1263... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CountDownLatch vs. Semaphore
===
Is there an advantage to using [java.util.concurrent.CountdownLatch][1] instead of [java.util.concurrent.Semaphore][2]? As far as I can tell the following fragments are almost equivalent:
1:
final Semaphore sem = new Semaphore(0);
for (int i = 0; i < num_threads; ++ i)
{
Thread t = new Thread() {
public void run()
{
try
{
doStuff();
}
finally
{
sem.release();
}
}
};
t.start();
}
sem.acquire(num_threads);
2:
final CountDownLatch latch = new CountDownLatch(num_threads);
for (int i = 0; i < num_threads; ++ i)
{
Thread t = new Thread() {
public void run()
{
try
{
doStuff();
}
finally
{
latch.countDown();
}
}
};
t.start();
}
latch.await();
Except that in case #2 the latch cannot be reused and more importantly you need to know in advance how many threads will be created (or wait until they are all started before creating the latch.)
So in what situation might the latch be preferable?
[1]: http://java.sun.com/javase/6/docs/api/java/util/concurrent/CountDownLatch.html
[2]: http://java.sun.com/javase/6/docs/api/java/util/concurrent/Semaphore.html | 0 | [
2,
22566,
16688,
4611,
9,
13,
18,
5996,
11093,
62,
800,
3726,
3726,
25,
80,
40,
3314,
20,
568,
636,
1004,
1385,
9,
14255,
9,
1126,
17657,
9,
16549,
2968,
16688,
500,
2558,
165,
500,
700,
16,
636,
1004,
1385,
9,
14255,
9,
1126,
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... |
Useful Developer Resources in Second Life
===
Second Life is fun to play with, and some developers are creating content there, but I was wondering what useful resources (if any) are available in Second Life for professional software developers.
- Discussion groups
- Education/training
- Vendor support
- Professional contacts
| 0 | [
2,
4811,
10058,
2566,
19,
153,
201,
800,
3726,
3726,
153,
201,
25,
2414,
20,
418,
29,
15,
17,
109,
10168,
50,
2936,
2331,
80,
15,
47,
31,
23,
5712,
98,
4811,
2566,
13,
5,
821,
186,
6,
50,
904,
19,
153,
201,
26,
736,
2306,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using "top" in Linux as semi-permanent instrumentation
===
I'm trying to find the best way to use 'top' as semi-permanent instrumentation in the development of a box running embedded Linux. (The instrumentation will be removed from the final-test and production releases.)<br><br>My first pass is to simply add this to init.d:<br><br>`top -b -d 15 >/tmp/toploop.out &`<br><br>This runs top in "batch" mode every 15 seconds. Let's assume that /tmp has plenty of space...<br><br>Questions:
1. Is 15 seconds a good value to choose for general-purpose monitoring?
2. Other than disk space, how seriously is this perturbing the state of the system?
3. What other (perhaps better) tools could be used like this?
Thanks in advance for your answers! | 0 | [
2,
568,
13,
7,
3880,
7,
19,
13024,
28,
1922,
8,
28502,
18235,
800,
3726,
3726,
31,
22,
79,
749,
20,
477,
14,
246,
161,
20,
275,
13,
22,
3880,
22,
28,
1922,
8,
28502,
18235,
19,
14,
522,
16,
21,
1649,
946,
12138,
13024,
9,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ruby: how to post a file via net/http as multipart/form-data?
===
I want to do an HTTP POST using Net::HTTP (or some other ruby library, if need be) that looks like an html form posted from a browser, say, post some fields and a file.
Posting fields is straightforward, example right there in the net/http rdocs, but I can't figure out how to post a file along with it. | 0 | [
2,
10811,
45,
184,
20,
678,
21,
3893,
1197,
4275,
118,
21127,
28,
1889,
3091,
118,
4190,
8,
18768,
60,
800,
3726,
3726,
31,
259,
20,
107,
40,
7775,
678,
568,
4275,
45,
45,
21127,
13,
5,
248,
109,
89,
10811,
1248,
15,
100,
376,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get the most out of being a manual tester
===
As a student, I have just got my first co-op job as a manual tester. I know it is as intellectual and demanding a job as a coder, but I cannot help thinking the other way around. I love being a coder but it is my first job. So I am asking you for any advice on how I can get the most out of the manual *black-box* testing job, i.e how can I use it to improve my coding skills. Many thanks.
| 0 | [
2,
184,
20,
164,
14,
127,
70,
16,
142,
21,
5132,
1289,
106,
800,
3726,
3726,
28,
21,
1209,
15,
31,
57,
114,
330,
51,
64,
326,
8,
2594,
1205,
28,
21,
5132,
1289,
106,
9,
31,
143,
32,
25,
28,
5751,
17,
10025,
21,
1205,
28,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I check out a file from perforce in python?
===
I would like to write some scripts in python that do some automated changes to source code. If the script determines it needs to change the file I would like to first check it out of perforce. I don't care about checking in because I will always want to build and test first. | 0 | [
2,
184,
107,
31,
2631,
70,
21,
3893,
37,
416,
8774,
19,
20059,
60,
800,
3726,
3726,
31,
83,
101,
20,
2757,
109,
17505,
19,
20059,
30,
107,
109,
14904,
1693,
20,
1267,
1797,
9,
100,
14,
3884,
3746,
18,
32,
2274,
20,
753,
14,
38... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Seating plan software recommendations (does such a beast even exist?)
===
I'm getting married soon and am busy with the seating plan, and am running into the usual issues of who sits where: X and Y <em>must</em> sit together, but A and B cannot stand each other etc.
The numbers I'm dealing with aren't huge (so the manual option will work just fine), but being of the geeky persuasion, I was wondering if there was any software available to do this for me?
Failing an exact match, what should I look for (the problem space, books, reference code) to tweak for my purposes? | 0 | [
2,
12011,
944,
2306,
12121,
13,
5,
10739,
145,
21,
5591,
166,
3182,
60,
6,
800,
3726,
3726,
31,
22,
79,
1017,
567,
651,
17,
589,
4394,
29,
14,
12011,
944,
15,
17,
589,
946,
77,
14,
3820,
1549,
16,
72,
7550,
113,
45,
993,
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... |
Getting started with Hessian
===
I have a new project that needs a good binary protocol.
I was thinking of using [Hessian][1], unless anyone has any better ideas.
I was reading through some of their documentation and found it to not be quite as straightforward as I would have though, so I have a couple quick questions.
The home page has a section titled "Documentation" that has the following Documents
* Hessian Documentation
* Hessian 1.0.1 spec
* Hessian 2.0 serialization draft
* Hessian 2.0 web service draft
* Taxonomy explaining Hessians relationship to CORBA, SOAP, RMI
1) What is the different between these? I assume that 1.0.1 later become 2.0, and that it is correct to use 2.0 today, but I wasn't sure.
2) Also, would you expect someone to use 2.0 serialization or 2.0 web service? It looks like the web service is just supposed to be a reference to create a new implementation, but again, not totally clear to me.
3) Also, what about implementing a server that supports Hessian using php. Do you need to use a caucho server, or can you implement the server in php on a fedora core and connect using a java client?
[1]: http://hessian.caucho.com/ | 0 | [
2,
1017,
373,
29,
24,
18,
10760,
800,
3726,
3726,
31,
57,
21,
78,
669,
30,
2274,
21,
254,
14171,
8494,
9,
31,
23,
1440,
16,
568,
636,
438,
18,
10760,
500,
2558,
165,
500,
15,
4003,
1276,
63,
186,
574,
3478,
9,
31,
23,
1876,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 change SharePoint extended webapplicaion`s web.config file
===
Using the SharePoint API, how can I modify an extended webapp web.config file?
I have to do some changes in this file to specify the connection string, membershipprovider, etc... for using Forms Authentication.
Currently, I can change the "master" webapplication web.config file, but not the extended one.
Thanks | 0 | [
2,
184,
20,
753,
1891,
3132,
1984,
2741,
2552,
25971,
872,
1,
18,
2741,
9,
14093,
2816,
3893,
800,
3726,
3726,
568,
14,
1891,
3132,
21,
2159,
15,
184,
92,
31,
17579,
40,
1984,
2741,
7753,
2741,
9,
14093,
2816,
3893,
60,
31,
57,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Switching on a string/implementing button actions
===
Full disclaimer: I'm a CS student, and this question is related to a recently assigned Java program for Object-Oriented Programming. Although we've done some console stuff, this is the first time we've worked with a GUI and Swing or Awt. We were given some code that created a window with some text and a button that rotated through different colors for the text. We were then asked to modify the program to create radio buttons for the colors instead—this was also intended to give us practice researching an API. I've already handed in my assignment and received permission from my instructor to post my code here.
What's the best way to implement button actions in Java? After some fiddling around, I created the buttons like this:
class HelloComponent3 extends JComponent
implements MouseMotionListener, ActionListener
{
int messageX = 75, messageY= 175;
String theMessage;
String redString = "red", blueString = "blue", greenString = "green";
String magentaString = "magenta", blackString = "black", resetString = "reset";
JButton resetButton;
JRadioButton redButton, blueButton, greenButton, magentaButton, blackButton;
ButtonGroup colorButtons;
public HelloComponent3(String message) {
theMessage = message;
//intialize the reset button
resetButton = new JButton("Reset");
resetButton.setActionCommand(resetString);
resetButton.addActionListener(this);
//intialize our radio buttons with actions and labels
redButton = new JRadioButton("Red");
redButton.setActionCommand(redString);
...
And added action listeners...
redButton.addActionListener(this);
blueButton.addActionListener(this);
...
A stub was already created for the actionPerformed method to give us an idea on how to use it, but since there was only a single button in the template, it wasn't clear how to implement multiple buttons. I tried switching on a String, but quickly realized that, since a String isn't a primitive type, I couldn't use it for a switch statement. I could have improvised with an if-else chain, but this is what I came up with instead. It seems far from elegant, and there must be a better way. If there is, what is it? Is there a way to switch on a string? Or choose an action in a more scaleable fashion?
public void actionPerformed(ActionEvent e){
if (e.getActionCommand().equals(resetString)) {
messageX = 75; messageY = 175;
setForeground(Color.black);
blackButton.setSelected(true);
repaint();
return;
}
if ( e.getActionCommand().equals(redString) ) {
setForeground(Color.red);
repaint();
return;
}
if ( e.getActionCommand().equals(blueString) ) {
setForeground(Color.blue);
repaint();
return;
}
if ( e.getActionCommand().equals(greenString) ) {
setForeground(Color.green);
repaint();
return;
}
if ( e.getActionCommand().equals(magentaString) ) {
setForeground(Color.magenta);
repaint();
return;
}
if ( e.getActionCommand().equals(blackString) ) {
setForeground(Color.black);
repaint();
return;
}
} | 0 | [
2,
13027,
27,
21,
3724,
118,
8983,
413,
1130,
68,
5167,
3078,
800,
3726,
3726,
503,
1460,
22661,
106,
45,
31,
22,
79,
21,
272,
18,
1209,
15,
17,
48,
1301,
25,
1597,
20,
21,
1989,
2467,
8247,
625,
26,
3095,
8,
6800,
3143,
9,
41... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Converting registry access to db calls from MFC Feature Pack
===
We may start converting an old VS2003 MFC project to use the fancy new features provided by the MFC Feature Pack and VS2008. Several of the new UI controls would be very nice except for one thing - they automatically save their information to the registry. I don't have a problem with the registry, but for the multiple environments the users use out program from, it's much easier to save user data to the database.
So, I'm hoping that there is one main "access the registry" function that could be overloaded to point the database. But brief investigation hasn't turned up anything. Has anyone else had any success doing something similar? | 0 | [
2,
19583,
18269,
1381,
20,
13,
9007,
3029,
37,
307,
7061,
1580,
3607,
800,
3726,
3726,
95,
123,
799,
19583,
40,
315,
4611,
3325,
307,
7061,
669,
20,
275,
14,
12251,
78,
967,
1173,
34,
14,
307,
7061,
1580,
3607,
17,
4611,
2753,
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... |
Type 'System.Web.UI.WebControls.SessionParameter' does not have a public property named 'DbType'.
===
I am using a Session Parameter on an ObjectDataSource. It works fine on the local development machine but I get this error after copying the website to the production server:
Type 'System.Web.UI.WebControls.SessionParameter' does not have a public property named 'DbType'.
| 0 | [
2,
1001,
13,
22,
10724,
9,
14113,
9,
5661,
9,
14113,
12898,
18,
9,
7202,
5991,
6351,
7307,
22,
630,
52,
57,
21,
317,
1354,
377,
13,
22,
9007,
4474,
22,
9,
800,
3726,
3726,
31,
589,
568,
21,
3723,
18906,
27,
40,
3095,
18768,
12... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using separate TFS projects for source control and work item tracking, is this a good thing?
===
I have a client who is using one TFS project just for source control only and now wants to manage work items in a totally different TFS project, using a different process template, and intends to link changesets to work items across TFS projects.
I know that this is possible in TFS, but don't know what the limitations or issues that come with this configuration. e.g Build Summaries, Reporting, etc.
I would prefer branching the code into a new TFS project and managing code and work items together in one project, but need to know how the above method stacks up.
thx | 0 | [
2,
568,
1725,
13,
11720,
18,
2314,
26,
1267,
569,
17,
170,
9101,
10353,
15,
25,
48,
21,
254,
584,
60,
800,
3726,
3726,
31,
57,
21,
6819,
72,
25,
568,
53,
13,
11720,
18,
669,
114,
26,
1267,
569,
104,
17,
130,
2846,
20,
4705,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 system do you use to encrypt files for a group of people (OS agnostic prefered)?
===
Say you have a bunch of files.
Say you can store meta data to these files.
Say, one of these meta attributes were called "encryption"
Say everyone was allowed to look at these files, but since they are encrypted, only people who know how to decrypt them can actually read the contents.
Say, for every given value of "encryption", a group of people share the knowledge on how to decrypt files marked with that value.
Say you want to be able to do this programmatically, in an OS agnostic way (if possible)
What are the values you would use for "encryption"?
How would you store the keys?
How would you organize access to the keys?
I am currently leaning towards following implementation:
* the value of the field "encryption" contains the name of a key, possibly also denoting the algorithm used
* each user has access to a bunch of keys. This could be defined by roles the user has in an LDAP/ActiveDirectory like structure, or they could just be files in a secure directory in the users profile/home directory.
* on viewing a file, the viewer (I'm trying to build a document management system) checks the users keys and decrypts the file if a matching key was found.
What encryption would you use? Symmetric (AES)? Or Asymmetric (what are the good ones)?
Using asymmetric keys would have the additional benefit of making a difference between reading a file and writing a file: Access to the private key is necessary for writing the file, access to the public key (only semi public, as only certain roles have access to it) would allow reading the file. Am I totally mistaken here?
What are common systems to solve these problems used in small to medium sized businesses? | 0 | [
2,
98,
329,
107,
42,
275,
20,
1957,
11435,
6488,
26,
21,
214,
16,
148,
13,
5,
759,
21,
21944,
6369,
69,
6,
60,
800,
3726,
3726,
395,
42,
57,
21,
7653,
16,
6488,
9,
395,
42,
92,
1718,
7618,
1054,
20,
158,
6488,
9,
395,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What exactly does the word Patch mean when refering to 'submitting a patch'?
===
What exactly does the word patch mean when refering to 'submitting a patch'?
I've seen this used a lot, especially in the open source world. What what does it mean and what exactly is involved in submitting a patch? | 0 | [
2,
98,
1890,
630,
14,
833,
7331,
884,
76,
5017,
68,
20,
13,
22,
7563,
5130,
1203,
21,
7331,
22,
60,
800,
3726,
3726,
98,
1890,
630,
14,
833,
7331,
884,
76,
5017,
68,
20,
13,
22,
7563,
5130,
1203,
21,
7331,
22,
60,
31,
22,
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... |
How can jsessionID be suppressed on OC4J?
===
I'm deploying a JSF (myfaces, restfaces, and richfaces) app to OC4J. I don't want the jsessionid to appear in the status bar or the URL address. I have managed to suppress it in almost all cases. The one case that I still have problems with is when the site is first visited with a "clean" browser (with no cache, history, etc.). In this case, jsessionid appears on every link until any link is clicked on, then it disappears, and will not come back (even in subsequent sessions) until the browser's cache is cleared again.
It seems others have run into this problem, but I didn't find any resolutions or work arounds:
- [Java Servlet - how to remove
jsessionid from embedded URLs][1]
- [Thread: How to hide JSESSIONID in
first-page Url? ][2]
[1]: http://forums.sun.com/thread.jspa?messageID=10125580&tstart=0
[2]: http://forums.oracle.com/forums/message.jspa?messageID=2632969 | 0 | [
2,
184,
92,
487,
7202,
5991,
1340,
44,
15848,
27,
13,
2499,
300,
728,
60,
800,
3726,
3726,
31,
22,
79,
17617,
68,
21,
487,
18,
410,
13,
5,
915,
6413,
18,
15,
760,
6413,
18,
15,
17,
2042,
6413,
18,
6,
4865,
20,
13,
2499,
300,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 System.IO.Compression to read/write ZIP files?
===
I know there are [libraries out there for working with ZIP files][1]. And, you can alternatively [use the functionality built into Windows for working ZIP files][2].
But, I'm wondering if anyone has worked out how to use the tools built into the System.IO.Compression namespace within .NET for reading/writing ZIP files? Or, is it not possible using only this namespace?
UPDATED: I've seem someone comment that the System.IO.Packaging namespace might be usefull with this also. Does anyone know exactly how to do it?
[1]: http://stackoverflow.com/questions/11737/net-library-to-unzip-zip-and-rar-files
[2]: http://stackoverflow.com/questions/30211/windows-built-in-zip-compression-script-able | 0 | [
2,
184,
20,
275,
329,
9,
1963,
9,
960,
5890,
872,
20,
1302,
118,
23716,
12133,
6488,
60,
800,
3726,
3726,
31,
143,
80,
50,
636,
1210,
2559,
2829,
70,
80,
26,
638,
29,
12133,
6488,
500,
2558,
165,
500,
9,
17,
15,
42,
92,
16785,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do you ever feel confident in your skills?
===
As a self taught developer i always find myself questioning my skill and knowledge and always feel like i am falling behind in using new technology. Over a period of nearly 9 years i've studied most mainstream languages (especially C based ones), used lots of different OSes, read and absorbed many books and even written one myself. But i still feel i'm usless!
Do professional developers ever get to the stage where they feel confident that they know what they are doing and are confident when submitting solutions/code?
When do you know your *good* enough? | 2 | [
2,
107,
42,
462,
583,
9019,
19,
154,
3207,
60,
800,
3726,
3726,
28,
21,
1119,
2359,
10058,
31,
550,
477,
992,
11403,
51,
6148,
17,
1918,
17,
550,
583,
101,
31,
589,
3106,
439,
19,
568,
78,
1099,
9,
84,
21,
620,
16,
1212,
561,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Jetty dynamically load "static" pages.
===
I am building Java web applications, and I hate the traditional "code-compile-deploy-test" cycle. I want to type in one tiny change, then see the result INSTANTLY, without having to compile and deploy.
Fortunately, [Jetty][1] is great for this. It is a pure-java web server. It comes with a really nice [maven plugin][2] which lets you launch Jetty reading directly from your build tree -- no need to package a war file or deploy. It even has a scanInterval setting: put this to a non-zero value and it will watch your java files and various config files for changes and automatically re-deploy a few seconds after you make a change.
There's just one thing keeping me from nirvana. I have javascript and css files in my src/main/webapp directory which just get served up by Jetty. I would like to be able to edit *these* and have the changes show up when I refresh the page in the browser. Unfortunately, Jetty holds these files open so I can't (on Windows) modify them while it is running.
Does anyone know how to make Jetty let go of these files so I can edit them, then serve up the edited files for subsequent requests?
[1]: http://www.mortbay.org/jetty/
[2]: http://docs.codehaus.org/display/JETTY/Maven+Jetty+Plugin | 0 | [
2,
184,
20,
233,
17341,
93,
7782,
1326,
6305,
13,
7,
18077,
7,
4434,
9,
800,
3726,
3726,
31,
589,
353,
8247,
2741,
3767,
15,
17,
31,
3223,
14,
1361,
13,
7,
9375,
8,
11103,
3599,
8,
17309,
10892,
8,
10543,
7,
4150,
9,
31,
259,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Regex failing on right parens
===
I have this .NET regex:
^(?<prefix>("[^"]*"))\s(?<attrgroup>(\([^\)]*\)))\s(?<suffix>("[^"]*"))$
It properly matches the following strings:
"some prefix" ("attribute 1" "value 1") "some suffix"
"some prefix" ("attribute 1" "value 1" "attribute 2" "value 2") "some suffix"
It fails on...
"some prefix" ("attribute 1" "value (fail) 1") "some suffix"
...due to the right paren after "fail".
How can I modify my regex so that the `attrgroup` match group will end up containing "`("attribute 1" "value (fail) 1")`"? I've been looking at it for too long and need some fresh eyes. Thanks! | 0 | [
2,
7953,
1706,
7250,
27,
193,
2017,
3474,
800,
3726,
3726,
31,
57,
48,
13,
9,
2328,
7953,
1706,
45,
13,
1,
5,
60,
1,
3515,
18594,
1,
5,
7,
2558,
1,
7,
500,
2483,
7,
6,
6,
1,
18,
5,
60,
1,
10303,
139,
8024,
1,
5,
1,
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.