unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
How do you optimise your Javascript ?
===
Well... simple question, right? But with no so simple answers.
In firefox i use firebug console (profile) but... what to do in other browsers? Like Internet Explorer / Opera / Safari (on windows) | 0 | [
2,
184,
107,
42,
19259,
2628,
154,
8247,
8741,
13,
60,
800,
3726,
3726,
134,
9,
9,
9,
1935,
1301,
15,
193,
60,
47,
29,
90,
86,
1935,
6709,
9,
19,
535,
18219,
31,
275,
535,
16254,
8650,
13,
5,
14503,
6,
47,
9,
9,
9,
98,
20,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
NTFS performance and large volumes of files and directories
===
How does Windows with NTFS perform with large volumes of files and directories?
Is there any guidance around limits of files or directories you can place in a single directory before you run into performance problems or other issues? e.g. is a folder with 100,000 folders inside of it an ok thing to do | 0 | [
2,
13,
2877,
11754,
956,
17,
370,
6127,
16,
6488,
17,
559,
1596,
800,
3726,
3726,
184,
630,
1936,
29,
13,
2877,
11754,
2985,
29,
370,
6127,
16,
6488,
17,
559,
1596,
60,
25,
80,
186,
8193,
140,
5887,
16,
6488,
54,
559,
1596,
42,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I test Rails block helpers with rSpec
===
In my views I use a helper that takes arbitrary HTML as a block:
<% some_block_helper do %>
Some arbitrary HTML and ERB variables here.
More HTML here.
<% end %>
My helper does a bunch of things to the passed block of HTML before rendering it back to the view (Markdown and other formatting). I would like to know what are the cleanest ways of testing the result of the helper call in rSpec, if any. I've found a few examples that muck about with private methods of ERB but that seems a bit brittle and hard to read. | 0 | [
2,
184,
107,
31,
1289,
2240,
18,
1921,
448,
445,
29,
13,
1224,
12610,
800,
3726,
3726,
19,
51,
4146,
31,
275,
21,
448,
106,
30,
1384,
17237,
13,
15895,
28,
21,
1921,
45,
13,
1,
11881,
109,
1,
12048,
1,
14593,
106,
107,
13,
118... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
VMWare ctrl-z key binding, how to remove
===
When I alt-tab to my VM from my host the VM does not get keyboard input until I click inside it. This is causing me an issue as it looks like the VM has control of the input (as the cursor is flashing away). If while in this state, VMWare server has the focus rather then the application inside it, if you do ctrl-Z (normally for undo) it suspends the VM.
This is driving me barmey. I have looked through all the options and preferences in VMWare Server and can't find anyway to disable this.
Anyone know how to disable this? | 0 | [
2,
13,
20147,
5011,
13,
4812,
6362,
8,
380,
1246,
8728,
15,
184,
20,
4681,
800,
3726,
3726,
76,
31,
7051,
8,
15783,
20,
51,
13,
20147,
37,
51,
2015,
14,
13,
20147,
630,
52,
164,
8896,
6367,
163,
31,
10840,
572,
32,
9,
48,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to set Visual Studio as the default post-mortem debugger?
===
Not too long ago, I had a problem which required me to [set WinDbg.exe as the default post-mortem debugger][1]. Now that I've fixed that and am back doing normal work, it would be really nice if I could set VS to be my default post-mortem debugger. How does one go about doing this?
Also, how do I make VS attach to an already existing session? That is, I've got my VS project open in one window, and a command line open where I'm launching my program from. If the program crashes, how do I get VS to figure out to attach the debugger to the active line in the project that's already open?
[1]: http://stackoverflow.com/questions/186237/program-only-crashes-as-release-build-how-to-debug | 0 | [
2,
184,
20,
309,
3458,
1120,
28,
14,
12838,
678,
8,
17523,
1503,
121,
2345,
11356,
60,
800,
3726,
3726,
52,
266,
175,
1464,
15,
31,
41,
21,
1448,
56,
1390,
55,
20,
636,
3554,
1511,
19924,
9,
1706,
62,
28,
14,
12838,
678,
8,
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... |
Error with no HashCode, Equals eclipse
===
I'm looking for a very specific eclipse plugin that will tell me if a class in my project is not implementing hashCode or/and equals methods.
Does anyone know of such a plugin?
Thanks | 0 | [
2,
7019,
29,
90,
19170,
9375,
15,
2747,
18,
11652,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
253,
1903,
11652,
10922,
108,
30,
129,
494,
55,
100,
21,
718,
19,
51,
669,
25,
52,
17333,
19170,
9375,
54,
118,
290,
2747,
18,
3195,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Winforms app like google chrome with multiple processes
===
Is there anyway to use C# to build a container app where each tab is actually its own process like with Google chrome. | 0 | [
2,
628,
4190,
18,
4865,
101,
8144,
13,
12985,
29,
1886,
5102,
800,
3726,
3726,
25,
80,
2774,
20,
275,
272,
5910,
20,
1895,
21,
12147,
4865,
113,
206,
6523,
25,
1121,
82,
258,
953,
101,
29,
8144,
13,
12985,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Why can't I use a type argument in a type parameter with multiple bounds?
===
So, I understand <i>that</i> the following doesn't work, but <i>why</i> doesn't it work?
<pre>
interface Adapter<E> {}
class Adaptulator<I> {
<E, A extends I & Adapter<E>> void add(Class<E> extl, Class<A> intl) {
addAdapterFactory(new AdapterFactory<E, A>(extl, intl));
}
}
</pre>
The <code>add()</code> method gives me a compile error, "Cannot specify any additional bound Adapter<E> when first bound is a type parameter" (in Eclipse), or "Type parameter cannot be followed by other bounds" (in IDEA), take your pick.
Clearly you're just Not Allowed to use the type parameter <code>I</code> there, before the <code>&</code>, and that's that. (And before you ask, it doesn't work if you switch 'em, because there's no guarantee that <code>I</code> isn't a concrete class.) But why not? I've looked through Angelika Langer's FAQ and can't find an answer.
Generally when some generics limitation seems arbitrary, it's because you've created a situation where the type system can't actually enforce correctness. But I don't see what case would break what I'm trying to do here. I'd say maybe it has something to do with method dispatch after type erasure, but there's only one <code>add()</code> method, so it's not like there's any ambiguity...
Can someone demonstrate the problem for me?
| 0 | [
2,
483,
92,
22,
38,
31,
275,
21,
1001,
5476,
19,
21,
1001,
18906,
29,
1886,
4138,
18,
60,
800,
3726,
3726,
86,
15,
31,
1369,
13,
1,
49,
1,
887,
1,
118,
49,
1,
14,
249,
1437,
22,
38,
170,
15,
47,
13,
1,
49,
1,
2256,
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... |
Proxy choices: mod_proxy_balancer, nginx + proxy balancer, haproxy?
===
We're running a Rails site at [http://hansard.millbanksystems.com][1], on a dedicated Accelerator. We currently have Apache setup with mod-proxy-balancer, proxying to four mongrels running the application.
Some requests are rather slow and in order to prevent the situation where other requests get queued up behind them, we're considering options for proxying that will direct requests to an idle mongrel if there is one.
Options appear to include:
- recompiling mod_proxy_balancer for Apache as described at [http://labs.reevoo.com/][2]
- compiling nginx with the fair proxy balancer for Solaris
- compiling haproxy for Open Solaris (although this may not work well with SMF)
Are these reasonable options? Have we missed anything obvious? We'd be very grateful for your advice.
[1]: http://hansard.millbanksystems.com
[2]: http://labs.reevoo.com/2008/7/30/fixing-uneven-load-balancing-between-apache-and-mongrel-for-ruby-on-rails-applications | 0 | [
2,
27188,
10978,
45,
7226,
1,
4899,
9229,
1,
24140,
139,
15,
13,
2723,
108,
396,
2754,
27188,
4468,
139,
15,
1458,
4899,
9229,
60,
800,
3726,
3726,
95,
22,
99,
946,
21,
2240,
18,
689,
35,
636,
21127,
6903,
1841,
18,
1514,
9,
870... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
class design with vector as a provate/public member ?
===
what is the best way to put a container class or a some other class inside a class as private or a public member? | 0 | [
2,
718,
704,
29,
7497,
28,
21,
13,
20275,
1373,
118,
12259,
322,
13,
60,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
442,
21,
12147,
718,
54,
21,
109,
89,
718,
572,
21,
718,
28,
932,
54,
21,
317,
322,
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... |
Getting System Date in MSVC 6.0
===
I am trying to get system date in a C program on a MSVC++ 6.0 compiler. I am using a system call:
**system("date /T")** (output is e.g. 13-Oct-08 which is date on my system in the format i have set)
but this prints the date to the i/o console.
How do i make take this date as returned by above system call and store it as a string value to a string defined in my code?
Or
Is there any other API i can use to get the date in above mentioned format (13-Oct-08, or 13-10-08) ?
-AD
| 0 | [
2,
1017,
329,
1231,
19,
4235,
8990,
400,
9,
387,
800,
3726,
3726,
31,
589,
749,
20,
164,
329,
1231,
19,
21,
272,
625,
27,
21,
4235,
8990,
20512,
400,
9,
387,
21486,
9,
31,
589,
568,
21,
329,
645,
45,
13,
1409,
10724,
5,
7,
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... |
SqlDataReader.HasRows returns false since SQL 2008 upgrade
===
I've got an ASP.NET 2.0 website that connects to a SQL database. I've upgraded the SQL server from 2000 to 2008 and since then, one page refuses to work.
I've worked out the problem is that the call to SqlDataReader.HasRows is returning false even though the dataset is not empty and removing the check allows the loop through reader.Read() to access the expected data.
_connectionString = WebConfigurationManager.ConnectionStrings["SQLServer"].ConnectionString;
SqlConnection connection = new SqlConnection(_connectionString);
SqlCommand command = new SqlCommand(searchtype, connection);
SqlParameter _parSeachTerm = new SqlParameter("@searchterm", SqlDbType.VarChar, 255);
_parSeachTerm.Value = searchterm;
command.Parameters.Add(_parSeachTerm);
command.CommandType = CommandType.StoredProcedure;
try
{
connection.Open();
SqlDataReader reader = command.ExecuteReader();
if (reader.HasRows) //this always returns false!?
{
while (reader.Read())
{...
Does anybody have any idea what's going on? There are similar code blocks on other pages where HasRows returns the correct value.
Many thanks in advance. | 0 | [
2,
4444,
255,
18768,
10647,
106,
9,
6482,
5417,
18,
4815,
4997,
179,
4444,
255,
570,
9483,
800,
3726,
3726,
31,
22,
195,
330,
40,
28,
306,
9,
2328,
172,
9,
387,
2271,
30,
8534,
20,
21,
4444,
255,
6018,
9,
31,
22,
195,
9958,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
what is a pre-revprop-change hook in SVN and how do I create it?
===
I wanted to edit a log comment in the repo-browser and received an error message that no pre-revprop-change hook exists for the repository. Besides having a scary name, what is a pre-revprop-change hook and how do I create it? | 0 | [
2,
98,
25,
21,
782,
8,
14587,
10890,
8,
16229,
5559,
19,
13,
18,
16578,
17,
184,
107,
31,
1600,
32,
60,
800,
3726,
3726,
31,
417,
20,
9392,
21,
6738,
6484,
19,
14,
302,
1638,
8,
25699,
4104,
17,
420,
40,
7019,
2802,
30,
90,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 check if a file exists in javascript?
===
I'm using the jquery library to load the content of an html file. Something like this:
$("#Main").load("login.html")
If the file (in this case 'login.html') does not exist, I would like to detect it so that I can redirect the user to an error page for example. Any ideas how I can detect if the file to load exists or not? | 0 | [
2,
184,
20,
2631,
100,
21,
3893,
5636,
19,
8247,
8741,
60,
800,
3726,
3726,
31,
22,
79,
568,
14,
487,
8190,
93,
1248,
20,
6305,
14,
2331,
16,
40,
13,
15895,
3893,
9,
301,
101,
48,
45,
5579,
5,
7,
5910,
6232,
7,
6,
9,
8294,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
BizTalk Server BAM Portal on x64 Windows 2008/IIS 7.0
===
We are attempting to install BizTalk Server 2006 R2 on a fresh server with x64 Windows 2008. The basic configuration is complaining that the “Default Web Site” we select for the BAM Portal installation is not validated due to “IIS is not 32-bit enabled.” Despite setting the appPool (Classic mode) 32-bit property to True, BizTalk configuration wizard is still complaining.
Has anybody successfully installed BAM Portal in 64-bit IIS 7.0?
| 0 | [
2,
1732,
380,
9718,
8128,
11890,
8281,
27,
993,
3470,
1936,
570,
118,
2865,
18,
453,
9,
387,
800,
3726,
3726,
95,
50,
6314,
20,
16146,
1732,
380,
9718,
8128,
592,
761,
135,
27,
21,
3180,
8128,
29,
993,
3470,
1936,
570,
9,
14,
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... |
How to parse a command line with regular expressions?
===
I want to split a command line like string in single string parameters. How look the regular expression for it. The problem are that the parameters can be quoted. For example like:
"param 1" param2 "param 3"
should result in:
param 1, param2, param 3 | 0 | [
2,
184,
20,
2017,
870,
21,
1202,
293,
29,
1290,
13832,
60,
800,
3726,
3726,
31,
259,
20,
2132,
21,
1202,
293,
101,
3724,
19,
345,
3724,
12905,
9,
184,
361,
14,
1290,
1803,
26,
32,
9,
14,
1448,
50,
30,
14,
12905,
92,
44,
9591,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Removing contents of PlaceHolderPageTitleInTitleArea
===
In sharepoint there is a content place holder called PlaceHolderPageTitlteInTitleArea. I'm trying to remove everything in it from a custom RenderingTemplate that I placed in CONTROLTEMPLATES. So is it possible to achieve this either by using inline code or some other ways. | 0 | [
2,
9096,
8478,
16,
209,
12427,
6486,
22235,
108,
22235,
17760,
800,
3726,
3726,
19,
1891,
3132,
80,
25,
21,
2331,
209,
8979,
227,
209,
12427,
6486,
1388,
7786,
591,
108,
22235,
17760,
9,
31,
22,
79,
749,
20,
4681,
796,
19,
32,
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... |
About System.Linq.Lookup class
===
I came across this class while reading a C# book and have some questions.
* Why is this added into System.Linq namespace and not into usuall Collections namespace?
* What the intention behind this class is
* Why this class is not intended for direct instantiation? This is available through the ToLookup extension only, right? | 0 | [
2,
88,
329,
9,
1226,
1251,
9,
5810,
576,
718,
800,
3726,
3726,
31,
281,
464,
48,
718,
133,
1876,
21,
272,
5910,
360,
17,
57,
109,
2346,
9,
1637,
483,
25,
48,
905,
77,
329,
9,
1226,
1251,
204,
5582,
17,
52,
77,
3820,
255,
572... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Calling a static member function of a C++ STL container's value_type
===
I'm trying to get my head around why the following doesn't work. I have a std::vector and I want to call a static member function of it's contained value_type like so:
std::vector<Vector> v;
unsigned u = v.value_type::Dim();
where Vector is in fact a typedef for a templated type:
template <typename T, unsigned U> class SVector;
typedef SVector<double, 2> Vector; //two-dimensional SVector containing doubles
and the static member function Dim() actually inlines the dimensionality U of the Vector.
Now the compiler returns an error message saying:
error: ‘SVector<double, 2u>’ is not a base of
‘std::vector<SVector<double, 2u>, std::allocator<SVector<double, 2u> > >
which puzzles me. I can replace the apparently offending line by
unsigned u = Vector::Dim();
and that works, but is obviously ugly as it hardcodes assumptions about the value_type of v...
Thanks! | 0 | [
2,
2555,
21,
12038,
322,
1990,
16,
21,
272,
20512,
354,
255,
12147,
22,
18,
1923,
1,
4474,
800,
3726,
3726,
31,
22,
79,
749,
20,
164,
51,
157,
140,
483,
14,
249,
1437,
22,
38,
170,
9,
31,
57,
21,
354,
43,
45,
45,
28033,
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... |
table layout wrong in IE(7)
===
below is the code of a simple html with a table layout.
in FF it's looking as i think it should look like,
in IE7 it doesn't. what am I doing wrong?
and how can I fix it?
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<TITLE>test</TITLE>
</head>
<body>
<table id="MainTable" cellspacing="0" cellpadding="0" border="1">
<tbody>
<tr>
<td colspan="4">
<div style='width:769; height:192;'>192
</div>
</td>
</tr>
<tr>
<td colspan="2" valign="top">
<div style='width:383; height:100;'>100
</div>
</td>
<td rowspan="2" valign="top">
<div style='width:190; height:200;'>200
</div>
</td>
<td rowspan="2" valign="top">
<div style='width:190; height:200;'>200
</div>
</td>
</tr>
<tr>
<td valign="top" rowspan="2">
<div style='width:190; height:200;'>200
</div>
</td>
<td valign="top" rowspan="2">
<div style='width:190; height:200;'>200
</div>
</td>
</tr>
<tr>
<td valign="top">
<div style='width:190; height:100;'>100
</div>
</td>
<td valign="top" >
<div style='width:190; height:100;'>100
</div>
</td>
</tr>
<tr>
<td colspan="2">
<div style='width:383; height:100;'>100
</div>
</td>
<td colspan="2">
<div style='width:383; height:100;'>100
</div>
</td>
</tr>
<tr>
<td>
<div style='width:190; height:100;'>100
</div>
</td>
<td>
<div style='width:190; height:100;'>100
</div>
</td>
<td colspan="2">
<div style='width:383; height:100;'>100
</div>
</td>
</tr>
</tbody>
</table>
</body>
</html> | 0 | [
2,
859,
9106,
1389,
19,
13,
660,
5,
465,
6,
800,
3726,
3726,
1021,
25,
14,
1797,
16,
21,
1935,
13,
15895,
29,
21,
859,
9106,
9,
19,
13,
2460,
32,
22,
18,
699,
28,
31,
277,
32,
378,
361,
101,
15,
19,
13,
660,
465,
32,
1437,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WCF self-hosted service with transport security (The underlying connection was closed)
===
I have a self-hosted service that I want to add transport security to.
I've set WSHttpBinding.SecurityMode to Transport and the ClientCredentialType to HttpClientCredentialType.None.
I've created a certificate and set it to my host with
ServiceHost.Credentials.ServiceCertificate.SetCertificate()
I'm getting the following error message whenever I try to call the service:
"The underlying connection was closed: An unexpected error occurred on a send."
Is there anything I'm missing? Should I also configure something on the client side? | 0 | [
2,
11801,
410,
1119,
8,
25219,
365,
29,
1739,
1221,
13,
5,
124,
10974,
2760,
23,
827,
6,
800,
3726,
3726,
31,
57,
21,
1119,
8,
25219,
365,
30,
31,
259,
20,
3547,
1739,
1221,
20,
9,
31,
22,
195,
309,
619,
18,
21127,
22260,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using Castle Windsor's fluent interface to register components in a decorator chain, when there are also specialised service-types?
===
I am trying to implement a decorator chain for my data-access based on
IRepository<TEntity, TKey>. I have a Repository that does the data-
access (at the moment just in-memory list) {1}, and I have one that
does validation {2}. On top of that, I have a specialisation of my
Repository, IUsersRepository {3}, which defines another method on the
base interface. I am running on the latest trunk revision 5376.
I would like to be able to register my components using the fluent
interface - is it possible to specify, as it is via XML, the key of
the service to use as the innerRepo? If so, how? (See [Bitter Coder Decorator tutorial](http://blog.bittercoder.com/PermaLink,guid,4863e460-2985-475c-9266-80b4895e80de.aspx)
for an XML-config example). I would prefer to not need to rely on the
order of registrations, apart from anything else.
I am following [this blog post](http://blog.bittercoder.com/PermaLink,guid,63653be2-d0d4-4a0b-b3e5-a1572aad5c8b.aspx).
I have been able to get the decorator chain working if I ask the
container for IRepository<User, int> {4}; I see my
ValidatingRepository methods get called before my data-access. But I
have not been able to get it working if I ask the container for
IUserRepository (I get an InvalidCastException - I guess this is
expected, but is it work-aroundable?).
I would like to avoid needing to use one decorated-repo and one
specialised-methods repository in my services; this strikes me as
error-prone. At the moment, my specialised methods are all to do with
fetching entities by different criteria - I suppose I could make my
Get method take a detached-criteria - that would allow me to only have
one on my interface, and eliminate the need for the specialised
interfaces. Except that I'm not allowed to because we haven't decided
to definitely use NHibernate. Perhaps if I made IRepo.Get take a
delegate or an IQueryable? Any ideas? I've been banging my head
against this all morning and wouldn't be surprised if I have tunnel
vision, and there's a different, better, approach; any suggestions are
welcomed!
{1} - {4} can be seen at [utilitybase](http://utilitybase.com/paste/9003)'s copy/paste facility. | 0 | [
2,
568,
1339,
10784,
22,
18,
19252,
6573,
20,
2243,
5090,
19,
21,
17650,
3457,
2858,
15,
76,
80,
50,
67,
20195,
365,
8,
4474,
18,
60,
800,
3726,
3726,
31,
589,
749,
20,
8713,
21,
17650,
3457,
2858,
26,
51,
1054,
8,
20604,
432,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Virtual 360º software solutions or libraries for use on PHP driven website?
===
Can anyone point to some good software or libraries in order to create/add a 360º virtual panorama into a web page, ideally using LAMP (php)? | 0 | [
2,
6599,
11760,
111,
2306,
6776,
54,
8649,
26,
275,
27,
13,
26120,
5355,
2271,
60,
800,
3726,
3726,
92,
1276,
454,
20,
109,
254,
2306,
54,
8649,
19,
389,
20,
1600,
118,
14854,
21,
11760,
111,
6599,
24805,
77,
21,
2741,
2478,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Grouping by intervals
===
Given a table (mytable) containing a numeric field (mynum), how would one go about writing an SQL query which summarizes the table's data based on ranges of values in that field rather than each distinct value?
For the sake of a more concrete example, let's make it intervals of 3 and just "summarize" with a count(*), such that the results tell the number of rows where mynum is 0-2.99, the number of rows where it's 3-5.99, where it's 6-8.99, etc. | 0 | [
2,
19288,
34,
15899,
800,
3726,
3726,
504,
21,
859,
13,
5,
915,
5924,
6,
3503,
21,
15764,
596,
575,
13,
5,
915,
6336,
6,
15,
184,
83,
53,
162,
88,
1174,
40,
4444,
255,
25597,
56,
18074,
11088,
160,
14,
859,
22,
18,
1054,
432,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 desing an enumerator that returns (theoretically) an infinite amount of items?
===
I'm writing code that looks similar to this:
public IEnumerable<T> Unfold<T>(this T seed)
{
while (true)
{
yield return [next (T)object in custom sequence];
}
}
Obviously, this method is never going to return. (The C# compiler silently allows this, while R# gives me the warning *"Function never returns"*.)
Generally speaking, is it *bad* desing to provide an enumerator that returns an infinite amount of items, without suppling a way to stop enumerating?
Are there any special considerations for this scenario? Mem? Perf? Other gotchas?
If we always supply an exit condition, which are the options? E.g:
* an object of type T that represents the inclusive or exclusive boundary
* a `Predicate<T> continue` (as TakeWhile does)
* a count (as Take does)
* ...
Should we rely on users calling `Take(...)` / `TakeWhile(...)` after `Unfold(...)`? (Maybe the preferred option, since it leverages existing Linq knowledge.)
Would you answer this question differently if the code was going to be published in a public API, either as-is (generic) or as a specific implementation of this pattern? | 0 | [
2,
184,
107,
42,
1746,
68,
40,
26940,
248,
30,
4815,
13,
5,
29805,
1326,
6,
40,
9698,
2006,
16,
3755,
60,
800,
3726,
3726,
31,
22,
79,
1174,
1797,
30,
1879,
835,
20,
48,
45,
317,
13,
660,
6336,
106,
579,
1,
38,
1,
20174,
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... |
Check for sectio index titles from table view cell
===
I have subclassed UITableViewCell and I need to draw my own disclosure indicator. The position of the disclosure indicator depends on whether or not the table view has section index titles set (the "scroll bar", typically the alphabet).
Does anyone know of a way to check if the table view shows section index titles from the cell? | 0 | [
2,
2631,
26,
16742,
1963,
4348,
3037,
37,
859,
1418,
1667,
800,
3726,
3726,
31,
57,
972,
1898,
69,
13,
11193,
579,
4725,
9725,
17,
31,
376,
20,
2003,
51,
258,
21449,
13310,
9,
14,
649,
16,
14,
21449,
13310,
9597,
27,
1472,
54,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
schd.getCurrentlyExecutingJobs() behaving indifferently
===
I am using schd.getCurrentlyExecutingJobs() to get the list of currently running jobs. This method returns list of currently running jobs for the each instance of scheduler,so I made scheduler instance return only once by using singleton pattern. But this method even though send request to start several schedulers and all of them are also started in fact, still it gives list of currently running jobs as 0.
Am I doing any mistake or is there a bug in the method. Can anyone please throw some thoughts on it? | 0 | [
2,
4303,
43,
9,
3060,
24947,
1706,
17194,
1203,
1636,
4562,
5,
6,
44,
13693,
19,
15782,
102,
800,
3726,
3726,
31,
589,
568,
4303,
43,
9,
3060,
24947,
1706,
17194,
1203,
1636,
4562,
5,
6,
20,
164,
14,
968,
16,
871,
946,
4844,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
jquery $.post not working when element dropped
===
I'm teaching myself JQuery, PHP! and having a few problems!
I need the element id to be posted to my php script once dropped over my droppable div.
The following code does not post when I drag and drop an element over a droppable div.
I have tried the following:
I have removed everything apart from an alert box to check that an item has been dropped which it does, so the item is being seen as droppable!.
I have entered some content into the div manually to ensure results can been seen
I have replaced name to var name="test", to test the varible contents.
javascript file and the php script reside in the same directory, file names are correct.
The javascript drag and drop script is included after droppable area
<script type="text/javascript" src="js/drag-drop.js"></script>
I have replaced the result of php script as plain text to see if the problem could be the variable received, nothing returns
So the post does not seem to be getting to the php script!
Hope someone can provide a few pointers!
Below is my code, the HTML is just a div
Thanks
$(document).ready(function() {
$('#carousel-ul li').draggable({
helper: 'clone',
revert: true
});
$('#drop').droppable({
hoverClass: 'drophover',
accept: '#carousel-ul li',
drop: function(){
//alert("has been accepted and dropped");
var name = ui.helper.attr('id').val();
$.post('javascript.php', { name: name }, function(data){
$('#drop-content').html(data);
});
}
});
});
<?php
//echo "id was posted";
if(isset($_POST['name'])){
$name = $_POST['name'];
var_dump($name);
echo name;
//echo "id was posted inside";
}
?> | 0 | [
2,
487,
8190,
93,
5579,
9,
6962,
52,
638,
76,
4520,
1539,
800,
3726,
3726,
31,
22,
79,
2540,
992,
487,
8190,
93,
15,
13,
26120,
187,
17,
452,
21,
310,
1716,
187,
31,
376,
14,
4520,
4924,
20,
44,
6054,
20,
51,
13,
26120,
3884,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 combine GROUP BY and ROW_NUMBER?
===
I hope following sample code is self-explanatory:
declare @t1 table (ID int,Price money, Name varchar(10))
declare @t2 table (ID int,Orders int, Name varchar(10))
declare @relation table (t1ID int,t2ID int)
insert into @t1 values(1, 200, 'AAA');
insert into @t1 values(2, 150, 'BBB');
insert into @t1 values(3, 100, 'CCC');
insert into @t2 values(1,25,'aaa');
insert into @t2 values(2,35,'bbb');
insert into @relation values(1,1);
insert into @relation values(2,1);
insert into @relation values(3,2);
select T2.ID AS T2ID
,T2.Name as T2Name
,T2.Orders
,T1.ID AS T1ID
,T1.Name As T1Name
,T1Sum.Price
FROM @t2 T2
INNER JOIN (
SELECT Rel.t2ID
,MAX(Rel.t1ID)AS t1ID
-- the MAX returns an arbitrary ID, what i need is:
-- ,ROW_NUMBER()OVER(Partition By Rel.t2ID Order By Price DESC)As PriceList
,SUM(Price)AS Price
FROM @t1 T1
INNER JOIN @relation Rel ON Rel.t1ID=T1.ID
GROUP BY Rel.t2ID
)AS T1Sum ON T1Sum.t2ID = T2.ID
INNER JOIN @t1 T1 ON T1Sum.t1ID=T1.ID
Result:
T2ID T2Name Orders T1ID T1Name Price
1 aaa 25 2 BBB 350,00
2 bbb 35 3 CCC 100,00
What i need is commented above, a way to get the `ROW_NUMBER` but also to `Group By` in the first place. So i need the `sum` of all T1-prices grouped by `T2.ID` in the relation-table and in the outer query the `t1ID` with the highest price.
In other words: How to change `MAX(Rel.t1ID)AS t1ID` to somewhat returning the ID with the highest price?
So the desired result is(notice that first T1ID changed from 2 to 1 since it has the higher price):
T2ID T2Name Orders T1ID T1Name Price
1 aaa 25 1 BBB 350,00
2 bbb 35 3 CCC 100,00
| 0 | [
2,
184,
20,
12287,
214,
34,
17,
3131,
1,
16299,
60,
800,
3726,
3726,
31,
1376,
249,
5717,
1797,
25,
1119,
8,
6899,
1804,
7496,
45,
10123,
13,
1,
38,
165,
859,
13,
5,
1340,
19,
38,
15,
24137,
875,
15,
204,
4033,
5433,
5,
1036,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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# LINQ SQL Login Form trouble
===
I wrote the following code to log in to my application using C# and LINQ. It connected to a SQL service oriented database that I have created in Visual Studio. The problem that I am having is one that I do not understand and am hoping that someone can help me about here. I have created two message boxed to try to see the output of my code buy I am not getting anything from it.
If anyone could help that would be great!
public bool UserLogin(string User, string Pass)
{
var Database = new ExampleDataSet();
var query = from Employee in Database.Employee
where (Employee.EmployeeID.ToString() == Employee.ToLower() && Employee.Password == Pass)
select Employee;
if (query.Count() != 0)
{
return true;
MessageBox.Show("You are logged in");
}
return false;
MessageBox.Show("You are not logged in");
}
private void cmdLogin_Click(object sender, EventArgs e)
{
string User = (txtUser.Text);
string Pass = (txtPass.Text);
UserLogin(User, Pass);
} | 0 | [
2,
272,
5910,
6294,
1251,
4444,
255,
6738,
108,
505,
2572,
800,
3726,
3726,
31,
738,
14,
249,
1797,
20,
6738,
19,
20,
51,
3010,
568,
272,
5910,
17,
6294,
1251,
9,
32,
2587,
20,
21,
4444,
255,
365,
13,
6800,
6018,
30,
31,
57,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
client not handshaken client should reconnect, socket.io in cluster
===
My node.js app with express, redis, mongo and socket.io works prefectly.
Today when I introduced cluster, I found that it works, but there are lot of messages by the app,
'client not handshaken' 'client should reconnect'
Many a times the response time from socket.io is very bad, up several seconds.
Then I used http-proxy front ending the requests from the browsers. Chrome works intermittently without throwing up such messages. Sometimes if I open the same URL again, it starts throwing up these messages and response is delayed.
Firefox also behaves the same way. randomly, it starts throwing these messages continuously..
Looks like some problem with websocket in clustered environment.
My node.js version is 0.6.10, socket.io 0.9.0, express 2.5.9, http-proxy 0.8.0 | 0 | [
2,
6819,
52,
224,
17248,
103,
6819,
378,
29693,
15,
18482,
9,
1963,
19,
7460,
800,
3726,
3726,
51,
15421,
9,
728,
18,
4865,
29,
2999,
15,
402,
403,
15,
3521,
839,
17,
18482,
9,
1963,
693,
19733,
102,
9,
786,
76,
31,
1277,
7460,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Sending Query String to publish_action
===
I've been working with the Graph API recently, and am trying to work with publish_actions.
Now, the current issue is that the page I want to publish, has a query string to identify it.
for example:
/me/nodefmradio:comment_on?show=http://mysite.com/show.php?s=showname',
Now, I wish to be able to publish the action for the site with the query string. Is this possible? if so; how?
Thanks in advanced | 0 | [
2,
4907,
25597,
3724,
20,
10824,
1,
8645,
800,
3726,
3726,
31,
22,
195,
74,
638,
29,
14,
7210,
21,
2159,
1989,
15,
17,
589,
749,
20,
170,
29,
10824,
1,
8645,
18,
9,
130,
15,
14,
866,
1513,
25,
30,
14,
2478,
31,
259,
20,
1082... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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: unset variable in C# .NET?
===
It's really funny but I didn't manage to find an answer on my own. How can I unset variable? E.g. php has unset($var) function.
Thank you in advance for your help ;) | 0 | [
2,
184,
20,
45,
367,
3554,
7612,
19,
272,
5910,
13,
9,
2328,
60,
800,
3726,
3726,
32,
22,
18,
510,
5066,
47,
31,
223,
22,
38,
4705,
20,
477,
40,
1623,
27,
51,
258,
9,
184,
92,
31,
367,
3554,
7612,
60,
13,
62,
9,
263,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
local rails on Mac OSX loses connection to mysql
===
On occasion, my local rails app losses it's connection to mysql. I get a some error that the connection failed, but if I just refresh the page, it works fine. This has never happpened in my STAGE or PROD environments (I deploy to Ubuntu), so it has not been that big if a deal.
Does this happen to anybody else? Is there something I can do to fix it? Is it mysql or ruby? | 0 | [
2,
375,
2240,
18,
27,
1572,
13,
759,
396,
14745,
2760,
20,
51,
18,
22402,
800,
3726,
3726,
27,
5434,
15,
51,
375,
2240,
18,
4865,
5382,
32,
22,
18,
2760,
20,
51,
18,
22402,
9,
31,
164,
21,
109,
7019,
30,
14,
2760,
1702,
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... |
Best way to seach a sql server table
===
What would you recommend to search a sql server table (varchar(max) column) for a term?
Let's say, like in ebay, if you search for "wii brand new", you get results like "Brand New Nintendo Wii Fit Game + Balance Board Bundle", "Wii Fit (Wii) BRAND NEW WII FIT GAME + BALANCE BOARD".
I think it basically searchs every word and returns the ones that contains all the words, what would you recommend? | 0 | [
2,
246,
161,
20,
598,
673,
21,
4444,
255,
8128,
859,
800,
3726,
3726,
98,
83,
42,
12360,
20,
2122,
21,
4444,
255,
8128,
859,
13,
5,
3311,
5433,
5,
8304,
6,
4698,
6,
26,
21,
981,
60,
408,
22,
18,
395,
15,
101,
19,
13,
62,
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... |
Design question: How can I do RPC and access remote data transparently?
===
I want to do this (no particular language):
print(foo.objects.bookdb.books[12].title);
or this:
book = foo.objects.bookdb.book.new();
book.title = 'RPC for Dummies';
book.save();
Where foo actually is a service connected to my program via some IPC, and to access its methods and objects, some layer actually sends and receives messages over the network.
I am pretty sure there are a couple of frameworks for each language that support this type of operation. What I'm unsure about is the general approach, for example, would all the available services, methods, objects have to be known in advance, or could I have it so that I can just go code foo.whatever.gimme() and get an exception automatically if there's no service foo or it's not providing whatever?
In other words, how can I have OOP that maps transparently over process boundaries?
Not that this is a design question and I'm still working at a pretty high level of the overall architecture. So I'm pretty agnostic yet about which language this is going to be in. C#, Java and Python are all likely to get used, though. | 0 | [
2,
704,
1301,
45,
184,
92,
31,
107,
761,
5779,
17,
1381,
5388,
1054,
14862,
102,
60,
800,
3726,
3726,
31,
259,
20,
107,
48,
13,
5,
251,
1498,
816,
6,
45,
4793,
5,
4120,
111,
9,
23793,
18,
9,
5199,
9007,
9,
13828,
2558,
918,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Kohana PHP, ORM and MySQL BLOBs
===
I'm trying to create and retrieve a BLOB in a MySQL table via Kohana's ORM library.
The code looks something like:
$attachment = new Attachment_Model();
$attachment->name = $info['FileName'];
$attachment->size = strlen($info['Data']);
$attachment->data = $info['Data'];
$attachment->mime_type = $info['content-type'];
$attachment->save();
I've verified that the data is OK at this point by outputting it to a file. However, when I retrieve the data it comes out corrupted. I've managed to narrow this down a bit more - I've used the MySQL query tool to extract the data as held in the database and I can verify that the data in the database is corrupt, so the problem must be on the INSERT.
Also, the files inputted aren't always corrupt - smaller files (such as images) tend to be OK.
Anyone have any ideas? | 0 | [
2,
1584,
7285,
13,
26120,
15,
54,
79,
17,
51,
18,
22402,
334,
10904,
18,
800,
3726,
3726,
31,
22,
79,
749,
20,
1600,
17,
11917,
21,
334,
10904,
19,
21,
51,
18,
22402,
859,
1197,
1584,
7285,
22,
18,
54,
79,
1248,
9,
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... |
Getting DNS servers on Windows
===
I'm using the DnsQueryConfig Win32 function to get the DNS servers used by Windows. This works fine for IPv4 addresses, but what if the DNS servers have IPv6 addresses?
| 0 | [
2,
1017,
13,
43,
2172,
17595,
27,
1936,
800,
3726,
3726,
31,
22,
79,
568,
14,
13,
43,
2172,
8190,
93,
14093,
2816,
628,
3125,
1990,
20,
164,
14,
13,
43,
2172,
17595,
147,
34,
1936,
9,
48,
693,
1123,
26,
31,
10166,
300,
12636,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Flash Organisation Chart
===
I've been searching for a library that can render organisation charts in either flash and/or javascript(preferably jQuery). I know of several javascript and/or flash chart libraries but none of them seem to be able to render an organisation chart such as this: [http://www.fsai.ie/images/org_chart.gif][1]
[1]: http://www.fsai.ie/images/org_chart.gif | 0 | [
2,
4433,
4080,
1795,
800,
3726,
3726,
31,
22,
195,
74,
5792,
26,
21,
1248,
30,
92,
16535,
4080,
5158,
19,
694,
4433,
17,
118,
248,
8247,
8741,
5,
3515,
2407,
4801,
487,
8190,
93,
6,
9,
31,
143,
16,
238,
8247,
8741,
17,
118,
24... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to Integrate PHPList with the Existing Site
===
The existing site has it own "users" table in a database. I'm wondering how to integrate PHPList with the existing site so that a user can check the newsletter during registration.
Any help is greatly appreciated. | 0 | [
2,
184,
20,
18399,
13,
26120,
5739,
29,
14,
3149,
689,
800,
3726,
3726,
14,
3149,
689,
63,
32,
258,
13,
7,
16704,
18,
7,
859,
19,
21,
6018,
9,
31,
22,
79,
5712,
184,
20,
18399,
13,
26120,
5739,
29,
14,
3149,
689,
86,
30,
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,
0,
0... |
ASP.NET Forms Authentication With Only UserName
===
I have a bit of a hybrid situation on my hands. I'm writing an intranet asp.net web app. I don't want to use full blown Windows Authentication, because I don't have proper groups set up in Active Directory to be able to authenticate users simply based on what group they are in. Up until now, I had created a membership database, and was manually authenticating users based on their NT Login. The app is getting more complex, and I'm looking at using the Membership and Roles providers to authenticate users. Here's my issue: I want to be able to authenticate users just based on their NT, but I don't want to use Windows Authentication. I want to write my own provider to plug into the membership and roles providers, and use Forms authentication, but make it transparent. Based on a Users table, I want to be able to authenticate the user or redirect them based on their NT alone. Is this possible, or am I stuck writing my own small framework to accomplish this? I would like to take advantage of the provider framework if at all possible. | 0 | [
2,
28,
306,
9,
2328,
1997,
27963,
29,
104,
4155,
7259,
800,
3726,
3726,
31,
57,
21,
1142,
16,
21,
6957,
1858,
27,
51,
473,
9,
31,
22,
79,
1174,
40,
14369,
2328,
28,
306,
9,
2328,
2741,
4865,
9,
31,
221,
22,
38,
259,
20,
275,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Select products where the category belongs to any category in the hierarchy
===
I have a products table that contains a FK for a category, the Categories table is created in a way that each category can have a prent category, example:
Computers
Processors
Intel
Pentium
Core 2 Duo
AMD
Athlon
I need to make a select query that if the selected category is Processors, it will return products that is in Intel, Pentium, Core 2 Duo, Amd, etc...
I thought about creating some sort of "cache" that will store all the categories in the hierarchy for every category in the db and include the "IN" in the where clause. Is this the best solution? | 0 | [
2,
5407,
1985,
113,
14,
3230,
7034,
20,
186,
3230,
19,
14,
14417,
800,
3726,
3726,
31,
57,
21,
1985,
859,
30,
1588,
21,
15795,
26,
21,
3230,
15,
14,
6422,
859,
25,
679,
19,
21,
161,
30,
206,
3230,
92,
57,
21,
782,
2877,
3230,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
VS Setup Project: Uninstall other component on install
===
I am Creating a Visual Studio Setup project. I want to un-install another component from the system on the install of my component. And the another component is installed from my own setup created using Visual Studio.
Currently when I am doing calling the un-insatll of the other component from the install action of the component. But this is giving error code: 1618 (another msi already running).
Could anyone suggest me alternative way to solve this problem? | 0 | [
2,
4611,
18161,
669,
45,
367,
108,
21300,
89,
5912,
27,
16146,
800,
3726,
3726,
31,
589,
2936,
21,
3458,
1120,
18161,
669,
9,
31,
259,
20,
367,
8,
108,
21300,
226,
5912,
37,
14,
329,
27,
14,
16146,
16,
51,
5912,
9,
17,
14,
226... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Library of (Difficult) SQL scripts
===
Does anyone know here I can find a library of common but difficult (out of the ordinary) SQL script examples. I am talking about those examples you cannot find in the documentation but do need very often to accomplish tasks such as finding duplicates etc.
It would be a big time saver to have something like that handy. | 4 | [
2,
1248,
16,
13,
5,
43,
6021,
49,
21142,
6,
4444,
255,
17505,
800,
3726,
3726,
630,
1276,
143,
235,
31,
92,
477,
21,
1248,
16,
757,
47,
1956,
13,
5,
1320,
16,
14,
6104,
6,
4444,
255,
3884,
3770,
9,
31,
589,
1582,
88,
273,
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... |
Parameterized test case classes in JUnit 3.x
===
I have a JUnit 3.x TestCase which I would like to be able to parameterize. I'd like to parametrize the entire `TestCase` (including the fixture). However, the `TestSuite.addTestSuite()` method does not allow be to pass a `TestCase` object, just a class:
TestSuite suite = new TestSuite("suite");
suite.addTestSuite(MyTestCase.class);
I would like to be able to pass a parameter (a string) to the MyTestCase instance which is created when the test runs. As it is now, I have to have a separate class for each parameter value.
I tried passing it an anynomous subclass:
MyTestCase testCase = new MyTestCase() {
String getOption() {
return "some value";
}
}
suite.addTestSuite(testCase.getClass());
However, this fails with the assertion:
... MyTestSuite$1 has no public constructor TestCase(String name) or TestCase()`
Any ideas? Am I attacking the problem the wrong way? | 0 | [
2,
18906,
1333,
1289,
610,
2684,
19,
7446,
242,
203,
9,
396,
800,
3726,
3726,
31,
57,
21,
7446,
242,
203,
9,
396,
1289,
10325,
56,
31,
83,
101,
20,
44,
777,
20,
18906,
2952,
9,
31,
22,
43,
101,
20,
2258,
5909,
139,
2952,
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... |
Visual c++ "for each" portability
===
I only just recently discovered that Visual C++ 2008 (and perhaps earlier versions as well?) supports `for each` syntax on stl lists et al to facilitate iteration.
For example:
list<Object> myList;
for each (Object o in myList)
{
o.foo();
}
I was very happy to discover it, but I'm concerned about portability for the dreaded day when someone decides I need to be able to compile my code in say, gcc or some other compiler. Is this syntax widely supported and can I use it without worrying about portability issues? | 0 | [
2,
3458,
272,
20512,
13,
7,
1106,
206,
7,
1295,
4091,
800,
3726,
3726,
31,
104,
114,
1989,
1848,
30,
3458,
272,
20512,
570,
13,
5,
290,
1774,
1201,
3281,
28,
134,
60,
6,
6747,
13,
1,
1106,
206,
1,
22649,
27,
354,
255,
7227,
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... |
How do you store all the things which you've learnt and information you want to keep?
===
Granted knowledge is best retained when put into practice, but as programmers I'm sure there's just too much information. Besides annotating your books, what other methods do you use for your own personal knowledge-base so you can have an easily accessible reference?
Do you create your own wiki or use software like [wikidpad](http://groups.google.com/group/wikidpad/web/home), or save them as plain text, bookmarks, pdf, web pages etc..? Or do just treat google/SO as your giant knowledge-base and search only when required?
You may find this similar
[http://stackoverflow.com/questions/10961/have-you-used-a-wiki-in-your-project-or-group](http://stackoverflow.com/questions/10961/have-you-used-a-wiki-in-your-project-or-group), and of course this question can easily relate to non programmers as well. | 0 | [
2,
184,
107,
42,
1718,
65,
14,
564,
56,
42,
22,
195,
2484,
38,
17,
676,
42,
259,
20,
643,
60,
800,
3726,
3726,
2743,
1918,
25,
246,
4956,
76,
442,
77,
1345,
15,
47,
28,
17968,
18,
31,
22,
79,
562,
80,
22,
18,
114,
266,
212... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I create a symlink in Windows Vista?
===
I am looking to create symlinks (soft links) from Java on a Windows Vista/ 2008 machine. I'm happy with the idea that I need to call out to the JNI to do this. I am after help on the actual C code though. What is the appropriate system call to create the link? Pointers to some good documentation on this subject would be very much appreciated. | 0 | [
2,
184,
107,
31,
1600,
21,
13,
7261,
6258,
19,
1936,
13520,
60,
800,
3726,
3726,
31,
589,
699,
20,
1600,
13,
7261,
6258,
18,
13,
5,
12980,
6271,
6,
37,
8247,
27,
21,
1936,
13520,
118,
570,
1940,
9,
31,
22,
79,
1700,
29,
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... |
Optimizing single-row queries from large tables in MySQL
===
I am dealing with MySQL tables that are essentially results of raytracing simulations on a simulated office room with a single venetian blind. I usually need to retrieve the simulation's result for a unique combination of time and blind's settings. So I end up doing a lot of
SELECT result FROM results WHERE timestamp='2005-05-05 12:30:25' \
AND opening=40 AND slatangle=60
This looks suspiciously optimizable, since this query should never ever return more than one row. Does it make sense to define an index on the three columns that uniquely identify each row? Or are there other techniques I can use? | 0 | [
2,
19259,
3335,
345,
8,
5417,
9386,
2829,
37,
370,
7484,
19,
51,
18,
22402,
800,
3726,
3726,
31,
589,
5746,
29,
51,
18,
22402,
7484,
30,
50,
7398,
1736,
16,
2375,
1939,
6302,
10926,
18,
27,
21,
26557,
488,
337,
29,
21,
345,
1587... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Locating bundles by identifier
===
I want to create a bundle from an arbitrary bundle identifier
e.g. `com.apple.iokit.IOStorageFamily`
It's not an unreasonable thing to do as bundle IDs are supposed
to be unique, however the obvious code does not work:
NSString* bID = @"com.apple.iokit.IOStorageFamily";
NSBundle* bundle = [NSBundle bundleWithIdentifier:bID];
This code only works for bundles you've already loaded
(hello, chicken and egg problem), and in fact, you have
to know a little more than you'd like about the the identifier
before you can do anything. For the above style of ID
I grep out the final component and tranform it into
`/System/Library/Extensions/IOStorageFamily.kext`
which I then load by path.
Is this the state of the art or is there a more general way?
| 0 | [
2,
27917,
10194,
18,
34,
25570,
800,
3726,
3726,
31,
259,
20,
1600,
21,
10194,
37,
40,
17237,
10194,
25570,
13,
62,
9,
263,
9,
13,
1,
960,
9,
24212,
9,
1963,
13703,
9,
7760,
2153,
1303,
13819,
1,
32,
22,
18,
52,
40,
28454,
584... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Docstrings for data?
===
Is there a way to describe the module's data (in a similar way that a docstring describes a module or a funcion)? | 0 | [
2,
9765,
11130,
18,
26,
1054,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
4996,
14,
12613,
22,
18,
1054,
13,
5,
108,
21,
835,
161,
30,
21,
9765,
11130,
4359,
21,
12613,
54,
21,
2414,
10934,
6,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Generate User Specific 1 Time Coupon Code
===
So I need to generate a code that can be tied to a specific user/prospect with a dollar amount built into it. It needs to be reversible so that client application can confirm the validity of the code and apply the discount a manager intends.
I'd like to make the code as short as possible but it needs to be well obfuscated so that the salesmen cannot start messing with it on their own.
I can come up with something myself bouncing numbers around, dividing by pi and converting to hex and whatnot but I'd be really interested in ideas or best practices from the community.
I'm doing this in C# but I expect that methods from any language can be translated. | 0 | [
2,
7920,
4155,
1903,
137,
85,
7336,
218,
1797,
800,
3726,
3726,
86,
31,
376,
20,
7920,
21,
1797,
30,
92,
44,
3802,
20,
21,
1903,
4155,
118,
2740,
7350,
29,
21,
9311,
2006,
392,
77,
32,
9,
32,
2274,
20,
44,
3867,
445,
3426,
86,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
defining a calculated member in MDX - filtering a measure's value
===
I need to define a calculated member in MDX (this is SAS OLAP, but I'd appreciate answers from people who work with different OLAP implementations anyway).
The new measure's value should be calculated from an existing measure by applying an additional filter condition. I suppose it will be clearer with an example:
* Existing measure: "Total traffic"
* Existing dimension: "Direction" ("In" or "Out")
* I need to create a calculated member "Incoming traffic", which equals "Total traffic" with an additional filter (Direction = "In")
The problem is that I don't know MDX and I'm on a very tight schedule (so sorry for a newbie question). The best I could come up with is:
([Measures].[Total traffic], [Direction].[(All)].[In])
Which almost works, except for cells with specific direction:
<table>
<tr><td> </td>
<td colspan="2"><b>Total traffic </td>
<td colspan="2"><b>Incoming traffic</b></td>
</tr>
<tr>
<td><b>Direction <br/>Year</b></td>
<td><b>In</b></td>
<td><b>Out</b></td>
<td><b>In</b></td><td><b>Out</b></td>
</tr>
<tr><td>2008</td>
<td>400</td>
<td>200</td>
<td>400</td>
<td><font color="red">400</font></td>
</tr>
</table>
.
So it looks like the "intrinsic" filter on Direction is overridden with my own filter). I need an intersection of the "intrinsic" filter and my own. My gut feeling was that it has to do with Intersecting `[Direction].[(All)].[In]` with the intrinsic coords of the cell being evaluated, but it's hard to know what I need without first reading up on the subject :)
| 0 | [
2,
14684,
21,
10785,
322,
19,
8138,
396,
13,
8,
25272,
21,
4058,
22,
18,
1923,
800,
3726,
3726,
31,
376,
20,
9267,
21,
10785,
322,
19,
8138,
396,
13,
5,
1565,
25,
9233,
13,
2268,
306,
15,
47,
31,
22,
43,
8831,
6709,
37,
148,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Enterprise Library Database Trace Listener?
===
I'm using EntLib v4 for Logging and currently I'm saving the events to the default text file listener.
I would like to use MS SQL database as my event sink and I saw that the database listener is already provided, but I don't know how to create logging database and stored procedures?
After googling around I saw that in v3 the database creation scripts were shipped with the EntLib, but I can't find them in v4.
Thanks... | 0 | [
2,
6002,
1248,
6018,
5565,
21772,
60,
800,
3726,
3726,
31,
22,
79,
568,
13,
2291,
8326,
566,
300,
26,
13,
13919,
17,
871,
31,
22,
79,
7599,
14,
963,
20,
14,
12838,
1854,
3893,
21772,
9,
31,
83,
101,
20,
275,
4235,
4444,
255,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Handle errors with ErrorController rather than a direct view.
===
I'm trying to get my head around the Error Handling in MVC.
What I'm looking for is a centralized way to catch errors, log them, if possible resolve them, if nessecary take other actions and finally show the correct view to the user.
I think I can use the [HandleError] filter for this, but I don't see any way to route it to a Controller/Action. The only option I see is pointing it directly to a view. | 0 | [
2,
3053,
11908,
29,
7019,
12898,
1252,
864,
119,
21,
1744,
1418,
9,
800,
3726,
3726,
31,
22,
79,
749,
20,
164,
51,
157,
140,
14,
7019,
7988,
19,
307,
8990,
9,
98,
31,
22,
79,
699,
26,
25,
21,
25176,
161,
20,
2949,
11908,
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... |
When should I call Naming.unbind()
===
I have some code which I am making available via RMI.
If my program terminates abnormally, I won't have called Naming.unbind(), and a reference to the object will presumably be hanging around in the RMI registry, and subsequent calls to Naming.bind() with the same name will fail.
How do I make sure that rogue references are cleared up?
| 0 | [
2,
76,
378,
31,
645,
10929,
9,
1020,
4772,
43,
5,
6,
800,
3726,
3726,
31,
57,
109,
1797,
56,
31,
589,
544,
904,
1197,
761,
1435,
9,
100,
51,
625,
17952,
18,
17804,
102,
15,
31,
230,
22,
38,
57,
227,
10929,
9,
1020,
4772,
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... |
Building libcurl with SSL support on Windows
===
I'm using libcurl in a Win32 application.
I have the curllib.vcproj project added to my solution and set my other projects to depend on it.
How do I build it with SSL support enabled?
| 0 | [
2,
353,
13,
8326,
4734,
255,
29,
13,
18,
18,
255,
555,
27,
1936,
800,
3726,
3726,
31,
22,
79,
568,
13,
8326,
4734,
255,
19,
21,
628,
3125,
3010,
9,
31,
57,
14,
14320,
8326,
9,
8990,
2740,
728,
669,
905,
20,
51,
4295,
17,
309... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to find all dependecies of a .NET project?
===
Basically, what I need is something like [Dependecy Walker][1], but it should work with .NET applications. Is there anywhere such tool?
[1]: http://www.dependencywalker.com/ | 0 | [
2,
184,
20,
477,
65,
12547,
62,
10807,
16,
21,
13,
9,
2328,
669,
60,
800,
3726,
3726,
11374,
15,
98,
31,
376,
25,
301,
101,
636,
19038,
62,
2731,
3764,
500,
2558,
165,
500,
15,
47,
32,
378,
170,
29,
13,
9,
2328,
3767,
9,
25,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why are Wemf and Google Analytics telling me so different things?
===
The website works with Wemf and Google Analytics, but they are giving me very different results; WEMF counts 10 - 30 % more page views than Google Analytics... Why can this be?
Google Analytics works only with JavaScript enabled, yes - but I don't think that's the reason for this difference. The site which should be counted is a famous newspaper in Switzerland.
Any suggestions? | 0 | [
2,
483,
50,
95,
13235,
17,
8144,
26320,
2497,
55,
86,
421,
564,
60,
800,
3726,
3726,
14,
2271,
693,
29,
95,
13235,
17,
8144,
26320,
15,
47,
59,
50,
1438,
55,
253,
421,
1736,
73,
95,
13235,
9927,
332,
13,
8,
712,
13,
11881,
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... |
What navigation control would you choose to use in your application ?
===
ToolStrip with MenuStrip or RibbonBar? | 0 | [
2,
98,
8368,
569,
83,
42,
3538,
20,
275,
19,
154,
3010,
13,
60,
800,
3726,
3726,
4672,
17851,
29,
11379,
19992,
54,
9162,
1850,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 difference between "VC++" and "C++" ?
===
Someone asked me how familiar I am with VC++ and how familiar I am with C++. What is the difference? | 0 | [
2,
98,
25,
14,
2841,
128,
13,
7,
8990,
20512,
7,
17,
13,
7,
150,
20512,
7,
13,
60,
800,
3726,
3726,
737,
411,
55,
184,
3694,
31,
589,
29,
13,
8990,
20512,
17,
184,
3694,
31,
589,
29,
272,
20512,
9,
98,
25,
14,
2841,
60,
3,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What's a good tempating system for PHP?
===
What's the best/easiest to integrate templating system for PHP, and what are the benefits of using one?
I currently don't use one at all, and am thinking that it might help to seperate content from presentation a little more. | 0 | [
2,
98,
22,
18,
21,
254,
13,
9577,
1880,
329,
26,
13,
26120,
60,
800,
3726,
3726,
98,
22,
18,
14,
246,
118,
3537,
18,
10727,
20,
18399,
13,
9577,
255,
1880,
329,
26,
13,
26120,
15,
17,
98,
50,
14,
5800,
16,
568,
53,
60,
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... |
Does ATL/WTL still require the use of a global _Module variable?
===
I'm just starting up a new ATL/WTL project and I was wondering if the global _Module variable is still required?
Back a few years when I started working with WTL it was required (at least for ATL 3.0) that you define a global variable such as:
CAppModule _Module;
To get ATL to work correctly. But recently I've read somewhere that this may not be required anymore (yet the wizard generated code still uses it). Also I did a search through the Visual C++ include directories and it only picked up _Module in a few places - most notably the ATL COM registry stuff.
So do I still need to define a global variable to use ATL these days? | 0 | [
2,
630,
35,
255,
118,
499,
7786,
174,
4077,
14,
275,
16,
21,
2062,
13,
1,
19673,
62,
7612,
60,
800,
3726,
3726,
31,
22,
79,
114,
1422,
71,
21,
78,
35,
255,
118,
499,
7786,
669,
17,
31,
23,
5712,
100,
14,
2062,
13,
1,
19673,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Hibernate: Criteria vs. HQL
===
What are the pros and cons of using Criteria or HQL? The Criteria API is a nice object-oriented way to express queries in Hibernate, but sometimes Criteria Queries are more difficult to understand/build than HQL.
When do you use Criteria and when HQL? What do you prefer in which use cases? Or is it just a matter of taste? | 0 | [
2,
4148,
2102,
8820,
45,
9157,
4611,
9,
746,
22402,
800,
3726,
3726,
98,
50,
14,
895,
18,
17,
11608,
16,
568,
9157,
54,
746,
22402,
60,
14,
9157,
21,
2159,
25,
21,
2210,
3095,
8,
6800,
161,
20,
2999,
9386,
2829,
19,
4148,
2102,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 teach several languages/paradigms at once?
===
If you had the opportunity to teach new students how to program for a year, what would you teach? I've always found that a multi-paradigm approach to teaching programming works best, but is it too much for first-year students? Is it better for a student to be great at one or good at 3-5?
At the moment I am looking to help tutor students on the following:
- x86 Assembly Language
- C
- Haskell
- Java
- Perl
- C++
- Prolog
At the moment these students are only exposed to some very basic Java, so my theory is that these students would be able to expand further from here far better than they would with a basic understanding of just one language.
Please note that the question is not whether students can handle it, because a simple look at the programmes at the top universities show that *they* can, but whether it is advisable to those not at the top universities to focus on knowing as much as possible. | 0 | [
2,
25,
32,
938,
20,
5348,
238,
2556,
118,
6351,
12158,
79,
18,
35,
382,
60,
800,
3726,
3726,
100,
42,
41,
14,
2893,
20,
5348,
78,
573,
184,
20,
625,
26,
21,
159,
15,
98,
83,
42,
5348,
60,
31,
22,
195,
550,
216,
30,
21,
188... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a new exception type
===
What are the guidelines for when to create a new exception type instead of using one of the built-in exceptions in .Net?
The problem that got me thinking is this. I have a WCF service, which is a basic input-output service. If the service is unable to create an output, because the input is invalid, I want to throw an exception, but which one?
Right now I'm just throwing system.Exception, but this doesn't feel right to me, I don't know why, it just feels wrong.
One thing that bugs me, if I test it with a unit test and I expect the system.Exception to be thrown. The exception could as well be thrown by the framework or other code and not by the code I excepted to throw. The test would then pass, as I get the expected exception, but it should have failed.
What do you recommend? | 0 | [
2,
76,
20,
275,
21,
78,
5391,
1001,
800,
3726,
3726,
98,
50,
14,
12629,
26,
76,
20,
1600,
21,
78,
5391,
1001,
700,
16,
568,
53,
16,
14,
392,
8,
108,
13392,
19,
13,
9,
2328,
60,
14,
1448,
30,
330,
55,
1440,
25,
48,
9,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JQuery drag and drop - how to get at element being dragged
===
I am using the JQuery libs to implement drag and drop.
How do I get at the element that is being dragged when it is dropped?
I want to get the id of the image inside the div. The following element is dragged:
<div class="block"><asp:Image ID="Image9" AlternateText="10/12/2008 - Retina" Width=81 Height=84 ImageUrl="~/uploads/ImageModifier/retina.jpg" runat=server /></div>
I have the standard dropped function from their example
$(".drop").droppable({
accept: ".block",
activeClass: 'droppable-active',
hoverClass: 'droppable-hover',
drop: function(ev, ui) {
}
I have tried various ui.id etc which doesnt seem to work.
Thanks,
| 0 | [
2,
487,
8190,
93,
5501,
17,
2804,
13,
8,
184,
20,
164,
35,
4520,
142,
7465,
800,
3726,
3726,
31,
589,
568,
14,
487,
8190,
93,
13,
8326,
18,
20,
8713,
5501,
17,
2804,
9,
184,
107,
31,
164,
35,
14,
4520,
30,
25,
142,
7465,
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... |
How do I determine number of window handles an application is using?
===
What is the best way to determine how many window handles an application is using? Is there a tool or a WMI performance counter that I could use? | 0 | [
2,
184,
107,
31,
3746,
234,
16,
1463,
3053,
18,
40,
3010,
25,
568,
60,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
3746,
184,
151,
1463,
3053,
18,
40,
3010,
25,
568,
60,
25,
80,
21,
5607,
54,
21,
619,
1435,
956,
2105,
30,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
PHPs mime_content_type() fail on windows.
===
I know mime\_content\_type() is deprecated, but it seemed to me the alternative is worse at the moment. <code>Finfo</code> seems to require adding files and changing ini directions on windows; I don't want to require this for the script I am making.
I need to find the mimetype of files, but when calling <code>mime\_content\_type($filename)</code> on windows it fails. mime_magic.magicfile points to the correct file, but when enabling mime\_magic.debug in the ini file, I get this error message:
<code><b>Warning:</b> mime\_content\_type()[http://www.php.net/mime\_magic]: mime\_magic not initialized in <b>C:\xampp\htdocs\test.php</b> on line <b>2</b></code>
I checked, and <code>extension=php\_mime\_magic.dll</code> is enabled in the ini file. | 0 | [
2,
13,
26120,
18,
26193,
1,
25424,
1,
4474,
5,
6,
7476,
27,
1936,
9,
800,
3726,
3726,
31,
143,
26193,
1,
25424,
1,
4474,
5,
6,
25,
121,
3515,
150,
1669,
15,
47,
32,
890,
20,
55,
14,
2676,
25,
3105,
35,
14,
688,
9,
13,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to use Data Access Objects for serialized & relational database data access
===
I am developing a C++ domain model class library which should provide some facilities or a framework (i.e. interface classes etc) for writing/reading class instance data to/from both a binary file and a RDBMS. The basis for this library is an application that uses a RDBMS, and there are several methods which instantiate a class by performing a sequence of database retrieve and update calls to fetch collections of member data. The serialized data access has a different way of organizing its data, so I want the domain model to be completely ignorant of primary/foreign keys, IDs etc.
To solve this problem, I consider using the [Data Access Object][1] (DAO) pattern, and would like to have some advice on the 'granularity', lifetime and use of DAO objects (in your replies, please note that I'll be using C++, not Java, and that the domain class cannot hold any ID/key info from the RDBMS or binary file store):
1. Does each Foo instance of a domain object have its own FooDAO instance, or is there a single FooDAO instance for all instances of class Foo?
2. Is the FooDAO created once for each Foo instance, or would the FooDAO instance be created only when access to data is needed, and destroyed immediately afterwards?
3. The [J2EE][2] page on DAO introduces a DTO in addition to the DAO. Why can't the DAO transfer the data?
4. For a complex domain class Foo that has instances of other domain classes Bar, it seems inevitable that the FooDAO class uses the BarDAO class to retrieve data. This would lead to parallel hierarchies/dependencies in the domain class structure and the DAO class structure. How can this be managed best?
Thanks for your help!
[1]: http://en.wikipedia.org/wiki/Data_Access_Object
[2]: http://java.sun.com/blueprints/corej2eepatterns/Patterns/DataAccessObject.html | 0 | [
2,
184,
20,
275,
1054,
1381,
3916,
26,
27877,
279,
5827,
192,
6018,
1054,
1381,
800,
3726,
3726,
31,
589,
3561,
21,
272,
20512,
4603,
1061,
718,
1248,
56,
378,
1181,
109,
2450,
54,
21,
6596,
13,
5,
49,
9,
62,
9,
6573,
2684,
2722... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I create a single VB6 OCX with multiple controls?
===
I have inherited a load of VB6 code which has tons of individual OCX files, each of which contain a single control. Is it possible to refactor them so that I can have a single OCX file with all the OCX's in it?
If so how?
TIA | 0 | [
2,
92,
31,
1600,
21,
345,
13,
20468,
379,
13,
2499,
396,
29,
1886,
8671,
60,
800,
3726,
3726,
31,
57,
7179,
21,
6305,
16,
13,
20468,
379,
1797,
56,
63,
5278,
16,
1359,
13,
2499,
396,
6488,
15,
206,
16,
56,
3717,
21,
345,
569,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way of using List<T> and exposing Collection<T>
===
I must implement a web service which expose a list of values (integers, custom classes etc).
My working solution returns a `List<T>`, and according to FxCop it is better to return a `Collection<T>` or `ReadOnlyCollection<T>`.
If I choose to return a `ReadOnlyCollection<T>`, the web service shows an error like:
> To be XML serializable, types which inherit from `ICollection` must have an implementation of `Add(System.Int32)` at all levels of their inheritance hierarchy.
`System.Collections.ObjectModel.ReadOnlyCollection` `1` `[[System.Int32, mscorlib, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089]]` does not implement `Add(System.Int32)`.
What is your favorite way to use internally a `List<T>` and expose a `Collection<T>` ? (using C#, and preferably framework 2.0 only)
| 0 | [
2,
246,
161,
16,
568,
968,
1,
38,
1,
17,
17302,
1206,
1,
38,
1,
800,
3726,
3726,
31,
491,
8713,
21,
2741,
365,
56,
13833,
21,
968,
16,
4070,
13,
5,
6391,
13699,
18,
15,
5816,
2684,
2722,
6,
9,
51,
638,
4295,
4815,
21,
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... |
What is the simplest way to charge money over the Internet?
===
I have a .Net 2.0/3.5 WebApplication.
I want to be able to take money over the internet for my service.
Each of my customers will have an AccountNo.
I wish to offer several products each of which will have fixed price.
I need for my customer to login to my system and elect to pay me money for a product of their choice and for my app to become aware when this is complete so that I may adjust their account to reflect this.
What is the simplest (least complicated coding) way to take their money?
Paypal, NoChex, Google checkout, Something else ? | 4 | [
2,
98,
25,
14,
24384,
161,
20,
1906,
875,
84,
14,
2620,
60,
800,
3726,
3726,
31,
57,
21,
13,
9,
2328,
172,
9,
15928,
240,
9,
264,
2741,
2552,
20669,
9,
31,
259,
20,
44,
777,
20,
247,
875,
84,
14,
2620,
26,
51,
365,
9,
206,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there something like the Google Safe Browsing API that is more stable?
===
The [Google Safe Browsing API][1] allows for URLs to be checked against Google's database of malware and phishing domains. However, on the [Developer's Guide page][2], it says that the API is experimental and the data format is likely to change.
Although I have had good experiences with a number of Google's APIs in the past, they have all been fairly stable. I don't think I'm willing to use an experimental API in my project, so I'm looking for an alternative.
[1]: http://code.google.com/apis/safebrowsing/
[2]: http://code.google.com/apis/safebrowsing/developers_guide.html | 0 | [
2,
25,
80,
301,
101,
14,
8144,
1834,
10175,
68,
21,
2159,
30,
25,
91,
4521,
60,
800,
3726,
3726,
14,
636,
16111,
4875,
1834,
10175,
68,
21,
2159,
500,
2558,
165,
500,
2965,
26,
13,
911,
7532,
20,
44,
6505,
149,
8144,
22,
18,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In what ways do you determine product price when you are about to launch your new product?
===
In what ways do you determine product price when you are about to launch your new product?
Examples:
- Matching competition?
- Less than competition?
- More than competition?
- Making a price based on calculating a plan to recover your own costs?
- ...
| 0 | [
2,
19,
98,
2847,
107,
42,
3746,
2374,
2162,
76,
42,
50,
88,
20,
3394,
154,
78,
2374,
60,
800,
3726,
3726,
19,
98,
2847,
107,
42,
3746,
2374,
2162,
76,
42,
50,
88,
20,
3394,
154,
78,
2374,
60,
3770,
45,
13,
8,
10120,
1076,
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... |
What real-world projects would you suggest as code examples to study?
===
What real-world projects would you suggest looking through the sources?
As I'm learning Java Swing, [mucommander][1] seems to be a decent example. The code is excessively commented though.
EDIT: No shameless plugs plz :).
[1]: http://mucommander.com | 0 | [
2,
98,
683,
8,
4423,
2314,
83,
42,
5601,
28,
1797,
3770,
20,
949,
60,
800,
3726,
3726,
98,
683,
8,
4423,
2314,
83,
42,
5601,
699,
120,
14,
2662,
60,
28,
31,
22,
79,
2477,
8247,
5587,
15,
636,
3677,
16239,
106,
500,
2558,
165,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are best fit patterns to use when developing VSX Package or Isolated Shell Package?
===
When I am developing a bunch of designers/tools, what are some of the best fit patterns that go with a VSX Package and/or VSX Isolated Shell Package?
Any samples, links would be great. | 0 | [
2,
98,
50,
246,
2742,
6282,
20,
275,
76,
3561,
4611,
396,
6030,
54,
6331,
3593,
6030,
60,
800,
3726,
3726,
76,
31,
589,
3561,
21,
7653,
16,
12760,
118,
20799,
18,
15,
98,
50,
109,
16,
14,
246,
2742,
6282,
30,
162,
29,
21,
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... |
First Google Search Result (SEO?)
===
When a site gets into the first position of Google's organic search results, Google sometimes renders additional links for the sections of that website. For example, if you [search for jQuery][1], jQuery.com is the first search results. In addition to a link to jQuery.com, the jQuery Documentation, Tutorials, Plugins, Download, Works, Ui, About, and Donate page links are included too (all in the first listing.)
In contrast, the first result for a [Google search for Beer][2], returns a single link to the wikipedia.org entry for beer.
My QUESTION is what if anything do sites like jQuery do to get the "extended" Google search result listing?
[1]: http://www.google.com/search?hl=en&q=jquery
[2]: http://www.google.com/search?hl=en&q=beer | 2 | [
2,
64,
8144,
2122,
829,
13,
5,
18,
3894,
60,
6,
800,
3726,
3726,
76,
21,
689,
3049,
77,
14,
64,
649,
16,
8144,
22,
18,
6976,
2122,
1736,
15,
8144,
1030,
16535,
18,
1351,
6271,
26,
14,
4501,
16,
30,
2271,
9,
26,
823,
15,
100,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Uploading and Downlaoding Comparison using WebRequest & Sockets
===
Hiya I am working on a FTP Client, Can someone tell me the difference in speed and efficiency for using WebRequest and Sockets(Direct Network Streams) To download and upload files on the FTP Server. (Our files will be video streams).
I am using C#3.5. | 0 | [
2,
71,
16866,
17,
125,
531,
5648,
68,
6050,
568,
2741,
99,
10351,
279,
18482,
18,
800,
3726,
3726,
13,
25796,
31,
589,
638,
27,
21,
1187,
306,
6819,
15,
92,
737,
494,
55,
14,
2841,
19,
1362,
17,
7836,
26,
568,
2741,
99,
10351,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Turning C# methods into C++ methods
===
I'm exploring various options for mapping common C# code constructs to C++ CUDA code for running on a GPU. The structure of the system is as follows (arrows represent method calls):
C# program -> C# GPU lib -> C++ CUDA implementation lib
A method in the GPU library could look something like this:
public static void Map<T>(this ICollection<T> c, Func<T,T> f)
{
//Call 'f' on each element of 'c'
}
This is an extension method to ICollection<> types which runs a function on each element. However, what I would like it to do is to call the C++ library and make it run the methods on the GPU. This would require the function to be, somehow, translated into C++ code. Is this possible? | 0 | [
2,
2101,
272,
5910,
3195,
77,
272,
20512,
3195,
800,
3726,
3726,
31,
22,
79,
11748,
617,
6368,
26,
13305,
757,
272,
5910,
1797,
6960,
18,
20,
272,
20512,
272,
5729,
1797,
26,
946,
27,
21,
489,
4201,
9,
14,
1411,
16,
14,
329,
25,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
K & R Question: Need help understanding "getbits()" method in Chapter 2
===
As I've mentioned before, I'm going through K&R, and overall am doing all right with it. However, in chapter 2, the section on bitwise operators (section 2.9), I'm having trouble understanding how one of the sample methods works -- and as a result, I'm having trouble with the associated exercises.
(This isn't a dupe of my prior question on bit-shifting, btw. This is new-and-improved!)
So here's the method provided:
unsigned int getbits(unsigned int x, int p, int n) {
return (x >> (p + 1 - n)) & ~(~0 << n);
}
The idea is that, for the given number *x*, it will return the *n* bits starting at position *p*, counting from the right (with the farthest right bit being position 0). Given the following main() method:
int main(void) {
int x = 0xF994, p = 4, n = 3;
int z = getbits(x, p, n);
printf("getbits(%u (%x), %d, %d) = %u (%X)\n", x, x, p, n, z, z);
return 0;
}
The output is:
> getbits(63892 (f994), 4, 3) = 5 (5)
I get portions of this, but am having trouble with the "big picture," mostly because of the bits (no pun intended) that I don't understand.
(Note that I'm *not* looking for help with the associated exercises -- I think if I "got" this, I'd be able to get those.)
The part I'm specifically having issues with is the complements piece: `~(~0 << n)`. I think I get the first part, dealing with *x*; it's this part (and then the mask) that I'm struggling with -- and how it all comes together to actually retrieve those bits. (Which I've verified it is doing, both with code and checking my results using calc.exe -- thank God it has a binary view!)
Any help? | 0 | [
2,
680,
279,
761,
1301,
45,
376,
448,
3260,
13,
7,
3060,
3326,
18,
5,
6,
7,
2109,
19,
1260,
172,
800,
3726,
3726,
28,
31,
22,
195,
2211,
115,
15,
31,
22,
79,
228,
120,
680,
1569,
139,
15,
17,
1677,
589,
845,
65,
193,
29,
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... |
How to safely allow web-server to write to its own docroot?
===
As a follow up to [an earlier question][1] that attracted a whole zero answers, I'm wondering about the possibilities of allowing a web server (apache) to write to its own document root (Linux), in order to dynamically create meta-redirect files.
Of course, this sounds incredibly dangerous, and I'm wary of going the whole hog and granting the web-server user full write-access to its own docroot. Is there a more appropriate way of achieving this?
[1]: http://stackoverflow.com/questions/186900/tool-for-web-server-redirect-management | 0 | [
2,
184,
20,
9817,
1655,
2741,
8,
10321,
106,
20,
2757,
20,
82,
258,
9765,
14032,
60,
800,
3726,
3726,
28,
21,
1740,
71,
20,
636,
210,
1201,
1301,
500,
2558,
165,
500,
30,
5201,
21,
979,
4606,
6709,
15,
31,
22,
79,
5712,
88,
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... |
Commonclipse for Visual Studio?
===
Is there a Visual Studio plugin/tool/snippet for .NET that is similar to commonclipse for the java eclipse platform that automatically generates the ToString(), Equals(), GetHashCode() methods for you?
| 0 | [
2,
757,
150,
6013,
870,
26,
3458,
1120,
60,
800,
3726,
3726,
25,
80,
21,
3458,
1120,
10922,
108,
118,
20799,
118,
29061,
26,
13,
9,
2328,
30,
25,
835,
20,
757,
150,
6013,
870,
26,
14,
8247,
11652,
2452,
30,
7499,
7920,
18,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Framerate limit for wpf apps?
===
i wonder if there is a way to limit the wpf framerate within a process?
i.e. i do not want to limit a single animation's framerate, but the global
framerate for my whole application.
i think i've seen something like this before but i can't find it anymore.
thanks | 0 | [
2,
3523,
5487,
4496,
26,
619,
7721,
4865,
18,
60,
800,
3726,
3726,
31,
2666,
100,
80,
25,
21,
161,
20,
4496,
14,
619,
7721,
3523,
5487,
363,
21,
953,
60,
31,
9,
62,
9,
31,
107,
52,
259,
20,
4496,
21,
345,
6236,
22,
18,
3523,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Microsoft MVC "echo/print/output" etc
===
With ASP.NET's view engine/template aspx/ashx pages the way to spit to screen seems to be:
<%= Person.Name %>
Which was fine with webforms as alot of model data was bound to controls programatically. But with MVC we are now using this syntax more oftern.
The issue I have with it is quite trivial, but annoying either way. This is that it seems to break up the mark up i.e.:
<% foreach(var Person in People) { %>
<%= Person.Name %>
<% } %>
That seems like alot of opening and closing tags to me!
Other view engines in the MVC contrib have a means of spitting to screen with out opening and closing the script tags using standard keyword such as "print, out, echo" i.e. (brail example):
<%
for element in list:
output "<li>${element}</li>"
end
%>
Now, I said this may seem trivial, but it just seems more readable this way. So what are the advantages of MS having this syntax, and not providing a output method?
Cheers, Chris. | 0 | [
2,
7099,
307,
8990,
13,
7,
62,
2613,
118,
10299,
118,
1320,
4881,
7,
2722,
800,
3726,
3726,
29,
28,
306,
9,
2328,
22,
18,
1418,
1406,
118,
9577,
6554,
28,
306,
396,
118,
6031,
396,
4434,
14,
161,
20,
9286,
20,
2324,
2206,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Hibernate @ManyToMany mapping with composite keys
===
I'm trying to map a ManyToMany relationships between 2 tables, both having composite primary keys
LSFOCTB which primary key is composed of : LSFOC_CODSOC,LSFOC_CODLSC,LSFOC_CODFOC
LSFORTB which primary key is composed of : LSFOR_CODSOC,LSFOR_CODLSC,LSFOC_CODFOR
The table in charge of the ManyToMany relationship is :
LSFCFTB, with : LSFCF_CODSOC,LSFCF_CODLSC,LSFCF_CODFOC,LSFCF_CODFOR
So, in the hibernate model mapping LSFOCTB, I tried :
@ManyToMany(targetEntity = package.LSFOCTB.class, cascade = { CascadeType.PERSIST,
CascadeType.MERGE })
@JoinTable(name = "LSFCFTB", joinColumns = {
@JoinColumn(name = "LSFCF_CODLSC", referencedColumnName = "LSFOC_CODLSC"),
@JoinColumn(name = "LSFCF_CODFOC", referencedColumnName = "LSFOC_CODFOC"),
@JoinColumn(name = "LSFCF_CODSOC", referencedColumnName = "LSFOC_CODSOC") },
inverseJoinColumns = { @JoinColumn(name = "LSFCF_CODLSC", referencedColumnName = "LSFOR_CODLSC"),
@JoinColumn(name = "LSFCF_CODFOR", referencedColumnName = "LSFOR_CODFOR"),
@JoinColumn(name = "LSFCF_CODSOC", referencedColumnName = "LSFOR_CODSOC") })
before the getter.
But it won't work...
The error, when trying to access the distant collection is :
org.springframework.beans.factory.BeanCreationException: Error creating bean with name 'sessionFactory' defined in class path resource [beans-dao.xml]: Invocation of init method failed; nested exception is org.hibernate.MappingException: Repeated column in mapping for collection: package.LSFOCTB.distantCollection column: LSFCF_CODLSC
Have already managed to make an hibernate mapping work for a ManyToMany relationship ?
If so, what is wrong with my mapping ?
Thank you for your help !
| 0 | [
2,
4148,
2102,
8820,
13,
1,
14842,
262,
14842,
13305,
29,
12639,
5534,
800,
3726,
3726,
31,
22,
79,
749,
20,
2942,
21,
151,
262,
14842,
5833,
128,
172,
7484,
15,
156,
452,
12639,
1256,
5534,
644,
18,
4120,
4812,
220,
56,
1256,
124... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
"Could not load type..." when upgrading to W2K3 and IIS6
===
I have a c# .NET 2.0 application that has been running on W2K/IIS5 quite happily for several years. The sysadmin team are currently setting up a W2K3 box for the app, using the same install files, but are running into the dreaded "Could not load type..." error. The type in question is the class (i.e. code behind) for the page being requested.
I've read that switching the .NET version to 1.1 and back to 2.0 can fix the problem, but we've tried this with no luck.
Any ideas? Most of the info I can find is about solving the problem when it happens during development, running the app from Visual Studio.
Thanks,
Jon. | 0 | [
2,
13,
7,
13431,
52,
6305,
1001,
9,
9,
9,
7,
76,
26939,
20,
619,
135,
197,
240,
17,
595,
18,
379,
800,
3726,
3726,
31,
57,
21,
272,
5910,
13,
9,
2328,
172,
9,
387,
3010,
30,
63,
74,
946,
27,
619,
135,
197,
118,
2865,
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... |
Are There Any Other Programming Riddles?
===
Are there any other sources of programming type riddles on the internet?
I started my [set of daily programming riddles, jokes, and quotes][1] partly to help myself and my team grown in some technical areas... like new .NET 3.5 features, design patterns, anti-patterns, code smells, etc.
I would love to find other short programming riddles on the web, but I haven't ran across any yet. Do any of you know any, or would you consider starting to make your own?
[1]: http://manorisms.blogspot.com/ | 0 | [
2,
50,
80,
186,
89,
3143,
16551,
18,
60,
800,
3726,
3726,
50,
80,
186,
89,
2662,
16,
3143,
1001,
16551,
18,
27,
14,
2620,
60,
31,
373,
51,
636,
3554,
16,
1954,
3143,
16551,
18,
15,
15465,
15,
17,
18901,
500,
2558,
165,
500,
57... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to calculate center of an ellipse by two points and bounding rectangle
===
While working on SVG implementation for Internet Explorer to be based on its own VML format I came to a problem of translation of an SVG elliptical arc to an VML elliptical arc.
In VML an arc is given by: two angles for two points on ellipse and sizes of ellipse boundary box,
In SVG an arc is given by: two pairs of coordinates for two points on ellipse and sizes of ellipse boundary box
So, the question is: How to express angles of two points on ellipse to two pairs of their coordinates.
An intermediate question could be: How to find the center of an ellipse by coordinates of a pair of points on its curve. | 0 | [
2,
184,
20,
18469,
459,
16,
40,
13,
4223,
1919,
62,
34,
81,
819,
17,
4138,
68,
27181,
800,
3726,
3726,
133,
638,
27,
13,
18,
22955,
6123,
26,
2620,
8520,
20,
44,
432,
27,
82,
258,
566,
8184,
2595,
31,
281,
20,
21,
1448,
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... |
How does delete[] "know" the size of the operand array?
===
<pre>Foo* set = new Foo[100];
// ...
delete [] set;</pre>You don't pass the array's boundaries to delete[]. But where is that information stored? Is it standardised? | 0 | [
2,
184,
630,
27448,
2558,
500,
13,
7,
17806,
7,
14,
1072,
16,
14,
1877,
706,
7718,
60,
800,
3726,
3726,
13,
1,
3515,
1,
4120,
111,
2483,
309,
800,
78,
4310,
111,
2558,
4031,
12660,
12894,
13,
9,
9,
9,
27448,
20767,
309,
73,
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... |
Embedded C: what does var = 0xFF; do?
===
I'm working with embedded C for the first time. Although my C is rusty, I can read the code but I don't really have a grasp on why certain lines are the way the are. For example, I want to know if a variable is true or false and send it back to another application. Rather than setting the variable to 1 or 0, the original implementor chose 0xFF.
Is he trying to set it to an address space? or else why set a boolean variable to be 255? | 0 | [
2,
12138,
272,
45,
98,
630,
4033,
800,
713,
396,
2460,
73,
107,
60,
800,
3726,
3726,
31,
22,
79,
638,
29,
12138,
272,
26,
14,
64,
85,
9,
419,
51,
272,
25,
15395,
15,
31,
92,
1302,
14,
1797,
47,
31,
221,
22,
38,
510,
57,
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... |
Is there a way for Ruby accessors to return something other than the set variable?
===
I want to do some checking in a writer accessor. My first idea was returning a boolean.
class MyClass
def var=(var)
@var = var
# some checking
return true
end
end
m = MyClass.new
retval = (m.var = 'foo')
=> "foo"
Can I set a return value in a writer accessor? If yes, how can I get this value? | 0 | [
2,
25,
80,
21,
161,
26,
10811,
1381,
248,
18,
20,
788,
301,
89,
119,
14,
309,
7612,
60,
800,
3726,
3726,
31,
259,
20,
107,
109,
9886,
19,
21,
1462,
1381,
248,
9,
51,
64,
882,
23,
2485,
21,
9827,
413,
210,
9,
718,
51,
1898,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WCF - What is the difference between Binding.RecieveTimeout and Binding.ReliableSession.InactivityTimeout?
===
In WCF, what is the difference between Binding.RecieveTimeout and Binding.ReliableSession.InactivityTimeout? | 0 | [
2,
11801,
410,
13,
8,
98,
25,
14,
2841,
128,
8728,
9,
15110,
62,
195,
891,
1320,
17,
8728,
9,
19003,
579,
7202,
5991,
9,
108,
19348,
891,
1320,
60,
800,
3726,
3726,
19,
11801,
410,
15,
98,
25,
14,
2841,
128,
8728,
9,
15110,
62... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0... |
Alternative IDE for Silverlight
===
I want to play around with silverlight without having to buy a Visual Studio 2008 license.
I already used my trial time with Visual Studio, so I'm trying to find another solution.
Any thing out there?
Thanks | 0 | [
2,
2676,
13,
3448,
26,
1172,
3130,
800,
3726,
3726,
31,
259,
20,
418,
140,
29,
1172,
3130,
366,
452,
20,
3034,
21,
3458,
1120,
570,
3962,
9,
31,
614,
147,
51,
2178,
85,
29,
3458,
1120,
15,
86,
31,
22,
79,
749,
20,
477,
226,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What are the best options for Rich Text Editing in Rails?
===
I'd like to use Rich Text Editing in place on forms in order to let admins change instructions. What are the best options for doing this? | 0 | [
2,
98,
50,
14,
246,
6368,
26,
2042,
1854,
9510,
19,
2240,
18,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
275,
2042,
1854,
9510,
19,
209,
27,
1997,
19,
389,
20,
408,
21,
43,
2160,
18,
753,
7650,
9,
98,
50,
14,
246,
6368,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Making a Table Row clickable
===
I wonder what the best way to make an entire tr clickable would be?
The most common (and only?) solution seems to be using JavaScript, by using onclick="javascript:document.location.href('bla.htm');" (not to forget: Setting a proper cursor with onmouseover/onmouseout).
While that works, it is a pity that the target URL is not visible in the status bar of a browser, unlike normal links.
So I just wonder if there is any room for optimization? Is it possible to display the URL that will be navigated to in the status bar of the browser? Or is there even a non-JavaScript way to make a tr clickable? | 0 | [
2,
544,
21,
859,
3131,
10840,
579,
800,
3726,
3726,
31,
2666,
98,
14,
246,
161,
20,
233,
40,
1078,
9235,
10840,
579,
83,
44,
60,
14,
127,
757,
13,
5,
290,
104,
60,
6,
4295,
2206,
20,
44,
568,
8247,
8741,
15,
34,
568,
27,
150... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Instantiating a C++ class in C# using P/Invoke via a pointer
===
I am importing the CreateICeeFileGen() function from the unmanaged DLL mscorpe.dll in a C# application, in order to generate a PE file. This function returns a pointer to an C++ object [defined here](http://msdn.microsoft.com/en-us/library/ms404463.aspx), is there any way I can access fields from this class via C# or do I need to write an unmanaged wrapper DLL?
The code I'm using currently is as follows:-
[DllImport(@"C:\WINDOWS\Microsoft.NET\Framework\v2.0.50727\mscorpe.dll", EntryPoint = "CreateICeeFileGen")]
static extern void CreateICeeFileGen(out IntPtr iceeFileGenPointer);
...
IntPtr filePtr;
CreateICeeFileGen(out filePtr);
**N.B.**: I know you can do similar things with .net libraries but I need to use unmanaged libraries for my purposes.
Thanks in advance!! | 0 | [
2,
6322,
49,
1880,
21,
272,
20512,
718,
19,
272,
5910,
568,
351,
118,
108,
2625,
1048,
1197,
21,
454,
106,
800,
3726,
3726,
31,
589,
9010,
68,
14,
1600,
3568,
62,
16877,
1863,
5,
6,
1990,
37,
14,
367,
177,
8030,
13,
43,
211,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Programmatically Set Browser Proxy Settings in C#
===
I'm writing an winforms app that needs to set internet explorer's proxy settings and then open a new browser window. At the moment, I'm applying the proxy settings by going into the registry:
RegistryKey registry = Registry.CurrentUser.OpenSubKey("Software\\Microsoft\\Windows\\CurrentVersion\\Internet Settings", true);
registry.SetValue("ProxyEnable", 1);
registry.SetValue("ProxyServer", "127.0.0.1:8080");
Is going into the registry the *best* way to do this, or is there a more recommended approach? I'd like to avoid registry changes if there's an alternative solution.
| 0 | [
2,
625,
6732,
1326,
309,
16495,
27188,
12410,
19,
272,
5910,
800,
3726,
3726,
31,
22,
79,
1174,
40,
628,
4190,
18,
4865,
30,
2274,
20,
309,
2620,
8520,
22,
18,
27188,
12410,
17,
94,
368,
21,
78,
16495,
1463,
9,
35,
14,
688,
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... |
AOP support in Delphi
===
Is it possible to do Aspect Oriented Programming in Delphi? I would be interested in native support as well as third party solutions.
I don't have a specific problem I want to solve with AOP, but am simply interested in studying AOP.
Thanks, Miel Bronneberg. | 0 | [
2,
21,
2594,
555,
19,
23030,
800,
3726,
3726,
25,
32,
938,
20,
107,
7289,
13,
6800,
3143,
19,
23030,
60,
31,
83,
44,
3158,
19,
1275,
555,
28,
134,
28,
422,
346,
6776,
9,
31,
221,
22,
38,
57,
21,
1903,
1448,
31,
259,
20,
8402... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I tune the PHP realpath cache?
===
Recent versions of PHP have a cache of filenames for knowing the real path of files, and require_once() and include_once() can take advantage of it.
There's a value you can set in your php.ini to set the size of the cache, but I have no idea how to tell what the size should be. The default value is 16k, but I see no way of telling how much of that cache we're using. The docs are vague:
[Determines the size of the realpath cache to be used by PHP. This value should be increased on systems where PHP opens many files, to reflect the quantity of the file operations performed.][1]
Yes, I can jack up the amount of cache allowed, and run tests with ab or some other testing, but I'd like something with a little more introspection than just timing from a distance.
[1]: http://us2.php.net/manual/en/ini.core.php#ini.realpath-cache-size | 0 | [
2,
184,
92,
31,
6768,
14,
13,
26120,
683,
8353,
16522,
60,
800,
3726,
3726,
1764,
3281,
16,
13,
26120,
57,
21,
16522,
16,
3893,
7259,
18,
26,
2506,
14,
683,
2013,
16,
6488,
15,
17,
4077,
1,
13120,
5,
6,
17,
468,
1,
13120,
5,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.