unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
How would you unittest a memory allocator?
===
There's a lot of people today who sell unittesting as bread-and-butter of development. That might even work for strongly algorithmically-oriented routines. However, how would you unit-test, for example, a memory allocator (think malloc()/realloc()/free()). It's not hard to produce a working (but absolutely useless) memory allocator that satisfies the specified interface. But how to provide the proper context for unit-testing functionality that is absolutely desired, yet not part of the contract: coalescing free blocks, reusing free blocks on next allocations, returning excess free memory to the system, asserting that the allocation policy (e.g. first-fit) really is respected, etc.
My experience is that assertions, even if complex and time-consuming (e.g. traversing the whole free list to check invariants) are much less work and are more reliable than unit-testing, esp. when coding complex, time-dependent algorithms.
Any thoughts?
| 0 | [
2,
184,
83,
42,
1237,
10543,
21,
1912,
65,
2499,
3457,
60,
800,
3726,
3726,
80,
22,
18,
21,
865,
16,
148,
786,
72,
3344,
1237,
10543,
68,
28,
5988,
8,
290,
8,
811,
815,
16,
522,
9,
30,
530,
166,
170,
26,
5020,
9083,
8438,
8,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Jar file naming converntions
===
Are there any industry standard conventions for naming jar files? | 0 | [
2,
5112,
3893,
10929,
1065,
15877,
3309,
18,
800,
3726,
3726,
50,
80,
186,
1230,
1236,
15117,
26,
10929,
5112,
6488,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
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,
0,
0,
0,
0,
0... |
Logging JavaScript-Errors on Server
===
Im running a ASP.NET Site where I have problems to find some JavaScript-Errors just with manual testing.
Is there a possibility to catch all JavaScript-Errors on the Client Side and log them on the Server i.e. in the EventLog (via Webservice or something like that)?
Thanks for your answers!
| 0 | [
2,
13,
13919,
8247,
8741,
8,
29992,
18,
27,
8128,
800,
3726,
3726,
797,
946,
21,
28,
306,
9,
2328,
689,
113,
31,
57,
1716,
20,
477,
109,
8247,
8741,
8,
29992,
18,
114,
29,
5132,
4431,
9,
25,
80,
21,
4813,
20,
2949,
65,
8247,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Highlight a word with jQuery
===
I basically need to highlight a particular word in a block of text. For example, pretend I wanted to highlight the word "dolor" in this text:
<p>
Lorem ipsum dolor sit amet, consectetuer adipiscing elit.
</p>
<p>
Quisque bibendum sem ut lacus. Integer dolor ullamcorper libero.
Aliquam rhoncus eros at augue. Suspendisse vitae mauris.
</p>
How do I convert the above to something like this:
<p>
Lorem ipsum <span class="myClass">dolor</span> sit amet, consectetuer adipiscing elit.
</p>
<p>
Quisque bibendum sem ut lacus. Integer <span class="myClass">dolor</span> ullamcorper
libero. Aliquam rhoncus eros at augue. Suspendisse vitae mauris.
</p>
Is this possible with jQuery? | 0 | [
2,
14373,
21,
833,
29,
487,
8190,
93,
800,
3726,
3726,
31,
11374,
376,
20,
14373,
21,
1498,
833,
19,
21,
1921,
16,
1854,
9,
26,
823,
15,
8019,
31,
417,
20,
14373,
14,
833,
13,
7,
537,
7386,
7,
19,
48,
1854,
45,
13,
1,
306,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Locking binary files using git version control system
===
For one and a half years, I have been keeping my eyes on the git community in hopes of making the switch away from SVN. One particular issue holding me back is the inability to lock binary files. Throughout the past year I have yet to see developments on this issue. I understand that locking files goes against the fundamental principles of distributed source control, but I don't see how a web development company can take advantage of git to track source code and image file changes when there is the potential for binary file conflicts.
To achieve the effects of locking, a "central" repository must be identified. Regardless of the distributed nature of git, most companies will have a "central" repository for a software project. We should be able to mark a file as requiring a lock from the governing git repository at a specified address. Perhaps this is made difficult because git tracks file contents not files?
Do any of you have experience in dealing with git and binary files that should be locked before modification? | 0 | [
2,
17538,
14171,
6488,
568,
13,
10404,
615,
569,
329,
800,
3726,
3726,
26,
53,
17,
21,
519,
122,
15,
31,
57,
74,
2882,
51,
194,
27,
14,
13,
10404,
514,
19,
8410,
16,
544,
14,
5521,
229,
37,
13,
18,
16578,
9,
53,
1498,
1513,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's a good book for learning Ajax?
===
I am looking for a good book to learn about AJAX. Can anybody recommend good ones? I know I can go to www.asp.net site but nothing like reading a good book as compared to learning about it online. | 4 | [
2,
98,
22,
18,
21,
254,
360,
26,
2477,
20624,
60,
800,
3726,
3726,
31,
589,
699,
26,
21,
254,
360,
20,
2484,
88,
20624,
9,
92,
11181,
12360,
254,
53,
18,
60,
31,
143,
31,
92,
162,
20,
13,
6483,
9,
472,
306,
9,
2328,
689,
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,
0... |
How do you make the background of a video or picture clear in Quartz Composer?
===
I'd like to remove all of the black from a picture attached to a sprite so that it becomes transparent. | 0 | [
2,
184,
107,
42,
233,
14,
2395,
16,
21,
763,
54,
2151,
1207,
19,
20913,
3039,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
4681,
65,
16,
14,
319,
37,
21,
2151,
3638,
20,
21,
27902,
86,
30,
32,
2633,
14862,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How do you structure your URL routes?
===
Is there a specific pattern that developers generally follow? I never really gave it much thought before in my web applications, but the ASP.NET MVC routing engine pretty much forces you to at least take it into consideration.
So far I've liked the controller/action/index structure (e.g. Products/Edit/1), but I'm struggling with more complex urls.
For instance, let's say you have a page that lists all the products a user has in their account. How would you do it? Off the top of my head I can think of the following possibilities for a listing page and an edit page:
1. User/{user id}/Products/List, User/{user id}/Products/Edit/{product id}
2. User/{user id}/Products, User/{user id}/Products/{product id}
3. Products?UserID={user id}, Products/Edit/{product id}
I'm sure there are plenty of others that I'm missing. Any advice?
| 0 | [
2,
184,
107,
42,
1411,
154,
287,
6362,
5050,
60,
800,
3726,
3726,
25,
80,
21,
1903,
3732,
30,
10168,
1469,
1740,
60,
31,
243,
510,
492,
32,
212,
289,
115,
19,
51,
2741,
3767,
15,
47,
14,
28,
306,
9,
2328,
307,
8990,
19880,
140... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to create full screen color overlay effects in windows?
===
I remember my old Radeon graphics drivers which had a number of overlay effects or color filters (whatever they are called) that would render the screen in e.g. sepia tones or negative colors. My current NVIDIA card does not seem to have such a function so I wondered if it is possible to make my own for Vista.
I don't know if there is some way to hook into window's rendering engine or, alternatively, into NVIDIA's drivers to achieve this effect. While it would be cool to just be able to modify the color, it would be even better to modify the color based on its screen coordinates or perform other more varied functions. An example would be colors which are more desaturated the longer they are from the center of the screen.
I don't have a specific use scenario so I cannot provide much more information. Basically, I'm just curious if there is anything to work with in this area. | 0 | [
2,
25,
32,
938,
20,
1600,
503,
2324,
1665,
84,
4414,
2292,
19,
1936,
60,
800,
3726,
3726,
31,
1518,
51,
315,
13,
13065,
218,
8351,
5783,
56,
41,
21,
234,
16,
84,
4414,
2292,
54,
1665,
21062,
13,
5,
13515,
59,
50,
227,
6,
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... |
SQL Server 2005 / XML Stored Proc - Unicode to ascii? (Exception 0xc00ce508)
===
I have an MSSQL2005 stored procedure here, which is supposed to take an XML message as input, and store it's content into a table.
The table fields are varchars, because our delphi backend application could not handle unicode.
Now, the messages that come in, are encoded ISO-8859-1. All is fine until characters over the > 128 standard set are included (in this case, ÄÖäö, which are an integral part of finnish). This causes the DB server to raise exception 0xc00ce508.
The database's default, as well as the table's and field's, collation is set to latin1, which should be the same as ISO-8859-1.
Previously, the stored procedure used to use nvarchar for input, but since that caused problems with the ancient backend application (Delphi 5 + ODBC), we had to switch the fields to varchars, at which point everything broke.
I also tried taking in nvarchar and converting that to varchar at the start, but the result is the same. | 0 | [
2,
4444,
255,
8128,
812,
13,
118,
23504,
8214,
13,
15617,
13,
8,
28010,
20,
28,
1892,
49,
60,
13,
5,
10066,
872,
713,
21550,
2032,
1105,
264,
3099,
6,
800,
3726,
3726,
31,
57,
40,
4235,
18,
22402,
2835,
8214,
7004,
235,
15,
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... |
Getting Security Headers into a WCF service with custom message/formatter in .NET 3.0
===
We've inherited a WCF web service that has a custom MessageFormatter that constructs a custom Message subclass in the SerializeReply Method.
class OurMessageFormatter : MessageFormatter
{
public Message SerializeReply(MessageVersion messageVersion, object[] parameters, object result)
{
OurResponse ourResponse = (OurResponse) result;
// some validation here...
OurMessage reply = new OurMessage(ourResponse, MessageVersion.Soap11);
return reply;
}
}
The problem we're facing is that the custom Message subclass wouldn't have any headers populated. We tried to see if WCF would populate the generic ones (MessageID, ResponseTo, Action and such) out of the box, but no luck. Then we realized that the custom Message subclass had implemented the Headers Property like so...
class OurMessage : Message
{
public override MessageHeaders Headers
{
get { return new MessageHeaders(MessageVersion.Soap11WSAddressing10); }
}
}
... lotta help that turned out to be! So we rewrote it as so...
class OurMessage : Message
{
MessageHeaders headers;
public OurMessage()
{
// ...
headers = new MessageHeaders(MessageVersion.Soap11WSAddressing10);
}
public override MessageHeaders Headers
{
get { return headers; }
}
}
... and still no luck.
So we went on to hand code the headers; first in the Formatter...
class OurMessageFormatter : MessageFormatter
{
public Message SerializeReply(MessageVersion messageVersion, object[] parameters, object result)
{
//...
OurMessage reply = new OurMessage(ourResponse, MessageVersion.Soap11);
ourMessage.MessageID = ...;
ourMessage.ResponseTo = ...;
ourMessage.Action = ...;
// more headers set ...
return reply;
}
}
... and then in the Message itself...
class OurMessage : Message
{
public override MessageHeaders Headers
{
get
{
MessageHeaders headers = new MessageHeaders(MessageVersion.Soap11WSAddressing10);
ourMessage.MessageID = ...;
ourMessage.ResponseTo = ...;
ourMessage.Action = ...;
// more headers set ...
return headers;
}
}
}
Every way we tried, we managed to get the WS-Addressing headers into the actual response, but could never get the WS-Security header in (actually we were just trying to put in a Security Header with TimestampID and Created/Expires elements). Every time we added the Security header in the Security header, the service just dropped the connection unexpectedly during serialization (after the SerializeReply call had completed).
So here's my question. Does anyone know how to get the WS-Security headers into a WCF service with custom Formatter and custom Message implementation? | 0 | [
2,
1017,
1221,
157,
445,
77,
21,
11801,
410,
365,
29,
5816,
2802,
118,
23588,
815,
19,
13,
9,
2328,
203,
9,
387,
800,
3726,
3726,
95,
22,
195,
7179,
21,
11801,
410,
2741,
365,
30,
63,
21,
5816,
2802,
23588,
815,
30,
6960,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Difference between Visual C++ 2008 and 2005
===
I couldn't find any useful information on Microsoft's site, so here is the question: has the compiler in Visual C++ 2008 been improved significantly since the 2005 version? I'm especially looking for better optimization. | 0 | [
2,
2841,
128,
3458,
272,
20512,
570,
17,
812,
800,
3726,
3726,
31,
711,
22,
38,
477,
186,
4811,
676,
27,
7099,
22,
18,
689,
15,
86,
235,
25,
14,
1301,
45,
63,
14,
21486,
19,
3458,
272,
20512,
570,
74,
3999,
5085,
179,
14,
812,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Virtual member call in a constructor
===
I'm getting a warning from ReSharper about a call to a virtual member from my objects constructor. Why would this be something not to do? | 0 | [
2,
6599,
322,
645,
19,
21,
6960,
248,
800,
3726,
3726,
31,
22,
79,
1017,
21,
3590,
37,
302,
23646,
106,
88,
21,
645,
20,
21,
6599,
322,
37,
51,
3916,
6960,
248,
9,
483,
83,
48,
44,
301,
52,
20,
107,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Is it possible to determine the current user from within a global keyboard hook in .NET
===
I want to create a keyboard and mouse hook which will be started as a windows service. I want to monitor the activity of the various users who use the system throughout the day. i.e. which users are *active* at what times.
Is is possible to determine which user will be receiving the events? | 0 | [
2,
25,
32,
938,
20,
3746,
14,
866,
4155,
37,
363,
21,
2062,
8896,
5559,
19,
13,
9,
2328,
800,
3726,
3726,
31,
259,
20,
1600,
21,
8896,
17,
7567,
5559,
56,
129,
44,
373,
28,
21,
1936,
365,
9,
31,
259,
20,
7626,
14,
2358,
16,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Business Logic: Database or Application Layer
===
The age old question. Where should you put your business logic, in the database as stored procedures ( or packages ), or in the application/middle tier? And more importantly, Why? | 0 | [
2,
508,
7085,
45,
6018,
54,
3010,
5385,
800,
3726,
3726,
14,
348,
315,
1301,
9,
113,
378,
42,
442,
154,
508,
7085,
15,
19,
14,
6018,
28,
8214,
8876,
13,
5,
54,
16875,
13,
6,
15,
54,
19,
14,
3010,
118,
17927,
7197,
60,
17,
91... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Problem in writing to single file in Web service in .NET
===
I have created a web service in .net 2.0, C#. I need to log some information to a file whenever different methods are called by the web service clients.
The problem comes when one user process is writing to a file and another process tries to write to it. I get the error "The process cannot access the file because it is being used by another process".
The solutions that I have tried to implement in C# and failed are as below.
1) Implemented singleton class that contains code that writes to a file.
2) Used lock statement to wrap the code that writes to the file.
I have also tried to use open source logger log4net but it also is not a perfect solution. I know about logging to system event logger, but I do not have that choice.
I want to know if there exists a perfect and complete solution to such a problem?
I have posted this question once before on MSDN but didnt get a proper answer. Hope this time the nut is cracked :)
Thanks!
pradeep_tp | 0 | [
2,
1448,
19,
1174,
20,
345,
3893,
19,
2741,
365,
19,
13,
9,
2328,
800,
3726,
3726,
31,
57,
679,
21,
2741,
365,
19,
13,
9,
2328,
172,
9,
387,
15,
272,
5910,
9,
31,
376,
20,
6738,
109,
676,
20,
21,
3893,
6634,
421,
3195,
50,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you start building an ASP.NET web app?
===
Say for example you're getting a web app project that interacts with a database.
How do you start your development? Do you start by designing your database, drawing simple ERD and writting a create scripts? Do you start by designing the look of your of web app, maybe using photoshop, then create a master page for it? or do you start by designing your domain models, with minimal looks, and apply a preetier design later on? | 0 | [
2,
184,
107,
42,
799,
353,
40,
28,
306,
9,
2328,
2741,
4865,
60,
800,
3726,
3726,
395,
26,
823,
42,
22,
99,
1017,
21,
2741,
4865,
669,
30,
10001,
18,
29,
21,
6018,
9,
184,
107,
42,
799,
154,
522,
60,
107,
42,
799,
34,
15026,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
c# determine the number of lines within a text file
===
Is there an easy way to programmatically determine the number of lines within a text file? | 0 | [
2,
272,
5910,
3746,
14,
234,
16,
1560,
363,
21,
1854,
3893,
800,
3726,
3726,
25,
80,
40,
2010,
161,
20,
625,
6732,
1326,
3746,
14,
234,
16,
1560,
363,
21,
1854,
3893,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Tabs versus spaces in Python programming
===
I have always used tabs for indentation when I do Python programming. But then I came across a question here on SO where someone pointed out that most Python programmers use spaces instead of tabs to minimize editor-to-editor mistakes.
How does that make a different? Are there other reasons why you would use spaces instead of tabs for Python? Or is it simply not true?
Should I switch my editor to insert spaces instead of tabs right away or keep on going like I used to? | 0 | [
2,
6523,
18,
5706,
7644,
19,
20059,
3143,
800,
3726,
3726,
31,
57,
550,
147,
6523,
18,
26,
19,
817,
8593,
76,
31,
107,
20059,
3143,
9,
47,
94,
31,
281,
464,
21,
1301,
235,
27,
86,
113,
737,
2489,
70,
30,
127,
20059,
17968,
18,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Disabling Warnings generated via _CRT_SECURE_NO_DEPRECATE
===
What is the best way to disable the warnings generated via `_CRT_SECURE_NO_DEPRECATE` that allows them to be reinstated with ease and will work across Visual Studio versions? | 0 | [
2,
1460,
58,
8599,
3590,
18,
6756,
1197,
13,
1,
6711,
38,
1,
22917,
1,
251,
1,
546,
3515,
9530,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
1460,
579,
14,
3590,
18,
6756,
1197,
13,
1,
6711,
38,
1,
22917,
1,
251,
1,
546,
3515,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 MVC Preview 5 and IIS 6 Windows Authentication
===
I've just built a basic ASP MVC web site for deployment on our intranet. It expects users to be on the same domain as the IIS box and if you're not an authenticated Windows User, you should not get access.
I've just deployed this to IIS6 running on Server 2003 R2 SP2. The web app is configured with it's own pool with it's own pool user account. The IIS Directory Security options for the web app are set to "Windows Integrated Security" only and the web.config file has <authentication mode="Windows" />.
From a Remote Desktop session on the IIS6 server itself, an IE7 browser window can successfully authenticate and navigate the web app if accessed via http://localhost/myapp.
However, also from the server, if accessed via the server's name (ie http://myserver/myapp) then IE7 presents a credentials dialog which after three attempts entering the correct credentials eventually returns "HTTP Error 401.1 - Unauthorized: Access is denied due to invalid credentials".
The same problem occurs when a workstation browses to the web app url (naturally using the server's name and not "localhost").
The IIS6 server is a member of the only domain we have and has no firewall enabled.
Is there something I have failed to configure correctly for this to work?
Thanks, | 0 | [
2,
28,
306,
307,
8990,
16121,
331,
17,
595,
18,
400,
1936,
27963,
800,
3726,
3726,
31,
22,
195,
114,
392,
21,
2125,
28,
306,
307,
8990,
2741,
689,
26,
10475,
27,
318,
14369,
2328,
9,
32,
4186,
18,
3878,
20,
44,
27,
14,
205,
46... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 route in linux
===
I have 20 ips from my isp. I have them bound to a router box running centos. What commands, and in what order, do I set up so that the other boxes on my lan, based either on their mac addresses or 192 ips can I have them route out my box on specific ips. For example I want mac addy xxx:xxx:xxx0400 to go out 72.049.12.157 and xxx:xxx:xxx:0500 to go out 72.049.12.158.
| 0 | [
2,
184,
20,
858,
19,
13024,
800,
3726,
3726,
31,
57,
434,
31,
1919,
37,
51,
25,
306,
9,
31,
57,
105,
4138,
20,
21,
858,
139,
1649,
946,
5802,
759,
9,
98,
14294,
15,
17,
19,
98,
389,
15,
107,
31,
309,
71,
86,
30,
14,
89,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where is a good place to brush up on some math?
===
Math skills are becoming more and more essential, I'm wonder where is a good place to brush up on some basics before moving on to some more CompSci specific stuff?
A sight with lots of video's as well as practise exercises would be a double win but I cant seem to find one. | 0 | [
2,
113,
25,
21,
254,
209,
20,
7588,
71,
27,
109,
5057,
60,
800,
3726,
3726,
5057,
3207,
50,
1535,
91,
17,
91,
5832,
15,
31,
22,
79,
2666,
113,
25,
21,
254,
209,
20,
7588,
71,
27,
109,
2125,
18,
115,
1219,
27,
20,
109,
91,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Storing xml data in a cookie
===
I'm trying to store an xml serialized object in a cookie, but i get an error like this:
A potentially dangerous Request.Cookies value was detected from the client (KundeContextCookie="<?xml version="1.0" ...")
I know the problem from similiar cases when you try to store something that looks like javascript code in a form input field.
What is the best practise here? Is there a way (like the form problem i described) to supress this warning from the asp.net framework, or should i JSON serialize instead or perhaps should i binary serialize it? What is common practise when storing serialized data in a cookie? | 0 | [
2,
25615,
23504,
1054,
19,
21,
19980,
800,
3726,
3726,
31,
22,
79,
749,
20,
1718,
40,
23504,
27877,
3095,
19,
21,
19980,
15,
47,
31,
164,
40,
7019,
101,
48,
45,
21,
9465,
3342,
3772,
9,
20840,
1596,
1923,
23,
11968,
37,
14,
6819... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Running scripts inside C#
===
I want to run javascript/Python/Ruby inside my application.
I have an application that creates process automatically based on user's definition. The process is generated in C#. I want to enable advanced users to inject script in predefined locations. Those scripts should be run from the C# process.
For example, the created process will have some activities and in the middle the script should be run and then the process continues as before.
Is there a mechanism to run those scripts from C#?
| 0 | [
2,
946,
17505,
572,
272,
5910,
800,
3726,
3726,
31,
259,
20,
485,
8247,
8741,
118,
6448,
11570,
118,
1820,
779,
572,
51,
3010,
9,
31,
57,
40,
3010,
30,
9695,
953,
7499,
432,
27,
4155,
22,
18,
5465,
9,
14,
953,
25,
6756,
19,
27... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
British English to American English (and vice versa) Converter
===
Does anyone know of a library or bit of code that converts British English to American English and vice versa?
I don't imagine there's too many differences (some examples that come to mind are doughnut/donut, colour/color, grey/gray, localised/localized) but it would be nice to be able to provide localised site content.
| 0 | [
2,
388,
486,
20,
189,
486,
13,
5,
290,
1821,
18596,
6,
25893,
800,
3726,
3726,
630,
1276,
143,
16,
21,
1248,
54,
1142,
16,
1797,
30,
8406,
18,
388,
486,
20,
189,
486,
17,
1821,
18596,
60,
31,
221,
22,
38,
4382,
80,
22,
18,
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... |
Find matching sequences in two binary files
===
Let me start off with a bit of background.
This morning one of our users reported that Testuff's setup file has been reported as infected with a virus by the CA antivirus. Confident that this was a false positive, I looked on the web and found that users of another program (SpyBot) have reported the same problem.
A now, for the actual question.
Assuming the antivirus is looking for a specific binary signature in the file, I'd like to find the matching sequences in both files and hopefully find a way to tweak the setup script to prevent that sequence from appearing.
I tried the following in Python, but it's been running for a long time now and I was wondering if there was a better or faster way.
from difflib import SequenceMatcher
spybot = open("spybotsd160.exe", "rb").read()
testuff = open("TestuffSetup.exe", "rb").read()
s = SequenceMatcher(None, spybot, testuff)
print s.find_longest_match(0, len(spybot), 0, len(testuff))
Is there a better library for Python or for another language that can do this?
A completely different way to tackle the problem is welcome as well. | 0 | [
2,
477,
10120,
11173,
19,
81,
14171,
6488,
800,
3726,
3726,
408,
55,
799,
168,
29,
21,
1142,
16,
2395,
9,
48,
959,
53,
16,
318,
3878,
1117,
30,
1289,
5386,
22,
18,
18161,
3893,
63,
74,
1117,
28,
11166,
29,
21,
6231,
34,
14,
16... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Connectivity of Winform Applications/ASP.NET application with SAP databases
===
How can I fetch data in a Winforms application or ASP.NET form from a SAP database? The .NET framework used is 2.0. , language is C# and SAP version is 7.10. | 0 | [
2,
24026,
16,
628,
4190,
3767,
118,
472,
306,
9,
2328,
3010,
29,
7508,
6018,
18,
800,
3726,
3726,
184,
92,
31,
18312,
1054,
19,
21,
628,
4190,
18,
3010,
54,
28,
306,
9,
2328,
505,
37,
21,
7508,
6018,
60,
14,
13,
9,
2328,
6596,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How would you organize a timezone dropdown?
===
I'm trying to present the (web) user with a useful subset of Olson timezones, though with a friendlier naming convention.
Any recommendations for how to sort and label them for maximum usefulness? By country? Continent? GMT offset?
I'm not very concerned about inaccuracy for past dates, so some of the timezones that are only historically different could be winnowed out, but I'm not sure it's worth the effort of identifying which. If someone else already has done so, please let me know. | 4 | [
2,
184,
83,
42,
9213,
21,
85,
11661,
2804,
2968,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
734,
14,
13,
5,
14113,
6,
4155,
29,
21,
4811,
16622,
16,
24959,
85,
11661,
18,
15,
362,
29,
21,
860,
10491,
10929,
3087,
9,
186,
12121,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
List of Stored Procedure from Table
===
I have a huge database with 100's of tables and stored procedures. Using SQL serve 2005 How can i get the list of Stored procedures that are doing a insert or update operation on a table. | 0 | [
2,
968,
16,
8214,
7004,
37,
859,
800,
3726,
3726,
31,
57,
21,
2329,
6018,
29,
808,
22,
18,
16,
7484,
17,
8214,
8876,
9,
568,
4444,
255,
1884,
812,
184,
92,
31,
164,
14,
968,
16,
8214,
8876,
30,
50,
845,
21,
14692,
54,
11100,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Parse DICOM files in native Python
===
What is the simplest and most-pythonic way to parse a DICOM file? A native Python implementation without the use of non-Python libraries would be much preferred.
DICOM is the standard file format in digital medical imaging (look [here][1] for more information).
[1]: http://en.wikipedia.org/wiki/Digital_Imaging_and_Communications_in_Medicine | 0 | [
2,
2017,
870,
926,
960,
6488,
19,
1275,
20059,
800,
3726,
3726,
98,
25,
14,
24384,
17,
127,
8,
6448,
96,
11151,
161,
20,
2017,
870,
21,
926,
960,
3893,
60,
21,
1275,
20059,
6123,
366,
14,
275,
16,
538,
8,
6448,
11570,
8649,
83,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Replacing strings inside SWF
===
We've got dozens of versions of an SWF modified for different customers of a big Flash project, and now would have to replace some strings embedded in scripts in each copy. The FLA file for some of these is very difficult to locate or even missing (I inherited this mess and refactoring it is currently not an option).
Is there a (free) tool to replace strings used inside ActionScript? I tried swfmill to convert the files to XML and back but it can't handle international characters contained in the strings so I could get them only partially converted. Most of the strings were correctly extracted so another tool might do the job.
| 0 | [
2,
5496,
7887,
572,
13,
18,
15263,
800,
3726,
3726,
95,
22,
195,
330,
10273,
16,
3281,
16,
40,
13,
18,
15263,
5372,
26,
421,
5279,
16,
21,
580,
4433,
669,
15,
17,
130,
83,
57,
20,
3934,
109,
7887,
12138,
19,
17505,
19,
206,
43... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Vista skin l&f
===
is there anywhere on the web free vista look and feel theme pack for java? | 0 | [
2,
13520,
1188,
644,
1569,
410,
800,
3726,
3726,
25,
80,
4922,
27,
14,
2741,
551,
13520,
361,
17,
583,
3184,
3607,
26,
8247,
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,
0... | [
1,
1,
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,
0,
0... |
What is the biggest drawback of <your favorite database>
===
We all have our favourite database. If you look objectively at your chosen database, what drawbacks does it have and what could be improved?
The rules:
- One reply per drawback with;
- a short desciption of the limitation, followed by;
- a more detailed description, an explanation of how it could be done better or an example of another technology that does not have the same limitation.
- Do not diss any database that you haven't used extensively. It is easy to take potshots at other technologies but we want to learn form your experience, not your prejudice.
| 0 | [
2,
98,
25,
14,
3835,
2003,
1958,
16,
13,
1,
4314,
3839,
6018,
1,
800,
3726,
3726,
95,
65,
57,
318,
7740,
6018,
9,
100,
42,
361,
7038,
102,
35,
154,
2519,
6018,
15,
98,
2003,
1958,
18,
630,
32,
57,
17,
98,
110,
44,
3999,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it worth the development time to output valid HTML?
===
Developing websites are time-consuming. To improve productivity, I would code a prototype to show to our clients. I don't worry about making the prototype comform to the standard. Most of the time, our clients would approve the prototype and give an unreasonable deadline. I usually end up using the prototype in production (hey, the prototype works. No need to make my job harder.)
I could refactor the code to output valid HTML. But is it worth the effort to output valid HTML? | 0 | [
2,
25,
32,
2715,
14,
522,
85,
20,
5196,
7394,
13,
15895,
60,
800,
3726,
3726,
3561,
13931,
50,
85,
8,
17601,
9,
20,
3545,
18211,
15,
31,
83,
1797,
21,
7063,
20,
298,
20,
318,
7421,
9,
31,
221,
22,
38,
3189,
88,
544,
14,
7063... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In continuous integration what is the best way to deal with external application dependencies
===
In using our TeamCity Continuous Integration server we have uncovered some issues that we are unsure as to the best way to handle. Namely how to reference external applications that our application requires on the CI server.
This was initially uncovered with a dependency on Crystal Reports, so we went and installed Crystal Reports on the Server fixing the immediate problem. However as we move more applications over to the CI server we are finding more dependencies.
What is the best strategy here? Is it to continue installing the required applications on the Server?
Thanks | 0 | [
2,
19,
6357,
8078,
98,
25,
14,
246,
161,
20,
1183,
29,
4886,
3010,
29411,
800,
3726,
3726,
19,
568,
318,
173,
5788,
6357,
8078,
8128,
95,
57,
17082,
109,
1549,
30,
95,
50,
13815,
28,
20,
14,
246,
161,
20,
3053,
9,
8525,
184,
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... |
Manualy choose an interface on TCP to send data
===
I have a TCP server that is listening on a particular interface only. I want that after the accept() call if the incoming connection was from xxx.xxx.xxx.0 subnet then the data should go through intf1 otherwise the data should be sent through intf2 which is where my server is listening.
Both the interfaces have the same route settings and priority. All the networks are accessible from both the interfaces.
One way out could be to add a new route through intf1 with higher priority, but I want this to be a code based decision.
The code is in pure C written on Linux.
Thanks for the help.
| 0 | [
2,
5132,
93,
3538,
40,
6573,
27,
13,
38,
7439,
20,
2660,
1054,
800,
3726,
3726,
31,
57,
21,
13,
38,
7439,
8128,
30,
25,
4948,
27,
21,
1498,
6573,
104,
9,
31,
259,
30,
75,
14,
3440,
5,
6,
645,
100,
14,
17126,
2760,
23,
37,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Problems with IronPython Studio and PictureBox
===
Right, so I'm having a go at Iron Python Studio as I'm quite familiar with VS2005 and want to try Python with an integrated GUI designer. But as soon as I add a PictureBox I'm in trouble. When running the project I get complaints about BeginInit and soon enough the form designer stops working.
Is this because I'm running .NET 3.5 or some other compatibility issue? Couldn't find anything at the [Iron Python Studio site][1]
[1]: http://www.codeplex.com/IronPythonStudio | 0 | [
2,
1716,
29,
1751,
6448,
11570,
1120,
17,
2151,
5309,
800,
3726,
3726,
193,
15,
86,
31,
22,
79,
452,
21,
162,
35,
1751,
20059,
1120,
28,
31,
22,
79,
1450,
3694,
29,
4611,
2835,
17,
259,
20,
1131,
20059,
29,
40,
5547,
9457,
4742,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 feature matching in Computer Vision?
===
When using feature descriptors [like SIFT, SURF] - is Approximate Nearest Neighbour the fastest method to do matching between images? | 0 | [
2,
1512,
1580,
10120,
19,
1428,
2750,
60,
800,
3726,
3726,
76,
568,
1580,
121,
8741,
248,
18,
636,
1403,
26865,
15,
12187,
500,
13,
8,
25,
16569,
6557,
22245,
14,
7518,
2109,
20,
107,
10120,
128,
3502,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Is there any IIS equivalent to Tomcat?
===
I want to test ASP.NET applications to get the feel for the MVC extension and compare that to what I can do today with Grails or Rails.
The trouble is that being in a corporate environment, I can't install IIS on my workstation, neither on my DEV server. And - you guessed it - Visual Studio is not to be considered at that moment (I guess for my investigations I'll stick with [SharpDevelop][1] and the .NET SDK for the time being).
On the Java side, I could unzip some Tomcat distribution in any folder and hit go.
Is there any equivalent in the IIS world, like a lightweight ASP.NET host?
Thanks,
Rollo
[1]: http://www.icsharpcode.net/OpenSource/SD/ | 0 | [
2,
25,
80,
186,
595,
18,
4602,
20,
2067,
5782,
60,
800,
3726,
3726,
31,
259,
20,
1289,
28,
306,
9,
2328,
3767,
20,
164,
14,
583,
26,
14,
307,
8990,
3896,
17,
11590,
30,
20,
98,
31,
92,
107,
786,
29,
489,
7301,
18,
54,
2240,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
I am losing periods in an email sent using Java Mail
===
I am sending newsletters from a Java server and one of the hyperlinks is arriving missing a period, rendering it useless:
Please print your <a href=3D"http://xxxxxxx.xxx.xx.edu=
au//newsletter2/3/InnovExpoInviteVIP.pdf"> VIP invitation</a> for future re=
ference and check the Innovation Expo website <a href=3D"http://xxxxxxx.xx=
xx.xx.edu.au/2008/"> xxxxxxx.xxxx.xx.edu.au</a> for updates.
In the example above the period was lost between edu and au on the first hyperlink.
We have determined that the mail body is being line wrapped and the wrapping splits the line at the period, and that it is illegal to start a line with a period in an SMTP email:
http://tools.ietf.org/html/rfc2821#section-4.5.2
My question is this - what settings should I be using to ensure that the wrapping is period friendly and/or not performed in the first place? | 0 | [
2,
31,
589,
2281,
7302,
19,
40,
8517,
795,
568,
8247,
4216,
800,
3726,
3726,
31,
589,
4907,
17782,
18,
37,
21,
8247,
8128,
17,
53,
16,
14,
5443,
6258,
18,
25,
6426,
2863,
21,
620,
15,
15307,
32,
12858,
45,
2247,
4793,
154,
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... |
NHibernate transaction and race condition
===
I've got an ASP.NET app using NHibernate to transactionally update a few tables upon a user action. There is a date range involved whereby only one entry to a table 'Booking' can be made such that exclusive dates are specified.
My problem is how to prevent a race condition whereby two user actions occur almost simultaneously and cause mutliple entries into 'Booking' for >1 date. I can't check just prior to calling .Commit() because I think that will still leave be with a race condition?
All I can see is to do a check AFTER the commit and roll the change back manually, but that leaves me with a very bad taste in my mouth! :)
>booking_ref (INT)
>booking_start (DATETIME)
>booking_end (DATETIME)
| 0 | [
2,
12109,
15191,
8820,
12799,
17,
764,
2874,
800,
3726,
3726,
31,
22,
195,
330,
40,
28,
306,
9,
2328,
4865,
568,
12109,
15191,
8820,
20,
12799,
1326,
11100,
21,
310,
7484,
685,
21,
4155,
1028,
9,
80,
25,
21,
1231,
978,
1013,
15630... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Schema reference for IIS programmatic administration
===
Where can I find the IIS object schema? All I found from MSDN was a picture of the class hierarchy.
To be clear, I want to configure IIS through either WMI or ADSI and I'm looking for something like [the Active Directory schema][1], only for IIS. I want a list of all the objects I can configure, which objects they can be contained in and what their properties are.
[1]: http://msdn.microsoft.com/en-us/library/ms675085(VS.85).aspx | 0 | [
2,
23874,
2801,
26,
595,
18,
625,
6732,
1603,
800,
3726,
3726,
113,
92,
31,
477,
14,
595,
18,
3095,
23874,
60,
65,
31,
216,
37,
4235,
43,
103,
23,
21,
2151,
16,
14,
718,
14417,
9,
20,
44,
1207,
15,
31,
259,
20,
1065,
15951,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 will break once PHP6 is released?
===
PHP6 haven't been released yet. But because of the majority of websites that uses PHP, once PHP6 is released, programmers would support that version.
PHP6 can break code that works on PHP4 and PHP5. The purpose of this question is to have a nice list of what PHP programmers should be aware of before PHP6 is released. This can help PHP programmers be ready for PHP6.
What will break when PHP6 once released?
(Please post one thing that can break per answer)
(Please vote the answer that can affect your development the most) | 0 | [
2,
98,
129,
1442,
382,
13,
26120,
379,
25,
261,
60,
800,
3726,
3726,
13,
26120,
379,
2933,
22,
38,
74,
261,
768,
9,
47,
185,
16,
14,
1698,
16,
13931,
30,
2027,
13,
26120,
15,
382,
13,
26120,
379,
25,
261,
15,
17968,
18,
83,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to compare files with same names in two different directories using a shell script
===
Before moving on to use SVN, I used to manage my project by simply keeping a `/develop/` directory and editing and testing files there, then moving them to the `/main/` directory. When I decided to move to SVN, I needed to be sure that the directories were indeed in sync.
So, what is a good way to write a shell script [ bash ] to recursively compare files with the same name in two different directories?
Note: The directory names used above are for sample only. I do not recommend storing your code in the top level :). | 0 | [
2,
184,
20,
11590,
6488,
29,
205,
1817,
19,
81,
421,
559,
1596,
568,
21,
3593,
3884,
800,
3726,
3726,
115,
1219,
27,
20,
275,
13,
18,
16578,
15,
31,
147,
20,
4705,
51,
669,
34,
1659,
2882,
21,
13,
1,
118,
26051,
118,
1,
16755,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subversion Berkeley DB broken, recovery failed.
===
I've got a Subversion repository, backed by the berkeley DB. Occasionally it breaks down due to some locks and such not being released, but this morning it was impossible to recover it using the 'svnadmin recover' command. Instead it failed with the following error:
svnadmin: Berkeley DB error for filesystem 'db' while opening 'nodes' table:
Invalid argument
svnadmin: bdb: file nodes (meta pgno = 0) has LSN [1083][429767].
svnadmin: bdb: end of log is [1083][354707]
svnadmin: bdb: db/nodes: unexpected file type or format
I'm going to restore the repository from the last known good backup, but it would be good to know if there is a way this repository could be fixed. | 0 | [
2,
972,
10898,
8039,
13,
9007,
2023,
15,
6550,
1702,
9,
800,
3726,
3726,
31,
22,
195,
330,
21,
972,
10898,
24869,
15,
6334,
34,
14,
8039,
13,
9007,
9,
4533,
32,
7947,
125,
397,
20,
109,
12941,
17,
145,
52,
142,
261,
15,
47,
48... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 **kwargs with SimpleXMLRPCServer in python
===
I have a class that I wish to expose as a remote service using pythons SimpleXMLRPCServer. The server startup looks like this:
server = SimpleXMLRPCServer((serverSettings.LISTEN_IP,serverSettings.LISTEN_PORT))
service = Service()
server.register_instance(service)
server.serve_forever()
I then have a ServiceRemote class that looks like this:
def __init__(self,ip,port):
self.rpcClient = xmlrpclib.Server('http://%s:%d' %(ip,port))
def __getattr__(self, name):
# forward all calls to the rpc client
return getattr(self.rpcClient, name)
So all calls on the ServiceRemote object will be forwarded to xmlrpclib.Server, which then forwards it to the remote server. The problem is a method in the service that takes named varargs:
def select(self, fields, **kwargs):
pass
When I call this method, I get the error "__call__() got an unexpected keyword argument 'name'". So, is it possible to call methods taking variable named arguments remotely? Or will I have to create an override for each method variation I need. | 0 | [
2,
568,
13,
1409,
16763,
8911,
18,
29,
1935,
396,
79,
12988,
5779,
10321,
106,
19,
20059,
800,
3726,
3726,
31,
57,
21,
718,
30,
31,
2536,
20,
13833,
28,
21,
5388,
365,
568,
20059,
18,
1935,
396,
79,
12988,
5779,
10321,
106,
9,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Transform .HBM model to annotated pojos
===
We have our domain model declared in rusty old hbm files, we wish to move to POJOs annotated with the javax.persistence.* annotations.
Has anyone had experience doing so?
Are there tools that we could employ? | 0 | [
2,
8007,
13,
9,
18098,
79,
1061,
20,
40,
1270,
1669,
2353,
1636,
18,
800,
3726,
3726,
95,
57,
318,
4603,
1061,
2482,
19,
15395,
315,
746,
13178,
6488,
15,
95,
2536,
20,
780,
20,
2353,
1636,
18,
40,
1270,
1669,
29,
14,
8247,
396,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Antivirus and file access conflict : good programming practices?
===
Sometimes, we experiment "access denied" errors due to the **antivirus** which handles the file at the same time our program wants to write/rename/copy it.
This happens rarely but makes me upset because I don't find the good way to deal with: technically our response is to change our source code to implement kind of **retry** mechanism... but we are not satisfied.. . that smells a little bit... we can't afford telling our customers "please turn off your antivirus, let our software work properly"...
So if your have already experimented such issues, please let me know how you dealt with.
Thansks! | 0 | [
2,
1082,
14792,
17,
3893,
1381,
2930,
13,
45,
254,
3143,
5242,
60,
800,
3726,
3726,
1030,
15,
95,
5737,
13,
7,
20604,
5265,
7,
11908,
397,
20,
14,
13,
1409,
5578,
14792,
1409,
56,
3053,
18,
14,
3893,
35,
14,
205,
85,
318,
625,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Dynamic Client Script
===
I need to write a java script. This is supposed to validate if the checkbox is selected in the page or not. The problem here is that the check box is inside a grid and is generated dynamically. The reason being the number of check box that need to be rendered is not know at design time. So the id is know only at the server side. | 0 | [
2,
7782,
6819,
3884,
800,
3726,
3726,
31,
376,
20,
2757,
21,
8247,
3884,
9,
48,
25,
2293,
20,
7394,
1373,
100,
14,
2631,
5309,
25,
1704,
19,
14,
2478,
54,
52,
9,
14,
1448,
235,
25,
30,
14,
2631,
1649,
25,
572,
21,
7354,
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... |
GUI apps in javascript without a browser?
===
I would like to use javascript to develop general-purpose GUI applications. Initially these are to run on Windows, but I would like them to ultimately be cross-platform.
Is there a way to do this without having to make the application run in a browser?
| 0 | [
2,
9457,
4865,
18,
19,
8247,
8741,
366,
21,
16495,
60,
800,
3726,
3726,
31,
83,
101,
20,
275,
8247,
8741,
20,
2803,
297,
8,
12060,
9457,
3767,
9,
1537,
158,
50,
20,
485,
27,
1936,
15,
47,
31,
83,
101,
105,
20,
3308,
44,
919,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 things that you do to make sure a project is ready to be released?
===
I was wondering what final steps some of the more experienced developers take before they release their new project. | 0 | [
2,
98,
50,
109,
564,
30,
42,
107,
20,
233,
562,
21,
669,
25,
1451,
20,
44,
261,
60,
800,
3726,
3726,
31,
23,
5712,
98,
426,
2382,
109,
16,
14,
91,
3882,
10168,
247,
115,
59,
830,
66,
78,
669,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to default the working directory for JUnit launch configurations in Eclipse?
===
Our Java code reads files from the current directory, which means the working directory needs to be set properly whenever we run the code.
When launching a JUnit test from within Eclipse, a launch configuration automatically gets created. The problem is, that the working directory in that launch configuration is always by default the root project directory which is always wrong, the tests fail, I have to open the launch configuration dialog, change the working directory and relaunch the test. This is very annoying. The same thing happens when I run a single test method.
I've already considered these:
- Changing the current directory from the Java code itself - not possible by design.
- When opening a file, pass a parent directory parameter - too difficult, since this would affect lots of places.
- Use the *Copy launch configuration* feature of Eclipse to create new launch configurations from existing ones that already have a correct working directory set. This doesn't really makes sense here, since I would like to launch a test or a test method quickly, just by invoking "run this test / method as JUnit test".
All in all, it looks like it's responsibility of Eclipse, not the code.
Is there a way to set the default working directory for JUnit launch configurations? | 0 | [
2,
184,
20,
12838,
14,
638,
16755,
26,
7446,
242,
3394,
8091,
18,
19,
11652,
60,
800,
3726,
3726,
318,
8247,
1797,
11137,
6488,
37,
14,
866,
16755,
15,
56,
1108,
14,
638,
16755,
2274,
20,
44,
309,
7428,
6634,
95,
485,
14,
1797,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Design Pattern is best for Iterative development?
===
Is there such a thing as having the most prefered design pattern for building applications in TDD or the iterative mode? | 0 | [
2,
56,
704,
3732,
25,
246,
26,
32,
106,
3366,
522,
60,
800,
3726,
3726,
25,
80,
145,
21,
584,
28,
452,
14,
127,
6369,
69,
704,
3732,
26,
353,
3767,
19,
15596,
43,
54,
14,
32,
106,
3366,
3740,
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,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do you read an image in Java when Toolkit.getDefaultToolkit() throws an AWTError?
===
I am reading image files in Java using
java.awt.Image img = Toolkit.getDefaultToolkit().createImage(filePath);
On some systems this doesn't work, it instead throws an AWTError complaining about sun/awt/motif/MToolkit.
How else can you create a java.awt.Image object from an image file? | 0 | [
2,
184,
107,
42,
1302,
40,
1961,
19,
8247,
76,
5607,
13703,
9,
3060,
13862,
9708,
20799,
13703,
5,
6,
13566,
40,
13,
3885,
38,
29992,
60,
800,
3726,
3726,
31,
589,
1876,
1961,
6488,
19,
8247,
568,
8247,
9,
3885,
38,
9,
22039,
79... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
[VS2008] Shortcut to switch between markup and code
===
Using Visual Studio 2008 Team Edition, is it possible to assign a shortcut key that switches between markup and code? If not, is it possible to assign a shortcut key that goes from code to markup? | 0 | [
2,
636,
710,
18,
2753,
500,
502,
4118,
20,
5521,
128,
943,
576,
17,
1797,
800,
3726,
3726,
568,
3458,
1120,
570,
173,
1322,
15,
25,
32,
938,
20,
13952,
21,
502,
4118,
1246,
30,
18114,
128,
943,
576,
17,
1797,
60,
100,
52,
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,
0... |
How to improve the program coding.
===
I am a C# developer. Still learning. I had not learn all the features of C# 2.0 and now the new version of c# is being released. how do we cope up with this.what is the best option to cope up with the latest programming skills. | 0 | [
2,
184,
20,
3545,
14,
625,
13,
15458,
9,
800,
3726,
3726,
31,
589,
21,
272,
5910,
10058,
9,
174,
2477,
9,
31,
41,
52,
2484,
65,
14,
967,
16,
272,
5910,
172,
9,
387,
17,
130,
14,
78,
615,
16,
272,
5910,
25,
142,
261,
9,
184... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are the values of pi and e available in the .Net framework?
===
Without [calculating them][1], I mean?
[1]: http://stackoverflow.com/questions/19/fastest-way-to-get-value-of-pi "StackOverflow - Fastest way to get the value of pi" | 0 | [
2,
50,
14,
4070,
16,
4194,
17,
13,
62,
904,
19,
14,
13,
9,
2328,
6596,
60,
800,
3726,
3726,
366,
636,
16304,
10038,
105,
500,
2558,
165,
500,
15,
31,
884,
60,
636,
165,
500,
45,
7775,
6903,
25325,
2549,
9990,
9,
960,
118,
2465... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Performance improvements moving from g++/gcc 3.2.3 to 4.2.4.
===
We have been looking at g++ versions 3.2.3 and 4.2.4. With 4.2.4, the performance improvements on some of our code base is significant.
I've tried searching the [gcc buzilla database][1] to find hints as to what bugs may have had such a dramatic improvement but I didn't find any individual bug that stood out as being a candidate.
Are the improvements the result of many small changes that have slowly had an affect? Or was there say a top 5 set of improvements that may have made a difference?
For some background, our code base does make good use of STL containers and algorithms, as well as C++ features such as the 'inline' keyword.
[1]: http://gcc.gnu.org/bugzilla/ | 0 | [
2,
956,
7951,
1219,
37,
489,
20512,
118,
263,
3384,
203,
9,
135,
9,
240,
20,
268,
9,
135,
9,
300,
9,
800,
3726,
3726,
95,
57,
74,
699,
35,
489,
20512,
3281,
203,
9,
135,
9,
240,
17,
268,
9,
135,
9,
300,
9,
29,
268,
9,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Duplicate result
===
I am writing a query in SQL server2005. This is returning me a duplicate rows in the result. Can i eliminate this duplication with a particular column as the key? | 0 | [
2,
19429,
829,
800,
3726,
3726,
31,
589,
1174,
21,
25597,
19,
4444,
255,
8128,
2835,
9,
48,
25,
2485,
55,
21,
19429,
11295,
19,
14,
829,
9,
92,
31,
10628,
48,
1052,
20669,
29,
21,
1498,
4698,
28,
14,
1246,
60,
3,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
j_security_check and JAAS
===
I have been given the task of implementing a login handler. The only detail the handler captures is username and password. Initially I was going to use a JSP that posted to a servlet. Where the servlet carried out a db lookup and also validated the user credentials. Upon successful login you are redirected but unsuccessful takes you back to the jsp and displays appropriate error messages.
However upon doing some research I discovered j_security_check and JAAS and am not sure which to use or whether to at all.
What benefits will I get from either and which would be most suitable from my task? ? | 0 | [
2,
487,
1,
17749,
1,
12542,
17,
3009,
472,
800,
3726,
3726,
31,
57,
74,
504,
14,
3005,
16,
17333,
21,
6738,
108,
24641,
9,
14,
104,
6110,
14,
24641,
3683,
18,
25,
4155,
7259,
17,
20884,
9,
1537,
31,
23,
228,
20,
275,
21,
487,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Different framerate for loaded SWF file in Flex?
===
Using The loader class of Adobe Flex, I load an external SWF file. However, the loaded SWF file has a different frameRate than my application.
Is it possible to have both the parent app and the loaded child app playing at different framerates? If so, how? | 0 | [
2,
421,
3523,
5487,
26,
8572,
13,
18,
15263,
3893,
19,
14409,
60,
800,
3726,
3726,
568,
14,
6305,
106,
718,
16,
20299,
14409,
15,
31,
6305,
40,
4886,
13,
18,
15263,
3893,
9,
207,
15,
14,
8572,
13,
18,
15263,
3893,
63,
21,
421,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Storing SAS data (including table structure) in a single flat file
===
I need to convert SAS data tables into flat files. And only 1 flat file for each original SAS table.
The challenging thing is that I want the flat file to contain some structural information of the original SAS table also, specifically:
- Variable/Column name
- Variable/Column label
- Variable/Column type
- Variable/Column length
- Variable/Column format
- Variable/Column informat
Additional information:
- I will only need to convert small data (< 100 obs).
- Performance is not an issue (within reasonable limits).
- The flat file should form a basis for recreating the original SAS table, I don't need to be able to use the file directly as a table in DATA or PROC steps.
What is my best option?
| 0 | [
2,
25615,
9233,
1054,
13,
5,
3970,
859,
1411,
6,
19,
21,
345,
1844,
3893,
800,
3726,
3726,
31,
376,
20,
8406,
9233,
1054,
7484,
77,
1844,
6488,
9,
17,
104,
137,
1844,
3893,
26,
206,
501,
9233,
859,
9,
14,
10855,
584,
25,
30,
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... |
Looking for a better reporting solution than SSRS
===
I find SSRS produces typically ugly reports and the .rdl usually ends up being a pretty complex beast, hard to tweak and maintain.
Do you know a better toolkit?
It doesn't necessarily have to do it all by itself. It could be split in parts:
- Chart generating library
- Listing generating library
- Form generating library
- Plus some custom code to link all three.
Or am I just using it wrong and it can produce easily maintainable great looking charts and reports? | 0 | [
2,
699,
26,
21,
574,
6670,
4295,
119,
22118,
18,
800,
3726,
3726,
31,
477,
22118,
18,
6700,
2442,
9212,
2813,
17,
14,
13,
9,
897,
255,
951,
3451,
71,
142,
21,
1772,
1502,
5591,
15,
552,
20,
28769,
17,
4027,
9,
107,
42,
143,
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... |
Dynamicly create variables inside function
===
I want to create variables inside function from dictionary.
Lets say i have a dictionary
bar = {'a': 1, 'b': 2, 'c': 3}
and function
def foo():
pass
what i want to do is to create inside function "foo" variables with names of each dictionary item name and values as dictionary item values
So in the end it should be similar to
def foo():
a = 1
b = 2
c = 3
is it possible at all? And if it does, how to do such thing?
| 0 | [
2,
7782,
102,
1600,
12157,
572,
1990,
800,
3726,
3726,
31,
259,
20,
1600,
12157,
572,
1990,
37,
9186,
9,
6884,
395,
31,
57,
21,
9186,
748,
800,
13,
1,
22,
58,
22,
45,
137,
15,
13,
22,
220,
22,
45,
172,
15,
13,
22,
150,
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 Flash Component SWC file in Flex
===
I am accessing custom UIComponent via SWC file from Flex 3.
This component works OK in Flash CS3, but using it from Flex gives A weird error in draw().
I have added swc component inside Sprite (with addchild) and its in LIB path.
TypeError: Error #1010: A term is undefined and has no properties.
at com.xxxx.highscores::HighScores/draw()
at fl.core::UIComponent/callLaterDispatcher()
Here is the draw() function of this UI Component:
override protected function draw():void {
isInitializing = false;
page.Text.x = width / 2;
page.Text.y = height / 2;
drawBackground();
} | 0 | [
2,
568,
4433,
5912,
13,
18,
12354,
3893,
19,
14409,
800,
3726,
3726,
31,
589,
1381,
68,
5816,
13,
5661,
11103,
218,
2291,
1197,
13,
18,
12354,
3893,
37,
14409,
203,
9,
48,
5912,
693,
5854,
19,
4433,
272,
18,
240,
15,
47,
568,
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... |
When to use test scripts over unit testing?
===
I am currently working on a project that has been in production for over two years. The project makes extensive use of unit testing and scripted UI tests. Initialy unit tests covered the system framework, business rules and state transitions (or workflow). Test scripts are used for black box testing. However, over time the cost of maintaining our full set of unit tests has become increasingly expensive especially those relating to state.
After a bit of investigation we have found that test scripts are more effective (that is, provide better coverage) and are cheaper to maintain than unit tests relating to workflow. This isn't to say the value of unit tests has been completely negated but it does raise this question whether some classes of unit tests can be dropped in favour of test scripts.
Our project is run on an interative incremental model. | 0 | [
2,
76,
20,
275,
1289,
17505,
84,
1237,
4431,
60,
800,
3726,
3726,
31,
589,
871,
638,
27,
21,
669,
30,
63,
74,
19,
637,
26,
84,
81,
122,
9,
14,
669,
1364,
3386,
275,
16,
1237,
4431,
17,
3884,
69,
13,
5661,
4894,
9,
2104,
93,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 export fonts and colors from VS2008 to VS2005?
===
I have been forced to work in Visual Studio 2005 and would like to export my fonts and colors from Visual Studio 2008. However, VS2005 complains about wrong export document version. Is there any good way to do this besides manually changing each color and font? | 0 | [
2,
184,
20,
7487,
9978,
18,
17,
5268,
37,
4611,
2753,
20,
4611,
2835,
60,
800,
3726,
3726,
31,
57,
74,
1292,
20,
170,
19,
3458,
1120,
812,
17,
83,
101,
20,
7487,
51,
9978,
18,
17,
5268,
37,
3458,
1120,
570,
9,
207,
15,
4611,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Select tag's size attribute through css?
===
Normally you can do this:
<select size="3">
<option>blah</option>
<option>blah</option>
<option>blah</option>
</select>
And it would render as a selectionbox where all three options are visible (without dropping down)
I'm looking for a way to set this size attribute from css. | 0 | [
2,
5407,
3383,
22,
18,
1072,
35,
14755,
120,
272,
18,
18,
60,
800,
3726,
3726,
4147,
42,
92,
107,
48,
45,
13,
1,
18,
16964,
1072,
3726,
7,
240,
7,
1,
13,
1,
2594,
3309,
1,
220,
9396,
1,
118,
2594,
3309,
1,
13,
1,
2594,
330... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Good book for learning Sharepoint development
===
What would you recommend? I know C# and ASP.NET well, but I haven;t touched Sharepoint before. | 0 | [
2,
254,
360,
26,
2477,
1891,
3132,
522,
800,
3726,
3726,
98,
83,
42,
12360,
60,
31,
143,
272,
5910,
17,
28,
306,
9,
2328,
134,
15,
47,
31,
2933,
73,
38,
3491,
1891,
3132,
115,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
JavaScript Chart Library
===
Would anyone recommend a particular JavaScript charting library - specifically one that doesn't use flash at all? | 0 | [
2,
8247,
8741,
1795,
1248,
800,
3726,
3726,
83,
1276,
12360,
21,
1498,
8247,
8741,
22544,
1248,
13,
8,
3524,
53,
30,
1437,
22,
38,
275,
4433,
35,
65,
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... | [
1,
1,
1,
1,
1,
1,
1,
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... |
Selenium RC against a Cassini webserver
===
I'm trying to run Selenium RC against my ASP.NET code running on a Cassini webserver.
The web application works when i browse it directly but when running through Selenium I get
HTTP ERROR: 403
Forbidden for Proxy
___
Running Selenium i interactive mode I start a new session with:
<pre>cmd=getNewBrowserSession&1=*iexplore&2=http://localhost:81/
cmd=open&1=http://localhost:81/default.aspx&sessionId=199578
</pre>
I get the above error in the Selenium browser, the command window tells me OK.
___
Any input? | 0 | [
2,
23027,
14311,
16462,
149,
21,
5913,
2651,
2741,
10321,
106,
800,
3726,
3726,
31,
22,
79,
749,
20,
485,
23027,
14311,
16462,
149,
51,
28,
306,
9,
2328,
1797,
946,
27,
21,
5913,
2651,
2741,
10321,
106,
9,
14,
2741,
3010,
693,
76,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Detect via javascript whether Silverlight is installed
===
Is there a javascript function I can use to detect whether a specific silverlight version is installed in the current browser?
I'm particularly interested in the Silverlight 2 Beta 2 version. I don't want to use the default method of having an image behind the silverlight control which is just shown if the Silverlight plugin doesn't load. | 0 | [
2,
9092,
1197,
8247,
8741,
1472,
1172,
3130,
25,
4066,
800,
3726,
3726,
25,
80,
21,
8247,
8741,
1990,
31,
92,
275,
20,
9092,
1472,
21,
1903,
1172,
3130,
615,
25,
4066,
19,
14,
866,
16495,
60,
31,
22,
79,
1653,
3158,
19,
14,
1172... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should an index be optimised after incremental indexes in Lucene?
===
We run full re-indexes every 7 days (i.e. creating the index from scratch) on our Lucene index and incremental indexes every 2 hours or so. Our index has around 700,000 documents and a full index takes around 17 hours (which isn't a problem).
When we do incremental indexes, we only index content that has changed in the past two hours, so it takes much less time - around half an hour. However, we've noticed that a lot of this time (maybe 10 minutes) is spent running the IndexWriter.optimize() method.
The [LuceneFAQ][1] mentions that:
> The IndexWriter class supports an optimize() method that compacts the index database and speeds up queries. You may want to use this method after performing a complete indexing of your document set or after incremental updates of the index. If your incremental update adds documents frequently, you want to perform the optimization only once in a while to avoid the extra overhead of the optimization.
...but this doesn't seem to give any definition for what "frequently" means. Optimizing is CPU intensive and VERY IO-intensive, so we'd rather not be doing it if we can get away with it. How much is the hit of running queries on an un-optimized index (I'm thinking especially in terms of query performance after a full re-index compared to after 20 incremental indexes where, say, 50,000 documents have changed)? Should we be optimising after every incremental index or is the performance hit not worth it?
[1]: http://wiki.apache.org/lucene-java/LuceneFAQ#head-fd848c31f4dc7b91727be6f40a7f5fbe2c66cfb8 | 0 | [
2,
378,
40,
4348,
44,
19259,
2541,
75,
29977,
4348,
160,
19,
18515,
556,
60,
800,
3726,
3726,
95,
485,
503,
302,
8,
25671,
160,
352,
453,
509,
13,
5,
49,
9,
62,
9,
2936,
14,
4348,
37,
12395,
6,
27,
318,
18515,
556,
4348,
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 to setup a shared ccache
===
How can I setup a shared ccache without falling into a permissions problem?
I would like to run a nightly or CI build with latest changes and share all created binaries throughout the R&D using a large ccache repository. | 0 | [
2,
184,
20,
18161,
21,
2592,
8093,
9616,
800,
3726,
3726,
184,
92,
31,
18161,
21,
2592,
8093,
9616,
366,
3106,
77,
21,
5572,
18,
1448,
60,
31,
83,
101,
20,
485,
21,
343,
102,
54,
5486,
1895,
29,
5736,
1693,
17,
1891,
65,
679,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How should you start diagnosing an out-of-memory error on Linux?
===
I had recently a problem with oom-killer starting to kill processes after some time. I could see that the memory was consumed, but by the time I got to the server it wasn't clear anymore what consumed it. Is there a good non-obvious place to get more info about oom-killer? E.g. detailed info about processes at the time of activation, detailed info about killed processes and reasons for the choice? | 0 | [
2,
184,
378,
42,
799,
926,
21887,
18,
68,
40,
70,
8,
1041,
8,
790,
5171,
93,
7019,
27,
13024,
60,
800,
3726,
3726,
31,
41,
1989,
21,
1448,
29,
635,
2636,
8,
21424,
1422,
20,
1177,
5102,
75,
109,
85,
9,
31,
110,
196,
30,
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... |
Load Excel data sheet to Oracle database
===
I am looking for a free tool to load Excel data sheet into Oracle database. I tried oracle sql developer, but it keeps throwing NullPointerException. Any ideas? | 0 | [
2,
6305,
20700,
1054,
6125,
20,
15759,
6018,
800,
3726,
3726,
31,
589,
699,
26,
21,
551,
5607,
20,
6305,
20700,
1054,
6125,
77,
15759,
6018,
9,
31,
794,
15759,
4444,
255,
10058,
15,
47,
32,
8968,
6033,
16203,
3132,
106,
10066,
872,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Multiple Session Factories under Spring/Hibernate
===
I have been given a requirement where I need to support multiple databases in the same instance, to support multi-tenancy. Each DB has an identical schema. The user logs into a specific database by choosing from a list, and all subsequent calls will go to that DB until they log out.
I want to hot swap the session factory inside a single HibernateDaoTemplate based on a parameter supplied by the client.
I can find lots of stuff on hot-swapping data sources (and all the transaction issues associated with that) but I want to hot swap session factories - retaining all the caching for each.
What's the easiest way to do this? Configure a HotSwappableTarget for the DaoTemplate? Can anyone point me to samples on how to do this? | 0 | [
2,
1886,
3723,
11814,
131,
1573,
118,
8630,
106,
8820,
800,
3726,
3726,
31,
57,
74,
504,
21,
8981,
113,
31,
376,
20,
555,
1886,
6018,
18,
19,
14,
205,
4851,
15,
20,
555,
1889,
8,
1316,
10821,
9,
206,
13,
9007,
63,
40,
6323,
23... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 simplexml problem
===
I have the following XML structure:
<?xml version="1.0" ?>
<course xml:lang="nl">
<body>
<item id="787900813228567" view="12000" title="0x|Beschrijving" engtitle="0x|Description"><![CDATA[Dit college leert studenten hoe ze een onderzoek kunn$
<item id="5453116633894965" view="12000" title="0x|Onderwijsvorm" engtitle="0x|Method of instruction"><![CDATA[instructiecollege]]></item>
<item id="7433550075448316" view="12000" title="0x|Toetsing" engtitle="0x|Examination"><![CDATA[Opdrachten/werkstuk]]></item>
<item id="015071401858970545" view="12000" title="0x|Literatuur" engtitle="0x|Required reading"><![CDATA[Wayne C. Booth, Gregory G. Colomb, Joseph M. Wi$
<item id="5960589172957031" view="12000" title="0x|Uitbreiding" engtitle="0x|Expansion"><![CDATA[]]></item>
<item id="3610066867901779" view="12000" title="0x|Aansluiting" engtitle="0x|Place in study program"><![CDATA[]]></item>
<item id="19232369892482925" view="12000" title="0x|Toegangseisen" engtitle="0x|Course requirements"><![CDATA[]]></item>
<item id="3332396346891524" view="12000" title="0x|Doelgroep" engtitle="0x|Target audience"><![CDATA[]]></item>
<item id="6606851872934866" view="12000" title="0x|Aanmelden bij" engtitle="0x|Enrollment at"><![CDATA[]]></item>
<item id="1478643580820973" view="12000" title="0x|Informatie bij" engtitle="0x|Information at"><![CDATA[Docent]]></item>
<item id="9710608434763993" view="12000" title="0x|Rooster" engtitle="0x|Schedule"><![CDATA[1e semester, maandag 15.00-17.00, zaal 1175/030]]></item>
</body>
</course>
I want to get the data from one of the item tags. To get to this tag, I use the following xpath:
$description = $xml->xpath("//item[@title='0x|Beschrijving']");
This does indeed return an array in the form of:
Array
(
[0] => SimpleXMLElement Object
(
[@attributes] => Array
(
[id] => 787900813228567
[view] => 12000
[title] => 0x|Beschrijving
[engtitle] => 0x|Description
)
)
)
But where is the actual information (that is stored between the <item> and </item> tags) located ? I must be doing something wrong, but I can't figure out what that might be... Probably something really simple... Help would be appreciated :)
| 0 | [
2,
13,
26120,
1935,
396,
8184,
1448,
800,
3726,
3726,
31,
57,
14,
249,
23504,
1411,
45,
13,
1,
60,
396,
8184,
615,
3726,
7,
165,
9,
387,
7,
13,
60,
1,
13,
1,
17556,
23504,
45,
9949,
3726,
7,
10651,
7,
1,
13,
1,
9760,
1,
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... |
Tool to monitor HTTP, TCP, etc. Web Service traffic
===
What's the best tool that you use to monitor Web Service, SOAP, WCF, etc. traffic that's coming and going on the wire? I have seen some tools that made with Java but they seem to be a little crappy. What I want is a tool that sits in the middle as a proxy and does port redirection (which should have configurable listen/redirect ports). Are there any tools work on Windows to do this? | 4 | [
2,
5607,
20,
7626,
7775,
15,
13,
38,
7439,
15,
2722,
9,
2741,
365,
2227,
800,
3726,
3726,
98,
22,
18,
14,
246,
5607,
30,
42,
275,
20,
7626,
2741,
365,
15,
6447,
15,
11801,
410,
15,
2722,
9,
2227,
30,
22,
18,
880,
17,
228,
27... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does WPF have equivalent controls for all Winforms controls?
===
Just found this out the hard way. I wanted to pop up a FontDialog to allow the user to choose a font.. one of those familiar dialogs.. | 0 | [
2,
630,
619,
7721,
57,
4602,
8671,
26,
65,
628,
4190,
18,
8671,
60,
800,
3726,
3726,
114,
216,
48,
70,
14,
552,
161,
9,
31,
417,
20,
1675,
71,
21,
9978,
4286,
5567,
20,
1655,
14,
4155,
20,
3538,
21,
9978,
9,
9,
53,
16,
273,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Any workarounds for non-static member array initialization?
===
In C++, it's not possible to initialize array members in the initialization list, thus member objects should have default constructors and they should be properly initialized in the constructor. Is there any (reasonable) workaround for this apart from not using arrays?
[Anything that can be initialized using only the initialization list is in our application far preferable to using the constructor, as that data can be allocated and initialized by the compiler and linker, and every CPU clock cycle counts, even before `main`. However, it is not always possible to have a default constructor for every class, and besides, reinitializing the data again in the constructor rather defeats the purpose anyway.]
E.g. I'd like to have something like this (but this one doesn't work):
class Foo {
private:
OtherClass inst[3]; // Array size fixed. OtherClass has no default ctor.
public:
Foo(...)
: inst[0](...), inst[1](...), inst[2](...)
{};
};
The only workaround I'm aware of is the non-array one:
class Foo {
private:
OtherClass inst0;
OtherClass inst1;
OtherClass inst2;
OtherClass *inst[3];
public:
Foo(...)
: inst0(...), inst1(...), inst2(...) {
inst[0]=&inst0;
inst[1]=&inst1;
inst[2]=&inst2;
};
};
| 0 | [
2,
186,
170,
10037,
18,
26,
538,
8,
18077,
322,
7718,
2104,
1829,
60,
800,
3726,
3726,
19,
272,
20512,
15,
32,
22,
18,
52,
938,
20,
2104,
2952,
7718,
443,
19,
14,
2104,
1829,
968,
15,
1086,
322,
3916,
378,
57,
12838,
6960,
248,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Good tool for drawing SCM code branch diagrams
===
Does anyone know a good tool for drawing SCM codeline diagrams? Currently we tend to do this using anything at hand e.g. PowerPoint, Visio, Paint Shop Pro, etc. It's a pity Visio doesn't include a standard stencil for this type of diagram.
We use Perforce which includes tools for producing branching diagrams, but really suited to single files. Moreover, the logical branching strategy is often different from the physical branch history which usually includes far too much detail.
What I'm looking for is something I can use to draw those "big picture" codeline diagrams with mainline, release branch, maintenance branches, etc.
| 0 | [
2,
254,
5607,
26,
3533,
4729,
79,
1797,
1686,
14161,
18,
800,
3726,
3726,
630,
1276,
143,
21,
254,
5607,
26,
3533,
4729,
79,
1797,
1143,
14161,
18,
60,
871,
95,
5480,
20,
107,
48,
568,
602,
35,
224,
13,
62,
9,
263,
9,
414,
313... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQLplus script to format text as numeric
===
I am selecting rows from a table, but some of the columns are a text type, but they always have numeric data in them. How can I format them as numbers?
e.g. column quantity heading 'Quantity' format 999,999
However, since the column in the table is text, the numeric formatting is ignored. | 0 | [
2,
4444,
255,
13349,
3884,
20,
2595,
1854,
28,
15764,
596,
800,
3726,
3726,
31,
589,
20764,
11295,
37,
21,
859,
15,
47,
109,
16,
14,
7498,
50,
21,
1854,
1001,
15,
47,
59,
550,
57,
15764,
596,
1054,
19,
105,
9,
184,
92,
31,
259... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Releasing a database build consistently via isql
===
I am releasing a database build to SQL Server 2000 via a batch file using isql. The batch file is used so multiple files are released consistently to different SQL Servers (development, test, live).
The SQL Server uses ANSI code page 1252 (from sp_helpsort) but isql is an OEM client using code page 437. This means that all extended characters (with ASCII code > 128) are converted when the scripts are run, leading to inconsistent results when characters like “£” are included in the script. Differences are explained in this [Microsoft knowledgebase article][1].
Possible solutions are: -
- Save the script using Unicode and
use osql.
- Turn off the AutoAnsiToOem setting using the SQL Server Client Network Utility (that writes a registry key).
Both these options rely on various people doing things consistently. All have to select the same code page option when saving a file OR all people performing the builds have to have the same option set for AutoAnsiToOem.
Is these a way to force the use of a code page either in the SQL script OR in the batch file that calls it, so that the build is always released consistently, regardless of how the file is saved or the various settings of whoever performs the release?
[1]: http://support.microsoft.com/?scid=kb;EN-US;153449 | 0 | [
2,
8054,
21,
6018,
1895,
11852,
1197,
25,
22402,
800,
3726,
3726,
31,
589,
8054,
21,
6018,
1895,
20,
4444,
255,
8128,
824,
1197,
21,
13064,
3893,
568,
25,
22402,
9,
14,
13064,
3893,
25,
147,
86,
1886,
6488,
50,
261,
11852,
20,
421... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Fetch a Wikipedia article with Python
===
I try to fetch a Wikipedia article with Phython's urllib:
f = urllib.urlopen("http://en.wikipedia.org/w/index.php?title=Albert_Einstein&printable=yes")
s = f.read()
f.close()
However instead of the html page I get the following response: Error - Wikimedia Foundation:
Request: GET http://en.wikipedia.org/w/index.php?title=Albert_Einstein&printable=yes, from 192.35.17.11 via knsq1.knams.wikimedia.org (squid/2.6.STABLE21) to ()
Error: ERR_ACCESS_DENIED, errno [No Error] at Tue, 23 Sep 2008 09:09:08 GMT
Wikipedia seems to block request which are not from a standard browser.
Anybody know how to work around this?
| 0 | [
2,
18312,
21,
20169,
2002,
29,
20059,
800,
3726,
3726,
31,
1131,
20,
18312,
21,
20169,
2002,
29,
13,
8174,
11570,
22,
18,
13,
911,
211,
4598,
45,
398,
800,
13,
911,
211,
4598,
9,
911,
16942,
103,
5,
7,
21127,
6903,
219,
9,
17375... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Mnesia table replication/sharing
===
Assume that we have N erlang nodes, running same application. I want
to share an mnesia table T1 with all N nodes, which I see no problem.
However, I want to share another mnesia table T2 with pairs of nodes.
I mean the contents of T2 will be identical and replicated to/with
only sharing pair. In another words, I want N/2 different contents for
T2 table. Is this possible with mnesia, not with renaming T2 for each
distinct pair of nodes? | 0 | [
2,
307,
2696,
549,
859,
23841,
118,
25213,
800,
3726,
3726,
7158,
30,
95,
57,
13,
103,
13,
106,
9949,
16272,
15,
946,
205,
3010,
9,
31,
259,
20,
1891,
40,
307,
2696,
549,
859,
13,
38,
165,
29,
65,
13,
103,
16272,
15,
56,
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... |
Doing readback from Direct3D textures and surfaces
===
I need to get the data in a D3D texture back to system memory. What's the fastest way to do that and how?
In my particular case I have a texture that's **D3DUSAGE_RENDERTARGET**. Is it better to try to read it back as a render target? Or as a texture in that case?
In any event answers on how to read back from both render targets and textures would be nice to have somewhere.
The gpgpu.org wiki has a section for this, but no meat is filled in.
This is Direct3D 9, but answers about newer versions of D3D would be appreciated too. | 0 | [
2,
845,
1302,
1958,
37,
1744,
240,
43,
12714,
18,
17,
11569,
800,
3726,
3726,
31,
376,
20,
164,
14,
1054,
19,
21,
13,
43,
240,
43,
12714,
97,
20,
329,
1912,
9,
98,
22,
18,
14,
7518,
161,
20,
107,
30,
17,
184,
60,
19,
51,
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... |
Perl regex to count first ocurrence of pattern in a string from some start pos
===
Actually a bit more complex than what the title suggests:
Problem:
I have a string of arbitrary length, and starting at position p0, I need to find the first occurrence of one of three 3-letter patterns:
Assume the string contain only letters, I need to find the count of triplets starting at pos p0 and jumping forward in triplets until the first occ. of either 'aaa' or 'bbb' or 'ccc'.
(Is this even possible using just a regex?) | 0 | [
2,
416,
255,
7953,
1706,
20,
2468,
64,
635,
4734,
139,
2940,
16,
3732,
19,
21,
3724,
37,
109,
799,
12928,
800,
3726,
3726,
1121,
21,
1142,
91,
1502,
119,
98,
14,
581,
5049,
45,
1448,
45,
31,
57,
21,
3724,
16,
17237,
1476,
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... |
Problem with Asp.Net RequireFieldValidator and Javascript WYSIWYG
===
I am using the open source [Javascript WYSIWYG from OpenWebWare][1] and Asp.Net **RequiredFieldValidator** on the **TextBox** which I am calling the WYSIWYG for. Everything works fine, but the first time I try to submit the form, I get the server-side **RFV** **ErrorMessage** "Required", but if I submit a second time, it goes through.
Am I missing something? I would like to have the client-side validation... how can I get the text to register as not empty?
Thank you.
[1]: http://openwebware.com/ | 0 | [
2,
1448,
29,
28,
306,
9,
2328,
4077,
1109,
18506,
43,
3457,
17,
8247,
8741,
5809,
18,
49,
7913,
263,
800,
3726,
3726,
31,
589,
568,
14,
368,
1267,
636,
1004,
1385,
8741,
5809,
18,
49,
7913,
263,
37,
368,
14113,
5011,
500,
2558,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Design Problem with VetoableChangeListener
===
Hello i have a problem with the design of a VetoableChangeListener:
I implement the VetoableChangeListener interface to listen changes of a property in a model class, when the model fires the
>vetoableChange(PropertyChangeEvent evt) throws PropertyVetoException
i try to save the change in a DB, which could fail (by a SQLException, for example), if it fail's i throw an PropertyVetoException to revert changes in the model, but...
the model is delegating in a VetoableChangeSupport (JDK class), which when receive an PropertyVetoException catches it and notifies the revert to ALL the VetoableChangeListener ,with the oldValue/ newValue interchanged (later it rethrows the exception), so that the event comes to my class again and i try to save in DB again, etc...
I have an workarround which is the model NOT changes until nobody throw an PropertyVetoException, so that in the VetoableChangeListener i FIRST check if the data i going to save in DB is NOT equal to the data in the model, if it's equal i simply ignore the change.
Is there another better workaround?
P.D Sorry for my bad english | 0 | [
2,
704,
1448,
29,
20077,
579,
16229,
13891,
106,
800,
3726,
3726,
10975,
31,
57,
21,
1448,
29,
14,
704,
16,
21,
20077,
579,
16229,
13891,
106,
45,
31,
8713,
14,
20077,
579,
16229,
13891,
106,
6573,
20,
3834,
1693,
16,
21,
1354,
19... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I alter the precision of a decimal column in Sql Server?
===
Is there a way to alter the precision of an existing decimal column in Sql Server? | 0 | [
2,
184,
107,
31,
7835,
14,
13133,
16,
21,
26380,
4698,
19,
4444,
255,
8128,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
7835,
14,
13133,
16,
40,
3149,
26380,
4698,
19,
4444,
255,
8128,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
performance of accessing a mono server application via remoting
===
This is my setting: I have written a .NET application for local client machines, which implements a feature that could also be used on a webpage. To keep this example simple, assume that the client installs a software into which he can enter some data and gets some data back.
The idea is to create a webpage that holds a form into which the user enters the same data and gets the same results back as above. Due to the company's available web servers, the first idea was to create a mono webservice, but this was dismissed for reasons unknown. The "service" is not to be run as a webservice, but should be called by a PHP script. This is currently realized by calling the mono application via shell_exec from PHP.
So now I am stuck with a mono port of my application, which works fine, but takes way too long to execute. I have already stripped out all unnecessary dlls, methods etc, but calling the application via the command line - submitting the desired data via commandline parameters - takes approximately 700ms. We expect about 10 hits per second, so this could only work when setting up a lot of servers for this task.
I assume the 700m are related to the cost of starting the application every time, because it does not make much difference in terms of time if I handle the request only once or five hundred times (I take the original input, vary it slighty and do 500 iterations with "new" data every time. Starting from the second iteration, the processing time drops down to approximately 1ms per iteration)
My next idea was to setup the mono application as a remoting server, so that it only has to be started once and can then handle incoming requests. I therefore wrote another mono application that serves as the client. Calling the client, letting the client pass the data to the server and retrieving the result now takes 344ms. This is better, but still way slower than I would expect and want it to be.
I have then implemented a new project from scratch based on [this blog post][1] and get stuck with the same performance issues.
The question is: am I missing something related to the mono-projects that could improve the speed of the client/server? Although the idea of creating a webservice for this task was dismissed, would a webservice perform better under these circumstances (as I would not need the client application to call the service), although it is said that remoting is faster than webservices?
[1]: http://pubcrawler.org/2003/02/19/net-remoting-with-mono/ | 0 | [
2,
956,
16,
1381,
68,
21,
4129,
8128,
3010,
1197,
302,
7662,
68,
800,
3726,
3726,
48,
25,
51,
2697,
45,
31,
57,
642,
21,
13,
9,
2328,
3010,
26,
375,
6819,
6035,
15,
56,
8713,
18,
21,
1580,
30,
110,
67,
44,
147,
27,
21,
2741,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Stored Procedure Syntax
===
My stored procedure is called as below from an SQL instegartion package within SQL Server 2005
EXEC ? = Validation.PopulateFaultsFileDetails ? , 0
Though i'm not sure what the ? means | 0 | [
2,
8214,
7004,
22649,
800,
3726,
3726,
51,
8214,
7004,
25,
227,
28,
1021,
37,
40,
4444,
255,
19,
6100,
2063,
3309,
6030,
363,
4444,
255,
8128,
812,
1396,
3319,
13,
60,
800,
27999,
9,
6057,
12383,
410,
9708,
18,
16877,
546,
8682,
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,
0,
0,
0... |
Guidelines for email newsletters in order
===
I'm implementing a **email newsletter sender service** using .NET and Windows Server technologies. Are there comprehensive guidelines which could help **avoiding emails being trapped by spam filters** and other mechanisms?
They should cover all aspectes of (legal) bulk mail sending: SMTP configuration, DNS, HTML content, images, links within content etc. A simple example: is it better to embed images or load them from a server?
It would be great if you could provide some empirical data to show the efficiency of some measures taken.
| 0 | [
2,
12629,
26,
8517,
17782,
18,
19,
389,
800,
3726,
3726,
31,
22,
79,
17333,
21,
13,
1409,
62,
8079,
17782,
2660,
106,
365,
1409,
568,
13,
9,
2328,
17,
1936,
8128,
5740,
9,
50,
80,
7041,
12629,
56,
110,
448,
13,
1409,
13884,
1340... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 and MS Access Schema
===
I am using following PHP code to connect to MS Access database:
$odb_conn = new COM("ADODB.Connection");
$connstr = "DRIVER={Microsoft Access Driver (*.mdb)}; DBQ=". $db_path.";";
$odb_conn->open($connstr);
How can I retrieve database catalog/metadata from the mdb file? | 0 | [
2,
13,
26120,
17,
4235,
1381,
23874,
800,
3726,
3726,
31,
589,
568,
249,
13,
26120,
1797,
20,
6379,
20,
4235,
1381,
6018,
45,
5579,
111,
9007,
1,
1126,
103,
800,
78,
13,
960,
5,
7,
5672,
9007,
9,
25996,
872,
7,
6,
73,
5579,
11... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Encryption libraries?
===
I have been tasked with implementing a PKI library in C# for a company project, and have been unable to find a good implementation of it. There appear to be multiple libraries, and many broken links pointing to MSDN libraries that have been removed. I've seen people using Crypt32.dll, people building their own libraries, people using P/Invoke to access system certificate stores, people extending the built-in libraries, examples that simply don't apply to C# (e.g. Java examples), and commercial libraries.
My question is, which implementation/library is most recommended for simple encryption/decryption of data?
As some background for what I plan to do with it, I simply need to encrypt messages using a private key (.pfx), and decrypt with public keys (.cer). Message signing and authentication isn't required at this level of the project, although it may be in future.
I have seen reference to encryption lengths which make me uneasy. We need to be able to encrypt any length message (within reason, of course!). Is this something I need to worry about, and if so, is there a way to deal with it?
I would prefer not to store public/private keys in the windows certificate manager if at all possible, but if it makes implementation significantly simpler, so be it.
I realize PKI and encryption is a large and complex subject, but I'm hoping for a relatively simple library anyway... (one can hope, right?)
Thanks! | 0 | [
2,
24420,
8649,
60,
800,
3726,
3726,
31,
57,
74,
14605,
29,
17333,
21,
351,
1520,
1248,
19,
272,
5910,
26,
21,
237,
669,
15,
17,
57,
74,
2343,
20,
477,
21,
254,
6123,
16,
32,
9,
80,
1893,
20,
44,
1886,
8649,
15,
17,
151,
202... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Combination of more than one crypto algorithm
===
I'm considering the following: I have some data stream which I'd like to protect as secure as possible -- does it make any sense to apply let's say AES with some IV, then Blowfish with some IV and finally again AES with some IV?
The encryption / decryption process will be hidden (even protected against debugging) so it wont be easy to guess which crypto method and what IVs were used (however, I'm aware of the fact the power of this crypto chain can't be depend on this fact since every protection against debugging is breakable after some time).
I have computer power for this (that amount of data isn't that big) so the question only is if it's worth of implementation. For example, TripleDES worked very similarly, using three IVs and encrypt/decrypt/encrypt scheme so it probably isn't total nonsense. Another question is how much I decrease the security when I use the same IV for 1st and 3rd part or even the same IV for all three parts?
I welcome any hints on this subject :)
Thanks in advance! | 0 | [
2,
3733,
16,
91,
119,
53,
16277,
9083,
800,
3726,
3726,
31,
22,
79,
5154,
14,
249,
45,
31,
57,
109,
1054,
3766,
56,
31,
22,
43,
101,
20,
2196,
28,
4315,
28,
938,
13,
8,
8,
630,
32,
233,
186,
1259,
20,
5645,
408,
22,
18,
39... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Failover & Disaster Recovery
===
What's the difference between failover and disaster recovery? | 0 | [
2,
7476,
2549,
279,
5302,
6550,
800,
3726,
3726,
98,
22,
18,
14,
2841,
128,
7476,
2549,
17,
5302,
6550,
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,
0,
0,
0,
0,
0,
0,
0... | [
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,
0,
0,
0,
0,
0,
0... |
User Monitoring in Rails
===
We have an app with an extensive admin section. We got a little trigger happy with features (as you do) and are looking for some quick and easy way to monitor "who uses what".
Ideally a simple gem that will allow us to track controller/actions on a per user basis to build up a picture of the features that are used and those that are not.
Anything out there that you'd recommend..
Thanks
Dom | 0 | [
2,
4155,
8984,
19,
2240,
18,
800,
3726,
3726,
95,
57,
40,
4865,
29,
40,
3386,
21,
43,
2160,
1050,
9,
95,
330,
21,
265,
7286,
1700,
29,
967,
13,
5,
472,
42,
107,
6,
17,
50,
699,
26,
109,
2231,
17,
2010,
161,
20,
7626,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.