unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
64-bit Alternative for Microsoft Jet
===
Microsoft has chosen to not release a 64-bit version of Jet, their database driver for Access. Does anyone know of a good alternative?
Here are the specific features I need:
* Multiple users can connect to database over a network.
* Users can copy the database while it is open without risking corruption.
Alternatives I've considered that I do not think could work (though my understanding could be incorrect):
* SQLite: If multiple users connect to the database over a network, it will become corrupted.
* Firebird: Copying a database that is in use can corrupt the original database.
* SQL Server: Files in use are locked and cannot be copied. | 0 | [
2,
4384,
8,
3326,
2676,
26,
7099,
4797,
800,
3726,
3726,
7099,
63,
2519,
20,
52,
830,
21,
4384,
8,
3326,
615,
16,
4797,
15,
66,
6018,
2425,
26,
1381,
9,
630,
1276,
143,
16,
21,
254,
2676,
60,
235,
50,
14,
1903,
967,
31,
376,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP.NET: IContainer Missing Constructor?
===
I have a ASP.NET application running on a remote web server and I just started getting this error. I can't seem to reproduce it in my development environment:
Method not found: 'Void System.Collections.Generic.ICollection`1..ctor()'.
I narrowed it down to this line, but it doesn't make sense. Could this be due to some misconfiguration of .NET Framework or IIS 6?
List x = new List<int>(); | 0 | [
2,
28,
306,
9,
2328,
45,
9801,
5851,
106,
2863,
6960,
248,
60,
800,
3726,
3726,
31,
57,
21,
28,
306,
9,
2328,
3010,
946,
27,
21,
5388,
2741,
8128,
17,
31,
114,
373,
1017,
48,
7019,
9,
31,
92,
22,
38,
2260,
20,
21509,
32,
19,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
throw exception JSP
===
Is it possible to throw an exception in a JSP without using scriptlet code?
Cheers,
Don | 0 | [
2,
3814,
5391,
487,
3401,
800,
3726,
3726,
25,
32,
938,
20,
3814,
40,
5391,
19,
21,
487,
3401,
366,
568,
3884,
1336,
1797,
60,
10497,
18,
15,
221,
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... | [
1,
1,
1,
1,
1,
1,
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... |
NLP: Qualitatively "positive" vs "negative" sentence
===
I need your help in determining the best approach for analyzing industry-specific sentences (i.e. movie reviews) for "positive" vs "negative". I've seen libraries such as OpenNLP before, but it's too low-level - it just gives me the basic sentence composition; what I need is a higher-level structure:
- hopefully with wordlists
- hopefully trainable on my set of data
Thanks! | 0 | [
2,
13,
103,
5478,
45,
27819,
102,
13,
7,
21299,
7,
4611,
13,
7,
20270,
7,
5123,
800,
3726,
3726,
31,
376,
154,
448,
19,
13521,
14,
246,
2141,
26,
23543,
1230,
8,
9219,
13453,
13,
5,
49,
9,
62,
9,
1308,
2783,
6,
26,
13,
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... |
What is the best way to consume a web service from VB6?
===
I need to consume an external web service from my VB6 program. I want to be able to deploy my program without the SOAP toolkit, if possible, but that's not a requirement. I do not have the web service source and I didn't create it. It is a vendor-provided service.
So outside of the SOAP toolkit, what is the best way to consume a web service from VB6? | 0 | [
2,
98,
25,
14,
246,
161,
20,
16447,
21,
2741,
365,
37,
13,
20468,
379,
60,
800,
3726,
3726,
31,
376,
20,
16447,
40,
4886,
2741,
365,
37,
51,
13,
20468,
379,
625,
9,
31,
259,
20,
44,
777,
20,
17617,
51,
625,
366,
14,
6447,
56... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 .NET equivalent of Perl's LWP / WWW::Mechanize?
===
After working with .NET's `HttpWebRequest`/`Response` objects, I'd rather shoot myself than use this to crawl through web sites. I'm looking for an existing .NET library that can fetch URLs, and give you the ability to follow links, extract/fill in/submit forms on the page, etc. Perl's `LWP` and `WWW::Mechanize` modules do this very well, but I'm working with a .NET project.
I've come across the [HTML Agility Pack][1], which looks awesome, but it stops short of simulating links/forms.
Does such a tool already exist?
[1]: http://www.codeplex.com/htmlagilitypack | 0 | [
2,
25,
80,
21,
13,
9,
2328,
4602,
16,
416,
255,
22,
18,
644,
13790,
13,
118,
13,
6483,
45,
45,
790,
3606,
2952,
60,
800,
3726,
3726,
75,
638,
29,
13,
9,
2328,
22,
18,
13,
1,
21127,
458,
3692,
10351,
1,
118,
1,
99,
18,
8782... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP.Net Web Site Won't Compile, But Works Anyway?!
===
I have an ASP.Net 2.0 web site, using the DotNetNuke framework (4.09), and it will not compile, but when I hit the site in a browser, it works. Even the parts that don't compile will work. How is IIS able to compile and run this site, when Visual Studio can't? Everything is the same in both places... I copied the entire web site from the remote server on to my local machine, then I set it up in IIS the same way. On my local machine, Visual Studio can't compile the site, but it still runs. How can this be possible?
| 0 | [
2,
28,
306,
9,
2328,
2741,
689,
230,
22,
38,
26561,
15,
47,
693,
2774,
60,
187,
800,
3726,
3726,
31,
57,
40,
28,
306,
9,
2328,
172,
9,
387,
2741,
689,
15,
568,
14,
14123,
2328,
4215,
1048,
6596,
13,
5,
300,
9,
2545,
6,
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... |
Painless way to trim leading/trailing whitespace in C?
===
Is there a clean, preferably standard method of trimming leading and trailing whitespace from a string in C? I'd roll my own, but I would think this is a common problem with an equally common solution. | 0 | [
2,
1257,
923,
161,
20,
8971,
1005,
118,
38,
7301,
68,
359,
5582,
19,
272,
60,
800,
3726,
3726,
25,
80,
21,
2745,
15,
6369,
4801,
1236,
2109,
16,
8971,
3863,
1005,
17,
14323,
359,
5582,
37,
21,
3724,
19,
272,
60,
31,
22,
43,
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... |
Mathematics / Algorithmic Resources: ProjectEuler.net puzzles
===
I've used brute force for the most part for the [ProjectEuler.net][1] problems that I have been able to solve. One thing I'm finding is that, for some of the puzzles, I'm not able to find good resources for 'backfilling' my understanding of the problem domains the puzzles represent.
What are suggested resources for learning about those topics?
- numeric sequences
- properties of pascal's triangle
- infinite sequences
Is anyone else working through ProjectEuler simply for self-improvement?
[1]: http://projecteuler.net/ | 0 | [
2,
4264,
13,
118,
9083,
596,
2566,
45,
669,
5770,
1252,
9,
2328,
9164,
18,
800,
3726,
3726,
31,
22,
195,
147,
27066,
558,
26,
14,
127,
141,
26,
14,
636,
21011,
5770,
1252,
9,
2328,
500,
2558,
165,
500,
1716,
30,
31,
57,
74,
77... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Insert into ... Select *, how to ignore identity?
===
I have a temp table with the exact structure of a concrete table T. It was created like this:
select top 0 * into #tmp from T
After processing and filling in content into #tmp, I want to copy the content back to T like this:
insert into T select * from #tmp
This is okay as long as T doesn't have identity column, but in my case it does. Is there anyways I can ignore the auto-increment identity column from #tmp when I copy to T? My motivation is to avoid having to spell out every column name in the Insert Into list.
EDIT: toggling identity_insert wouldn't work because the pkeys in #tmp may collide with those in T.
| 0 | [
2,
14692,
77,
13,
9,
9,
9,
5407,
1637,
15,
184,
20,
7174,
3270,
60,
800,
3726,
3726,
31,
57,
21,
13,
9577,
859,
29,
14,
5340,
1411,
16,
21,
4105,
859,
13,
38,
9,
32,
23,
679,
101,
48,
45,
5407,
371,
713,
1637,
77,
6926,
38... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I decode html characters in c#?
===
I have email addresses encoded with character entities, is there anything in .net that can convert them to plain string? | 0 | [
2,
184,
92,
31,
121,
9375,
13,
15895,
1766,
19,
272,
5910,
60,
800,
3726,
3726,
31,
57,
8517,
12636,
13665,
29,
925,
12549,
15,
25,
80,
602,
19,
13,
9,
2328,
30,
92,
8406,
105,
20,
3748,
3724,
60,
3,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
WSS 3.0: change parent type for a content type.
===
I have created a hierarchy of content types. The root of my hierarchy has the content type "Document" as a parent. There are about 20 other content types derived from my root.
Now, I want to change the parent from "Document" to something else. Is it possible? Either in the web interface or in code? Can the defintion of content types be dumped to a text file and then recreated? Or any other trick? | 0 | [
2,
619,
18,
18,
203,
9,
387,
45,
753,
4766,
1001,
26,
21,
2331,
1001,
9,
800,
3726,
3726,
31,
57,
679,
21,
14417,
16,
2331,
2551,
9,
14,
5900,
16,
51,
14417,
63,
14,
2331,
1001,
13,
7,
28132,
7,
28,
21,
4766,
9,
80,
50,
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... |
What would be the simplest way to alpha sort an array of chars in C?
===
I'm looking for a simple, easy to understand algorithm to alphabetically sort an array of characters in C. | 0 | [
2,
98,
83,
44,
14,
24384,
161,
20,
5705,
2058,
40,
7718,
16,
4892,
18,
19,
272,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
1935,
15,
2010,
20,
1369,
9083,
20,
27169,
102,
2058,
40,
7718,
16,
1766,
19,
272,
9,
3,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What is the LINQ way to implode/join a string array?
===
I have the following string array:
var sa = new string[] {"yabba","dabba","doo"};
I can convert it to "yabba, dabba, doo" it using string.Join() but what is the super-cool LINQ way of doing it? The Join extension method seems promising but for a novice like me very confusing.
| 0 | [
2,
98,
25,
14,
6294,
1251,
161,
20,
5420,
19471,
118,
1636,
108,
21,
3724,
7718,
60,
800,
3726,
3726,
31,
57,
14,
249,
3724,
7718,
45,
4033,
1929,
800,
78,
3724,
2558,
500,
13,
1,
7,
93,
13100,
7,
15,
7,
43,
13100,
7,
15,
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... |
Is there anyway to remove Design (and Split) views from Visual Studio 2005/2008?
===
I am trying to find a way to disable Design / Split views from appearing in Visual Studio. I figure there's no way to completely disable it, but I still can't seem to find a way to remove the shortcut (F7), or remove the buttons from the bottom bar. | 0 | [
2,
25,
80,
2774,
20,
4681,
704,
13,
5,
290,
2132,
6,
4146,
37,
3458,
1120,
812,
118,
2753,
60,
800,
3726,
3726,
31,
589,
749,
20,
477,
21,
161,
20,
1460,
579,
704,
13,
118,
2132,
4146,
37,
4870,
19,
3458,
1120,
9,
31,
1465,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which Java-library can be used to access data via WebDAV?
===
That's the question: Which library can help me to access data available via WebDAV in my Java-programs? OpenSource is preferred. | 0 | [
2,
56,
8247,
8,
1210,
2559,
622,
92,
44,
147,
20,
1381,
1054,
1197,
2741,
43,
5214,
60,
800,
3726,
3726,
30,
22,
18,
14,
1301,
45,
56,
1248,
92,
448,
55,
20,
1381,
1054,
904,
1197,
2741,
43,
5214,
19,
51,
8247,
8,
19746,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Working with client certificates for an ASP.NET MVC site on IIS 6
===
Wanting to implement authentication by client certificates I am experiencing some issues.
**First some facts**
The whole site is using SSL. I am using IIS 6 (on Windows Server 2003) and have configured the site to accept client certificates, not requiring them. Most browsers are however implemented in a way so that they will only ask the user for a certificate when it is strictly required. Because of this the authentication model isn't really useful.
**Suggestions of my own**
My first idea was to set the `HttpResponse.Status` property but it requires the characters before the first space to be an integer. The useful status for getting a browser to send a client certificate is `403.7 Client certificate required` so this will not work (unless you can overwrite it).
I also thought that I would just configure IIS to require client certificates for a specific paths, but this - of cource - works only with physical files and not with routing.
A possible solution is to make a specific folder and require client certificates for it which is more of a hack than a solution. So I would like to avoid this if someone has a better proposal. | 0 | [
2,
638,
29,
6819,
6259,
18,
26,
40,
28,
306,
9,
2328,
307,
8990,
689,
27,
595,
18,
400,
800,
3726,
3726,
4638,
20,
8713,
27963,
34,
6819,
6259,
18,
31,
589,
15138,
109,
1549,
9,
13,
1409,
3552,
109,
10459,
1409,
14,
979,
689,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can you load balance an IIS 6 hosted WCF Service?
===
We use BigIP to load balance between our two IIS servers. We recently deployed a WCF service hosted on by IIS 6 onto these two Windows Server 2003R2 servers.
Each server is configured with two host headers: one for the load balancer address, and then a second host header that points only to that server. That way we can reference a specific server in the load balanced group for debugging.
So when we run We immediately got the error:
> **This collection already contains an address with scheme http. There can be at most one address per scheme in this collection.
Parameter name: item**
I did some research and we can implement a filter to tell it to ignore the one of the hosts, but then we cannot access the server from that address.
<serviceHostingEnvironment>
<baseAddressPrefixFilters>
<add prefix="http://domain.com:80"/>
</baseAddressPrefixFilters>
</serviceHostingEnvironment>
What is the best solution in this scenario which would allow us to hit a WCF service via http://domain.com/service.svc and http://domain.com/service.svc?
If we should create our own ServiceFactory as some sites suggest, does anyone have any sample code on this?
Any help is much appreciated.
Thank you. | 0 | [
2,
184,
92,
42,
6305,
4468,
40,
595,
18,
400,
2812,
11801,
410,
365,
60,
800,
3726,
3726,
95,
275,
580,
4307,
20,
6305,
4468,
128,
318,
81,
595,
18,
17595,
9,
95,
1989,
6698,
21,
11801,
410,
365,
2812,
27,
34,
595,
18,
400,
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... |
What is a simple command lime program or script to backup SQL server databases?
===
I've been to lax with performing DB backups on our internal servers.
Is there a simple command line program that I can use to backup certain databases in SQL Server 2005? Or is there an easy vbscript? | 0 | [
2,
98,
25,
21,
1935,
1202,
11488,
625,
54,
3884,
20,
10119,
4444,
255,
8128,
6018,
18,
60,
800,
3726,
3726,
31,
22,
195,
74,
20,
333,
396,
29,
2955,
13,
9007,
10119,
18,
27,
318,
3117,
17595,
9,
25,
80,
21,
1935,
1202,
293,
62... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 read an HttpResponse in ASP.NET 2.0?
===
For example, I have an ASP.NET form that is called by another aspx:
string url = "http://somewhere.com?P1=" + Request["param"];
Response.Write(url);
I want to do something like this:
string url = "http://somewhere.com?P1=" + Request["param"];
string str = GetResponse(url);
if (str...) {}
I need to get whatever Response.Write is getting as a result or going to url, manipulate that response, and send something else back.
Any help or a point in the right direction would be greatly appreciated.
-dave-
| 0 | [
2,
184,
107,
31,
1302,
40,
7775,
99,
18,
8782,
870,
19,
28,
306,
9,
2328,
172,
9,
387,
60,
800,
3726,
3726,
26,
823,
15,
31,
57,
40,
28,
306,
9,
2328,
505,
30,
25,
227,
34,
226,
28,
306,
396,
45,
3724,
287,
6362,
800,
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... |
Help configuring JNDI with embedded JBoss in Tomcat 5.5.x
===
When I try the following lookup in my code:
Context initCtx = new InitialContext();
Context envCtx = (Context) initCtx.lookup("java:comp/env");
return (DataSource) envCtx.lookup("jdbc/mydb");
I get the following exception:
java.sql.SQLException: QueryResults: Unable to initialize naming context:
Name java:comp is not bound in this Context at
com.onsitemanager.database.ThreadLocalConnection.getConnection
(ThreadLocalConnection.java:130) at
...
I installed embedded JBoss following the JBoss [wiki instructions][1]. And I configured Tomcat using the "Scanning every WAR by default" deployment as specified in the [configuration wiki page][2].
Quoting the config page:
> JNDI
>
> Embedded JBoss components like connection pooling, EJB, JPA, and transactions make
> extensive use of JNDI to publish services. Embedded JBoss overrides Tomcat's JNDI
> implementation by layering itself on top of Tomcat's JNDI instantiation. There are a few > reasons for this:
>
> 1. To avoid having to declare each and every one of these services within server.xml
> 2. To allow seemeless integration of the java:comp namespace between web apps and
> EJBs.
> 3. Tomcat's JNDI implementation has a few critical bugs in it that hamper some JBoss
> components ability to work
> 4. We want to provide the option for you of remoting EJBs and other services that can > be remotely looked up
Anyone have any thoughts on how I can configure the JBoss naming service which according to the above quote is overriding Tomcat's JNDI implementation so that I can do a lookup on java:comp/env?
FYI - My environment Tomcat 5.5.9, Seam 2.0.2sp, Embedded JBoss (Beta 3),
Note: I do have a -ds.xml file for my database connection properly setup and accessible on the class path per the instructions.
Also note: I have posted this question in embedded Jboss forum and seam user forum.
[1]: http://wiki.jboss.org/wiki/Tomcat5.5.x?action=e&windowstate=normal&mode=view
[2]: http://wiki.jboss.org/wiki/EmbeddedAndTomcat | 0 | [
2,
448,
1065,
13549,
68,
487,
9805,
29,
12138,
487,
10349,
18,
19,
2067,
5782,
331,
9,
264,
9,
396,
800,
3726,
3726,
76,
31,
1131,
14,
249,
361,
576,
19,
51,
1797,
45,
4141,
19,
242,
4812,
396,
800,
78,
2104,
1126,
11969,
5,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a Java equivalent for .Net System.Data?
===
Is there a Java package providing funcionality like the .Net System.Data namespace ?
Specificaly the DataSet and Adaptor classes ? | 0 | [
2,
25,
80,
21,
8247,
4602,
26,
13,
9,
2328,
329,
9,
18768,
60,
800,
3726,
3726,
25,
80,
21,
8247,
6030,
2674,
2414,
10934,
11923,
101,
14,
13,
9,
2328,
329,
9,
18768,
204,
5582,
13,
60,
1903,
58,
102,
14,
1054,
3554,
17,
9924,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
pl sql & java - creating dynamic query
===
I have a dilemma, I'm using java and oracle and trying to keep querys on plsql side. Everything is OK, until I have these complex querys which may and may not have conditions. Its not hard in Java to put together WHERE clause with conditions, but its not nice.
And in pl sql side I also found out that the only possibility for 'dynamic querys' is string manipulations like
IF inputname IS NOT NULL THEN
query := query ||' and NAME=' || inputname;
END IF;
Now I'm thinking, I'm leaving query in pl sql and sending WHERE clause with function parameter.
Any good recommentations or examples please, its been hard day :) | 0 | [
2,
12443,
4444,
255,
279,
8247,
13,
8,
2936,
7782,
25597,
800,
3726,
3726,
31,
57,
21,
23314,
15,
31,
22,
79,
568,
8247,
17,
15759,
17,
749,
20,
643,
25597,
18,
27,
12443,
18,
22402,
270,
9,
796,
25,
5854,
15,
163,
31,
57,
158... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Explain Plan for Query in a Stored Procedure
===
I have a stored procedure that consists of a single select query used to insert into another table based on some minor math that is done to the arguments in the procedure. Can I generate the plan used for this query by referencing the procedure somehow, or do I have to copy and paste the query and create bind variables for the input parameters? | 0 | [
2,
3271,
944,
26,
25597,
19,
21,
8214,
7004,
800,
3726,
3726,
31,
57,
21,
8214,
7004,
30,
2043,
16,
21,
345,
5407,
25597,
147,
20,
14692,
77,
226,
859,
432,
27,
109,
1689,
5057,
30,
25,
677,
20,
14,
10553,
19,
14,
7004,
9,
92,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 SQL Try-Catch blocks handle thrown CLR errors?
===
We are using SQL 2005 and the try-catch functionality to handle all of our error handling within the DB. We are currently working on deploying a .NET CLR function to make some WCF calls in the DB. This WCF procedure is written in the CLR and then deployed to SQL. If I put a try-catch block in the CLR code, it catches the error fine. However, I can't seem to throw the error up to the try-catch block in SQL. SQL seems to ignore what I throw it and catches the error it finds. Is there no relation between the two (i.e. I can't throw from one to another?)
If I can throw from within the CLR to the calling procedure in SQL, is any special formatting needed? | 0 | [
2,
92,
4444,
255,
1131,
8,
18208,
5198,
3053,
6027,
10842,
139,
11908,
60,
800,
3726,
3726,
95,
50,
568,
4444,
255,
812,
17,
14,
1131,
8,
18208,
18548,
20,
3053,
65,
16,
318,
7019,
7988,
363,
14,
13,
9007,
9,
95,
50,
871,
638,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Testing for Random Value - Thoughts on this Approach?
===
OK, I have been working on a random image selector and queue system (so you don't see the same images too often).
All was going swimmingly (as far as my crappy code does) **until** I got to the random bit. I wanted to test it, but how do you test for it? There is no `Debug.Assert(i.IsRandom)` (sadly) :D
So, I got my brain on it after watering it with some tea and came up with the following, I was just wondering if I could have your thoughts?
* Basically I knew the **random** bit was the problem, so I ripped that out to a delegate (which would then be passed to the objects constructor).
* I then created a class that pretty much performs the same logic as the _live_ code, but remembers the value selected in a private variable.
* I then thew that delegate to the live class and tested against that:
i.e.
Debug.Assert(myObj.RndVal == RndIntTester.ValuePassed);
But I couldn't help but think, **was I wasting my time?** I ran that through lots of iterations to see if it fell over at any time etc.
Do you think I was wasting my time with this? Or could I have got away with:
| 0 | [
2,
4431,
26,
5477,
1923,
13,
8,
3064,
27,
48,
2141,
60,
800,
3726,
3726,
5854,
15,
31,
57,
74,
638,
27,
21,
5477,
1961,
23946,
17,
22521,
329,
13,
5,
656,
42,
221,
22,
38,
196,
14,
205,
3502,
266,
478,
6,
9,
65,
23,
228,
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... |
Most rapid RAD environment for prototyping
===
What do you consider the most rapid RAD environment for prototyping? Not for debate.
- language
- platform
- IDE
- DB
- (personal note)
Thank you.
| 0 | [
2,
127,
4470,
4944,
2307,
26,
9347,
1084,
3181,
800,
3726,
3726,
98,
107,
42,
3563,
14,
127,
4470,
4944,
2307,
26,
9347,
1084,
3181,
60,
52,
26,
4503,
9,
13,
8,
816,
13,
8,
2452,
13,
8,
13,
3448,
13,
8,
13,
9007,
13,
8,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to get rid of the "Console Root" node in a MMC 3.0 snapin?
===
I've been creating snapins with the new MMC 3.0 classes and C#. I can't seem to find any examples of how to get rid of the "Console Root" node when creating the *.msc files. I looked through the examples in the SDK, but I can't seem to find anything for this.
I have seen other snapins that do what I want, but I can't tell what version of MMC they are using. | 0 | [
2,
184,
20,
164,
6681,
16,
14,
13,
7,
12124,
6069,
5900,
7,
15421,
19,
21,
1620,
150,
203,
9,
387,
6877,
108,
60,
800,
3726,
3726,
31,
22,
195,
74,
2936,
6877,
108,
18,
29,
14,
78,
1620,
150,
203,
9,
387,
2684,
17,
272,
5910... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the recommended toolchain for formatting XML DocBook?
===
I've seen [Best tools for working with DocBook XML documents][1], but my question is slightly different. Which is the currently recommended formatting toolchain - as opposed to editing tool - for XML DocBook?
In Eric Raymond's ['The Art of Unix Programming'][2] from 2003 (an excellent book!), the suggestion is XML-FO (XML Formatting Objects), but I've since seen suggestions here that indicated that XML-FO is no longer under development (though I can no longer find that question on StackOverflow, so maybe it was erroneous).
Assume I'm primarily interested in Unix/Linux (including MacOS X), but I wouldn't automatically ignore Windows-only solutions.
Is [Apache's FOP][3] the best way to go? Are there any alternatives?
[1]: http://stackoverflow.com/questions/55622/best-tools-for-working-with-docbook-xml-documents
[2]: http://www.amazon.com/UNIX-Programming-Addison-Wesley-Professional-Computing/dp/0131429019/ref=sr_1_1?ie=UTF8&s=books&qid=1222193740&sr=1-1
[3]: http://xmlgraphics.apache.org/fop/ | 0 | [
2,
98,
25,
14,
5773,
5607,
17317,
26,
2595,
1203,
23504,
9765,
5199,
60,
800,
3726,
3726,
31,
22,
195,
541,
636,
4936,
4672,
26,
638,
29,
9765,
5199,
23504,
4374,
500,
2558,
165,
500,
15,
47,
51,
1301,
25,
1847,
421,
9,
56,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Need to create a layered dict from a flat one
===
I have a dict, that looks like this:
{
'foo': {
'opt1': 1,
'opt2': 2,
},
'foo/bar': {
'opt3': 3,
'opt4': 4,
},
'foo/bar/baz': {
'opt5': 5,
'opt6': 6,
}
}
And I need to get it to look like:
{
'foo': {
'opt1': 1,
'opt2': 2,
'bar': {
'opt3': 3,
'opt4': 4,
'baz': {
'opt5': 5,
'opt6': 6,
}
}
}
}
I should point out that there can and will be multiple top-level keys ('foo' in this case). I could probably throw something together to get what i need, but I was hoping that there is a solution that's more efficient. | 0 | [
2,
376,
20,
1600,
21,
5385,
69,
13,
16315,
37,
21,
1844,
53,
800,
3726,
3726,
31,
57,
21,
13,
16315,
15,
30,
1879,
101,
48,
45,
13,
1,
13,
22,
4120,
111,
22,
45,
13,
1,
13,
22,
2594,
38,
165,
22,
45,
137,
15,
13,
22,
259... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XDS SubmitObjectsRequest message with a XDSFolder?
===
Does anyone has or point me to a sample SubmitObjectsRequest message with XDSFolder? | 0 | [
2,
993,
43,
18,
12298,
23793,
18,
99,
10351,
2802,
29,
21,
993,
43,
18,
8814,
106,
60,
800,
3726,
3726,
630,
1276,
63,
54,
454,
55,
20,
21,
5717,
12298,
23793,
18,
99,
10351,
2802,
29,
993,
43,
18,
8814,
106,
60,
3,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Mount floppy image in cygwin
===
How can I mount a floppy image file using cygwin. I would like to mount the image, copy a file to the mounted drive, and then unmount it from the command line.
I know you can use [Virtual Floppy Drive][1] in windows, but is there a way to do this in Cygwin?
[1]: http://chitchat.at.infoseek.co.jp/vmware/vfd.html#beta | 0 | [
2,
2149,
28425,
1961,
19,
6728,
263,
4181,
800,
3726,
3726,
184,
92,
31,
2149,
21,
28425,
1961,
3893,
568,
6728,
263,
4181,
9,
31,
83,
101,
20,
2149,
14,
1961,
15,
4344,
21,
3893,
20,
14,
4897,
1493,
15,
17,
94,
367,
9780,
32,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I load different endpoints for WCF in SQL CLR?
===
We're deploying some new WCF calls in our SQL 2005 DB using the CLR. In testing, I hardcoded in the code the endpoint to connect to, and deployed it to our test server. When we go to deploy this to production, we will be deploying it to many different SQL DBs, and using different endpoints to connect to (same service running on different servers). How can something like this be done? Is there a config file that can be referenced for the deployment of the dll into SQL? | 0 | [
2,
184,
92,
31,
6305,
421,
241,
3132,
18,
26,
11801,
410,
19,
4444,
255,
10842,
139,
60,
800,
3726,
3726,
95,
22,
99,
17617,
68,
109,
78,
11801,
410,
3029,
19,
318,
4444,
255,
812,
13,
9007,
568,
14,
10842,
139,
9,
19,
4431,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I display the full content of LOB column in Oracle SQL*Plus?
===
When I try to display the contents of a LOB (large object) column in SQL*Plus, it is truncated. How do I display the whole thing? | 0 | [
2,
184,
107,
31,
3042,
14,
503,
2331,
16,
13,
10904,
4698,
19,
15759,
4444,
255,
2483,
13349,
60,
800,
3726,
3726,
76,
31,
1131,
20,
3042,
14,
8478,
16,
21,
13,
10904,
13,
5,
11312,
3095,
6,
4698,
19,
4444,
255,
2483,
13349,
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,
0,
0,
0,
0,
0... |
Regex - Repeating Header in a group
===
I am parsing text that has a heading and then data that applies to that heading. I need to break each data field into groups, and have the heading also apply to those groups. Here's an example:
<pre>
Heading 1
Heading 2 Heading 3
Line 1 data1 data2 data3 data4 data5
Line 2 data1 data2 data3 data4 data5
Line 3 data1 data2 data3 data4 data5
</pre>
The output should be like this:
<pre>
(line1) Heading1 Heading2 Heading3 data1 data2 data3 data4 data5
(line2) Heading1 Heading2 Heading3 data1 data2 data3 data4 data5
(line3) Heading1 Heading2 Heading3 data1 data2 data3 data4 data5
</pre>
The fields marked (line1-3) are just labels for the line, they are not meant to be part of the returned set.
I've done a bit of reading over the past couple of hours looking for what this is called, but I haven't had any luck. Any ideas?
Update: This is for the .Net regex engine. | 0 | [
2,
7953,
1706,
13,
8,
17389,
157,
106,
19,
21,
214,
800,
3726,
3726,
31,
589,
2017,
18,
68,
1854,
30,
63,
21,
4582,
17,
94,
1054,
30,
13169,
20,
30,
4582,
9,
31,
376,
20,
1442,
206,
1054,
575,
77,
1170,
15,
17,
57,
14,
4582,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 apache-jmeter check the return value of a URL for a correct response?
===
The set up for apache-jmeter allows for a URL to be sent to a web-server on multiple threads. I'm interested in first determining if the response codes are 200-500 and then whether the returned content is the expected content. Is this detailed configuration possible? | 0 | [
2,
92,
17140,
8,
728,
7307,
2631,
14,
788,
1923,
16,
21,
287,
6362,
26,
21,
4456,
1627,
60,
800,
3726,
3726,
14,
309,
71,
26,
17140,
8,
728,
7307,
2965,
26,
21,
287,
6362,
20,
44,
795,
20,
21,
2741,
8,
10321,
106,
27,
1886,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Capture console output for debugging in VS?
===
Under VS's external tools settings there is a "Use Output Window" check box that captures the tools command line output and dumps it to a VS tab.
The question is: *can I get the same processing for my program when I hit F5?*
| 0 | [
2,
3683,
8650,
5196,
26,
121,
16254,
2762,
19,
4611,
60,
800,
3726,
3726,
131,
4611,
22,
18,
4886,
4672,
12410,
80,
25,
21,
13,
7,
3699,
5196,
1463,
7,
2631,
1649,
30,
3683,
18,
14,
4672,
1202,
293,
5196,
17,
11424,
18,
32,
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... |
2d graphics effects 101: throwing something
===
I have a page in my desktop app, and I've implemented simple grab-and-pan. It works great.
When you are panning in this way and you are release, the page stops dead where you dropped it.
I'd like it to continue slightly with some momentum, and stop eventually. Rather like the 'throw' in the iPhone UI, I guess.
I'm not really chasing perfection, just a very crude simple sense of being able to 'throw' that page. | 1 | [
2,
172,
43,
8351,
2292,
7698,
45,
6033,
301,
800,
3726,
3726,
31,
57,
21,
2478,
19,
51,
17404,
4865,
15,
17,
31,
22,
195,
6807,
1935,
4931,
8,
290,
8,
3206,
9,
32,
693,
374,
9,
76,
42,
50,
1809,
2981,
19,
48,
161,
17,
42,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Wrapping BOOST in a separate namespace
===
I'm looking to have two versions of BOOST compiled into a project at the same time, how much trouble would I be getting into if I did something like this:
namespace boostv1 {
#include <boostv1/boost/regex.hpp>
}
namespace boostv2 {
#include <boostv2/boost/shared_ptr.hpp>
}
And then use them:
boostv2::boost::shared_ptr<SomeClass> someClass = new SomeClass();
boostv1::boost::regex expression("[0-9]", boostv1::boost::regex_constants::basic);
I realize for the regular expressions, that I'll have to wrap the source files too, but I'd rather modify just the few cpp files, than the dozens of header files. | 0 | [
2,
13437,
10419,
19,
21,
1725,
204,
5582,
800,
3726,
3726,
31,
22,
79,
699,
20,
57,
81,
3281,
16,
10419,
9316,
77,
21,
669,
35,
14,
205,
85,
15,
184,
212,
2572,
83,
31,
44,
1017,
77,
100,
31,
144,
301,
101,
48,
45,
204,
5582... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 time complexity of indexing, inserting and removing from common data structures?
===
There is no summary available of the big O notation for operations on the most common data structures including arrays, linked lists, hash tables etc. | 0 | [
2,
98,
25,
14,
85,
12745,
16,
4348,
68,
15,
14692,
68,
17,
9096,
37,
757,
1054,
3815,
60,
800,
3726,
3726,
80,
25,
90,
14740,
904,
16,
14,
580,
635,
15591,
26,
1311,
27,
14,
127,
757,
1054,
3815,
215,
7718,
18,
15,
4727,
7227,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Has anbody used BOO and can you comment on your experiences?
===
I'm looking for a groovy equivalent on .NET
http://boo.codehaus.org/
So far Boo looks interesting, but it is statically typed, yet does include some of the metaprogramming features I'd be looking for.
Can anyone comment on the experience of using BOO and is it worth looking into for more than hobby purposes at a 1.0 Version?
| 0 | [
2,
63,
40,
9760,
147,
9827,
17,
92,
42,
6484,
27,
154,
5513,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
3452,
2026,
93,
4602,
27,
13,
9,
2328,
7775,
6903,
10858,
9,
9375,
7972,
9,
5583,
118,
86,
463,
9827,
1879,
4883,
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... |
ASP.NET - Add Event Handler to LinkButton inside of Repeater in a RenderContent call
===
I've got a Sharepoint WebPart which loads a custom User Control. The user control contains a Repeater which in turn contains several LinkButtons.
In the RenderContent call in the Webpart I've got some code to add event handlers:
ArrayList nextPages = new ArrayList();
//populate nextPages ....
AfterPageRepeater.DataSource = nextPages;
AfterPageRepeater.DataBind();
foreach (Control oRepeaterControl in AfterPageRepeater.Controls)
{
if (oRepeaterControl is RepeaterItem)
{
if (oRepeaterControl.HasControls())
{
foreach (Control oControl in oRepeaterControl.Controls)
{
if (oControl is LinkButton)
{
((LinkButton)oControl).Click += new EventHandler(PageNavigateButton_Click);
}
}
}
}
}
The function PageNavigateButton_Click is never called however. I can see it being added as an event handler in the debugger however.
Any ideas? I'm stumped how to do this. | 0 | [
2,
28,
306,
9,
2328,
13,
8,
3547,
807,
24641,
20,
3508,
811,
444,
572,
16,
6830,
106,
19,
21,
16535,
25424,
645,
800,
3726,
3726,
31,
22,
195,
330,
21,
1891,
3132,
2741,
3091,
56,
19069,
21,
5816,
4155,
569,
9,
14,
4155,
569,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Reducing memory footprint of large unfamiliar codebase.
===
Suppose you have a fairly large (~400 KLOC), fairly old (~10 years) Windows desktop application in C/C++. About 10% of modules are external and don't have sources, only debug symbols.
How would you go about reducing application's memory footprint in half? At least, what would you do to find out where memory is consumed? | 0 | [
2,
7974,
1912,
18511,
16,
370,
17819,
1797,
8436,
9,
800,
3726,
3726,
5787,
42,
57,
21,
6647,
370,
13,
5,
1,
7114,
17966,
150,
6,
15,
6647,
315,
13,
5,
1,
1036,
122,
6,
1936,
17404,
3010,
19,
272,
118,
150,
20512,
9,
88,
12476... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PHP: How to return information to a waiting script and continue processing
===
Suppose there are two scripts Requester.php and Provider.php, and Requester requires processing from Provider and makes an http request to it (Provider.php?data="data"). In this situation, Provider quickly finds the answer, but to maintain the system must perform various updates throughout the database. Is there a way to immediately return the value to Requester, and then continue processing in Provider.
Psuedo Code
Provider.php
{
$answer = getAnser($_GET['data']);
echo $answer;
//SIGNAL TO REQUESTER THAT WE ARE FINISHED
processDBUpdates();
return;
} | 0 | [
2,
13,
26120,
45,
184,
20,
788,
676,
20,
21,
1672,
3884,
17,
1816,
5511,
800,
3726,
3726,
5787,
80,
50,
81,
17505,
3772,
106,
9,
26120,
17,
11747,
9,
26120,
15,
17,
3772,
106,
4781,
5511,
37,
11747,
17,
1364,
40,
7775,
3772,
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... |
Easy data conversion tool
===
I often have data in Excel or text that I need to get into SqlServer. I can use ODBC to query the Excel file and I can parse the text file. What I want though is some tool that will just grab the data and put it into tables with little / no effort. Does anyone know of such a tool? | 0 | [
2,
2010,
1054,
6263,
5607,
800,
3726,
3726,
31,
478,
57,
1054,
19,
20700,
54,
1854,
30,
31,
376,
20,
164,
77,
4444,
255,
10321,
106,
9,
31,
92,
275,
12340,
7229,
20,
25597,
14,
20700,
3893,
17,
31,
92,
2017,
870,
14,
1854,
3893,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ClickOnce app not working with Office 2007
===
I am a developer for a .net application that uses ClickOnce for deployment. I have deployed it over 60 times and computers have not had any issues downloading the latest release. However, when I deployed this morning, the following error occurs when computers with Office 2007 installed tries to start the application:
> Unable to install or run the application. The application requires that assembly stdole Version 7.0.3300.0 be installed in the Global Assembly Cache (GAC) first. Please contact your system administrator.
However, computers with Office 2003 can start the application with no problem.
Does anyone have any recommendations on resolving this issue? | 0 | [
2,
10840,
13120,
4865,
52,
638,
29,
488,
624,
800,
3726,
3726,
31,
589,
21,
10058,
26,
21,
13,
9,
2328,
3010,
30,
2027,
10840,
13120,
26,
10475,
9,
31,
57,
6698,
32,
84,
2083,
436,
17,
7774,
57,
52,
41,
186,
1549,
7121,
68,
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... |
MSExcel 2002 calling Web Services.
===
What is the easiest way to call a web service from Excel (I am using version 2002)? Please, no third party tools or libraries. This has to be easy with some VBA that I can paste there, use it, and ever touch. | 0 | [
2,
307,
6353,
11040,
1093,
2555,
2741,
687,
9,
800,
3726,
3726,
98,
25,
14,
27237,
161,
20,
645,
21,
2741,
365,
37,
20700,
13,
5,
49,
589,
568,
615,
1093,
6,
60,
2247,
15,
90,
422,
346,
4672,
54,
8649,
9,
48,
63,
20,
44,
201... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Satatic layers in a java web application
===
I am building a small website for fun/learning using a fairly standard Web/Service/Data Access layered design.
To save me from constantly having to create instances of my service layer/data access layer classes, I have made the methods in them all static. I shouldn't get concurrency issues as they use local variables etc and do not share any resources (things are simple enough for this at the moment).
As far as I can see the only trade-off for this is that I am not really following a true OO approach, but then again it keeps the code much cleaner.
Is there any reason this would not be a viable approach? What sort of problems might arise later on? Would it be better to have a "factory" class that can return me instances of the service and data layer classes as needed? | 0 | [
2,
847,
12479,
9124,
19,
21,
8247,
2741,
3010,
800,
3726,
3726,
31,
589,
353,
21,
284,
2271,
26,
2414,
118,
26001,
568,
21,
6647,
1236,
2741,
118,
11449,
118,
18768,
1381,
5385,
69,
704,
9,
20,
2079,
55,
37,
7545,
452,
20,
1600,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
java sound without hardware device
===
Anyone know if it is possible to write an app that uses the Java Sound API on a system that doesn't actually have a hardware sound device?
I have some code I've written based on the API that manipulates some audio and plays the result but I am now trying to run this in a server environment, where the audio will be recorded to a file instead of played to line out.
The server I'm running on has no sound card, and I seem to be running into roadblocks with Java Sound not being able to allocate any lines if there is not a Mixer that supports it. (And with no hardware devices I'm getting no Mixers.)
Any info would be much appreciated -
thanks. | 0 | [
2,
8247,
646,
366,
7610,
3646,
800,
3726,
3726,
1276,
143,
100,
32,
25,
938,
20,
2757,
40,
4865,
30,
2027,
14,
8247,
646,
21,
2159,
27,
21,
329,
30,
1437,
22,
38,
1121,
57,
21,
7610,
646,
3646,
60,
31,
57,
109,
1797,
31,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Parse HTML links using C#
===
Is there a built in dll that will give me a list of links from a string. I want to send in a string with valid html and have it parse all the links. I seem to remember there being something built into either .net or an unmanaged library. | 0 | [
2,
2017,
870,
13,
15895,
6271,
568,
272,
5910,
800,
3726,
3726,
25,
80,
21,
392,
19,
13,
43,
211,
30,
129,
590,
55,
21,
968,
16,
6271,
37,
21,
3724,
9,
31,
259,
20,
2660,
19,
21,
3724,
29,
7394,
13,
15895,
17,
57,
32,
2017,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WPF transparent borders causes the UI to stop redrawing
===
As a follow up to [my previous question][1], I am wondering how to use transparent windows correctly. If I have set my window to use transparency, the UI will occasionally appear to stop responding. What is actually happening is that the UI simply is not updating as it should. Animations do not occur, pages do not appear to navigate; however, if you watch the debugger clicking on buttons, links, etc.. do actually work. Minimizing and restoring the window "catches up" the UI again and the user can continue working until the behavior comes back.
If I remove the transparent borders, the behavior does not occur. Am I doing something wrong or is there some other setting, code, etc... that I need to implement to work with transparent borders properly?
Here is my window declaration for the code that fails.
<Window x:Class="MyProject.MainContainer"
xmlns="http://schemas.microsoft.com/winfx/2006/xaml/presentation"
xmlns:x="http://schemas.microsoft.com/winfx/2006/xaml"
Title="WPF APplication" Height="600" Width="800"
xmlns:egc="ControlLibrary" Background="{x:Null}"
BorderThickness="0"
AllowsTransparency="True"
MinHeight="300" MinWidth="400" WindowStyle="None" >
And the code that does not exhibit the behavior
<Window x:Class="MyProject.MainContainer"
xmlns="http://schemas.microsoft.com/winfx/2006/xaml/presentation"
xmlns:x="http://schemas.microsoft.com/winfx/2006/xaml"
Title="WPF Application" Height="600" Width="800"
xmlns:egc="ControlLibrary" Background="{x:Null}"
BorderThickness="0"
AllowsTransparency="False"
MinHeight="300" MinWidth="400" WindowStyle="None" >
[1]: http://stackoverflow.com/questions/104224/how-do-you-troubleshoot-wpf-ui-problems | 0 | [
2,
619,
7721,
14862,
5878,
4047,
14,
13,
5661,
20,
747,
402,
12404,
68,
800,
3726,
3726,
28,
21,
1740,
71,
20,
636,
915,
1158,
1301,
500,
2558,
165,
500,
15,
31,
589,
5712,
184,
20,
275,
14862,
1936,
12044,
9,
100,
31,
57,
309,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Z-index issue?
===
I have a div with a z-index of 0 on the default page of a site and this default page contains a iframe.
One of the pages in this iframe has a popup with a z-index of 1000. However, the div still overshadows the popup in IE but works fine in Firefox
Does anyone know what I can do? | 0 | [
2,
2052,
8,
25671,
1513,
60,
800,
3726,
3726,
31,
57,
21,
13,
12916,
29,
21,
2052,
8,
25671,
16,
713,
27,
14,
12838,
2478,
16,
21,
689,
17,
48,
12838,
2478,
1588,
21,
31,
8361,
9,
53,
16,
14,
4434,
19,
48,
31,
8361,
63,
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... |
Why does strcpy trigger a segmentation fault with global arguments?
===
So I've got some C code:
#include <stdio.h>
#include <string.h>
/* putting one of the "char*"s here causes a segfault */
void main() {
char* path = "/temp";
char* temp;
strcpy(temp, path);
}
This compiles, runs, and behaves as it looks. However, if one or both of the character pointers is declared as global variable, strcpy results in a segmentation fault. Why does this happen? Evidently there's an error in my understanding of scope. | 0 | [
2,
483,
630,
354,
5453,
6448,
7286,
21,
5631,
857,
4173,
29,
2062,
10553,
60,
800,
3726,
3726,
86,
31,
22,
195,
330,
109,
272,
1797,
45,
6926,
22640,
13,
1,
384,
6921,
9,
252,
1,
6926,
22640,
13,
1,
11130,
9,
252,
1,
13,
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... |
.NET: How to have background thread signal main thread data is available?
===
What is the proper technique to have **ThreadA** signal **ThreadB** of some event, without having **ThreadB** sit blocked waiting for an event to happen?
i have a background thread that will be filling a shared List<T>. i'm trying to find a way to asynchronously signal the "main" thread that there is data available to be picked up.
i considered setting an event with an EventWaitHandle object, but i can't have my main thread sitting at an Event.WaitOne().
i considered having a delegate callback, but
a) i don't want the main thread doing work in the delegate: the thread needs to get back to work adding more stuff - i don't want it waiting while the delegate executes, and
b) the delegate needs to be marshalled onto the main thread, but i'm not running a UI, i have no Control to .Invoke the delegate against.
i considered have a delegate callback that simply starts a zero interval System.Windows.Forms.Timer (with thread access to the timer synchronized). This way the thread only needs to be stuck as it calls
`Timer.Enabled = true;`
but that seems like a hack.
In the olden days my object would have created a hidden window and had the thread post messages to that hidden windows' HWND. i considered creating a hidden control, but i gather that you cannot .Invoke on a control with no handle created. Plus, i have no UI: my object could have been created on a web-server, service, or console, i don't want there to be a graphical control appearing - nor do i want to compile a dependency on System.Windows.Forms.
What is the proper technique to have thread A signal thread B of some event, without having thread B sit blocked waiting for an event to happen? | 0 | [
2,
13,
9,
2328,
45,
184,
20,
57,
2395,
9322,
2800,
407,
9322,
1054,
25,
904,
60,
800,
3726,
3726,
98,
25,
14,
4119,
4873,
20,
57,
13,
1409,
96,
99,
4405,
1409,
2800,
13,
1409,
96,
10647,
220,
1409,
16,
109,
807,
15,
366,
452,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
INTERFACES... Why cant I seem to grasp them
===
Could someone please demystify interfaces for me or point me to some good examples. I keep seeing interfaces popup here and there but i havent ever really been exposed to good explanations of interfaces or when to use them? | 0 | [
2,
6573,
18,
9,
9,
9,
483,
2973,
31,
2260,
20,
10677,
105,
800,
3726,
3726,
110,
737,
2247,
121,
915,
384,
8612,
6573,
18,
26,
55,
54,
454,
55,
20,
109,
254,
3770,
9,
31,
643,
2078,
6573,
18,
1675,
576,
235,
17,
80,
47,
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... |
Fast plane rotation algorithm?
===
I am working on an application that detects the most prominent rectangle in an image, then seeks to rotate it so that the bottom left of the rectangle rests at the origin, similar to how IUPR's [OSCAR][1] system works. However, once the most prominent rectangle is detected, I am unsure how to take into account the depth component or z-axis, as the rectangle won't always be "head-on". Any examples to further my understanding would be greatly appreciated. Seen below is an example from IUPR's OSCAR system.
![alt text][2]
[1]: http://demo.iupr.org/oscar/oscar.php "OSCAR"
[2]: http://quito.informatik.uni-kl.de/oscar/oscar.php?serverimage=img_0324.jpg&montage=use "Rotation Example" | 0 | [
2,
1512,
3627,
9431,
9083,
60,
800,
3726,
3726,
31,
589,
638,
27,
40,
3010,
30,
9092,
18,
14,
127,
2357,
27181,
19,
40,
1961,
15,
94,
12281,
20,
21448,
32,
86,
30,
14,
2129,
225,
16,
14,
27181,
760,
18,
35,
14,
2986,
15,
835,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 some of the pros and cons of using jQuery?
===
As someone who is only barely proficient in javascript, is jQuery right for me? Is there a better library to use? I've seen lots of posts related to jQuery and it seems to be the most effective way to incorporate javascript into ASP.NET applications.
I've been out to <a href="http://jquery.com/">jQuery's</a> site and have found the tutorials and other helpful information. Any other reference material (i.e books, blogs, etc.) would be helpful.
Thanks! | 0 | [
2,
98,
50,
109,
16,
14,
895,
18,
17,
11608,
16,
568,
487,
8190,
93,
60,
800,
3726,
3726,
28,
737,
72,
25,
104,
2886,
28140,
19,
8247,
8741,
15,
25,
487,
8190,
93,
193,
26,
55,
60,
25,
80,
21,
574,
1248,
20,
275,
60,
31,
22... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using PL/SQL how do you I get a file's contents in to a blob?
===
I have a file. I want to get its contents into a blob column in my oracle database or into a blob variable in my PL/SQL program. What is the best way to do that? | 0 | [
2,
568,
12443,
118,
18,
22402,
184,
107,
42,
31,
164,
21,
3893,
22,
18,
8478,
19,
20,
21,
334,
10904,
60,
800,
3726,
3726,
31,
57,
21,
3893,
9,
31,
259,
20,
164,
82,
8478,
77,
21,
334,
10904,
4698,
19,
51,
15759,
6018,
54,
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... |
Generic cache of objects
===
Does anyone know any implementation of a templated cache of objects?
- You use a key to find object (the same as in std::map<>)
- You specify a maximum number of objects that can be in the cache at the same time
- There are facilities to create an object not found in the cache
- There are facilities to know when an object is discarded from the cache
For example :
typedef cache<int, MyObj*> MyCache;
MyCache oCache;
oCache.SetSize(1);
oCache.Insert(make_pair(1, new MyObj());
oCache.Touch(1);
MyObj* oldObj = oCache.Delete(1);
...
It can be as simple as a LRU or MRU cache.
Any suggestions are welcomed!
Nic | 0 | [
2,
12733,
16522,
16,
3916,
800,
3726,
3726,
630,
1276,
143,
186,
6123,
16,
21,
22894,
43,
16522,
16,
3916,
60,
13,
8,
42,
275,
21,
1246,
20,
477,
3095,
13,
5,
124,
205,
28,
19,
354,
43,
45,
45,
15022,
1,
6,
13,
8,
42,
19077,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
jQuery onClick execution
===
I have this bit of javascript written with jQuery 1.2.5. It's contained inside the main function() of a plugin that I wrote. The plugin is a horizontal gallery scroller very similar to jCarousel. It does alot of auto calculating of widths and determines how many to scroll based on that and the size of the images, which is what all the calculations are that are going on.
What my question is, how do I prevent this from firing off before a previous execution is finished. For instance, if I get a little click happy and just frantically mash down on `.digi_next`. Things don't go so well in the UI when that happens and I'd like to fix it :) I thought the answer might lie in `queue`, but all my attempts at using it haven't turned out anything worthwhile.
var self = this;
$(".digi_next", this.container).click(function(){
var curLeft = $(".digi_container", self.container).css("left").split("px")[0];
var newLeft = (curLeft*1) - (self.containerPad + self.containerWidth) * self.show_photos;
if (newLeft < ((self.digi_gal_width - (self.containerPad + self.containerWidth) * self.show_photos)) * -1) {
newLeft = ((self.digi_gal_width - (self.containerPad + self.containerWidth) * self.show_photos)) * -1;
}
$(".digi_container", self.container).animate({
left: newLeft + "px"
}, self.rotateSpeed);
});
Thanks! | 0 | [
2,
487,
8190,
93,
27,
150,
10129,
5769,
800,
3726,
3726,
31,
57,
48,
1142,
16,
8247,
8741,
642,
29,
487,
8190,
93,
137,
9,
135,
9,
264,
9,
32,
22,
18,
3437,
572,
14,
407,
1990,
5,
6,
16,
21,
10922,
108,
30,
31,
738,
9,
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 line up items of varied length in a resizable space in CSS?
===
I'd like to line up items approximately like this:
item1 item2 i3 longitemname
i4 longitemname2 anotheritem i5
Basically items of varying length arranged in a table like structure. The tricky part is the container for these can vary in size and I'd like to fit as many as I can in each row - in other words, I won't know beforehand how many items fit in a line, and if the page is resized the items should re-flow themselves to accommodate. Eg. initially 10 items could fit on each line, but on resize it could be reduced to 5.
I don't think I can use an html table since I don't know the number of columns (since I don't know how many will fit on a line). I can use css to float them, but since they're of varying size they won't line up.
So far the only thing I can think of is to use javascript to get the size of largest item, set the size of all items to that size, and float everything left.
Any better suggestions?
| 0 | [
2,
184,
20,
293,
71,
3755,
16,
9630,
1476,
19,
21,
10719,
3186,
579,
726,
19,
272,
18,
18,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
293,
71,
3755,
1357,
101,
48,
45,
9101,
165,
9101,
135,
31,
240,
175,
2119,
79,
7259,
31,
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... |
Setting up an architecture department
===
Some context upfront:
Imagine a 200+ developers company finally setting up a more or less independent architecture team/department.
The software portfolio consisting of 20+ "projects"/applications of varying sizes in production was taken care of by team-leads/technical-leads, who were responsible for and in charge of the projects "architecture" as well.
Out the necessity to consolidate and control the architecture and enable certain needed large reworks on the systems as a whole, in addition of the all so needed knowledge exchange, the company decided to set-up an architecture department.
- What are the **DO**s and **DON'T**s of such an undertaking?
- Who are the people making up such an architecture team?
- What should be their responsibilities?
- What's out of their scope?
- What are the useful transition strategies for the company?
- How to prevent those wry looks every time someone even mentions "the architecture team"?
- Did your company undergo such a change already successfully?<br/>Why did it fail?<br/>Why was it successful?
That's should **not** be a discussion on "What is architecutre?"(which is very closely related ;).
The really interesting points would be acceptable/realistic maybe even frictionless ways to install such a team, besides of course some warnings regarding battles better not to be even started. | 0 | [
2,
2697,
71,
40,
2607,
604,
800,
3726,
3726,
109,
4141,
71,
8068,
45,
4382,
21,
2327,
2430,
10168,
237,
722,
2697,
71,
21,
91,
54,
787,
1124,
2607,
173,
118,
29263,
9,
14,
2306,
10588,
4160,
16,
434,
2430,
13,
7,
21011,
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 to return multiple values in one column (T-SQL)?
===
I have [UserAliases] (UserId, Alias) table with multiple Aliases per user. I need to query it and return all aliases for a given user, the trick is to return them all in one column.
Example:
UserId/Alias
1/MrX
1/MrY
1/MrA
2/Abc
2/Xyz
I want the query result in the following format:
UserId/Alias
1/ MrX, MrY, MrA
2/ Abc, Xyz
Thank you.
I'm using MSSQL Server 2005.
p.s. actual t-sql query would be appreciated :) | 0 | [
2,
184,
20,
788,
1886,
4070,
19,
53,
4698,
13,
5,
38,
8,
18,
22402,
6,
60,
800,
3726,
3726,
31,
57,
636,
16704,
10060,
7202,
500,
13,
5,
3699,
5175,
15,
15794,
6,
859,
29,
1886,
15794,
160,
416,
4155,
9,
31,
376,
20,
25597,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Invalid group name: Group names must begin with a word character
===
I received the following exception when I was using the Regex class with the regular expression: (?'named a'asdf)
System.ArgumentException: parsing \"(?'named a'asdf)\" - Invalid group name: Group names must begin with a word character.
What is the problem with my regular expression?
| 0 | [
2,
16671,
214,
204,
45,
214,
1817,
491,
2348,
29,
21,
833,
925,
800,
3726,
3726,
31,
420,
14,
249,
5391,
76,
31,
23,
568,
14,
7953,
1706,
718,
29,
14,
1290,
1803,
45,
13,
5,
5663,
11482,
21,
22,
472,
8736,
6,
329,
9,
512,
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... |
Timed events with php/MySQL
===
I need a way to modify a value in a table after a certain amount of time has passed. My current method is as follow:
- insert end time for wait period in table
- when a user loads a page requesting the value to be changed, check to see if current >= end time
- if it is, change the value and remove the end time field, if it isn't, do nothing
This is going to be a major feature on the site, and so efficiency is the key; with that in mind, you can probably see the problem with how I'm doing it. That same chunk of code is going to be called every time someone access a page that needs the information.
Any suggestions for improvements or better methods would be greatly appreciated, preferably in php or perl. | 0 | [
2,
85,
43,
963,
29,
13,
26120,
118,
915,
18,
22402,
800,
3726,
3726,
31,
376,
21,
161,
20,
17579,
21,
1923,
19,
21,
859,
75,
21,
1200,
2006,
16,
85,
63,
1100,
9,
51,
866,
2109,
25,
28,
1740,
45,
13,
8,
14692,
241,
85,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
robust and fast checksum algorithm
===
Which checksum algorithm can you recommend in this use case:
I want to generate checksums of small JPEG files (~8kb each) to check if the content changed.<br/>
The checksum need not be cryptographically strong but it should robustly indicate changes of any size.
The second criterion is **speed** since it should be possible to process at least *hundreds* of images per second (on a modern CPU). | 0 | [
2,
15313,
17,
1512,
16602,
723,
9083,
800,
3726,
3726,
56,
16602,
723,
9083,
92,
42,
12360,
19,
48,
275,
610,
45,
31,
259,
20,
7920,
16602,
723,
18,
16,
284,
487,
20427,
6488,
13,
5,
1,
457,
18167,
206,
6,
20,
2631,
100,
14,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
how to determine if a record in every source, represents the same person
===
I have several sources of tables with personal data, like this:
SOURCE 1
ID, FIRST_NAME, LAST_NAME, FIELD1, ...
1, jhon, gates ...
SOURCE 2
ID, FIRST_NAME, LAST_NAME, ANOTHER_FIELD1, ...
1, jon, gate ...
SOURCE 3
ID, FIRST_NAME, LAST_NAME, ANOTHER_FIELD1, ...
2, jhon, ballmer ...
So, assuming that records with ID 1, from sources 1 and 2, are the same person, my problem **is how to determine if a record in every source, represents the same person**. Additionally, sure not every records exists in all sources. All the names, are written in spanish, mainly.
In this case, the exact matching needs to be relaxed because we assume *the data sources has not been rigurously checked* against the official bureau of identification of the country. Also we need to assume *typos are common*, because the nature of the processes to collect the data. What is more, the amount of records is around 2 or 3 millions in every source...
Our team had thought in something like this: first, force exact matching in selected fields like ID NUMBER, and NAMES to know how hard the problem can be. Second, relaxing the matching criteria, and count how much records more can be matched, but is here where the problem arises: **how to do to relax the matching criteria without generating too noise neither restricting too much?**
What tool can be more effective to handle this?, for example, do you know about some especific extension in some database engine to support this matching?
Do you know about clever algorithms like [soundex][1] to handle this approximate matching, but for spanish texts?
Any help would be appreciated!
Thanks.
[1]: http://en.wikipedia.org/wiki/Soundex | 0 | [
2,
184,
20,
3746,
100,
21,
571,
19,
352,
1267,
15,
4719,
14,
205,
840,
800,
3726,
3726,
31,
57,
238,
2662,
16,
7484,
29,
1319,
1054,
15,
101,
48,
45,
1267,
137,
4924,
15,
64,
1,
7259,
15,
236,
1,
7259,
15,
575,
165,
15,
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... |
Does the size of the constructor matter if you're using Inversion of Control?
===
So I've got maybe 10 objects each of which has 1-3 dependencies (which I think is ok as far as loose coupling is concerned) but also some settings that can be used to define behavior (timeout, window size, etc).
Now before I started using an Inversion of Control container I would have created a factory and maybe even a simple ObjectSettings object for each of the objects that requires more than 1 setting. I am now using an inversion of control container and I just don't see all that much of a point to it. Sure I might get a constructor with 7 parameters, but who cares? It's all being filled out by the IoC anyways.
Am I missing something here or is this basically correct? | 0 | [
2,
630,
14,
1072,
16,
14,
6960,
248,
1161,
100,
42,
22,
99,
568,
19,
10898,
16,
569,
60,
800,
3726,
3726,
86,
31,
22,
195,
330,
913,
332,
3916,
206,
16,
56,
63,
137,
8,
240,
29411,
13,
5,
2140,
31,
277,
25,
5854,
28,
463,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Determine the ID of the JSF container form
===
I need to determine the ID of a form field from within an action handler. The field is a part of a included facelets component and so the form will vary.
**included.xhtml**
<ui:component>
<h:inputText id="contained_field"/>
<h:commandButton actionListener="#{backingBean.update}" value="Submit"/>
</ui:component>
**example_containing.xhtml**
<h:form id="containing_form">
<ui:include src="/included.xhtml"/>
</h:form>
How may I determine the ID of the form in the `update` method at runtime? Or better yet, the ID of the input field directly. | 0 | [
2,
3746,
14,
4924,
16,
14,
487,
18,
410,
12147,
505,
800,
3726,
3726,
31,
376,
20,
3746,
14,
4924,
16,
21,
505,
575,
37,
363,
40,
1028,
24641,
9,
14,
575,
25,
21,
141,
16,
21,
506,
276,
11045,
5912,
17,
86,
14,
505,
129,
739... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 callbacks stop operations in rails
===
If a callback handler returns false, does it cause only the handlers for *that* callback to not be called, or does it cause the remaining callbacks in that handler and all subsequent callbacks to not be called as well? | 0 | [
2,
107,
645,
1958,
18,
747,
1311,
19,
2240,
18,
800,
3726,
3726,
100,
21,
645,
1958,
24641,
4815,
4997,
15,
630,
32,
1679,
104,
14,
24641,
18,
26,
1637,
887,
2483,
645,
1958,
20,
52,
44,
227,
15,
54,
630,
32,
1679,
14,
1846,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Oracle Global Temporary Table / PHP interaction question
===
I've never used the Global Temporary Tables however I have some questions how they will work in a php environment.
How is data shared: Assuming persistent connections to oracle through php using oci8. Is the data tied to a database id? is it done based on the Apache httpd demons? Or is each individual request unique?
When is the data for the session cleared from the global temporary table? I'm assuming (or rather hoping) that its done when the php script exits. Alternatively if not I'm assuming I'll need to remove it before script exit.
| 0 | [
2,
15759,
2062,
4700,
859,
13,
118,
13,
26120,
7754,
1301,
800,
3726,
3726,
31,
22,
195,
243,
147,
14,
2062,
4700,
7484,
207,
31,
57,
109,
2346,
184,
59,
129,
170,
19,
21,
13,
26120,
2307,
9,
184,
25,
1054,
2592,
45,
11704,
1534... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 fix a Cross language installation problem in SQL Server 2008?
===
I'm trying to do a SQL Server 2008 setup and I've been given a Cross Language Installation failure. More specifically:
Rule "cross language installation: failed.
the Setup language is different than the language of existing SQL Server features. To continue, use SQL Server Setup installation media of the same language as the installed SQL Server features.
I do not have SQL Server Express installed and I browsed through "Add or Remove Programs" and was unable to find anything that looked like it was a previous version of SQL.
Any tips? | 0 | [
2,
184,
107,
31,
6098,
21,
919,
816,
7758,
1448,
19,
4444,
255,
8128,
570,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
107,
21,
4444,
255,
8128,
570,
18161,
17,
31,
22,
195,
74,
504,
21,
919,
816,
7758,
2990,
9,
91,
3524,
45,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Paging in Pervasive SQL
===
How to do paging in Pervasive SQL (version 9.1)? I need to do something similar like:
//MySQL
SELECT foo FROM table LIMIT 10, 10
But I can't find a way to define offset.
| 0 | [
2,
19006,
68,
19,
416,
8471,
1284,
4444,
255,
800,
3726,
3726,
184,
20,
107,
19006,
68,
19,
416,
8471,
1284,
4444,
255,
13,
5,
10898,
561,
9,
165,
6,
60,
31,
376,
20,
107,
301,
835,
101,
45,
12894,
915,
18,
22402,
5407,
4310,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Bypass .Net v3.5 verification when installing SQL Server 2008 Express
===
For some reason, when I try to install SQL Server 2008 Express, I get an error saying that I need to have .Net Framework 3.5 installed first, but the thing is: I already have! So could anybody tell me if I can bypass this verification by updating a registry key or something? I have np with visual studio or any other thing... just when I try to install sql express. | 0 | [
2,
8900,
13,
9,
2328,
566,
240,
9,
264,
25056,
76,
25429,
4444,
255,
8128,
570,
2999,
800,
3726,
3726,
26,
109,
1215,
15,
76,
31,
1131,
20,
16146,
4444,
255,
8128,
570,
2999,
15,
31,
164,
40,
7019,
1148,
30,
31,
376,
20,
57,
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... |
Possible pitfalls of using this (extension method based) shorthand
===
I regularly want to access properties on possibly null objects:
string propertyValue1 = null;
if( myObject1 != null )
propertyValue1 = myObject1.StringProperty;
int propertyValue2 = 0;
if( myObject2 != null )
propertyValue2 = myObject2.IntProperty;
And so on...
I use this so often that I have a snippet for it.
You can shorten this to some extent with an inline if:
propertyValue1 = myObject != null ? myObject.StringProperty : null;
However this is a little clunky, especially if setting lots of properties or if more than one level can be null, for instance:
propertyValue1 = myObject != null ?
(myObject.ObjectProp != null ? myObject.ObjectProp.StringProperty) : null : null;
What I really want is `??` style syntax, which works great for directly null types:
int? i = SomeFunctionWhichMightReturnNull();
propertyValue2 = i ?? 0;
So I came up with the following:
public static TResult IfNotNull<T, TResult>( this T input, Func<T, TResult> action, TResult valueIfNull )
where T : class
{
if ( input != null ) return action( input );
else return valueIfNull;
}
//lets us have a null default if the type is nullable
public static TResult IfNotNull<T, TResult>( this T input, Func<T, TResult> action )
where T : class
where TResult : class
{ return input.IfNotNull( action, null ); }
This lets me us this syntax:
propertyValue1 = myObject1.IfNotNull( x => x.StringProperty );
propertyValue2 = myObject2.IfNotNull( x => x.IntProperty, 0);
//or one with multiple levels
propertyValue1 = myObject.IfNotNull(
o => o.ObjectProp.IfNotNull( p => p.StringProperty ) );
This simplifies these calls, but I'm not sure about checking this sort of extension method in - it does make the code a little easier to read, but at the cost of extending object. This would appear on everything, although I could put it in a specifically referenced namespace.
This example is a rather simple one, a slightly more complex one would be comparing two nullable object properties:
if( ( obj1 == null && obj2 == null ) ||
( obj1 != null && obj2 != null && obj1.Property == obj2.Property ) )
...
//becomes
if( obj1.NullCompare( obj2, (x,y) => x.Property == y.Property )
...
What are the pitfalls of using extensions in this way? Are other coders likely to be confused? Is this just abuse of extensions?
| 0 | [
2,
938,
4175,
5660,
18,
16,
568,
48,
13,
5,
1706,
25573,
2109,
432,
6,
502,
3203,
800,
3726,
3726,
31,
4217,
259,
20,
1381,
3704,
27,
2879,
16203,
3916,
45,
3724,
1354,
15165,
165,
800,
16203,
73,
100,
5,
51,
23793,
165,
13,
187... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you avoid waiting for requirements when using iterative agile development methods like SCRUM?
===
We attempt to do agile development at my current job and we succeed for the most part. The main problem seems to be that the developers on the project are always waiting for requirements at the beginning of the sprint and rushing to get get things down by the end. The business analysts who are delivering the requirements are always working non-stop to get the requirements done. | 0 | [
2,
184,
107,
42,
2658,
1672,
26,
4786,
76,
568,
32,
106,
3366,
27475,
522,
3195,
101,
26562,
60,
800,
3726,
3726,
95,
1735,
20,
107,
27475,
522,
35,
51,
866,
1205,
17,
95,
7952,
26,
14,
127,
141,
9,
14,
407,
1448,
2206,
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... |
Underused Features of HTML
===
Yes, many web developers live and breath HTML, but there are still tags and tricks that aren't used as often as they could be. What are some of your favorites? | 4 | [
2,
131,
8795,
967,
16,
13,
15895,
800,
3726,
3726,
1643,
15,
151,
2741,
10168,
515,
17,
1090,
13,
15895,
15,
47,
80,
50,
174,
3383,
18,
17,
13747,
30,
4847,
22,
38,
147,
28,
478,
28,
59,
110,
44,
9,
98,
50,
109,
16,
154,
383... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What is best practices to push your site updates from dev/stage/testing evnironment to production?
===
Right now I have a development server running a basic LAMP configuration. The production server is a [slicehost][1]. But I'm wondering what is the best way to push the instances of the code/db to the stages dev > stage > production. Does it have to do with how you create the stages?
How do you do it without bring the site down? Is it even possible if you don't do load balancing?
I know this is somewhat general, I'm just looking to be pointed in the right direction.
[1]: http://www.slicehost.com/ | 0 | [
2,
98,
25,
246,
5242,
20,
3250,
154,
689,
16779,
37,
9664,
118,
9098,
118,
10543,
68,
13,
2443,
103,
11803,
1130,
20,
637,
60,
800,
3726,
3726,
193,
130,
31,
57,
21,
522,
8128,
946,
21,
2125,
6792,
8091,
9,
14,
637,
8128,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Visual Studio window Manager
===
I was wondering if anyone knows of a window manager for visual studio 2008 like [this one][1]. I really liked it, thats all i used in vs2005, and saw somewhere it supposed to work in vs2008 but it doesnt. I have tried it on many installations of vs2008 and it doesnt remember any settings. I really liked being able to easily change window layout quickly. Right now I just manuall import and export setting, but its not an instant process.
Or maybe someone knows what i have to do to make it work?
Thaknks in advance.
[1]: http://www.codeplex.com/VSWindowManager | 0 | [
2,
3458,
1120,
1463,
1382,
800,
3726,
3726,
31,
23,
5712,
100,
1276,
3620,
16,
21,
1463,
1382,
26,
3458,
1120,
570,
101,
636,
1565,
53,
500,
2558,
165,
500,
9,
31,
510,
3345,
32,
15,
30,
18,
65,
31,
147,
19,
4611,
2835,
15,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does my shared host's nameserver resolve http://servername.com/~username/ to my top level doman?
===
I recently moved my website to a shared hosting solution at [asmallorange.com][1], but I had to set my domain to use their provided nameservers in order for the site to properly resolve. I was determined to keep control of the domain's DNS but I could find no way to make my top level domain resolve to the shared location which was in the format of
server.asmallorange.com/~username
So I know I'm missing something here, my question is this: **What in their nameservers/DNS entry makes it possible for *server.sharedhost.com/~username* to serve as a top level domain? (ie. http://topleveldomain.com)**
[1]: http://asmallorange.com | 0 | [
2,
184,
630,
51,
2592,
2015,
22,
18,
204,
10321,
106,
9854,
7775,
6903,
10321,
106,
7259,
9,
960,
118,
1,
16704,
7259,
118,
20,
51,
371,
662,
107,
177,
60,
800,
3726,
3726,
31,
1989,
385,
51,
2271,
20,
21,
2592,
10637,
4295,
35,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 organize your namespaces?
===
So I have logical entities (person, country, etc.), gui elements / controls, data and navigation controllers / managers, then things like quadtrees and timers and I always struggle with cleanly separating these things into logical namespaces
I usually have something like this:
- Leviathan.GUI.Controls
- Leviathan.GUI.Views
- Leviathan.Entities
- Leviathan.Controllers (Data and other stuff)
- Leviathan.Helpers (Trees and other stuff)
are there any good guides on this? I need to step this mess. | 0 | [
2,
184,
107,
42,
9213,
154,
204,
5582,
18,
60,
800,
3726,
3726,
86,
31,
57,
11545,
12549,
13,
5,
7276,
15,
475,
15,
2722,
9,
6,
15,
9457,
2065,
13,
118,
8671,
15,
1054,
17,
8368,
9919,
18,
13,
118,
12657,
15,
94,
564,
101,
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... |
Ant Junit tests are running much slower via ant than via IDE - what to look at?
===
I am running my junit tests via ant and they are running substantially slower than via the IDE. My ant call is:
<junit fork="yes" forkmode="once" printsummary="off">
<classpath refid="test.classpath"/>
<formatter type="brief" usefile="false"/>
<batchtest todir="${test.results.dir}/xml">
<formatter type="xml"/>
<fileset dir="src" includes="**/*Test.java" />
</batchtest>
</junit>
The same test that runs in near instantaneously in my IDE (0.067s) takes 4.632s when run through Ant. In the past, I've been able to speed up test problems like this by using the junit fork parameter but this doesn't seem to be helping in this case. What properties or parameters can I look at to speed up these tests?
| 0 | [
2,
40,
38,
7446,
242,
4894,
50,
946,
212,
14085,
1197,
40,
38,
119,
1197,
13,
3448,
13,
8,
98,
20,
361,
35,
60,
800,
3726,
3726,
31,
589,
946,
51,
7446,
242,
4894,
1197,
40,
38,
17,
59,
50,
946,
13778,
14085,
119,
1197,
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... |
custom server control values lost in callback
===
I have a custom server control that loads data from a web service into a GridView. Works fine on my page. I want to be able to click on a row and pop a popupcontrol with more detail on the clicked row. I am using the client side events of the DevExpress gridview to handle the onclick. And from JavaScript I am calling a callbackpanel to access my custom server control to get properties to use in the popupcontrol. In the callback, the properties on my server control (which were previously set in order to display the data) are not set, yet any of the other standard controls on the page still have their property settings. Am I missing a setting in my customer server control that will persist my property settings into a callback?
Thanks. | 0 | [
2,
5816,
8128,
569,
4070,
529,
19,
645,
1958,
800,
3726,
3726,
31,
57,
21,
5816,
8128,
569,
30,
19069,
1054,
37,
21,
2741,
365,
77,
21,
7354,
4725,
9,
693,
1123,
27,
51,
2478,
9,
31,
259,
20,
44,
777,
20,
10840,
27,
21,
3131,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Adding headers to mail coming via exim4
===
I've got a Debian Etch system running Exim4-daemon-heavy.
The system is open to the internet, but the intention is that it will only receive legitimate mail coming from a spam-filtering service, which runs as a proxy ahead of it. (I can't just limit access to those IPs though, because I do have some authorized users who relay via my server on port 25. I know I should be using 587 - but currently I'm not.)
The general way this works is:
[Internet] -> [SMTP proxy] -> [My Server]
Unfortunately I've got spammers sending mail directly to the mailserver, and ignoring the MX record(s). So it seems like my obvious solution is to either:
1. Add a header to each processed message at the SMTP proxy.
2. Add a header at my server for each incoming message *unless* the mail is coming from an authorized relayer. (ie. Somebody who has completed SMTP AUTH.)
That way I could use procmail to just junk messages that came direct, via senders who ignored my MX records.
I'm pretty sure that Exim4 could be coerced into adding a header such as "X-Submitter: $ip" - to record the remote IP which submitted the message, but I'm unsure how that should be done. | 0 | [
2,
4721,
157,
445,
20,
4216,
880,
1197,
1396,
1660,
300,
800,
3726,
3726,
31,
22,
195,
330,
21,
121,
10035,
13,
19913,
329,
946,
1396,
1660,
300,
8,
593,
18062,
8,
19870,
9,
14,
329,
25,
368,
20,
14,
2620,
15,
47,
14,
5140,
25... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Sending raw data to FedEx Label printer
===
I'm working on a .NET WinForms app that needs to print a FEDEX shipping label. As part of the FedEx api, I can get raw label data for the printer.
I just don't know how to send that data to the printer through .NET (I'm using C#). To be clear, the data is already pre formatted into ZPL (Zebra printer language) I just need to send it to the printer without windows mucking it up.
Thanks ya'll
Sukhbir Dadwal
Software Engineer
Seattle, WA | 0 | [
2,
4907,
4333,
1054,
20,
6068,
1706,
1899,
12925,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
13,
9,
2328,
628,
4190,
18,
4865,
30,
2274,
20,
4793,
21,
6068,
1706,
7405,
1899,
9,
28,
141,
16,
14,
6068,
1706,
21,
2159,
15,
31,
92... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 htmlencode using html agility pack?
===
Has anyone done this? Basically, I want to use the html by keeping basic tags such as h1, h2, em, etc; clean all non http addresses in the img and a tags; and HTMLEncode every other tag.
I'm stuck at the HTML Encoding part. I know to remove a node you do a "node.ParentNode.RemoveChild(node);" where node is the object of the class HtmlNode. Instead of removing the node though, I want to HTMLEncode it. | 0 | [
2,
184,
107,
42,
13,
15895,
219,
9375,
568,
13,
15895,
28813,
3607,
60,
800,
3726,
3726,
63,
1276,
677,
48,
60,
11374,
15,
31,
259,
20,
275,
14,
13,
15895,
34,
2882,
2125,
3383,
18,
145,
28,
746,
165,
15,
746,
135,
15,
3579,
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... |
Testing if an Object is a Dictionary in C#
===
Is there a way to test if an object is a dictionary?
In a method I'm trying to get a value from a selected item in a list box. In some circumstances, the list box might be bound to a dictionary, but this isn't known at compile time.
I would like to do something similar to this:
if (listBox.ItemsSource is Dictionary<??>)
{
KeyValuePair<??> pair = (KeyValuePair<??>)listBox.SelectedItem;
object value = pair.Value;
}
Is there a way to do this dynamically at runtime using reflection? I know it's possible to use reflection with generic types and determine the key/value parameters, but I'm not sure if there's a way to do the rest after those values are retrieved. | 0 | [
2,
4431,
100,
40,
3095,
25,
21,
9186,
19,
272,
5910,
800,
3726,
3726,
25,
80,
21,
161,
20,
1289,
100,
40,
3095,
25,
21,
9186,
60,
19,
21,
2109,
31,
22,
79,
749,
20,
164,
21,
1923,
37,
21,
1704,
9101,
19,
21,
968,
1649,
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... |
Can WampServer be used sucessfully in production?
===
See title. Is this a bad idea? | 0 | [
2,
92,
619,
10158,
10321,
106,
44,
147,
21792,
160,
18,
5655,
19,
637,
60,
800,
3726,
3726,
196,
581,
9,
25,
48,
21,
896,
882,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I escape from a Snippet?
===
In C# when I am done entering the fields of a snippet, I can hit Enter to get to the next line. What is the equivalent Key in VB?
Edit: I prefer not to use the mouse. | 0 | [
2,
184,
107,
31,
2220,
37,
21,
13,
29061,
60,
800,
3726,
3726,
19,
272,
5910,
76,
31,
589,
677,
4604,
14,
2861,
16,
21,
13,
29061,
15,
31,
92,
770,
2830,
20,
164,
20,
14,
328,
293,
9,
98,
25,
14,
4602,
1246,
19,
13,
20468,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0... |
How do I copy a file in python?
===
How do I copy a file in python? I couldn't find anything under os. | 0 | [
2,
184,
107,
31,
4344,
21,
3893,
19,
20059,
60,
800,
3726,
3726,
184,
107,
31,
4344,
21,
3893,
19,
20059,
60,
31,
711,
22,
38,
477,
602,
131,
13,
759,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Best book to learn the Processing programming language?
===
I am a programmer interested in learning Processing (the programming language). [The main Processing site][1] is obviously the primary resource. Indeed they have much great information. They even include a [list][2] of fairly expensive books:
![alt text][3] ![alt text][4] ![alt text][5] ![alt text][6] ... and others
Let's assume that in addition to online resources, I want to get a **book** to study during my off-line time (airplane, toilet, subway, bed, etc.) Let's also assume that I am a programmer, rather than a visual artist (Processing is popular for art projects) so I don't need tutelage in programming basics.
Are you a Processing coder? Which books (above or others) do you recommend?
[1]: http://www.processing.org/
[2]: http://www.processing.org/learning/books/
[3]: http://www.processing.org/img/cover/cover_reasfry.jpg
[4]: http://www.processing.org/img/cover/cover_greenberg.jpg
[5]: http://www.processing.org/img/cover/cover_fry.jpg
[6]: http://www.processing.org/img/cover/cover_shiffman.jpg | 4 | [
2,
246,
360,
20,
2484,
14,
5511,
3143,
816,
60,
800,
3726,
3726,
31,
589,
21,
17968,
3158,
19,
2477,
5511,
13,
5,
124,
3143,
816,
6,
9,
636,
124,
407,
5511,
689,
500,
2558,
165,
500,
25,
4409,
14,
1256,
6577,
9,
4057,
59,
57,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best SQL libary for use in lisp?
===
Ideally something that will work with Oracle, MS SQL Server, MySQL and Posgress | 0 | [
2,
98,
25,
14,
246,
4444,
255,
13,
8326,
1857,
26,
275,
19,
2093,
3401,
60,
800,
3726,
3726,
5628,
102,
301,
30,
129,
170,
29,
15759,
15,
4235,
4444,
255,
8128,
15,
51,
18,
22402,
17,
12928,
13026,
3,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How can I automate exporting of tables into proper XML files from MSSQL or Access?
===
We have a customer requesting data in XML format. Normally this is not required as we usually just hand off an Access database or csv files and that is sufficient. However in this case I need to automate the exporting of proper XML from a dozen tables.
If I can do it out of SQL Server 2005, that would be preferred. However I can't for the life of me find a way to do this. I can dump out raw xml data but this is just a tag per row with attribute values. We need something that represents the structure of the tables. Access has an export in xml format that meets our needs. However I'm not sure how this can be automated. It doesn't appear to be available in any way through SQL so I'm trying to track down the necessary code to export the XML through a macro or vbscript.
Any suggestions? | 0 | [
2,
184,
92,
31,
3108,
5281,
7487,
68,
16,
7484,
77,
4119,
23504,
6488,
37,
4235,
18,
22402,
54,
1381,
60,
800,
3726,
3726,
95,
57,
21,
7705,
20033,
1054,
19,
23504,
2595,
9,
4147,
48,
25,
52,
1390,
28,
95,
951,
114,
224,
168,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 use XPathNodeIterator to iterate through a list of items in an XML file?
===
This is a sample (edited slightly, but you get the idea) of my XML file:
<HostCollection>
<ApplicationInfo />
<Hosts>
<Host>
<Name>Test</Name>
<IP>192.168.1.1</IP>
</Host>
<Host>
<Name>Test</Name>
<IP>192.168.1.2</IP>
</Host>
</Hosts>
</HostCollection>
When my application (VB.NET app) loads, I want to loop through the list of hosts and their attributes and add them to a collection. I was hoping I could use the XPathNodeIterator for this. The examples I found online seemed a little muddied, and I'm hoping someone here can clear things up a bit. | 0 | [
2,
184,
107,
31,
275,
993,
8353,
251,
546,
242,
106,
3457,
20,
32,
106,
1373,
120,
21,
968,
16,
3755,
19,
40,
23504,
3893,
60,
800,
3726,
3726,
48,
25,
21,
5717,
13,
5,
17629,
1847,
15,
47,
42,
164,
14,
882,
6,
16,
51,
23504... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Outlook Plug-In for custom CRM
===
I would like to write a plug-in that will allow a custom written CRM to read and write to their local Outlook client. I know that this poses a security concern. But, my clients are asking that their CRM "be connected" to Outlook. They would like to be able to do the following:
A) When a contact sends them an email (reply or free standing email), they'd like the details of this email to go INTO the CRM. Yep. They would like me to save the body, time and date it was sent, etc.
B) They want to be able to send new emails (or replies to existing emails) from within the CRM itself. Basically, "a form that looks like Outlook's send/reply email form".
C) Want the ability to search for contacts and the related emails with a search for tags/keywords facility. (i.e. if a product name or code appears in an email then they want the email returned in the search).
D) Having performed a search of many contacts, they will want to prepare a mailer and shoot out some sort of email announcement to their qualified leads. This could be 50, 100, or more persons. So its got to be able to allow bulk mailing.
E) Given a list of new prospects, that arent currently contacts in the CRM, they will want to do the same and if they get replies from this mailer to the prospects, the will want the replies to be saved in the DB and contacts be inserted into the DB.
F) They would like to be able to utilize the calendar and task list facilities of Outlook from the CRM, as well.
More or less, they want this pretty basic (as it is today) CRM that I created to integrate with Outlook and have it do so seamlessly as if it was an add-on to the CRM. A plug-in is what I am thinking...
But, I dont know where to begin. My environment is Windows XP/Vista and is going to be ASP.NET and I am going to use the VB.NET language to accomplish this. What do I need? Are there resources out there that can describe how to build a plug-in to Outlook as I have been asked to? This is not Exchange, none of the clients use exchange (not so far). They all run Outlook. Mostly 2003. Most clients are XP right now but some are upgrading to Vista.
For some reason I cant seem to wrap my head around this. I think the whole security issue is thwarting my ability to see past what is probably a simple thing. The client doesnt want to be prompted by any security messages asking them if they are sure they want to send 382 emails to their contacts. Not once and certainly not 382 times.
Where do I begin? I've searched the internet for similar but mainly what I found are already-written products and I've got to write this from scratch. | 0 | [
2,
19837,
10922,
8,
108,
26,
5816,
6186,
79,
800,
3726,
3726,
31,
83,
101,
20,
2757,
21,
10922,
8,
108,
30,
129,
1655,
21,
5816,
642,
6186,
79,
20,
1302,
17,
2757,
20,
66,
375,
19837,
6819,
9,
31,
143,
30,
48,
10810,
18,
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... |
Convert a string to a date in .net
===
I'm reading text from a flat file in c# and need to test whether certain values are dates. They could be in either YYYYMMDD format or MM/DD/YY format. What is the simplest way to do this in .Net? | 0 | [
2,
8406,
21,
3724,
20,
21,
1231,
19,
13,
9,
2328,
800,
3726,
3726,
31,
22,
79,
1876,
1854,
37,
21,
1844,
3893,
19,
272,
5910,
17,
376,
20,
1289,
1472,
1200,
4070,
50,
4076,
9,
59,
110,
44,
19,
694,
13,
93,
93,
93,
93,
3363,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why am I getting "multiple cascade paths" with this table relationship?
===
I have the following table relationship in my database:
Parent
/ \
Child1 Child2
\ /
GrandChild
I am trying to create the FK relationships so that the deletion of the Parent table cascades to both child and the grandchild table. For any one particular granchild, it will either be parented to one or the other child tables, but never both at the same time.
When I'm trying to add ON DELETE CASCADE to the FK relationships, everything is fine adding them to one "side" of the two children (Parent-Child1-GrandChild is fine for Cascade Delete). However, as soon as I add the Cascade Delete on the Child2 "side" of the relationship SQL tells me that the FK would cause multiple cascade paths. I was under the impression that multiple cascade paths only apply when more than one FK indicates the SAME table. Why would I be getting the multiple cascade paths error in this case?
PS The table relationships at this point would be very difficult to change so simply telling me to change my table structure is not going to be helpful, thanks. | 0 | [
2,
483,
589,
31,
1017,
13,
7,
21531,
5106,
13542,
12074,
7,
29,
48,
859,
1429,
60,
800,
3726,
3726,
31,
57,
14,
249,
859,
1429,
19,
51,
6018,
45,
4766,
13,
118,
13,
1,
850,
165,
850,
135,
13,
1,
13,
118,
920,
11287,
31,
589,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Code analysis
===
Does anyone know where to find an explanation to the warnings in vs 2005 codeanalysis tool. I would like some documentation, explainning why it creates the warnings it does and what course of action one should take. | 0 | [
2,
1797,
2495,
800,
3726,
3726,
630,
1276,
143,
113,
20,
477,
40,
5764,
20,
14,
3590,
18,
19,
4611,
812,
1797,
26293,
5607,
9,
31,
83,
101,
109,
13945,
15,
3271,
2981,
483,
32,
9695,
14,
3590,
18,
32,
630,
17,
98,
674,
16,
102... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Do you use the branches/tags/trunk convention?
===
Do you always follow the convention of putting branches, tags and trunk directories at the top level of your Subverion repository? Lately, I have stopped bothering and nothing bad has happened (yet)! It should be possible to move directory trees around if there's ever a need to create them. Am I building up trouble for later?
~~~ | 0 | [
2,
107,
42,
275,
14,
4395,
118,
8628,
18,
118,
8989,
5719,
3087,
60,
800,
3726,
3726,
107,
42,
550,
1740,
14,
3087,
16,
3873,
4395,
15,
3383,
18,
17,
6436,
559,
1596,
35,
14,
371,
662,
16,
154,
972,
2304,
872,
24869,
60,
10434,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Translating Int32 into ushort and back again
===
I am attempting to devise a system for packing integer values greater than 65535 into a ushort. Let me explain.
We have a system which generates Int32 values using an IDENTITY column from SQL Server and are limited by an in-production client API that overflows our Int32 IDs to ushorts. Fortunately the client only has about 20 or so instances of things with these IDs - let's call them packages - at any given time and it only needs to have them unique amongst local siblings. The generally accepted solution is to translate our Int32 IDs to ushorts (and no I don't mean casting, I mean translating) before transmitting them to the client, however there are barbs with this approach:
1. Some IDs less than 65535 may still be in play on a given client at any time due to non-expiration.
2. We cannot have any ID collisions - that is if package ID 1 goes to the client, an algorithm that tracks how many times 65535 is removed from an Int32 to make a ushort when applied to 65536 would also result in 1 thus causing a collision.
3. We must be able to reconstruct the ushort into the Int32 upon return.
What we have available to solve this problem is a single signed byte field that is echoed to us and gives us 127 values to play with (really 117 because we're using 0-9 for something else). I'll refer to this as the "byte field" from here on out.
We have discussed three different translation routines:
1. Multiplicative: store in the byte field how many times we remove 65535 from our Int32 to make a ushort. This has collision problems as detailed above.
2. Serialized Session State: for each client, generate a session ID based on facts about that client. Then store a 1:1 translation table starting from 1 up to the number of packages delivered so when the client accesses our server again the inventory of packages can be translated back to their known database IDs. This has overhead problems since we'd be backing serialized session state to a database and we want to support hundreds to thousands of transactions a second.
3. Varied algorithmic approach where the byte field is an ID of a transformative algorithm that takes an Int32 and transforms it into a ushort. Obviously many of these are going to be simple Multiplicative (to increase our ceiling of IDs we can transform) but some will have to be multiplicative with a smaller boundry (like 32768) with a number added to/subtracted from to get as close to a number that can be guaranteed unique amongst siblings. This approach is processor intensive but should allow us to avoid collisions while remaining scalable (though with this approach we have a limited ceiling that won't be reached before the ushort problem goes away on its own due to upgrades).
So my question is: is there a better way than my approaches above, and if not, what should I be looking for in terms of algorithms (for approach #3) to generate a number between 1-65535 when a given number is greater than 0 and must not be a one way hash? | 0 | [
2,
25237,
19,
38,
3125,
77,
287,
10849,
17,
97,
188,
800,
3726,
3726,
31,
589,
6314,
20,
29276,
21,
329,
26,
16683,
13820,
4070,
1894,
119,
2074,
264,
2599,
77,
21,
287,
10849,
9,
408,
55,
3271,
9,
95,
57,
21,
329,
56,
7920,
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.