unified_texts
stringlengths
32
30.1k
OpenStatus_id
int64
0
4
input_ids
list
token_type_ids
list
attention_mask
list
What is the best grep tool for Windows? === Any recommendations on [grep](http://en.wikipedia.org/wiki/Grep) tools for Windows? Ideally one that could leverage 64-bit OS. I'm aware of [cygwin](http://www.cygwin.com/), of course, and have also found [PowerGREP](http://www.powergrep.com/), but I'm wondering if there are any hidden gems out there.
4
[ 2, 98, 25, 14, 246, 5604, 306, 5607, 26, 1936, 60, 800, 3726, 3726, 186, 12121, 27, 636, 6879, 306, 500, 5, 21127, 6903, 219, 9, 17375, 26132, 9, 5583, 118, 17375, 118, 6879, 306, 6, 4672, 26, 1936, 60, 5628, 102, 53, 30, 110, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
TestDriven.Net doesn't find tests === I have a test project using MbUnit and TestDriven.Net. If I right-click on an individual test method and say "Run Tests" the test runs successfully. Same thing if I click on a file name in the solution explorer. However, if I right click and say run tests on the project or the solution, TestDriven.Net reports "0 Passed, 0 Failed, 0 Skipped." I have other similar projects that work just fine.
0
[ 2, 1289, 14489, 9, 2328, 1437, 22, 38, 477, 4894, 800, 3726, 3726, 31, 57, 21, 1289, 669, 568, 14023, 15464, 17, 1289, 14489, 9, 2328, 9, 100, 31, 193, 8, 150, 10129, 27, 40, 1359, 1289, 2109, 17, 395, 13, 7, 3169, 4894, 7, 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...
Can I pass a JavaScript variable to another browser window? === I have a page which spawns a popup browser window. I have a JavaScript variable in the parent browser window and I would like to pass it to the popped-up browser window. Is there a way to do this? I know this can be done across frames in the same browser window but I'm not sure if it can be done across browser windows.
0
[ 2, 92, 31, 1477, 21, 8247, 8741, 7612, 20, 226, 16495, 1463, 60, 800, 3726, 3726, 31, 57, 21, 2478, 56, 13, 22860, 18, 21, 1675, 576, 16495, 1463, 9, 31, 57, 21, 8247, 8741, 7612, 19, 14, 4766, 16495, 1463, 17, 31, 83, 101, 20...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How should exceptions be planned at the architectural level? === Are there any good resources for planning how exceptions will be used from an architecture perspective? (Or provide your suggestions directly here.) In projects on which I have worked I find that a few common Exceptions are used over and over again and tend to lose their meaning. From: [http://jamesjava.blogspot.com/2007/10/exception-plan.html][1] [1]: http://jamesjava.blogspot.com/2007/10/exception-plan.html
0
[ 2, 184, 378, 13392, 44, 2035, 35, 14, 5350, 662, 60, 800, 3726, 3726, 50, 80, 186, 254, 2566, 26, 2334, 184, 13392, 129, 44, 147, 37, 40, 2607, 6531, 60, 13, 5, 248, 1181, 154, 18389, 1703, 235, 9, 6, 19, 2314, 27, 56, 31, 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...
What identifying information can a website capture? === If the owner of a web site wants to track who their users are as much as possible, what things can they capture (and how). You might want to know about this in order to capture information on a site you create or, as a user, to _prevent_ a site from capturing data on you. Here is a starting list, but I'm sure I have missed some important ones: 1. Referrer (what web page had the link you followed to get here). This is a HTTP header. 1. IP Address of the machine you are browsing from. This is available with the HTTP headers. 1. User Agent (what browser you are using). This is a HTTP header. 1. Cookie placed on a previous visit. This is a header, available only if a cookie was placed earlier and was not deleted by the user. 1. Flash Cookie placed on a previous visit. Some users turn off cookies, but _very_ few know how to turn off Flash cookies. Works like a normal cookie although it depends on Flash. 1. Web Bugs. Place something small (like a transparent single-pixel GIF) on the page that's served up from a 3rd party. Some third parties (such as DoubleClick) will have their own cookies and can correlate with other visits the user makes (for a fee!). Those are the common ones I think of, but there have to be LOTS of unusual ones. For instance, this: 1. Time on the user's clock. [Use JavaScript](http://stackoverflow.com/questions/13/determining-web-users-time-zone) to transmit it. ... which I had never heard of before reading it here.
0
[ 2, 98, 13785, 676, 92, 21, 2271, 3683, 60, 800, 3726, 3726, 100, 14, 2410, 16, 21, 2741, 689, 2846, 20, 792, 72, 66, 3878, 50, 28, 212, 28, 938, 15, 98, 564, 92, 59, 3683, 13, 5, 290, 184, 6, 9, 42, 530, 259, 20, 143, 88, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What are the major vulnerabilities of Windows 2003 + Apache? === I am searching for a host for a new commercial website. Among other things, I'd like to know what the various OS - Webserver combinations have in terms of vulnerabilities. What are the vulnerabilities of Windows 2003 + Apache?
0
[ 2, 98, 50, 14, 394, 13, 12708, 1031, 58, 9168, 3808, 16, 1936, 973, 2754, 17140, 60, 800, 3726, 3726, 31, 589, 5792, 26, 21, 2015, 26, 21, 78, 1439, 2271, 9, 497, 89, 564, 15, 31, 22, 43, 101, 20, 143, 98, 14, 617, 13, 759, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 Technique in C++ to know if a class has a member function of a given signature === I'm asking for a template trick to detect if a class has a specific member function of a given signature. the problem is similar to the one cited here [http://www.gotw.ca/gotw/071.htm][1] but not the same: in the item of Sutter's book he answered to the question that a class C MUST PROVIDE a member function with a particular signature, else the program won't compile. In my problem I need to do something if a class has that function, else do "something else". A similar problem was faced by boost::serialization but I don't like the solution they adopted: a template function that invoke by default a free function (that you have to define) with a particular signature unless you define a particular member function (in their case "serialize" that tale 2 parameters of a given type) with a particular signature. else a compile error will happens. That is to implement both intrusive and non-intrusive serialization. I don't like that solution fer two reasons: 1) to be non intrusive you must override the global "serialize" function that is in boost::serialization namespace, so you have IN YOUR CLIENT CODE to open namespace boost and namespace serialization!! And a second, practical reason, is because the stack to resolve that mess was 10 to 12 function invocation... and I'm a game developer. I need to define a custom behavior for classes that has not that member function, and my entities are inside differents namespaces (and I don't want to override a global function defined in one namespace while I'm in another one) Can you give me an hint to solve this puzzle? [1]: http://www.gotw.ca/gotw/071.htm
0
[ 2, 25, 80, 21, 4873, 19, 272, 20512, 20, 143, 100, 21, 718, 63, 21, 322, 1990, 16, 21, 504, 7810, 800, 3726, 3726, 31, 22, 79, 3379, 26, 21, 22894, 5514, 20, 9092, 100, 21, 718, 63, 21, 1903, 322, 1990, 16, 21, 504, 7810, 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...
javascript library to show photo album === I visited few web sites in the past where they had a set of photo thumbnails and clicking on one of them created a cool effect of an expanding popup showing the full size image. Is there any available free javascript library that will do this? I'm interested mostly in the popup effect and less in the rest of the album management.
0
[ 2, 8247, 8741, 1248, 20, 298, 3056, 244, 800, 3726, 3726, 31, 3120, 310, 2741, 3259, 19, 14, 640, 113, 59, 41, 21, 309, 16, 3056, 5078, 325, 947, 18, 17, 25590, 27, 53, 16, 105, 679, 21, 2700, 1590, 16, 40, 9393, 1675, 576, 31...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to find the location of a regex match in Perl? === I need to write a function that receives a string and a regex. I need to check if there is a match and return the start and end location of a match. (the regex was already compiled by qr//) The function might also receive a "global" flag and then I need to return the (start,end) pairs of all the matches.
0
[ 2, 184, 20, 477, 14, 1474, 16, 21, 7953, 1706, 730, 19, 416, 255, 60, 800, 3726, 3726, 31, 376, 20, 2757, 21, 1990, 30, 8359, 21, 3724, 17, 21, 7953, 1706, 9, 31, 376, 20, 2631, 100, 80, 25, 21, 730, 17, 788, 14, 799, 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...
Resharper and ViEmu Keybindings ( and Visual Assist ) === With ViEmu you really need to unbind a lot of resharpers keybindings to make it work well. Does anyone have what they think is a good set of keybindings that work well for resharper when using ViEmu? What I'm doing at the moment using the Visual Studio bindings from Resharper. Toasting all the conflicting ones with ViEmu, and then just driving the rest through the menu modifiers ( Alt-R keyboard shortcut for the menu item ). I also do the same with Visual Assist shortcuts ( for C++ ) if anyones got any tips and tricks for ViEmu / Resharper or Visual Assist working together well I'd most apprciate it!
0
[ 2, 302, 23646, 106, 17, 13, 7337, 3677, 1246, 22260, 18, 13, 5, 17, 3458, 5404, 13, 6, 800, 3726, 3726, 29, 13, 7337, 3677, 42, 510, 376, 20, 367, 4772, 43, 21, 865, 16, 302, 23646, 445, 1246, 22260, 18, 20, 233, 32, 170, 134,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Headless HTML rendering, preferrably open source === I'm currently looking to perform some headless HTML rendering to essentially create resources off screen and persist the result as an image. The purpose is to take a subset of the HTML language and apply it to small screen devices (like PocketPCs) because our users know HTML and the transition from Photoshop to HTML markup would be acceptable. I am also considering using WPF Imaging so if anyone can weigh in comments about its use (particularly tools you would point your users to for creating WPF layouts you can convert into images and how well it performs) it would be appreciated. My order of preference is: 1. open source 2. high performance 3. native C# or C# wrapper 4. lowest complexity for implementation on Windows I'm not very worried about how feature rich the headless rendering is since we won't make big use of JavaScript, Flash, nor other embedded objects aside from images. I'd be fine with anything that uses IE, Firefox, webkit, or even a custom rendering implementation so long as its implementation is close to standards compliant.
0
[ 2, 157, 923, 13, 15895, 15307, 15, 6369, 139, 4801, 368, 1267, 800, 3726, 3726, 31, 22, 79, 871, 699, 20, 2985, 109, 157, 923, 13, 15895, 15307, 20, 7398, 1600, 2566, 168, 2324, 17, 22084, 14, 829, 28, 40, 1961, 9, 14, 2131, 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...
Using both 1.1 and 2.0 frameworks on Windows 2003 x64 === So, much to my annoyance I discover (after lots of research), that when running 1.1 and 2.0 dot.net frameworks on a 64bit 2003 install, it removes the asp.net tab from the IIS properties. I've tried the registry hacks, I've tried registering 32bit versions of both frameworks, and no luck. My only work around is running the excellent [ASP.NET switcher][1] from Dennis Bauer. Does anyone else have any insight? [1]: http://www.denisbauer.com/NETTools/ASPNETVersionSwitcher.aspx
0
[ 2, 568, 156, 137, 9, 165, 17, 172, 9, 387, 6596, 18, 27, 1936, 973, 993, 3470, 800, 3726, 3726, 86, 15, 212, 20, 51, 20106, 31, 6297, 13, 5, 5162, 7503, 16, 527, 6, 15, 30, 76, 946, 137, 9, 165, 17, 172, 9, 387, 14123, 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...
Different versions of C++ libraries === After compiling a simple C++ project using Visual Studio 2008 on vista, everything runs fine on the original vista machine and other vista computers. However, moving it over to an XP box results in an error message: "The application failed to start because the application configuration is incorrect". What do I have to do so my compiled EXE works on XP and Vista? I had this same problem a few months ago, and just fiddling with some settings on the project fixed it, but I don't remember which ones I changed.
0
[ 2, 421, 3281, 16, 272, 20512, 8649, 800, 3726, 3726, 75, 24378, 21, 1935, 272, 20512, 669, 568, 3458, 1120, 570, 27, 13520, 15, 796, 1461, 1123, 27, 14, 501, 13520, 1940, 17, 89, 13520, 7774, 9, 207, 15, 1219, 32, 84, 20, 40, 23...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Specifying Source for Debugging using Netbeans === Using the debugger in Netbeans 6.1, I'd like to step into a method of the JSF library (specifically method saveSerializedView of class StateManager), but I cannot figure out how to specify through the IDE the location of the source code for the JSF library. I'm even having trouble determining which jar file or files Netbeans is using for JSF.
0
[ 2, 19077, 68, 1267, 26, 121, 16254, 2762, 568, 4275, 863, 5950, 800, 3726, 3726, 568, 14, 121, 2345, 11356, 19, 4275, 863, 5950, 400, 9, 165, 15, 31, 22, 43, 101, 20, 1424, 77, 21, 2109, 16, 14, 487, 18, 410, 1248, 13, 5, 9219...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Disabling Back button on the browser === I am writing an application that if the user hits back, it may resend the same information and mess up the flow and integrity of data. How do I disable it for users who are with and without javascript on?
0
[ 2, 1460, 58, 8599, 97, 5167, 27, 14, 16495, 800, 3726, 3726, 31, 589, 1174, 40, 3010, 30, 100, 14, 4155, 3858, 97, 15, 32, 123, 10719, 2451, 14, 205, 676, 17, 3957, 71, 14, 3312, 17, 11961, 16, 1054, 9, 184, 107, 31, 1460, 579...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Is it safe to generally assume that toString() has a low cost? === Do you generally assume that toString() on any given object has a low cost? I do. Is that assumption valid? If it has a high cost should that normally be changed? What are valid reasons to make a toString() method with a high cost? The only time that I get concerned about toString costs is when I know that it is on some sort of collection with many members. From: [http://jamesjava.blogspot.com/2007/08/tostring-cost.html][1] [1]: http://jamesjava.blogspot.com/2007/08/tostring-cost.html
0
[ 2, 25, 32, 1834, 20, 1469, 7158, 30, 20, 11130, 5, 6, 63, 21, 708, 1516, 60, 800, 3726, 3726, 107, 42, 1469, 7158, 30, 20, 11130, 5, 6, 27, 186, 504, 3095, 63, 21, 708, 1516, 60, 31, 107, 9, 25, 30, 12027, 7394, 60, 100, 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...
What are the major vulnerabilities of Redhat + Apache? === I am searching for a host for a new commercial website. Among other things, I'd like to know what the various OS - Webserver combinations have in terms of vulnerabilities. What are the vulnerabilities of Redhat + Apache?
0
[ 2, 98, 50, 14, 394, 13, 12708, 1031, 58, 9168, 3808, 16, 402, 6775, 2754, 17140, 60, 800, 3726, 3726, 31, 589, 5792, 26, 21, 2015, 26, 21, 78, 1439, 2271, 9, 497, 89, 564, 15, 31, 22, 43, 101, 20, 143, 98, 14, 617, 13, 759, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 extract macros programmatically from OpenOffice.org Writer document using .NET? === How do you extract the Macro code from an OpenOffice.org Writer document using the .NET API? I got an answer to the ["Office 2007" version of this question][1], but we are evaluating OpenOffice as an alternative -- if anyone has any experience with this, any tips or resources would be appreciated. [1]: http://stackoverflow.com/questions/49724/programmatically-extract-macro-vba-code-from-word-2007-docs
0
[ 2, 184, 107, 42, 10962, 9069, 18, 625, 6732, 1326, 37, 368, 17047, 9, 5583, 1462, 4492, 568, 13, 9, 2328, 60, 800, 3726, 3726, 184, 107, 42, 10962, 14, 9069, 1797, 37, 40, 368, 17047, 9, 5583, 1462, 4492, 568, 14, 13, 9, 2328, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 network interface in Mac OS X === I know that you can make a virtual network interface in Windows (see [here][1]), and in Linux it is also pretty easy with ip-aliases, but does something similar exist for Mac OS X? I've been looking for loopback adapters, virtual interfaces and couldn't find a good solution. You can create a new interface in the networking panel, based on an existing interface, but it will not act as a real fully functional interface (if the original interface is inactive, then the derived one is also inactive). [1]: http://support.microsoft.com/kb/236869
0
[ 2, 6599, 982, 6573, 19, 1572, 13, 759, 993, 800, 3726, 3726, 31, 143, 30, 42, 92, 233, 21, 6599, 982, 6573, 19, 1936, 13, 5, 1798, 636, 6836, 500, 2558, 165, 500, 6, 15, 17, 19, 13024, 32, 25, 67, 1772, 2010, 29, 15735, 8, 1...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Can you specify filenames using wildcards or regexes in the subversion mv command? === I want to do this so that I can say something like, `svn mv *.php php-folder/`, but it does not seem to be working. Is it even possible? No mention of it is made on the relevant page in the [svn book](http://svnbook.red-bean.com/en/1.0/re18.html). Thanks in advance!
0
[ 2, 92, 42, 19077, 3893, 7259, 18, 568, 23003, 18, 54, 7953, 1706, 160, 19, 14, 972, 10898, 17967, 1202, 60, 800, 3726, 3726, 31, 259, 20, 107, 48, 86, 30, 31, 92, 395, 301, 101, 15, 13, 1, 18, 16578, 17967, 1637, 9, 26120, 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...
Are "proxy properties" good style? === I have a class with a string property that's actually several strings joined with a separator. I'm wondering if it is good form to have a proxy property like this: public string ActualProperty { get { return actualProperty; } set { actualProperty = value; } } public string[] IndividualStrings { get { return ActualProperty.Split(.....); } set { // join strings from array in propval .... ; ActualProperty = propval; } } Is there any risks I have overlooked?
0
[ 2, 50, 13, 7, 4899, 9229, 3704, 7, 254, 1034, 60, 800, 3726, 3726, 31, 57, 21, 718, 29, 21, 3724, 1354, 30, 22, 18, 1121, 238, 7887, 670, 29, 21, 1353, 3574, 3457, 9, 31, 22, 79, 5712, 100, 32, 25, 254, 505, 20, 57, 21, 27...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What is the best resource for learning Scrum? === What is the best resource for learning Scrum?
4
[ 2, 98, 25, 14, 246, 6577, 26, 2477, 26562, 60, 800, 3726, 3726, 98, 25, 14, 246, 6577, 26, 2477, 26562, 60, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
How many DataTable objects should I use in my C# app? === I'm an experienced programmer in a legacy (yet object oriented) development tool and making the switch to C#/.Net. I'm writing a small single user app using SQL server CE 3.5. I've read the conceptual DataSet and related doc and my code works. Now I want to make sure that I'm doing it "right", get some feedback from experienced .Net/SQL Server coders, the kind you don't get from reading the doc. I've noticed that I have code like this in a few places: var myTableDataTable = new MyDataSet.MyTableDataTable(); myTableTableAdapter.Fill(MyTableDataTable); ... // other code In a single user app, would you typically just do this once when the app starts, instantiate a DataTable object for each table and then store a ref to it so you ever just use that single object which is already filled with data? This way you would ever only read the data from the db once instead of potentially multiple times. Or is the overhead of this so small that it just doesn't matter (plus could be counterproductive with large tables)?
0
[ 2, 184, 151, 1054, 5924, 3916, 378, 31, 275, 19, 51, 272, 5910, 4865, 60, 800, 3726, 3726, 31, 22, 79, 40, 3882, 17968, 19, 21, 7780, 13, 5, 16480, 3095, 13, 6800, 6, 522, 5607, 17, 544, 14, 5521, 20, 272, 5910, 118, 9, 2328, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
If it is decided that our system needs an overhaul, what is the best way to go about it? === We are mainting a web application that is built on Classic ASP using VBScript as the primary language. We are in agreement that our backend (framework if you will) is out dated and doesn't provide us with the proper tools to move forward in a quick manor. We have pretty much embraced the current webMVC pattern that is all over the place, and cannot do it, in a reasonable manner, with the current technology. The big missing features are proper dispatching and templating with inheritance, amongst others. Currently there are two paths being discussed: 1. Port the existing application to Classic ASP using JScript, which will allow us to hopefully go from there to .NET MSJscript without too much trouble, and eventually end up on the .NET platform (preferably the MVC stuff will be done by then, ASP.NET isn't much better than were we are no, in our opinions). This has been argued as the safer path with less risk than the next option, albeit it might take slightly longer. 2. Completely rewrite the application using some other technology, right now the leader of the pack is Python WSGI with a custom framework, ORM, and a good templating solution. There is wiggle room here for even django and other pre-built solutions. This method would hopefully be the quickest solution, as we would probably run a beta beside the actual product, but it does have the potential for a big waste of time if we can't/don't get it right. This does not mean that our logic is gone, as what we have built over the years is fairly stable, as noted just difficult to deal with. It is built on SQL Server 2005 with heavy use of stored procedures and published on IIS 6, just for a little more background. Now, the question. Has anyone taken either of the two paths above? If so, was it successful, how could it have been better, etc. We aren't looking to deviate much from doing one of those two things, but some suggestions or other solutions would potentially be helpful.
0
[ 2, 100, 32, 25, 868, 30, 318, 329, 2274, 40, 17460, 15, 98, 25, 14, 246, 161, 20, 162, 88, 32, 60, 800, 3726, 3726, 95, 50, 407, 1203, 21, 2741, 3010, 30, 25, 392, 27, 2732, 28, 306, 568, 13, 20468, 8741, 28, 14, 1256, 816, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Excel column names === What column names cannot be used when creating an Excel spreadsheet with ADO. I have a statement that creates a page in a spreadsheet. CREATE TABLE [TableName] (Column string, Column2 string); I have found that using a column name of Date or Container will generate an error when the statement is executed. Does anyone have a complete (or partial) list of words that cannot be used as column names? This is for use in a user-driven environment and it would be better to "fix" the columns than to crash. My work-around for these is to replace any occurences of Date or Container with Date_ and Container_ respectively.
0
[ 2, 20700, 4698, 1817, 800, 3726, 3726, 98, 4698, 1817, 1967, 44, 147, 76, 2936, 40, 20700, 1789, 17627, 29, 21, 537, 9, 31, 57, 21, 3331, 30, 9695, 21, 2478, 19, 21, 1789, 17627, 9, 1600, 859, 636, 5924, 7259, 500, 13, 5, 716, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Making WCF easier to configure === I have a set of WCF web services connected to dynamically by a desktop application. My problem is the really detailed config settings that WCF requires to work. Getting SSL to work involves custom settings. Getting MTOM or anything else to work requires more. You want compression? Here we go again... WCF is really powerful - you can use a host of different ways to connect, but all seem to involve lots of detailed config. If host and client don't match perfectly you get hard to decipher errors. I want to make the desktop app far easier to configure - ideally some kind of auto-discovery. The users of the desktop app should just be able to enter the URL and it do the rest. Does anyone know a good way to do this? I know Visual Studio can set the config up for you, but I want the desktop app to be able to do it based on a wide variety of different server set-ups.
0
[ 2, 544, 11801, 410, 4950, 20, 1065, 15951, 800, 3726, 3726, 31, 57, 21, 309, 16, 11801, 410, 2741, 687, 2587, 20, 7782, 1326, 34, 21, 17404, 3010, 9, 51, 1448, 25, 14, 510, 6036, 13, 14093, 2816, 12410, 30, 11801, 410, 4781, 20, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do you respond when an IT manager asks you, "What is Firefox?" === Even though I've jumped on the Chrome bandwagon, I still wear my blue Firefox golf shirt to work occasionally. Sometimes people ask me about it in the elevator. Sometimes these people are managers in our IT department. I've even had the same manager ask me more than once (given about six months between).
0
[ 2, 184, 107, 42, 4590, 76, 40, 32, 1382, 3913, 42, 15, 13, 7, 608, 25, 535, 18219, 60, 7, 800, 3726, 3726, 166, 362, 31, 22, 195, 4298, 27, 14, 13, 12985, 323, 14609, 218, 15, 31, 174, 3098, 51, 705, 535, 18219, 4034, 2699, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 Flex/AS3, how do I get a class definition of an embedded asset with getDefinitionByName === I have a class with many embedded assets. Within the class, I would like to get the class definition of an asset by name. I have tried using getDefinitionByName(), and also ApplicationDomain.currentDomain.getDefinition() but neither work. Example: public class MyClass { [Embed(source="images/image1.png")] private static var Image1Class:Class; [Embed(source="images/image2.png")] private static var Image2Class:Class; [Embed(source="images/image3.png")] private static var Image3Class:Class; private var _image:Bitmap; public function MyClass(name:String) { var ClassDef:Class = getDefinitionByName(name) as Class; //<<-- Fails _image = new ClassDef() as Bitmap; } } var cls:MyClass = new MyClass("Image1Class");
0
[ 2, 19, 14409, 118, 472, 240, 15, 184, 107, 31, 164, 21, 718, 5465, 16, 40, 12138, 12146, 29, 164, 28643, 779, 7259, 800, 3726, 3726, 31, 57, 21, 718, 29, 151, 12138, 6223, 9, 363, 14, 718, 15, 31, 83, 101, 20, 164, 14, 718, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What is your preferred way to produce charts in a Ruby on Rails web application? === I'd like to add some pie, bar and scatter charts to my Ruby on Rails web application. I want want them to be atractive, easy to add and not introduce much overhead. What charting solution would you recommend? What are its drawbacks (requires Javascript, Flash, expensive, etc)?
0
[ 2, 98, 25, 154, 5981, 161, 20, 2213, 5158, 19, 21, 10811, 27, 2240, 18, 2741, 3010, 60, 800, 3726, 3726, 31, 22, 43, 101, 20, 3547, 109, 5470, 15, 748, 17, 27465, 5158, 20, 51, 10811, 27, 2240, 18, 2741, 3010, 9, 31, 259, 259,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Does anyone have a good example of controlling multiple Excel instances from a .Net app? === We have an Excel 2002/XP based application that interacts with SQL 2000/5 to process fairly complex actuarial calculations. The application performs its function well, but it's difficult to manage. We're trying to create a "controller" application or service that can manage and monitor these various instances of Excel (start/stop/process commands etc) but it's a bit of an InterOp nightmare unfortunately. Does anyone have a good (i.e. working) example of doing something like this in VB.Net or C#?
0
[ 2, 630, 1276, 57, 21, 254, 823, 16, 10106, 1886, 20700, 13946, 37, 21, 13, 9, 2328, 4865, 60, 800, 3726, 3726, 95, 57, 40, 20700, 1093, 118, 396, 306, 432, 3010, 30, 10001, 18, 29, 4444, 255, 824, 18133, 20, 953, 6647, 1502, 601...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Silverlight Datagrid Control - How do I stop the sorting on a column? === Continuing my problem from yesterday, the Silverlight datagrid I have from this [issue][1] is now causing Stack Overflow errors when sorting a column with a large amount of data (Like the text column that contains a where clause for a SQL statment). When you sort, it'll fire the SelectedIndexChanged event for the datagrid and then still try to stort. If you click the header again the stack overflow occours. Does anyone have an idea on how to stop the sorting on this control for a column? All the other columns sort fine (but still fire that darn SelectedIndexChanged event), but if I could shut off the column for whereClause it'd be perfect. Does anyone have a better idea at how to get this to work? [1]: http://stackoverflow.com/questions/74461/silverlight-datagrid-control-selection-changed-event-interfering-with-sorting
0
[ 2, 1172, 3130, 1054, 16375, 569, 13, 8, 184, 107, 31, 747, 14, 2058, 68, 27, 21, 4698, 60, 800, 3726, 3726, 4489, 51, 1448, 37, 7124, 15, 14, 1172, 3130, 1054, 16375, 31, 57, 37, 48, 636, 12565, 500, 2558, 165, 500, 25, 130, 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...
What is the equivalent of Oracle's REF CURSOR in Postgresql when using JDBC? === **In Oracle I can declare a reference cursor...** TYPE t_spool IS REF CURSOR RETURN spool%ROWTYPE; **...and use it to pass a cursor as the return value...** FUNCTION end_spool RETURN t_spool AS v_spool t_spool; BEGIN COMMIT; OPEN v_spool FOR SELECT * FROM spool WHERE key = g_spool_key ORDER BY seq; RETURN v_spool; END end_spool; **...and then capture it as a result set using JDBC...** private Connection conn; private CallableStatement stmt; private OracleResultSet rset; [...clip...] stmt = conn.prepareCall("{ ? = call " + call + "}"); stmt.registerOutParameter(1, OracleTypes.CURSOR); stmt.execute(); rset = (OracleResultSet)stmt.getObject(1); **What is the equivalent in Postgresql?**
0
[ 2, 98, 25, 14, 4602, 16, 15759, 22, 18, 13, 14057, 29588, 19, 678, 6879, 18, 22402, 76, 568, 487, 43, 7229, 60, 800, 3726, 3726, 13, 1409, 108, 15759, 31, 92, 10123, 21, 2801, 29588, 9, 9, 9, 1409, 1001, 13, 38, 1, 18, 13378, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Automated integration testing a C++ app with a database === I am introducing automated integration testing to a mature application that until now has only been manually tested. The app is Windows based and talks to a MySQL database. What is the best way (including details of any tools recommended) to keep tests independent of each other in terms of the database transactions that will occur? (Modifications to the app source for this particular purpose are not an option.)
0
[ 2, 14904, 8078, 4431, 21, 272, 20512, 4865, 29, 21, 6018, 800, 3726, 3726, 31, 589, 11442, 14904, 8078, 4431, 20, 21, 8615, 3010, 30, 163, 130, 63, 104, 74, 23671, 7631, 9, 14, 4865, 25, 1936, 432, 17, 7837, 20, 21, 51, 18, 2240...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Win32 ShellExecute and a UNC Path === I'm writing a little macro which will fire up a flash presentation. I'm using VBA to do this inside Powerpoint 2007. I am calling the Win32 ShellExecute() routine. Everything works GREAT but when I run this from a location whose path is a UNC path (\\myserver\myfolder\sample.ppt) it does not work. The ShellExecute routine expects 6 arguments, one of which is the path to run it from. I've tried to set this parameter to C:\ as well as using ActivePresentation.Path (which is a UNC path). Neither works. Does anyone know if this ought to work?
0
[ 2, 628, 3125, 3593, 1706, 17194, 591, 17, 21, 16061, 2013, 800, 3726, 3726, 31, 22, 79, 1174, 21, 265, 9069, 56, 129, 535, 71, 21, 4433, 6364, 9, 31, 22, 79, 568, 566, 969, 20, 107, 48, 572, 414, 3132, 624, 9, 31, 589, 2555, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 map XML to C# objects === I have an XML that I want to load to objects, manipulate those objects (set values, read values) and then save those XMLs back. It is important for me to have the XML in the structure (xsd) that I created. One way to do that is to write my own serializer, but is there a built in support for it or open source in C# that I can use?
0
[ 2, 184, 107, 31, 2942, 23504, 20, 272, 5910, 3916, 800, 3726, 3726, 31, 57, 40, 23504, 30, 31, 259, 20, 6305, 20, 3916, 15, 18468, 273, 3916, 13, 5, 3554, 4070, 15, 1302, 4070, 6, 17, 94, 2079, 273, 23504, 18, 97, 9, 32, 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 use stored procedures within a DTS data transformation task? === I have a DTS package with a data transformation task (data pump). I’d like to source the data with the results of a stored procedure that takes parameters, but DTS won’t preview the result set and can’t define the columns in the data transformation task. Has anyone gotten this to work? Caveat: The stored procedure uses two temp tables (and cleans them up, of course)
0
[ 2, 184, 20, 275, 8214, 8876, 363, 21, 13, 43, 38, 18, 1054, 6978, 3005, 60, 800, 3726, 3726, 31, 57, 21, 13, 43, 38, 18, 6030, 29, 21, 1054, 6978, 3005, 13, 5, 18768, 9786, 6, 9, 31, 1, 43, 101, 20, 1267, 14, 1054, 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...
What is your preferred method for moving directory structures around in Subversion? === I have recently run into an issue where I wanted to add a folder to the directory structure of my project that would become the new 'root' directory for the previously housed files. I've been getting help in a [related thread](http://stackoverflow.com/questions/87458/can-you-specify-filenames-using-wildcards-or-regexes-in-the-subversion-mv-comma) but I wanted to put out a more open ended question to see what a best practice might be. Essentially, my situation was that I was working on development and realized that I wanted to have a resources directory that would not be part of the main development thrust but would still be versioned (to hold mockups and such). So I wanted to add a resources directory and an implementation directory, the implementation directory being the new root directory. How would you go about moving all of the previous directory structure into the implementation directory?
0
[ 2, 98, 25, 154, 5981, 2109, 26, 1219, 16755, 3815, 140, 19, 972, 10898, 60, 800, 3726, 3726, 31, 57, 1989, 485, 77, 40, 1513, 113, 31, 417, 20, 3547, 21, 19294, 20, 14, 16755, 1411, 16, 51, 669, 30, 83, 533, 14, 78, 13, 22, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Why does Java's Date and Time API need to be so complicated? === Every time I need to work with date and/or timstamps in Java I always feel like I'm doing something wrong and spend endless hours trying to find a better way of working with the APIs without having to code my own Date and Time utility classes. Here's a couple of annoying things I just ran into: - 0-based months. I realize that best practice is to use Calendar.SEPTEMBER instead of 8, but it's annoying that 8 represents September and not August. - Getting a date without a timestamp. I always need the utility that Zeros out the timestamp portion of the date. - I know there's other issues I've had in the past, but can't recall. Feel free to add more in your responses. So, my question is ... What third party APIs do you use to simplify Java's usage of Date and Time manipulation, if any? Any thoughts on using [Joda][1]? Anyone looked closer at JSR-310 Date and Time API? [1]: http://www.joda.org/
0
[ 2, 483, 630, 8247, 22, 18, 1231, 17, 85, 21, 2159, 376, 20, 44, 86, 8343, 60, 800, 3726, 3726, 352, 85, 31, 376, 20, 170, 29, 1231, 17, 118, 248, 2574, 384, 10158, 18, 19, 8247, 31, 550, 583, 101, 31, 22, 79, 845, 301, 1389,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Advice on handling large data volumes. === So I have a "large" number of "very large" ASCII files of numerical data (gigabytes altogether), and my program will need to process the entirety of it sequentially at least once. Any advice on storing/loading the data? I've thought of converting the files to binary to make them smaller and for faster loading. Should I load everything into memory all at once? If not, is opening what's a good way of loading the data partially? What are some Java-relevant efficiency tips?
0
[ 2, 4978, 27, 7988, 370, 1054, 6127, 9, 800, 3726, 3726, 86, 31, 57, 21, 13, 7, 11312, 7, 234, 16, 13, 7, 7864, 370, 7, 28, 1892, 49, 6488, 16, 16010, 1054, 13, 5, 2234, 1136, 23246, 18, 11206, 6, 15, 17, 51, 625, 129, 376, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How can I tell if a Windows application (command line or GUI) is running on locked workstation or while user is logged out === I have several applications that are part of a suite of tools that various developers at our studio use. these applications are mainly command line apps that open a DOS cmd shell. These apps in turn start up a GUI application that tracks output and status (via sockets) of these command line apps. The command line apps can be started with the user is logged in, when their workstation is locked (they fire off a batch file and then immediately lock their workstaion), and when they are logged out (via a scheduled task). The problems that I have are with the last two cases. If any of these apps fire off when the user is locked or logged out, these command will spawn the GUI windows which tracks the output/status. That's fine, but say the user has their workstation locked -- when they unlock their workstation, the GUI isn't visible. It's running the task list, but it's not visible. The next time these users run some of our command line apps, the GUI doesn't get launched (because it's already running), but because it's not visible on the desktop, users don't see any output. What I'm looking for is a way to tell from my command line apps if they are running behind a locked workstation or when a user is logged out (via scheduled task) -- basically are they running without a user's desktop visible. If I can tell that, then I can simply not start up our GUI and can prevent a lot of problem. I hope that this make sense.
0
[ 2, 184, 92, 31, 494, 100, 21, 1936, 3010, 13, 5, 16239, 293, 54, 9457, 6, 25, 946, 27, 4011, 170, 10839, 54, 133, 4155, 25, 13, 19287, 70, 800, 3726, 3726, 31, 57, 238, 3767, 30, 50, 141, 16, 21, 6160, 16, 4672, 30, 617, 101...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 enter Javascript into a wiki page? === How can I enter scripting (Javascript) into a wiki page?<br><br> I would like to enter a title and, when clicking on that, having displayed under it a small explanation. I usually have done that with javascript, any other idea?
0
[ 2, 184, 20, 2830, 8247, 8741, 77, 21, 13, 17375, 2478, 60, 800, 3726, 3726, 184, 92, 31, 2830, 3884, 68, 13, 5, 1004, 1385, 8741, 6, 77, 21, 13, 17375, 2478, 60, 1, 5145, 1, 5145, 1, 31, 83, 101, 20, 2830, 21, 581, 17, 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...
Programmatically stream audio in Cocoa on the Mac === How do I go about programmatically creating audio streams using Cocoa on the Mac. To make, say a white-noise generator using core frameworks on Mac OSX in Cocoa apps?
0
[ 2, 625, 6732, 1326, 3766, 4023, 19, 24507, 27, 14, 1572, 800, 3726, 3726, 184, 107, 31, 162, 88, 625, 6732, 1326, 2936, 4023, 9464, 568, 24507, 27, 14, 1572, 9, 20, 233, 15, 395, 21, 359, 8, 251, 2628, 15286, 568, 2884, 6596, 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, 0, 0, 0, 0, 0, 0, 0, 0...
How do you deal with NULL values in columns of type boolean in MS Access? === I was wondering if there is a better way to cope with MS-Access' inability to handle NULL for boolean-values other than change the column-data-type to integer.
0
[ 2, 184, 107, 42, 1183, 29, 16203, 4070, 19, 7498, 16, 1001, 9827, 413, 210, 19, 4235, 1381, 60, 800, 3726, 3726, 31, 23, 5712, 100, 80, 25, 21, 574, 161, 20, 11624, 29, 4235, 8, 20604, 22, 16808, 20, 3053, 16203, 26, 9827, 413, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Suggestions for human editable data file format/parsing library === for example, right now I have a roll-my-own solution that uses data files that include blocks like: PlayerCharacter Fighter Hitpoints 25 Strength 10 StartPosition (0, 0, 0) Art Model BigBuffGuy Footprint LargeFootprint end InventoryItem Sword InventoryItem Shield InventoryItem HealthPotion end - human editable (w/ minimal junk characters, ideally) - resilient to errors (fewest 'wow i can't parse anything useful anymore' style errors, and thus i've lost all of the data in the rest of the file) - but still able to identify and report them, of course. My example the only complete failure case is missing 'end's. - nested structure style data - array/list style data - customizable foundation types - fast While my solution works fine for just me, i find introducing people to the file format can be challenging because it's fairly non-standard. Are there any well known solution's that meet/exceed these requirements?
0
[ 2, 18389, 26, 585, 9392, 579, 1054, 3893, 2595, 118, 3574, 18, 68, 1248, 800, 3726, 3726, 26, 823, 15, 193, 130, 31, 57, 21, 3001, 8, 915, 8, 16620, 4295, 30, 2027, 1054, 6488, 30, 468, 5198, 101, 45, 517, 24589, 3580, 770, 3132...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 calculate the axis-aligned bounding box of an ellipse? === If the major axis of the ellipse is vertical or horizontal, it's easy to calculate the bounding box, but what about when the ellipse is rotated? The only way I can think of so far is to calculate all the points around the perimeter and find the max/min x and y values. It seems like there should be a simpler way. If there's a function (in the mathematical sense) that describes an ellipse at an arbitrary angle, then I could use its derivative to find points where the slope is zero or undefined, but I can't seem to find one.
0
[ 2, 184, 107, 42, 18469, 14, 8577, 8, 12740, 4138, 68, 1649, 16, 40, 13, 4223, 1919, 62, 60, 800, 3726, 3726, 100, 14, 394, 8577, 16, 14, 13, 4223, 1919, 62, 25, 7035, 54, 10095, 15, 32, 22, 18, 2010, 20, 18469, 14, 4138, 68, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 transfer or export SQL Server 2005 data to Excel. === I have a simple SQL 'Select' query, and I'd like to dump the results into an Excel file. I'm only able to save as .csv and converting to .xls creates some super ugly output. In any case, as far as I can tell (using Google) this doesn't seem to be so straight forward. Any help would be greatly appreciated.
0
[ 2, 184, 107, 42, 2617, 54, 7487, 4444, 255, 8128, 812, 1054, 20, 20700, 9, 800, 3726, 3726, 31, 57, 21, 1935, 4444, 255, 13, 22, 18, 16964, 22, 25597, 15, 17, 31, 22, 43, 101, 20, 11424, 14, 1736, 77, 40, 20700, 3893, 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...
Resizing an Image without losing any quality === I need to re size an image, but they image quality cannot be effected by this. (C#)
0
[ 2, 10719, 3335, 40, 1961, 366, 2281, 186, 2190, 800, 3726, 3726, 31, 376, 20, 302, 1072, 40, 1961, 15, 47, 59, 1961, 2190, 1967, 44, 1590, 69, 34, 48, 9, 13, 5, 150, 5910, 6, 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...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
How to backup LIF formatted disk? === I have several old 3.5in floppy disks that I would like to backup. My attempts to create an image of the disks have failed. I tried using the UNIX utility dd_rescue, but when the kernel tries to open (/dev/fd0) I get a kernel error "floppy0: probe failed...". I would like an image because some of the floppies are using the LIF file system format. Does anyone have any ideas as to what I should do? HP now Agilent made some tools that could read and write to files on LIF formatted disk. I could use these tools to copy and convert the files to the local disk but not without possibly losing some data in the process. In other words, converting from LIF to some other format back to LIF will lose some information. I just want to backup the raw bytes on the disk and not be concerned with the type of file system.
0
[ 2, 184, 20, 10119, 644, 821, 13, 29850, 8582, 60, 800, 3726, 3726, 31, 57, 238, 315, 203, 9, 264, 108, 28425, 8582, 18, 30, 31, 83, 101, 20, 10119, 9, 51, 3265, 20, 1600, 40, 1961, 16, 14, 8582, 18, 57, 1702, 9, 31, 794, 568...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Why do some conversions from wmv to flv with ffmpeg fail? === Ive been smashing my head with this for a while. I have 2 completely identical .wmv files encoded with wmv3 codec. I put them both through ffmpeg with the following command: /usr/bin/ffmpeg -i file.wmv -ar 44100 -ab 64k -qscale 9 -s 512x384 -f flv file.flv One file converts just fine, and gives me the following output: FFmpeg version SVN-r11070, Copyright (c) 2000-2007 Fabrice Bellard, et al. configuration: --prefix=/usr --incdir=/usr/include/ffmpeg --libdir=/usr/lib64 --shlibdir=/usr/lib64 --mandir=/usr/share/man --arch=x86_64 --extra-cflags=-O2 -g -pipe -Wall -Wp,-D_FORTIFY_SOURCE=2 -fexceptions -fstack-protector --param=ssp-buffer-size=4 -m64 -mtune=generic --enable-liba52 --enable-libfaac --enable-libfaad --enable-libgsm --enable-libmp3lame --enable-libtheora --enable-libvorbis --enable-libxvid --enable-libx264 --enable-pp --enable-pthreads --disable-static --enable-shared --enable-gpl --disable-debug --disable-optimizations --disable-strip libavutil version: 49.5.0 libavcodec version: 51.48.0 libavformat version: 51.19.0 built on Jun 25 2008 09:17:38, gcc: 4.1.2 20070925 (Red Hat 4.1.2-33) Seems stream 1 codec frame rate differs from container frame rate: 1000.00 (1000/1) -> 29.97 (30000/1001) Input #0, asf, from 'ok.wmv': Duration: 00:14:22.3, start: 3.000000, bitrate: 467 kb/s Stream #0.0: Audio: wmav2, 44100 Hz, stereo, 64 kb/s Stream #0.1: Video: wmv3, yuv420p, 320x240 [PAR 0:1 DAR 0:1], 400 kb/s, 29.97 tb(r) Output #0, flv, to 'ok.flv': Stream #0.0: Video: flv, yuv420p, 512x384 [PAR 0:1 DAR 0:1], q=2-31, 200 kb/s, 29.97 tb(c) Stream #0.1: Audio: libmp3lame, 44100 Hz, stereo, 64 kb/s Stream mapping: Stream #0.1 -> #0.0 Stream #0.0 -> #0.1 Press [q] to stop encoding frame=25846 fps=132 q=9.0 Lsize= 88486kB time=862.4 bitrate= 840.5kbits/s video:80827kB audio:6738kB global headers:0kB muxing overhead 1.050642% While another file, fails: FFmpeg version SVN-r11070, Copyright (c) 2000-2007 Fabrice Bellard, et al. configuration: --prefix=/usr --incdir=/usr/include/ffmpeg --libdir=/usr/lib64 --shlibdir=/usr/lib64 --mandir=/usr/share/man --arch=x86_64 --extra-cflags=-O2 -g -pipe -Wall -Wp,-D_FORTIFY_SOURCE=2 -fexceptions -fstack-protector --param=ssp-buffer-size=4 -m64 -mtune=generic --enable-liba52 --enable-libfaac --enable-libfaad --enable-libgsm --enable-libmp3lame --enable-libtheora --enable-libvorbis --enable-libxvid --enable-libx264 --enable-pp --enable-pthreads --disable-static --enable-shared --enable-gpl --disable-debug --disable-optimizations --disable-strip libavutil version: 49.5.0 libavcodec version: 51.48.0 libavformat version: 51.19.0 built on Jun 25 2008 09:17:38, gcc: 4.1.2 20070925 (Red Hat 4.1.2-33) [wmv3 @ 0x3700940d20]Extra data: 8 bits left, value: 0 Seems stream 1 codec frame rate differs from container frame rate: 1000.00 (1000/1) -> 25.00 (25/1) Input #0, asf, from 'bad3.wmv': Duration: 00:06:34.9, start: 4.000000, bitrate: 1666 kb/s Stream #0.0: Audio: 0x0162, 48000 Hz, stereo, 256 kb/s Stream #0.1: Video: wmv3, yuv420p, 512x384 [PAR 0:1 DAR 0:1], 1395 kb/s, 25.00 tb(r) File 'ok.flv' already exists. Overwrite ? [y/N] y Output #0, flv, to 'ok.flv': Stream #0.0: Video: flv, yuv420p, 512x384 [PAR 0:1 DAR 0:1], q=2-31, 200 kb/s, 25.00 tb(c) Stream #0.1: Audio: libmp3lame, 48000 Hz, stereo, 64 kb/s Stream mapping: Stream #0.1 -> #0.0 Stream #0.0 -> #0.1 Unsupported codec (id=0) for input stream #0.0 The only difference I see is with the Input audio codec Working: Stream #0.0: Audio: wmav2, 44100 Hz, stereo, 64 kb/s Not working: Stream #0.0: Audio: 0x0162, 48000 Hz, stereo, 64 kb/s Any ideas?
0
[ 2, 483, 107, 109, 6263, 18, 37, 19312, 710, 20, 398, 8916, 29, 13, 2460, 79, 20427, 7476, 60, 800, 3726, 3726, 5568, 74, 23789, 51, 157, 29, 48, 26, 21, 133, 9, 31, 57, 172, 1524, 6323, 13, 9, 499, 79, 710, 6488, 13665, 29, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do you multiply two 64bit numbers in Assembly? === As the title states, I need to multiply two 64bit numbers in Assembly, or two 16digit hexidecimal numbers. Help please? I'm only allowed to use registers %eax, %ebx, %ecx, %edx, and the stack.
0
[ 2, 184, 107, 42, 26314, 81, 4384, 3326, 2116, 19, 1475, 60, 800, 3726, 3726, 28, 14, 581, 202, 15, 31, 376, 20, 26314, 81, 4384, 3326, 2116, 19, 1475, 15, 54, 81, 347, 23904, 24, 396, 3448, 1892, 3482, 2116, 9, 448, 2247, 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...
C++ unit testing framework === I use the Boost Test framework for my C++ code but there are two problems with it that are probably common to all C++ test frameworks: - There is no way to create automatic test stubs (by extracting public functions from selected classes for example). - You cannot run a single test - you have to run the entire 'suite' of tests (unless you create lots of different test projects I guess). Does anyone know of a better testing framework or am I forever to be jealous of the test tools available to Java/.NET developers?
0
[ 2, 272, 20512, 1237, 4431, 6596, 800, 3726, 3726, 31, 275, 14, 10419, 1289, 6596, 26, 51, 272, 20512, 1797, 47, 80, 50, 81, 1716, 29, 32, 30, 50, 910, 757, 20, 65, 272, 20512, 1289, 6596, 18, 45, 13, 8, 80, 25, 90, 161, 20, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to prevent flickering in ListView when updating a single ListViewItem's text? === All I want is to update an ListViewItem's text whithout seeing any flickering. I've seen some solutions that involve overriding the component's WndProc(): protected override void WndProc(ref Message m) { if (m.Msg == (int)WM.WM_ERASEBKGND) { m.Msg = (int)IntPtr.Zero; } base.WndProc(ref m); } **They say it solves the problem, but in my case It didn't**. I believe this is because I'm using icons on every item.
0
[ 2, 184, 20, 2501, 22399, 19, 968, 4725, 76, 71, 43, 1880, 21, 345, 968, 4725, 2119, 79, 22, 18, 1854, 60, 800, 3726, 3726, 65, 31, 259, 25, 20, 11100, 40, 968, 4725, 2119, 79, 22, 18, 1854, 5558, 24220, 2078, 186, 22399, 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...
When do transactions become more of a burden than a benefit? === Transactional programming is, in this day and age, a staple in modern development. Concurrency and fault-tolerance are critical to an applications longevity and, rightly so, transactional logic has become easy to implement. As applications grow though, it seems that transactional code tends to become more and more burdensome on the scalability of the application, and when you bridge into distributed transactions and mirrored data sets the issues start to become very complicated. I'm curious what seems to be the point, in data size or application complexity, that transactions frequently start becoming the source of issues (causing timeouts, deadlocks, performance issues in mission critical code, etc) which are more bothersome to fix, troubleshoot or workaround than designing a data model that is more fault-tolerant in itself, or using other means to ensure data integrity. Also, what design patterns serve to minimize these impacts or make standard transactional logic obsolete or a non-issue?
0
[ 2, 76, 107, 13147, 533, 91, 16, 21, 9505, 119, 21, 4234, 60, 800, 3726, 3726, 12799, 192, 3143, 25, 15, 19, 48, 208, 17, 348, 15, 21, 12337, 19, 773, 522, 9, 25547, 17, 4173, 8, 262, 1252, 2416, 50, 2507, 20, 40, 3767, 28089, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Why does Rails cache views when hosted on VM and codebase on Samba share === I have the following setup: - Code on my local machine (OS X) shared as a Samba share - A Ubuntu VM running within Parallels, mounts the share Running Rails (either via Mongrel, WEBrick or passenger) in development mode, if I make changes to my views they don't update without me having to kick the server. I've tried switching to an NFS share instead but I get a similar problem. I would assume it was some sort of Samba cache issue but autotest picks up the changes to files instantly.
0
[ 2, 483, 630, 2240, 18, 16522, 4146, 76, 2812, 27, 13, 20147, 17, 1797, 8436, 27, 13, 18, 7483, 1891, 800, 3726, 3726, 31, 57, 14, 249, 18161, 45, 13, 8, 1797, 27, 51, 375, 1940, 13, 5, 759, 993, 6, 2592, 28, 21, 13, 18, 7483...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Castle Windsor: How to specify a constructor paramter from code? === Say I have the following class MyComponent : IMyComponent { public MyComponent(int start_at) {...} } I can register an instance of it with castle windsor via xml as follows <component id="sample" service="NS.IMyComponent, WindsorSample" type="NS.MyComponent, WindsorSample"> <parameters> <start_at>1</start_at > </parameters> </component> How would I go about doing the exact same thing but in code? (Notice, the constructor parameter)
0
[ 2, 1339, 10784, 45, 184, 20, 19077, 21, 6960, 248, 2258, 79, 815, 37, 1797, 60, 800, 3726, 3726, 395, 31, 57, 14, 249, 718, 51, 11103, 218, 2291, 13, 45, 31, 915, 11103, 218, 2291, 13, 1, 317, 51, 11103, 218, 2291, 5, 6391, 79...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
SQL: IF clause within WHERE clause === Is it possible to use an **IF** clause within a **WHERE** clause in MS SQL? Example: WHERE IF IsNumeric(@OrderNumber) = 1 OrderNumber = @OrderNumber ELSE OrderNumber LIKE '%' + @OrderNumber
0
[ 2, 4444, 255, 45, 100, 9040, 363, 113, 9040, 800, 3726, 3726, 25, 32, 938, 20, 275, 40, 13, 1409, 821, 1409, 9040, 363, 21, 13, 1409, 2798, 1409, 9040, 19, 4235, 4444, 255, 60, 823, 45, 113, 100, 25, 6336, 14744, 5, 1, 7861, 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...
Is the Scrum Game at all useful? === Seriously, is this any help with getting your team to understand and comprehend the practice? [Scrum Game][1] [1]: http://www.scrumalliance.org/products/2
0
[ 2, 25, 14, 26562, 250, 35, 65, 4811, 60, 800, 3726, 3726, 4818, 15, 25, 48, 186, 448, 29, 1017, 154, 173, 20, 1369, 17, 21910, 14, 1345, 60, 636, 18, 25241, 250, 500, 2558, 165, 500, 636, 165, 500, 45, 7775, 6903, 6483, 9, 18,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0...
How do I use my own compiler with Nant? === Nant seems very compiler-centric - which is guess is because it's considered a .NET development system. But I know it can be done! I've seen it. The platform we're building on has its own compiler and doesn't use 'cl.exe' for c++. We're building a C++ app on a different platform and would like to override <cl> with our own compiler. Can anyone point me at a way to do that or at least how to set up a target of my own that will use our target platform's compiler?
0
[ 2, 184, 107, 31, 275, 51, 258, 21486, 29, 13, 11028, 60, 800, 3726, 3726, 13, 11028, 2206, 253, 21486, 8, 20829, 13, 8, 56, 25, 2321, 25, 185, 32, 22, 18, 724, 21, 13, 9, 2328, 522, 329, 9, 47, 31, 143, 32, 92, 44, 677, 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...
SVN checkout question === I am about to move to SVN as my RCS of choice (after many years using CVS) and have a basic question... I have a number of shared projects - code that I want to use with lots of different projects. Is it possible to 'link' these shared folders to the projects that need them, so checking out a project will also checkout the shared code? For example, suppose my repository looks like this: root --project1 --project2 --shared --smtp When I checkout project1, I also want to checkout shared and smtp. Back in my CVS days I would of used a Unix symbolic link in one of the project folders, but as my new SVN repository won't necessarily be hosted on a Unix box, I can't do the same.
0
[ 2, 13, 18, 16578, 2631, 1320, 1301, 800, 3726, 3726, 31, 589, 88, 20, 780, 20, 13, 18, 16578, 28, 51, 16462, 18, 16, 1837, 13, 5, 5162, 151, 122, 568, 13, 12732, 18, 6, 17, 57, 21, 2125, 1301, 9, 9, 9, 31, 57, 21, 234, 16,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Anyone have sample code for a UserControl with pager controls to be used in a GridView's PagerTemplate? === I've got several Gridviews in my application in which I use a custom PagerTemplate. I'd like to turn this custom template into a UserControl so that I don't need to replicate the same logic in multiple pages. I'm pretty sure that such a thing is possible, but I'm unsure of how exactly to wire the UserControl to the Gridview's events, and what interfaces my control may need to implement. I'm using ASP 2.0 frameworks. Has anyone done something like this? And if so, do you have any sample code for your usercontrol? Thanks in advance.
0
[ 2, 1276, 57, 5717, 1797, 26, 21, 4155, 12898, 29, 2478, 139, 8671, 20, 44, 147, 19, 21, 7354, 4725, 22, 18, 2478, 139, 9577, 6554, 60, 800, 3726, 3726, 31, 22, 195, 330, 238, 7354, 4725, 18, 19, 51, 3010, 19, 56, 31, 275, 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...
Using DateAdd in umbraco xslt to display next year's date === I'm trying to display the date for a year from now in an xslt file using umbraco like so: <xsl:variable name="now" select="umbraco.library:CurrentDate()"/> <xsl:value-of select="umbraco.library:DateAdd($now, 'year', 1)"/> The value-of tag outputs today's date. How can I get the DateAdd to add a year to the current date?
0
[ 2, 568, 1231, 14854, 19, 13, 723, 2559, 716, 993, 18, 255, 38, 20, 3042, 328, 159, 22, 18, 1231, 800, 3726, 3726, 31, 22, 79, 749, 20, 3042, 14, 1231, 26, 21, 159, 37, 130, 19, 40, 993, 18, 255, 38, 3893, 568, 13, 723, 2559,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 best to make the selected date of an ASP.Net Calendar control available to javascript? === Like the title says. Most controls are pretty simple, but the calendar requires more than just a simple _document.getElementById().value_.
0
[ 2, 184, 246, 20, 233, 14, 1704, 1231, 16, 40, 28, 306, 9, 2328, 7036, 569, 904, 20, 8247, 8741, 60, 800, 3726, 3726, 101, 14, 581, 898, 9, 127, 8671, 50, 1772, 1935, 15, 47, 14, 7036, 4781, 91, 119, 114, 21, 1935, 13, 1, 281...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Building a Table Dependency Graph With A Recurssive Query === I am trying to build a dependency graph of tables based on the foreign keys between them. This graph needs to start with an arbitrary table name as its root. I could, given a table name look up the tables that reference it using the all_constraints view, then look up the tables that reference them, and so on, but this would be horrible inefficient. I wrote a recursive query that does this for all tables, but when I add: START WITH Table_Name=:tablename It doesn't return the entire tree.
0
[ 2, 353, 21, 859, 26835, 7210, 29, 21, 26604, 18, 18, 1284, 25597, 800, 3726, 3726, 31, 589, 749, 20, 1895, 21, 26835, 7210, 16, 7484, 432, 27, 14, 1228, 5534, 128, 105, 9, 48, 7210, 2274, 20, 799, 29, 40, 17237, 859, 204, 28, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Control which columns become primary keys with Microsoft Access ODBC link to Oracle === When you create a Microsoft Access 2003 link to an Oracle table using Oracle's ODBC driver, you are sometimes asked to state which columns are the primary key(s). I would like to know how to change that initial assignment, or even how to get Access/ODBC to forget the assignment. In my limited testing I wonder if the assignment isn't cached by the ODBC driver itself. The columns I initial chose are not correct.
0
[ 2, 569, 56, 7498, 533, 1256, 5534, 29, 7099, 1381, 12340, 7229, 3508, 20, 15759, 800, 3726, 3726, 76, 42, 1600, 21, 7099, 1381, 973, 3508, 20, 40, 15759, 859, 568, 15759, 22, 18, 12340, 7229, 2425, 15, 42, 50, 1030, 411, 20, 146, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Java jdb remote debugging command line tool === anyone have any experience using this? if so, is it worth while?
0
[ 2, 8247, 487, 9007, 5388, 121, 16254, 2762, 1202, 293, 5607, 800, 3726, 3726, 1276, 57, 186, 1496, 568, 48, 60, 100, 86, 15, 25, 32, 2715, 133, 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...
[ 1, 1, 1, 1, 1, 1, 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...
Game Engine Scripting Languages === I am trying to build out a useful 3d game engine out of the Ogre3d rendering engine for mocking up some of the ideas i have come up with and have come to a bit of a crossroads. There are a number of scripting languages that are available and i was wondering if there were one or two that were vetted and had a proper following. LUA and Squirrel seem to be the more vetted, but im open to any and all. Optimally it would be best if there were a compiled form for the language for distribution and ease of loading.
0
[ 2, 250, 1406, 3884, 68, 2556, 800, 3726, 3726, 31, 589, 749, 20, 1895, 70, 21, 4811, 203, 43, 250, 1406, 70, 16, 14, 7096, 99, 240, 43, 15307, 1406, 26, 18446, 71, 109, 16, 14, 3478, 31, 57, 340, 71, 29, 17, 57, 340, 20, 21,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What is the status of POSIX asynchronous I/O (AIO)? === There are pages scattered around the web that describe POSIX AIO facilities in varying amounts of detail. None of them are terribly recent. It's not clear what, exactly, they're describing. For example, the "official" (?) [web site for Linux kernel asynchronous I/O support here][1] says that sockets don't work, but the "aio.h" manual pages on my Ubuntu 8.04.1 workstation all seem to imply that it works for arbitrary file descriptors. Then there's [another project that seems to work at the library layer][2] with even less documentation. I'd like to know: - What is the purpose of POSIX AIO? Given that the most obvious example of an implementation I can find says it doesn't support sockets, the whole thing seems weird to me. Is it just for async disk I/O? If so, why the hyper-general API? If not, why is disk I/O the first thing that got attacked? - Where are there example *complete* POSIX AIO programs that I can look at? - Does anyone actually use it, for real? - What platforms support POSIX AIO? What parts of it do they support? Does anyone really support the implied "Any I/O to any FD" that `<aio.h>` seems to promise? The other multiplexing mechanisms available to me are perfectly good, but the random fragments of information floating around out there have made me curious. [1]: http://lse.sourceforge.net/io/aio.html [2]: http://www.bullopensource.org/posix/
0
[ 2, 98, 25, 14, 1782, 16, 2353, 6742, 21, 16023, 1291, 31, 118, 111, 13, 5, 58, 1963, 6, 60, 800, 3726, 3726, 80, 50, 4434, 7471, 140, 14, 2741, 30, 4996, 2353, 6742, 21, 1963, 2450, 19, 9852, 8545, 16, 6110, 9, 2369, 16, 105, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Code reviews on the web for PHP and JavaScript code === What are the best places for freelancers or small companies to get code reviewed for PHP and JavaScript? Forums are an option, but are there any sites dedicated specifically to code reviews?
0
[ 2, 1797, 2783, 27, 14, 2741, 26, 13, 26120, 17, 8247, 8741, 1797, 800, 3726, 3726, 98, 50, 14, 246, 1489, 26, 16043, 1224, 54, 284, 1532, 20, 164, 1797, 10072, 26, 13, 26120, 17, 8247, 8741, 60, 5691, 18, 50, 40, 4255, 15, 47, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
ColdFusion Template Request count optimization === In ColdFusion, under Request Tuning in the administrator, how do I determine what is an optimal number (or at least a good guess) for the Maximum Number of Simultaneous Template Requests? Environment:<br/> CF8 Standard<br/> IIS 6<br/> Win2k3<br/> SQL2k5 on a separate box
0
[ 2, 1191, 9818, 22894, 3772, 2468, 21597, 800, 3726, 3726, 19, 1191, 9818, 15, 131, 3772, 19253, 19, 14, 8890, 15, 184, 107, 31, 3746, 98, 25, 40, 17586, 234, 13, 5, 248, 35, 639, 21, 254, 2321, 6, 26, 14, 2979, 234, 16, 4861, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Setting Page Title from a SWF === Is it possible to set the title of a page when it's simply a loaded SWF?
0
[ 2, 2697, 2478, 581, 37, 21, 13, 18, 15263, 800, 3726, 3726, 25, 32, 938, 20, 309, 14, 581, 16, 21, 2478, 76, 32, 22, 18, 1659, 21, 8572, 13, 18, 15263, 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...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Tool/framework for automated web app testing in Google Chrome browser? === Is an opensource/commercial tool/framework, available for automated web app testing in Google Chrome browser on Windows XP / Vista? ( An alpha/beta Tool is also OK) Thanks
0
[ 2, 5607, 118, 8361, 3783, 26, 14904, 2741, 4865, 4431, 19, 8144, 13, 12985, 16495, 60, 800, 3726, 3726, 25, 40, 368, 12097, 118, 22547, 5607, 118, 8361, 3783, 15, 904, 26, 14904, 2741, 4865, 4431, 19, 8144, 13, 12985, 16495, 27, 193...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Javascript and why capital letters sometimes work and sometimes don't. === In notepad++, I was writing a javascript file, and something didn't work: an alert had to be shown when a button was clicked, but it wasn't working. I has used the auto-complete plugin provided with Notepad++, which presented me with "onClick". When I changed the capital C to a small c, it did work. So first of all, when looking at the functions in the auto-completion, I noticed a lot of functions using capitals. But when you change getElementById to getelementbyid, you also get an error... And to make matters worse, my handbook from school writes all the stuff with capital letters but the solutions are all done in small letters. So what is it with Javascript and it's selective nature towards which functions can have capital letters in them and which can't?
0
[ 2, 8247, 8741, 17, 483, 1057, 2516, 1030, 170, 17, 1030, 221, 22, 38, 9, 800, 3726, 3726, 19, 1945, 8240, 20512, 15, 31, 23, 1174, 21, 8247, 8741, 3893, 15, 17, 301, 223, 22, 38, 170, 45, 40, 7863, 41, 20, 44, 1721, 76, 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...
endian-ness of new macs - are all pc platforms the same now? === Does the change of macs over to intel chips mean we're done with the bit twiddling on numbers in binary resources for cross platform data distributions? Is that the last of this problem or are there some other platforms I'm not aware of?
0
[ 2, 241, 806, 8, 720, 16, 78, 1572, 18, 13, 8, 50, 65, 5168, 6843, 14, 205, 130, 60, 800, 3726, 3726, 630, 14, 753, 16, 1572, 18, 84, 20, 14635, 12602, 884, 95, 22, 99, 677, 29, 14, 1142, 22810, 43, 11371, 27, 2116, 19, 14171...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What would you consider to be, the ultimate home-school curriculum for today’s software developer? === Lately, there is more and more talk about how university may be a waste of money for so many people, depending upon the skills they want to learn. Software development is one of them. It is hard to argue with the fact that a very motivated person, armed with a handful of books, would be able to learn the equivalent or more of what a BS degree would offer, when it comes to Computer Science. So, pretending you were going to home school yourself, or some of your employees (proven hard-working, intelligent High School graduates), on the art of software development, what would be the curriculum?
0
[ 2, 98, 83, 42, 3563, 20, 44, 15, 14, 6612, 213, 8, 7535, 8880, 26, 786, 1, 18, 2306, 10058, 60, 800, 3726, 3726, 10434, 15, 80, 25, 91, 17, 91, 930, 88, 184, 155, 123, 44, 21, 4600, 16, 875, 26, 86, 151, 148, 15, 4758, 685...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How can you overcome the svn 'out of date' error? === I've been attempting move a directory structure from one location to another in Subversion and I've run up against a brick wall which is the `Item '*' is out of date` commit error. I have the latest version checked out (so far as I can tell), svn st -u turns up no differences other than the mv commands, I have no idea where else to look. Thanks in advance!
0
[ 2, 184, 92, 42, 9059, 14, 13, 18, 16578, 13, 22, 1320, 16, 1231, 22, 7019, 60, 800, 3726, 3726, 31, 22, 195, 74, 6314, 780, 21, 16755, 1411, 37, 53, 1474, 20, 226, 19, 972, 10898, 17, 31, 22, 195, 485, 71, 149, 21, 3529, 769...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
If you could recommend only one blog on software testing, which one would it be? === I found a question here about blogs on software development, but I would like to know which blogs on software testing this community reads. If you just have to recommend more than one blog, post each one in separate answer, so others can vote on specific blog. :) Thanks!
4
[ 2, 100, 42, 110, 12360, 104, 53, 8146, 27, 2306, 4431, 15, 56, 53, 83, 32, 44, 60, 800, 3726, 3726, 31, 216, 21, 1301, 235, 88, 8146, 18, 27, 2306, 522, 15, 47, 31, 83, 101, 20, 143, 56, 8146, 18, 27, 2306, 4431, 48, 514, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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#: Is Implicit Arraylist assignment possible? === I'd like to populate an arraylist by specifying a list of values just like I would an integer array, but am unsure of how to do so without repeated calls to the "add" method. For example, I want to assign { 1, 2, 3, "string1", "string2" } to an arraylist. I know for other arrays you can make the assignment like: int[] IntArray = {1,2,3}; Is there a similar way to do this for an arraylist? I tried the addrange method but the curly brace method doesn't implement the ICollection interface.
0
[ 2, 272, 5910, 45, 25, 20290, 7718, 5739, 8427, 938, 60, 800, 3726, 3726, 31, 22, 43, 101, 20, 1675, 12383, 40, 7718, 5739, 34, 19077, 68, 21, 968, 16, 4070, 114, 101, 31, 83, 40, 13820, 7718, 15, 47, 589, 13815, 16, 184, 20, 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...
Beginner question about XCode 3.1.1 and static libraries === I'm an experienced VS.NET user and trying to get up and running on XCode 3.1.1. Here's what I'm trying to accomplish: I'd like a static library ("Lib") to have its own xcodeproj file. I'd an executable application ("App") that makes use of Lib to reference Lib's xcodeproj file so that changes to Lib cause App to relink. Ideally, I'd like to be able to edit Lib's source files inside App's xcode workspace so I don't have to task around all the time to make changes. I figured out from the online help that I can simply drag the static lib xcodeproj in to my app's project and it gets the reference. I see that once my static lib xcodeproj is in my app's project, I can simply drag it to the App's target and it understands that App depends on Lib. This seems like the right path, but things aren't quite working the way I'd like yet. Here are my questions: 1. It seems that simply having App depend on Lib doesn't cause App to link with Lib. It seems that I have to explicitly drag libLib.a from the Lib folder into App's "Link Binary With Libraries" build stage. In VS.NET, simply specifying the project as a solution dependency adds it to the link line. I just want to make sure I'm not missing anything. 2. When I have App open in XCode and I drag Lib.xcodeproj into it, I don't get any of Lib's source files there. I only get libLib.a under the "Lib.xcodeproj" folder. In VS.NET, I can edit Lib's source files right there and rebuild it, etc... but with this approach in XCode, changes to Lib.cpp don't cause Lib to rebuild when I rebuild App. Ideally, I'd get all of Lib's source files and targets to show up when I drag Lib.xcodeproj into App. Is there any way of doing this? Thanks in advance for any responses!
0
[ 2, 26931, 1301, 88, 993, 9375, 203, 9, 165, 9, 165, 17, 12038, 8649, 800, 3726, 3726, 31, 22, 79, 40, 3882, 4611, 9, 2328, 4155, 17, 749, 20, 164, 71, 17, 946, 27, 993, 9375, 203, 9, 165, 9, 165, 9, 235, 22, 18, 98, 31, 22...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Sql Server 2005 error handling - inner exception === In C# you can get the original error and trace the execution path (stack trace) using the inner exception that is passed up. I would like to know how this can be achieved using the error handling try/catch in sql server 2005 when an error occurs in a stored procedure nested 2 or 3 levels deep. I am hoping that functions like ERROR\_MESSAGE(), ERROR\_LINE(), ERROR\_PROCEDURE(), ERROR\_SEVERITY() can be easily passed up the line so that the top level stored proc can access them.
0
[ 2, 4444, 255, 8128, 812, 7019, 7988, 13, 8, 3754, 5391, 800, 3726, 3726, 19, 272, 5910, 42, 92, 164, 14, 501, 7019, 17, 5565, 14, 5769, 2013, 13, 5, 25325, 5565, 6, 568, 14, 3754, 5391, 30, 25, 1100, 71, 9, 31, 83, 101, 20, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Unit test for randomized data === I ran across this situation this afternoon, so I thought I'd ask what you guys do. We have a randomized password generator for user password resets and while fixing a problem with it, I decided to move the routine into my (slowly growing) test harness. I want to test that passwords generated conform to the rules we've set out, but of course the results of the function will be randomized (or, well, pseudo-randomized). What would you guys do in the unit test? Generate a bunch of passwords, check they all pass and consider that good enough?
0
[ 2, 1237, 1289, 26, 5477, 1333, 1054, 800, 3726, 3726, 31, 717, 464, 48, 1858, 48, 3435, 15, 86, 31, 289, 31, 22, 43, 1349, 98, 42, 2776, 107, 9, 95, 57, 21, 5477, 1333, 20884, 15286, 26, 4155, 20884, 23422, 18, 17, 133, 20047, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Make apache automatically strip off the www.? === For various reasons, such as cookies, SEO, and to keep things simple, I would like to make apache automatically redirect any requests for http://www.foobar.com/anything to http://foobar.com/anything. The best I could come up with is a mod_rewrite-based monstrosity, is there some easy simple way to tell it "Redirect all requests for domain ABC to XYZ"? PS: I found [this somewhat related question][1], but it's for IIS and does the opposite of what I want. Also it's still complex. [1]: http://stackoverflow.com/questions/50931/redirecting-non-www-url-to-www
0
[ 2, 233, 17140, 7499, 4998, 168, 14, 13, 6483, 9, 60, 800, 3726, 3726, 26, 617, 2932, 15, 145, 28, 19396, 15, 13, 18, 3894, 15, 17, 20, 643, 564, 1935, 15, 31, 83, 101, 20, 233, 17140, 7499, 302, 14706, 186, 12279, 26, 7775, 69...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Does the unmodifiable wrapper for java collections make them thread safe? === I need to make an ArrayList of ArrayLists thread safe. I also cannot have the client making changes to the collection. Will the unmodifiable wrapper make it thread safe or do I need two wrappers on the collection?
0
[ 2, 630, 14, 367, 13670, 25372, 28051, 26, 8247, 5721, 233, 105, 9322, 1834, 60, 800, 3726, 3726, 31, 376, 20, 233, 40, 7718, 5739, 16, 7718, 5739, 18, 9322, 1834, 9, 31, 67, 1967, 57, 14, 6819, 544, 1693, 20, 14, 1206, 9, 129, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 a .msi file install itself (presumably via a Custom Action)? === I would like to insall my MSI via my MSI. Obviously I can't include the MSI as a file in my Media (chicken and egg scenario), so I believe it would have to be done via a Custom Action before the install process, adding the original MSI to the MSI database on the fly. Can this be done and if so how? I am familiar with (and using) Custom Actions (managed and unmanaged, via DTF and otherwise).
0
[ 2, 92, 21, 13, 9, 79, 18, 49, 3893, 16146, 1145, 13, 5, 11973, 723, 4801, 1197, 21, 5816, 1028, 6, 60, 800, 3726, 3726, 31, 83, 101, 20, 19, 18, 1233, 51, 4235, 49, 1197, 51, 4235, 49, 9, 4409, 31, 92, 22, 38, 468, 14, 423...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What's the best method to enable or disable a feature in a .net desktop application === It can be either at compile time or at run-time using a config file. Is there a more elegant way than simple (and many) if statements? I am targeting especially sets of UI controls that comes for a particular feature.
0
[ 2, 98, 22, 18, 14, 246, 2109, 20, 9240, 54, 1460, 579, 21, 1580, 19, 21, 13, 9, 2328, 17404, 3010, 800, 3726, 3726, 32, 92, 44, 694, 35, 26561, 85, 54, 35, 485, 8, 891, 568, 21, 13, 14093, 2816, 3893, 9, 25, 80, 21, 91, 11...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
MOSS 2007 SSL error when configuring Search Settings === We’re getting the following error message when we click on “Search Settings” for a Shared Services Provider: “Authentication failed because the remote party has closed the transport stream.” This is a new server environment with two web front ends, one database server, and one index server, all running Windows 2003 x64. Does anyone have any thoughts related to if this could be related to 64-bit, or what could be causing the error. Here are the full details from ULS: >09/17/2008 16:30:34.13 w3wp.exe (0x0E84) 0x030C Search Server Common MS Search Administration 86x4 High Configuring the Search Application web service Url to 'https://mushni-sptwb04q:56738/Shared%20Services%20Portal/Search/SearchAdmin.asmx'. >09/17/2008 16:30:34.14 w3wp.exe (0x0E84) 0x030C Search Server Common MS Search Administration 86ze High Exception caught in Search Admin web-service proxy (client). System.Net.WebException: The underlying connection was closed: An unexpected error occurred on a send. ---> System.IO.IOException: Authentication failed because the remote party has closed the transport stream. at System.Net.Security.SslState.StartReadFrame(Byte[] buffer, Int32 readBytes, AsyncProtocolRequest asyncRequest) at System.Net.Security.SslState.StartReceiveBlob(Byte[] buffer, AsyncProtocolRequest asyncRequest) at System.Net.Security.SslState.ForceAuthentication(Boolean receiveFirst, Byte[] buffer, AsyncProtocolRequest asyncRequest) at System.Net.Security.SslState.ProcessAuthentication(LazyAsyncResult lazyResult) at System.Threading.ExecutionContext.runTryCode(Object userData) at System.Runtime.Co... >09/17/2008 16:30:34.14* w3wp.exe (0x0E84) 0x030C Search Server Common MS Search Administration 86ze High ...mpilerServices.RuntimeHelpers.ExecuteCodeWithGuaranteedCleanup(TryCode code, CleanupCode backoutCode, Object userData) at System.Threading.ExecutionContext.Run(ExecutionContext executionContext, ContextCallback callback, Object state) at System.Net.TlsStream.ProcessAuthentication(LazyAsyncResult result) at System.Net.TlsStream.Write(Byte[] buffer, Int32 offset, Int32 size) at System.Net.PooledStream.Write(Byte[] buffer, Int32 offset, Int32 size) at System.Net.ConnectStream.WriteHeaders(Boolean async) --- End of inner exception stack trace --- at System.Web.Services.Protocols.WebClientProtocol.GetWebResponse(WebRequest request) at System.Web.Services.Protocols.HttpWebClientProtocol.GetWebResponse(WebRequest request) at System.Web.Services.Protocols.SoapHt... >09/17/2008 16:30:34.14* w3wp.exe (0x0E84) 0x030C Search Server Common MS Search Administration 86ze High ...tpClientProtocol.Invoke(String methodName, Object[] parameters) at Microsoft.Office.Server.Search.Administration.SearchWebServiceProxy.RunWithSoapExceptionHandling[T](String methodName, Object[] parameters)
0
[ 2, 8188, 624, 13, 18, 18, 255, 7019, 76, 1065, 13549, 68, 2122, 12410, 800, 3726, 3726, 95, 1, 99, 1017, 14, 249, 7019, 2802, 76, 95, 10840, 27, 13, 1, 25136, 12410, 1, 26, 21, 2592, 687, 11747, 45, 13, 1, 1346, 2504, 1786, 85...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Coding for the Cowon D2 === Is there a way to code for the Cowon D2 that does not involve flash? Please provide links to the tools, and list out the process.
0
[ 2, 13, 15458, 26, 14, 4539, 218, 13, 43, 135, 800, 3726, 3726, 25, 80, 21, 161, 20, 1797, 26, 14, 4539, 218, 13, 43, 135, 30, 630, 52, 8847, 4433, 60, 2247, 1181, 6271, 20, 14, 4672, 15, 17, 968, 70, 14, 953, 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...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
How many game updates per second? === What update rate should I run my fixed-rate game logic at? I've used 60 updates per second in the past, but that's hard because it's not an even number of updates per second (16.666666). My current games uses 100, but that seems like overkill for most things.
0
[ 2, 184, 151, 250, 16779, 416, 153, 60, 800, 3726, 3726, 98, 11100, 1684, 378, 31, 485, 51, 3535, 8, 5487, 250, 7085, 35, 60, 31, 22, 195, 147, 2083, 16779, 416, 153, 19, 14, 640, 15, 47, 30, 22, 18, 552, 185, 32, 22, 18, 52,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 guarentee the ASPNET user gets assigned the correct default directory rights.? === I seem to make this mistake everytime I set up a new development box. Is there a way to make sure you don't have to manually assign rights for the ASPNET user? I usually install .Net then IIS, then Visual Studio but it seems I still have to manually assign rights to the ASPNET user to get everything running correctly. Is my install order wrong?
0
[ 2, 184, 107, 42, 10658, 8993, 2851, 14, 28, 306, 2328, 4155, 3049, 2467, 14, 4456, 12838, 16755, 1096, 9, 60, 800, 3726, 3726, 31, 2260, 20, 233, 48, 5643, 352, 891, 31, 309, 71, 21, 78, 522, 1649, 9, 25, 80, 21, 161, 20, 233,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Bulked Flows Library for C# === I am working on a project with peek performance requirements, so we need to bulk several operations (for example persisting the data to a database) for efficiency. However, I want our code to maintain an easy to understand flow, like: input = Read(); parsed = Parse(input); status = Persist(parsed); ReportSuccess(status); (The feature I'm looking for here is automatically have Persist() happen in bulks, but behave to its user as if it's synchronous). I looked into flow-based programming, with which I am not highly familiar. I saw one library for fbp in C# [here][1], and played a bit with Microsoft's Workflow Foundation, but my impression is that both are overkill for what I need. What would you use to implement a bulked flow behavior? [1]: http://www.jpaulmorrison.com/fbp/
0
[ 2, 7238, 69, 5188, 1248, 26, 272, 5910, 800, 3726, 3726, 31, 589, 638, 27, 21, 669, 29, 14918, 956, 4786, 15, 86, 95, 376, 20, 7238, 238, 1311, 13, 5, 1106, 823, 22084, 68, 14, 1054, 20, 21, 6018, 6, 26, 7836, 9, 207, 15, 31...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How can I use NAnt to compile WPF controls === I have a WPF project and I'm trying to setup a NAnt build script for it. The problem is that when it tries to compile the WPF controls, the .g.cs files are not being generated as they are when building from within Visual Studio. I'm using the csc build task. From my reading it seems that when Visual Studio builds, it performs a pre-build step that generates the .g.cs files. Is it possible to do this via NAnt? I found this post about WPF, .g.cs and baml: [http://stuff.seans.com/2008/07/13/hello-wpf-world-part-2-why-xaml/][1] Any ideas? Thanks in advance. [1]: http://stuff.seans.com/2008/07/13/hello-wpf-world-part-2-why-xaml/
0
[ 2, 184, 92, 31, 275, 13, 11028, 20, 26561, 619, 7721, 8671, 800, 3726, 3726, 31, 57, 21, 619, 7721, 669, 17, 31, 22, 79, 749, 20, 18161, 21, 13, 11028, 1895, 3884, 26, 32, 9, 14, 1448, 25, 30, 76, 32, 3919, 20, 26561, 14, 61...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Will a VS2008 setup project update Net 3.5 SP1? === I just started using the WPF WebBrowser that is included in Net 3.5 SP1. I built my setup project (which I have been using prior to moving to 3.5 SP1) and installed it on a test machine but the WebBrowser was not available. What must I do to be sure that the setup.exe/msi combination checks for and installs SP1?
0
[ 2, 129, 21, 4611, 2753, 18161, 669, 11100, 4275, 203, 9, 264, 3782, 165, 60, 800, 3726, 3726, 31, 114, 373, 568, 14, 619, 7721, 10192, 5417, 4104, 30, 25, 506, 19, 4275, 203, 9, 264, 3782, 165, 9, 31, 392, 51, 18161, 669, 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 are the Principles of system architecture? === 1. Overload protection 2. Fail safe, clustering 3. Scalability 4. Software upgradable platform 5. Data consistency Something missing?
0
[ 2, 98, 50, 14, 5624, 16, 329, 2607, 60, 800, 3726, 3726, 137, 9, 84, 8294, 2057, 172, 9, 7476, 1834, 15, 7460, 68, 203, 9, 18957, 4091, 268, 9, 2306, 71, 7691, 579, 2452, 331, 9, 1054, 22061, 301, 2863, 60, 3, 0, 0, 0, 0, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
Dysfunctional Teams === A little bit of a strage topic I have to admit but how do you deal with having some people on your team that: - Never listen to others ideas - Don't preform ect I am a fairly new to working in groups and have already learned to deal with different personalities and attitudes, How do you do it?
0
[ 2, 22880, 192, 952, 800, 3726, 3726, 21, 265, 1142, 16, 21, 5428, 834, 8303, 31, 57, 20, 5251, 47, 184, 107, 42, 1183, 29, 452, 109, 148, 27, 154, 173, 30, 45, 13, 8, 243, 3834, 20, 654, 3478, 13, 8, 221, 22, 38, 782, 4190, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 get all file attributes including author, title, mp3 tags, etc, in one sweep === I would like to write all attributes of my files in folder to a csv file.
0
[ 2, 184, 20, 164, 65, 3893, 13422, 215, 1314, 15, 581, 15, 4628, 240, 3383, 18, 15, 2722, 15, 19, 53, 9761, 800, 3726, 3726, 31, 83, 101, 20, 2757, 65, 13422, 16, 51, 6488, 19, 19294, 20, 21, 272, 18, 710, 3893, 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...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Any other tools/plugins like VisualAssist that will change my life (MSVS)? === I was introduced to VisualAssist a few years ago and for me there's no going back. Are there any other tools I'm missing out on?
0
[ 2, 186, 89, 4672, 118, 18527, 17040, 101, 3458, 11464, 384, 30, 129, 753, 51, 201, 13, 5, 79, 18, 710, 18, 6, 60, 800, 3726, 3726, 31, 23, 1277, 20, 3458, 11464, 384, 21, 310, 122, 1464, 17, 26, 55, 80, 22, 18, 90, 228, 97, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
When using an ORM, how to safely send loaded entities across the tiers === When a system has N tiers, and when using an ORM, how do you send loaded entities across the tiers ? Do you use DTO ? When DTO are not used and the entities are directly sent, how do you protect againt the uninitialized lazy loaded relationship errors ? Note : this is not a "should N tiers be used ?" question. I assume that the system already has N tiers.
0
[ 2, 76, 568, 40, 54, 79, 15, 184, 20, 9817, 2660, 8572, 12549, 464, 14, 7197, 18, 800, 3726, 3726, 76, 21, 329, 63, 13, 103, 7197, 18, 15, 17, 76, 568, 40, 54, 79, 15, 184, 107, 42, 2660, 8572, 12549, 464, 14, 7197, 18, 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...
Setting Environment Variables for Mercurial Hook === I am trying to call a shell script that sets a bunch of environment variables on our server from a mercurial hook. The shell script gets called fine when a new changegroup comes in, but the environment variables aren't carrying over past the call to the shell script. My hgrc file on the respository looks like this: <pre><code> [hooks] changegroup = shell_script changegroup.env = env </pre></code> I can see the output of the shell script, and then the output of the env command, but the env command doesn't include the new environment variables set by the shell script. I have verified that the shell script works fine when run by itself but when run in the context of the mercurial hook it does not properly set the environment. Thank you guys for any help you can provide.
0
[ 2, 2697, 2307, 12157, 26, 9046, 3594, 192, 5559, 800, 3726, 3726, 31, 589, 749, 20, 645, 21, 3593, 3884, 30, 3415, 21, 7653, 16, 2307, 12157, 27, 318, 8128, 37, 21, 9046, 3594, 192, 5559, 9, 14, 3593, 3884, 3049, 227, 1123, 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 you convert your office to build automation? === The title should say it all, then I can solidify 2 more ticks on the Joel test. I've implemented build automation using a makefile and a python script already and I understand the basics and the options. But how can I, the new guy who reads the blogs, convince my cohort of its inherent efficacy?
0
[ 2, 184, 107, 42, 8406, 154, 488, 20, 1895, 23217, 60, 800, 3726, 3726, 14, 581, 378, 395, 32, 65, 15, 94, 31, 92, 2941, 8612, 172, 91, 8809, 18, 27, 14, 8873, 1289, 9, 31, 22, 195, 6807, 1895, 23217, 568, 21, 233, 16877, 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...
Finding differences between versions of a Java class file === I am working with a large Java web application from a commercial vendor. I've received a patch from the vendor in the form of a new .class file that is supposed to resolve an issue we're having with the software. In the past, applying patches from this vendor have caused new and completely unrelated problems to arise, so I want to understand the change being made even before applying it to a test instance. I've got the two .class files side by side, the one extracted from the currently running version and the updated one from the vendor. [JAD][1] and [JReversePro][2] both decompile and disassemble (respectively) the two versions to the same output. However, the .class files are different sizes and I see differences in the output of `od -x`, so they're definitely not identical. What other steps could I take to determine the difference between the two files? [1]: http://www.kpdus.com/jad.html [2]: http://jreversepro.blogspot.com/
0
[ 2, 3007, 4921, 128, 3281, 16, 21, 8247, 718, 3893, 800, 3726, 3726, 31, 589, 638, 29, 21, 370, 8247, 2741, 3010, 37, 21, 1439, 23510, 9, 31, 22, 195, 420, 21, 7331, 37, 14, 23510, 19, 14, 505, 16, 21, 78, 13, 9, 1898, 3893, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Stored Procs - Best way to pass messages back to user application === I'd like know what people think about using RAISERROR in stored procedures to pass back user messages (i.e. business related messages, not error messages) to the application. Some of the senior developers in my firm have been using this method and catching the SqlException in our C# code to pick up the messages and display them to the user. I am not happy with this method and would like to know how other people deal with these types of user messages from stored procs.
0
[ 2, 8214, 13, 15617, 18, 13, 8, 246, 161, 20, 1477, 7561, 97, 20, 4155, 3010, 800, 3726, 3726, 31, 22, 43, 101, 143, 98, 148, 277, 88, 568, 6623, 18, 29992, 19, 8214, 8876, 20, 1477, 97, 4155, 7561, 13, 5, 49, 9, 62, 9, 508, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...