unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Recommendation for text-based software design review collaboration tool
===
Much of the software design we do in our company is in Microsoft Word, embedding pictures and Visio diagrams where necessary.
Can anyone recommend a good software design review collaboration tool that allows multiple parties to give review feedback in parallel? Currently, we use various methods none of which are ideal:
* **Using "Insert comment" feature in Word.** Useful, but quite serialised and collating feedback from multiple parties often requires manual merging, or reading different versions of the document. Doesn't lend itself well to parallel reviews.
* **Using a separate spreadsheet to track feedback, and responses.** We can store the spreadsheet on a share drive, but this is still serialised as only a single reviewer can edit the spreadsheet at once.
I guess I'm looking for something like [CodeStriker][1], but for designs rather than code implementation.
Any recommendations from personal experience? Free (or cheap) applications would be preferred, in these tough economic times ;-)
[1]: http://codestriker.sourceforge.net/ | 0 | [
2,
14066,
26,
1854,
8,
1281,
2306,
704,
1487,
4004,
5607,
800,
3726,
3726,
212,
16,
14,
2306,
704,
95,
107,
19,
318,
237,
25,
19,
7099,
833,
15,
11911,
69,
3258,
3104,
17,
9060,
1963,
14161,
18,
113,
2378,
9,
92,
1276,
12360,
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... |
[C#] How do I form a good predicate to Find() something in my List<T>?
===
After looking on MSDN, it's still unclear to me how I should form a proper predicate to use the Find() method in List<T> using a member variable of T (where T is a class)
For example:
public class Car
{
public string Make;
public string Model;
public int Year;
}
{ // somewhere in my code
List<Car> carList = new List<Car>();
// ... code to add Cars ...
Car myCar = new Car();
// Find the first car made in 1999
myCar = carList.Find(byYear(1999));
}
What should my "byYear" predicate look like?
(The MSDN example only talks about a List<string> of dinosaurs and only searches for an unchanging value "saurus" -- It doesn't show how to pass a value into the predicate...) | 0 | [
2,
636,
150,
5910,
500,
184,
107,
31,
505,
21,
254,
28712,
20,
477,
5,
6,
301,
19,
51,
968,
1,
38,
1,
60,
800,
3726,
3726,
75,
699,
27,
4235,
43,
103,
15,
32,
22,
18,
174,
11293,
20,
55,
184,
31,
378,
505,
21,
4119,
28712,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Mapping Oracle bool fields with nHibernate
===
I have an Oracle database and the boolean fields are CHAR(1) with Y/N stored. How can I map this to a bool type using nHibernate?
| 0 | [
2,
13305,
15759,
1607,
1823,
2861,
29,
12109,
15191,
8820,
800,
3726,
3726,
31,
57,
40,
15759,
6018,
17,
14,
9827,
413,
210,
2861,
50,
4892,
5,
165,
6,
29,
13,
93,
118,
103,
8214,
9,
184,
92,
31,
2942,
48,
20,
21,
1607,
1823,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
nHibernate mapping to custom types
===
I have a Oracle database and one of the fields is a date range field. It is basically just stored in the database as a VARCHAR(40) in the format YYYY/MM/DD-YYYY/MM/DD. I want to map it in nHibernate to a custom class I have created like this
public class DateTimeRange
{
public DateTimeRange(DateTime fromTime, DateTime toTime)
{
FromTime = fromTime;
ToTime = toTime;
}
public override string ToString()
{
return String.Format("{0} to {1}", FromTime.ToString("HH:mm:ss"), ToTime.ToString("HH:mm:ss"));
}
public DateTime FromTime { get; set; }
public DateTime ToTime { get; set; }
}
How can I map to custom classes like this?
| 0 | [
2,
12109,
15191,
8820,
13305,
20,
5816,
2551,
800,
3726,
3726,
31,
57,
21,
15759,
6018,
17,
53,
16,
14,
2861,
25,
21,
1231,
978,
575,
9,
32,
25,
11374,
114,
8214,
19,
14,
6018,
28,
21,
4033,
5433,
5,
2602,
6,
19,
14,
2595,
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... |
Eclipse project directory
===
Is there a way to get the directory of a project in Eclipse? We are writing a plugin that will allow the user to select files, and then run some processes on those files. I would ideally like to be able to get all the files with a certain extension, but that is not necessary. | 0 | [
2,
11652,
669,
16755,
800,
3726,
3726,
25,
80,
21,
161,
20,
164,
14,
16755,
16,
21,
669,
19,
11652,
60,
95,
50,
1174,
21,
10922,
108,
30,
129,
1655,
14,
4155,
20,
5407,
6488,
15,
17,
94,
485,
109,
5102,
27,
273,
6488,
9,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
OpenGl with Python
===
I am currently in a course that is using opengl and I have been using c for all the programs so far. I have python installed on fedora as well as opengl however the minute I call an opengl command in my python code I get a **segmentation fault**. I have no idea why this is.
Just to avoid the just use c comments heres why I want to use python.
There are a couple reasons I am wanting to switch from c to python, but the main one is because we are about to start writing a raytracer and I would like to use classes to make it easier on me. Since I hate classes in c++ and structs in c seems a little crazy, I thought I would give python a try at it. I have also been looking for a reason to use python again as it has been a while.
Thanks for any help. | 0 | [
2,
368,
8430,
29,
20059,
800,
3726,
3726,
31,
589,
871,
19,
21,
674,
30,
25,
568,
368,
8430,
17,
31,
57,
74,
568,
272,
26,
65,
14,
1726,
86,
463,
9,
31,
57,
20059,
4066,
27,
26726,
58,
28,
134,
28,
368,
8430,
207,
14,
2038,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Python + Leopard + Fink + Mac Ports + Python.org + Idiot = broken Python - fresh start?
===
I have been enjoying learning the basics of python, but before I started reading things I tried to install various python versions and modules clumsily. Now that I have some ideas of what I want to do and how to do it I'm finding that various aspects are broken. For instance, 2.6 IDLE won't launch, and when I try to import modules they usually don't work.
My question is, how would you recommend I clean this up and start fresh? I have read information about modifying the 2.6 install, but I still can't get it to work.
IDLE 2.4 works, and when I launch python from the terminal I am running python 2.4.4. | 0 | [
2,
20059,
2754,
15446,
2754,
26027,
2754,
1572,
9551,
2754,
20059,
9,
5583,
2754,
8563,
800,
2023,
20059,
13,
8,
3180,
799,
60,
800,
3726,
3726,
31,
57,
74,
9227,
2477,
14,
2125,
18,
16,
20059,
15,
47,
115,
31,
373,
1876,
564,
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... |
Modify XML document inside the browser
===
Is it possible to modify/write data to an XML file without any server-side proxy(e.g. a php or asp script)? Can this be done via javascript? XSLT? | 0 | [
2,
17579,
23504,
4492,
572,
14,
16495,
800,
3726,
3726,
25,
32,
938,
20,
17579,
118,
23716,
1054,
20,
40,
23504,
3893,
366,
186,
8128,
8,
1416,
27188,
5,
62,
9,
263,
9,
21,
13,
26120,
54,
28,
306,
3884,
6,
60,
92,
48,
44,
677,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Why don't Searchgasm page links work?
===
I'm using the Searchgasm plugin for my searching and pagination. Everything seems to work great but the page links don't seem to work at all. Has anyone had this problem with Searchgasm before?
Controller Code:
class ArtistsController < ApplicationController
# GET /artists
# GET /artists.xml
def index
@search = Artist.new_search
@search.per_page = 10
@search.page = 2
@artists = @search.all
respond_to do |format|
format.html # index.html.erb
format.xml { render :xml => @artists }
end
end
end
View Code:
<h1>Listing artists</h1>
<table>
<tr>
<th><%= :name %></th>
</tr>
<% for artist in @artists %>
<tr>
<td><%= link_to artist.name, artist %></td>
<td><%= link_to 'Edit', edit_artist_path(artist) %></td>
<td><%= link_to 'Destroy', artist, :confirm => 'Are you sure?', :method => :delete %></td>
</tr>
<% end %>
</table>
<br />
Per page: <%= per_page_select %>
<br />
<br />
<% if @search.page_count > 1 %>
<div class="pages"><%= page_links :spread => 1 %></div>
<% end %>
<%= link_to 'New artist', new_artist_path %>
| 2 | [
2,
483,
221,
22,
38,
2122,
6927,
79,
2478,
6271,
170,
60,
800,
3726,
3726,
31,
22,
79,
568,
14,
2122,
6927,
79,
10922,
108,
26,
51,
5792,
17,
19006,
108,
857,
9,
796,
2206,
20,
170,
374,
47,
14,
2478,
6271,
221,
22,
38,
2260,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there an expandable list of object references in Java?
===
In Java, we can always use an array to store object reference. Then we have an ArrayList or HashTable which is automatically expandable to store objects. But does anyone know a native way to have an auto-expandable array of object references? | 0 | [
2,
25,
80,
40,
6073,
579,
968,
16,
3095,
7231,
19,
8247,
60,
800,
3726,
3726,
19,
8247,
15,
95,
92,
550,
275,
40,
7718,
20,
1718,
3095,
2801,
9,
94,
95,
57,
40,
7718,
5739,
54,
19170,
5924,
56,
25,
7499,
6073,
579,
20,
1718,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 activity
===
I've found Ruby very attractive, the way everything is an object and its syntax are very appealing.
I was hopping this programming language to gain a lot of popularity in this year, but I don't seem to find a lot of activity in Ruby in general.
For instance if we take the number of tags added in SO there are only about 700 question marked as ruby this may be either by:
1. Ruby is so easy, none has any question.
2. This site attracts more .net community and Ruby developers ignore its existence.
3. There are not as many ruby projects as there are with other programming languages.
What ever is the reason, some other resources show ruby is not yet so popular as other programming languages.
What reason do you think its behind this.
links:
<a href="http://www.tiobe.com/index.php/content/paperinfo/tpci/index.html">TIOBE Programming Community Index for October 2008</a>
<a href="http://stackoverflow.com/tags">StackOverflow tags</a>
<a href="http://www.ohloh.net/">Ohloh</a>
| 0 | [
2,
10811,
2358,
800,
3726,
3726,
31,
22,
195,
216,
10811,
253,
7982,
15,
14,
161,
796,
25,
40,
3095,
17,
82,
22649,
50,
253,
18518,
9,
31,
23,
13,
21181,
48,
3143,
816,
20,
3288,
21,
865,
16,
5178,
19,
48,
159,
15,
47,
31,
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... |
Factory based on Typeof or is a
===
Whats a more elegant way of having the code below where i want to return a derived class based on the type of another class.
if (option_ is Rectagle)
{
modelInputs = new Foo();
}
else if (option_ is Circle)
{
modelInputs = new Bar();
}
else if (option_ is Triangle)
{
modelInputs = new Bar2();
}
| 0 | [
2,
3129,
432,
27,
1001,
1041,
54,
25,
21,
800,
3726,
3726,
98,
18,
21,
91,
11614,
161,
16,
452,
14,
1797,
1021,
113,
31,
259,
20,
788,
21,
3981,
718,
432,
27,
14,
1001,
16,
226,
718,
9,
100,
13,
5,
2594,
3309,
1,
25,
6042,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Safe to read regular expressions from a file?
===
Assuming a Perl script that allows users to specify several text filter expressions in a config file, is there a safe way to let them enter regular expressions as well, without the possibility of unintended side effects or code execution? Without actually parsing the regexes and checking them for problematic constructs, that is. There won't be any substitution, only matching.
As an aside, is there a way to test if the specified regex is valid before actually using it? I'd like to issue warnings if something like `/foo (bar/` was entered.
Thanks, Z. | 0 | [
2,
1834,
20,
1302,
1290,
13832,
37,
21,
3893,
60,
800,
3726,
3726,
11704,
21,
416,
255,
3884,
30,
2965,
3878,
20,
19077,
238,
1854,
11945,
13832,
19,
21,
13,
14093,
2816,
3893,
15,
25,
80,
21,
1834,
161,
20,
408,
105,
2830,
1290,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does WCF support any kind of resume functionality?
===
I am using WCF to upload data to a server.
If the communication fails, is there any way to resume the upload? | 0 | [
2,
630,
11801,
410,
555,
186,
825,
16,
13113,
18548,
60,
800,
3726,
3726,
31,
589,
568,
11801,
410,
20,
71,
8294,
1054,
20,
21,
8128,
9,
100,
14,
3291,
13614,
15,
25,
80,
186,
161,
20,
13113,
14,
71,
8294,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How do i tell my application to close?
===
I have just discovered the nifty unhandled exception handler for cocoa-touch. Now that i can gracefully notify the user about any unhandled exceptions that might crash my application. I'd like to shut down my application after notifying the user that a crash has occured. Does anyone know how to shut down an application programmatically? | 0 | [
2,
184,
107,
31,
494,
51,
3010,
20,
543,
60,
800,
3726,
3726,
31,
57,
114,
1848,
14,
1781,
3072,
93,
367,
3203,
1294,
5391,
24641,
26,
24507,
8,
15725,
9,
130,
30,
31,
92,
28138,
52,
8612,
14,
4155,
88,
186,
367,
3203,
1294,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How is Silverlight going to change the internet in the next few years?
===
How is Silverlight going to change the internet in the next 10 years?
Is this going to be a scene changer or just another blip? | 0 | [
2,
184,
25,
1172,
3130,
228,
20,
753,
14,
2620,
19,
14,
328,
310,
122,
60,
800,
3726,
3726,
184,
25,
1172,
3130,
228,
20,
753,
14,
2620,
19,
14,
328,
332,
122,
60,
25,
48,
228,
20,
44,
21,
1691,
753,
139,
54,
114,
226,
334,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Is this C++ implementation for an Atomic float safe?
===
Ok here's a tough one, I want an Atomic float, not for super-fast graphics performance, but to use routinely as data-members of classes. And I don't want to pay the price of using locks on these classes, because it provides no additional benefits for my needs.
Now with intel's tbb and other atomic libraries I've seen, integer types are supported, but not floating points. So I went on and implemented one, and it works... but I'm not sure if it REALLY works, or I'm just very lucky that it works.
Anyone here knows if this is not some form of threading heresy?
struct AtomicFloat: public tbb::atomic<size_t>
{
float compare_and_swap(float value, float compare)
{
size_t value_ = tbb::atomic<size_t>::compare_and_swap((size_t&)value,(size_t&)compare);
return reinterpret_cast<float&>(value_);
}
float operator=(float value)
{
size_t value_ = (*this).tbb::atomic<size_t>::operator =((size_t&)value);
return reinterpret_cast<float&>(value_);
}
operator float()
{
return reinterpret_cast<float&>(*this);
}
float operator+=(float value)
{
volatile float old_value_, new_value_;
do
{
old_value_ = reinterpret_cast<float&>(*this);
new_value_ = old_value_ + value;
} while(compare_and_swap(new_value_,old_value_) != old_value_);
return (new_value_);
}
};
Thanks! | 0 | [
2,
25,
48,
272,
20512,
6123,
26,
40,
9692,
11510,
1834,
60,
800,
3726,
3726,
5854,
235,
22,
18,
21,
6161,
53,
15,
31,
259,
40,
9692,
11510,
15,
52,
26,
1026,
8,
13088,
8351,
956,
15,
47,
20,
275,
22388,
28,
1054,
8,
6990,
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 can I pop-up a print dialog box using Javascript?
===
I have a page with a "Print" link that takes the user to a printer-friendly page. The client wants a print dialog box to appear automatically when the user arrives at the print-friendly page. How can I do this with javascript? | 0 | [
2,
184,
92,
31,
1675,
8,
576,
21,
4793,
28223,
1649,
568,
8247,
8741,
60,
800,
3726,
3726,
31,
57,
21,
2478,
29,
21,
13,
7,
10299,
7,
3508,
30,
1384,
14,
4155,
20,
21,
12925,
8,
15950,
2478,
9,
14,
6819,
2846,
21,
4793,
28223,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 benefits of Java?
===
I always hear that programmers try to pick the right tool for the job. I've never programmed in Java, so I was wondering What are its benefits? Why is it so popular? What should I use it for? | 0 | [
2,
98,
50,
14,
5800,
16,
8247,
60,
800,
3726,
3726,
31,
550,
990,
30,
17968,
18,
1131,
20,
2036,
14,
193,
5607,
26,
14,
1205,
9,
31,
22,
195,
243,
2866,
43,
19,
8247,
15,
86,
31,
23,
5712,
98,
50,
82,
5800,
60,
483,
25,
32... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0... |
is using class names like 'right' considered bad practice?
===
If I have class names such as "left", "right", "clear" and xhtml like
<a href="index.php" class="right continueLink">Continue</a>
With CSS like
.right {
float: right;
}
I know it's not a semantic name, but it does make things much easier sometimes.
Anyway, what are your thoughts? | 0 | [
2,
25,
568,
718,
1817,
101,
13,
22,
4183,
22,
724,
896,
1345,
60,
800,
3726,
3726,
100,
31,
57,
718,
1817,
145,
28,
13,
7,
9742,
7,
15,
13,
7,
4183,
7,
15,
13,
7,
18600,
7,
17,
993,
15895,
101,
13,
1,
58,
746,
14057,
3726,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Performing an update with LINQ
===
I am digging into LINQ--trying to understand basic models (it seems pretty cool to me). The code below is the code to perform before committing an update.
Linq01.Account acc = context.Accounts.Single( pc => pc.AccountID == AccountID );
acc.Name = textboxAccountNameRead.Text.Trim();
context.SubmitChanges();
So far, so good. But what do you do if the Single() method failed--if the account ID wasn't found?
Thank you!
| 0 | [
2,
2955,
40,
11100,
29,
6294,
1251,
800,
3726,
3726,
31,
589,
11004,
77,
6294,
1251,
8,
8,
5840,
68,
20,
1369,
2125,
2761,
13,
5,
242,
2206,
1772,
2700,
20,
55,
6,
9,
14,
1797,
1021,
25,
14,
1797,
20,
2985,
115,
19524,
40,
111... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 create an unobtrusive flash?
===
I have an embedded flash that is transparent so it looks like part of the background. I achieved that by setting wmode to transparent.
My problem is that the area underneath the flash becomes inaccessible, even though the flash is transparent. Therefore I cannot click on any links or buttons that are under the flash object.
How do I make the flash unobtrusive? | 0 | [
2,
184,
20,
1600,
40,
367,
4995,
8989,
18,
1284,
4433,
60,
800,
3726,
3726,
31,
57,
40,
12138,
4433,
30,
25,
14862,
86,
32,
1879,
101,
141,
16,
14,
2395,
9,
31,
3153,
30,
34,
2697,
619,
15570,
20,
14862,
9,
51,
1448,
25,
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... |
Any page navigation helpers for ASP.NET MVC?
===
Are there any html helpers for page navigation. eg. if i have 1000 records to display, i want to display the Previous 1 2 3 4 ... etc Next link stuff under the filtered collection.
Anyone know of anything out there? | 0 | [
2,
186,
2478,
8368,
448,
445,
26,
28,
306,
9,
2328,
307,
8990,
60,
800,
3726,
3726,
50,
80,
186,
13,
15895,
448,
445,
26,
2478,
8368,
9,
12369,
9,
100,
31,
57,
6150,
742,
20,
3042,
15,
31,
259,
20,
3042,
14,
1158,
137,
172,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the coolest hack you have done in vim
===
While surfing, I came to know that somebody has done Tower of Hanoi using vim. WOW!!!
Can you people share what all cool things you have been doing in vim.
Thanks
Aman Jain | 0 | [
2,
98,
22,
18,
14,
2700,
1430,
11835,
42,
57,
677,
19,
1790,
79,
800,
3726,
3726,
133,
22449,
15,
31,
281,
20,
143,
30,
8861,
63,
677,
1710,
16,
26822,
568,
1790,
79,
9,
15293,
28116,
92,
42,
148,
1891,
98,
65,
2700,
564,
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,
0,
0,
0,
0,
0,
0... |
What do you wish you knew before you spent hours trying to fix a bug in IE6
===
Mine would have to be the float and margin bugs...
If you float an element, and then specify a margin for it, it will double the margin.
The solution to this is to add 'display: inline' to the element. This will stop the double margin, and all other browsers will ignore it because only block level objects can be floated.
| 0 | [
2,
98,
107,
42,
2536,
42,
404,
115,
42,
1111,
974,
749,
20,
6098,
21,
6256,
19,
13,
660,
379,
800,
3726,
3726,
1114,
83,
57,
20,
44,
14,
11510,
17,
5440,
13925,
9,
9,
9,
100,
42,
11510,
40,
4520,
15,
17,
94,
19077,
21,
5440,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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++/Unix Home Project Ideas
===
I am a C++, Unix developer, mostly in systems side, product domain. I would like to take up some side project to improve my skills in the following :
- Object oriented Design
- Multithreaded Programming, with ample scope for mutexes and semaphores
- Interprocess Communications in Unix
- Core C++ stuff (wanna use templates, handle exceptions, use smart pointers n stuff)
I have decent "bookish" knowledge of all of the above but haven't got enough opportunities to get my hands dirty. Recently I went for an interview and they gave me really good (and tough) real life problems from the above and I failed miserably. Hence this effort :-)
I am looking at something like a 6 month project, spending about 3 hours on a daily basis.
Any suggestions would be great.
Thanks.
| 0 | [
2,
272,
20512,
118,
1020,
4028,
213,
669,
3478,
800,
3726,
3726,
31,
589,
21,
272,
20512,
15,
22540,
10058,
15,
1555,
19,
1242,
270,
15,
2374,
4603,
9,
31,
83,
101,
20,
247,
71,
109,
270,
669,
20,
3545,
51,
3207,
19,
14,
249,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does one add a svn repository build number to Python code?
===
This question is similar to http://stackoverflow.com/questions/16248/getting-the-subversion-repository-number-into-code
The differences being:
1. I would like to add the revision number to Python
1. I want the revision of the repository (not the checked out file)
I.e. I would like to extract the Revision number from the return from 'svn info', likeso:
$ svn info
Path: .
URL: svn://localhost/B/trunk
Repository Root: svn://localhost/B
Revision: 375
Node Kind: directory
Schedule: normal
Last Changed Author: bmh
Last Changed Rev: 375
Last Changed Date: 2008-10-27 12:09:00 -0400 (Mon, 27 Oct 2008)
I want a variable with 375 (the Revision). It's easy enough with put $Rev$ into a variable to keep track of changes on a file. However, I would like to keep track of the repository's version, and I understand (and it seems based on my tests) that $Rev$ only updates when the file changes.
My initial thoughts turn to using the svn/libsvn module built in to Python, though I can't find any documentation on or examples of how to use them.
Alternatively, I've thought calling 'svn info' and regex'ing the code out, though that seems rather brutal. :)
Help would be most appreciated.
Thanks & Cheers.
| 0 | [
2,
184,
630,
53,
3547,
21,
13,
18,
16578,
24869,
1895,
234,
20,
20059,
1797,
60,
800,
3726,
3726,
48,
1301,
25,
835,
20,
7775,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
1091,
24135,
118,
27380,
8,
124,
8,
7563,
10898,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where should I download corflags.exe from?
===
I'm running Windows Server 2008 64-bit "workstation" and would like to get corflags.exe. Which SDK do I need to download? Or is it possible to get something smaller as the downloads I've seen are starting from 300MB? | 0 | [
2,
113,
378,
31,
7121,
2827,
22868,
18,
9,
1706,
62,
37,
60,
800,
3726,
3726,
31,
22,
79,
946,
1936,
8128,
570,
4384,
8,
3326,
13,
7,
3783,
10839,
7,
17,
83,
101,
20,
164,
2827,
22868,
18,
9,
1706,
62,
9,
56,
13,
18,
43,
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... |
Getting the value of a specific element from a different row in gnuplot
===
Using gnuplot 4.2, is it possible to obtain the value of a specific column/row and use that value somehow?
For example, let's say my datafile contains the following
#1 2
7 13
5 11
23 17
53 12
For a simple plot where column 1 is the x axis and column 2 is the y axis I would:-
plot 'datafile' using 1:2
What I'm trying to do is to normalize the all data in column 2 by the first element in that column (13). Is there a way to do this in gnuplot itself (i.e., without resorting to a scripting language or something to preprocess the data first)?
Cheers | 0 | [
2,
1017,
14,
1923,
16,
21,
1903,
4520,
37,
21,
421,
3131,
19,
26092,
13221,
38,
800,
3726,
3726,
568,
26092,
13221,
38,
268,
9,
135,
15,
25,
32,
938,
20,
5545,
14,
1923,
16,
21,
1903,
4698,
118,
5417,
17,
275,
30,
1923,
3625,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 keep a Php stream_socket alive?
===
I have a Php application using stream_socket_client(), to get data through tcp from a back-end server, but would like to keep the connections alive or even better in a pool or something to avoid the connect/disconnect over head.
But I'm not a Php guru, so I have no idea how to do this. And although I could probably figure it out in a few hours, my time will be probably better spent picking on everyone's brains, so any advice? | 0 | [
2,
184,
20,
643,
21,
13,
26120,
3766,
1,
18,
5668,
1198,
2481,
60,
800,
3726,
3726,
31,
57,
21,
13,
26120,
3010,
568,
3766,
1,
18,
5668,
1198,
1,
150,
18513,
38,
5,
6,
15,
20,
164,
1054,
120,
13,
38,
7439,
37,
21,
97,
8,
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... |
Speed up visual studio large number of projects
===
vs 2005 is very slow with a solution with 21 projects. any ideas how to speed it up? | 0 | [
2,
1362,
71,
3458,
1120,
370,
234,
16,
2314,
800,
3726,
3726,
4611,
812,
25,
253,
2276,
29,
21,
4295,
29,
852,
2314,
9,
186,
3478,
184,
20,
1362,
32,
71,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Multi Column Listbox
===
Is there a way to bind a Generic List to a multicolumn listbox, yes listbox...I know but this is what I am stuck with and can't add a grid or listview.
Thanks | 0 | [
2,
1889,
4698,
968,
5309,
800,
3726,
3726,
25,
80,
21,
161,
20,
10193,
21,
12733,
968,
20,
21,
1889,
716,
4404,
103,
968,
5309,
15,
1643,
968,
5309,
9,
9,
9,
49,
143,
47,
48,
25,
98,
31,
589,
4549,
29,
17,
92,
22,
38,
3547,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
In a Dynamic Data custom page how do I retrieve the just updated object?
===
I am using ASP.NET Dynamic Data and have a custom page.
In this page I have a handle on the DetailsView inserted event where I would like to do something based on the value of the recently updated object. However, I can't put the event handling in the model class of the respective object because it is also based on the value of a custom (unbound) form element in the custom page.
How can I retrieve the object that was just updated by the DetailsView?
| 0 | [
2,
19,
21,
7782,
1054,
5816,
2478,
184,
107,
31,
11917,
14,
114,
6372,
3095,
60,
800,
3726,
3726,
31,
589,
568,
28,
306,
9,
2328,
7782,
1054,
17,
57,
21,
5816,
2478,
9,
19,
48,
2478,
31,
57,
21,
3053,
27,
14,
3289,
4725,
14215... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
License Permitting Customer Modification
===
I've written some software for a customer, and I'd like to release it to them under a license that permits them to make modifications for their own in-house use, but still prohibits them from selling or otherwise redistributing the software after I've given it to them. Can someone point me to a license that either has this effect or could with slight modification? Thanks. | 0 | [
2,
3962,
26739,
7705,
16135,
800,
3726,
3726,
31,
22,
195,
642,
109,
2306,
26,
21,
7705,
15,
17,
31,
22,
43,
101,
20,
830,
32,
20,
105,
131,
21,
3962,
30,
17446,
105,
20,
233,
13922,
26,
66,
258,
19,
8,
1682,
275,
15,
47,
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... |
Team City versus CruiseControl.net- which one is better
===
are there real tangible differences or is it just a matter of taste | 0 | [
2,
173,
136,
5706,
6581,
12898,
9,
2328,
8,
56,
53,
25,
574,
800,
3726,
3726,
50,
80,
683,
25968,
4921,
54,
25,
32,
114,
21,
1161,
16,
3576,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How can I create a drop shadow like floating effect around a canvas component in flex?
===
I want create a drop shadow around the canvas component in flex. Technically speaking it will not be a shadow, as I want it to wrap around the component giving the component a floating look. I may be able to do it with glow, but can anyone drop an line or two who has already done it?
Thanks in advance.
| 0 | [
2,
184,
92,
31,
1600,
21,
2804,
3118,
101,
8319,
1590,
140,
21,
9696,
5912,
19,
14409,
60,
800,
3726,
3726,
31,
259,
1600,
21,
2804,
3118,
140,
14,
9696,
5912,
19,
14409,
9,
12345,
3324,
32,
129,
52,
44,
21,
3118,
15,
28,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How could I store Image retrieved from web, into application bundle?
===
I am developing iPhone application and In that application I've one TableViewController,
and that TableViewController made up of Custom table cell.
into those cell I am loading image from URL, but the scrolling is not that smooth,(because each cell load images everytime when scrolling happen.)
So I decided to store those images into application document folder, but i don't how to use document folder in iPhone when application is in running state.
any suggestion?
And on other forums I found that SQLITE has blob datatype to store binary data,
which method is efficient, document folder or sqlite to store image?
thanks in advance. | 0 | [
2,
184,
110,
31,
1718,
1961,
3685,
37,
2741,
15,
77,
3010,
10194,
60,
800,
3726,
3726,
31,
589,
3561,
21024,
3010,
17,
19,
30,
3010,
31,
22,
195,
53,
859,
4725,
12898,
1252,
15,
17,
30,
859,
4725,
12898,
1252,
117,
71,
16,
5816,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SVN commit error after deleting files locally
===
I have a project that I am building with Netbeans 6.1 and I am using SVN. I deleted some files on the local machine then attempted to commit my changes to th SVN repository. The commit fails with the error message
> Entry for 'C:\path\to\project\myfile' has no URL
Where myfile is the deleted file.
Is there some way to tell SVN that the file was deleted from the project and that it should be deleted from the repository? | 0 | [
2,
13,
18,
16578,
9686,
7019,
75,
121,
1336,
68,
6488,
6680,
800,
3726,
3726,
31,
57,
21,
669,
30,
31,
589,
353,
29,
4275,
863,
5950,
400,
9,
165,
17,
31,
589,
568,
13,
18,
16578,
9,
31,
19584,
109,
6488,
27,
14,
375,
1940,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to partially autowire a spring bean?
===
I want to autowire a bean partially - that is, I want some args to be autowired but other to be explicitly set. For example:
public MyClient(Service svc, boolean b)
In the case of this constructor, I would like to specify in my xml the value for b, but have svc autowired. Is that possible?
Thanks,
Lowell | 0 | [
2,
25,
32,
938,
20,
5933,
3108,
13482,
21,
1573,
15322,
60,
800,
3726,
3726,
31,
259,
20,
3108,
13482,
21,
15322,
5933,
13,
8,
30,
25,
15,
31,
259,
109,
13,
10663,
18,
20,
44,
3108,
13482,
43,
47,
89,
20,
44,
13108,
309,
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... |
Whats the best book or article you have read on optimizing mysql servers (linux)?
===
I am searching for a good book or article which will help me optimize my mysql servers even more. I am using InnoDB and want to make sure the whole db is loaded into RAM but don't know how. | 0 | [
2,
98,
18,
14,
246,
360,
54,
2002,
42,
57,
1302,
27,
19259,
3335,
51,
18,
22402,
17595,
13,
5,
1226,
7147,
6,
60,
800,
3726,
3726,
31,
589,
5792,
26,
21,
254,
360,
54,
2002,
56,
129,
448,
55,
22864,
51,
51,
18,
22402,
17595,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 AppDomain using COM interop problem
===
Here's the core problem: I have a .NET application that is using COM interop in a seperate AppDomain. The COM stuff seems to be loading assemblies back into the default domain, rather than the AppDomain from which the COM stuff is being called.
What I want to know is: is this expected behaviour, or am I doing something wrong to cause these COM related assemblies to be loaded in the wrong AppDomain? Please see a more detailed description of the situation below...
The application consists of 3 assemblies:
- the main EXE, the entry point of the application.
- common.dll, containing just an interface IController (in the IPlugin style)
- controller.dll, containing a Controller class that implements IController and MarshalByRefObject. This class does all the work and uses COM interop to interact with another application.
The relevant part of the main EXE looks like this:
AppDomain controller_domain = AppDomain.CreateDomain("Controller Domain");
IController c = (IController)controller_domain.CreateInstanceFromAndUnwrap("controller.dll", "MyNamespace.Controller");
result = c.Run();
AppDomain.Unload(controller_domain);
The common.dll only contains these 2 things:
public enum ControllerRunResult{FatalError, Finished, NonFatalError, NotRun}
public interface IController
{
ControllerRunResult Run();
}
And the controller.dll contains this class (which also calls the COM interop stuff):
public class Controller: IController, MarshalByRefObject
When first running the application, Assembly.GetAssemblies() looks as expected, with common.dll being loaded in both AppDomains, and controller.dll only being loaded into the controller domain. After calling c.Run() however I see that assemblies related to the COM interop stuff have been loaded into the default AppDomain, and NOT in the AppDomain from which the COM interop is taking place.
Any ideas as to why this might be occurring? | 0 | [
2,
13,
9,
2328,
4865,
537,
6232,
568,
13,
960,
1480,
2594,
1448,
800,
3726,
3726,
235,
22,
18,
14,
2884,
1448,
45,
31,
57,
21,
13,
9,
2328,
3010,
30,
25,
568,
13,
960,
1480,
2594,
19,
21,
10332,
106,
1373,
4865,
537,
6232,
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... |
Get the type of the Generic parameter
===
I have the following classes
public interface InterfaceBase
{
}
public class ImplementA:InterfaceBase
{
}
public class ImplementB:InterfaceBase
{
}
public void TestImplementType<T>(T obj) where T: InterfaceBase
{
}
How to infer what the T is whether ImplementA or ImplementB? I tried to use
typeof(T) is ImplementA
but this expression is always evaluated to false.
Edit: And how am I going to cast obj to ImplementA or ImplementB? | 0 | [
2,
164,
14,
1001,
16,
14,
12733,
18906,
800,
3726,
3726,
31,
57,
14,
249,
2684,
317,
6573,
6573,
8436,
13,
1,
13,
1,
317,
718,
8713,
58,
45,
6280,
6413,
8436,
13,
1,
13,
1,
317,
718,
8713,
220,
45,
6280,
6413,
8436,
13,
1,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
I need a standard package to move key,value pairs over a net connection: any tips?
===
As I hate reinventing the wheel, I wonder if there are any commonly used packaged out there for doing hte simple job of communicating (key,value) pairs of data betweeen two network endpoints (probably TCP/IP is the most likely carrier). I would like something that works in any environment, which for me means Unix/Linux-style socket API written in C or maybe C++. Java is nice, but only Java makes it hard to integrate into binary programs. C# etc. is out due to the need to be portable to Linux hosts.
Is there such a beast? | 0 | [
2,
31,
376,
21,
1236,
6030,
20,
780,
1246,
15,
15165,
7473,
84,
21,
4275,
2760,
45,
186,
11034,
60,
800,
3726,
3726,
28,
31,
3223,
7102,
6645,
68,
14,
3556,
15,
31,
2666,
100,
80,
50,
186,
2524,
147,
6030,
43,
70,
80,
26,
845,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 features make a site "social"?
===
If you are trying to position your web application as "social" (or Web 2.0), what are the top features you should implement?
A decent starting point is [this page][1], but even this perhaps goes a little too far (I think the bar is likely lower).
[1]: http://www.marketingeric.com/12/10-features-every-social-website-should-have/ | 0 | [
2,
98,
967,
233,
21,
689,
13,
7,
11559,
7,
60,
800,
3726,
3726,
100,
42,
50,
749,
20,
649,
154,
2741,
3010,
28,
13,
7,
11559,
7,
13,
5,
248,
2741,
172,
9,
387,
6,
15,
98,
50,
14,
371,
967,
42,
378,
8713,
60,
21,
12238,
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... |
Sort Four Points in Clockwise Order
===
Four 2D points in an array. I need to sort them in clockwise order. I think it can be done with just one swap operation but I have not been able to put this down formally. | 0 | [
2,
2058,
222,
819,
19,
13,
21767,
389,
800,
3726,
3726,
222,
172,
43,
819,
19,
40,
7718,
9,
31,
376,
20,
2058,
105,
19,
13,
21767,
389,
9,
31,
277,
32,
92,
44,
677,
29,
114,
53,
17150,
1453,
47,
31,
57,
52,
74,
777,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Send emails via gmail from different accounts
===
So I have action\_mailer\_optional\_tls (http://svn.douglasfshearer.com/rails/plugins/action\_mailer\_optional\_tls)
and this in my enviroment.rb
ActionMailer::Base.server_settings = {
:tls => true,
:address => "smtp.gmail.com",
:port => "587",
:domain => "www.somedomain.com",
:authentication => :plain,
:user_name => "someusername",
:password => "somepassword"
}
But now what If I want to send emails from different email accounts?
How do I override the username and password fields on the fly?
Thanks in advance!
Ali
| 0 | [
2,
2660,
8517,
18,
1197,
489,
8079,
37,
421,
5310,
800,
3726,
3726,
86,
31,
57,
1028,
1,
8079,
106,
1,
2594,
3309,
192,
1,
7786,
18,
13,
5,
21127,
6903,
18,
16578,
9,
7663,
9984,
18,
410,
1079,
512,
106,
9,
960,
118,
7301,
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 to convince my boss to do refactoring?
===
<p>We (developers) think we should do large scale refactoring in our project, because:<\p>
<p>1. With long time (more than 1 year) bug fixing to much hard code/hard logic been involved.</p>
<p>2. Pickup one piece of code, nobody in this big team can confidentially tell you what will happen if you change that, because code are sticked together.<\p>
<p>3. We are facing fidelity problems, that our software must give exactly same output for old input. In other side we have lots of new feature requirement. We want change code but every change may cause regression (fidelity) problem.<\p>
<p>We want refactoring code to simplify the complexity, but we don't know how to convince our boss. They need some thing to prove that work will useful.</p>
<p>Currently we are counting/classing problems in code by review bug and code, but we are not sure if it's helpful.</p>
<p>Thanks,</p>
<p>Trapped Developer in Large Complex Software</p>
| 0 | [
2,
184,
20,
6218,
51,
4054,
20,
107,
302,
17455,
68,
60,
800,
3726,
3726,
13,
1,
306,
1,
458,
13,
5,
26051,
445,
6,
277,
95,
378,
107,
370,
3464,
302,
17455,
68,
19,
318,
669,
15,
185,
45,
1,
306,
1,
13,
1,
306,
1,
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... |
Looping through 2 Lists at once
===
I have two lists that are of the same length, is it possible to loop through these two lists at once?
I am looking for the correct syntax to do the below
foreach itemA, itemB in ListA, ListB
{
Console.WriteLine(itemA.ToString()+","+itemB.ToString());
}
do you think this is possible in C#? And if it is, what is the lambda expression equivalent of this? | 0 | [
2,
5293,
68,
120,
172,
7227,
35,
382,
800,
3726,
3726,
31,
57,
81,
7227,
30,
50,
16,
14,
205,
1476,
15,
25,
32,
938,
20,
5293,
120,
158,
81,
7227,
35,
382,
60,
31,
589,
699,
26,
14,
4456,
22649,
20,
107,
14,
1021,
26,
14322,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 can't I read from .BAK files on my Desktop using SQL Express in Windows Authentication Mode
===
I am trying to execute this SQL query prior to restoring a .BAK file in SQL Express. Initially, I had the file on the Desktop of my user account. I am logged in as Administrator.
When I try to access the .BAK file on the desktop like this
RESTORE FILELISTONLY FROM DISK= 'C:\Documents and Settings\Administrator\Desktop\file.bak'
I get an error.
<pre>Msg 3201, Level 16, State 2, Line 1
Cannot open backup device 'C:\Documents and Settings\Administrator\Desktop\file.bak'. Operating system error 5(Access is denied.).
Msg 3013, Level 16, State 1, Line 1
RESTORE FILELIST is terminating abnormally.</pre>
However, when I move the .BAK file to `C:\temp`, and execute this
RESTORE FILELISTONLY FROM DISK= 'C:\temp\file.bak'
It works just fine.
I cant figure out what is going on. Is there a way to access files on Desktop using Windows Authentication with SQL Express? | 0 | [
2,
483,
92,
22,
38,
31,
1302,
37,
13,
9,
13344,
6488,
27,
51,
17404,
568,
4444,
255,
2999,
19,
1936,
27963,
3740,
800,
3726,
3726,
31,
589,
749,
20,
15644,
48,
4444,
255,
25597,
1313,
20,
19144,
21,
13,
9,
13344,
3893,
19,
4444,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 "rotate" a layer/view (e.g. just like you would in enigmo)
===
I know how to move a layer based on touch. But I would also like to be able to rotate the image.
Is there any sample code that shows how to do this? Or can anyone give me some advice?
Thanks! | 0 | [
2,
184,
20,
13,
7,
11699,
1373,
7,
21,
5385,
118,
4725,
13,
5,
62,
9,
263,
9,
114,
101,
42,
83,
19,
1957,
2816,
1293,
6,
800,
3726,
3726,
31,
143,
184,
20,
780,
21,
5385,
432,
27,
1723,
9,
47,
31,
83,
67,
101,
20,
44,
77... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are Active Directory forest trusts transitive?
===
I'm working on trouble shooting an application under development that uses information from Active Directory in a multi-forest environment and I have the current problem down to figuring out if forest trusts are transitive, and if so under what conditions.
The setup: Using Active Directory 2003, ForestA has a two-way forest trust with ForestB. ForestB has a two-way forest trust with ForestC.
In this situation is there any sort of trust relationship between ForestA and ForestC? I've found some conflicting informaion; this first link clearly indicates the forest trust in not transitive to other forests:
[Forest trusts][1]
Forest trusts can only be created between two forests and cannot be implicitly extended to a third forest. This means that if a forest trust is created between forest 1 and forest 2, and a forest trust is also created between forest 2 and forest 3, forest 1 will not have an implicit trust with forest 3.
However, I can also find in the list of trust types an indication that forest trusts are transitive:
[Trust types][2]
Trust type: Forest
Transitivity: Transitive
On top of this forest trusts show as "transitive" in the list of active directory trusts when viewed through "Manage domains and trusts"
Does this mean that the forest trust is transitive *WITHIN* the trusting forest but not to other forests? So in the previously mentioned scenario:
ForestA <-> ForestB <-> ForestC
Subdomains would pick up the forest trust through transitivity (so subdom1.ForestA would trust office7.ForestB) but there would be access shared between ForestA and ForestB. Is this correct, or have I become confused by the rather confusing information microsoft publishes? Does nayone have personal experience of this that they can share?
[1]: http://technet.microsoft.com/en-us/library/cc755700.aspx
[2]: http://technet.microsoft.com/en-us/library/cc775736.aspx | 0 | [
2,
50,
1348,
16755,
1334,
1527,
18,
13,
28558,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
2572,
3511,
40,
3010,
131,
522,
30,
2027,
676,
37,
1348,
16755,
19,
21,
1889,
8,
21408,
2307,
17,
31,
57,
14,
866,
1448,
125,
20,
25379,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 performance of StringBuilder in a loop
===
I've a performance related question regarding use of StringBuilder.
In a very long loop I'm manipulating a StringBuilder and passing it to another method like this:
for (loop condition) {
StringBuilder sb = new StringBuilder();
sb.append("some string");
. . .
sb.append(anotherString);
. . .
passToMethod(sb.toString());
}
I'm wondering if instantiating StringBuilder at every loop cycle is a good solution and if calling a delete instead is better, like this
StringBuilder sb = new StringBuilder();
for (loop condition) {
sb.delete(0, sb.length);
sb.append("some string");
. . .
sb.append(anotherString);
. . .
passToMethod(sb.toString());
}
| 0 | [
2,
8247,
956,
16,
3724,
20904,
19,
21,
5293,
800,
3726,
3726,
31,
22,
195,
21,
956,
1597,
1301,
3467,
275,
16,
3724,
20904,
9,
19,
21,
253,
175,
5293,
31,
22,
79,
27799,
21,
3724,
20904,
17,
2848,
32,
20,
226,
2109,
101,
48,
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... |
Slim application server for demonstrating a web app?
===
I have a little pet web app project I'd like to show someone who doesn't have an application server themselves (and who has no clue about application servers).
What is the easiest and quickest way for them to get my WAR file running with zero configuration, preferably something I could send along with or bundle with the WAR file? Is there a slimmed down version of Jetty, for example? Something else? | 0 | [
2,
8824,
3010,
8128,
26,
16133,
21,
2741,
4865,
60,
800,
3726,
3726,
31,
57,
21,
265,
3170,
2741,
4865,
669,
31,
22,
43,
101,
20,
298,
737,
72,
1437,
22,
38,
57,
40,
3010,
8128,
1366,
13,
5,
290,
72,
63,
90,
8906,
88,
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... |
Decimal comaprison in Java script
===
I am trying to compare two decimal values in Java script. I have two objects as one assogned value "3" and the other as "3.00". When i say if (obj1 == obj2) it does not pass the condition as it is does the string comparision.
I would instead want it to do a decimal comparision where 3 = 3.00. Please let me know how to do this. | 0 | [
2,
26380,
13987,
6944,
528,
19,
8247,
3884,
800,
3726,
3726,
31,
589,
749,
20,
11590,
81,
26380,
4070,
19,
8247,
3884,
9,
31,
57,
81,
3916,
28,
53,
28,
18,
26254,
43,
1923,
13,
7,
240,
7,
17,
14,
89,
28,
13,
7,
240,
9,
2032,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
I need help creating a modding system in a Facebook Application
===
I'm trying to create a basic system that will allow only specific users to see and use modding links like "Delete" and "Edit".
I can't seem to find anything about role management in Facebook applications, and using my own external SQL table or XML file is frustratingly stupid in my opinion, considering the fact I'm only trying to classify certain users as Admins without hard-coding their UID's into the system.
Any Thoughts?
| 0 | [
2,
31,
376,
448,
2936,
21,
7226,
3258,
329,
19,
21,
9090,
3010,
800,
3726,
3726,
31,
22,
79,
749,
20,
1600,
21,
2125,
329,
30,
129,
1655,
104,
1903,
3878,
20,
196,
17,
275,
7226,
3258,
6271,
101,
13,
7,
24249,
591,
7,
17,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where does ConfigurationManager ConnectionStrings get its value?
===
In my ASP.NET application I have a web.config file. In the web.config file I have a connection string...
<connectionStrings>
<add name="HRDb" connectionString="xxxxx" providerName="System.Data.SqlClient" />
</connectionStrings>
Yet, when I retrieve this value using ConfigurationManager.ConnectionStringsp["HRDb"], I get the my old connection string, not the new one.
Where else (apart from web.config) does the ConfigurationManager read connection string values from?
I'm running the application from VS.NET (not deployed to IIS).
| 0 | [
2,
113,
630,
8091,
22256,
2760,
11130,
18,
164,
82,
1923,
60,
800,
3726,
3726,
19,
51,
28,
306,
9,
2328,
3010,
31,
57,
21,
2741,
9,
14093,
2816,
3893,
9,
19,
14,
2741,
9,
14093,
2816,
3893,
31,
57,
21,
2760,
3724,
9,
9,
9,
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... |
Opening a file relative to server folder
===
When I try opening a file it tries to use "C:\Program Files\Common Files\Microsoft Shared\DevServer\9.0" as the base directory.
How can I get the working directory of the web application? | 0 | [
2,
1214,
21,
3893,
4543,
20,
8128,
19294,
800,
3726,
3726,
76,
31,
1131,
1214,
21,
3893,
32,
3919,
20,
275,
13,
7,
150,
45,
1,
19746,
6488,
1,
17130,
6488,
1,
22019,
12980,
2592,
1,
14438,
10321,
106,
1,
518,
9,
387,
7,
28,
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,
0,
0... |
What are the ways to obtain HDD serial number without WMI?
===
I can get the HDD serial number using `ManagementObjectSearcher("SELECT * FROM Win32_PhysicalMedia")`, and for each `ManagementObject` from the result set I can read the serial number.
I am interested in another way of obtaining this information (without WMI), since I get mixed results with my current approach.
Environment: C# 2.0, Windows 2000 or newer. | 0 | [
2,
98,
50,
14,
2847,
20,
5545,
8590,
43,
5956,
234,
366,
619,
1435,
60,
800,
3726,
3726,
31,
92,
164,
14,
8590,
43,
5956,
234,
568,
13,
1,
23502,
23793,
25136,
106,
5,
7,
18,
16964,
1637,
37,
628,
3125,
1,
23274,
8260,
7,
6,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Starting python debugger automatically on error
===
This is a question I have wondered about for quite some time, yet I have never found a suitable solution. If I run a script and I come across, let's say an IndexError, python prints the line, location and quick description of the error and exits. Is it possible to automatically start pdb when an error is encountered? I am not against having an extra import statement at the top of the file, nor a few extra lines of code. | 0 | [
2,
1422,
20059,
121,
2345,
11356,
7499,
27,
7019,
800,
3726,
3726,
48,
25,
21,
1301,
31,
57,
3519,
88,
26,
1450,
109,
85,
15,
768,
31,
57,
243,
216,
21,
6445,
4295,
9,
100,
31,
485,
21,
3884,
17,
31,
340,
464,
15,
408,
22,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Access:How can I generate a report of a recordset?
===
I would like to know how can i generate a report in access with the data in a recordset.
and also if I am making some upodations that also must be shopwn in the report.
thanks | 0 | [
2,
1381,
45,
1544,
92,
31,
7920,
21,
1330,
16,
21,
742,
1198,
60,
800,
3726,
3726,
31,
83,
101,
20,
143,
184,
92,
31,
7920,
21,
1330,
19,
1381,
29,
14,
1054,
19,
21,
742,
1198,
9,
17,
67,
100,
31,
589,
544,
109,
71,
5648,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Wondering about a 3rd Editon of Core Python Porgramming by Wesley Chun
===
Has anyone heard whether there is another version of Core Python Programming coming out that will focust on Python 3000? | 0 | [
2,
5712,
88,
21,
203,
897,
9392,
218,
16,
2884,
20059,
5156,
6295,
3863,
34,
12520,
13,
12583,
800,
3726,
3726,
63,
1276,
752,
1472,
80,
25,
226,
615,
16,
2884,
20059,
3143,
880,
70,
30,
129,
1776,
38,
27,
20059,
13226,
60,
3,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Extremely Wierd Bug with a property in C#
===
I have a certain application which feeds information into an object, after comparing the new information to the old information.
It goes something like
set
{
oldval=_value;
_value=value;
if (some comparison logic)
raiseEvent();
}
This all happens on a background thread, in an infinite loop, which intermittently sleeps for 100ms.
The really odd part is that it works the first time, the comparison logic turns up true, and the event is raised.
After that, the information keeps flowing, it keep entering the object, I know this because I set MessageBoxes to display the old and new values all the time, but its as if it somehow bypasses the set clause!
I set a messagebox in the beginning of the clause, an it just doesn't pop up!
This is really wierd, since I am sure that the value keeps updating.
Any Thoughts? | 3 | [
2,
3898,
11842,
897,
6256,
29,
21,
1354,
19,
272,
5910,
800,
3726,
3726,
31,
57,
21,
1200,
3010,
56,
17058,
676,
77,
40,
3095,
15,
75,
15047,
14,
78,
676,
20,
14,
315,
676,
9,
32,
1852,
301,
101,
309,
13,
1,
315,
3377,
3726,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Your experiences with Visual Studio 2010 CTP?
===
I just saw the anouncement for the [Visual Studio CTP][1] today, and am currently waiting for all those files to download...
Have you already tried the CTP, or maybe a previous version? What are your thoughts? There is another question [What features would you most like to see in Visual Studio 2010][2], now here it is, what do you think?
[1]: http://www.microsoft.com/downloads/details.aspx?FamilyId=922B4655-93D0-4476-BDA4-94CF5F8D4814&displaylang=en
[2]: http://stackoverflow.com/questions/206943/what-features-would-you-most-like-to-see-in-visual-studio-2010 | 0 | [
2,
154,
5513,
29,
3458,
1120,
498,
272,
13726,
60,
800,
3726,
3726,
31,
114,
441,
14,
40,
11792,
1130,
26,
14,
636,
20893,
1120,
272,
13726,
500,
2558,
165,
500,
786,
15,
17,
589,
871,
1672,
26,
65,
273,
6488,
20,
7121,
9,
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... |
C# naming convention for constants?
===
private const int THE_ANSWER = 42;
or
private const int theAnswer = 42;
Personally I think with modern IDEs we should go with camelCase as ALL_CAPS smells "Hungarian". What do you think? | 0 | [
2,
272,
5910,
10929,
3087,
26,
3587,
18,
60,
800,
3726,
3726,
932,
11608,
38,
19,
38,
14,
1,
5950,
4662,
800,
4162,
73,
54,
932,
11608,
38,
19,
38,
14,
5950,
4662,
800,
4162,
73,
7200,
31,
277,
29,
773,
13,
8153,
95,
378,
162,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 script find out which directory the script file resides?
===
Basically I need to run the script with paths related to the shell script file location, how can I change the current directory to the same directory as where the script file resides? | 0 | [
2,
22540,
3593,
3884,
477,
70,
56,
16755,
14,
3884,
3893,
12631,
60,
800,
3726,
3726,
11374,
31,
376,
20,
485,
14,
3884,
29,
12074,
1597,
20,
14,
3593,
3884,
3893,
1474,
15,
184,
92,
31,
753,
14,
866,
16755,
20,
14,
205,
16755,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Pass values between Views (iPhone Development)
===
I have MainViewController calling WebViewController (From UICatalog sample application)
In WebViewController I make some function setValue(){...} to set some value passed as parameter to the variable(NSString *value) from WebViewController.h but when I try from MainViewController something like WebViewController targetViewController...
targetViewController.setValue(value), it says: "**error: request for member 'setValue' in something not s structure or union**"... | 0 | [
2,
1477,
4070,
128,
4146,
13,
5,
49,
7709,
522,
6,
800,
3726,
3726,
31,
57,
407,
4725,
12898,
1252,
2555,
2741,
4725,
12898,
1252,
13,
5,
2665,
13,
5661,
9709,
5567,
5717,
3010,
6,
19,
2741,
4725,
12898,
1252,
31,
233,
109,
1990,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to switch application configuration file at runtime for .NET application?
===
By default, .NET application's configuration file is named after "exe file name".config. I'm wondering whether it is possible to have one application's configuration specified dynamically.
For example, the built application is "foo.exe". At runtime, the config file is "foo.exe.config". Is it possible to have it accept command line arguments to use other config file. So, the application can use other configuration like below.
>foo.exe /config:bar.config
bar.config is used as config file insteand of foo.exe.config. | 0 | [
2,
25,
32,
938,
20,
5521,
3010,
8091,
3893,
35,
485,
891,
26,
13,
9,
2328,
3010,
60,
800,
3726,
3726,
34,
12838,
15,
13,
9,
2328,
3010,
22,
18,
8091,
3893,
25,
377,
75,
13,
7,
1706,
62,
3893,
204,
7,
9,
14093,
2816,
9,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.NET Interop: Using an assembly in the current directory
===
I'm trying to use a .NET assembly from VB6 via interop without placing it in the GAC and without using the /codebase argument for regasm.exe.
From what I understand, when I run regasm.exe on a .NET class library, it creates a registry entry for each class in the class library telling the COM clients they should load mscoree.dll that serves as a proxy wrapping .NET objects for COM use. Mscoree.dll uses the InprocServer32/Assembly key in the registry for the class to determine which class library contains the implementation of the class.
If I use /codebase with regasm.exe or put my class library in the GAC, everything works OK; but as far as I can figure out from the scattered documentation, mscoree.dll should look for the assembly in the current directory and in the path if /codebase hasn't been used (and therefore there is no CodeBase entry in the registry for the class) and it can't find it in the GAC.
The C# code is as simple as can be:
using System;
using System.Collections.Generic;
using System.Text;
using System.Runtime.InteropServices;
namespace myinterop
{
[Guid("B1D6B9FE-A4C7-11DD-B06B-E93056D89593")]
[ClassInterface(ClassInterfaceType.AutoDual)]
[ComVisible(true)]
public class MyServer
{
public int Add(int a, int b)
{
return a + b;
}
}
}
And the problem reproduces with a VBScript one liner that I put in the same directory as the compiled DLL:
object = CreateObject("myinterop.MyServer")
What am I missing here? Is there a definitive description of the way mscoree.dll looks up the assemblies somewhere?
BTW, I'm using .NET 2.0 and yes, I know I should put my assemblies in the GAC, I'm just wondering why this doesn't work as advertised. | 0 | [
2,
13,
9,
2328,
1480,
2594,
45,
568,
40,
1475,
19,
14,
866,
16755,
800,
3726,
3726,
31,
22,
79,
749,
20,
275,
21,
13,
9,
2328,
1475,
37,
13,
20468,
379,
1197,
1480,
2594,
366,
5861,
32,
19,
14,
4369,
150,
17,
366,
568,
14,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
c# - What is string really good for?
===
I've tried reading a JPG file using the StreamReader class' ReadToEnd() method which returns a string.
For some reason though, when I write this string out to a file, it doesn't open.
Is something lost when reading data into a string? What is it really good for?
If I use a byte array and read into that then its fine. | 0 | [
2,
272,
5910,
13,
8,
98,
25,
3724,
510,
254,
26,
60,
800,
3726,
3726,
31,
22,
195,
794,
1876,
21,
487,
9623,
3893,
568,
14,
3766,
10647,
106,
718,
22,
1302,
262,
2451,
5,
6,
2109,
56,
4815,
21,
3724,
9,
26,
109,
1215,
362,
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... |
Limit for URL length for "rundll32 url.dll,FileProtocolHandler"?
===
I have a long URL with tons of parameters that I want to open in the default browser from Java on a Windows system using
Runtime.getRuntime().exec("rundll32 url.dll,FileProtocolHandler "+url)
For short URLs like "http://www.google.com" this works fine. But for long URLs (say, 2000 characters), this simply does absolutely nothing at all: no exception or anything of the sort, it is simply ignored.
Is there a limit a) for a Runtime.exec command or b) for the rundll32 url.dll command? If so, what is the limit? | 0 | [
2,
4496,
26,
287,
6362,
1476,
26,
13,
7,
3169,
43,
211,
3125,
287,
6362,
9,
43,
211,
15,
16877,
2740,
262,
7771,
3203,
1252,
7,
60,
800,
3726,
3726,
31,
57,
21,
175,
287,
6362,
29,
5278,
16,
12905,
30,
31,
259,
20,
368,
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... |
Algorithm: Voyage planning
===
I need to plan a voyage connecting n locations in the sea with a specified origin and specified destination with following constraints.<br />
The voyage has to touch all locations.<br />
If there is a reservation from A to B then a has to be touched before B <br />
The time spend at each location varies (depends upon the reservations to that location)<br />
Each location has a working window. If the vessel reaches before working window it has to wait.<br />
Note: "Minimum spanning tree" algorithms may not be as the time required at each port depends on the previous route (due to working window)<br />
Is there any algorithm available for this?
| 0 | [
2,
9083,
45,
7039,
2334,
800,
3726,
3726,
31,
376,
20,
944,
21,
7039,
6440,
13,
103,
4095,
19,
14,
598,
29,
21,
9931,
2986,
17,
9931,
6970,
29,
249,
16747,
9,
1,
5145,
13,
118,
1,
14,
7039,
63,
20,
1723,
65,
4095,
9,
1,
5145... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Will you use Delphi Prism
===
CodeGear announces that their Next .Net product which is known as **Delphi Prism** Will be the **RemObjects's Oxygene**.
Oxygene has many nice features that not found in Delphi or C#, and I think it will more effective solution for .Net than Delphi .Net previous releases, but it's uses Visual Studio IDE instead of Delphi IDE. which is has some cons and pros.
As Delphi Developer or .net Developer, do you consider to use Delphi Prism for .Net developmenet?
Look at these Links for more info.
[Delphi Prism vs. CSharp][1]
[Delphi Prism - Visual Studio Pascal For .NET][2]
[Delphi Prims home page][3]
[1]: http://prismwiki.codegear.com/wiki/Delphi_Prism_vs._CSharp
[2]: http://www.bitwisemag.com/2/Delphi-Prism-Visual-Studio-Pascal
[3]: http://www.codegear.com/products/delphi/prism | 0 | [
2,
129,
42,
275,
23030,
21985,
800,
3726,
3726,
1797,
834,
512,
20813,
30,
66,
328,
13,
9,
2328,
2374,
56,
25,
167,
28,
13,
1409,
3436,
7805,
21985,
1409,
129,
44,
14,
13,
1409,
99,
79,
23793,
18,
22,
18,
6838,
62,
1409,
9,
68... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Exception handling architecture
===
Does anybody have best practices for exception handling ?
When searching the web I find a lot of best practices on a code level (don't catch general exceptions, don't rethrow new exceptions etc.) What I am looking for is best practises on a higher level, stuff like :
- within an application catch exceptions on the ui level.
- log as much detail as possible, show friendly error messages
- in more SOA like apps distinguish between functional exceptions (You ask for a specific customer and expect to find one , but find none) and technical exceptions (database offline)
- don't use exceptions for functional exceptions
- distinguish between fatal and none fatal exceptions
- distinguish between exceptions that make a retry possible or make retrying totally useless
- patterns for alerting the maintenance people
Any thoughts and help are greatly appreciated, thanks.
| 0 | [
2,
5391,
7988,
2607,
800,
3726,
3726,
630,
11181,
57,
246,
5242,
26,
5391,
7988,
13,
60,
76,
5792,
14,
2741,
31,
477,
21,
865,
16,
246,
5242,
27,
21,
1797,
662,
13,
5,
804,
22,
38,
2949,
297,
13392,
15,
221,
22,
38,
302,
21440... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Draw Rubber band rectangle in DirectX?
===
How can I draw a 2D rubber band rectangle in DirectX? Preferable using C#. | 0 | [
2,
184,
107,
2003,
8457,
323,
27181,
19,
1744,
396,
60,
800,
3726,
3726,
184,
92,
31,
2003,
21,
172,
43,
8457,
323,
27181,
19,
1744,
396,
60,
6369,
579,
568,
272,
5910,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Display Ajax Loader while page rendering
===
This is probably a simple question but how can I best use an ajax Loader in ASP.NET to provide a loading dialog whilst the page is being built.
I currently have a UpdatePanel with an associated UpdateProgressPanel which contins the loading message and gif in a ProgressTemplate.
Currently I have a page that onLoad() goes and gets the business entities and then displays them. While it is doing this I would like to display an Ajax Loader.
Would it be better to having nothing in the page load and have a hidden button that is triggered onLoadComplete or unLoad() which would then wait for the button click methopd to complete displaying the UpdateProgressPanel?
Thanks | 0 | [
2,
3042,
20624,
6305,
106,
133,
2478,
15307,
800,
3726,
3726,
48,
25,
910,
21,
1935,
1301,
47,
184,
92,
31,
246,
275,
40,
20624,
6305,
106,
19,
28,
306,
9,
2328,
20,
1181,
21,
12797,
28223,
4575,
14,
2478,
25,
142,
392,
9,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I make a POST request with open-uri?
===
Is it possible to make a POST request from Ruby with open-uri? | 0 | [
2,
184,
107,
31,
233,
21,
678,
3772,
29,
368,
8,
3594,
60,
800,
3726,
3726,
25,
32,
938,
20,
233,
21,
678,
3772,
37,
10811,
29,
368,
8,
3594,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
My ideal CMS. Does it exist, or isn't it a "CMS" anymore?
===
As a webdeveloper I have built several small and large websites with different teams, but always had to deliver a CMS to maintain content. In my experience with different CMSes, I have found them to pretty much always leave a footprint on the website, like offering page templates that are required to build the website with.
So, I thought I'd just post my personal CMS ideas and wishes here to see how fellow developers feel about it. I am not even sure it is still a CMS I am looking for, so I am really looking forward to your feedback.
What MyCMS should be:
1. A definition first; The C in CMS stands for "content". As such, it should manage the domain objects that are presented in the website. Objects such as a company, book or user, and the relationships, business rules and little workflow that apply. Nothing more (Joomla, Drupal), nothing less (MySql browser ;-). Names used for illustration purpose only, no offence intended.
2. MyCMS should not influence the website's visual presentation or offer means to maintain those. Sure, pictures and richtext can be altered, but those are still content (visual content and semantics). No page templates or the likes (I have been forced to use them in the past).
3. MyCMS should not influence my website architecture. I want to be in control of html, css and javascript, but also use my preferred MVC framework with proven service layer, DAOs and data persistence in place. A CMS should not influence that (and yes, it has done so in the past).
4. MyCMS should provide an API for login and CRUD manipulation down to individual property level. I should be able to implement my own ajax pattern for use on the website if I wish to do so, which uses solely the provided API to show an in-place wysiwyg editing field, edit a book's title, press save and store my changes. API wise. Purely my wish, W?BIC.
5. MyCMS should of course provide a descent API for retrieving contents in many ways. This should be the only way for placing contents in my site. My site could be .net where the CMS could be php. Which makes wish 4 harder to implement, but still, with the right API's and optional wrappers around components, it can be done.
6. The CMS GUI should be a GUI layer based on a modular setup that in theory can have a command line alternative as well. The command line might not be feasible, but a setup without a GUI in mind makes functionality come first. Modular so I can built new functionality or download existing addons from a community.
7. Preferrably open source, well documented and with a community in place. Not a requirement, but it would be swell.
I can come up with more wishes, but in origin they are probably one of the above anyway. So, I just post my ideas of my ideal CMS here, and probably miss out on some things.
Any comments, suggestions or other feedback on the above is really appreciated. I just like to know how you feel about it all, and if perhaps you have worked with a CMS or other tool that provided some or most of my wishes.
Any feedback is really appreciated. Thanks in advance. | 0 | [
2,
51,
5628,
2390,
18,
9,
630,
32,
3182,
15,
54,
2532,
22,
38,
32,
21,
13,
7,
9095,
18,
7,
3375,
60,
800,
3726,
3726,
28,
21,
2741,
26051,
106,
31,
57,
392,
238,
284,
17,
370,
13931,
29,
421,
952,
15,
47,
550,
41,
20,
5879... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Disable browsers vertical and horizontal SCrollbars
===
Is it possible to disable the browsers vertical and horizontal scrollbars using jQuery or javascript? | 0 | [
2,
1460,
579,
16495,
18,
7035,
17,
10095,
12159,
1850,
18,
800,
3726,
3726,
25,
32,
938,
20,
1460,
579,
14,
16495,
18,
7035,
17,
10095,
12159,
1850,
18,
568,
487,
8190,
93,
54,
8247,
8741,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Capture Window (Alt-Print Screen) of Context Menu
===
As everyone knows, sometimes developers have to document stuff. Or capture some stuff for filing bug reports.
My question is in MS Windows.
I'm trying to capture the context menu (right-click on an item) of several areas of an application. Pressing Alt to start the alt-printscreen process closes the context menu.
(Only pressing Printscreen helps, but it's painful to remove the non-window areas everytime).
BONUS: For capturing menus, Alt also closes the menu. However, if you use the alt button to open the meny in the first place, it works:
1. press Alt-F (for opening the "File"
menu), don't release alt press
2. printscreen
3. tada!
| 0 | [
2,
3683,
1463,
13,
5,
192,
38,
8,
10299,
2324,
6,
16,
4141,
11379,
800,
3726,
3726,
28,
1266,
3620,
15,
1030,
10168,
57,
20,
4492,
3217,
9,
54,
3683,
109,
3217,
26,
16923,
6256,
2813,
9,
51,
1301,
25,
19,
4235,
1936,
9,
31,
22... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I change the size of scroll box(thumb) of a CScrollBar?
===
I can't find any method to change it. Any help will be appreciated! | 0 | [
2,
184,
92,
31,
753,
14,
1072,
16,
12159,
1649,
5,
96,
723,
220,
6,
16,
21,
272,
3862,
8694,
1850,
60,
800,
3726,
3726,
31,
92,
22,
38,
477,
186,
2109,
20,
753,
32,
9,
186,
448,
129,
44,
13746,
187,
3,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
an ASP.NET performance bottleneck mystery
===
A classic ASP.NET app - AppSrv + MS SQL DB. Both servers are heavy-lifters 8 cores, 20 GB of RAM. When load testing, the throughput goes somewhere to 400 VirtualUsers (according to LoadRunner) with CPU being approximately 30% utilized an DB server primarily idling - response times go dramatically up, to the point of unresponsive.
The usual suspects, such as Max Pool being exhausted and conn limit on ASP.NET set are not at fault: Max Pool is set to 200 and about 80 conns are used; conn limit is set to 0.
I ran with ANTS profiler the code and it showed that Thread blocking did not contribute significantly.
Ideas very very welcome!
| 0 | [
2,
40,
28,
306,
9,
2328,
956,
4040,
9870,
5586,
800,
3726,
3726,
21,
2732,
28,
306,
9,
2328,
4865,
13,
8,
4865,
18,
10359,
2754,
4235,
4444,
255,
13,
9007,
9,
156,
17595,
50,
1278,
8,
10805,
445,
469,
2884,
18,
15,
434,
14857,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 increase allowed stack size for a recursive ruby app. Stack level too deep (SystemStackError)
===
Posting a stack overflow question on stackoverflow.com, how amusing :-)
I'm running some recursive Ruby code and I get the: `"Stack level too deep (SystemStackError)"`
(I'm quite sure the code works, that I'm not in an infinite recursive death spiral, but that is not the point anyway)
Is there anyway to change the allowed stack depth/size for my Ruby app?
I don't quite get it if this is a restriction in Ruby, since the error says "Stack level", which gives me the impression that Ruby somehow counts 'levels' of stack, or if it simply means that the stack is full.
I have tried running this program under both Vista and Ubuntu with same result.
Under Ubuntu i tried changing the stack size with 'ulimit -s' from 8192 to 16000, but that didn't change anything.
| 0 | [
2,
184,
20,
1839,
1159,
7566,
1072,
26,
21,
302,
24244,
10811,
4865,
9,
7566,
662,
266,
855,
13,
5,
10724,
25325,
29992,
6,
800,
3726,
3726,
15669,
21,
7566,
20285,
1301,
27,
7566,
2549,
9990,
9,
960,
15,
184,
21831,
13,
45,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
LDAP query not working
===
I'm having trouble running a complex query against our company LDAP-Server. I'm using the following Perl-Script:
use Data::Dumper;
use Net::LDAP;
die "Can't connect to LDAP-Server: $@\n"
unless $ldap = Net::LDAP->new( 'xLDAPx' );
foreach my $filter ( 'ou=Personal', 'ou=BAR', 'ou=Personal,ou=BAR', 'ou=Personal,ou=FOO,o=FOO,dc=foo,dc=com' )
{
$mesg = $ldap->search( base => "o=FOO,dc=foo,dc=com", filter => $filter );
print Dumper($mesg), "\n\n";
}
While the first two filters work (as in returning the expected values) the last and complex one doesn't. It returns an empty Array. What really puzzles me is that exactly the same query-string works when I use it with a Tool like the Softerra LDAP Browser.
I have also tried the same query using PHP's ldap_search & co, no avail.
Can somebody shed some light on this?
Thanks for reading
holli | 0 | [
2,
644,
20472,
25597,
52,
638,
800,
3726,
3726,
31,
22,
79,
452,
2572,
946,
21,
1502,
25597,
149,
318,
237,
644,
20472,
8,
10321,
106,
9,
31,
22,
79,
568,
14,
249,
416,
255,
8,
8741,
45,
275,
1054,
45,
45,
12617,
1432,
73,
275... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 reset Performance objects in perfmon?
===
When I launch perfmon and try to add a counter, the displayed performance objects are all numbers. How can I reset these Performance objects?
| 0 | [
2,
184,
20,
23422,
956,
3916,
19,
416,
410,
2111,
60,
800,
3726,
3726,
76,
31,
3394,
416,
410,
2111,
17,
1131,
20,
3547,
21,
2105,
15,
14,
6115,
956,
3916,
50,
65,
2116,
9,
184,
92,
31,
23422,
158,
956,
3916,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Why does Date.parse not return a Date object?
===
today1 = new Date();
today2 = Date.parse("2008-28-10");
To compare the time (millisecond) values of these I have to do the following, because today2 is just a number.
if (today1.getTime() == today2)
Why is this?
| 0 | [
2,
483,
630,
1231,
9,
3574,
870,
52,
788,
21,
1231,
3095,
60,
800,
3726,
3726,
786,
165,
800,
78,
1231,
5,
6,
73,
786,
135,
800,
1231,
9,
3574,
870,
5,
7,
2753,
8,
2714,
8,
1036,
7,
6,
73,
20,
11590,
14,
85,
13,
5,
8702,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Table NewRow() Causes Memory Leak
===
Whilst investigating a memory leak I discovered that it was caused by calling NewRow() on a Table inside a loop many times. However the DataRow created was never added to the Table Rows collection and the Table Rows Count never got above zero.
My question is why does this use up more memory every time NewRow is called even though the newly created DataRow never gets added to the Rows collection and the DataRow returned from NewRow is always assigned to the same local variable (thereby apparently discarding the last new row).
Please ignore the issue of why the code is creating DataRows that don't get added to the table! | 0 | [
2,
859,
78,
5417,
5,
6,
4047,
1912,
11724,
800,
3726,
3726,
4575,
12490,
21,
1912,
11724,
31,
1848,
30,
32,
23,
1497,
34,
2555,
78,
5417,
5,
6,
27,
21,
859,
572,
21,
5293,
151,
436,
9,
207,
14,
1054,
5417,
679,
23,
243,
905,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to build an email reader for the Zune ?
===
Is it possible to build an email reader for the Zune through XNA ? | 0 | [
2,
25,
32,
938,
20,
1895,
40,
8517,
7765,
26,
14,
6308,
556,
13,
60,
800,
3726,
3726,
25,
32,
938,
20,
1895,
40,
8517,
7765,
26,
14,
6308,
556,
120,
993,
325,
13,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Rails meta plugin install script?
===
I wanna see if there is an approach to pack a few plugins together as a meta plugin that install everything together automatically, works like a project template.
Why not a script? Because I want to put it in github so I don't have to worry about it when I am not with my own PC :) but of coz a script based solution is welcomed too. | 0 | [
2,
2240,
18,
7618,
10922,
108,
16146,
3884,
60,
800,
3726,
3726,
31,
11024,
196,
100,
80,
25,
40,
2141,
20,
3607,
21,
310,
10922,
108,
18,
429,
28,
21,
7618,
10922,
108,
30,
16146,
796,
429,
7499,
15,
693,
101,
21,
669,
22894,
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... |
Applications of Factorisations
===
**EDIT:**
***Please comment if you down mod this Question as to why.***
***Factorisation is a key Mathematical problem.***
***I would like to demonstrate applications for the results of factorisatons.***
<br>
___
<br>
*Omitting details of methods to calculate primes, and methods of factorisation.*
##Why bother to factorise ?
##What are its applications ?
<br>
<br>
###An Application of Prime Factors :
<br>
> **The Divisors of a Target Number can be derived from its Prime Factors :**
>
> List all the Prime Factor's Powers
> Add 1 each item in this List
> Multiply all the items in this List
// TARGET_NUMBER and its Factorisation
TARGET_NUMBER = 67895 = 5^ 1 * 37^ 1 * 367^ 1
+ + +
1 1 1
= = =
// Divisors of the TARGET_NUMBER
divisors( TARGET_NUMBER ) = 8 = 2 * 2 * 2
| 0 | [
2,
3767,
16,
3932,
4330,
18,
800,
3726,
3726,
13,
1409,
69,
242,
45,
1409,
8980,
6744,
6484,
100,
42,
125,
7226,
48,
1301,
28,
20,
483,
9,
2483,
1409,
8980,
17455,
4330,
25,
21,
1246,
7046,
1448,
9,
2483,
1409,
8980,
49,
83,
101... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
use vimdiff with a diff file
===
How can I use vimdiff to view the differences described in a diff file? | 0 | [
2,
275,
1790,
79,
43,
6021,
29,
21,
20811,
3893,
800,
3726,
3726,
184,
92,
31,
275,
1790,
79,
43,
6021,
20,
1418,
14,
4921,
745,
19,
21,
20811,
3893,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Accessing control, ajax, asp.net
===
I have one aspx page with some controls.
Also i have one DIV which is dynamically populated from AJAX call.
This AJAX call return couple of controls, for example HtmlInputText1 and HtmlInputText2.
When page is submitted, I can get values from this controls through Request.Form.
If possible access to the attributes of this control on pege code behind (for example HtmlInputText1.Height, etc).
I think that is impossible, but I am not sure.
I can use hidden field. Is any other way? | 0 | [
2,
1381,
68,
569,
15,
20624,
15,
28,
306,
9,
2328,
800,
3726,
3726,
31,
57,
53,
28,
306,
396,
2478,
29,
109,
8671,
9,
67,
31,
57,
53,
13,
12916,
56,
25,
7782,
1326,
11111,
37,
20624,
645,
9,
48,
20624,
645,
788,
1335,
16,
86... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the most secure hashing algorithm in the .NET framework?
===
The size of the generated hash and the speed of the algorithm are not important. I'm really only interested in it being the most secure option. I don't want to use any third party libraries either.
The version of the .NET framework I'm using if 3.5 if that makes any difference. | 0 | [
2,
98,
25,
14,
127,
4315,
19170,
68,
9083,
19,
14,
13,
9,
2328,
6596,
60,
800,
3726,
3726,
14,
1072,
16,
14,
6756,
19170,
17,
14,
1362,
16,
14,
9083,
50,
52,
681,
9,
31,
22,
79,
510,
104,
3158,
19,
32,
142,
14,
127,
4315,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is mutation testing useful in practice?
===
It exists the technology of [mutation testing][1]. It checks, if the tests are running even if you change the code. If not all is OK, if the tests are running they don't cover all eventualities. There is some theoretical work about it, but I'm interested in the question, if it is useful in practice? Do you have any examples of real life applications of mutation testing? Does it work better than simple test-coverage-tools? Or is it useless?
What are the advantages/disadvantages of mutation testing in the real world?
[1]: http://en.wikipedia.org/wiki/Mutation_testing | 0 | [
2,
25,
18188,
4431,
4811,
19,
1345,
60,
800,
3726,
3726,
32,
5636,
14,
1099,
16,
636,
7903,
857,
4431,
500,
2558,
165,
500,
9,
32,
16602,
15,
100,
14,
4894,
50,
946,
166,
100,
42,
753,
14,
1797,
9,
100,
52,
65,
25,
5854,
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... |
Understanding engine initialization in OpenSSL
===
I'm trying to set up a basic test of HMAC-SHA-256 hashing but I'm having problems with the engine setup. Ideally I would like to set up only the HMAC-SHA-algorithm but so far I haven't even gotten the general case where load all the algorithms to work. Currently I'm getting segfaults on the row where I try to set the default digests.
Also, I'm regularly a Java guy, so don't hesitate to point out any mistakes in the code.
#include <openssl/hmac.h>
#include <openssl/evp.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main() {
unsigned char* key = (unsigned char*) "0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b";
unsigned char* data = (unsigned char*) "4869205468657265";
unsigned char* expected = (unsigned char*) "b0344c61d8db38535ca8afceaf0bf12b881dc200c9833da726e9376c2e32cff7";
unsigned char* result;
HMAC_CTX* ctx;
ENGINE* e;
ENGINE_load_builtin_engines();
ENGINE_register_all_complete();
ENGINE_set_default_digests(e);
HMAC_CTX_init(ctx);
HMAC_Init_ex(ctx, key, 40, EVP_sha256(), e);
result = HMAC(NULL, NULL, 40, data, 16, NULL, NULL);
HMAC_CTX_cleanup(ctx);
ENGINE_finish(e);
ENGINE_free(e);
if (strcmp((char*) result, (char*) expected) == 0) {
printf("Test ok\n");
} else {
printf("Got %s instead of %s\n", result, expected);
}
} | 0 | [
2,
3260,
1406,
2104,
1829,
19,
8965,
18,
255,
800,
3726,
3726,
31,
22,
79,
749,
20,
309,
71,
21,
2125,
1289,
16,
746,
6893,
8,
3162,
8,
16910,
19170,
68,
47,
31,
22,
79,
452,
1716,
29,
14,
1406,
18161,
9,
5628,
102,
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... |
SharePoint SSO with a PHP application on a different server?
===
I need to implement a SSO between a SharePoint site and a custom PHP-based site wich reside on a different domain. I need to use the SharePoint user accounts to log in the PHP site. (I'll have a full controll over the PHP source)
Is this possible? Any tips and tricks? | 0 | [
2,
1891,
3132,
13,
18,
656,
29,
21,
13,
26120,
3010,
27,
21,
421,
8128,
60,
800,
3726,
3726,
31,
376,
20,
8713,
21,
13,
18,
656,
128,
21,
1891,
3132,
689,
17,
21,
5816,
13,
26120,
8,
1281,
689,
13,
13583,
14670,
27,
21,
421,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Strange javascript error in ASP.NET TreeView control
===
I’m using Treeview Control (ASP.NET 2.0) in a web control. The funny thing is, that everything is working fine : expanding, collapse, selecting a node etc. ,but after every click firebug shows an error : TreeView_SelectNode is not defined [Break on this error] HelpFile.aspx (line 1)<br /><br />
The error comes up every time I'm selecting a node. I've been going through System.Web.UI.WebControls assembly and found two places, where TreeView_SelectNode is beeing used.<br />
if ((((this._owner.Page != null) && this._owner.Page.SupportsStyleSheets) && (this.SelectAction == TreeNodeSelectAction.Select)) || (this.SelectAction == TreeNodeSelectAction.SelectExpand))
{
firstScript = Util.MergeScript(firstScript, "TreeView_SelectNode(" + this._owner.ClientDataObjectID + ", this,'" + this.SelectID + "');");
}
and
if (this._owner.RenderClientScript)
{
list.Add("onclick");
list.Add("TreeView_SelectNode(" + this._owner.ClientDataObjectID + ", this,'" + this.SelectID + "');");
}
Anybody has a clue, or ideas what else to do, and where else to look ? | 0 | [
2,
2578,
8247,
8741,
7019,
19,
28,
306,
9,
2328,
1541,
4725,
569,
800,
3726,
3726,
31,
1,
79,
568,
1541,
4725,
569,
13,
5,
472,
306,
9,
2328,
172,
9,
387,
6,
19,
21,
2741,
569,
9,
14,
5066,
584,
25,
15,
30,
796,
25,
638,
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... |
Long strings
===
Hey! I have seen c# code that uses the @ to tell the compiler the string has newlines in it and that it should be all in one line.
Is there something like that for c/c++?
Like if I want to put something like:
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450
In a string I don't want to place it all in one line but just put it like that and have the compiler know that that is only one line. | 0 | [
2,
175,
7887,
800,
3726,
3726,
8409,
187,
31,
57,
541,
272,
5910,
1797,
30,
2027,
14,
13,
1,
20,
494,
14,
21486,
14,
3724,
63,
78,
7939,
19,
32,
17,
30,
32,
378,
44,
65,
19,
53,
293,
9,
25,
80,
301,
101,
30,
26,
272,
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... |
do stdout output with specific speed
===
For a load test of my application (under Linux), I'm looking for a tool that outputs data on stdout at a specific rate (like 100 bytes/s), so that I can pipe the output to netcat which sends it to my application. Some option for dd would be ideal, but I didn't find anything so far. It doesn't really matter what kind of data is printed (NUL bytes are OK). Any hints?
| 0 | [
2,
107,
354,
43,
1320,
5196,
29,
1903,
1362,
800,
3726,
3726,
26,
21,
6305,
1289,
16,
51,
3010,
13,
5,
4579,
13024,
6,
15,
31,
22,
79,
699,
26,
21,
5607,
30,
5196,
18,
1054,
27,
354,
43,
1320,
35,
21,
1903,
1684,
13,
5,
1403... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 to match all words except a given list
===
I am trying to write a replacement regular expression to surround all words in quotes except the words AND, OR and NOT.
I have tried the following for the match part of the expression:
(?i)(?<word>[a-z0-9]+)(?<!and|not|or)
and
(?i)(?<word>[a-z0-9]+)(?!and|not|or)
but neither work. The replacement expression is simply and currently surrounds all words.
"${word}"
| 0 | [
2,
7953,
1706,
20,
730,
65,
715,
1613,
21,
504,
968,
800,
3726,
3726,
31,
589,
749,
20,
2757,
21,
4610,
1290,
1803,
20,
12215,
65,
715,
19,
18901,
1613,
14,
715,
17,
15,
54,
17,
52,
9,
31,
57,
794,
14,
249,
26,
14,
730,
141,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 is SQL statement is faster?
===
Which is SQL statement is faster?
SELECT TOP 2 c1.Price, c2.Price, ..... c49.Price, c50.Price
FROM Table1 AS c1, Table2 AS c2, ..... Table49 AS c49, Table50 AS c50
WHERE c1.Date = c2.Date AND c2.Date = c3.Date ..... c49.Date = c50.Date
ORDER BY c1.ID DESC
OR
SELECT TOP 2 c1.Price, c2.Price, ..... c49.Price, c50.Price
FROM (Table1 AS c1
INNER JOIN (Table2 AS c2
........
INNER JOIN (Table49 AS c49
INNER JOIN Table50 AS c50
ON c49.Date = c50.Date)
........
ON c2.FullDate__ = c3.FullDate__)
ON c1.FullDate__ = c2.FullDate__)
ORDER BY c1.ID DESC";
Basically I need to extract 2 rows from each table to produce a summary periodically.
Which statement is faster? | 0 | [
2,
56,
25,
4444,
255,
3331,
25,
4233,
60,
800,
3726,
3726,
56,
25,
4444,
255,
3331,
25,
4233,
60,
5407,
371,
172,
272,
165,
9,
24137,
15,
272,
135,
9,
24137,
15,
13,
9,
9,
9,
9,
9,
272,
3624,
9,
24137,
15,
272,
2290,
9,
24... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.