unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
How can I return a joined table as an enumerable on an anonymous return type in linq to sql?
===
I'd like to return an object with the following signature
class AnonClass{
string Name {get;}
IEnumerable<Group> Groups {get;}
}
I have tried the following query, but g only returns a single entity, not all the joined entities
var q = from t in dc.Themes
join g in dc.Groups on t.K equals g.ThemeK
select new {t.Name, Groups = g};
return q.ToArray();
but this returns
class AnonClass{
string Name {get;}
Group Groups{get;}
}
What is the correct linq query to use? | 0 | [
2,
184,
92,
31,
788,
21,
670,
859,
28,
40,
1957,
723,
106,
579,
27,
40,
10364,
788,
1001,
19,
6294,
1251,
20,
4444,
255,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
788,
40,
3095,
29,
14,
249,
7810,
718,
40,
218,
1898,
1,
3724... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Debugging crash and memory leak
===
We are developing a plugin for outlook in visual basic 6.0.We have been facing issues like outlook crash ( due to some objects not getting destroyed or some other reason). One way we have been solving this issue is reading code,commenting code( to observe the affect), logging etc. Are there any other ways of debugging? Are there tools which will help us in knowing what objects are held in memory? | 0 | [
2,
121,
16254,
2762,
4597,
17,
1912,
11724,
800,
3726,
3726,
95,
50,
3561,
21,
10922,
108,
26,
19837,
19,
3458,
2125,
400,
9,
387,
9,
458,
57,
74,
4325,
1549,
101,
19837,
4597,
13,
5,
397,
20,
109,
3916,
52,
1017,
2183,
54,
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... |
PHP MVC (symfony/Zend) vs ASP MVC vs Spring MVC vs Ruby on Rails?
===
I'm paralyzed by choice.
I know PHP, C# and Java fairly well as languages. Most of my web development in the past has been in PHP (with my own or other OSS frameworks). I've spent the last 2-3 years developing desktop GUI apps in C#. Before that I was doing desktop GUI apps in Java (with a little Servlets/JSP).
I want to develop a social web 2.0 site (in my own time) and in the process also add to my "salable" skill set (ie, what people would hire me for).
Do I:
1. Go with what I know best and do it in PHP but use the latest OSS frameworks (eg, Zend).
1. Learn ASP MVC and extend my most recently acquired skill set to include web technologies.
1. Return to Java and learn something like Spring MVC.
1. Go with something entirely new like Ruby on Rails.
| 0 | [
2,
13,
26120,
307,
8990,
13,
5,
7261,
10229,
93,
118,
4257,
43,
6,
4611,
28,
306,
307,
8990,
4611,
1573,
307,
8990,
4611,
10811,
27,
2240,
18,
60,
800,
3726,
3726,
31,
22,
79,
24497,
34,
1837,
9,
31,
143,
13,
26120,
15,
272,
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... |
Agile Vs Spiral Model for SDLC
===
I believe that Agile is nothing but another implication of Spiral Model. I am a big supporter of Spiral (The spiral model is a software development process combining elements of both design and prototyping-in-stages, in an effort to combine advantages of top-down and bottom-up concepts) since beginning and seen that lot of projects implements spiral without knowing that they are operating in spiral world. Since the day Agile started gaining popularity the concept of spiral started getting overlooked a little bit. I am sure that for the complex projects spiral is still the best alternative but I would like to get better understanding of the similarities and difference between the Agile and spiral techniques through this tag. | 0 | [
2,
27475,
4611,
9789,
1061,
26,
13,
18,
43,
6109,
800,
3726,
3726,
31,
985,
30,
27475,
25,
626,
47,
226,
26273,
16,
9789,
1061,
9,
31,
589,
21,
580,
10067,
16,
9789,
13,
5,
124,
9789,
1061,
25,
21,
2306,
522,
953,
12803,
2065,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 maintain legacy applications
===
How would you maintain the legacy applications that:
1. Has no unit tests have big methods
2. with a lot of duplicated logic have
3. have No separation of concern
4. have a lot of quick hacks and hard coded
strings
5. have Outdated and wrong
documentation
???
| 0 | [
2,
184,
83,
42,
4027,
7780,
3767,
800,
3726,
3726,
184,
83,
42,
4027,
14,
7780,
3767,
30,
45,
137,
9,
63,
90,
1237,
4894,
57,
580,
3195,
172,
9,
29,
21,
865,
16,
19429,
43,
7085,
57,
203,
9,
57,
90,
8312,
16,
3630,
268,
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... |
Is there any way to get Documentum to use Character based Storage for Unicode
===
Anyone out there with sufficient knowledge of EMC Documentum and Oracle to know whether it is possible to set up a documentum repository on top of oracle so that it uses Character based field lengths rather than byte based.
By Default Documentum seems to use byte based fields so if a field is string(32) it can contain 32 bytes rather than characters. In this instance a set of unicode characters consisting of 32 characters would be truncated since they are more than 32 bytes.
Does anyone know if it is possible through setup of the Oracle and Documentum settings to change this? | 0 | [
2,
25,
80,
186,
161,
20,
164,
4492,
723,
20,
275,
925,
432,
4326,
26,
28010,
800,
3726,
3726,
1276,
70,
80,
29,
6722,
1918,
16,
3579,
150,
4492,
723,
17,
15759,
20,
143,
1472,
32,
25,
938,
20,
309,
71,
21,
4492,
723,
24869,
27... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When evaluating a design, how do you evaluate complexity?
===
We all know to keep it simple, right?
I've seen complexity being measured as the number of interactions between systems, and I guess that's a very good place to start. Aside from gut feel though, what other (preferably more objective) methods can be used to determine the level of complexity of a particular design or piece of software?
What are YOUR favorite rules or heuristics? | 0 | [
2,
76,
26764,
21,
704,
15,
184,
107,
42,
13,
15599,
12745,
60,
800,
3726,
3726,
95,
65,
143,
20,
643,
32,
1935,
15,
193,
60,
31,
22,
195,
541,
12745,
142,
7160,
28,
14,
234,
16,
11224,
128,
1242,
15,
17,
31,
2321,
30,
22,
18... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MSI Bootstrapping: External URLs
===
Much searching has lead me to find several descriptions of how to create a bootstrapping msi, but these solutions all assume the msi is local or a standard Windows component. Is there a way to make an msi that downloads an installer (which is also an msi) with normal MSI or Wix code rather than by having the bootstrapper execut some non-native program to do so? | 0 | [
2,
4235,
49,
5894,
1939,
5574,
45,
4886,
13,
911,
7532,
800,
3726,
3726,
212,
5792,
63,
672,
55,
20,
477,
238,
15740,
16,
184,
20,
1600,
21,
5894,
1939,
5574,
4235,
49,
15,
47,
158,
6776,
65,
7158,
14,
4235,
49,
25,
375,
54,
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... |
Colemak with Emacs or VIM
===
I've been crossing things out on my TODO list. I've recently picked up Colemak. Next I wanted to learn Vim or Emacs. I was leaning towards Vim, however one of its benefits are sticking to the home row. With Colemak, the home row has been changed. I realize that I could remap the keys, but assigning the functionality to different letters is not extremely appealing to me (if there is any relation between letters and their function. I know movement is not correlated but I'm not sure on all the rest.)
I don't want to start an argumentative post about text editors, but rather receive comments from Colemak (or Dvorak) users about alternative keymappings and these two editors.
Thanks | 2 | [
2,
3438,
15409,
29,
13,
62,
6893,
18,
54,
1790,
79,
800,
3726,
3726,
31,
22,
195,
74,
3506,
564,
70,
27,
51,
20,
537,
968,
9,
31,
22,
195,
1989,
2114,
71,
3438,
15409,
9,
328,
31,
417,
20,
2484,
1790,
79,
54,
13,
62,
6893,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SSIS Debugging Performance
===
I’m using SSIS to synchronize data between two databases. I’ve used SSIS and DTS in the past, but I generally write an application for things of this nature (I’m coder and it just comes easier to me).
In my package I use a SQL Task that returns about 15,000 rows. I’ve hooked that up to a Foreach Container, and within that I assign the resultset column values to variables, and then map those variables to parameters that are fed to another SQL Task.
The problem I’m having is with debugging, and not just more complicated debugging like breakpoints and evaluating values at runtime. I simply mean that if I run this with debugging rather than without, it takes hours to complete.
I ended up rewriting the process in Delphi, and the following is what I came up with:
**Full Push of Data:**<br>
This pulls 15,000 rows, updates a destination table for each row, then pulls 11,000 rows and updates a destination table for each row.
*Debugging:*<br>
Delphi App: 139s<br>
SSIS: 4 hours, 46 minutes
*Not Debugging:*<br>
Delphi App: 132s<br>
SSIS: 384s
**Update of Data:**<br>
This pulls 3,000 rows, but no updates are needed or made to the destination table. It then pulls 11,000 rows but, again, no updates are needed or made to the destination table.
*Debugging:*<br>
Delphi App: 42s<br>
SSIS: 1 hours, 10 minutes
*Not Debugging:*<br>
Delphi App: 34s<br>
SSIS: 205s
The odd thing is, I get the feeling that most of this time spent debugging is just updating UI elements in Visual Studio. If I watch the progress tab, a node is added to a tree for each iteration (thousands total), and this gets slower and slower as the process goes on. Trying to stop debugging usually doesn’t work, as Visual Studio seems caught in a loop updating the UI. If I check the profiler for SQL Server no actual work is being done. I'm not sure if the machine matters, but it should be more than up to the job (quad core, 4 gig of ram, 512 mb video card).
Is this sort of behavior normal? As I’ve said I’m a coder by trade, so I have no problem writing an app for this sort of thing (in fact it takes much less time for me to code an application than “draw” it in SSIS, but I figure that margin will shrink with more work done in SSIS), but I’m trying to figure out where something like SSIS and DTS would fit into my toolbox. So far nothing about it has really impressed me. Maybe I’m misusing or abusing SSIS in some way?
Any help would be greatly appreciated, thanks in advance!
| 0 | [
2,
13,
18,
4557,
121,
16254,
2762,
956,
800,
3726,
3726,
31,
1,
79,
568,
13,
18,
4557,
20,
13,
16023,
2952,
1054,
128,
81,
6018,
18,
9,
31,
1,
195,
147,
13,
18,
4557,
17,
13,
43,
38,
18,
19,
14,
640,
15,
47,
31,
1469,
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... |
What's a 'pervasive database'?
===
I'm sorry, but this keyword doesn't mean anything to me... Can someone deliver me a definition?
Thanks in advance... | 0 | [
2,
98,
22,
18,
21,
13,
22,
1432,
8471,
1284,
6018,
22,
60,
800,
3726,
3726,
31,
22,
79,
1875,
15,
47,
48,
1246,
9587,
1437,
22,
38,
884,
602,
20,
55,
9,
9,
9,
92,
737,
5879,
55,
21,
5465,
60,
3669,
19,
3612,
9,
9,
9,
3,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Help With Basic SQL Query
===
I have a table with columns
> ID, DateStamp
and the ID need not be unique.
How do I write a query that will give me a list of IDs with the minimum DateStamp and the maximum DateStamp?
So, for example, for a given ID, the output may look like:
> 938423, 1/1/2000, 12/13/2003
[I am running SQL Server 2000.] | 0 | [
2,
448,
29,
2125,
4444,
255,
25597,
800,
3726,
3726,
31,
57,
21,
859,
29,
7498,
13,
1,
4924,
15,
4076,
38,
10158,
17,
14,
4924,
376,
52,
44,
2619,
9,
184,
107,
31,
2757,
21,
25597,
30,
129,
590,
55,
21,
968,
16,
13,
9178,
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... |
Convert .doc to html in php
===
Has anyone found a good class, or other file that will convert a .doc file into html or something that I can read and turn into html?
I have been looking around for a couple hours now and have only found ones that require msword on the server in order to convert the file. I am pretty sure that is not an option but I have not actually talked to my hosting provider about it.
The goal is for a user to be able to upload the file to my server and the server handle the conversion and then display it as html, much like googles view as html feature. | 0 | [
2,
8406,
13,
9,
13799,
20,
13,
15895,
19,
13,
26120,
800,
3726,
3726,
63,
1276,
216,
21,
254,
718,
15,
54,
89,
3893,
30,
129,
8406,
21,
13,
9,
13799,
3893,
77,
13,
15895,
54,
301,
30,
31,
92,
1302,
17,
805,
77,
13,
15895,
60... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
simple DataGridView refresh question
===
whats the best way to refresh a DataGridView when you update the base data source?
i'm updating the datasource frequently and wanted to display the outcome to the user as it happens.
i've got something like this made (and it works), but null'ing out the DataGridView.DataSource doesnt seem like the right way.
List<ItemState> itemStates = new List<ItemState>();
dataGridView1.DataSource = itemStates;
for (int i = 0; i < 10; i++)
{
itemStates.Add(new ItemState { Id = i.ToString() });
dataGridView1.DataSource = null;
dataGridView1.DataSource = itemStates;
System.Threading.Thread.Sleep(500);
}
| 0 | [
2,
1935,
1054,
16375,
4725,
24905,
1301,
800,
3726,
3726,
98,
18,
14,
246,
161,
20,
24905,
21,
1054,
16375,
4725,
76,
42,
11100,
14,
1000,
1054,
1267,
60,
31,
22,
79,
71,
43,
1880,
14,
1054,
12097,
3086,
17,
417,
20,
3042,
14,
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... |
Cannot truncate table because it is being referenced by a FOREIGN KEY constraint?
===
Using MSSQL2005, Can I truncate a table with a foreign key constraint if I first truncate the child table(the table with the primary key of the FK relationship)?
I know I can use a DELETE without a where clause and then RESEED the identity OR
Remove the FK, truncate and recreate but I thought as long as you truncate the child table you'll be OK however I'm getting a
"Cannot truncate table 'TableName' because it is being referenced by a FOREIGN KEY constraint."
error. | 0 | [
2,
1967,
22328,
62,
859,
185,
32,
25,
142,
17571,
34,
21,
1228,
1246,
28804,
60,
800,
3726,
3726,
568,
4235,
18,
22402,
2835,
15,
92,
31,
22328,
62,
21,
859,
29,
21,
1228,
1246,
28804,
100,
31,
64,
22328,
62,
14,
850,
859,
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... |
In a WPF app, is there a object I can assign to FileSystemWatcher.SynchronizingObject?
===
In a WPF app, is there a object I can assign to FileSystemWatcher.SynchronizingObject?
I can make my own, but if there is one available, I would like to use it.
| 0 | [
2,
19,
21,
619,
7721,
4865,
15,
25,
80,
21,
3095,
31,
92,
13952,
20,
3893,
10724,
9054,
106,
9,
16023,
3335,
23793,
60,
800,
3726,
3726,
19,
21,
619,
7721,
4865,
15,
25,
80,
21,
3095,
31,
92,
13952,
20,
3893,
10724,
9054,
106,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CSS shadows on 3 sides
===
I'm looking at all the CSS Drop shadow tutorials, which are great. Unfortunately, I need to put a shadow on three sides of a block element (left, bottom, right). All the tutorials talk about shifting your block element up and to the left. Anyone have insights into putting a shadow on three or even four sides? | 0 | [
2,
272,
18,
18,
5327,
27,
203,
2570,
800,
3726,
3726,
31,
22,
79,
699,
35,
65,
14,
272,
18,
18,
2804,
3118,
29724,
18,
15,
56,
50,
374,
9,
6200,
15,
31,
376,
20,
442,
21,
3118,
27,
132,
2570,
16,
21,
1921,
4520,
13,
5,
974... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Layer Backed Views and Flickering Controls
===
I have a window which contains an NSBox control. In that NSBox are several other controls, (popups, text fields, etc...)
I have two other NSBox's in the same NIB file that are filled with controls that I would like to swap out with the first under certain conditions. I would like this to happen with a nice cross fade effect, so I do the following:
1. In the NSWindowController's awakeFromNib method:
[[self.myWindow contentView] setWantsLayer:YES];
2. In my method where I'm switching the views I use this code:
[[[self.myWindow contentView] animator] replaceSubview:previousView with:newView];
This works just fine, the views cross fade just as I would expect. The problem is that the controls on the views sometimes disappear for no apparent reason. It's not always the same views (though the NSPopups seem particularly prone to it), and they usually reappear when they have focus.
Do I have to make all of the controls layer backed as well?
| 0 | [
2,
5385,
6334,
4146,
17,
22399,
8671,
800,
3726,
3726,
31,
57,
21,
1463,
56,
1588,
40,
13,
2172,
5309,
569,
9,
19,
30,
13,
2172,
5309,
50,
238,
89,
8671,
15,
13,
5,
6057,
15699,
15,
1854,
2861,
15,
2722,
9,
9,
9,
6,
31,
57,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I create a Kindle and iPod-compatible audiobook file with section markers?
===
I've looked for references on the Audible format, and it appears that people are only interested in cracking/converting *out* of it. I've got a collection of MP3 files that I want to convert into Audible format for use on my Kindle and iPod.
Does anybody have a good reference on the Audible or protected AAC formats and how section markers and metadata are expressed? Better yet, a utility or code sample? | 0 | [
2,
184,
107,
31,
1600,
21,
825,
413,
17,
31,
10670,
8,
20049,
4023,
5199,
3893,
29,
1050,
19482,
60,
800,
3726,
3726,
31,
22,
195,
292,
26,
7231,
27,
14,
22027,
2595,
15,
17,
32,
1780,
30,
148,
50,
104,
3158,
19,
18461,
118,
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... |
ListView - Can you set DataKeyNames when binding to a simple scalar array?
===
I have a case that keeps coming up where I'm using a ListView or similar control with a simple array such as string[].
Is there a way to use the DataKeyNames property when you are binding to simple collections?
| 0 | [
2,
968,
4725,
13,
8,
92,
42,
309,
1054,
4237,
7259,
18,
76,
8728,
20,
21,
1935,
28960,
7718,
60,
800,
3726,
3726,
31,
57,
21,
610,
30,
8968,
880,
71,
113,
31,
22,
79,
568,
21,
968,
4725,
54,
835,
569,
29,
21,
1935,
7718,
145... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Access 2007 VBA Query Shows Data in Query Analyzer But Not in VBA Coded Recordset
===
I have a function I've written that was initially supposed to take a string field and populate an excel spreadsheet with the values. Those values continually came up null. I started tracking it back to the recordset and found that despite the query being valid and running properly through the Access query analyzer the recordset was empty or had missing fields.
To test the problem, I created a sub in which I created a query, opened a recordset, and then paged through the values (outputting them to a messagebox). The most perplexing part of the problem seems to revolve around the "WHERE" clause of the query. If I don't put a "WHERE" clause on the query, the recordset always has data and the values for "DESCRIPTION" are normal.
If I put *anything* in for the WHERE clause the recordset comes back either totally empty (rs.EOF = true) or the Description field is totally blank where the other fields have values. I want to stress again that if I debug.print the query, I can copy/paste it into the query analyzer and get a valid and returned values that I expect.
I'd sure appreciate some help with this. Thank you!
Private Sub NewTest()
' Dimension Variables
'----------------------------------------------------------
Dim rsNewTest As ADODB.Recordset
Dim sqlNewTest As String
Dim Counter As Integer
' Set variables
'----------------------------------------------------------
Set rsNewTest = New ADODB.Recordset
sqlNewTest = "SELECT dbo_partmtl.partnum as [Job/Sub], dbo_partmtl.revisionnum as Rev, " & _
"dbo_part.partdescription as Description, dbo_partmtl.qtyper as [Qty Per] " & _
"FROM dbo_partmtl " & _
"LEFT JOIN dbo_part ON dbo_partmtl.partnum = dbo_part.partnum " & _
"WHERE dbo_partmtl.mtlpartnum=" & Chr(34) & "3C16470" & Chr(34)
' Open recordset
rsNewTest.Open sqlNewTest, CurrentProject.Connection, adOpenDynamic, adLockOptimistic
Do Until rsNewTest.EOF
For Counter = 0 To rsNewTest.Fields.Count - 1
MsgBox rsNewTest.Fields(Counter).Name
Next
MsgBox rsNewTest.Fields("Description")
rsNewTest.MoveNext
Loop
' close the recordset
rsNewTest.Close
Set rsNewTest = Nothing
End Sub | 0 | [
2,
1381,
624,
566,
969,
25597,
1285,
1054,
19,
25597,
16051,
139,
47,
52,
19,
566,
969,
13,
22254,
742,
1198,
800,
3726,
3726,
31,
57,
21,
1990,
31,
22,
195,
642,
30,
23,
1537,
2293,
20,
247,
21,
3724,
575,
17,
1675,
12383,
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... |
Compare memory footprint of .Net and VB6 applications.
===
I've been trying to compare the memory footprint between a VB6 application and .Net application. Trying to determine what's the average difference between the two.
The .Net code is for the most part a direct translation of the VB6 and for the most part has the same instructions as they would be programmed in C#. So while it's an apple to oranges comparison, it's a comparison on programs that are functionally (if not logically) equivalent.
I've been using [Process Explorer][1] to help me determine the usage of memory of the applications, however there are a few areas that have left me perplexed:
1. I've been trying to determine the overall memory consumption. Which of the Process Memory columns should I be using. So far I've been looking at the Working Set ones.
2. For comparing the size of DLL's within an application PExplorer shows Size, WS Total and other WS counters, how can these be interpreted? And why is Size so different from WS Total, shouldn't these be the same?
So far I've gathered that WS Total includes both WS Private and WS Shareable. So using WS Total only can be a deceptive measure. I've also read from questions such as [.Net exe memory footprint][2] that the .Net working set is usually larger than it should be. Would instantiating the process in a memory starved environment, say a VM with 128 MB reduce the working set size to it's minimum?
Any help or insight would be greatly appreciated.
[1]: http://technet.microsoft.com/en-us/sysinternals/bb896653.aspx
[2]: http://stackoverflow.com/questions/223283/net-exe-memory-footprint | 0 | [
2,
11590,
1912,
18511,
16,
13,
9,
2328,
17,
13,
20468,
379,
3767,
9,
800,
3726,
3726,
31,
22,
195,
74,
749,
20,
11590,
14,
1912,
18511,
128,
21,
13,
20468,
379,
3010,
17,
13,
9,
2328,
3010,
9,
749,
20,
3746,
98,
22,
18,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to edit columns in-place with CListCtrl?
===
I want to have CListCtrl.EditLabel() for any column of the list. How can I implement such a feature? | 0 | [
2,
184,
20,
9392,
7498,
19,
8,
5119,
29,
272,
5739,
4812,
6362,
60,
800,
3726,
3726,
31,
259,
20,
57,
272,
5739,
4812,
6362,
9,
69,
242,
21018,
5,
6,
26,
186,
4698,
16,
14,
968,
9,
184,
92,
31,
8713,
145,
21,
1580,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What is a good free online poll/survey app?
===
I need to conduct a survey of 3 questions.
The first question will be Yes/No, the second will have multiple answers, in which you can select multiple answers for just that question, as well as a "other" box that you can fill in an answer.
And the last will be a textarea in which they can enter general comments/suggestions.
I would love for this survey app to have an administration end so I can export results to a standard format and/or be able to view the stats via the interface.
EDIT: PHP/MySQL based. | 0 | [
2,
98,
25,
21,
254,
551,
2087,
4994,
118,
4082,
8704,
4865,
60,
800,
3726,
3726,
31,
376,
20,
3989,
21,
3431,
16,
203,
2346,
9,
14,
64,
1301,
129,
44,
1643,
118,
251,
15,
14,
153,
129,
57,
1886,
6709,
15,
19,
56,
42,
92,
540... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 correct way to deal with procedures that take a "long time" to complete?
===
I have a Winforms application created in Visual Studio 2005 Pro, it connects to an SQL Server 2005 database using the SqlConnection / SqlCommand / SqlDataAdapter classes to extract data. I have stored procedures in my database to return the data to me.
What is the best way to handle queries that take a "long time" to complete? (i.e long enough that the user starts to think something is wrong). Currently my application locks up until the query is complete, or the query times out. Obviously this is unnacceptable.
I'd at least like a progress meter with a "stop" button on it. The progress meter doesn't even have to do anything useful, being a hint to sit patiently and wait would be enough.
Even better would be a warning that said something like "This will return 140,000 rows of data. Do you want to continue?"
I know this probably requires threads, but how? | 0 | [
2,
98,
25,
14,
4456,
161,
20,
1183,
29,
8876,
30,
247,
21,
13,
7,
2701,
85,
7,
20,
1279,
60,
800,
3726,
3726,
31,
57,
21,
628,
4190,
18,
3010,
679,
19,
3458,
1120,
812,
895,
15,
32,
8534,
20,
40,
4444,
255,
8128,
812,
6018,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are there any papers or research results concerning the way people use tags and keywords?
===
I'm working on a tagging system at work, but one thing that I would be interested in is determining what has already been learned about the way people use such systems so that, when using libraries and tools and creating code, I can accommodate the way people do things (or so I hope).
After asking this question, I continued to go through [Google Scholar][1], and I didn't see much of interest. A few interesting papers involve displaying keywords (which helps a little) and automatically finding keywords in a document (not so much in my case).
[1]: http://scholar.google.com/schhp?hl=en&lr= | 0 | [
2,
50,
80,
186,
3747,
54,
527,
1736,
6477,
14,
161,
148,
275,
3383,
18,
17,
1246,
12827,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
3383,
2762,
329,
35,
170,
15,
47,
53,
584,
30,
31,
83,
44,
3158,
19,
25,
13521,
98,
63,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Alternative site to Mike Gunderloy's "The Daily Grind" (Larkware)?
===
As a developer who is always looking for new resources and information, I loved Mike Gunderloy's blog *"The Daily Grind"* on [www.larkware.com][1] *("We get up early, so you don't have to.")*
Unfortunately (for me) Mike decided to discontinue the blog in December 2007. So, my question: is there a similar blog / site which provides such good links and resources on a daily basis? I couldn't find one.
Thanks!
[1]: http://www.larkware.com/ | 0 | [
2,
2676,
689,
20,
1713,
1223,
1157,
10892,
22,
18,
13,
7,
124,
1954,
16913,
7,
13,
5,
3779,
197,
5011,
6,
60,
800,
3726,
3726,
28,
21,
10058,
72,
25,
550,
699,
26,
78,
2566,
17,
676,
15,
31,
2199,
1713,
1223,
1157,
10892,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Recursive control search with Linq
===
If I wanted to find checked check boxes on an ASP.NET page I could use the following Linq.
var checkBoxes = this.Controls.OfType<CheckBox>().TakeWhile<CheckBox>(cb => cb.Checked);
That works fine if the checkboxes are nested in the current control collection, but I'd like to know how to extend the search by drilling down into the control collections of the top-level controls.
The question was asked here:
[Finding controls that use a certain interface in ASP.NET][1]
And received non-Linq answers, I already have my own version of a recursive control search on type and ID as extension methods, but just wondered how easy this is to do in Linq?
[1]: http://stackoverflow.com/questions/28642/finding-controls-that-use-a-certain-interface-in-aspnet | 0 | [
2,
302,
24244,
569,
2122,
29,
6294,
1251,
800,
3726,
3726,
100,
31,
417,
20,
477,
6505,
2631,
8120,
27,
40,
28,
306,
9,
2328,
2478,
31,
110,
275,
14,
249,
6294,
1251,
9,
4033,
2631,
5309,
160,
800,
48,
9,
12898,
18,
9,
1041,
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... |
Can I get the rowcount before executing a stored procedure?
===
I have some complex stored procedures that may return many thousands of rows, and take a long time to complete.
Is there any way to find out how many rows are going to be returned before the query executes and fetches the data?
This is with Visual Studio 2005, a Winforms application and SQL Server 2005. | 0 | [
2,
92,
31,
164,
14,
3131,
16549,
115,
25836,
21,
8214,
7004,
60,
800,
3726,
3726,
31,
57,
109,
1502,
8214,
8876,
30,
123,
788,
151,
3805,
16,
11295,
15,
17,
247,
21,
175,
85,
20,
1279,
9,
25,
80,
186,
161,
20,
477,
70,
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... |
Where is the .asmx when i added a localhost webservice?
===
When i added service -> web service. The vs2008 added a App_WebReferences folder without a .asmx file. I see a .discomap file.
when i use the cascading drop down ajax control, it is looking for .asmx in the service path. am i doing it wrong? i remember the early edition of visual studio added a .asmx file when you added a outside webservice reference. | 0 | [
2,
113,
25,
14,
13,
9,
472,
79,
396,
76,
31,
905,
21,
375,
11694,
2741,
11449,
60,
800,
3726,
3726,
76,
31,
905,
365,
13,
8,
1,
2741,
365,
9,
14,
4611,
2753,
905,
21,
4865,
1,
14113,
28018,
18,
19294,
366,
21,
13,
9,
472,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why does Char(1) change to Char(3) when copying over an Oracle DBLINK?
===
I have 2 databases, and **I want to transport an existing table containing a CHAR column from database A to database B.**
Database A is Oracle 9i, has encoding WE8ISO8859P1, and contains a table "foo" with at least 1 column of type CHAR(1 char). I can not change the table on database A because it is part of a third party setup.
Database B is my own Oracle 10g database, using encoding AL32UTF8 for all kinds of reasons, and I want to copy foo into this database.
I setup a database link from database B to database A. Then I issue the following command:
*create table bar as select * from #link#.foo;*
The data gets copied over nicely, but when I check the types of the columns, I notice that CHAR(1 char) has been converted into CHAR(3 char), and when querying the data in database B, it is all padded with spaces.
I think somewhere underwater, Oracle confuses it's own bytes and chars. CHAR(1 byte) is different from CHAR(1 char) etc. I've read about all that.
**Why does the datatype change into a padded CHAR(3 char) and how do I stop Oracle from doing this?**
| 0 | [
2,
483,
630,
4892,
5,
165,
6,
753,
20,
4892,
5,
240,
6,
76,
4344,
68,
84,
40,
15759,
13,
9007,
6258,
60,
800,
3726,
3726,
31,
57,
172,
6018,
18,
15,
17,
13,
1409,
49,
259,
20,
1739,
40,
3149,
859,
3503,
21,
4892,
4698,
37,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Identifying files for a hot fix/patch
===
We (occasionally!) have to issue hot fixes for our product and do this by reissuing the affected files directly rather than with a new installer. The product has a large number of pieces, some managed code, some unmanaged.
Currently development flags which build artifacts (exes, dlls) need to be shipped in a hot fix. We'd like to be able to identify these automatically by comparing them to the previous build. A simple binary diff doesn't work since the version numbers on all the files have changed as stamping the files with a new number if part of the build.
Are there any tools that will do a more intelligent comparison and decide which files should be included? We'd still have a developer check the list, this is more to catch files the developer didn't think of than the other way around.
(Note: changing the hot fix/build process is not an immediate option, whether or not we should be shipping individual files is a different discussion!) | 0 | [
2,
13785,
6488,
26,
21,
1047,
6098,
118,
23661,
800,
3726,
3726,
95,
13,
5,
111,
6909,
5991,
1326,
187,
6,
57,
20,
1513,
1047,
6098,
160,
26,
318,
2374,
17,
107,
48,
34,
20937,
1666,
68,
14,
4114,
6488,
1703,
864,
119,
29,
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... |
Ruby and linux, prefered setup?
===
Mac's have TextMate as there preferred application for ruby development, but what would be the preferred application for linux? I need something where it's easy to work with multiple files, project structure and setup commands to run my ruby app or if it is one my merb app.Syntax highlighting is also a must.
Now I typically use Vim, but it's not the best for working with multiple files or with a project structure, even with VTreeView plug-in or multiple VIM windows.
So what would you guys suggest?
If you have better plugins to use for VIM feel free to mention them, I'm not ruling at VIM here.
| 0 | [
2,
10811,
17,
13024,
15,
6369,
69,
18161,
60,
800,
3726,
3726,
1572,
22,
18,
57,
1854,
5281,
28,
80,
5981,
3010,
26,
10811,
522,
15,
47,
98,
83,
44,
14,
5981,
3010,
26,
13024,
60,
31,
376,
301,
113,
32,
22,
18,
2010,
20,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL Searching by MAX()
===
select max(DELIVERY_TIMESTAMP) from DOCUMENTS; will return the time that the latest document was delivered. How do I return the other columns for the latest document? For example I want DOC_NAME for the document that was most recently delivered?
I'm not sure how to form the WHERE clause. | 0 | [
2,
4444,
255,
5792,
34,
2049,
5,
6,
800,
3726,
3726,
5407,
2049,
5,
29731,
93,
1,
891,
384,
10158,
6,
37,
4374,
73,
129,
788,
14,
85,
30,
14,
5736,
4492,
23,
4002,
9,
184,
107,
31,
788,
14,
89,
7498,
26,
14,
5736,
4492,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I ignore everything under a folder in Mercurial
===
I am looking for an expression for the .hgignore file, to ignore all files beneath a specified folder.
eg: I would like to ignore all files and folders beneath bin
Actually any advice on how the expressions are formed would be great | 0 | [
2,
184,
92,
31,
7174,
796,
131,
21,
19294,
19,
9046,
3594,
192,
800,
3726,
3726,
31,
589,
699,
26,
40,
1803,
26,
14,
13,
9,
18187,
23565,
99,
3893,
15,
20,
7174,
65,
6488,
2550,
21,
9931,
19294,
9,
12369,
45,
31,
83,
101,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In C#: Add Quotes around string in a comma delimited list of strings
===
This probably has a simple answer, but I must not have had enough coffee to figure it out on my own:
If I had a comma delimited string such as:
string list = "Fred,Sam,Mike,Sarah";
How would get each element and add quotes around it and stick it back in a string like this:
string newList = "'Fred','Sam','Mike','Sarah'";
I'm assuming iterating over each one would be a start, but I got stumped after that.
One solution that is ugly:
int number = 0;
string newList = "";
foreach (string item in list.Split(new char[] {','}))
{
if (number > 0)
{
newList = newList + "," + "'" + item + "'";
}
else
{
newList = "'" + item + "'";
}
number++;
} | 0 | [
2,
19,
272,
5910,
45,
3547,
18901,
140,
3724,
19,
21,
11951,
58,
121,
23012,
968,
16,
7887,
800,
3726,
3726,
48,
910,
63,
21,
1935,
1623,
15,
47,
31,
491,
52,
57,
41,
511,
2364,
20,
1465,
32,
70,
27,
51,
258,
45,
100,
31,
41... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do IDbCommand, IDataReader, or DataTable leak resources if Dispose is not called?
===
When using IDbCommand, IDataReader, or DataTable, can you depend on the destructor to dispose resources, or will these objects leak resources if dispose is not called directly? | 0 | [
2,
107,
31,
9007,
16239,
15,
31,
18768,
10647,
106,
15,
54,
1054,
5924,
11724,
2566,
100,
17913,
25,
52,
227,
60,
800,
3726,
3726,
76,
568,
31,
9007,
16239,
15,
31,
18768,
10647,
106,
15,
54,
1054,
5924,
15,
92,
42,
12547,
27,
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 you invoke the Visual Studio Preprocessor from the command line?
===
I want to implement the solution using the pre-processor described here:
http://stackoverflow.com/questions/100854/reuse-define-statement-from-h-file-in-c-code
Bonus points if you can point me to the docs at MSDN. I'm having trouble finding them... | 0 | [
2,
184,
107,
42,
28371,
14,
3458,
1120,
782,
16835,
248,
37,
14,
1202,
293,
60,
800,
3726,
3726,
31,
259,
20,
8713,
14,
4295,
568,
14,
782,
8,
16835,
248,
745,
235,
45,
7775,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
2480... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Will setting the only reference to null mean it and it's Child threads are garbage collected?
===
I have an application which has to live as a service, I create an object which then spawns off a buch of threads.
If I set the only reference to that object to null will all the child threads get cleaned up? or will I suffer from a memory leak.
Do I have to explicitly terminate all the child threads? | 0 | [
2,
129,
2697,
14,
104,
2801,
20,
16203,
884,
32,
17,
32,
22,
18,
850,
20396,
50,
15024,
3674,
60,
800,
3726,
3726,
31,
57,
40,
3010,
56,
63,
20,
515,
28,
21,
365,
15,
31,
1600,
40,
3095,
56,
94,
13,
22860,
18,
168,
21,
17245... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to create HTTP 301 redirect from Stellent (Oracle UCM) script
===
Is it possible to send a HTTP response with a permanent redirect from a Stellent (now called Oracle UCM) website? We're using version 7.5.2 with iDoc script.
We can use the iDoc function setHttpHeader() to send the Location HTTP header, but how to send the HTTP response code 301, to signal the permanent redirect to the browser?
| 0 | [
2,
184,
20,
1600,
7775,
13,
18979,
302,
14706,
37,
354,
20996,
38,
13,
5,
6055,
5615,
12669,
79,
6,
3884,
800,
3726,
3726,
25,
32,
938,
20,
2660,
21,
7775,
1627,
29,
21,
3032,
302,
14706,
37,
21,
354,
20996,
38,
13,
5,
1387,
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 run an ASP.NET application with verbose debug messages of the ASP.NET runtime
===
How do I configure an ASP.NET application to write **verbose** log messages of what ASP.NET engine itself is doing. What I get with
<trace enabled="true"
pageOutput="false"
requestLimit="10000"
writeToDiagnosticsTrace="true"/>
is just as much as
> [2488] aspx.page: Begin PreInit
> [2488] aspx.page: End PreInit [2488]
> aspx.page: Begin Init [2488]
> Unhandled Execution Error: -- Object
> reference not set to an instance of an
> object.: at ...
>
> ...
>
> [2488] aspx.page: Begin PreInit
> [2488] aspx.page: End PreInit [2488]
> aspx.page: Begin Init [2488]
> aspx.page: End Init [2488] aspx.page:
> Begin InitComplete [2488] aspx.page:
> End InitComplete [2488] aspx.page:
> Begin PreLoad [2488] aspx.page: End
> PreLoad [2488] aspx.page: Begin Load
> [2488] aspx.page: End Load [2488]
> aspx.page: Begin LoadComplete [2488]
> aspx.page: End LoadComplete [2488]
> aspx.page: Begin PreRender [2488]
> aspx.page: End PreRender [2488]
> aspx.page: Begin PreRenderComplete
> [2488] aspx.page: End
> PreRenderComplete [2488] aspx.page:
> Begin SaveState [2488] aspx.page: End
> SaveState [2488] aspx.page: Begin
> SaveStateComplete [2488] aspx.page:
> End SaveStateComplete [2488]
> aspx.page: Begin Render [2488]
> aspx.page: End Render
I there a way to get more verbosity?
What's about the verbosity level of application_folder/logs/ files?
| 0 | [
2,
184,
20,
485,
40,
28,
306,
9,
2328,
3010,
29,
9504,
6641,
121,
16254,
7561,
16,
14,
28,
306,
9,
2328,
485,
891,
800,
3726,
3726,
184,
107,
31,
1065,
15951,
40,
28,
306,
9,
2328,
3010,
20,
2757,
13,
1409,
2304,
10349,
62,
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... |
Best approach to writing a generic installer for a Linux application?
===
We have a Linux server application that is comprised of a number of open-source tools as well as programs we've written ourselves. Ideally we would like to be able to install this application on any common Linux distribution.
In the past, we've written perl scripts to automate installs of this application. Unfortunately, due to idiosyncrasies of different Linux distros, the logic inside these install scripts gets horribly complex, and can change as new versions of each supported distro are released. Maintaining the installer thus becomes one of the most time-intensive parts of the project!
I'm looking for assistance, be it a framework, documentation, code samples, that can make this process less painful. Here are the types of things our installer needs to do:
- Create user/group accounts
- Create directory trees with specific ownership and permissions
- Install open-source applications, potentially compiling them from source during install
- Insert pre-compiled binaries, scripts, config files, and docs into specific directories
- Register init-type startup and shutdown scripts
- Generate encryption keys
- Verify connectivity to a central server | 0 | [
2,
246,
2141,
20,
1174,
21,
12733,
16146,
106,
26,
21,
13024,
3010,
60,
800,
3726,
3726,
95,
57,
21,
13024,
8128,
3010,
30,
25,
12650,
16,
21,
234,
16,
368,
8,
12097,
4672,
28,
134,
28,
1726,
95,
22,
195,
642,
10021,
9,
5628,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 porting issues going from VC8 (VS2005) to VC9 (VS2008)?
===
I have inherited a very large and complex project (actually, a 'solution' consisting of 119 'projects', most of which are DLLs) that was built and tested under VC8 (VS2005), and I have the task of porting it to VC9 (VS2008).
The porting process I used was:
1) Copy the VC8 .sln file and rename it to a VC9 .sln file.
2) Copy all of the VC8 project files, and rename them to VC9 project files.
3) Edit all of the VC9 project files, s/vc8/vc9.
4) Edit the VC9 .sln, s/vc8/vc9/
5) Load the VC9 .sln with VS2008, and let the IDE 'convert' all of the project files.
6) Fix compiler and linker errors until I got a good build.
So far, I have run into the following issues in that last step.
1) A change in the way decorated names are calculated, causing truncation of the names.
This is more than just a warning (http://msdn.microsoft.com/en-us/library/074af4b6.aspx). Libraries built with this warning will not link with other modules. Applying the solution given in MSDN was non-trivial, but doable.
2) A change that does not allow the assignment of zero to an iterator. This is per the spec, and it was fairly easy to find and fix these previously-allowed coding errors. Instead of assignment of zero to an iterator, use the value end().
3) for-loop scope is now per the ANSI standard. Another easy-to-fix problem.
4) More space required for pre-compiled headers. In some cases a LOT more space was required. I ended up using /Zm999 to provide the maximum PCH space. If PCH memory usage gets bumped up again, I assume that I will have to forgo PCH altogether, and just endure the increase in what is already a very long build time.
5) A change in requirements for copy ctors and default dtors. It appears that in template classes, under certain conditions that I haven't quite figured out yet, the compiler no longer generates a default ctor or a default dtor. I suspect this is a bug in VC9, but there may be something else that I'm doing wrong. If so, I'd sure like to know what it is.
6) The GUIDs in the sln and vcproj files were not changed. This does not appear to impact the build in any way that I can detect, but it is worrisome nevertheless.
Note that despite all of these issues, the project built, ran, and passed extensive QA testing under VC8. I have also back-ported all of the changes to the VC8 projects, where they still build and run just as happily as they did before (using VS2005/VC8). So, all of my changes required for a VC9 build at least appear to be backward-compatible, although the regression testing is still underway.
Now for the really hard problem: I have run into a difference in the startup sequence between VC8 and VC9 projects. The program uses a small-object allocator modeled after Loki, in Andrei Alexandrescu's Book *Modern C++ Design*. This allocator is initialized using a global variable defined in the main program module.
Under VC8, this global variable is constructed at the very beginning of the program startup, from code in a module crtexe.c. Under VC9, the first module that executes is crtdll.c, which indicates that the startup sequence has been changed. The DLLs that are starting up appear to be confusing the small-object allocator by allocating and deallocating memory before the global object can initialize the statistics, which leads to some spurious diagnostics. The operation of the program does not appear to be materially affected, but the QA folks will not allow the spurious diagnostics to get past them.
Is there some way to force the construction of a global object prior to loading DLLs? | 0 | [
2,
98,
50,
14,
1295,
68,
1549,
228,
37,
13,
8990,
457,
13,
5,
710,
18,
2835,
6,
20,
13,
8990,
518,
13,
5,
710,
18,
2753,
6,
60,
800,
3726,
3726,
31,
57,
7179,
21,
253,
370,
17,
1502,
669,
13,
5,
15661,
15,
21,
13,
22,
18... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Design Pattern to apply conversion to multiple properties in multiple classes
===
I am using the WMD markdown editor in a project for a large number of fields that correspond to a large number of properties in a large number of Entity classes. Some classes may have multiple properties that require the markdown.
I am storing the markdown itself since this makes it easier to edit the fields later. However, I need to convert the properties to HTML for display later on. The question is: is there some pattern that I can use to avoid writing markdown conversion code in all my entity classes?
I created a utility class with a method that accepts a markdown string and returns the HTML. I am using markdownj and this works fine.
The problem is for each property of each class that stores markdown I may need another method that converts to HTML:
public class Course{
private String description;
.
.
.
public String getDescription(){
return description;
}
public String getDescriptionAsHTML(){
return MarkdownUtil.convert(getDescription());
}
.
.
.
}
The problem there is that if the Course class has 2 more properties Tuition and Prerequisites say, that both need converters then I will have to write getTuitionAsHTML() and getPrerequisiteAsHTML().
I find that a bit ugly and would like a cleaner solution. The classes that require this are not part of a single inheritance hierarchy.
The other option I am considering is doing this in the controller rather than the model. What are your thoughts on this?
Thanks. | 0 | [
2,
704,
3732,
20,
5645,
6263,
20,
1886,
3704,
19,
1886,
2684,
800,
3726,
3726,
31,
589,
568,
14,
19312,
43,
943,
2968,
1835,
19,
21,
669,
26,
21,
370,
234,
16,
2861,
30,
14217,
20,
21,
370,
234,
16,
3704,
19,
21,
370,
234,
16,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
IDE for HP Calculator Programming?
===
Typing in programs longer than 50 characters got old really fast on my HP49g+.
What IDEs are designed for programming HP calculators? Are there any plugins to Visual Studio, Eclipse, xCode, etc. for this purpose? | 0 | [
2,
13,
3448,
26,
5301,
28539,
3143,
60,
800,
3726,
3726,
25266,
19,
1726,
1045,
119,
1222,
1766,
330,
315,
510,
1512,
27,
51,
5301,
3624,
263,
2430,
9,
98,
13,
8153,
50,
1006,
26,
3143,
5301,
28539,
18,
60,
50,
80,
186,
10922,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0... |
Turn off power saving options via command line
===
On Windows XP, the following command in a script will prevent any power saving options from being enabled on the PC (monitor sleep, HD sleep, etc.). This is useful for kiosk applications.
powercfg.exe /setactive presentation
What is the equivalent on Vista? | 0 | [
2,
805,
168,
414,
7599,
6368,
1197,
1202,
293,
800,
3726,
3726,
27,
1936,
23045,
15,
14,
249,
1202,
19,
21,
3884,
129,
2501,
186,
414,
7599,
6368,
37,
142,
9338,
27,
14,
5168,
13,
5,
2111,
242,
248,
1742,
15,
8590,
1742,
15,
272... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I use recursion in a Sql Server 2005 View?
===
I tried to user OPTION (MAXRECURSION 0) in a view to generate a list of dates.
This seems to be unsupported. Is there a workaround for this issue? | 0 | [
2,
92,
31,
275,
26604,
5991,
19,
21,
4444,
255,
8128,
812,
1418,
60,
800,
3726,
3726,
31,
794,
20,
4155,
4255,
13,
5,
8304,
99,
4734,
5991,
713,
6,
19,
21,
1418,
20,
7920,
21,
968,
16,
4076,
9,
48,
2206,
20,
44,
367,
24909,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Error: The Side-by-Side configuration information in "BLAH.EXE" contains errors.
===
This is the error Dependency Walker gives me on an executable that I am building with VC++ 2005 Express Edition. When trying to run the .exe, I get:
This application has failed to start because the application configuration is incorrect. Reinstalling the application may fix this problem.
(I am new to the manifest/SxS/etc. way of doing things post VC++ 2003.) | 0 | [
2,
7019,
45,
14,
270,
8,
779,
8,
1416,
8091,
676,
19,
13,
7,
220,
9396,
9,
1706,
62,
7,
1588,
11908,
9,
800,
3726,
3726,
48,
25,
14,
7019,
26835,
3764,
2352,
55,
27,
40,
1396,
17194,
5924,
30,
31,
589,
353,
29,
13,
8990,
205... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Converting audio to CAF format for playback on iPhone using OpenAL
===
I am using the SoundEngine sample code from Apple in the CrashLanding sample to play back multiple audio files. Using the sample caf files included with CrashLanding everything works fine but when I try and use my own samplesconverted to CAF using afconvert all I get is a stony silence ;)
Does anyone have settings for afconvert that will produce a CAF file capable of being played back through OpenAL? | 0 | [
2,
19583,
4023,
20,
1658,
410,
2595,
26,
21306,
27,
21024,
568,
368,
192,
800,
3726,
3726,
31,
589,
568,
14,
646,
16847,
5717,
1797,
37,
4037,
19,
14,
4597,
618,
68,
5717,
20,
418,
97,
1886,
4023,
6488,
9,
568,
14,
5717,
1658,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best approach for maintaining a quality assurance server for several mid tier clients
===
We are getting to the point where we have several mid tier clients that could benefit from a QA server, but none can afford to pay for a dedicated QA box as well as a dedicated production box. I've been toying with the idea of a virtual environment, either hosted in our office or with a third-party, that several clients could hit to view work in progress that would offset the total cost. Most of these sites will be a LAMP stack, but there is the potential every long once in a great while that a .NET or Java site would be thrown into the mix. I'm looking for a solid approach, but obviously not full implementation details. | 0 | [
2,
246,
2141,
26,
8215,
21,
2190,
16473,
8128,
26,
238,
907,
7197,
7421,
800,
3726,
3726,
95,
50,
1017,
20,
14,
454,
113,
95,
57,
238,
907,
7197,
7421,
30,
110,
4234,
37,
21,
7234,
8128,
15,
47,
2369,
92,
7829,
20,
1372,
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,
1,
1... |
Best practices on answering dogfood excuses
===
Dogfooding is using your own software. Sometimes that is impossible (software for fighter pilots.) More often it is possible, but doesn't happen anyway.
A couple of "Our users won't experience that problem so it can't be a dogfooding bug," and quickly the practicalities of dogfooding go down so far no one does it.
What are the best practices about getting dogfooding to actually happen? | 4 | [
2,
246,
5242,
27,
11777,
1952,
20652,
6658,
18,
800,
3726,
3726,
1952,
20652,
68,
25,
568,
154,
258,
2306,
9,
1030,
30,
25,
3992,
13,
5,
12980,
5011,
26,
3580,
8114,
9,
6,
91,
478,
32,
25,
938,
15,
47,
1437,
22,
38,
2384,
2774... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.Net Converting a number from one culture to another
===
Quick question --
In .Net (VB more specifically, but that doesn't really matter), is there a way to change the format of a number from one culture to another strictly through the that number's type?
The issue is this: In English, the number is say, 123.45. Whereas in Sweden, the number would be 123,45
Is there a way to convert 123,45 to 123.45 without having to convert it to a string (and then use the formatting methods) then convert it back to the correct type (single, double, etc)?
Thanks | 0 | [
2,
13,
9,
2328,
19583,
21,
234,
37,
53,
1365,
20,
226,
800,
3726,
3726,
2231,
1301,
13,
8,
8,
19,
13,
9,
2328,
13,
5,
20468,
91,
3524,
15,
47,
30,
1437,
22,
38,
510,
1161,
6,
15,
25,
80,
21,
161,
20,
753,
14,
2595,
16,
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... |
Can take be used in query expressions in c# linq?
===
I'm trying to write some LINQ To SQL code that would generate SQL like
SELECT t.Name, g.Name
FROM Theme t
INNER JOIN (
SELECT TOP 5 * FROM [Group] ORDER BY TotalMembers
) as g ON t.K = g.ThemeK
So far I have
var q = from t in dc.Themes
join g in dc.Groups on t.K equals g.ThemeK into groups
select new {
t.Name, Groups = (from z in groups orderby z.TotalMembers select z.Name )
};
but I need to do a top/take on the ordered groups subquery. According to [http://blogs.msdn.com/vbteam/archive/2008/01/08/converting-sql-to-linq-part-7-union-top-subqueries-bill-horst.aspx][1] in VB I could just add TAKE 5 on the end, but I can't get this syntax to work in c#. How do you use the take syntax in c#?
edit: PS adding .Take(5) at the end causes it to run loads of individual queries
[1]: http://blogs.msdn.com/vbteam/archive/2008/01/08/converting-sql-to-linq-part-7-union-top-subqueries-bill-horst.aspx | 0 | [
2,
92,
247,
44,
147,
19,
25597,
13832,
19,
272,
5910,
6294,
1251,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
2757,
109,
6294,
1251,
20,
4444,
255,
1797,
30,
83,
7920,
4444,
255,
101,
5407,
13,
38,
9,
7259,
15,
489,
9,
7259,
37,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Flash steals browser focus
===
I have a flash app in my page, and when a user interacts with the flash app, the browser/html/javascript stops receiving keyboard input.
For example, in Firefox control-t no longer opens a new tab.
However, if I click on part of the page that isn't flash, the browser starts receiving these events again.
Is there anyway to programatically (either through flash or javascript) to return focus to the browser?
I've tried giving focus to a form field through javascript, but that approach doesn't seem to be working.
| 0 | [
2,
4433,
18836,
16495,
1776,
800,
3726,
3726,
31,
57,
21,
4433,
4865,
19,
51,
2478,
15,
17,
76,
21,
4155,
10001,
18,
29,
14,
4433,
4865,
15,
14,
16495,
118,
15895,
118,
1004,
1385,
8741,
6604,
3396,
8896,
6367,
9,
26,
823,
15,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to create an SQL Compact 2008 application
===
How can I make a SQL Compact 2008 application for the desktop? I know how to connect to a .SDF file with SQL Management Studio 2008, but I can't figure out how to connect to it with my app. I have seen tutorials about this and I can see in the C# code they are referencing some special namespaces, but I can't seem to get it to work. What I did is download the Microsoft SQL Compact SDK but I get an error whenever I try to add references to any of the DLL's that came with it. Does anyone know where I can find the correct binaries for this. | 0 | [
2,
184,
20,
1600,
40,
4444,
255,
8285,
570,
3010,
800,
3726,
3726,
184,
92,
31,
233,
21,
4444,
255,
8285,
570,
3010,
26,
14,
17404,
60,
31,
143,
184,
20,
6379,
20,
21,
13,
9,
18,
8736,
3893,
29,
4444,
255,
1097,
1120,
570,
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... |
detecting JSON loaded by browser
===
I have an application in which most requests are submitted via AJAX, though some are submitted via "regular" HTTP requests. If a request is submitted and the user's session has timed out, the following JSON is returned:
{"authentication":"required"}
The JavaScript function which submits all AJAX requests handles this response by showing a popup message and redirecting the user back to the login page.
However, when a non-AJAX request receives this response the JSON is simply shown in the browser because the response is processed directly by the browser (i.e. the aforementioned JavaScript function is bypassed). Obviously this is not ideal and I would like the non-AJAX requests that receive this response to behave the same as the AJAX requests. In order to achieve this, I can think of 2 options:
1. Go through the application and convert all the requests to AJAX requests. This would work, but could also take a long time!
2. The JSON shown above is generated by a very simple JSP. I'm wondering if it might be possible to add a JavaScript event handler to this JSP which is run just before the content is displayed in the browser - I'm assuming this would never be called for AJAX requests? This handler could call the other JavaScript code that displays the popup and performs the redirection.
If anyone knows how exactly I can implement the handler I've outlined in (2), or has any other potential solutions, I'd be very grateful if they'd pass them on.
Cheers,
Don
| 0 | [
2,
9092,
68,
487,
528,
8572,
34,
16495,
800,
3726,
3726,
31,
57,
40,
3010,
19,
56,
127,
12279,
50,
7368,
1197,
20624,
15,
362,
109,
50,
7368,
1197,
13,
7,
25049,
7,
7775,
12279,
9,
100,
21,
3772,
25,
7368,
17,
14,
4155,
22,
18... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
One man bugtracker?
===
Recently I've been doing lots of weekend coding, and have began to really need a bugtracker as things are gaining speed. This is probably the worst case scenario because I basically have to let things cool down over the week,so I simply can't remember the bugs in my head. So far I've been using a text file to jot down bugs,but I'd rather use something a bit better.
The biggest points here are ease of use and very little setup time.Don't want to spend more than an hour learning the basics and trying to install something. Also in my case I'm on a Mac so that would help, but solutions for other platforms are welcomed as they will likely help others. | 0 | [
2,
53,
169,
6256,
4792,
106,
60,
800,
3726,
3726,
1989,
31,
22,
195,
74,
845,
7503,
16,
4010,
13,
15458,
15,
17,
57,
260,
20,
510,
376,
21,
6256,
4792,
106,
28,
564,
50,
8299,
1362,
9,
48,
25,
910,
14,
4126,
610,
12705,
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... |
Change the coordinate system of a Canvas in WPF.
===
I'm writing a mapping app that uses a Canvas for positioning elements. For each element I have to programatically convert element's Lat/Long to the canvas' coordinate, then set the Canvas.Top and Canvas.Left properties.
If I had a 360x180 Canvas, can I convert the coordinates on the canvas to go from -180 to 180 rather than 0 to 360 on the X axis and 90 to -90 rather than 0 to 180 on the Y axis? | 0 | [
2,
753,
14,
15154,
329,
16,
21,
9696,
19,
619,
7721,
9,
800,
3726,
3726,
31,
22,
79,
1174,
21,
13305,
4865,
30,
2027,
21,
9696,
26,
649,
68,
2065,
9,
26,
206,
4520,
31,
57,
20,
625,
721,
8438,
8406,
4520,
22,
18,
14303,
118,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to I display a sort arrow in the header of a list view column using C#?
===
How can I display a sort arrow in the header of the sorted column in a list view which follows the native look of the operating system? | 0 | [
2,
184,
20,
31,
3042,
21,
2058,
7409,
19,
14,
157,
106,
16,
21,
968,
1418,
4698,
568,
272,
5910,
60,
800,
3726,
3726,
184,
92,
31,
3042,
21,
2058,
7409,
19,
14,
157,
106,
16,
14,
22554,
4698,
19,
21,
968,
1418,
56,
2415,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Automake : what are the valid values for *_la_LDFLAGS in Makefile.am?
===
I am wondering what are the possible value for *\_la_LDFLAGS in Makefile.am ?
If I ask this question, it is because I would like the following :
Actual shared library : libA.so (or with the version number I don't care)
Symbolic links : libA-X.Y.Z.so, libA-X.so, libA.so
soname : libA-X.so
However here is what I get by using the *-release* flag :
Actual shared library : libA-X.Y.Z.so
Symbolic links : libA.so
soname : libA-X.Y.Z.so !!! this is not what I want
I also tried with no flags at all and got
Actual shared library : libA-0.0.0.so !!! 0.0.0 and not the real version
Symbolic links : libA.so, libA-0.so
soname : libA-0.so !!! 0.0.0 and not the real version
How should I do ? which flag should I use ?
Thanks in advance | 0 | [
2,
3108,
11115,
13,
45,
98,
50,
14,
7394,
4070,
26,
1637,
1,
531,
1,
6252,
22868,
18,
19,
233,
16877,
9,
765,
60,
800,
3726,
3726,
31,
589,
5712,
98,
50,
14,
938,
1923,
26,
1637,
1,
531,
1,
6252,
22868,
18,
19,
233,
16877,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to write a basic operating system?
===
Let me know how i can create a basic operating system.
What books recommend?
| 0 | [
2,
184,
20,
2757,
21,
2125,
2455,
329,
60,
800,
3726,
3726,
408,
55,
143,
184,
31,
92,
1600,
21,
2125,
2455,
329,
9,
98,
964,
12360,
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... | [
1,
1,
1,
1,
1,
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... |
How NULLs are stored into a database ?
===
I'm curious to know how NULLs are stored into a database ?
It surely depends on the database server but I would like to have an general idea about it.
***
First try:
Suppose that the server put a undefined value (could be anything) into the field for a NULL value.
Could you be very lucky and retrieve the NULL value with
...WHERE field = 'the undefined value (remember, could be anything...)'
***
Second try:
Does the server have a flag or any meta-data somewhere to indicate this field is NULL ?
Then the server must read this meta data to verify the field.
If the meta-data indicates a NULL value and if the query doesn't have "field IS NULL",
then the record is ignored.
***
It seems too easy...
| 0 | [
2,
184,
16203,
18,
50,
8214,
77,
21,
6018,
13,
60,
800,
3726,
3726,
31,
22,
79,
7686,
20,
143,
184,
16203,
18,
50,
8214,
77,
21,
6018,
13,
60,
32,
7608,
9597,
27,
14,
6018,
8128,
47,
31,
83,
101,
20,
57,
40,
297,
882,
88,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Help with sql join
===
I have two tables:
Table 1:
ID, PersonCode, Name,
Table 2:
ID, Table1ID, Location, ServiceDate
I've got a query joining table 1 to table 2 on table1.ID = table2.Table1ID where PersonCode = 'XYZ'
What I want to do is return Table1.PersonCode,Table1.Name, Table2.Location, Table2.ServiceDate, I don't want all rows, In table 2 I'm only interested in the row with the most recent ServiceDate for each location. How would I go about doing this? | 0 | [
2,
448,
29,
4444,
255,
1865,
800,
3726,
3726,
31,
57,
81,
7484,
45,
859,
6352,
4924,
15,
840,
9375,
15,
204,
15,
859,
4274,
4924,
15,
859,
165,
1340,
15,
1474,
15,
365,
8209,
31,
22,
195,
330,
21,
25597,
3765,
859,
137,
20,
85... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a good tool/method to find which files on disk have been changed after a program has been run?
===
I'm experiencing a strange issue where my Visual Studio 2005 C++ program crashes the first time it runs after a new build. I'm having a difficult time debugging this intermittent issue and I suspect it's somehow related to a file somewhere on my hard drive that is being changed. If I can find the file(s), that might provide some more insight into this issue. Are there any good tools for observing which files are being created/deleted/modified when a specific program is run?
Thanks in advance! | 0 | [
2,
98,
22,
18,
21,
254,
5607,
118,
5909,
1807,
43,
20,
477,
56,
6488,
27,
8582,
57,
74,
1015,
75,
21,
625,
63,
74,
485,
60,
800,
3726,
3726,
31,
22,
79,
15138,
21,
2578,
1513,
113,
51,
3458,
1120,
812,
272,
20512,
625,
21563,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 C# auto formatter that I can use to define custom rules for formatting?
===
My group has a source analysis tool that enforces certain styles that we have to comply with. I can't change it, and some of the rules are just a pain. One example is that all properties have to come before methods, and all constructors must come before properties. It seems silly to me that I have to take time to do something to the program when to the compiler it is the same. I would like some thing that is a plugin to VS that will let me do things like this automatically. Also, it would be nice to have it automatically put using's inside the namespace block. | 0 | [
2,
25,
80,
21,
272,
5910,
3108,
26,
24700,
30,
31,
92,
275,
20,
9267,
5816,
1761,
26,
2595,
1203,
60,
800,
3726,
3726,
51,
214,
63,
21,
1267,
2495,
5607,
30,
16525,
18,
1200,
6443,
30,
95,
57,
20,
14665,
29,
9,
31,
92,
22,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# dictionaries ValueOrNull / ValueorDefault
===
Currently I'm using
var x = dict.ContainsKey(key) ? dict[key] : defaultValue
I'd like some way to have dictionary[key] return null for nonexistant keys, so I could write something like
var x = dict[key] ?? defaultValue;
this also winds up being part of linq queries etc. so I'd prefer one-line solutions.
| 0 | [
2,
272,
5910,
29783,
1923,
248,
4215,
211,
13,
118,
1923,
248,
13862,
9708,
800,
3726,
3726,
871,
31,
22,
79,
568,
4033,
993,
800,
13,
16315,
9,
1126,
5851,
18,
4237,
5,
4237,
6,
13,
60,
13,
16315,
2558,
4237,
500,
13,
45,
12838... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
One gridview - two datasources?
===
I am working on a co-workers website, and he mistakenly put up a gridview that shows a TypeID instead of the TypeName. I want to put the actual NAME of the type, instead of it's arbitrary ID number, like he has it. I see he has two "ObjectDataSource"'s on the page -- one for Type and one for Item. Items contains the ID of what TYPE the item is, which is all in the Items datasource. He is pulling this ID to populate the gridview. I want to use that ID to pull the NAME form the other data source, and place that NAME into the gridview for that specific column. Can this be done? Can I use two different datasources on a gridview? | 0 | [
2,
53,
7354,
4725,
13,
8,
81,
1054,
12097,
18,
60,
800,
3726,
3726,
31,
589,
638,
27,
21,
326,
8,
16355,
2271,
15,
17,
24,
23745,
442,
71,
21,
7354,
4725,
30,
1285,
21,
1001,
1340,
700,
16,
14,
1001,
7259,
9,
31,
259,
20,
44... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Filter Extensions in HTML form upload
===
I have a simple HTML upload form, and I want to specify a default extension ("*.drp" for example). I've read that the way to do this is through the ACCEPT attribute of the input tag, but I don't know how exactly.
<form enctype="multipart/form-data" action="uploader.php" method="POST">
Upload DRP File:
<input name="Upload Saved Replay" type="file" accept="*.drp"/><br />
<input type="submit" value="Upload File" />
</form>
| 0 | [
2,
11945,
17529,
19,
13,
15895,
505,
71,
8294,
800,
3726,
3726,
31,
57,
21,
1935,
13,
15895,
71,
8294,
505,
15,
17,
31,
259,
20,
19077,
21,
12838,
3896,
13,
5,
7,
2483,
9,
43,
6952,
7,
26,
823,
6,
9,
31,
22,
195,
1302,
30,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I get the active screen’s dimensions?
===
What I am looking for is the equivalent of System.Windows.SystemParameters.WorkArea for the monitor that the window is currently on. | 0 | [
2,
184,
92,
31,
164,
14,
1348,
2324,
1,
18,
9913,
60,
800,
3726,
3726,
98,
31,
589,
699,
26,
25,
14,
4602,
16,
329,
9,
27508,
18,
9,
10724,
6351,
7307,
18,
9,
3783,
17760,
26,
14,
7626,
30,
14,
1463,
25,
871,
27,
9,
3,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Access parent property in jQuery callback
===
Unsure if I've phrased this correctly, but in the callback how do I reference the controls property of the base class?
This has been bugging me for some time and I usually work around it, but I'd be grateful if anybody can enlighten me on how I should do this properly.
var base = function() {
var controls = {};
return {
init: function(c) {
this.controls = c
},
foo: function(args) {
this.init(args.controls);
$(this.controls.DropDown).change(function() {
$(this.controls.PlaceHolder).toggle();
});
}
}
};
Much Obliged,
Paul | 0 | [
2,
1381,
4766,
1354,
19,
487,
8190,
93,
645,
1958,
800,
3726,
3726,
13815,
100,
31,
22,
195,
6845,
43,
48,
12044,
15,
47,
19,
14,
645,
1958,
184,
107,
31,
2801,
14,
8671,
1354,
16,
14,
1000,
718,
60,
48,
63,
74,
6256,
2762,
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... |
license expired error when dealing with dynamic generated excel docs using asp.net
===
Anyone familiar with error below? When I run my webapp to generate a dynamic excel doc from my local machine it works fine but when the same piece of code is invoked on the server I get the below error. It seems like it's a permissions issues since it works on my machine but not the server but I don't know where to start in order to pinpoint the problem. Any guidance/help is greatly appreciated!
Server Error in '/' Application.
--------------------------------------------------------------------------------
This command is unavailable because the license to use this application has expired.
Description: An unhandled exception occurred during the execution of the current web request. Please review the stack trace for more information about the error and where it originated in the code.
Exception Details: System.Runtime.InteropServices.COMException: This command is unavailable because the license to use this application has expired.
Source Error:
An unhandled exception was generated during the execution of the current web request. Information regarding the origin and location of the exception can be identified using the exception stack trace below.
Stack Trace:
[COMException (0x800a03ec): This command is unavailable because the license to use this application has expired.]
Microsoft.Office.Interop.Excel.Workbooks.Add(Object Template) +0
PaymentsReport.Page_Load(Object sender, EventArgs e) +70
System.Web.Util.CalliHelper.EventArgFunctionCaller(IntPtr fp, Object o, Object t, EventArgs e) +15
System.Web.Util.CalliEventHandlerDelegateProxy.Callback(Object sender, EventArgs e) +34
System.Web.UI.Control.OnLoad(EventArgs e) +99
System.Web.UI.Control.LoadRecursive() +47
System.Web.UI.Page.ProcessRequestMain(Boolean includeStagesBeforeAsyncPoint, Boolean includeStagesAfterAsyncPoint) +1061 | 0 | [
2,
3962,
15524,
7019,
76,
5746,
29,
7782,
6756,
20700,
9765,
18,
568,
28,
306,
9,
2328,
800,
3726,
3726,
1276,
3694,
29,
7019,
1021,
60,
76,
31,
485,
51,
2741,
7753,
20,
7920,
21,
7782,
20700,
9765,
37,
51,
375,
1940,
32,
693,
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... |
Preserve JTable selection across TableModel change
===
We're seeing JTable selection get cleared when we do a fireTableDataChanged() or fireTableRowsUpdated() from the TableModel.
Is this expected, or are we doing something wrong? I haven't personally done close code review. I'm working from a report from another developer.
If this is default behavior, is there a good way to prevent this? Some way to "lock" the selection before the update and unlock after?
The developer has been experimenting with saving the selection before the update and re-applying it. It's a little slow.
This is Java 1.4.2 on Windows XP, if that matters. We're limited to that version based on some vendor code we use. | 0 | [
2,
6224,
487,
5924,
3155,
464,
859,
13998,
753,
800,
3726,
3726,
95,
22,
99,
2078,
487,
5924,
3155,
164,
4895,
76,
95,
107,
21,
535,
5924,
18768,
16229,
43,
5,
6,
54,
535,
5924,
5417,
18,
576,
43,
1669,
5,
6,
37,
14,
859,
1399... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SVN Repository Search
===
Is there any good software that will allow me to search through my SVN respository for code snippets? I found 'FishEye' but the cost is 1,200 and well outside my budget. | 0 | [
2,
13,
18,
16578,
24869,
2122,
800,
3726,
3726,
25,
80,
186,
254,
2306,
30,
129,
1655,
55,
20,
2122,
120,
51,
13,
18,
16578,
10719,
14882,
14599,
26,
1797,
13,
29061,
18,
60,
31,
216,
13,
22,
4934,
9374,
22,
47,
14,
1516,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
MySQL Joins
===
My table structure looks like this:
tbl.users tbl.issues
+--------+-----------+ +---------+------------+-----------+
| userid | real_name | | issueid | assignedid | creatorid |
+--------+-----------+ +---------+------------+-----------+
| 1 | test_1 | | 1 | 1 | 1 |
| 2 | test_2 | | 2 | 1 | 2 |
+--------+-----------+ +---------+------------+-----------+
Basically I want to write a query that will end in a results table looking like this:
(results table)
+---------+------------+---------------+-----------+--------------+
| issueid | assignedid | assigned_name | creatorid | creator_name |
+---------+------------+---------------+-----------+--------------+
| 1 | 1 | test_1 | 1 | test_1 |
| 2 | 1 | test_1 | 2 | test_2 |
+---------+------------+---------------+-----------+--------------+
My SQL looks like this at the moment:
SELECT
`issues`.`issueid`,
`issues`.`creatorid`,
`issues`.`assignedid`,
`users`.`real_name`
FROM `issues`
JOIN `users` ON ( `users`.`userid` = `issues`.`creatorid` )
OR (`users`.`userid` = `issues`.`assignedid`)
ORDER BY `issueid` ASC
LIMIT 0 , 30
This returns something like this:
(results table)
+---------+------------+-----------+-----------+
| issueid | assignedid | creatorid | real_name |
+---------+------------+-----------+-----------+
| 1 | 1 | 1 | test_1 |
| 2 | 1 | 2 | test_1 |
| 2 | 1 | 2 | test_2 |
+---------+------------+-----------+-----------+
Can anyone help me get to the desired results table?
Thanks,
Ross | 0 | [
2,
51,
18,
22402,
10612,
800,
3726,
3726,
51,
859,
1411,
1879,
101,
48,
45,
13,
38,
6287,
9,
16704,
18,
13,
38,
6287,
9,
12565,
18,
2754,
8,
8,
8,
8,
8,
8,
8,
8,
2430,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
2430,
2754,
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... |
Crossplatform Bidirectional IPC
===
I have a project that I thought was going to be relatively easy, but is turning out to be more of a pain that I had hoped. First, most of the code I'm interacting with is legacy code that I don't have control over, so I can't do big paradigm changes.
Here's a simplified explanation of what I need to do: Say I have a large number of simple programs that read from stdin and write to stdout. (These I can't touch). Basically, input to stdin is a command like "Set temperature to 100" or something like that. And the output is an event "Temperature has been set to 100" or "Temperature has fallen below setpoint".
What I'd like to do is write an application that can start a bunch of these simple programs, watch for events and then send commands to them as necessary. My initial plan was to something like popen, but I need a bidrectional popen to get both read and write pipes. I hacked something together that I call popen2 where I pass it the command to run and two FILE* that get filled with the read and write stream. Then all I need to do is write a simple loop that reads from each of the stdouts from each of the processes, does the logic that it needs and then writes commands back to the proper process.
Here's some pseudocode
FILE *p1read, *p1write;
FILE *p2read, *p2write;
FILE *p3read, *p3write;
//start each command, attach to stdin and stdout
popen2("process1",&p1read,&p1write);
popen2("process2",&p2read,&p2write);
popen2("process3",&p3read,&p3write);
while (1)
{
//read status from each process
char status1[1024];
char status2[1024];
char status3[1024];
fread(status1,1024,p1read);
fread(status2,1024,p2read);
fread(status3,1024,p3read);
char command1[1024];
char command2[1024];
char command3[1024];
//do some logic here
//write command back to each process
fwrite(command1,p1write);
fwrite(command2,p2write);
fwrite(command3,p3write);
}
The real program is more complicated where it peeks in the stream to see if anything is waiting, if not, it will skip that process, likewise if it doesn't need to send a command to a certain process it doesn't. But this code gives the basic idea.
Now this works great on my UNIX box and even pretty good on a Windows XP box with cygwin. However, now I need to get it to work on Win32 natively.
The hard part is that my popen2 uses fork() and execl() to start the process and assign the streams to stdin and stdout of the child processes. Is there a clean way I can do this in windows? Basically, I'd like to create a popen2 that works in windows the same way as my unix version. This way the only windows specific code would be in that function and I could get away with everything else working the same way.
Any Ideas?
Thanks! | 0 | [
2,
919,
27035,
1732,
19393,
31,
5779,
800,
3726,
3726,
31,
57,
21,
669,
30,
31,
289,
23,
228,
20,
44,
3109,
2010,
15,
47,
25,
2101,
70,
20,
44,
91,
16,
21,
1257,
30,
31,
41,
3691,
9,
64,
15,
127,
16,
14,
1797,
31,
22,
79,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Global.asax called dozens of times/second by same IP
===
I noticed in my custom application log that I had 600 requests to Global.asax within a few minutes, while no other users were using the application. They all came from an IP address of a known application user, so I don't think it's an attack of any kind. I generate log entires in a custom SQL Server database at the entrance of every public sub or function, so I can see where requests are coming from.
I was wondering if anybody has seen something like this before, or would know why either IE or IIS/ASP.NET might exhibit this sort of behavior. I don't see any corresponding entries in any event logs, and even more strange, I don't even see a single request from this user in the IIS logs themselves. Any thoughts?
NOTE: this happened only once, a few days ago, and was over a few minutes after it started. It happened during business hours for that user (England), but after-hours for us, so it's likely he was the only user in the application at the time. | 0 | [
2,
2062,
9,
8588,
396,
227,
10273,
16,
436,
118,
5007,
34,
205,
15735,
800,
3726,
3726,
31,
2711,
19,
51,
5816,
3010,
6738,
30,
31,
41,
7316,
12279,
20,
2062,
9,
8588,
396,
363,
21,
310,
902,
15,
133,
90,
89,
3878,
46,
568,
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... |
Help with SQL query (Joining views?)
===
I have a table with columns
> Index, Date
where an Index may have multiple Dates, and my goal is the following: select a list that looks like
> Index, MinDate, MaxDate
where each Index is listed only once, and MinDate (MaxDate) represents the earliest (latest) date present _in the entire table_. That's easy enough, but then let's constrain this list to appear only for Indexes that are present in a given range of dates.
So far, I have the following:
SELECT
Index,
MIN([Date]),
MAX([Date])
FROM myTable
WHERE
Index IN
(SELECT Index From myTable WHERE [Date] BETWEEN '1/1/2000' AND '12/31/2000')
GROUP BY Index
ORDER BY Index ASC
This is excruciatingly slow. Any way to speed this up? [I am running SQL Server 2000.]
Thanks! | 0 | [
2,
448,
29,
4444,
255,
25597,
13,
5,
1636,
108,
68,
4146,
60,
6,
800,
3726,
3726,
31,
57,
21,
859,
29,
7498,
13,
1,
4348,
15,
1231,
113,
40,
4348,
123,
57,
1886,
4076,
15,
17,
51,
1195,
25,
14,
249,
45,
5407,
21,
968,
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... |
PHP strptime format bug?
===
I am wrestling with a php 5.2.6 problem. An api we use returns dates in this format DDMMYYYYHHMM. Exactly that format, fixed length, no delimiters. However, in my experimentation, this format seems to break strptime, which returns a false (fail) when I feed it a date in this format. It can reproduced, at least on my system, with this example:
$format = "%d%m%Y%H%M"; echo print_r(strptime(strftime($format,1225405967),$format),true);
If I add any character between the date and the time, it works, even a space. So, this DOES work:
$format = "%d%m%Y %H%M"; echo print_r(strptime(strftime($format,1225405967),$format),true);
Am I missing something obvious? | 0 | [
2,
13,
26120,
354,
6952,
891,
2595,
6256,
60,
800,
3726,
3726,
31,
589,
3381,
29,
21,
13,
26120,
331,
9,
135,
9,
379,
1448,
9,
40,
21,
2159,
95,
275,
4815,
4076,
19,
48,
2595,
13,
8096,
79,
915,
93,
93,
93,
252,
15530,
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... |
What is the best way to upload a folder to a website?
===
I need an easy way to allow users to upload multiple files at once (ie I need to allow a user to upload a folder). I do not wish to put the burden of zipping on the user.
_I would prefer to avoid Flash or variants if possible._ I'm looking for a straight javascript / HTML solution if it is possible. Please note, this rules out the answers at: http://stackoverflow.com/questions/159600/multiple-file-upload.
| 0 | [
2,
98,
25,
14,
246,
161,
20,
71,
8294,
21,
19294,
20,
21,
2271,
60,
800,
3726,
3726,
31,
376,
40,
2010,
161,
20,
1655,
3878,
20,
71,
8294,
1886,
6488,
35,
382,
13,
5,
660,
31,
376,
20,
1655,
21,
4155,
20,
71,
8294,
21,
19294... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Find the Locale in Sybase?
===
I have some servers in Europe and some in Asia.
I would like to be able to work out where the current server is by querying ... something.
Is there some global variable I can query or sp_xxx I can execute to find out the locale of the server?
| 0 | [
2,
184,
20,
477,
14,
375,
62,
19,
10315,
8436,
60,
800,
3726,
3726,
31,
57,
109,
17595,
19,
1002,
17,
109,
19,
2394,
9,
31,
83,
101,
20,
44,
777,
20,
170,
70,
113,
14,
866,
8128,
25,
34,
25597,
68,
13,
9,
9,
9,
301,
9,
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... |
Best .NET graphics library for 3D sphere drawing?
===
I am going to be making an application that lets users input several parameters for a bowling ball layout, and then show what that layout would look like on the ball. I have found some good resources for sphere math, so if I have a sphere whose center is (0,0,0), I will be able to get the values of the points I need on the surface of the ball. What I will need to do is have the library create:
- A sphere
- Mark points on the surface of the sphere
- Draw lines connecting the points on the sphere (arcs along a great circle - in other words, the shortest distance across the surface of the sphere)
- ***Super duper bonus*** Actually be 3D, so the user could pan, zoom, rotate.
Basically, I want to calculate the points, tell the library which ones to draw and which ones to connect with which colors, and then sit back and watch the kudos roll in. | 0 | [
2,
246,
13,
9,
2328,
8351,
1248,
26,
203,
43,
9228,
3533,
60,
800,
3726,
3726,
31,
589,
228,
20,
44,
544,
40,
3010,
30,
6884,
3878,
6367,
238,
12905,
26,
21,
8817,
1592,
9106,
15,
17,
94,
298,
98,
30,
9106,
83,
361,
101,
27,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why vim doesn't work correcly into a telnet session ?
===
I use vim (7.1) on OpenVMS V7.3-2.
I connect to VMS trough a telnet session with SmartTerm, a terminal emulator.
It works fine.
But when I start a telnet session from a VMS session, some keys doesn't work properly.
Insert, Delete, Home, End, PageUp and PageDown are like ~ in normal mode ( upcase to lowercase or vice-versa )
Any idea ?
| 0 | [
2,
483,
1790,
79,
1437,
22,
38,
170,
18743,
150,
102,
77,
21,
6757,
2328,
3723,
13,
60,
800,
3726,
3726,
31,
275,
1790,
79,
13,
5,
465,
9,
165,
6,
27,
368,
20147,
18,
566,
465,
9,
240,
8,
135,
9,
31,
6379,
20,
13,
20147,
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... |
Should javac find methods outside of an anonymous class of the same name?
===
This question is a follow up to:
[Why can’t I call a method outside of an anonymous class of the same name][1]
This previous question answer <b>why</b>, but now I want to know if javac <b>should</b> find run(int bar)? (See previous question to see why run(42) fails)
If it shouldn't, is it due to a spec? Does it produce ambiguous code? My point is, I think this is a bug. While the previous question explained why this code fails to compile, I feel it should compile if javac searched higher in the tree if it fails to find a match at the current level. IE. If this.run() does not match, it should automatically check NotApplicable.this for a run method.
public class NotApplicable {
public NotApplicable() {
new Runnable() {
public void run() {
foo(42);
run(42);
// uncomment below to fix
//NotApplicable.this.run(42);
}
};
}
private void run(int bar) {
}
public void foo(int bar) {
}
}
[1]: http://stackoverflow.com/questions/252267/why-cant-i-call-a-method-outside-of-an-anonymous-class-of-the-same-name | 0 | [
2,
378,
8247,
150,
477,
3195,
719,
16,
40,
10364,
718,
16,
14,
205,
204,
60,
800,
3726,
3726,
48,
1301,
25,
21,
1740,
71,
20,
45,
636,
2256,
92,
1,
38,
31,
645,
21,
2109,
719,
16,
40,
10364,
718,
16,
14,
205,
204,
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... |
WCF Behavior Extension Elements Not Recognized in Visual Studio
===
This question is related to the question posted here:
http://stackoverflow.com/questions/169342/why-isnt-my-custom-wcf-behavior-extension-element-type-being-found
I'm using the WCF Behavior Extension with Custom Credentials demonstrated on MSDN here:
http://msdn.microsoft.com/en-us/library/ms730868.aspx
The only difference is that I'm using the Custom Token created from the WCF Custom Token Sample in the SDK. This involves creating a CreditCard credentials.
Having all the code in place I add the extension through the WCF Configuration GUI. I know it's working because it recognizes the type and adds the extensions to the config file.
<extensions>
<behaviorExtensions>
<add name="creditCardServiceCredentials" type="CreditCard.CreditCardServiceCredentialsConfigHandler, CreditCard, Version=1.0.0.0, Culture=neutral, PublicKeyToken=null" />
<add name="creditCardClientCredentials" type="CreditCard.CreditCardClientCredentialsConfigHandler, CreditCard, Version=1.0.0.0, Culture=neutral, PublicKeyToken=null" />
</behaviorExtensions>
</extensions>
After adding those elements I can use the WCF Configuration GUI to add the custom behaviors to the service behaviors element or the endpoint behaviors element. I don't see the properties though but it does show the type itself as it were a ServiceCredentials or ClientCredentials type.
Though, when I use the editor itself it doesn't show up in intellisense or as a recognized element.
**I'm referencing the project that contains the credit card credentials configuration handlers; so the DLL is in the service's bin\Debug directory. It's odd that it still doesn't work though :(**
| 0 | [
2,
11801,
410,
3257,
3896,
2065,
52,
2124,
19,
3458,
1120,
800,
3726,
3726,
48,
1301,
25,
1597,
20,
14,
1301,
6054,
235,
45,
7775,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
14009,
3965,
9298,
2256,
8,
19591,
38,
8,
915... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
LinQ ORM Data Objects and Inheritance.
===
I'm thinking about how to do this, but I have several different shapes of Data in my Database, Articles, NewsItems, etc.
They All have something in common, they all have IDs (in the DB they're named ArticleID, NewsID etc. )
They all have a **Title**
They all have **BodyText**.
They all have a **Status**
They all have a **DateAdded**
What I'd like to do is standard class inheritance.
I'd like a Master Class (I don't need to write this to the database) called **Content** with fields like:
- ID
- Title
- SubTitle
- BodyText
- Status
- AddedDate
I'm not sure how I can do this with the ORM. Why I want this is because then I can pass a list of COntent to my UserControl which is responsible for Rendering it. It will only need the information that is common to all objects.
Is this even possible? | 0 | [
2,
6294,
1251,
54,
79,
1054,
3916,
17,
13852,
9,
800,
3726,
3726,
31,
22,
79,
1440,
88,
184,
20,
107,
48,
15,
47,
31,
57,
238,
421,
12129,
16,
1054,
19,
51,
6018,
15,
3376,
15,
78,
9097,
79,
18,
15,
2722,
9,
59,
65,
57,
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... |
When can I dispose an IDisposable WPF control e.g. WindowsFormsHost?
===
The WPF control WindowsFormsHost inherits from IDisposable.
If I have a complex WPF visual tree containing some of the above controls what event or method can I use to call IDispose during shutdown?
| 0 | [
2,
76,
92,
31,
17913,
40,
13,
19405,
12551,
579,
619,
7721,
569,
13,
62,
9,
263,
9,
1936,
4190,
18,
11694,
60,
800,
3726,
3726,
14,
619,
7721,
569,
1936,
4190,
18,
11694,
17569,
18,
37,
13,
19405,
12551,
579,
9,
100,
31,
57,
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... |
C# Action lambda limitation
===
Why does this lambda expression not compile?
Action a = () => throw new InvalidOperationException();
I would appreciate references to the C# language specification or other documentation.
And yes, I know that the following is valid and will compile:
Action a = () => { throw new InvalidOperationException(); }; | 0 | [
2,
272,
5910,
1028,
13,
24187,
24943,
800,
3726,
3726,
483,
630,
48,
13,
24187,
1803,
52,
26561,
60,
1028,
21,
800,
13,
5,
6,
800,
1,
3814,
78,
16671,
11377,
10066,
872,
5,
6,
73,
31,
83,
8831,
7231,
20,
14,
272,
5910,
816,
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... |
Would syntax for composition be a useful addition to Java?
===
First off, I know next to nothing about language theory, and I barely know any other languages except Java, but I had an idea that I think would be cool, but I need you guys to tell me:
a: why it sucks
b: how language x has had that for years
c: how my mind sucks
d: all of the above
The idea would give composition the same ease of code reuse that <code>extends</code> does.
So if you had a class like this:
<pre>
public interface A {
public void methodInA();
}
</pre>
And then you had a class like this:
<pre>
public class B {
private composed A;
public B() {
// construct A within constructor
}
}
</pre>
You would then be able to do this:
<pre>
B myB = new B();
myB.methodInA();
</pre>
Without having to add in the delegation in B's class. But you could also do the same as with inheritance, ie:
<pre>
@Overrides
public void methodInA(){
// B's own delegation method
}
</pre>
Disadvantages include:
* methods are hidden in the source code, making it less obvious where the call is coming from, but this is also the case with <code>extends</code>
* if composed fields share the same method signature there needs to be a conflict resolved (how do conflicting interfaces solve this?)
* probably 100 other things I've not thought of
Like I say, I'm obviously no language theorist, and I haven't spent ages thinking about it, the idea just popped in my head and I wanted to know how wrong I am. I just think it would be kind of cool.
| 0 | [
2,
83,
22649,
26,
4046,
44,
21,
4811,
848,
20,
8247,
60,
800,
3726,
3726,
64,
168,
15,
31,
143,
328,
20,
626,
88,
816,
1639,
15,
17,
31,
2886,
143,
186,
89,
2556,
1613,
8247,
15,
47,
31,
41,
40,
882,
30,
31,
277,
83,
44,
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... |
Database table for grades
===
I'm trying to define a table to store student grades for a online report card. I can't decide how to do it, though.
The grades are given by subject, in a trimestral period. Every trimester has a average grade, the total missed classes and a "recovering grade" (i don't know the right term in english, but it's an extra test you take to try to raise your grade if you're below the average), I also gotta store the year average and final "recovering grade". Basically, it's like this:
<table border="1" cellpadding="1" cellspacing="0">
<tr>
<td rowspan="2">Subject</td>
<td colspan="3">1st Trimester</td>
<td colspan="3">2nd Trimester</td>
<td colspan="3">3rd Trimester</td>
<td rowspan="2">Year Avg.</td>
<td rowspan="2">Final Rec.</td>
</tr>
<tr>
<td>Avg.</td>
<td>Mis.</td>
<td>Rec</td>
<td>Avg.</td>
<td>Mis.</td>
<td>Rec</td>
<td>Avg.</td>
<td>Mis.</td>
<td>Rec</td>
</tr>
<tr>
<td>Math</td>
<td>5.33</td>
<td>1</td>
<td>4</td>
<td>8.0</td>
<td>0</td>
<td></td>
<td>7.0</td>
<td>2</td>
<td></td>
<td>6.5</td>
<td>7.0</td>
</tr>
<tr>
<td>Science</td>
<td>5.33</td>
<td>1</td>
<td>4</td>
<td>8.0</td>
<td>0</td>
<td></td>
<td>7.0</td>
<td>2</td>
<td></td>
<td>6.5</td>
<td>7.0</td>
</tr>
</table>
<br />
I could store this information in a single DB row, with each register beeing like
<br /><br />
1tAverage | 1tMissedClasses | 1tRecoveringGrade | 2tAverage | 2tMissedClasses | 2tRecoveringGrade
<br /><br />
And so on, but I figured this would be a pain to mantain, if the scholl ever decides to grade by bimester or some other period (like it used to be up until 3 years ago).<br />
I could also generalize the table fields, and use a tinyint for flagging for which trimester those grades are, or if they're the year finals.
But this one would ask for a lot of subqueries to write the report card, also a pain to mantain.
Which of the two is better, or is there some other way?
Thanks | 0 | [
2,
6018,
859,
26,
7400,
800,
3726,
3726,
31,
22,
79,
749,
20,
9267,
21,
859,
20,
1718,
1209,
7400,
26,
21,
2087,
1330,
2056,
9,
31,
92,
22,
38,
4073,
184,
20,
107,
32,
15,
362,
9,
14,
7400,
50,
504,
34,
1550,
15,
19,
21,
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... |
PHP Warning: Module 'ldap' & 'mysql' already loaded when running PHP at command line
===
I am getting the following errors:
PHP Warning: Module 'ldap' already loaded in Unknown on line 0
PHP Warning: Module 'mysql' already loaded in Unknown on line 0
when running the following command at the command line:
php -c /etc/php.ini /path/to/script.php
`/etc/php.ini` is the same php.ini that shown in phpinfo().
Any ideas? | 0 | [
2,
13,
26120,
3590,
45,
12613,
13,
22,
255,
20472,
22,
279,
13,
22,
915,
18,
22402,
22,
614,
8572,
76,
946,
13,
26120,
35,
1202,
293,
800,
3726,
3726,
31,
589,
1017,
14,
249,
11908,
45,
13,
26120,
3590,
45,
12613,
13,
22,
255,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 practices for overriding isEqual: and hash
===
How do you properly override `isEqual:` in Objective-C? The "catch" seems to be that if two objects are equal (as determined by the `isEqual:` method), they must have the same hash value.
The [Introspection][1] section of the [Cocoa Fundamentals Guide][2] does have an example on how to override `isEqual:`, copied as follows, for a class named `MyWidget`:
<pre>
- (BOOL)isEqual:(id)other {
if (other == self)
return YES;
if (!other || ![other isKindOfClass:[self class]])
return NO;
return [self isEqualToWidget:other];
}
- (BOOL)isEqualToWidget:(MyWidget *)aWidget {
if (self == aWidget)
return YES;
if (![(id)[self name] isEqual:[aWidget name]])
return NO;
if (![[self data] isEqualToData:[aWidget data]])
return NO;
return YES;
}
</pre>
It checks pointer equality, then class equality, and finally compares the objects using `isEqualToWidget:`, which only checks the `name` and `data` properties. What the example *doesn't* show is how to override `hash`.
Let's assume there are other properties that do not affect equality, say `age`. Shouldn't the `hash` method be overridden such that only `name` and `data` affect the hash? And if so, how would you do that? Just bitwise OR together the hashes of `name` and `data`? For example:
<pre>
- (NSUInteger)hash {
NSUInteger hash = 0;
hash |= [[self name] hash];
hash |= [[self data] hash];
return hash;
}
</pre>
Is that sufficient? Is there a better technique? What if you have primitives, like `int`? Convert them to `NSNumber` to get their hash? Or structs like `NSRect`?
[1]: http://developer.apple.com/documentation/Cocoa/Conceptual/CocoaFundamentals/CocoaObjects/chapter_3_section_7.html
[2]: http://developer.apple.com/documentation/Cocoa/Conceptual/CocoaFundamentals/Introduction/chapter_1_section_1.html | 0 | [
2,
246,
5242,
26,
84,
5175,
68,
25,
62,
14512,
45,
17,
19170,
800,
3726,
3726,
184,
107,
42,
7428,
84,
11891,
13,
1,
2628,
14512,
45,
1,
19,
7038,
8,
150,
60,
14,
13,
7,
18208,
7,
2206,
20,
44,
30,
100,
81,
3916,
50,
2747,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Call to a member function on a non-object
===
I'm working through [Practical Web 2.0 Appications][1] currently and have hit a bit of a roadblock. I'm trying to get PHP, MySQL, Apache, Smarty and the Zend Framework all working correctly so I can begin to build the application. I have gotten the bootstrap file for Zend working, shown here:
<?php
require_once('Zend/Loader.php');
Zend_Loader::registerAutoload();
// load the application configuration
$config = new Zend_Config_Ini('../settings.ini', 'development');
Zend_Registry::set('config', $config);
// create the application logger
$logger = new Zend_Log(new Zend_Log_Writer_Stream($config->logging->file));
Zend_Registry::set('logger', $logger);
// connect to the database
$params = array('host' => $config->database->hostname,
'username' => $config->database->username,
'password' => $config->database->password,
'dbname' => $config->database->database);
$db = Zend_Db::factory($config->database->type, $params);
Zend_Registry::set('db', $db);
// handle the user request
$controller = Zend_Controller_Front::getInstance();
$controller->setControllerDirectory($config->paths->base .
'/include/Controllers');
// setup the view renderer
$vr = new Zend_Controller_Action_Helper_ViewRenderer();
$vr->setView(new Templater());
$vr->setViewSuffix('tpl');
Zend_Controller_Action_HelperBroker::addHelper($vr);
$controller->dispatch();
?>
This calls the IndexController. The error comes with the use of this Templater.php to implement Smarty with Zend:
<?php
class Templater extends Zend_View_Abstract
{
protected $_path;
protected $_engine;
public function __construct()
{
$config = Zend_Registry::get('config');
require_once('Smarty/Smarty.class.php');
$this->_engine = new Smarty();
$this->_engine->template_dir = $config->paths->templates;
$this->_engine->compile_dir = sprintf('%s/tmp/templates_c',
$config->paths->data);
$this->_engine->plugins_dir = array($config->paths->base .
'/include/Templater/plugins',
'plugins');
}
public function getEngine()
{
return $this->_engine;
}
public function __set($key, $val)
{
$this->_engine->assign($key, $val);
}
public function __get($key)
{
return $this->_engine->get_template_vars($key);
}
public function __isset($key)
{
return $this->_engine->get_template_vars($key) !== null;
}
public function __unset($key)
{
$this->_engine->clear_assign($key);
}
public function assign($spec, $value = null)
{
if (is_array($spec)) {
$this->_engine->assign($spec);
return;
}
$this->_engine->assign($spec, $value);
}
public function clearVars()
{
$this->_engine->clear_all_assign();
}
public function render($name)
{
return $this->_engine->fetch(strtolower($name));
}
public function _run()
{ }
}
?>
The error I am getting when I load the page is this:
Fatal error: Call to a member function fetch() on a non-object in /var/www/phpweb20/include/Templater.php on line 60
I understand it doesn't see $name as an object, but I don't know how to go about fixing this. Isn't the controller supposed to refer to the index.tpl? I haven't been able to discover what the $name variable represents and how to fix this to get the foundation working.
Any help you have is much appreciated!
[1]: http://www.amazon.com/Practical-Web-2-0-Applications-PHP/dp/1590599063 | 0 | [
2,
645,
20,
21,
322,
1990,
27,
21,
538,
8,
23793,
800,
3726,
3726,
31,
22,
79,
638,
120,
636,
7310,
150,
18142,
2741,
172,
9,
387,
4865,
596,
7504,
500,
2558,
165,
500,
871,
17,
57,
770,
21,
1142,
16,
21,
383,
12048,
9,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a clean way of cleaning up duplicate entries in MySQL?
===
In a table, I have three columns - id, name, and count. A good number of name columns are identical (due to the lack of a UNIQUE early on) and I want to fix this. However, the id column is used by other (4 or 5, I think - I would have to check the docs) tables to look up the name and just removing them would break things. So is there a good, clean way of saying "find all identical records and merge them together"? | 0 | [
2,
25,
80,
21,
2745,
161,
16,
9724,
71,
19429,
11399,
19,
51,
18,
22402,
60,
800,
3726,
3726,
19,
21,
859,
15,
31,
57,
132,
7498,
13,
8,
4924,
15,
204,
15,
17,
2468,
9,
21,
254,
234,
16,
204,
7498,
50,
6323,
13,
5,
12633,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 javascript determine the type of an html element?
===
I feel like this should be really easy to do, but I'm stumped. I need a way for Javascript to determine the type of an HTML element. It has the id, but the element itself could be a div, a form field, a fieldset, etc. Can anyone tell me how to do this? | 0 | [
2,
184,
92,
8247,
8741,
3746,
14,
1001,
16,
40,
13,
15895,
4520,
60,
800,
3726,
3726,
31,
583,
101,
48,
378,
44,
510,
2010,
20,
107,
15,
47,
31,
22,
79,
15781,
69,
9,
31,
376,
21,
161,
26,
8247,
8741,
20,
3746,
14,
1001,
16,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Copying database between multiple databases with NHibernate
===
I have a desktop (winforms) application that uses a Firebird database as a data store (in embedded mode) and I use NHibernate for ORM. One of the functions we need to support is to be able to import / export groups of data to/from an external file. Currently, this external file is also a database with the same schema as the main database.
I've already got NHibernate set up to look at multiple databases and I can work with two databases at the same time. The problem, however, is copying data between the two databases. I have two copy strategies: (1) copy with all the same IDs for objects [aka import/export] and (2) copy with mostly new IDs [aka duplicate / copy]. I say "mostly new" because there are some lookup items that will always be copied with the same ID.
Copying everything with new IDs is fine, because I'll just have a "CopyForExport" method that can create copies of everything and not assign new IDs (or wipe out all the IDs in the object tree).
What is the "best practices" way to handle this situation and to copy data between databases while keeping the same IDs? | 0 | [
2,
4344,
68,
6018,
128,
1886,
6018,
18,
29,
12109,
15191,
8820,
800,
3726,
3726,
31,
57,
21,
17404,
13,
5,
4181,
4190,
18,
6,
3010,
30,
2027,
21,
535,
8490,
6018,
28,
21,
1054,
1718,
13,
5,
108,
12138,
3740,
6,
17,
31,
275,
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... |
How do you pass commands to a cygwin console in Windows using Inno Setup
===
I've tried variations of this, but had no luck other than the ability to start a cygwin window. (wrapped on **;** for clarity)
Filename: "c:\cygwin\bin\bash.exe";
Parameters: "-c c:/scripts/step1.sh paramX";
Flags: shellexec waituntilterminated;
StatusMsg: "Running the script..."
(this is for an internal install, thus cywin is installed, and all paths, scripts are known)
| 0 | [
2,
184,
107,
42,
1477,
14294,
20,
21,
6728,
263,
4181,
8650,
19,
1936,
568,
19,
251,
18161,
800,
3726,
3726,
31,
22,
195,
794,
8194,
16,
48,
15,
47,
41,
90,
5419,
89,
119,
14,
2165,
20,
799,
21,
6728,
263,
4181,
1463,
9,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to work with objects using Dynamic WCF?
===
We currently have developed an application using WCF. Our clients make connections to different WCF servicehosts located on the server, and the servicehosts return the data from the DB that the clients need. Standard model. However, this current design has all of our WCF data in app.config files both on the client side as well as the servicehost side. We want to make this more dynamic, and have moved all of the data, including the endpoints, the contracts, and the bindings, into the DB.
Now the question is how do we retrieve this data, and access it properly. We've got the design working where we have one defined endpoint in a config file, and using that endpoint, we can make a call to it to get the rest of the endpoint information that we need (i.e. all of the bindings, contracts and different endpoints that it used to have defined in its app.config). This is the case on both the client side as well as the servicehost side.
The issue that I'm now struggling with is how do I code against these dynamic endpoints? When the client makes a call to the servicehost, it not only is making simple calls to the servicehost, but retrieving and passing back objects for the servicehost to process as needed. For example, on form load we may retrieve the object with all of the currently defined settings from the DB, and then the user does whatever on the fornm, and we then pass back the updated object to the servicehost. We can do that now because in Visual Studio 2008 we've added all of the service references, which has auto-generated the methods and objects that can be called and retrieved from the servicehosts. If we go to a dynamic endpoint connection, how do we get this data during the development phase?
I've developed a similar application in the past in .NET 2.0 using .NET remoting, where we were passing the object back and forth, and the client and server both used the same object definition class to know about the object. I'm not sure how we would go about doing this with WCF. | 0 | [
2,
184,
20,
170,
29,
3916,
568,
7782,
11801,
410,
60,
800,
3726,
3726,
95,
871,
57,
885,
40,
3010,
568,
11801,
410,
9,
318,
7421,
233,
6760,
20,
421,
11801,
410,
365,
11694,
18,
335,
27,
14,
8128,
15,
17,
14,
365,
11694,
18,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I prevent exceptions from half-loaded pages' form submission while using asp.net event validation?
===
I have a page with some dynamically added buttons. If you click a button before the page has fully loaded, it throws the classic exception:
Invalid postback or callback argument.
Event validation is enabled using in configuration or 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.
I am guessing the Viewstate field hasn't loaded on the form yet, the the other bits are being submitted. What's the best way to prevent this error, while maintaining Event Validation? | 0 | [
2,
184,
107,
31,
2501,
13392,
37,
519,
8,
22546,
4434,
22,
505,
10923,
133,
568,
28,
306,
9,
2328,
807,
27999,
60,
800,
3726,
3726,
31,
57,
21,
2478,
29,
109,
7782,
1326,
905,
12861,
9,
100,
42,
10840,
21,
5167,
115,
14,
2478,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In Python, is there a concise way of comparing whether the contents of two text files are the same?
===
I don't care what the differences are. I just want to know whether the contents are different. | 0 | [
2,
19,
20059,
15,
25,
80,
21,
29455,
161,
16,
15047,
1472,
14,
8478,
16,
81,
1854,
6488,
50,
14,
205,
60,
800,
3726,
3726,
31,
221,
22,
38,
781,
98,
14,
4921,
50,
9,
31,
114,
259,
20,
143,
1472,
14,
8478,
50,
421,
9,
3,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Map of collections
===
I wanted to make Map of Collections in Java, so I can make something like
public void add(K key, V value) {
if (containsKey(key)) {
get(key).add(value);
} else {
Collection c = new Collection();
c.add(value);
put(key, value);
}
}
I've tried to make it with something like
public class CollectionMap<K, C extends Collection<V>> extends HashMap<K, C>
but compiler complains about the `<V>` part, and there would still be an issue of making proper new collection.
At the moment, I've made two classes: SetMap that look like this
1: public class SetMap<K, V> extends HashMap<K, Set<V>> {
2:
3: public void add(K key, V value) {
4: if (containsKey(key)) {
5: get(key).add(value);
6: } else {
7: Set<V> list = new HashSet<V>();
8: list.add(value);
9: put(key, list);
10: }
11: }
12:
13: }
and ListMap looks pretty much the same except the line 7 where I make new ArrayList. This sort of duplication is small enough to be tolerable, but question remains is this sort of "nested generics" possible in Java? | 0 | [
2,
2942,
16,
5721,
800,
3726,
3726,
31,
417,
20,
233,
2942,
16,
5721,
19,
8247,
15,
86,
31,
92,
233,
301,
101,
317,
11364,
3547,
5,
197,
1246,
15,
566,
1923,
6,
13,
1,
100,
13,
5,
1126,
5851,
18,
4237,
5,
4237,
6,
6,
13,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.