unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Joson string to list or other usable format in asp.net 2.0
===
I have one JSON that is coming in a string format. I need to store it in a key pair value or something like that. I am using asp.net 2.0 and can not use 3rd party DLL like Newtonsoft.Json.dll. I guess last option will be to use regular expression. Can anybody please help me in this? | 0 | [
2,
2640,
528,
3724,
20,
968,
54,
89,
182,
579,
2595,
19,
28,
306,
9,
2328,
172,
9,
387,
800,
3726,
3726,
31,
57,
53,
487,
528,
30,
25,
880,
19,
21,
3724,
2595,
9,
31,
376,
20,
1718,
32,
19,
21,
1246,
2146,
1923,
54,
301,
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... |
Can you use WMI to create an MSMQ message queue?
===
I need to create a PRIVATE message queue on a remote machine and I have resolved to fact that I can't do this with the .NET Framework in a straight forward manner. I can create a public message queue on a remote machine, but not a PRIVATE one. I can create a message queue (public or private) locally.
I am wondering if anyone knows how to access MSMQ through WMI | 0 | [
2,
92,
42,
275,
619,
1435,
20,
1600,
40,
4235,
79,
1251,
2802,
22521,
60,
800,
3726,
3726,
31,
376,
20,
1600,
21,
932,
2802,
22521,
27,
21,
5388,
1940,
17,
31,
57,
11052,
20,
837,
30,
31,
92,
22,
38,
107,
48,
29,
14,
13,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I get Datetime to display in military time in oracle?
===
I am running some queries to track down a problem with our backup logs and would like to display datetime fields in 24-hour military time. Is there a simple way to do this? I've tried googling and could find nothing. | 0 | [
2,
184,
92,
31,
164,
1231,
891,
20,
3042,
19,
611,
85,
19,
15759,
60,
800,
3726,
3726,
31,
589,
946,
109,
9386,
2829,
20,
792,
125,
21,
1448,
29,
318,
10119,
18893,
17,
83,
101,
20,
3042,
1231,
891,
2861,
19,
937,
8,
4754,
611... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 anyone using Google Chrome?
===
Is anyone writing applications specifically to take advantage of google chrome?
Are there any enterprise users who are considering using it as the standard browser?
| 0 | [
2,
25,
1276,
568,
8144,
13,
12985,
60,
800,
3726,
3726,
25,
1276,
1174,
3767,
3524,
20,
247,
3314,
16,
8144,
13,
12985,
60,
50,
80,
186,
6002,
3878,
72,
50,
5154,
568,
32,
28,
14,
1236,
16495,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What is a good CI build-process
===
What constitutes a good CI build-process?
We use CI, but is deployment to production even a realistic CI goal when you have dependencies on several services that should be deployed too and other apps may depend on these too.
Is a good good CI build process good enough when its automated to QA and manual from there? | 0 | [
2,
98,
25,
21,
254,
5486,
1895,
8,
16835,
800,
3726,
3726,
98,
20362,
21,
254,
5486,
1895,
8,
16835,
60,
95,
275,
5486,
15,
47,
25,
10475,
20,
637,
166,
21,
12786,
5486,
1195,
76,
42,
57,
29411,
27,
238,
687,
30,
378,
44,
6698... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Caching Data Objects when using Repository/Service Pattern and MVC
===
I have an MVC-based site, which is using a Repository/Service pattern for data access.
The Services are written to be using in a majority of applications (console, winform, and web). Currently, the controllers communicate directly to the services. This has limited the ability to apply proper caching.
I see my options as the following:
- Write a wrapper for the web app, which implements the IWhatEverService which does caching.
- Apply caching in each controller by cache the ViewData for each Action.
- Don't worry about data caching and just implement OutputCaching for each Action.
I can see the pros and cons of each. What is/should the best practice be for caching with Repository/Service | 0 | [
2,
1658,
7192,
1054,
3916,
76,
568,
24869,
118,
11449,
3732,
17,
307,
8990,
800,
3726,
3726,
31,
57,
40,
307,
8990,
8,
1281,
689,
15,
56,
25,
568,
21,
24869,
118,
11449,
3732,
26,
1054,
1381,
9,
14,
687,
50,
642,
20,
44,
568,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 AJAX implemented, and how does it help web dev?
===
From http://en.wikipedia.org/wiki/AJAX, I get a fairly good grasp of what AJAX is. However, it looks like in order to learn it, I'd have to delve into multiple technologies at the same time to get any benefit out of it. So two questions:
- What are resources that can help me understand/use AJAX?
- What sort of website would benefit from AJAX? | 0 | [
2,
184,
25,
20624,
6807,
15,
17,
184,
630,
32,
448,
2741,
9664,
60,
800,
3726,
3726,
37,
7775,
6903,
219,
9,
17375,
26132,
9,
5583,
118,
17375,
118,
6881,
7522,
15,
31,
164,
21,
6647,
254,
10677,
16,
98,
20624,
25,
9,
207,
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... |
Generate a Sandcastle help file for a website without the "Xml Documentation File" option
===
I am trying to generate a Sandcastle help file for a website. In the properties window for project, there aren't any options for creating the XML Documentation File required for Sandcastle.
The Build tab in the property pages only contains options for: Start Action, Build Solution Action, and Accessibility validation. I don't have any options for Output, or XML documentation file, like my other projects have.
The website I'm working with does not have an actual .proj file, which could be the problem. If this is the problem, what is the best way of creating one for a project that is under source control and being worked on by many people with minimal disruption?
This is using Visual Studio 2005 professional. | 0 | [
2,
7920,
21,
1965,
16736,
448,
3893,
26,
21,
2271,
366,
14,
13,
7,
396,
8184,
13945,
3893,
7,
4255,
800,
3726,
3726,
31,
589,
749,
20,
7920,
21,
1965,
16736,
448,
3893,
26,
21,
2271,
9,
19,
14,
3704,
1463,
26,
669,
15,
80,
484... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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# VB.NET Conversion
===
Which tools do you use to convert between C# an VB.Net? | 0 | [
2,
272,
5910,
13,
20468,
9,
2328,
6263,
800,
3726,
3726,
56,
4672,
107,
42,
275,
20,
8406,
128,
272,
5910,
40,
13,
20468,
9,
2328,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
JSTL collection iteration
===
I have a java bean like this:
class Person {
int age;
String name;
}
I'd like to iterate over a collection of these beans in a JSP, showing each person in a HTML table row, and in the last row of the table I'd like to show the total of all the ages.
The code to generate the table rows will look something like this:
<c:forEach var="person" items="${personList}">
<tr><td>${person.name}<td><td>${person.age}</td></tr>
</c:forEach>
However, I'm struggling to find a way to calculate the age total that will be shown in the final row **without resorting to scriptlet code**, any suggestions?
Cheers,
Don | 0 | [
2,
487,
18,
7786,
1206,
23534,
800,
3726,
3726,
31,
57,
21,
8247,
15322,
101,
48,
45,
718,
840,
13,
1,
19,
38,
348,
73,
3724,
204,
73,
13,
1,
31,
22,
43,
101,
20,
32,
106,
1373,
84,
21,
1206,
16,
158,
14685,
19,
21,
487,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is IIS7 migration a piece of cake
===
I wish to migrate a website to windows 2008 platform, is there any obvious pitfalls i should be aware of?
code base is c# 3.5,asp.net with ms ajax. | 0 | [
2,
25,
595,
18,
465,
8443,
21,
1855,
16,
8390,
800,
3726,
3726,
31,
2536,
20,
22985,
21,
2271,
20,
1936,
570,
2452,
15,
25,
80,
186,
4674,
4175,
5660,
18,
31,
378,
44,
3854,
16,
60,
1797,
1000,
25,
272,
5910,
203,
9,
264,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Should I store a database ID field in ViewState?
===
I need to retrieve a record from a database, display it on a web page (I'm using ASP.NET) but store the ID (primary key) from that record somewhere so I can go back to the database later with that ID (perhaps to do an update).
I know there are probably a few ways to do this, such as storing the ID in ViewState or a hidden field, but what is the best method and what are the reasons I might choose this method over any others? | 0 | [
2,
378,
31,
1718,
21,
6018,
4924,
575,
19,
1418,
3859,
60,
800,
3726,
3726,
31,
376,
20,
11917,
21,
571,
37,
21,
6018,
15,
3042,
32,
27,
21,
2741,
2478,
13,
5,
49,
22,
79,
568,
28,
306,
9,
2328,
6,
47,
1718,
14,
4924,
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... |
SQL Question - Possibly Cursor/Join related?
===
Here is my situation:
Table one contains a set of data that uses an id for an unique identifier. This table has a one to many relationship with about 6 other tables such that.
Given Table 1 with Id of 001:
Table 2 might have 3 rows with foreign key: 001
Table 3 might have 12 rows with foreign key: 001
Table 4 might have 0 rows with foreign key: 001
Table 5 might have 28 rows with foreign key: 001
I need to write a report that lists all of the rows from Table 1 for a specified time frame followed by all of the data contained in the handful of tables that reference it.
My current approach in pseudo code would look like this:
select * from table 1
foreach(result) {
print result;
select * from table 2 where id = result.id;
foreach(result2) {
print result2;
}
select * from table 3 where id = result.id
foreach(result3) {
print result3;
}
//continued for each table
}
This means that the single report can run in the neighbor hood of 1000 queries. I know this is excessive however my sql-fu is a little weak and I could use some help.
| 0 | [
2,
4444,
255,
1301,
13,
8,
2879,
29588,
118,
1636,
108,
1597,
60,
800,
3726,
3726,
235,
25,
51,
1858,
45,
859,
53,
1588,
21,
309,
16,
1054,
30,
2027,
40,
4924,
26,
40,
2619,
25570,
9,
48,
859,
63,
21,
53,
20,
151,
1429,
29,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the easiest way to convert latitude and longitude to double values
===
I've got a CSV file containing latitude and longitude values, such as:
> "25°36'55.57""E","45°39'12.52""N"
Anyone have a quick and simple piece of C# code to convert this to double values?
Thanks
| 0 | [
2,
98,
22,
18,
14,
27237,
161,
20,
8406,
16337,
17,
22291,
20,
1494,
4070,
800,
3726,
3726,
31,
22,
195,
330,
21,
272,
18,
710,
3893,
3503,
16337,
17,
22291,
4070,
15,
145,
28,
45,
13,
1,
13,
7,
1811,
1,
3775,
22,
4083,
9,
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... |
Broken pipe no longer ends programs ?
===
When you pipe two process and kill the one at the "output" of the pipe, the first process used to receive the "Broken Pipe" signal, which usually terminated it aswell. E.g. running
$> do_something_intensive | less
and then exiting *less* used to return you immediately to a responsive shell, on a SuSE8 or former releases.
when i'm trying that today, *do_something_intensive* is obviously still running until i kill it manually. It seems that something has changed (glib ? shell ?) that makes program ignore "broken pipes" ...
Anyone of you has hints on this ? how to restore the former behaviour ? why it has been changed (or why it always existed multiple semantics) ? | 0 | [
2,
2023,
7642,
90,
1045,
3451,
1726,
13,
60,
800,
3726,
3726,
76,
42,
7642,
81,
953,
17,
1177,
14,
53,
35,
14,
13,
7,
1320,
4881,
7,
16,
14,
7642,
15,
14,
64,
953,
147,
20,
2588,
14,
13,
7,
27660,
7642,
7,
2800,
15,
56,
95... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Doing the best internet searches: Tips and Tricks.
===
Someone asked a question, what was the most important bookmark for a Developer, and it got me thinking. I personally answered Google of course. I have felt for the longest time that Google is the most indispensible tool for the developer as you can literally find anything you need by using well formed searches. Which brings me to my question:
I would like to get some feedback from everyone on what tips and tricks they use for getting the best possible search results. This is not limited to just google searches. (inlcude links to any other recommended search engines/sites).
I think one of the biggest issues with a lot of people in the IT world is they dont know how to properly utilize search engines and the vast wealth of knowledge on the internet. Lets hear your feedback. I hope to learn a few tricks from you all as well. | 0 | [
2,
845,
14,
246,
2620,
19994,
45,
11034,
17,
13747,
9,
800,
3726,
3726,
737,
411,
21,
1301,
15,
98,
23,
14,
127,
681,
360,
4527,
26,
21,
10058,
15,
17,
32,
330,
55,
1440,
9,
31,
7200,
3094,
8144,
16,
674,
9,
31,
57,
427,
26,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does anyone using Msmqdistributor service of Enterprise Library?
===
We are using EntLib Logging Application Block. And also it turned out that we should use msmq for ligging because of performance.
Now we are trying to use Msmqdistributor service to log those messages in the queue.
What are pros and cons of Msmqdistributor service of Enterprise Library?
Please share your experience. | 0 | [
2,
630,
1276,
568,
4235,
79,
1251,
2906,
13202,
2153,
365,
16,
6002,
1248,
60,
800,
3726,
3726,
95,
50,
568,
13,
2291,
8326,
13,
13919,
3010,
1921,
9,
17,
67,
32,
412,
70,
30,
95,
378,
275,
4235,
79,
1251,
26,
13721,
2762,
185,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
VS2008 Debugger does not break on unhandled exception
===
I'm having an odd problem with my vs debugger. When running my program under the vs debugger, the debugger does not break on an unhandled exception. Instead control is returned to VS as if the program exited normally. If I look in the output tab, There is a first-chance exeption listed just before the thread termination. I can set the debugger to break on the first-chance exception and stop at the point.
Any Ideas?
Metro. | 0 | [
2,
4611,
2753,
121,
2345,
11356,
630,
52,
1442,
27,
367,
3203,
1294,
5391,
800,
3726,
3726,
31,
22,
79,
452,
40,
4210,
1448,
29,
51,
4611,
121,
2345,
11356,
9,
76,
946,
51,
625,
131,
14,
4611,
121,
2345,
11356,
15,
14,
121,
2345... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 can I see what Color properties in .NET like "BalnchedAlmond" look like?
===
I'm in the middle of writing code in .Net to draw something in my app and I need to pick a color to use. But what does the color "Chartreuse" look like? Isn't there a nice bitmap that shows what each of the system colors look like somewhere?
Thanks! | 0 | [
2,
113,
92,
31,
196,
98,
1665,
3704,
19,
13,
9,
2328,
101,
13,
7,
3817,
103,
6261,
192,
4660,
7,
361,
101,
60,
800,
3726,
3726,
31,
22,
79,
19,
14,
772,
16,
1174,
1797,
19,
13,
9,
2328,
20,
2003,
301,
19,
51,
4865,
17,
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 you move from the Proof of Concept phase to working on a production-ready solution?
===
I'm working on a project that's been accepted as a proof of concept and is now on the schedule as an actual production project. I'm curious how others approach this transition.
I've heard from various sources that when a project starts as a proof of concept it's often a good idea to trash all of the code written during that rapidly-evolving phase and essentially to start over with a clean slate, relying on what you learned from the conceptual phase but without working to clean up the potentially messy code that you wrote the first time around. Kind of the programming version of "throw away the first copy of that angry email you're about to send and start all over" theory.
I've done it this was in the past and I've also refactored the conceptual code to use in production, but since I'm in the transition phase for a new project I wanted to get an idea how others do this. Obviously a lot depends on the project itself, and on the conceptual code (if what you generated works but won't scale for example, it's probably best to start afresh, but if you have a very compressed timeline for the project you might be forced to build on what you've already written).
That said, if all things were equal what would you all choose as an approach? | 0 | [
2,
184,
107,
42,
780,
37,
14,
6070,
16,
2420,
2702,
20,
638,
27,
21,
637,
8,
15193,
4295,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
669,
30,
22,
18,
74,
2217,
28,
21,
6070,
16,
2420,
17,
25,
130,
27,
14,
4345,
28,
40,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where to start with source-control
===
Anyone have any suggestions on where to start for a newbie wanting to try out some sort of source-control along with a new journey into ASP.NET? SVN, VSS, CVS...I dont even know where to start! | 0 | [
2,
113,
20,
799,
29,
1267,
8,
12898,
800,
3726,
3726,
1276,
57,
186,
18389,
27,
113,
20,
799,
26,
21,
78,
5893,
4638,
20,
1131,
70,
109,
2058,
16,
1267,
8,
12898,
303,
29,
21,
78,
2998,
77,
28,
306,
9,
2328,
60,
13,
18,
1657... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 open this table in SQL Server Management Studio?
===
I created a couple of tables procedurally via C# named something like [MyTableOneCustom0] and [MyTableTwoCustom0]. When I try to return all of the values from these tables via "Open Table" in MS SQL Server Management Studio, I receive the following error:
> Error Source:
> Microsoft.VisualStudio.DataTools
>
> Error Message: Exception has been
> thrown by the target of an invocation.
However, I can still bring up all of the data via a SELECT * statement.
Does anyone know what is causing this? | 0 | [
2,
483,
92,
22,
38,
31,
368,
48,
859,
19,
4444,
255,
8128,
1097,
1120,
60,
800,
3726,
3726,
31,
679,
21,
1335,
16,
7484,
26429,
102,
1197,
272,
5910,
377,
301,
101,
636,
915,
5924,
849,
4636,
6015,
387,
500,
17,
636,
915,
5924,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Incremental File Copy Tool and NIH
===
For years, one of my most important tools has been incremental copy utility that compares the contents of two directories and shows me which files are newer / older / added / deleted. Every day I find myself copying folders of source code between my two desktop machines and the server, and such a utility is critical to avoid overwriting newer files with older ones and also to save time by only copying changed files. In addition, the utility allows me to see new files in the source folder that I don't necessarily want to copy (like temp files) that I instead can delete.
Like anyone who subscribes to the [NIH][1] way of thinking, I wrote my own utility to compare the contents of two folders and let me mark files to be copied, deleted, diffed or ignored. I've had many versions of this utility going back to DOS, OS/2 and Win32.
I use this utility on a daily basis, and it leaves me wondering: What do others use? Surely there are similar programs out there to do this... My utility doesn't have a diff screen, and it would be occasionally nice to see what the difference is between two changed files.
What do you use for comparing and incrementally copying between folders?
[1]: http://en.wikipedia.org/wiki/Not_Invented_Here | 0 | [
2,
29977,
3893,
4344,
5607,
17,
1781,
252,
800,
3726,
3726,
26,
122,
15,
53,
16,
51,
127,
681,
4672,
63,
74,
29977,
4344,
10082,
30,
11590,
18,
14,
8478,
16,
81,
559,
1596,
17,
1285,
55,
56,
6488,
50,
12372,
13,
118,
1234,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I figure out who has a SQL Server 2005 database in Single User Mode?
===
I have a database in single user mode and I am trying to drop it so I can re-run the creation scripts on it, but I'm being locked out from it.
1. How do I figure out who has the lock on it?
2. How do I disable that lock?
| 0 | [
2,
184,
107,
31,
1465,
70,
72,
63,
21,
4444,
255,
8128,
812,
6018,
19,
345,
4155,
3740,
60,
800,
3726,
3726,
31,
57,
21,
6018,
19,
345,
4155,
3740,
17,
31,
589,
749,
20,
2804,
32,
86,
31,
92,
302,
8,
3169,
14,
2502,
17505,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to convert an XML file into a .Net class?
===
Can someone please remind me how to create a .Net class from an XML file?<br>
I would prefer the batch commands, or a way to integrate it into the shell.<br>
Otherwise, just the exe names will due.
Thanks!
| 0 | [
2,
184,
20,
8406,
40,
23504,
3893,
77,
21,
13,
9,
2328,
718,
60,
800,
3726,
3726,
92,
737,
2247,
11702,
55,
184,
20,
1600,
21,
13,
9,
2328,
718,
37,
40,
23504,
3893,
60,
1,
5145,
1,
31,
83,
6369,
14,
13064,
14294,
15,
54,
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... |
IIS ASP Caching
===
I'm trying to configure ASP caching in IIS, following the instructions of a software I purchased. This is supposed to make it run faster.
http://www.microsoft.com/technet/prodtechnol/WindowsServer2003/Library/IIS/a5766228-828e-4e31-a92b-51da7d24d569.mspx?mfr=true
The software instructions point to that article.
The problem i'm having is that the "**ASP File Cache** section" that's mentioned there does not exist in my IIS dialog...
Am I missing something?
Is there any configuration that'll make it appear?
I'm running IIS 6.0 on W2003 Server Enterprise Edition.
Update 1: I am logged in as the local administrator (the box is not in a domain) | 0 | [
2,
595,
18,
28,
306,
1658,
7192,
800,
3726,
3726,
31,
22,
79,
749,
20,
1065,
15951,
28,
306,
1658,
7192,
19,
595,
18,
15,
249,
14,
7650,
16,
21,
2306,
31,
2432,
9,
48,
25,
2293,
20,
233,
32,
485,
4233,
9,
7775,
6903,
6483,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
what is the difference between OLE DB and ODBC data sources?
===
I was reading a MS Excel help article about pivotcache and wonder what they mean by *OLE DB and ODBC sources*
> ...You should use the CommandText
> property instead of the SQL property,
> which now exists primarily for
> compatibility with earlier versions of
> Microsoft Excel. If you use both
> properties, the CommandText property’s
> value takes precedence.
>
> For **OLE DB sources**, the CommandType
> property describes the value of the
> CommandText property.
>
> For **ODBC sources**, the CommandText
> property functions exactly like the
> SQL property, and setting the property
> causes the data to be refreshed...
I really appreciate your short answers. | 0 | [
2,
98,
25,
14,
2841,
128,
12116,
13,
9007,
17,
12340,
7229,
1054,
2662,
60,
800,
3726,
3726,
31,
23,
1876,
21,
4235,
20700,
448,
2002,
88,
20670,
793,
2569,
17,
2666,
98,
59,
884,
34,
1637,
6069,
13,
9007,
17,
12340,
7229,
2662,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Project Management and Processus for a team of 1 dev.
===
I usually have some project that I can do alone that take around 6 months to 1 year. I always try to have some "release" date and write few documentations (external to the code).
My question is, what type of management do you use when you do not have a team with you but you are alone?
Example, I was thinkg about Agile Programming BUT not sure if you can really say that you are Agile when you are alone? What do you use? | 0 | [
2,
669,
1097,
17,
953,
267,
26,
21,
173,
16,
137,
9664,
9,
800,
3726,
3726,
31,
951,
57,
109,
669,
30,
31,
92,
107,
1056,
30,
247,
140,
400,
818,
20,
137,
159,
9,
31,
550,
1131,
20,
57,
109,
13,
7,
15202,
7,
1231,
17,
2757... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Figuring out the right language for the job: branching out from C#
===
I work in a Microsoft environment, so I can use my C# hammer on any nails I come across. That being said, what languages (compiled, interpreted, scripting, functional, any types!) complement knowing C#, and for what purposes? For example, I've moved a lot of script functionality away from compiled console apps and into Powershell scripts. If you're an MS developer, have you found a niche in your world for other languages like F#, IronRuby, IronPython, or something similar, and what niche do they fill?
Note: this question is directed at the Microsoft dev people since I can't run off and start installing LAMP stacks around my company, and therefore having to support it forever. :) However, feel free to mention any other languages that you found interesting to fulfill a certain task/role in your world apart from your main language. | 0 | [
2,
25379,
70,
14,
193,
816,
26,
14,
1205,
45,
1686,
68,
70,
37,
272,
5910,
800,
3726,
3726,
31,
170,
19,
21,
7099,
2307,
15,
86,
31,
92,
275,
51,
272,
5910,
5416,
27,
186,
11191,
31,
340,
464,
9,
30,
142,
87,
15,
98,
2556,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 can I find Microsoft assemblies that are not already in Visual Studio?
===
I figured someone can answer the question generally but if anyone wants to get specific I am trying to use:
using System.Web.Security.SingleSignOn;
using System.Web.Security.SingleSignOn.Authorization;
I've googled my brains out and this is the closest answer I found:
"We discussed this offline, but it looks like the ADFS assembly is GACed, but
not installed on the file system or registered with VS.NET so that it shows
up in the .NET tab. I'm guessing MS may need to beef up the installer for
this scenario. In the meantime, you probably need to do this yourself."
What on earth, do WHAT myself? | 0 | [
2,
113,
92,
31,
477,
7099,
21066,
30,
50,
52,
614,
19,
3458,
1120,
60,
800,
3726,
3726,
31,
5700,
737,
92,
1623,
14,
1301,
1469,
47,
100,
1276,
2846,
20,
164,
1903,
31,
589,
749,
20,
275,
45,
568,
329,
9,
14113,
9,
17749,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I set an Application's Icon Globally in Swing?
===
I know I can specify one for each form, or for the root form and then it'll cascade through to all of the children forms, but I'd like to have a way of overriding the default Java Coffee Cup for all forms even those I might forget.
Any suggestions? | 0 | [
2,
184,
107,
31,
309,
40,
3010,
22,
18,
9801,
18861,
19,
5587,
60,
800,
3726,
3726,
31,
143,
31,
92,
19077,
53,
26,
206,
505,
15,
54,
26,
14,
5900,
505,
17,
94,
32,
22,
211,
13542,
120,
20,
65,
16,
14,
391,
1997,
15,
47,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way to prevent duplicate use of credit cards
===
We have a system where we want to prevent the same credit card number being registered for two different accounts. As we don't store the credit card number internally - just the last four digits and expiration date - we cannot simply compare credit card numbers and expiration dates.
Our current idea is to store a hash (SHA-1) in our system of the credit card information when the card is registered, and to compare hashes to determine if a card has been used before.
Usually, a salt is used to avoid dictionary attacks. I assume we are vulnerable in this case, so we should probably store a salt along with the hash.
Do you guys see any flaws in this method? Is this a standard way of solving this problem?
| 0 | [
2,
246,
161,
20,
2501,
19429,
275,
16,
3251,
4092,
800,
3726,
3726,
95,
57,
21,
329,
113,
95,
259,
20,
2501,
14,
205,
3251,
2056,
234,
142,
3801,
26,
81,
421,
5310,
9,
28,
95,
221,
22,
38,
1718,
14,
3251,
2056,
234,
17739,
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... |
Is there a Macro Recorder for Eclipse?
===
Anybody know of a good eclipse plugin for recording and playing back macros? I've tried <a href="http://www.bdaum.de/eclipse/">this one</a>, but it didn't do me any good- seemed like it wasn't ready for primetime.
I know about editor templates, but I'm looking for something that I can use to record my keystrokes and then apply multiple times against a wad of text.
This seems like a strange hole in an IDE, am I missing some builtin facility for this? | 0 | [
2,
25,
80,
21,
9069,
14173,
26,
11652,
60,
800,
3726,
3726,
11181,
143,
16,
21,
254,
11652,
10922,
108,
26,
1576,
17,
791,
97,
9069,
18,
60,
31,
22,
195,
794,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
6483,
9,
220,
593,
723... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How would you implement a secure static login credentials system in Java?
===
We recently had a security audit and it exposed several weaknesses in the systems that are in place here. One of the tasks that resulted from it is that we need to update our partner credentials system make it more secure.
The "old" way of doing things was to generate a (bad) password, give it to the partner with an ID and then they would send that ID and a 64 bit encoded copy of that password in with all of their XML requests over https. We then decode them and validate them.
These passwords won't change (because then our partners would have to make coding/config changes to change them and coordinating password expiration's with hundreds of partners for multiple environments would be a nightmare) and they don't have to be entered by a human or human readable. I am open to changing this if there is a better but still relatively simple implementation for our partners.
Basically it comes down to two things: I need a more secure Java password generation system and to ensure that they are transmitted in a secure way.
I've found a few hand rolled password generators but nothing that really stood out as a standard way to do this (maybe for good reason). There may also be a more secure way to transmit them than simple 64 bit encoding over https.
What would you do for the password generator and do you think that the transmission method in place is secure enough for it? | 0 | [
2,
184,
83,
42,
8713,
21,
4315,
12038,
6738,
108,
5059,
43,
10107,
18,
329,
19,
8247,
60,
800,
3726,
3726,
95,
1989,
41,
21,
1221,
13471,
17,
32,
5043,
238,
23732,
19,
14,
1242,
30,
50,
19,
209,
235,
9,
53,
16,
14,
8674,
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... |
License / registration frameworks for C / C++
===
What sort of registration frameworks are available for C / C++ applications? I'm looking for a library that will handle the cryptographic verification of license and registration keys to enable the full features of an application, and optionally disable features after a specified time interval has elapsed.
For example, on the Mac one might use [AquaticPrime](http://aquaticmac.com/), which uses RSA to generate and verify license keys. However, this is Mac only, so it's of limited use for cross-platform applications.
Open-source is best, but closed-source solutions are fine. Any ideas? | 0 | [
2,
3962,
13,
118,
8587,
6596,
18,
26,
272,
13,
118,
272,
20512,
800,
3726,
3726,
98,
2058,
16,
8587,
6596,
18,
50,
904,
26,
272,
13,
118,
272,
20512,
3767,
60,
31,
22,
79,
699,
26,
21,
1248,
30,
129,
3053,
14,
16277,
12084,
25... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Finding First Row in a RDLC Table
===
I have a table in a RDLC report which is utilized as a subreport, and the first column of this table is a static string. Does anyone know how I can determine if a row is the first in the table. I tried using "=First("My String")" but it didn't work. | 0 | [
2,
3007,
64,
3131,
19,
21,
13,
897,
6109,
859,
800,
3726,
3726,
31,
57,
21,
859,
19,
21,
13,
897,
6109,
1330,
56,
25,
14326,
28,
21,
972,
17437,
15,
17,
14,
64,
4698,
16,
48,
859,
25,
21,
12038,
3724,
9,
630,
1276,
143,
184,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
VB6 / Crystal Report 8.5 error: A string is required here
===
I recently inherited an old visual basic 6/ crystal reports project which connects to a sql server database. The error message I get (Error# -2147191803 A String is required here) when I attempt to run the project seems to be narrowed down to the .Printout command in the following code:
<pre>
'Login to database
Set Tables = Report.Database.Tables
Set Table = Tables.Item(1)
Table.SetLogOnInfo ConnName, DBName, user, pass
DomainName = selected
'Set parameter Fields
'Declare parameter holders
Set ParamDefs = Report.ParameterFields
'Store parameter objects
For Each ParamDef In ParamDefs
With ParamDef
Select Case .ParameterFieldName
Case "Company Name"
.SetCurrentValue DomainName
End Select
End With
Next
Report.EnableParameterPrompting = False
Screen.MousePointer = vbHourglass
'CRViewer1.ReportSource = Report
'CRViewer1.ViewReport
test = 1
**Report.PrintOut**
test = test + 3
currenttime = Str(Now)
currenttime = Replace(currenttime, "/", "-")
currenttime = Replace(currenttime, ":", "-")
DomainName = Replace(DomainName, ".", "")
startName = mPath + "\crysta~1.pdf"
endName = mPath + "\" + DomainName + "\" + DomainName + " " + currenttime + ".pdf"
rc = MsgBox("Wait for PDF job to finish", vbInformation, "H/W Report")
Name startName As endName
Screen.MousePointer = vbDefault
End If
</pre>
During the run, the form shows up, the ParamDef variable sets the "company name" and when it gets to the **Report.PrintOut** line which prompts to print, it throws the error. I'm guessing the crystal report isn't receiving the "Company Name" to properly run the crystal report. Does any one know how to diagnose this...either on the vb6 or crystal reports side to determine what I'm missing here?
thanks in advance!
| 0 | [
2,
13,
20468,
379,
13,
118,
4282,
1330,
469,
9,
264,
7019,
45,
21,
3724,
25,
1390,
235,
800,
3726,
3726,
31,
1989,
7179,
40,
315,
3458,
2125,
13,
12626,
4282,
2813,
669,
56,
8534,
20,
21,
4444,
255,
8128,
6018,
9,
14,
7019,
2802... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Weblogic 9.x support the 2.4 Servlet standard?
===
Seems like a simple enough question but I can't seem to find the answer. And hey, dead simple questions like this with dead simple answers is what Joel and Jeff want SO to be all about, right? | 0 | [
2,
630,
2741,
24268,
561,
9,
396,
555,
14,
172,
9,
300,
13,
10321,
1336,
1236,
60,
800,
3726,
3726,
2206,
101,
21,
1935,
511,
1301,
47,
31,
92,
22,
38,
2260,
20,
477,
14,
1623,
9,
17,
8409,
15,
828,
1935,
2346,
101,
48,
29,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best way to make a mobile friendly site?
===
Speaking entirely in technology-free terms, what is the best way to make a mobile friendly site? That is, I want to make a site that will work on a regular computer but also have mobile versions of the pages. Should I rewrite each page? The pages will probably have different functionality, so should I rewrite the backend code? Should it be an effectively different site with the same database?
Thoughts?
Thanks!
-fREW | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
233,
21,
3241,
4753,
689,
60,
800,
3726,
3726,
3324,
2894,
19,
1099,
8,
4639,
1663,
15,
98,
25,
14,
246,
161,
20,
233,
21,
3241,
4753,
689,
60,
30,
25,
15,
31,
259,
20,
233,
21,
689,
30,
12... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Portable way to catch signals and report problem to the user.
===
If by some miracle a segfault occurs in our program, I want to catch the SIGSEGV and let the user (possibly a GUI client) know with a single return code that a serious problem has occurred. At the same time I would like to display information on the command line to show which signal was caught.
Today our signal handler looks as follows:
void catchSignal (int reason) {
std :: cerr << "Caught a signal: " << reason << std::endl;
exit (1);
}
I can hear the screams of horror with the above, as I have read from this [thread][1] that it is evil to call a non-reentrant function from a signal handler.
Is there a portable way to handle the signal and provide information to users?
[1]: http://groups.google.com/group/gnu.gcc.help/browse_thread/thread/6184795b39508519/f775c1f48284b212?lnk=gst&q=deadlock# | 0 | [
2,
13469,
161,
20,
2949,
7616,
17,
1330,
1448,
20,
14,
4155,
9,
800,
3726,
3726,
100,
34,
109,
8162,
21,
1353,
16368,
9708,
3690,
19,
318,
625,
15,
31,
259,
20,
2949,
14,
8858,
870,
23896,
17,
408,
14,
4155,
13,
5,
21628,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What happens if MySQL connections continually aren't closed on PHP pages?
===
At the beginning of each PHP page I open up the connection to MySQL, use it throughout the page and close it at the end of the page. However, I often redirect in the middle of the page to another page and so in those cases the connection does not be closed. I understand that this is not bad for performance of the web server since PHP automatically closes all MySQL connections at the end of each page anyway. Are there any other issues here to keep in mind, or is it really true that you don't have to worry about closing your database connections in PHP?
<pre><code>$mysqli = new mysqli("localhost", "root", "", "test");
...do stuff, perhaps redirect to another page...
$mysqli->close();
</code></pre> | 0 | [
2,
98,
5531,
100,
51,
18,
22402,
6760,
16609,
4847,
22,
38,
827,
27,
13,
26120,
4434,
60,
800,
3726,
3726,
35,
14,
997,
16,
206,
13,
26120,
2478,
31,
368,
71,
14,
2760,
20,
51,
18,
22402,
15,
275,
32,
892,
14,
2478,
17,
543,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 convert a unmanaged double to a managed string?
===
From managed c++, I am calling an unmanaged c++ method which returns a double. How can I convert this double into a managed string?
Sorry if this is a stupid question, I'm still very new with C++ in .net.
Thanks! | 0 | [
2,
184,
20,
8406,
21,
367,
177,
8030,
1494,
20,
21,
1471,
3724,
60,
800,
3726,
3726,
37,
1471,
272,
20512,
15,
31,
589,
2555,
40,
367,
177,
8030,
272,
20512,
2109,
56,
4815,
21,
1494,
9,
184,
92,
31,
8406,
48,
1494,
77,
21,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is your single favorite feature in Resharper?
===
My whole department has owned individual copies of [Resharper][1] for about a year, but I find I'm one of only two people that actually use any of its features regularly. I'm trying to get everybody to use it more effectively and would like opinions on the most useful features and their shortcuts so I can share more than just what I use it for.
So what's your *single* favorite feature and its keyboard shortcut for Resharper?
[1]: http://www.jetbrains.com/resharper/index.html | 4 | [
2,
98,
25,
154,
345,
3839,
1580,
19,
302,
23646,
106,
60,
800,
3726,
3726,
51,
979,
604,
63,
1467,
1359,
3298,
16,
636,
99,
23646,
106,
500,
2558,
165,
500,
26,
88,
21,
159,
15,
47,
31,
477,
31,
22,
79,
53,
16,
104,
81,
148,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In bash, environmental variables not tab-expanding correctly
===
In bash, environmental variables will tab-expand correctly when placed after an echo command, for example:
echo $HOME
But after cd or cat, bash places a \ before the $ sign, like so:
cd \$HOME
If I use a variable as the second argument to a command, it won't expand at all:
cp somefile $HOM
What mysterious option do I have in my .bashrc or .inputrc file that is causing me such distress? | 0 | [
2,
19,
13158,
15,
2703,
12157,
52,
6523,
8,
6899,
290,
68,
12044,
800,
3726,
3726,
19,
13158,
15,
2703,
12157,
129,
6523,
8,
6899,
290,
12044,
76,
1037,
75,
40,
8117,
1202,
15,
26,
823,
45,
8117,
5579,
8167,
47,
75,
1745,
54,
20... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you glua Lua to C++ code?
===
Do you use Luabind, toLua++, or some other library (if so, which one) or none at all?
For each approach, what are the pro's and con's?
| 0 | [
2,
184,
107,
42,
13,
13161,
58,
1612,
58,
20,
272,
20512,
1797,
60,
800,
3726,
3726,
107,
42,
275,
1612,
9104,
706,
15,
20,
2377,
58,
20512,
15,
54,
109,
89,
1248,
13,
5,
821,
86,
15,
56,
53,
6,
54,
2369,
35,
65,
60,
26,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0... |
C++ strings: utf-8 or 16-bit encoding?
===
I'm still trying to decide whether my (home) project should use [utf-8][1] strings (implemented in terms of std::string with additional utf-8-specific functions when necessary) or some 16-bit string (implemented as std::wstring). The project is a programming language and environment (like VB, it's a combination of both).
There are a few wishes/constraints:
- It would be cool if it could run on limited hardware, such as small [Micro-ATX][2] formats, which basically means limited memory.
- I want the code to run on Windows, Mac and (if resources allow) Linux.
- I'll be using [wxWidgets][3] as my GUI layer, but I want the code that interacts with that toolkit confined in a corner of the codebase (I will have non-gui executables).
- I would like to avoid working with two different kinds of strings when working with user-visible text and with the application's data.
Currently, I'm working with std::string, with the intent of using utf-8 manipulation functions only when necessary. It requires less memory, and seems to be the direction many applications are going anyway.
If you recommend a 16-bit encoding, which one: [utf-16][4]? ucs-2? Another one?
Thanks,
Carl
[1]: http://en.wikipedia.org/wiki/UTF-8
[2]: http://en.wikipedia.org/wiki/MicroATX
[3]: http://www.wxwidgets.org/
[4]: http://en.wikipedia.org/wiki/UTF-16 | 0 | [
2,
272,
20512,
7887,
45,
287,
11720,
8,
457,
54,
347,
8,
3326,
19608,
60,
800,
3726,
3726,
31,
22,
79,
174,
749,
20,
4073,
1472,
51,
13,
5,
8167,
6,
669,
378,
275,
636,
1982,
410,
8,
457,
500,
2558,
165,
500,
7887,
13,
5,
89... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Managed C++ Method naming
===
I'm using managed c++ to implement a method that returns a string. I declare the method in my header file using the following signature:
String^ GetWindowText()
However, when I'm using this method from C#, the signature is:
string GetWindowTextW();
How do I get rid of the extra "W" at the end of the method's name? | 0 | [
2,
1471,
272,
20512,
2109,
10929,
800,
3726,
3726,
31,
22,
79,
568,
1471,
272,
20512,
20,
8713,
21,
2109,
30,
4815,
21,
3724,
9,
31,
10123,
14,
2109,
19,
51,
157,
106,
3893,
568,
14,
249,
7810,
45,
3724,
1,
164,
27508,
11969,
5,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Oracle Natural Joins and Count(1)
===
Does anyone know why in Oracle 11g when you do a Count(1) with more than one natural join it does a cartesian join and throws the count way off?
Such as
SELECT Count(1) FROM record NATURAL join address NATURAL join person WHERE status=1
AND code = 1 AND state = 'TN'
This pulls back like 3 million rows when
SELECT * FROM record NATURAL join address NATURAL join person WHERE status=1
AND code = 1 AND state = 'TN'
pulls back like 36000 rows, which is the correct amount.
Am I just missing something? | 0 | [
2,
15759,
1112,
10612,
17,
2468,
5,
165,
6,
800,
3726,
3726,
630,
1276,
143,
483,
19,
15759,
547,
263,
76,
42,
107,
21,
2468,
5,
165,
6,
29,
91,
119,
53,
1112,
1865,
32,
630,
21,
349,
3231,
806,
1865,
17,
13566,
14,
2468,
161,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Setting the SVN "execute" bit in a Subversion repository using TortiseSVN or command line SVN
===
I've got an open-source app that is hosed at code.google.com. It is cross platform ( Linux / Windows / Mac ). I uploaded the code initially from a WinXP machine using TortiseSVN and it seems that none of the "configure" batch files that are used for the linux build have their "execute" bits set.
What would be the easiest way to set these for the files that need them. Using TortiseSVN would be easier I suppose, but if it can't, then I could also use the command line SVN on my linux machine.
| 0 | [
2,
2697,
14,
13,
18,
16578,
13,
7,
1706,
17194,
591,
7,
1142,
19,
21,
972,
10898,
24869,
568,
17109,
2628,
18,
16578,
54,
1202,
293,
13,
18,
16578,
800,
3726,
3726,
31,
22,
195,
330,
40,
368,
8,
12097,
4865,
30,
25,
16882,
43,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 you have SharePoint Link Lists default to opening in a new window?
===
In SharePoint, it is easy to set up a List webpart consisting of Links to other documents, folders, sites, etc. Unfortunately, when clicking these links, the default behavior is for the page to open in the current browser window. That is, it does NOT open the page in a new instance of the browser. This has proven annoying for a number of the users on my site.
Does anyone know of a way to have the default behavior be to open in a NEW browser window?
I'm hoping this is something that can be set in SharePoint rather than having users need to adjust some sort of setting in their browser. | 0 | [
2,
184,
92,
42,
57,
1891,
3132,
3508,
7227,
12838,
20,
1214,
19,
21,
78,
1463,
60,
800,
3726,
3726,
19,
1891,
3132,
15,
32,
25,
2010,
20,
309,
71,
21,
968,
2741,
3091,
4160,
16,
6271,
20,
89,
4374,
15,
19294,
18,
15,
3259,
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... |
Why Am I Getting Link Errors When Calling Function in Math.h?
===
When attempting to call functions in `math.h`, I'm getting link errors like the following
undefined reference to sqrt
But I'm doing a `#include <math.h>`
I'm using gcc and compiling as follows:
gcc -Wall -D_GNU_SOURCE blah.c -o blah
Why can't the linker find the definition for `sqrt`? | 0 | [
2,
483,
589,
31,
1017,
3508,
11908,
76,
2555,
1990,
19,
5057,
9,
252,
60,
800,
3726,
3726,
76,
6314,
20,
645,
3719,
19,
13,
1,
14825,
9,
252,
1,
15,
31,
22,
79,
1017,
3508,
11908,
101,
14,
249,
367,
13439,
2801,
20,
4444,
5256... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 flip a sprite/texture in OpenGLES?
===
I have a sprite loaded as a texture and I need to animate it, allowing it to "face" left or right -- essentially sometimes I need to "flip" it. I know that OpenGL has a gltranslate which repositions an object, and glrotate which rotates it. Is there a method that simply flips it across one axis? If not, how would you accomplish this? | 0 | [
2,
184,
107,
31,
8805,
21,
27902,
118,
11969,
4221,
19,
368,
4875,
18,
60,
800,
3726,
3726,
31,
57,
21,
27902,
8572,
28,
21,
12714,
17,
31,
376,
20,
14487,
591,
32,
15,
2719,
32,
20,
13,
7,
6413,
7,
225,
54,
193,
13,
8,
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... |
Simple way to parse a person's name into its component parts?
===
A lot of contact management programs do this - you type in a name (*e.g.*, "John W. Smith") and it automatically breaks it up internally into:
**First name:** John
**Middle name:** W.
**Last name:** Smith
Likewise, it figures out things like "Mrs. Jane W. Smith" and "Dr. John Doe, Jr." correctly as well (assuming you allow for fields like "prefix" and "suffix" in names).
I assume this is a fairly common things that people would want to do... so the question is... how would you do it? Is there a *simple* algorithm for this? Maybe a regular expression?
I'm after a .NET solution, but I'm not picky. | 0 | [
2,
1935,
161,
20,
2017,
870,
21,
840,
22,
18,
204,
77,
82,
5912,
1341,
60,
800,
3726,
3726,
21,
865,
16,
2203,
1097,
1726,
107,
48,
13,
8,
42,
1001,
19,
21,
204,
13,
5,
2483,
62,
9,
263,
9,
2483,
15,
13,
7,
7373,
619,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the best SQL Server performance optimization techniques?
===
I've always taken the approach of first deploying the database with a minimal set of indexes and then adding/changing indexes as performance dictates.
This approach works reasonably well. However, it still doesn't tell me where I could improve performance. It only tells me where performance is so bad that users complain about it.
Currently, I'm in the process of refactoring database objects on a lot of our applications.
So should I not bother to look for performance improvements since "premature optimization is the root of all evil"?
When refactoring application code, the developer is constantly looking for ways to improve the code quality. Is there a way to constantly be looking for improvements in database performance as well? If so, what tools and techniques have you found to be most helpful?
I've briefly played around with the "Database engine tuning advisor" but didn't find it to be helpful at all. Maybe I just need more experience interpreting the results. | 0 | [
2,
98,
50,
14,
246,
4444,
255,
8128,
956,
21597,
4212,
60,
800,
3726,
3726,
31,
22,
195,
550,
658,
14,
2141,
16,
64,
17617,
68,
14,
6018,
29,
21,
8663,
309,
16,
4348,
160,
17,
94,
4721,
118,
22211,
4348,
160,
28,
956,
25250,
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... |
Displaying Window on Logon Screen Using C# in Windows XP
===
I am trying to create a service with C# that launches a process that can be displayed on the Windows XP Logon screen.
I found some code that is doing this in C++. The C++ code is for a service that creates another process with STARTUPINFO.lpDesktop set to "WinSta0\\WinLogon". The created process is then displayed to the Windows Logon Screen. I can't seem to find a way to specify the 'desktop' of a new process in C# using System.Diagnostic.Process class.
Does anyone know how to do this with C#? | 0 | [
2,
17418,
1463,
27,
6449,
103,
2324,
568,
272,
5910,
19,
1936,
23045,
800,
3726,
3726,
31,
589,
749,
20,
1600,
21,
365,
29,
272,
5910,
30,
22933,
21,
953,
30,
92,
44,
6115,
27,
14,
1936,
23045,
6449,
103,
2324,
9,
31,
216,
109,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Free/open source service (SOA) management and monitoring tools
===
I was looking for Free/open source service (SOA) management and monitoring tools. What tools have you used and is there any tool that you recommend?
Thanks
Manju | 0 | [
2,
551,
118,
10157,
1267,
365,
13,
5,
18,
6941,
6,
1097,
17,
8984,
4672,
800,
3726,
3726,
31,
23,
699,
26,
551,
118,
10157,
1267,
365,
13,
5,
18,
6941,
6,
1097,
17,
8984,
4672,
9,
98,
4672,
57,
42,
147,
17,
25,
80,
186,
5607... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Identify the host from a Windows user mode dump file
===
Is the an easy way of finding out the host name of a machine than generated a user mode dump file via WinDbg?
Or at least any piece of identifying information to try and confirm that two dump files came from the same system. | 0 | [
2,
5808,
14,
2015,
37,
21,
1936,
4155,
3740,
11424,
3893,
800,
3726,
3726,
25,
14,
40,
2010,
161,
16,
3007,
70,
14,
2015,
204,
16,
21,
1940,
119,
6756,
21,
4155,
3740,
11424,
3893,
1197,
1511,
19924,
60,
54,
35,
639,
186,
1855,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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's the best way to determine the name of your machine in a .NET app?
===
I need to get the name of the machine my .NET app is running on. What is the best way to do this? | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
3746,
14,
204,
16,
154,
1940,
19,
21,
13,
9,
2328,
4865,
60,
800,
3726,
3726,
31,
376,
20,
164,
14,
204,
16,
14,
1940,
51,
13,
9,
2328,
4865,
25,
946,
27,
9,
98,
25,
14,
246,
161,
20,
107... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
iPhone programming - impressions, opinions?
===
I've been programming in C,C++,C# and a few other languages for many years, mainly for Windows and Linux but also embedded platforms. Recently started to do some iPhone programming as a side project so I'm using Apple platforms for the first time since my Apple II days. I'm wondering what other developers that are coming to Mac OSX, Xcode and iPhone SDK think. Here are my impressions, so far:
- Mac OSX: very confusing, I tend to end up with too many open windows and don't know what's where. Luckily there's the bird's eye view, without it I'd be lost. With the shell at least there's all the familiar stuff so that helps me a lot.
- Xcode: doesn't feel as good as VisualStudio or Eclipse, the two environments I'm familiar with. I think I could get used to it but I'm wondering if Apple wouldn't be better off with Eclipse. Before I found the setting where all the windows are stuck together I hated it, now I can tolerate it.
- iPhone SDK: strange indeed. I understand Apple's desire to control their environment but in this day and age it just seems a little sleazy and they are missing out on so much by destroying developer goodwill.
- Objective-C: I've known about it for years but never even took a look at it. The syntax is off-putting but I'm actually very intrigued by the language. I think it's an interesting third leg between C++ and C#, both of which I like a lot. Is there any chance Obj-C will break out of the Mac sandbox due to the uptick in the popularity of Apple technology?
Curious to read your thoughts,
Andrew
| 0 | [
2,
21024,
3143,
13,
8,
6394,
18,
15,
11900,
60,
800,
3726,
3726,
31,
22,
195,
74,
3143,
19,
272,
15,
150,
20512,
15,
150,
5910,
17,
21,
310,
89,
2556,
26,
151,
122,
15,
2011,
26,
1936,
17,
13024,
47,
67,
12138,
6843,
9,
1989,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Building an HTML table on the fly using JQuery
===
Below is the code I use to build an HTML table on the fly (using JSON data received from the server)
I display an animated pleasewait (.gif) graphic while the data is loading...however, the graphic freezes while the js function is building the table. At first, I was just happy to make this happen (display the table), I guess now I need to work on efficiency...at the very least I need to stop the animated graphic from freezing...I can go to a static "Loading" display, but I would rather make this method work.
Suggestions for my pleasewait display? and efficiency..possibly a better way to build the table? or maybe not a table, but some other "table" like display
var t = eval( "(" + request + ")" ) ;
var myTable = '' ;
myTable += '<table id="myTable" cellspacing=0 cellpadding=2 border=1>' ;
myTable += "<thead>" ;
myTable += "<tr>";
for (var i = 0; i < t.hdrs.length; i++) {
myTable += "<th>" + header + "</th>";
}
myTable += "</tr>" ;
myTable += "</thead>" ;
myTable += "<tbody>" ;
for (var i = 0; i < t.data.length; i++) {
myTable += '<tr>';
for (var j = 0; j < t.hdrs.length; j++) {
myTable += '<td>';
if (t.data[i][t.hdrs[j]] == "") {
myTable += " " ;
}
else {
myTable += t.data[i][t.hdrs[j]] ;
}
myTable += "</td>";
}
myTable += "</tr>";
}
myTable += "</tbody>" ;
myTable += "</table>" ;
$("#result").append(myTable) ;
$("#PleaseWaitGraphic").addClass("hide");
$(".rslt").removeClass("hide") ;
Thanks (please add a comment to the question for clarification requests and/or code bugs)
| 0 | [
2,
353,
40,
13,
15895,
859,
27,
14,
2855,
568,
487,
8190,
93,
800,
3726,
3726,
1021,
25,
14,
1797,
31,
275,
20,
1895,
40,
13,
15895,
859,
27,
14,
2855,
13,
5,
12655,
487,
528,
1054,
420,
37,
14,
8128,
6,
31,
3042,
40,
5784,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In C++, why use static_cast<int>(x) instead of int(x)?
===
I've heard that, in C++, the static_cast function should be preferred to C-style or simple function-style casting. Is this true? Why? | 0 | [
2,
19,
272,
20512,
15,
483,
275,
12038,
1,
6146,
1,
6391,
1,
5,
396,
6,
700,
16,
19,
38,
5,
396,
6,
60,
800,
3726,
3726,
31,
22,
195,
752,
30,
15,
19,
272,
20512,
15,
14,
12038,
1,
6146,
1990,
378,
44,
5981,
20,
272,
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,
0... |
What's the right way to dynamically choose menu items for a context menu in WinForms?o
===
I'm trying to make a context menu for a control that is "linked" to a main menu item. There are two fixed menu items that are always there and an arbitrary number of additional menu items that might need to be on the menu.
I've tried solving the problem by keeping a class-level reference to the fixed menu items and a list of the dynamic menu items. I am handling both menus' <code>Opening</code> events by clearing the current list of items, then adding the appropriate items to the menu. This works fine for the main menu, but the context menu behaves oddly.
The major problem seems to be that by the time <code>Opening</code> is raised, the menu has already decided which items it is going to display. This form demonstrates:
<pre><code>using System.Collections.Generic;
using System.ComponentModel;
using System.Windows.Forms;
namespace WindowsFormsApplication1
{
public class DemoForm : Form
{
private List<ToolStripMenuItem> _items;
public DemoForm()
{
var contextMenu = new ContextMenuStrip();
contextMenu.Opening += contextMenu_Opening;
_items = new List<ToolStripMenuItem>();
_items.Add(new ToolStripMenuItem("item 1"));
_items.Add(new ToolStripMenuItem("item 2"));
this.ContextMenuStrip = contextMenu;
}
void contextMenu_Opening(object sender, CancelEventArgs e)
{
var menu = sender as ContextMenuStrip;
if (menu != null)
{
foreach (var item in _items)
{
menu.Items.Add(item);
}
}
}
}
}
</code></pre>
When you right-click the form the first time, nothing is displayed. The second time, the menu is displayed as expected. Is there another event that is raised where I could update the items? Is it a bad practice to dynamically choose menu items?
(*Note: This is for an example I started making for someone who wanted such functionality and I was curious about how difficult it is, so I can't provide details about why this might be done. This person wants to "link" a main menu item to the context menu, and since menu items can only be the child of a single menu this seemed a reasonable way to do so. Any alternative suggestions for an approach are welcome.*) | 0 | [
2,
98,
22,
18,
14,
193,
161,
20,
7782,
1326,
3538,
11379,
3755,
26,
21,
4141,
11379,
19,
628,
4190,
18,
60,
111,
800,
3726,
3726,
31,
22,
79,
749,
20,
233,
21,
4141,
11379,
26,
21,
569,
30,
25,
13,
7,
6258,
69,
7,
20,
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... |
Excel Addin Access Violation
===
Using c#, VS2005, and .NET 2.0. This is a Winforms app that gets called by a VBA addin (.xla) via Interop libraries. This app has been around for a while a works fine when the assembly is compiled and executed anywhere other than my dev machine. On dev it crashes hard (in debugger and just running the object) with "Unhandled exception at 0x... in EXCEL.EXE: 0x...violation reading location 0x...
But here's the weird part:
The first method in my interface works fine. All the other methods crash as above. Here is an approximation of the code:
[Guid("123Fooetc...")]
[InterfaceType(ComInterfaceType.InterfaceIsIDispatch)]
public interface IBar
{
[DispId(1)]
void ThisOneWorksFine(Excel.Workbook ActiveWorkBook);
[DispId(2)]
string Crash1(Excel.Workbook ActiveWorkBook);
[DispId(3)]
int Crash2(Excel.Workbook activeWorkBook, Excel.Range target, string someStr);
}
[Guid("345Fooetc..")]
[ClassInterface(ClassInterfaceType.None)]
[ProgId("MyNameSpace.MyClass")]
public class MyClass : IBar
{
public void ThisOneWorksFine(Excel.Workbook ActiveWorkBook)
{...}
string Crash1(Excel.Workbook ActiveWorkBook);
{...}
int Crash2(Excel.Workbook activeWorkBook, Excel.Range target, string someStr);
{...}
}
It seems like some kind of environmental thing. Registry chundered? Could be code bugs, but it works fine elsewhere.
| 0 | [
2,
20700,
3547,
108,
1381,
12120,
800,
3726,
3726,
568,
272,
5910,
15,
4611,
2835,
15,
17,
13,
9,
2328,
172,
9,
387,
9,
48,
25,
21,
628,
4190,
18,
4865,
30,
3049,
227,
34,
21,
566,
969,
3547,
108,
13,
5,
9,
396,
531,
6,
1197... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Junit output and OutOfMemoryError
===
I'm running some JUnit tests on my applications. Every test has a for loop calling respective method 10000 times.
The tested methods produce a lot of log.
These logs are also automatically collected by JUnit as test output.
This situation takes to OutOfMemoryError because the string buffer where JUnit keeps the output becomes too large.
I dont' need these logs during tests, so if there is a way to tell JUnit "don't keep program output" it would be enough.
Any ideas? | 0 | [
2,
7446,
242,
5196,
17,
70,
1041,
790,
5171,
93,
29992,
800,
3726,
3726,
31,
22,
79,
946,
109,
7446,
242,
4894,
27,
51,
3767,
9,
352,
1289,
63,
21,
26,
5293,
2555,
7390,
2109,
332,
3993,
436,
9,
14,
7631,
3195,
2213,
21,
865,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a list of AJAX JSF Libraries available?
===
I'm looking for an alternative to [www.jsfmatrix.net][1] to get a better idea of what JSF libraries are out there and to avoid having to write my own grid/table components. Or are these 27 the best the world has to offer (really only 3 are worth their salt.)
[1]: http://www.jsfmatrix.net/ | 0 | [
2,
25,
80,
21,
968,
16,
20624,
487,
18,
410,
8649,
904,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
40,
2676,
20,
636,
6483,
9,
728,
18,
410,
540,
17224,
9,
2328,
500,
2558,
165,
500,
20,
164,
21,
574,
882,
16,
98,
487,
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... |
Handling different ConnectionStates before opening SqlConnection
===
If you need to open a SqlConnection before issuing queries, can you simply handle all non-Open ConnectionStates in the same way? For example:
if (connection.State != ConnectionState.Open)
{
connection.Open();
}
I read somewhere that for ConnectionState.Broken the connection needs to be closed before its re-opened. Does anyone have experience with this? Thanks- | 0 | [
2,
7988,
421,
2760,
3859,
18,
115,
1214,
4444,
255,
25996,
872,
800,
3726,
3726,
100,
42,
376,
20,
368,
21,
4444,
255,
25996,
872,
115,
17502,
9386,
2829,
15,
92,
42,
1659,
3053,
65,
538,
8,
10157,
2760,
3859,
18,
19,
14,
205,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I create a zoom effect in OpenGLES on the iPhone?
===
I have an OpenGL ES game that I am hacking together. One part of it involves looking at a large "map-like" area and then double-tapping on one part to "zoom into" it. How would you use OpenGL ES to provide this effect (given that it may need to zoom in on different parts of the map).
I've heard of glScale and glOrtho, but I'm unclear on how they actually work since the whole openGL world is very new to me. | 0 | [
2,
184,
107,
31,
1600,
21,
19469,
1590,
19,
368,
4875,
18,
27,
14,
21024,
60,
800,
3726,
3726,
31,
57,
40,
368,
8430,
13,
160,
250,
30,
31,
589,
25787,
429,
9,
53,
141,
16,
32,
6569,
699,
35,
21,
370,
13,
7,
15022,
8,
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... |
How to render unicode characters in the correct font? (C#/WinForms)
===
My application correctly handles different kind of character sets, but only internally - when it comes to displaying text in standard WinForms labels und textboxes, it seems to have problems with chinese characters.
The problem seems to be the font used (Tahoma), because when I copy&paste the text, or view it in the debugger, it is displayed correctly. Also when I set MS Mincho as the font to be used, the characters on the screen look OK.
Of course, I don't want to use MS Mincho in the entire application. Do I have to switch the font depending on the characters displayed, or is there a better way I have missed? | 0 | [
2,
184,
20,
16535,
28010,
1766,
19,
14,
4456,
9978,
60,
13,
5,
150,
5910,
118,
4181,
4190,
18,
6,
800,
3726,
3726,
51,
3010,
12044,
3053,
18,
421,
825,
16,
925,
3415,
15,
47,
104,
17739,
13,
8,
76,
32,
1624,
20,
17418,
1854,
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... |
Rhino mocks ordered reply, throw exception problem
===
I'm trying to implement some retry logic if there is an exception in my code. I've written the code and now I'm trying to get Rhino Mocks to simulate the scenario. The jist of the code is the following:
class Program
{
static void Main(string[] args)
{
MockRepository repo = new MockRepository();
IA provider = repo.CreateMock<IA>();
using (repo.Record())
{
SetupResult.For(provider.Execute(23))
.IgnoreArguments()
.Throw(new ApplicationException("Dummy exception"));
SetupResult.For(provider.Execute(23))
.IgnoreArguments()
.Return("result");
}
repo.ReplayAll();
B retryLogic = new B { Provider = provider };
retryLogic.RetryTestFunction();
repo.VerifyAll();
}
}
public interface IA
{
string Execute(int val);
}
public class B
{
public IA Provider { get; set; }
public void RetryTestFunction()
{
string result = null;
//simplified retry logic
try
{
result = Provider.Execute(23);
}
catch (Exception e)
{
result = Provider.Execute(23);
}
}
}
What seems to happen is that the exception gets thrown everytime instead of just once. What should I change the setup to be? | 0 | [
2,
18642,
10506,
18,
1905,
6504,
15,
3814,
5391,
1448,
800,
3726,
3726,
31,
22,
79,
749,
20,
8713,
109,
302,
5840,
7085,
100,
80,
25,
40,
5391,
19,
51,
1797,
9,
31,
22,
195,
642,
14,
1797,
17,
130,
31,
22,
79,
749,
20,
164,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Invalid postback or callback argument
===
I have an ASP.net application that works fine in the development environment but in the production environment throws the following exception when clicking a link that performs a postback. Any ideas?
> Invalid postback or callback argument.
> Event validation is enabled using
> <pages enableEventValidation="true"/>
> in configuration or <%@ Page
> EnableEventValidation="true" %> in a
> page. For security purposes, this
> feature verifies that arguments to
> postback or callback events originate
> from the server control that
> originally rendered them. If the data
> is valid and expected, use the
> ClientScriptManager.RegisterForEventValidation
> method in order to register the
> postback or callback data for
> validation.
| 0 | [
2,
16671,
678,
1958,
54,
645,
1958,
5476,
800,
3726,
3726,
31,
57,
40,
28,
306,
9,
2328,
3010,
30,
693,
1123,
19,
14,
522,
2307,
47,
19,
14,
637,
2307,
13566,
14,
249,
5391,
76,
25590,
21,
3508,
30,
11563,
21,
678,
1958,
9,
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... |
Can FxCop/StyleCop be limited to only analyze selected methods from with Visual Studio?
===
I am taking on a maintenance team and would like to introduce tools like FxCop and StyleCop to help improve the code and introduce the developers to better programming techniques and standards. Since we are maintaining code and not making significant enhancements, we will probably only deal with a couple of methods/routines at a time when making changes.
Is it possible to target FxCop/StyleCop to specific areas of code within Visual Studio to avoid getting overwhelmed with all of the issues that would get raised when analyzing a whole class or project? If it is possible, how do you go about it?
Thanks,
Matt | 0 | [
2,
92,
13,
16488,
9734,
118,
4381,
9734,
44,
1317,
20,
104,
16051,
1704,
3195,
37,
29,
3458,
1120,
60,
800,
3726,
3726,
31,
589,
741,
27,
21,
5010,
173,
17,
83,
101,
20,
8500,
4672,
101,
13,
16488,
9734,
17,
1034,
9734,
20,
448,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
The performance impact of using instanceof in Java
===
I am working on an application and one design approach involves extremely heavy use of the instanceof operator. While I know that OO design generally tries to avoid using instanceof, that is a different story and this question is purely related to performance. I was wondering if there is any performance impact? Is is just as fast as ==?
For example, I have a base class with 10 subclasses. In a single function that takes the base class, I do checks for if the class is an instance of the subclass and carry out some routine.
One of the other ways I thought of solving it was to use to use a "type id" integer primitive instead, and use a bitmask to represent categories of the subclasses, and then just do a bit mask comparison of the subclasses "type id" to a constant mask representing the category.
Is instanceof somehow optimized by the JVM to be faster than that? I want to stick to Java but the performance of the app is critical. It would be cool if someone that has been down this road before could offer some advice. Am I nitpicking too much or focusing on the wrong thing to optimize? | 0 | [
2,
14,
956,
2261,
16,
568,
4851,
1041,
19,
8247,
800,
3726,
3726,
31,
589,
638,
27,
40,
3010,
17,
53,
704,
2141,
6569,
3898,
1278,
275,
16,
14,
4851,
1041,
6022,
9,
133,
31,
143,
30,
13,
4328,
704,
1469,
3919,
20,
2658,
568,
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... |
Visual Studio 2008 saving files gets slow
===
I've looked for some other articles on this problem and even tried some of the ideas in [this thread][1]; however, nothing has solved the issue yet. So, on to the issue.
Something happens when working in Visual Studio (usually C#) that causes the IDE to become a bit wonky when saving a file. I will be working along just fine for a while then at some point I notice that every time I save a file (Ctrl+S) it becomes very slow.
The behavior I notice is this; I hit save in some fashion (Ctrl+S, menu, etc...) and in the status bar I see the word **Searching** show up. It looks like it is scanning through all of the loaded namespaces for something, although I have no idea for what or why it is doing so. It causes a real hiccup in workflow since typically I will hit Ctrl+S often and keep typing.
I have been unable to track down what exactly causes this to start happening. It has happened in multiple project types (web, WPF, console).
Has anyone seen this behavior or have any suggestions?
[1]: http://stackoverflow.com/questions/8440/visual-studio-optimizations#8539 | 0 | [
2,
3458,
1120,
570,
7599,
6488,
3049,
2276,
800,
3726,
3726,
31,
22,
195,
292,
26,
109,
89,
3376,
27,
48,
1448,
17,
166,
794,
109,
16,
14,
3478,
19,
636,
1565,
9322,
500,
2558,
165,
12660,
207,
15,
626,
63,
15091,
14,
1513,
768,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WPF Validation Not Firing on First LostFocus of the TextBox
===
I am trying to validate the WPF form against an object. The validation fires when I type something in the textbox lose focus come back to the textbox and then erase whatever I have written. But if I just load the WPF application and tab off the textbox without writing and erasing anything from the textbox then it is not fired.
Here is the Customer.cs class:
public class Customer : IDataErrorInfo
{
public string FirstName { get; set; }
public string LastName { get; set; }
public string Error
{
get { throw new NotImplementedException(); }
}
public string this[string columnName]
{
get
{
string result = null;
if (columnName.Equals("FirstName"))
{
// check for null or empty values
if (String.IsNullOrEmpty(FirstName))
{
result = "FirstName cannot be null or empty";
}
}
else if (columnName.Equals("LastName"))
{
if (String.IsNullOrEmpty(LastName))
{
result = "LastName cannot be null or empty";
}
}
return result;
}
}
}
And here is the WPF code:
<TextBlock Grid.Row="1" Margin="10" Grid.Column="0">LastName</TextBlock>
<TextBox Style="{StaticResource textBoxStyle}" Name="txtLastName" Margin="10" VerticalAlignment="Top" Grid.Row="1" Grid.Column="1">
<Binding Source="{StaticResource CustomerKey}" Path="LastName" ValidatesOnExceptions="True" ValidatesOnDataErrors="True" UpdateSourceTrigger="LostFocus"/>
</TextBox>
| 0 | [
2,
619,
7721,
27999,
52,
7139,
27,
64,
529,
23371,
16,
14,
1854,
5309,
800,
3726,
3726,
31,
589,
749,
20,
7394,
1373,
14,
619,
7721,
505,
149,
40,
3095,
9,
14,
27999,
11327,
76,
31,
1001,
301,
19,
14,
1854,
5309,
2926,
1776,
340... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's wrong with my XPath/XML?
===
I'm trying a very basic XPath on [this xml][1], and it doesn't find anything.
I'm trying both .NET and [this website][2], and XPaths such as "//PropertyGroup", "/PropertyGroup" and "//MSBuildCommunityTasksPath" are simply not working for me (they compiled but return zero results).
[1]: http://pastebin.com/f14a20a30
[2]: http://www.xmlme.com/XpathTool.aspx | 0 | [
2,
98,
22,
18,
1389,
29,
51,
993,
8353,
118,
396,
8184,
60,
800,
3726,
3726,
31,
22,
79,
749,
21,
253,
2125,
993,
8353,
27,
636,
1565,
23504,
500,
2558,
165,
500,
15,
17,
32,
1437,
22,
38,
477,
602,
9,
31,
22,
79,
749,
156,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Exceptions: Is this a good practice?
===
This is written in PHP but it's really language agnostic.
try
{
try
{
$issue = new DM_Issue($core->db->escape_string($_GET['issue']));
}
catch(DM_Exception $e)
{
throw new Error_Page($tpl, ERR_NOT_FOUND, $e->getMessage());
}
}
catch(Error_Page $e)
{
die($e);
}
Is nested try, catch blocks a good practice to follow? It seems a little bulky just for an error page - however my Issue Datamanager throws an Exception if an error occurs and I consider that to be a good way of error detecting.
The Error_Page exception is simply an error page compiler.
I might just be pedantic but do you think this is a good way to report errors and if so can you suggest a better way to write this?
Thanks | 0 | [
2,
13392,
45,
25,
48,
21,
254,
1345,
60,
800,
3726,
3726,
48,
25,
642,
19,
13,
26120,
47,
32,
22,
18,
510,
816,
21,
21944,
9,
1131,
13,
1,
1131,
13,
1,
5579,
12565,
800,
78,
15728,
1,
12565,
5,
4403,
10375,
8,
1,
9007,
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... |
Why was the function.callee.caller property deprecated in JavaScript?
===
Why was the function.callee.caller property deprecated in JavaScript?
It was added and then deprecated in JavaScript, but it was omitted altogether by ECMAScript. Some browser (Mozilla, IE) have always supported it and don't have any plans on the map to remove support. Others (Safari, Opera) have adopted support for it, but support on older browsers is unreliable.
Is there a good reason to put this valuable functionality in limbo?
(Or alternately, is there a better way to grab a handle on the current function scope?) | 0 | [
2,
483,
23,
14,
1990,
9,
3430,
4716,
9,
9200,
106,
1354,
121,
3515,
150,
1669,
19,
8247,
8741,
60,
800,
3726,
3726,
483,
23,
14,
1990,
9,
3430,
4716,
9,
9200,
106,
1354,
121,
3515,
150,
1669,
19,
8247,
8741,
60,
32,
23,
905,
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... |
What are you using for Distributed Caching in web farms running ASP.NET?
===
I am curious as to what others are using in this situation. I know a couple of the options that are out there like a memcached port or ScaleOutSoftware. The memcached ports don't seem to be actively worked on (correct me if I'm wrong). ScaleOutSoftware is too expensive for me (I don't doubt it is worth it). This is not to say that I don't want to hear about people using memcached or ScaleOutSoftware. I'm just stating what I "know" at this point.
So my question is basically this: for those of you <b>ACTIVELY</b> using distributed caching, what are you using, are you happy with it, and what should I look out for?
I am moving to two servers very soon...both will be at the same location. I use caching fairly heavily (but carefully) to reduce the load on my database server. | 0 | [
2,
98,
50,
42,
568,
26,
4387,
1658,
7192,
19,
2741,
9003,
946,
28,
306,
9,
2328,
60,
800,
3726,
3726,
31,
589,
7686,
28,
20,
98,
654,
50,
568,
19,
48,
1858,
9,
31,
143,
21,
1335,
16,
14,
6368,
30,
50,
70,
80,
101,
21,
55,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Salesforce.com - Why uploading of Apex class is not working?
===
I have an Apex class (controller) originally developed under Developer Edition and need to upload it to production which is Enterprise Edition.
The upload fails with following message
classes/RenewalController.cls(RenewalController):An error occurred on your page.
package.xml(RenewalController):An object 'RenewalController' of type ApexClass
was named in manifest but was not found in zipped directory
The same message when I try to use Force.com IDE: *Save error: An error occurred on your page.*
This class is working under Developer Edition but not with Enterprise.
What can be the problem? | 0 | [
2,
2598,
8774,
9,
960,
13,
8,
483,
71,
16866,
16,
15452,
718,
25,
52,
638,
60,
800,
3726,
3726,
31,
57,
40,
15452,
718,
13,
5,
12898,
1252,
6,
912,
885,
131,
10058,
1322,
17,
376,
20,
71,
8294,
32,
20,
637,
56,
25,
6002,
132... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tools to view/solve Windows XP memory fragmentation
===
We have a java program that requires a large amount of heap space - we start it with (among other command line arguments) the argument -Xmx1500m, which specifies a maximum heap space of 1500 MB. When starting this program on a Windows XP box that has been freshly rebooted, it will start and run without issues. But if the program has run several times, the computer has been up for a while, etc., when it tries to start I get this error:
<pre>
Error occurred during initialization of VM
Could not reserve enough space for object heap
Could not create the Java virtual machine.
</pre>
I suspect that Windows itself is suffering from memory fragmentation, but I don't know how to confirm this suspicion. At the time that this happens, Task manager and sysinternals procexp report 2000MB free memory. I have looked at [this question related to internal fragmentation](http://stackoverflow.com/questions/60871/how-to-solve-memory-fragmentation)
So the first question is, How do I confirm my suspicion?
The second question is, if my suspicions are correct, does anyone know of any tools to solve this problem? I've looked around quite a bit, but I haven't found anything that helps, other than periodic reboots of the machine.
ps - changing operating systems is also not currently a viable option.
| 0 | [
2,
4672,
20,
1418,
118,
5594,
195,
1936,
23045,
1912,
28698,
800,
3726,
3726,
95,
57,
21,
8247,
625,
30,
4781,
21,
370,
2006,
16,
15414,
726,
13,
8,
95,
799,
32,
29,
13,
5,
21068,
89,
1202,
293,
10553,
6,
14,
5476,
13,
8,
396,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Java RMI Resources
===
Hi everyone I am currently undertaking a project that involves extensive use of Java RMI and I was wondering if anyone is aware of any good resources about it.
The problem I am having with the material I am finding currently is that its usually quite out of date (like Java 1.3) and / or half complete. I would even be happy to buy a book on it but looking on Amazon all the books are like 7 years old.
So if anyone is aware of any good resources, books or good example implementations I would be very interested to hear about them. Thanks in advance for your help. | 0 | [
2,
8247,
761,
1435,
2566,
800,
3726,
3726,
4148,
1266,
31,
589,
871,
19483,
21,
669,
30,
6569,
3386,
275,
16,
8247,
761,
1435,
17,
31,
23,
5712,
100,
1276,
25,
3854,
16,
186,
254,
2566,
88,
32,
9,
14,
1448,
31,
589,
452,
29,
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... |
Align an image where the source is set by javascript
===
I'm putting the network solutions 'seal' image on my site and they give you a javascript that sets the image. I'm wanting the image to align>right. However, if you want the image, they give you a javascript code stub and it handles the rest, which has no alignment property. I've even tried putting the javascript into a table that aligns right but apparently the javascript is rendered after the table is rendered by the browser.
Thoughts on how to get around this? | 0 | [
2,
23389,
40,
1961,
113,
14,
1267,
25,
309,
34,
8247,
8741,
800,
3726,
3726,
31,
22,
79,
3873,
14,
982,
6776,
13,
22,
870,
192,
22,
1961,
27,
51,
689,
17,
59,
590,
42,
21,
8247,
8741,
30,
3415,
14,
1961,
9,
31,
22,
79,
4638,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Setting Variable for length of a Request (C#/.NET)
===
Can I set some kind of global variable for the length of a single Request, so that all the controls of the page can respond to it without having to pass it through to each of them?
For instance, if someone hit a Save button on my MasterPage, could I set something so that each UserControl on my Page can have a Page_Load like:
protected void Page_Load(object sender, EventArgs e)
{
if (isSaving) // isSaving is a global variable
{
saveData(); // save myself
}
loadData();
}
It just seems a lot easier than having a delegate from the masterpage call the Page's save function, which then calls UC1.saveData() to each UserControl, though I know that's better Object Oriented thinking. | 0 | [
2,
2697,
7612,
26,
1476,
16,
21,
3772,
13,
5,
150,
5910,
118,
9,
2328,
6,
800,
3726,
3726,
92,
31,
309,
109,
825,
16,
2062,
7612,
26,
14,
1476,
16,
21,
345,
3772,
15,
86,
30,
65,
14,
8671,
16,
14,
2478,
92,
4590,
20,
32,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
jQuery Menu and ASP.Net Sitemap
===
Does anyone know if it is possible to use an asp.net web.sitemap with a jQuery [Superfish][1] menu?
If not, are there any standards based browser agnostic plugins available that work with the web.sitemap file?
[1]: http://users.tpg.com.au/j_birch/plugins/superfish/ | 0 | [
2,
487,
8190,
93,
11379,
17,
28,
306,
9,
2328,
689,
15022,
800,
3726,
3726,
630,
1276,
143,
100,
32,
25,
938,
20,
275,
40,
28,
306,
9,
2328,
2741,
9,
9097,
15022,
29,
21,
487,
8190,
93,
636,
8542,
4934,
500,
2558,
165,
500,
11... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Pascal's Theorem for non-unique sets?
===
[Pascal's rule][1] on counting the subset's of a set works great, when the set contains unique entities.
Is there a modification to this rule for when the set contains duplicate items?
For instance, when I try to find the count of the combinations of the letters A,B,C,D, it's easy to see that it's 1 + 4 + 6 + 4 + 1 (from Pascal's Triangle) = 16, or 15 if I remove the "use none of the letters" entry.
Now, what if the set of letters is A,B,B,B,C,C,D? Computing by hand, I can determine that the sum of subsets is: 1 + 4 + 8 + 10 + 10 + 8 + 4 + 1 = 46, but this doesn't conform to the Triangle I know.
Question: How do you modify Pascal's Triangle to take into account duplicate entities in the set?
[1]: http://en.wikibooks.org/wiki/Combinatorics/Subsets_of_a_set-The_Binomial_Coefficient | 0 | [
2,
18661,
22,
18,
9532,
26,
538,
8,
1020,
5312,
3415,
60,
800,
3726,
3726,
636,
11722,
3430,
22,
18,
1828,
500,
2558,
165,
500,
27,
11195,
14,
16622,
22,
18,
16,
21,
309,
693,
374,
15,
76,
14,
309,
1588,
2619,
12549,
9,
25,
80... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why don't languages raise errors on integer overflow by default?
===
In several modern programming languages (including C++, Java, and C#), the language allows [integer overflow][1] to occur at runtime without raising any kind of error condition.
For example, consider this (contrived) C# method, which does not account for the possibility of overflow/underflow. (For brevity, the method also doesn't handle the case where the specified list is a null reference.)
//Returns the sum of the values in the specified list.
private static int sumList(List<int> list)
{
int sum = 0;
foreach (int listItem in list)
{
sum += listItem;
}
return sum;
}
If this method is called as follows:
List<int> list = new List<int>();
list.Add(2000000000);
list.Add(2000000000);
int sum = sumList(list);
An overflow will occur in the sumList() method (because the "int" type in C# is a 32-bit signed integer, and the sum of the values in the list exceeds the value of the maximum 32-bit signed integer). The sum variable will have a value of -294967296 (not a value of 4000000000); this most likely is not what the (hypothetical) developer of the sumList method intended.
Obviously, there are various techniques that can be used by developers to avoid the possibility of integer overflow, such as using a type like Java's [BigInteger][2], or the [checked][3] keyword and [/checked][4] compiler switch in C#.
However, the question that I'm interested in is why these languages were designed to by default allow integer overflows to happen in the first place, instead of, for example, raising an exception when an operation is performed at runtime that would result in an overflow. It seems like such behavior would help avoid bugs in cases where a developer neglects to account for the possibility of overflow when writing code that performs an arithmetic operation that could result in overflow. (These languages could have included something like an "unchecked" keyword that could designate a block where integer overflow is permitted to occur without an exception being raised, in those cases where that behavior is explicitly intended by the developer; C# actually [does have this][5].)
Does the answer simply boil down to performance -- the language designers didn't want their respective languages to default to having "slow" arithmetic integer operations where the runtime would need to do extra work to check whether an overflow occurred, on every applicable arithmetic operation -- and this performance consideration outweighed the value of avoiding "silent" failures in the case that an inadvertent overflow occurs?
Are there other reasons for this language design decision as well, other than performance considerations?
[1]: http://en.wikipedia.org/wiki/Integer_overflow
[2]: http://java.sun.com/j2se/1.5.0/docs/api/java/math/BigInteger.html
[3]: http://msdn.microsoft.com/en-us/library/74b4xzyw.aspx
[4]: http://msdn.microsoft.com/en-us/library/h25wtyxf.aspx
[5]: http://msdn.microsoft.com/en-us/library/a569z7k8.aspx | 0 | [
2,
483,
221,
22,
38,
2556,
3972,
11908,
27,
13820,
20285,
34,
12838,
60,
800,
3726,
3726,
19,
238,
773,
3143,
2556,
13,
5,
3970,
272,
20512,
15,
8247,
15,
17,
272,
5910,
6,
15,
14,
816,
2965,
636,
6391,
13699,
20285,
500,
2558,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 makes you a C programming expert?
===
I attended a job fair yesterday and a developer asked me how I would rank my proficiency in C. I then realized that this is incredibly arbitrary and almost impossible to nail down, so my question is what knowledge makes you an expert in programming C?
Edit: or what would the breakdown be? what makes you good, decent, proficient, etc. | 0 | [
2,
98,
1364,
42,
21,
272,
3143,
5390,
60,
800,
3726,
3726,
31,
1394,
21,
1205,
1768,
7124,
17,
21,
10058,
411,
55,
184,
31,
83,
2839,
51,
28418,
19,
272,
9,
31,
94,
1896,
30,
48,
25,
13003,
17237,
17,
557,
3992,
20,
11250,
125... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 best database access pattern?
===
I've read about and dabbled with some including active record, repository, data transfer objects. Which is best? | 0 | [
2,
98,
22,
18,
14,
246,
6018,
1381,
3732,
60,
800,
3726,
3726,
31,
22,
195,
1302,
88,
17,
1331,
13784,
43,
29,
109,
215,
1348,
571,
15,
24869,
15,
1054,
2617,
3916,
9,
56,
25,
246,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Where I can find Machine.Migrations? I seems googled everywhere but can't find it (only find the introduction blog stuff etc..)
===
as title, I can't find it.... where I can find it?
Machine.Migrations: I mean, the data schema/data migration framework.
I mean, the one mentioned here:
<http://blog.eleutian.com/2008/04/25/AFirstLookAtMachineMigrations.aspx>
| 0 | [
2,
113,
31,
92,
477,
1940,
9,
10183,
5946,
18,
60,
31,
2206,
8144,
43,
6417,
47,
92,
22,
38,
477,
32,
13,
5,
4965,
477,
14,
3445,
8146,
3217,
2722,
9,
9,
6,
800,
3726,
3726,
28,
581,
15,
31,
92,
22,
38,
477,
32,
9,
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... |
What is a javascript hash table implementation that avoids object namespace collisions?
===
First off: I'm using a rather obscure implementation of javascript embedded as a scripting engine for Adobe InDesign CS3. This implementation sometimes diverges from "standard" javascript, hence my problem.
I'm using [John Resig's jsdiff library][1] ([source here][2]) to compare selections of text between two documents. jsdiff uses vanilla objects as associative arrays to map a word from the text to another object. (See the "ns" and "os" variables in jsdiff.js, around line 129.)
My headaches start when the word "reflect" comes up in the text. "reflect" is a default, *read-only* property on *all* objects. When jsdiff tries to assign a value on the associative array to ns['reflect'], everything explodes.
My question: is there a way around this? Is there a way to do a hash table in javascript without using the obvious vanilla object?
**Ground rules:** switching scripting engines isn't an option. :)
[1]: http://ejohn.org/projects/javascript-diff-algorithm/
[2]: http://ejohn.org/files/jsdiff.js | 0 | [
2,
98,
25,
21,
8247,
8741,
19170,
859,
6123,
30,
2658,
18,
3095,
204,
5582,
11319,
18,
60,
800,
3726,
3726,
64,
168,
45,
31,
22,
79,
568,
21,
864,
15472,
6123,
16,
8247,
8741,
12138,
28,
21,
3884,
68,
1406,
26,
20299,
19,
19862,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ReportViewer displaying black background in Print Layout mode
===
In my ReportViewer control, when I click on Print Layout, the background turns black on the report. This must be a bug. Is there a workaround? | 0 | [
2,
1330,
4725,
106,
17418,
319,
2395,
19,
4793,
9106,
3740,
800,
3726,
3726,
19,
51,
1330,
4725,
106,
569,
15,
76,
31,
10840,
27,
4793,
9106,
15,
14,
2395,
2844,
319,
27,
14,
1330,
9,
48,
491,
44,
21,
6256,
9,
25,
80,
21,
170,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Disappearing checkbox label in ASP.Net 3.5 DetailsView control
===
I have a web form with a button and a DetailsView control on it. In the button's click event I change the DetailsView control to insert mode so I can add records:
DetailsView1.ChangeMode(DetailsViewMode.Insert)
Everything works fine, except for a checkbox in the DetailsView. When the DetailsView goes into insert mode, the text describing what the checkbox is for disappears. The checkbox itself works fine.
Why is my text disappearing and how can I fix it? | 0 | [
2,
16797,
2631,
5309,
1899,
19,
28,
306,
9,
2328,
203,
9,
264,
3289,
4725,
569,
800,
3726,
3726,
31,
57,
21,
2741,
505,
29,
21,
5167,
17,
21,
3289,
4725,
569,
27,
32,
9,
19,
14,
5167,
22,
18,
10840,
807,
31,
753,
14,
3289,
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... |
Is there a way to get FlexBuilder 3 to treat a project as an Application and a LIbrary?
===
My team builds reusable libraries for other (internal) software development teams. We use FlexBuilder 3 as our development environment. Our SCM standards state that these projects must include test harnesses and a unit test runner, and (of course) we want to be able to use the debugger. For that reason, all the projects are Applications.
Our build scripts (used primarily by the CI system and for release deployment) build our actual libraries which works great. This approach is used so that FlexBuilder is not required to actually build our production artifacts (on the command line).
The problem is this - in order to have add a FlexBuilder Project to the Library Path for an Application it must be a Library Project. I have tried adding a nature to the project that we want included, but haven't gotten it to work yet. You would want to do that if you wanted to debug source files in another project.
A simple (yet annoying) work around is to include the source folder of the "library project" as a source folder in the "application project." It's annoying because it takes multiple steps to swap between a swc of the "library project" and the source folder of the project itself.
| 0 | [
2,
25,
80,
21,
161,
20,
164,
14409,
20904,
203,
20,
5752,
21,
669,
28,
40,
3010,
17,
21,
1248,
60,
800,
3726,
3726,
51,
173,
1895,
18,
302,
267,
579,
8649,
26,
89,
13,
5,
6280,
5025,
6,
2306,
522,
952,
9,
95,
275,
14409,
209... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a way to programatically determine if a font file has a specific Unicode Glyph?
===
I'm working on a project that generates PDFs that can contain fairly complex math and science formulas. The text is rendered in Times New Roman, which has pretty good Unicode coverage, but not complete. We have a system in place to swap in a more unicode complete font for code points that don't have a glyph in TNR (like most of the "stranger" math symbols,) but I can't seem to find a way to query the *.ttf file to see if a given glyph is present. So far, I've just hard-coded a lookup table of which code points are present, but I'd much prefer an automatic solution.
I'm using VB.Net, but solutions in any programming language / environment would be appreciated. Thanks! | 0 | [
2,
25,
80,
21,
161,
20,
625,
721,
8438,
3746,
100,
21,
9978,
3893,
63,
21,
1903,
28010,
13,
16689,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
669,
30,
7920,
18,
13,
11124,
18,
30,
92,
3717,
6647,
1502,
5057,
17,
762,
3729,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 think in data stores instead of databases?
===
As an example, Google App Engine uses data stores, not a database, to store data. Does anybody have any tips for using data stores instead of databases? It seems I've trained my mind to think 100% in object relationships that map directly to table structures, and now it's hard to see anything differently. I can understand some of the benefits of data stores (e.g. performance and the ability to distribute data), but some good database functionality is sacrificed (e.g. joins).
Does anybody who has worked with data stores like BigTable have any good advice to working with them? | 0 | [
2,
184,
20,
277,
19,
1054,
4134,
700,
16,
6018,
18,
60,
800,
3726,
3726,
28,
40,
823,
15,
8144,
4865,
1406,
2027,
1054,
4134,
15,
52,
21,
6018,
15,
20,
1718,
1054,
9,
630,
11181,
57,
186,
11034,
26,
568,
1054,
4134,
700,
16,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I persist the value of a label through a response.redirect?
===
Here's the situation: I have a label's text set, immediately followed by a response.redirect() call as follows (this is just an example, but I believe it describes my situation accurately):
aspx:
<asp:Label runat="server" Text="default text" />
Code-behind (code called on an onclick event):
Label.Text = "foo";
Response.Redirect("Default.aspx");
When the page renders, the label says "default text". What do I need to do differently? My understanding was that such changes would be done automatically behind the scenes, but apparently, not in this case. Thanks.
| 0 | [
2,
184,
107,
31,
22084,
14,
1923,
16,
21,
1899,
120,
21,
1627,
9,
99,
14706,
60,
800,
3726,
3726,
235,
22,
18,
14,
1858,
45,
31,
57,
21,
1899,
22,
18,
1854,
309,
15,
1375,
709,
34,
21,
1627,
9,
99,
14706,
5,
6,
645,
28,
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... |
What's the best way to store changes to database records that require approval before being visible?
===
I need to store user entered changes to a particular table, but not show those changes until they have been viewed and approved by an administrative user. While those changes are still in a pending state, I would still display the old version of the data. What would be the best way of storing these changes waiting for approval?
I have thought of several ways, but can't figure out what is the best method. This is a very small web app. One way would be to have a PendingChanges table that mimics the other table's schema, and then once the change is approved, I could update the real table with the information. Another approach would be to do some sort of record versioning where I store multiple versions of the data in the table and then always pull the record with the highest version number that has been marked approved. That would limit the number of extra tables (I need to do this for multiple tables), but would require me to do extra processing every time I pull out a set of records to make sure I get the right ones.
Any personal experiences with these methods or others that might be good? | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
1718,
1693,
20,
6018,
742,
30,
4077,
4988,
115,
142,
4560,
60,
800,
3726,
3726,
31,
376,
20,
1718,
4155,
1297,
1693,
20,
21,
1498,
859,
15,
47,
52,
298,
273,
1693,
163,
59,
57,
74,
6084,
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... |
What are the (dis)advantages of using the Visual Studio webserver instead of IIS?
===
I've found that on some occasions I can edit the source while debugging, are there any other advantages of using the built-in webserver instead of a virtual directory in IIS?
I'm using windows XP on my development environment, and a local instance of IIS 5. I work on several projects, so I use multiple virtual directories to manage all the different sites.
Are there any disadvantages? | 0 | [
2,
98,
50,
14,
13,
5,
2906,
6,
1283,
17384,
14465,
16,
568,
14,
3458,
1120,
2741,
10321,
106,
700,
16,
595,
18,
60,
800,
3726,
3726,
31,
22,
195,
216,
30,
27,
109,
5795,
31,
92,
9392,
14,
1267,
133,
121,
16254,
2762,
15,
50,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you add a button to the email message window toolbar in Lotus Notes 8.5+ ?
===
A coworker has been struggling with this problem.
The desired result is an installable plugin for Notes that will add a button emails with attachments that will let users save the attachment to a document management system.
Finding documentation on doing this for Notes has been an uphill battle to say the least.
Writing the actual java to do the work isn't a problem, but figuring out how to extend Notes is.
So, is there a way to add a button/icon to the toolbar, or is it just a matter of adding a new toolbar? If we add a new toolbar then can we make it only visible (or just grey it out otherwise) when no email is open?
| 0 | [
2,
184,
107,
42,
3547,
21,
5167,
20,
14,
8517,
2802,
1463,
5607,
1850,
19,
15175,
2434,
469,
9,
264,
2430,
13,
60,
800,
3726,
3726,
21,
326,
22560,
63,
74,
7587,
29,
48,
1448,
9,
14,
9264,
829,
25,
40,
16146,
579,
10922,
108,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tools For Limiting Available Memory
===
OS: Windows XP
Does anyone know of tools (preferably free) to limit memory available and also other windows resources (handles etc.)? I want to test an app with low memory to make sure it behaves properly and if there are already tools to do this sort of thing, I'd rather not write my own.
By the way, I did look for other Q & A threads for this and didn't find any. If this is a dupe, I apologize. Just let me know and I'll close this up.
| 0 | [
2,
4672,
26,
17567,
904,
1912,
800,
3726,
3726,
13,
759,
45,
1936,
23045,
630,
1276,
143,
16,
4672,
13,
5,
3515,
2407,
4801,
551,
6,
20,
4496,
1912,
904,
17,
67,
89,
1936,
2566,
13,
5,
3203,
1355,
2722,
9,
6,
60,
31,
259,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.