unified_texts
stringlengths
32
30.1k
OpenStatus_id
int64
0
4
input_ids
list
token_type_ids
list
attention_mask
list
Machine Learning, AI, and Soft Computing === What is the difference between these three heavily related fields? Is there one specific whole they are all a part of (aside from CS)?
0
[ 2, 1940, 2477, 15, 21, 49, 15, 17, 1856, 10626, 800, 3726, 3726, 98, 25, 14, 2841, 128, 158, 132, 2991, 1597, 2861, 60, 25, 80, 53, 1903, 979, 59, 50, 65, 21, 141, 16, 13, 5, 58, 1416, 37, 272, 18, 6, 60, 3, 0, 0, 0, 0, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
I'm looking for a pythonic way to insert a space before capitol letters. === I've got a file whose format I'm altering via a python script. I have several camel cased strings in this file where I just want to insert a single space before the capitol letter - so "WordWordWord" becomes "Word Word Word". My limited regex experience just stalled out on me - can someone think of a decent regex to do this, or (better yet) is there a more pythonic way to do this that I'm missing?
0
[ 2, 31, 22, 79, 699, 26, 21, 20059, 596, 161, 20, 14692, 21, 726, 115, 9341, 2516, 9, 800, 3726, 3726, 31, 22, 195, 330, 21, 3893, 1196, 2595, 31, 22, 79, 7835, 68, 1197, 21, 20059, 3884, 9, 31, 57, 238, 15386, 610, 43, 7887, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 fake dictionarys === I've declared Javascript arrays in such a way that I could then access them by a key, but it was a long time ago, and I've forgotten how I did it. Basically, I have two fields I want to store, a unique key, and its value. I know there is a way to do it.. something like: var jsArray = new {key: 'test test', value: 'value value'}, new {key: 'test 2', value: 'value 2'}; and accessed like: value = jsArray[key] Can someone remind me?
0
[ 2, 8247, 8741, 7031, 9186, 18, 800, 3726, 3726, 31, 22, 195, 2482, 8247, 8741, 7718, 18, 19, 145, 21, 161, 30, 31, 110, 94, 1381, 105, 34, 21, 1246, 15, 47, 32, 23, 21, 175, 85, 1464, 15, 17, 31, 22, 195, 5562, 184, 31, 144,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Embedding binary video data in a swf file === Is it possible to play video from data that has been embedded in a swf at compile time (with the `[Embed]` metatag)? I'm interested in being able to bundle flv video data in a swf (along with other assets), which will be played by an AIR application. I don't think it can be done. Anyone disagree?
0
[ 2, 11911, 69, 3258, 14171, 763, 1054, 19, 21, 13, 18, 15263, 3893, 800, 3726, 3726, 25, 32, 938, 20, 418, 763, 37, 1054, 30, 63, 74, 12138, 19, 21, 13, 18, 15263, 35, 26561, 85, 13, 5, 1410, 14, 13, 1, 2558, 1503, 4283, 500, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What is a good toolkit for developing Blackberry applications? === Looking for a toolkit/SDK for general Blackberry development or application toolkits. Anything like an MVC framework?
0
[ 2, 98, 25, 21, 254, 5607, 13703, 26, 3561, 27367, 3767, 60, 800, 3726, 3726, 699, 26, 21, 5607, 13703, 118, 18, 43, 197, 26, 297, 27367, 522, 54, 3010, 5607, 13703, 18, 9, 602, 101, 40, 307, 8990, 6596, 60, 3, 0, 0, 0, 0, 0,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
are we moving towards classic ASP using MVC framework in .Net 3.5? === Looking at MVC framework, it seems we require more of classic ASP knowledge then ASP.NET postbacks and Viewstates, are we moving backwards to complex UI + code logic in the actual HTML ?
0
[ 2, 50, 95, 1219, 1016, 2732, 28, 306, 568, 307, 8990, 6596, 19, 13, 9, 2328, 203, 9, 264, 60, 800, 3726, 3726, 699, 35, 307, 8990, 6596, 15, 32, 2206, 95, 4077, 91, 16, 2732, 28, 306, 1918, 94, 28, 306, 9, 2328, 678, 1958, 1...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to detect what .NET Framework versions and service packs are installed === A similar question was asked [here][1], but was specific to .NET 3.5. Specifically, I'm looking for the following: 1. What is the correct way to determine which .NET Framework versions and service packs are installed? 2. Is there a list of registry keys that can be used? 3. Are there any dependencies between Framework versions? [1]: http://stackoverflow.com/questions/198931/how-do-i-tell-if-net-35-sp1-is-installed
0
[ 2, 184, 20, 9092, 98, 13, 9, 2328, 6596, 3281, 17, 365, 18936, 50, 4066, 800, 3726, 3726, 21, 835, 1301, 23, 411, 636, 6836, 500, 2558, 165, 500, 15, 47, 23, 1903, 20, 13, 9, 2328, 203, 9, 264, 9, 3524, 15, 31, 22, 79, 699, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 anything like C# (.NET) Library that works as API for Google? === I'd like to write a script to search and analyze results at google.com. Recently, I've been ng looking for Google API but it seems they do not issue it to developers anymore. Is there any (likely free) library for C#(.NET) development that would allow me to search over Google with parameters? Thanks for your response.
0
[ 2, 25, 80, 602, 101, 272, 5910, 13, 5, 9, 2328, 6, 1248, 30, 693, 28, 21, 2159, 26, 8144, 60, 800, 3726, 3726, 31, 22, 43, 101, 20, 2757, 21, 3884, 20, 2122, 17, 16051, 1736, 35, 8144, 9, 960, 9, 1989, 15, 31, 22, 195, 74,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Compiling a QT program in Windows XP with MinGW's g++ === I have a stub Qt application and I keep getting compiler errors #include <QApplication> int main(int argc, char *argv[]) { return 0; } I used `qmake -project` and `qmake` commands and as far as I can tell they did their job correctly. When I subsequently call `make` at the command line I get the following error: > g++ -c -O2 -frtti -fexceptions -mthreads -Wall -DUNICODE -DQT_LARGEFILE_SUPPORT > -DQT_NO_DEBUG -DQT_GUI_LIB -DQT_CORE_LIB -DQT_THREAD_SUPPORT -DQT_NEEDS_QMAIN -I > '../../../../qt/include/QtCore' -I'../../../../qt/include/QtCore' -I'../../../.. > /qt/include/QtGui' -I'../../../../qt/include/QtGui' -I'../../../../qt/include' - > I'.' -I'c:/qt/include/ActiveQt' -I'release' -I'.' -I'../../../../qt/mkspecs/defa > ult' -o release/Main.o Main.cpp > cc1plus.exe: Invalid option 'threads' > make[1]: *** [release/Main.o] Error 1 > make: *** [release] Error 2 My searches on Google tell me that threading is important to keep but not how to fix this error. Any help will be appreciated.
0
[ 2, 24378, 21, 2593, 38, 625, 19, 1936, 23045, 29, 12069, 499, 22, 18, 489, 20512, 800, 3726, 3726, 31, 57, 21, 21354, 2593, 38, 3010, 17, 31, 643, 1017, 21486, 11908, 6926, 22640, 13, 1, 1251, 2552, 20669, 1, 19, 38, 407, 5, 639...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 manage a redirect request after a JQuery Ajax call === Im using $.post() to call a Servlet using Ajax and then use the resulting HTML fragment to replace a div element in the User's current page. However, if the session timeouts the server sends a redirect directive to send the user to the login page. Nonetheless, JQuery is replacing the div element with the contents of the login page, forcing the user's eyes to witness a rare scene indeed. How can I manage a redirect directive from an Ajax call? - jQuery 1.2.6
0
[ 2, 184, 20, 4705, 21, 302, 14706, 3772, 75, 21, 487, 8190, 93, 20624, 645, 800, 3726, 3726, 797, 568, 5579, 9, 6962, 5, 6, 20, 645, 21, 13, 10321, 1336, 568, 20624, 17, 94, 275, 14, 2927, 13, 15895, 14847, 20, 3934, 21, 13, 12...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
ClickOnce Application Not Opening === I have a VB.NET ClickOnce application that I am tryign to install on my computer. Previously, I was able to install and run these apps without issue. Now when I install the application, I can see the flash of a window opening, and then nothing. (There are also no processes left hanging or anything when viewed with the task manager.) After some digging around I noticed that there are files in my Temporary Internet Files with names like "FusionBindError" and then my application name and differnt DLL names. I have done everything I can find on the net to do, reinstall applications, reinstalled the .NET Framework, deleted my Local Settings folder and relogged in. Does anyone out there have any other ideas for me to try?
0
[ 2, 10840, 13120, 3010, 52, 1214, 800, 3726, 3726, 31, 57, 21, 13, 20468, 9, 2328, 10840, 13120, 3010, 30, 31, 589, 1131, 9693, 20, 16146, 27, 51, 1428, 9, 1343, 15, 31, 23, 777, 20, 16146, 17, 485, 158, 4865, 18, 366, 1513, 9, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do you cast from Page.Master to a specific master page in ASP.NET === I have a BasePage which inherits from System.Web.UI.Page and every page that inherits the BasePage will have the same master page. How do I cast the Page.Master of the BasePage to the specific master page so I can access properties on it?
0
[ 2, 184, 107, 42, 1325, 37, 2478, 9, 4594, 20, 21, 1903, 1129, 2478, 19, 28, 306, 9, 2328, 800, 3726, 3726, 31, 57, 21, 1000, 6486, 56, 17569, 18, 37, 329, 9, 14113, 9, 5661, 9, 6486, 17, 352, 2478, 30, 17569, 18, 14, 1000, 6...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Are hidden fields on child window inaccessible from parent window === I have asp.net form that contains <asp:HiddenField> fields. When I access this window, my javascript functions can access the fields via the DOM with the getElementById() method and when I postpack to the server I am receiving the updates made by the client. However, when I launch the form as a child window using Telerik's RadWindow control, the javascript can not access the hidden fields on the child form. Instead I get null. My questions are: 1. Are hidden fields on a child window not accessible when the window is launched from a parent asp.net form? 2. Has anyone attempted this with Telerik controls and run into issues?
0
[ 2, 50, 3689, 2861, 27, 850, 1463, 28671, 37, 4766, 1463, 800, 3726, 3726, 31, 57, 28, 306, 9, 2328, 505, 30, 1588, 13, 1, 472, 306, 45, 1822, 43, 817, 1109, 1, 2861, 9, 76, 31, 1381, 48, 1463, 15, 51, 8247, 8741, 3719, 92, 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...
increase /proc/pid/cmdline 4096 byte limit === For my Java apps with very long classpaths, I cannot see the main class specified near the end of the arg list when using ps. I think this stems from my Ubuntu system's size limit on /proc/pid/cmdline. How can I increase this limit?
0
[ 2, 1839, 13, 118, 15617, 118, 11031, 118, 9095, 43, 1143, 1417, 4060, 34, 591, 4496, 800, 3726, 3726, 26, 51, 8247, 4865, 18, 29, 253, 175, 718, 8353, 18, 15, 31, 1967, 196, 14, 407, 718, 9931, 424, 14, 241, 16, 14, 13, 10663, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 implement Caching Strategy in my Asp.net Mvc With linq2sql repository === i dont know if to use the httpcontext caching or to use the Enterprise Library Caching Application Block. and also , what is the best pattern for the caching Strategy when deleting or updating an entity that is part of a cached list. to remove all the list from cache or only remove the item from the cached list, and if update will i remove the list from cache or update the entity in it.
0
[ 2, 184, 92, 31, 8713, 1658, 7192, 4427, 19, 51, 28, 306, 9, 2328, 307, 8990, 29, 6294, 1251, 135, 18, 22402, 24869, 800, 3726, 3726, 31, 1049, 143, 100, 20, 275, 14, 7775, 1126, 11969, 1658, 7192, 54, 20, 275, 14, 6002, 1248, 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...
Passing a outside variable into a <asp:sqldatasource> tag. ASP.NET 2.0 === I'm designing some VB based ASP.NET 2.0, and I am trying to make more use of the various ASP tags that visual studio provides, rather than hand writing everything in the code-behind. I want to pass in an outside variable from the Session to identify who the user is for the query. <asp:sqldatasource id="DataStores" runat="server" connectionstring="<%$ ConnectionStrings:MY_CONNECTION %>" providername="<%$ ConnectionStrings:MY_CONNECTION.ProviderName %>" selectcommand="SELECT THING1, THING2 FROM DATA_TABLE WHERE (THING2 IN (SELECT THING2 FROM RELATED_DATA_TABLE WHERE (USERNAME = @user)))" onselecting="Data_Stores_Selecting"> <SelectParameters> <asp:parameter name="user" defaultvalue ="" /> </SelectParameters> </asp:sqldatasource> And on my code behind I have: Protected Sub Data_Stores_Selecting(ByVal sender As Object, ByVal e As System.Web.UI.WebControls.SqlDataSourceSelectingEventArgs) Handles Data_Stores.Selecting e.Command.Parameters("user").Value = Session("userid") End Sub Oracle squaks at me with ORA-01036, illegal variable name. Am I declaring the variable wrong in the query? I thought external variables share the same name with a @ prefixed. from what I understand, this should be placing the value I want into the query when it executes the select.
0
[ 2, 2848, 21, 719, 7612, 77, 21, 13, 1, 472, 306, 45, 18, 22402, 18768, 12097, 1, 3383, 9, 28, 306, 9, 2328, 172, 9, 387, 800, 3726, 3726, 31, 22, 79, 15026, 109, 13, 20468, 432, 28, 306, 9, 2328, 172, 9, 387, 15, 17, 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...
How do you programatically authenticate to a web server using NTLM Authentication with apache's commons httpclient? === I'm using this code, and I get the stack trace that is listed below. I've got this working with just https and with basic authentication, but not ntlm. HttpClient client = null; HttpMethod get = null; try { Protocol myhttps = new Protocol("https", ((ProtocolSocketFactory) new EasySSLProtocolSocketFactory()), 443); Protocol.registerProtocol("https", myhttps); client = new HttpClient(); get = new GetMethod("https://tt.dummycorp.com/tmtrack/"); Credentials creds = new NTCredentials("dummy", "dummy123", "host", "DUMMYDOMAIN"); client.getState().setCredentials(AuthScope.ANY, creds); get.setDoAuthentication(true); int resultCode = client.executeMethod(get); System.out.println(get.getResponseBodyAsString()); } javax.net.ssl.SSLHandshakeException: sun.security.validator.ValidatorException: PKIX path validation failed: java.security.cert.CertPathValidatorException: signature check failed at com.sun.net.ssl.internal.ssl.Alerts.getSSLException(Alerts.java:174) at com.sun.net.ssl.internal.ssl.SSLSocketImpl.fatal(SSLSocketImpl.java:1591) at com.sun.net.ssl.internal.ssl.Handshaker.fatalSE(Handshaker.java:187) at com.sun.net.ssl.internal.ssl.Handshaker.fatalSE(Handshaker.java:181) at com.sun.net.ssl.internal.ssl.ClientHandshaker.serverCertificate(ClientHandshaker.java:975) at com.sun.net.ssl.internal.ssl.ClientHandshaker.processMessage(ClientHandshaker.java:123) at com.sun.net.ssl.internal.ssl.Handshaker.processLoop(Handshaker.java:516) at com.sun.net.ssl.internal.ssl.Handshaker.process_record(Handshaker.java:454) at com.sun.net.ssl.internal.ssl.SSLSocketImpl.readRecord(SSLSocketImpl.java:884) at com.sun.net.ssl.internal.ssl.SSLSocketImpl.performInitialHandshake(SSLSocketImpl.java:1096) at com.sun.net.ssl.internal.ssl.SSLSocketImpl.writeRecord(SSLSocketImpl.java:623) at com.sun.net.ssl.internal.ssl.AppOutputStream.write(AppOutputStream.java:59) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:65) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:123) at org.apache.commons.httpclient.HttpConnection.flushRequestOutputStream(HttpConnection.java:828) at org.apache.commons.httpclient.HttpMethodBase.writeRequest(HttpMethodBase.java:2116) at org.apache.commons.httpclient.HttpMethodBase.execute(HttpMethodBase.java:1096) at org.apache.commons.httpclient.HttpMethodDirector.executeWithRetry(HttpMethodDirector.java:398) at org.apache.commons.httpclient.HttpMethodDirector.executeMethod(HttpMethodDirector.java:171) at org.apache.commons.httpclient.HttpClient.executeMethod(HttpClient.java:397) at org.apache.commons.httpclient.HttpClient.executeMethod(HttpClient.java:323) at com.dummycorp.teamtrack.TeamTrackHack.main(TeamTrackHack.java:38) Caused by: sun.security.validator.ValidatorException: PKIX path validation failed: java.security.cert.CertPathValidatorException: signature check failed at sun.security.validator.PKIXValidator.doValidate(PKIXValidator.java:251) at sun.security.validator.PKIXValidator.doValidate(PKIXValidator.java:234) at sun.security.validator.PKIXValidator.engineValidate(PKIXValidator.java:158) at sun.security.validator.Validator.validate(Validator.java:218) at com.sun.net.ssl.internal.ssl.X509TrustManagerImpl.validate(X509TrustManagerImpl.java:126) at com.sun.net.ssl.internal.ssl.X509TrustManagerImpl.checkServerTrusted(X509TrustManagerImpl.java:209) at org.apache.commons.httpclient.contrib.ssl.EasyX509TrustManager.checkServerTrusted(EasyX509TrustManager.java:104) at com.sun.net.ssl.internal.ssl.ClientHandshaker.serverCertificate(ClientHandshaker.java:967) ... 17 more Caused by: java.security.cert.CertPathValidatorException: signature check failed at sun.security.provider.certpath.PKIXMasterCertPathValidator.validate(PKIXMasterCertPathValidator.java:139) at sun.security.provider.certpath.PKIXCertPathValidator.doValidate(PKIXCertPathValidator.java:316) at sun.security.provider.certpath.PKIXCertPathValidator.engineValidate(PKIXCertPathValidator.java:178) at java.security.cert.CertPathValidator.validate(CertPathValidator.java:250) at sun.security.validator.PKIXValidator.doValidate(PKIXValidator.java:246) ... 24 more Caused by: java.security.SignatureException: Signature does not match. at sun.security.x509.X509CertImpl.verify(X509CertImpl.java:446) at sun.security.provider.certpath.BasicChecker.verifySignature(BasicChecker.java:133) at sun.security.provider.certpath.BasicChecker.check(BasicChecker.java:112) at sun.security.provider.certpath.PKIXMasterCertPathValidator.validate(PKIXMasterCertPathValidator.java:117) ... 28 more
0
[ 2, 184, 107, 42, 625, 721, 8438, 14351, 1373, 20, 21, 2741, 8128, 568, 13, 2877, 10363, 27963, 29, 17140, 22, 18, 8322, 7775, 150, 18513, 38, 60, 800, 3726, 3726, 31, 22, 79, 568, 48, 1797, 15, 17, 31, 164, 14, 7566, 5565, 30, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Qt Application fails spectacularly === I'm trying to link a Qt application with its libraries and the linker (MinGW) spews hundreds of lines like the following, and I am unsure how to proceed. > cpp: undefined reference to `_Unwind_SjLj_Register' > c:/qt/lib/libQtCore.a(qcoreapplication_win.o)(.text+0x29d):qcoreapplication_win. > cpp: undefined reference to > `_Unwind_SjLj_Unregister' > c:/qt/lib/libQtCore.a(qcoreapplication_win.o)(.text+0x38c):qcoreapplication_win. > cpp: undefined reference to > `_Unwind_SjLj_Resume' > c:/qt/lib/libQtCore.a(qcoreapplication_win.o)(.text+0x4ce):qcoreapplication_win. > cpp: undefined reference to > `_Unwind_SjLj_Register' > c:/qt/lib/libQtCore.a(qcoreapplication_win.o)(.text+0x53e):qcoreapplication_win. > cpp: undefined reference to > `_Unwind_SjLj_Unregister' > c:/qt/lib/libQtCore.a(qcoreapplication_win.o)(.text+0x635):qcoreapplication_win. > cpp: undefined reference to > `_Unwind_SjLj_Resume'
0
[ 2, 2593, 38, 3010, 13614, 13096, 102, 800, 3726, 3726, 31, 22, 79, 749, 20, 3508, 21, 2593, 38, 3010, 29, 82, 8649, 17, 14, 3508, 106, 13, 5, 3863, 499, 6, 9882, 10268, 4541, 16, 1560, 101, 14, 249, 15, 17, 31, 589, 13815, 184...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Force a full Java applet refresh (AWT) === I have a Java Applet that uses AWT. In some (rare) circumstances, the platform does not refresh the screen properly. I can move or minimize/maximize the window and see that my applet refreshed properly. I am looking for code that will give me the fullest possible applet screen repaint, simulating the behaviour of a minimize/maximize. I've tried calling various combinations of paint()/repaint()/invalidate()/update() on the parent containers and recursing on various children. However, no combination (that I've found) cleans up the framework bugs that I am encountering. I am looking for techniques to fully refresh the applet, even if they may cause some slight flickering, as I will be invoking this code only on the problematic platform. In my tests, moving to Swing did not help resolve my problem. By the way, this is a simplification of my previous (more complicated) post: http://stackoverflow.com/questions/184491/java-applet-awt-refresh-problem-mac-os-x-104
0
[ 2, 558, 21, 503, 8247, 4037, 38, 24905, 13, 5, 3885, 38, 6, 800, 3726, 3726, 31, 57, 21, 8247, 4037, 38, 30, 2027, 13, 3885, 38, 9, 19, 109, 13, 5, 525, 99, 6, 5072, 15, 14, 2452, 630, 52, 24905, 14, 2324, 7428, 9, 31, 92,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
join query and what do i do w/ it to display data correctly? === i have a table that stores all the volunteers, and each volunteer will be assigned to an appropriate venue to work the event. there is a table that stores all the venues. it stores the volunteer's appropriate venue assignment into the column 'venue_id' table: venues columns: id, venue_name table: volunteers_2009 columns: id, lname, fname, etc.., venue_id here is the function to display the list of volunteers, and the problem i am having is to display their venue assignment. i have never worked much with mysql joins, because this is the first time i have joined two tables together to grab the appropriate info i need. so i want it to go to the volunteers_2009 table, grab the venue_id, go to the venues table, match up volunteers_2009.venue_id to venues.id, to display venues.venue_name, so in the list it will display the volunteer's venue assignment. ![alt text][1] [1]: http://i36.tinypic.com/ng28er.png <?php // ----------------------------------------------------- //it displays appropriate columns based on what table you are viewing function displayTable($table, $order, $sort) { $query = "select * from $table ORDER by $order $sort"; $result = mysql_query($query); // volunteer's venue query $query_venues = "SELECT volunteers_2009.venue_id, venues.venue_name FROM volunteers_2009 JOIN venues ON volunteers_2009.venue_id = venues.id"; $result_venues = mysql_query($query_venues); if($_POST) { ?> <table id="box-table-a"> <tr> <th>Name</th> <?php if($table == 'maillist') { ?> <th>Email</th> <?php } ?> <?php if($table == 'volunteers_2008' || $table == 'volunteers_2009') { ?> <th>Comments</th> <?php } ?> <?php if($table == 'volunteers_2009') { ?> <th>Interests</th> <th>Venue</th> <?php } ?> <th>Edit</th> </tr> <tr> <?php while($row = mysql_fetch_array($result)) { $i = 0; while($i <=0) { print '<td>'.$row['fname'].' '.$row['lname'].'</td>'; if($table == 'maillist') { print '<td><a href="mailto:'.strtolower($row['email']).'">'.strtolower($row['email']).'</a></td>'; } if($table == 'volunteers_2008' || $table == 'volunteers_2009') { print '<td><small>'.substr($row['comments'], 0, 32).'</small></td>'; } if($table == 'volunteers_2009') { print '<td><small>1) '.$row['choice1'].'<br>2) '.$row['choice2'].'<br>3) '.$row['choice3'].'</small></td>'; ?> <td> <?php if($row_venues['venue_name'] != '') { // print venue assigned print $row_venues['venue_id'].' '.$row_venues['venue_name'].' '; } else { print 'No Venue Assigned'; } ?> </td> <?php } ?> <td><a href="?mode=upd&id=<?= $row[id] ?>&table=<?= $table ?>">Upd</a> / <a href="?mode=del&id=<?= $row[id] ?>&table=<?= $table ?>" onclick="return confirm('Are you sure you want to delete?')">Del</a></td> <?php $i++; } print '</tr>'; } print '</table>'; } } // ----------------------------------------------------- ?>
0
[ 2, 1865, 25597, 17, 98, 107, 31, 107, 619, 118, 32, 20, 3042, 1054, 12044, 60, 800, 3726, 3726, 31, 57, 21, 859, 30, 4134, 65, 14, 6592, 15, 17, 206, 5599, 129, 44, 2467, 20, 40, 4593, 5704, 20, 170, 14, 807, 9, 80, 25, 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...
winforms map with links . . === we have users in each region of the world. I would like to create an environment picker that shows up a map on the form and has a link for each region. So if i was in NY i would click NY and would get the NY environment. Any ideas of doing this dynamically in winforms as opposed to having a static map image.
0
[ 2, 628, 4190, 18, 2942, 29, 6271, 13, 9, 13, 9, 800, 3726, 3726, 95, 57, 3878, 19, 206, 632, 16, 14, 126, 9, 31, 83, 101, 20, 1600, 40, 2307, 2036, 106, 30, 1285, 71, 21, 2942, 27, 14, 505, 17, 63, 21, 3508, 26, 206, 632, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 WiX equivilent of Environment.SpecialFolder.ApplicationData from .NET? === I need to install a file into the Environment.SpecialFolder.ApplicationData folder, which differs between XP and Vista. Is there a built in way to reference the correct folder in WiX or will I have to use conditional checks for OS and do it manually? If I have to do the latter, how do I reference the current windows user's directory in Vista?
0
[ 2, 98, 25, 14, 4807, 396, 13, 9629, 9638, 2291, 16, 2307, 9, 11118, 8814, 106, 9, 2552, 20669, 18768, 37, 13, 9, 2328, 60, 800, 3726, 3726, 31, 376, 20, 16146, 21, 3893, 77, 14, 2307, 9, 11118, 8814, 106, 9, 2552, 20669, 18768, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Is there a .NET namespace where I can find the WIN32 API message-related #defines, like WM_COMMAND, etc === I'm overriding WndProc, so I want to write code like if (m.Msg == WM_COMMAND) my special stuff else base.WndProc(ref m)
0
[ 2, 25, 80, 21, 13, 9, 2328, 204, 5582, 113, 31, 92, 477, 14, 628, 3125, 21, 2159, 2802, 8, 6203, 6926, 13862, 10652, 15, 101, 19312, 1, 16239, 15, 2722, 800, 3726, 3726, 31, 22, 79, 84, 5175, 68, 619, 706, 15617, 15, 86, 31, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Is there any way to get python omnicomplete to work with non-system modules in vim? === The only thing I can get python omnicomplete to work with are system modules. I get nothing for help with modules in my site-packages or modules that I'm currently working on.
0
[ 2, 25, 80, 186, 161, 20, 164, 20059, 14677, 15990, 20, 170, 29, 538, 8, 10724, 17113, 19, 1790, 79, 60, 800, 3726, 3726, 14, 104, 584, 31, 92, 164, 20059, 14677, 15990, 20, 170, 29, 50, 329, 17113, 9, 31, 164, 626, 26, 448, 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 I check if a number is a palindrome? === Any language. Any algorithm (except making the number a string and then reversing the string). Also, I actually have to do this, and I'll be posting my solution too.
0
[ 2, 184, 107, 31, 2631, 100, 21, 234, 25, 21, 4370, 108, 22264, 60, 800, 3726, 3726, 186, 816, 9, 186, 9083, 13, 5, 10066, 544, 14, 234, 21, 3724, 17, 94, 28829, 14, 3724, 6, 9, 67, 15, 31, 1121, 57, 20, 107, 48, 15, 17, 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, 0, 0, 0, 0, 0, 0, 0...
Do you draw a distinction between text editors and IDEs? === I've seen several responses to questions asking for IDEs where text editors were suggested and vice-versa. That makes me think that people treat them as the same thing, where I draw clear distinctions. 1. How do you define "text editor" and "IDE"? 2. Do you see a difference between the two tools?
0
[ 2, 107, 42, 2003, 21, 6519, 128, 1854, 12149, 17, 13, 8153, 60, 800, 3726, 3726, 31, 22, 195, 541, 238, 13231, 20, 2346, 3379, 26, 13, 8153, 113, 1854, 12149, 46, 2347, 17, 1821, 8, 5498, 58, 9, 30, 1364, 55, 277, 30, 148, 575...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Ping always succeeds, cant easily check uptime using ping on a url === Im getting frustrated because of OpenDNS and other services (ie: roadrunner) that now always returns a ping even if you type any invalid url ie: lkjsdaflkjdsjf.com --- I had created software for my own use that would ping a url to verify if the site was up or not. This no longer works. Does anyone have any ideas about this? Requirements: 1.) It should work with any valid web site, even ones i dont control 2.) It should be able to run from any network that has internet access I would greatly appreciate to hear how others now handle this. Thank you greatly :-)
0
[ 2, 13, 3181, 550, 7952, 18, 15, 2973, 2351, 2631, 71, 891, 568, 13, 3181, 27, 21, 287, 6362, 800, 3726, 3726, 797, 1017, 10645, 185, 16, 368, 43, 2172, 17, 89, 687, 13, 5, 660, 45, 383, 12993, 6, 30, 130, 550, 4815, 21, 13, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
In C#, how can I detect at what point in a string it is not well formed xml? === I'm writing a lightweight XML editor, and in cases where the user's input is not well formed, I would like to indicate to the user where the problem is, or at least where the first problem is. Does anyone know of an existing algorithm for this? If looking at code helps, if I could fill in the FindIndexOfInvalidXml method (or something like it), this would answer my question. Thanks! using System; namespace TempConsoleApp { class Program { static void Main(string[] args) { string text = "<?xml version=\"1.0\"?><tag1><tag2>Some text.</taagg2></tag1>"; int index = FindIndexOfInvalidXml(text); Console.WriteLine(index); } private static int FindIndexOfInvalidXml(string theString) { int index = -1; //Some logic return index; } } }
0
[ 2, 19, 272, 5910, 15, 184, 92, 31, 9092, 35, 98, 454, 19, 21, 3724, 32, 25, 52, 134, 843, 23504, 60, 800, 3726, 3726, 31, 22, 79, 1174, 21, 13613, 23504, 1835, 15, 17, 19, 1871, 113, 14, 4155, 22, 18, 6367, 25, 52, 134, 843,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 in-memory compilation === How can i generate bytecode (Byte[]) from a String at runtime, without using a "javac" process or something of this sort? is there a simple way of calling the compiler like that?
0
[ 2, 8247, 19, 8, 790, 5171, 93, 4868, 800, 3726, 3726, 184, 92, 31, 7920, 34, 591, 9375, 13, 5, 23246, 2558, 500, 6, 37, 21, 3724, 35, 485, 891, 15, 366, 568, 21, 13, 7, 1004, 9961, 7, 953, 54, 301, 16, 48, 2058, 60, 25, 80...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
What is the best way to manage permissions for a web application - bitmask or database table? === I'm considering the best way to design a permissions system for an "admin" web application. The application is likely to have many users, each of whom could be assigned a certain role; some of these users could be permitted to perform specific tasks outside the role. I can think of two ways to design this: one, with a "permissions" table with a row for every user, and boolean columns, one for each task, that assign them permissions to perform those tasks. Like this: <pre> User ID Manage Users Manage Products Manage Promotions Manage Orders 1 true true true true 2 false true true true 3 false false false true </pre> Another way I thought of was to use a bit mask to store these user permissions. This would limit the number of tasks that could be managed to 31 for a 32-bit signed integer, but in practice we're unlikely to have more than 31 specific tasks that a user could perform. This way, the database schema would be simpler, and we wouldn't have to change the table structure every time we added a new task that would need access control. Like this: <pre> User ID Permissions (8-bit mask), would be ints in table 1 00001111 2 00000111 3 00000001 </pre> What mechanisms have people here typically used, and why? Thanks!
0
[ 2, 98, 25, 14, 246, 161, 20, 4705, 5572, 18, 26, 21, 2741, 3010, 13, 8, 1142, 23265, 54, 6018, 859, 60, 800, 3726, 3726, 31, 22, 79, 5154, 14, 246, 161, 20, 704, 21, 5572, 18, 329, 26, 40, 13, 7, 1283, 2160, 7, 2741, 3010, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Reversing a UTF-8 string in place === Recently, someone asked about an [algorithm for reversing a string in place in C][1]. Most of the proposed solutions had troubles when dealing with non single-byte strings. So, I was wondering what could be a good algorithm for dealing specifically with utf-8 strings. I came up with some code, which I'm posting as an answer, but I'd be glad to see other people's ideas or suggestions. I preferred to use actual code, so I've chosen C#, as it seems to be one of the most popular language in this site, but I don't mind if your code is in another language, as long as it could be reasonably understood by anyone who is familiar with an imperative language. And, as this is intended to see how such an algorithm could be implemented at a low-level (by low-level I just mean dealing with bytes), the idea is to avoid using libraries for the core code. **Notes:** I'm interested in the algorithm itself, its performance and how could it be optimized (I mean algorithm-level optimization, not replacing i++ with ++i and such; I'm not really interested in actual benchmarks either). I don't mean to actually use it in production code or "reinventing the wheel". This is just out of curiosity and as an exercise. I'm using C# byte arrays so I'm assuming you can get the lenght of the string without running though the string until you find a NUL. That is, I'm not accounting for the complexity of finding the lenght of the string. But if you're using C, for instance, you could factor that out by using strlen() before calling the core code. [1]: http://stackoverflow.com/questions/198199/how-do-you-reverse-a-string-in-place-in-c-or-c
0
[ 2, 28829, 21, 287, 11720, 8, 457, 3724, 19, 209, 800, 3726, 3726, 1989, 15, 737, 411, 88, 40, 636, 192, 6979, 242, 7015, 26, 28829, 21, 3724, 19, 209, 19, 272, 500, 2558, 165, 500, 9, 127, 16, 14, 2097, 6776, 41, 16615, 76, 57...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Should I make sure arguments aren't null before using them in a function. === The title may not really explain what I'm really trying to get at, couldn't really think of a way to describe what I mean. I was wondering if it is good practice to check the arguments that a function accepts for nulls or empty before using them. I have this function which just wraps some hash creation like so. Public Shared Function GenerateHash(ByVal FilePath As IO.FileInfo) As String If (FilePath Is Nothing) Then Throw New ArgumentNullException("FilePath") End If Dim _sha As New Security.Cryptography.MD5CryptoServiceProvider Dim _Hash = Convert.ToBase64String(_sha.ComputeHash(New IO.FileStream(FilePath.FullName, IO.FileMode.Open, IO.FileAccess.Read))) Return _Hash End Function As you can see I just takes a IO.Fileinfo as an argument, at the start of the function I am checking to make sure that it is not nothing. I'm wondering is this good practice or should I just let it get to the actual hasher and then throw the exception because it is null.? Thanks.
0
[ 2, 378, 31, 233, 562, 10553, 4847, 22, 38, 16203, 115, 568, 105, 19, 21, 1990, 9, 800, 3726, 3726, 14, 581, 123, 52, 510, 3271, 98, 31, 22, 79, 510, 749, 20, 164, 35, 15, 711, 22, 38, 510, 277, 16, 21, 161, 20, 4996, 98, 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...
Make xargs execute the command once for each line of input === How can I make xargs execute the command exactly once for each line of input given? It's default behavior is to chunk the lines and execute the command once, passing multiple lines to each instance. >From <http://en.wikipedia.org/wiki/Xargs>: >In this example, find feeds the input of xargs with a long list of file names. xargs then splits this list into sublists and calls rm once for every sublist. This is more efficient than this functionally equivalent version: > find /path -type f -print0 | xargs -0 rm
0
[ 2, 233, 993, 10663, 18, 15644, 14, 1202, 382, 26, 206, 293, 16, 6367, 800, 3726, 3726, 184, 92, 31, 233, 993, 10663, 18, 15644, 14, 1202, 1890, 382, 26, 206, 293, 16, 6367, 504, 60, 32, 22, 18, 12838, 3257, 25, 20, 15009, 14, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Best practices for deploying tools & scripts to production? === I've got a number of batch processes that run behind the scenes for a Linux/PHP website. They are starting to grow in number and complexity, so I want to bring a small amount of process to bear on them. My source tree has a bunch of cpp files and scripts, organized with development but not deployment in mind. After compiling all the executables, I need to put various scripts and binaries on a cluster of machines. Different machines need different executables, scripts, and config files for their batch processes. I also have a few of tools that I've written that belong on every machine. At the moment, this deployment process is manual and error prone. I'm guessing I'm just going to end up with a script that runs at the root of the source tree and builds a smaller tree of everything necessary for any of the machines. Then, I'll just rsync that to the appropriate machines. But I'm curious how other people are managing this type of problem. Any ideas?
0
[ 2, 246, 5242, 26, 17617, 68, 4672, 279, 17505, 20, 637, 60, 800, 3726, 3726, 31, 22, 195, 330, 21, 234, 16, 13064, 5102, 30, 485, 439, 14, 3918, 26, 21, 13024, 118, 26120, 2271, 9, 59, 50, 1422, 20, 3213, 19, 234, 17, 12745, 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...
Advanced Console IO in .NET === What is the best way to write data to the text console at arbitrary locations on the screen and with custom fore/background colors?
0
[ 2, 2255, 8650, 13, 1963, 19, 13, 9, 2328, 800, 3726, 3726, 98, 25, 14, 246, 161, 20, 2757, 1054, 20, 14, 1854, 8650, 35, 17237, 4095, 27, 14, 2324, 17, 29, 5816, 26, 62, 118, 1958, 8810, 5268, 60, 3, 0, 0, 0, 0, 0, 0, 0, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
Is it worth learning BASH when I know Perl? === All my scripting is done in Perl, I can execute one liners at the command line, and Perl regex seems way easier. Is there anything I can do in BASH that I can't do in Perl? I just don't feel like a true hacker unless I spend the time to delve in BASH and start using Sed and Awk as well. Is it worth it, or am I just asking for pain and frustration?
0
[ 2, 25, 32, 2715, 2477, 13158, 76, 31, 143, 416, 255, 60, 800, 3726, 3726, 65, 51, 3884, 68, 25, 677, 19, 416, 255, 15, 31, 92, 15644, 53, 12588, 18, 35, 14, 1202, 293, 15, 17, 416, 255, 7953, 1706, 2206, 161, 4950, 9, 25, 80...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Best way to detect integer overflow in C/C++ === I was writing a program in C++ to find all solutions of a^b = c, where a, b and c together use all the digits 0-9 exactly once. The program looped over values of a and b, and ran a digit-counting routine each time on a, b and a^b to check if the digits condition was satisfied. However, spurious solutions can be generated when a^b overflows the integer limit. I ended up checking for this using code like: unsigned long b, c, c_test; ... c_test=c*b; // Possible overflow if (c_test/b != c) {/* There has been an overflow*/} else c=c_test; // No overflow Is there a better way of testing for overflow? I know that some chips have an internal flag that is set when overflow occurs, but I've never seen it accessed through C or C++.
0
[ 2, 246, 161, 20, 9092, 13820, 20285, 19, 272, 118, 150, 20512, 800, 3726, 3726, 31, 23, 1174, 21, 625, 19, 272, 20512, 20, 477, 65, 6776, 16, 21, 1, 220, 800, 272, 15, 113, 21, 15, 334, 17, 272, 429, 275, 65, 14, 19076, 713, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Print spinning cursor in a terminal running application using C === How would I print a spinning curser in a utility that runs in a terminal using standard C? I'm looking for something that prints: \ | / - over and over in the same position on the screen? Thanks
0
[ 2, 4793, 9609, 29588, 19, 21, 3855, 946, 3010, 568, 272, 800, 3726, 3726, 184, 83, 31, 4793, 21, 9609, 7144, 139, 19, 21, 10082, 30, 1461, 19, 21, 3855, 568, 1236, 272, 60, 31, 22, 79, 699, 26, 301, 30, 12202, 45, 13, 1, 13, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How can I roll-back a ClickOnce application? === I was wondering if there was a way (hacky will do) to allow a user to go back to a previous version of a ClickOnce network deployed application? I've looked in the docs and API and there seems to be no way. You <b>can</b> selectively choose if you would like to update, but once updated there is, seemingly, no way back. Any advice would be cool.
0
[ 2, 184, 92, 31, 3001, 8, 1958, 21, 10840, 13120, 3010, 60, 800, 3726, 3726, 31, 23, 5712, 100, 80, 23, 21, 161, 13, 5, 22983, 93, 129, 107, 6, 20, 1655, 21, 4155, 20, 162, 97, 20, 21, 1158, 615, 16, 21, 10840, 13120, 982, 66...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Best CSS color wheel sites === What site(s) do you recommend for looking at complimentary colors for site design? It would also be beneficial to enter a hex or RGB value and have the color wheel spit back complimentary colors.
4
[ 2, 246, 272, 18, 18, 1665, 3556, 3259, 800, 3726, 3726, 98, 689, 5, 18, 6, 107, 42, 12360, 26, 699, 35, 11606, 1857, 5268, 26, 689, 704, 60, 32, 83, 67, 44, 17623, 20, 2830, 21, 24, 396, 54, 761, 11400, 1923, 17, 57, 14, 166...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Getting gps data from blackberry (pearl) directly from usb interface === Has anyone researched how to access the gps chipset on a blackberry over usb so that it is unnecessary to transmit this data over the cell carrier's data network? Is it possible to access the GPS chipset, store information in a buffer, and open an interface connection (over the usb charging port), for access? Not sure if J2ME allows for this...
0
[ 2, 1017, 18298, 1054, 37, 27367, 13, 5, 7081, 6362, 6, 1703, 37, 182, 220, 6573, 800, 3726, 3726, 63, 1276, 527, 69, 184, 20, 1381, 14, 18298, 12602, 1198, 27, 21, 27367, 84, 182, 220, 86, 30, 32, 25, 16435, 20, 18745, 48, 1054,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 way to embed IronPython inside my C# App? === I have an application used by pretty tech-savey people and they want small island of programmability so I've used embedded Iron Python. However, since IronPython 2.0 Eval() doesn't work any more. Specifically I can't both load modules and inject local variables. There is a work around where I can still call Execute(), print out my answer and listen to StandardOut, but then it comes out as a string and I've lost the type. Not a disaster for a long, but a huge pain for more complex objects. Does anyone know how to get Eval() working again in 2.0 like it did in 1.x? Cheers, Jan
0
[ 2, 98, 22, 18, 14, 246, 161, 20, 11911, 69, 1751, 6448, 11570, 572, 51, 272, 5910, 4865, 60, 800, 3726, 3726, 31, 57, 40, 3010, 147, 34, 1772, 6145, 8, 19863, 93, 148, 17, 59, 259, 284, 553, 16, 625, 79, 4091, 86, 31, 22, 19...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Visual Studio 2008 -- Can I change which "add reference" tab is selected by default? === Every time you start Visual Studio, the first time you click "Add Reference" to add a DLL reference to a project, by default, the .NET tab on that dialog box is selected. As most people reading this have probably noticed, it can take a long time -- often more than 30 seconds -- for the full list of .NET components to fill in. Because of the way we're designing our solutions, though, about 80% of the time, I want to select either from the "Projects" tab or from the "Browse" tab. Is there a setting anywhere in Visual Studio that will let me make "Projects" be the first tab that loads up? Does anyone know any other, hidden tricks to accomplish the same effect?
0
[ 2, 3458, 1120, 570, 13, 8, 8, 92, 31, 753, 56, 13, 7, 14854, 2801, 7, 6523, 25, 1704, 34, 12838, 60, 800, 3726, 3726, 352, 85, 42, 799, 3458, 1120, 15, 14, 64, 85, 42, 10840, 13, 7, 14854, 2801, 7, 20, 3547, 21, 13, 43, 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...
C++: What's the simplest way to read and write BMP files using C++ on Windows? === I would like to load a BMP file, do some operations on it in memory, and output a new BMP file using C++ on Windows (Win32 native). I am aware of [ImageMagick][1] and it's C++ binding [Magick++][2], but I think it's an overkill for this project since I am currently not interested in other file formats or platforms. What would be the simplest way in terms of code setup to read and write BMP files? The answer may be "just use Magick++, it's the simplest." [1]: http://www.imagemagick.org/ [2]: http://www.imagemagick.org/Magick%2B%2B/
0
[ 2, 272, 20512, 45, 98, 22, 18, 14, 24384, 161, 20, 1302, 17, 2757, 334, 2554, 6488, 568, 272, 20512, 27, 1936, 60, 800, 3726, 3726, 31, 83, 101, 20, 6305, 21, 334, 2554, 3893, 15, 107, 109, 1311, 27, 32, 19, 1912, 15, 17, 5196...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Eclipse POJO generator plugin === Does anyone know of a good Eclipse POJO generator? The generate getter\setters and constructor from fields functions are all really nice, but it would be useful to have that tied into a new class\POJO dialog.
0
[ 2, 11652, 2353, 1636, 15286, 10922, 108, 800, 3726, 3726, 630, 1276, 143, 16, 21, 254, 11652, 2353, 1636, 15286, 60, 14, 7920, 164, 815, 1, 18, 22323, 18, 17, 6960, 248, 37, 2861, 3719, 50, 65, 510, 2210, 15, 47, 32, 83, 44, 481...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Using C++ library in C code === I have a C++ library that provides various classes for managing data. I have the source code for the library. I want to extend the C++ API to support C function calls so that the library can be used with C code and C++ code at the same time. I'm using GNU tool chain (gcc, glibc, etc), so language and architecture support are not an issue. Are there any reasons why this is **technically** not possible? Are there any **gotcha's** that I need to watch out for? Are there resources, example code and/or documentation available regarding this? Thanks
0
[ 2, 568, 272, 20512, 1248, 19, 272, 1797, 800, 3726, 3726, 31, 57, 21, 272, 20512, 1248, 30, 1927, 617, 2684, 26, 5616, 1054, 9, 31, 57, 14, 1267, 1797, 26, 14, 1248, 9, 31, 259, 20, 7206, 14, 272, 20512, 21, 2159, 20, 555, 272...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
open command prompt using eclipse === Am a noob to java and am trying to run a program using eclipse. But I have no idea how to get the command promplt running in with the eclipse... I did some online research and couldnt get anything consolidated!!!
0
[ 2, 368, 1202, 11443, 4417, 568, 11652, 800, 3726, 3726, 589, 21, 90, 4995, 20, 8247, 17, 589, 749, 20, 485, 21, 625, 568, 11652, 9, 47, 31, 57, 90, 882, 184, 20, 164, 14, 1202, 11443, 5727, 38, 946, 19, 29, 14, 11652, 9, 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, 0, 0, 0, 0, 0...
Hibernate Delete Cascade === I Have one entity [Project] that contains a collection of other entities [Questions]. I have mapped the relation with a cascade attribute of "all-delete-orphan". In my DB the relation is mapped with a project_id (FK) field on the questions table. this field cannot be null since I don't want a Question without a Project. When I do session.delete(project) it throws an exception saying that project_id cant be null, but if I remove the not-null constrain to that field, the deletion works nice. Any ideas why this happens?
2
[ 2, 4148, 2102, 8820, 27448, 13542, 800, 3726, 3726, 31, 57, 53, 9252, 636, 21011, 500, 30, 1588, 21, 1206, 16, 89, 12549, 636, 24652, 18, 500, 9, 31, 57, 20877, 14, 5827, 29, 21, 13542, 35, 14755, 16, 13, 7, 1233, 8, 24249, 591,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Showing off your modules and processes (graphically) === One of our programmers came today with an interesting question: **How can we show graphically of system ruining with a flow chart or something like that**. The solution we are looking for has to be pretty simple. We intend to use this "animated flow char" to show how our system is supposed to work to our non-tech staff. We need their feedback, but we don't want to overload them with technicalities. Anyone knows a program that may help us? PS: I asked the programmer if the Visual Basic Solution wasn't enough and his answer was: ***"It's way too much complicated"***
0
[ 2, 3187, 168, 154, 17113, 17, 5102, 13, 5, 12084, 1326, 6, 800, 3726, 3726, 53, 16, 318, 17968, 18, 281, 786, 29, 40, 4883, 1301, 45, 13, 1409, 1544, 92, 95, 298, 21755, 102, 16, 329, 8510, 68, 29, 21, 3312, 1795, 54, 301, 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...
Visual Studio 2008 crashes HORRIBLY === This has happened to me 3 times now, and I am wondering if anyone is having the same problem. I am running Visual Studio 2008 SP1, and hitting SQL Server 2005 developer edition. For testing, I use the Server Explorer to browse a database I have already created. For testing I will insert data by hand (right click table -> show table data). I can do this for a week without problems, but sometimes my computer will crash when the stars are aligned. It doesn't hang, it doesn't blue screen, I see the bios boot screen .2 seconds after I enter some value in a new row that hasn't been saved yet. I have never seen a crash like this, where it reboots instantly. I think it may happen when I enter something that violates a database constraint, but I am not sure yet (need a few more crashes to pinpoint it). Anyone have the same problem? Know of a solution? Too bad VS wasn't written with managed code, eh? :)
0
[ 2, 3458, 1120, 570, 21563, 28441, 800, 3726, 3726, 48, 63, 1190, 20, 55, 203, 436, 130, 15, 17, 31, 589, 5712, 100, 1276, 25, 452, 14, 205, 1448, 9, 31, 589, 946, 3458, 1120, 570, 3782, 165, 15, 17, 6687, 4444, 255, 8128, 812, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Cross platform Encryption / Decryption applications for secure file transport === I have a client who is in need of a file based encryption / decryption application to be used between Linux / Windows 2003 Server. The goal is to have a single file compressed nightly on a linux platform and secured using a script, transmitted over FTP, decrypted on the Windows 2003 server and available for other import routines such as SSIS, etc. The file can remain unencrypted on each end after transport, the desire is mainly to keep the file secure during transport. Firewall rules and the fact that IIS6 doesn't support SFTP eliminate SFTP as an option. Simplicity is the primary focus here, so complex security options or heavyweight libraries cannot be used.
0
[ 2, 919, 2452, 24420, 13, 118, 121, 11435, 872, 3767, 26, 4315, 3893, 1739, 800, 3726, 3726, 31, 57, 21, 6819, 72, 25, 19, 376, 16, 21, 3893, 432, 24420, 13, 118, 121, 11435, 872, 3010, 20, 44, 147, 128, 13024, 13, 118, 1936, 973...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 2.0 ready for line of business apps === Now that Silverlight 2.0 has been officially released I was wondering if anyone was using it for any line of business apps, for example POS, Vertical Market apps etc. If so how were your experiences compared to an old WinForms app or Web app?
0
[ 2, 1172, 3130, 172, 9, 387, 1451, 26, 293, 16, 508, 4865, 18, 800, 3726, 3726, 130, 30, 1172, 3130, 172, 9, 387, 63, 74, 2320, 261, 31, 23, 5712, 100, 1276, 23, 568, 32, 26, 186, 293, 16, 508, 4865, 18, 15, 26, 823, 12928, 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...
C# Image.Clone Out of Memory Exception === Why am I getting an out of memory exception? So this dies in C#: **splitBitmaps.Add(neededImage.Clone(rectDimensions, neededImage.PixelFormat));** Where splitBitmaps is a List&lt;BitMap&gt; BUT this works in VB: **arlSplitBitmaps.Add(Image.Clone(rectDimensions, Image.PixelFormat))** where arlSplitBitmaps is a simple array list. (And yes I've tried arraylist in c#) This is the fullsection: for (Int32 splitIndex = 0; splitIndex <= numberOfResultingImages - 1; splitIndex++) <br/>{ <br/> Rectangle rectDimensions; if (splitIndex < numberOfResultingImages - 1) { rectDimensions = new Rectangle(splitImageWidth * splitIndex, 0, splitImageWidth, splitImageHeight); } else { rectDimensions = new Rectangle(splitImageWidth * splitIndex, 0, sourceImageWidth - (splitImageWidth * splitIndex), splitImageHeight); } splitBitmaps.Add(neededImage.Clone(rectDimensions, neededImage.PixelFormat)); } neededImage is a Bitmap by the way. I can't find any useful answers on the intarweb.
0
[ 2, 272, 5910, 1961, 9, 150, 16285, 70, 16, 1912, 5391, 800, 3726, 3726, 483, 589, 31, 1017, 40, 70, 16, 1912, 5391, 60, 86, 48, 8972, 19, 272, 5910, 45, 13, 1409, 25603, 3326, 15022, 18, 9, 14854, 5, 4356, 7424, 22039, 9, 150, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Capitalize every file in a directory, in bash, using 'svn mv'. === I need to change the capitalization of a set of files in a subversion working copy, like so: <pre> svn mv test.txt Test.txt svn mv test2.txt Test2.txt svn mv testn.txt Testn.txt ... svn commit -m "caps" </pre> How can I automate this process? Standard linux install tools available.
0
[ 2, 1057, 2952, 352, 3893, 19, 21, 16755, 15, 19, 13158, 15, 568, 13, 22, 18, 16578, 17967, 22, 9, 800, 3726, 3726, 31, 376, 20, 753, 14, 1057, 1829, 16, 21, 309, 16, 6488, 19, 21, 972, 10898, 638, 4344, 15, 101, 86, 45, 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...
Whats the main difference between int.Parse() and Convert.ToInt32 === I am using C#,and wanted to know the main difference between the two and which one is preferred to use while coding.
0
[ 2, 98, 18, 14, 407, 2841, 128, 19, 38, 9, 3574, 870, 5, 6, 17, 8406, 9, 262, 6391, 3125, 800, 3726, 3726, 31, 589, 568, 272, 5910, 15, 290, 417, 20, 143, 14, 407, 2841, 128, 14, 81, 17, 56, 53, 25, 5981, 20, 275, 133, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
MSSQL command LIKE [0-9] won't match any digit between 0 and 9 === This is the constraint I have on the Customers table. ALTER TABLE Customers ADD CONSTRAINT CN_CustomerPhone CHECK (Phone LIKE '([0-9][0-9][0-9]) [0-9][0-9][0-9]-[0-9][0-9][0-9][0-9]') Why does this fail? INSERT INTO Customers (CustomerName, Address, City, State, Zip, Phone) VALUES ('Some Name','An Address', 'City goes here', 'WI', 12345, '(800) 555-1212') With this error message. > Msg 547, Level 16, State 0, Line 1 The > INSERT statement conflicted with the > CHECK constraint "CN_CustomerPhoneNo". > The conflict occurred in database > "Accounting", table "dbo.Customers", > column 'Phone'. The statement has been > terminated. I'm sure I'm missing something really simple, but I can't find it. I've tried simplifing the constraint to only 'Phone LIKE '[0-9]'' and inserting a single digit, but it still fails. WTF?
0
[ 2, 4235, 18, 22402, 1202, 101, 636, 387, 8, 518, 500, 230, 22, 38, 730, 186, 15611, 128, 713, 17, 561, 800, 3726, 3726, 48, 25, 14, 28804, 31, 57, 27, 14, 5279, 859, 9, 7835, 859, 5279, 3547, 28804, 13, 9881, 1, 4636, 262, 126...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Best CSS Book === Having just finished reading David Flanagan's "Javascript: The Definitive Guide" (5th edition), I've found that it's got the best explanation I've ever seen of the core functionality of a language. He explains everything, from identifiers and expressions on up, so clearly that it's easy to visualize how every part of the language works. I want to move on to a good CSS book now; I've learned a fair amount of CSS over the years, picked up in bits and pieces, but I'm looking for a good from-the-ground-up CSS book, akin to the aforementioned Javascript book.
4
[ 2, 246, 272, 18, 18, 360, 800, 3726, 3726, 452, 114, 842, 1876, 684, 27956, 22, 18, 13, 7, 1004, 1385, 8741, 45, 14, 15676, 3378, 7, 13, 5, 264, 96, 1322, 6, 15, 31, 22, 195, 216, 30, 32, 22, 18, 330, 14, 246, 5764, 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...
Why would the rollback method not be available for a DBI handle? === For some reason I am having troubles with a DBI handle. Basically what happened was that I made a special connect function in a perl module and switched from doing: do 'foo.pl' to use Foo; and then I do $dbh = Foo->connect; And now for some reason I keep getting the error: Can't locate object method "rollback" via package "Foo" at ../Foo.pm line 171. So the weird thing is that $dbh is definitely not a Foo, it's just defined in foo. Anyway, I haven't had any troubles with it up until now. Any ideas what's up?
0
[ 2, 483, 83, 14, 3001, 1958, 2109, 52, 44, 904, 26, 21, 13, 43, 2161, 3053, 60, 800, 3726, 3726, 26, 109, 1215, 31, 589, 452, 16615, 29, 21, 13, 43, 2161, 3053, 9, 11374, 98, 1190, 23, 30, 31, 117, 21, 621, 6379, 1990, 19, 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...
exporting mysql data to ODF with php === I would like to know if someone triend exporting data from MySQL to an ODF format ? Any information / documentation would be very much appreciated. I am going to try to export a MySQL result set to ODF spreadsheet if possible.
0
[ 2, 7487, 68, 51, 18, 22402, 1054, 20, 635, 8736, 29, 13, 26120, 800, 3726, 3726, 31, 83, 101, 20, 143, 100, 737, 2286, 2451, 7487, 68, 1054, 37, 51, 18, 22402, 20, 40, 635, 8736, 2595, 13, 60, 186, 676, 13, 118, 13945, 83, 44,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Foreign Key naming scheme === I'm just getting started working with foreign keys for the first time and I'm wondering if there's a standard naming scheme to use for them? Given these tables: tasks (taskId, ownerId, title) notes (noteId, taskId, authorId, note); users (userId, name) Where Tasks have Notes, Tasks are owned by Users, and Users author Notes. How would the three foreign keys be named in this situation? Or alternatively, *does it even matter at all*?
0
[ 2, 1228, 1246, 10929, 4276, 800, 3726, 3726, 31, 22, 79, 114, 1017, 373, 638, 29, 1228, 5534, 26, 14, 64, 85, 17, 31, 22, 79, 5712, 100, 80, 22, 18, 21, 1236, 10929, 4276, 20, 275, 26, 105, 60, 504, 158, 7484, 45, 8674, 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...
show running processes in Oracle DB === Is it possible to show other processes in progress on an Oracle database? Something like Sybases `sp_who`
0
[ 2, 298, 946, 5102, 19, 15759, 13, 9007, 800, 3726, 3726, 25, 32, 938, 20, 298, 89, 5102, 19, 3455, 27, 40, 15759, 6018, 60, 301, 101, 10315, 8436, 18, 13, 1, 3401, 1, 1924, 1, 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 programatically add mapped network passwords (WinXP)? === In WinXP (SP2) you can store mapped network passwords... Start->Control Panel->User Accounts->Pick one then choose "Manage my network passwords" from Related Tasks. I normally have about 25-30 servers mapped this way to a few different accounts/domains. The problem is that at some point during our policy updates they get wiped out and it's a real PITA to add them all back again. Does anyone know how to add them programatically using some sort of script?
0
[ 2, 184, 20, 625, 721, 8438, 3547, 20877, 982, 20884, 18, 13, 5, 4181, 396, 306, 6, 60, 800, 3726, 3726, 19, 628, 396, 306, 13, 5, 3401, 135, 6, 42, 92, 1718, 20877, 982, 20884, 18, 9, 9, 9, 799, 8, 1, 12898, 4113, 8, 1, 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...
VB.NET - Iterating through controls in a container object === I have a form with a "Clear" button. When the user clicks "Clear", I want to clear the value of all the visible elements on the form. In the case of date controls, I want to reset them to the current date. All of my controls are contained on a Panel. Right now, I'm doing this with the below code. Is there an easier way than manually checking for each control type? This method seems excessively unwieldy. To make matters worse, in order to recursively clear controls inside sub-containers (i.e., a group box within the panel) I have to repeat the whole monster with an overloaded "GroupBox" version. Private Sub btnClear_Click(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles btnClear.Click 'User clicks Clear, so clear all the controls within this panel ClearAllControls(panMid, True) 'True indicates that yes, i want to recurse through sub-containers End Sub Private Sub ClearAllControls(ByRef container As Panel, Optional Recurse As Boolean = True) 'Clear all of the controls within the container object 'If "Recurse" is true, then also clear controls within any sub-containers Dim ctrl As Control Dim txt As TextBox Dim chkbx As CheckBox Dim cbobx As ComboBox Dim dtp As DateTimePicker Dim pnl As Panel Dim grbx As GroupBox For Each ctrl In container.Controls If (ctrl.GetType() Is GetType(TextBox)) Then txt = CType(ctrl, TextBox) txt.Text = "" End If If (ctrl.GetType() Is GetType(CheckBox)) Then chkbx = CType(ctrl, CheckBox) chkbx.Checked = False End If If (ctrl.GetType() Is GetType(ComboBox)) Then cbobx = CType(ctrl, ComboBox) cbobx.SelectedIndex = -1 End If If (ctrl.GetType() Is GetType(DateTimePicker)) Then dtp = CType(ctrl, DateTimePicker) dtp.Value = Now() End If If Recurse Then If (ctrl.GetType() Is GetType(Panel)) Then pnl = CType(ctrl, Panel) ClearAllControls(pnl, Recurse) End If If ctrl.GetType() Is GetType(GroupBox) Then grbx = CType(ctrl, GroupBox) ClearAllControls(grbx, Recurse) End If End If Next End Sub Private Sub ClearAllControls(ByRef container As GroupBox, Optional ByVal Recurse As Boolean = True) 'Clear all of the controls within the container object 'If "Recurse" is true, then also clear controls within any sub-containers Dim ctrl As Control Dim txt As TextBox Dim chkbx As CheckBox Dim cbobx As ComboBox Dim dtp As DateTimePicker Dim pnl As Panel Dim grbx As GroupBox For Each ctrl In container.Controls If (ctrl.GetType() Is GetType(TextBox)) Then txt = CType(ctrl, TextBox) txt.Text = "" End If If (ctrl.GetType() Is GetType(CheckBox)) Then chkbx = CType(ctrl, CheckBox) chkbx.Checked = False End If If (ctrl.GetType() Is GetType(ComboBox)) Then cbobx = CType(ctrl, ComboBox) cbobx.SelectedIndex = -1 End If If (ctrl.GetType() Is GetType(DateTimePicker)) Then dtp = CType(ctrl, DateTimePicker) dtp.Value = Now() End If If Recurse Then If (ctrl.GetType() Is GetType(Panel)) Then pnl = CType(ctrl, Panel) ClearAllControls(pnl, Recurse) End If If ctrl.GetType() Is GetType(GroupBox) Then grbx = CType(ctrl, GroupBox) ClearAllControls(grbx, Recurse) End If End If Next End Sub
0
[ 2, 13, 20468, 9, 2328, 13, 8, 32, 106, 1880, 120, 8671, 19, 21, 12147, 3095, 800, 3726, 3726, 31, 57, 21, 505, 29, 21, 13, 7, 18600, 7, 5167, 9, 76, 14, 4155, 10840, 18, 13, 7, 18600, 7, 15, 31, 259, 20, 1207, 14, 1923, 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...
Is the SOAP webservice API availiable in the SSRS 2008 express edition? === In other words, if I set up SSRS Express edition will I be able to consume and make calls through the webservice?
0
[ 2, 25, 14, 6447, 2741, 11449, 21, 2159, 24240, 49, 579, 19, 14, 22118, 18, 570, 2999, 1322, 60, 800, 3726, 3726, 19, 89, 715, 15, 100, 31, 309, 71, 22118, 18, 2999, 1322, 129, 31, 44, 777, 20, 16447, 17, 233, 3029, 120, 14, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
Get the name of the currently executing method in Ruby === So $0 is the env variable for the top level Ruby program ... but is there one for the current method?
0
[ 2, 164, 14, 204, 16, 14, 871, 25836, 2109, 19, 10811, 800, 3726, 3726, 86, 5579, 387, 25, 14, 1957, 710, 7612, 26, 14, 371, 662, 10811, 625, 13, 9, 9, 9, 47, 25, 80, 53, 26, 14, 866, 2109, 60, 3, 0, 0, 0, 0, 0, 0, 0, 0...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
C# Console receive input with pipe === I know how to program Console application with parameters, example : myProgram.exe param1 param2. My question is, how can I make my program works with |, example : echo "word" | myProgram.exe?
0
[ 2, 272, 5910, 8650, 2588, 6367, 29, 7642, 800, 3726, 3726, 31, 143, 184, 20, 625, 8650, 3010, 29, 12905, 15, 823, 13, 45, 51, 19746, 9, 1706, 62, 2258, 79, 165, 2258, 79, 135, 9, 51, 1301, 25, 15, 184, 92, 31, 233, 51, 625, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Oracle SQL technique to avoid filling trans log === Newish to Oracle programming (from Sybase and MS SQL Server). What is the "Oracle way" to avoid filling the trans log with large updates? In my specific case, I'm doing an update of potentially a very large number of rows. Here's my approach: UPDATE my_table SET a_col = null WHERE my_table_id IN (SELECT my_table_id FROM my_table WHERE some_col < some_val and rownum < 1000) ...where I execute this inside a loop until the updated row count is zero, Is this the best approach? Thanks,
0
[ 2, 15759, 4444, 255, 4873, 20, 2658, 7702, 2982, 6738, 800, 3726, 3726, 78, 1595, 20, 15759, 3143, 13, 5, 2665, 10315, 8436, 17, 4235, 4444, 255, 8128, 6, 9, 98, 25, 14, 13, 7, 6055, 5615, 161, 7, 20, 2658, 7702, 14, 2982, 6738,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How would you go about implementing the game reversi? (othello) === I have been thinking about starting a side project at home to exercise my brain a bit. R[evers][1]i looks like a simply game, where mobility has a profound effect on game play. It is at least a step up from tic tac toe. I am thinking to try this in C++ on a PC. What issues am I likely to run into? What graphics library would you recommend? What questions am I not smart enough to ask myself? [1]: http://en.wikipedia.org/wiki/Reversi
0
[ 2, 184, 83, 42, 162, 88, 17333, 14, 250, 3867, 445, 49, 60, 13, 5, 2779, 11515, 6, 800, 3726, 3726, 31, 57, 74, 1440, 88, 1422, 21, 270, 669, 35, 213, 20, 5935, 51, 1964, 21, 1142, 9, 761, 2558, 5221, 18, 500, 2558, 165, 500...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 port legacy Java/J2EE website to a modern scripting language (PHP,Python/Django, etc) === I want to move a legacy java web application (J2EE) to a scripting language -- any scripting language -- in order to improve programming efficiency. What is the easiest way to do this? Are there any automated tools that can convert the bulk of the business logic?
0
[ 2, 184, 92, 31, 1295, 7780, 8247, 118, 728, 135, 2851, 2271, 20, 21, 773, 3884, 68, 816, 13, 5, 26120, 15, 6448, 11570, 118, 14365, 14541, 15, 2722, 6, 800, 3726, 3726, 31, 259, 20, 780, 21, 7780, 8247, 2741, 3010, 13, 5, 728, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 make a Java Canvas look raised from its container === I have a simple GUI component written in Java. The class draws an analog clock in a java.awt.canvas. This canvas is then contained in a JFrame - What I want to do is give the canvas a 3d "raised" effect - almost like adding a drop shadow to a photo. Is there a simple way to do this?
0
[ 2, 184, 20, 233, 21, 8247, 9696, 361, 1127, 37, 82, 12147, 800, 3726, 3726, 31, 57, 21, 1935, 9457, 5912, 642, 19, 8247, 9, 14, 718, 10802, 40, 11523, 4229, 19, 21, 8247, 9, 3885, 38, 9, 1245, 8471, 9, 48, 9696, 25, 94, 3437, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 vmWare Server be installed in a X-less host? === I am planning to move my vmWare's Virtual Machines from a Windows host to a Linux host (Ubuntu). It is possible to run vmWare Server in a Linux host that does not have the graphical environment (does not have X)? I just wonder how the graphical setup of Windows/Linux guest work in this case. Thanks in advance for your time. Victor Marquez
0
[ 2, 92, 13, 20147, 5011, 8128, 44, 4066, 19, 21, 993, 8, 923, 2015, 60, 800, 3726, 3726, 31, 589, 2334, 20, 780, 51, 13, 20147, 5011, 22, 18, 6599, 6035, 37, 21, 1936, 2015, 20, 21, 13024, 2015, 13, 5, 4502, 1020, 2473, 6, 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...
Meteor using a local connection results in error: insert failed: 404 -- Method not found === I've got a meteor collection on the client side Friends = new Meteor.Collection("Friends"); Meteor.subscribe("Friends"); I have a user authenticate with facebook and I want to grab a list of their friends: FB.api("/me/friends? auth_token="+response.authResponse.accessToken, function(response){ for (i = 0; i<response.data.length;i++){ Friends.insert(response.data[i]); } ); I have a function to get that list: Template.Friends.all_friends = function(){ return Friends.find(); } I have a template that would like to display all the friends on the screen: <template name="Friends"> {{#each all_friends}} <div id="{{id}}" class="friend"> <img src="http://graph.facebook.com/{{id}}/picture" /> {{name}} </div> {{/each}} </template> What appears to be happening on the page is that all the friends *DO* flash up on the screen for a split second then immediately the screen flashes back to blank. In the javascript console the message appears once per friend I have (yes, it is more than zero, thanks for asking) insert failed: 404 -- Method not found So! What have I missed? Anyone?
0
[ 2, 17522, 568, 21, 375, 2760, 1736, 19, 7019, 45, 14692, 1702, 45, 13, 23397, 13, 8, 8, 2109, 52, 216, 800, 3726, 3726, 31, 22, 195, 330, 21, 17522, 1206, 27, 14, 6819, 270, 954, 800, 78, 17522, 9, 15015, 872, 5, 7, 12299, 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...
Android GridView Items Resizing === I using a GridView to display a feed. If the entry has a background image for it, the image gets loaded from the device or the server. My problem is that when an image is loaded, the gridview's item expands to accomodate the image. I want the image to scale down to fit the box. I have tried using an ImageView with various scaletypes and using the view's background. Nothing seems to work. Any ideas?
0
[ 2, 13005, 7354, 4725, 3755, 10719, 3335, 800, 3726, 3726, 31, 568, 21, 7354, 4725, 20, 3042, 21, 4063, 9, 100, 14, 2792, 63, 21, 2395, 1961, 26, 32, 15, 14, 1961, 3049, 8572, 37, 14, 3646, 54, 14, 8128, 9, 51, 1448, 25, 30, 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...
XMLStreamException while invoking the web service === I published Web Service using JAX-WS RI 2.1.6 in JDK 6. Platform Windows 2003 Enterprise. On linux same use case working. After publishing the web service I am trying to invoke service using JBOSS as client and got the following exception. java.io.IOException: java.io.IOException: An established connection was aborted by the software in your host machine at com.sun.xml.internal.ws.server.SDDocumentImpl.writeTo(SDDocumentImpl. java:267) at com.sun.xml.internal.ws.transport.http.HttpAdapter.publishWSDL(HttpAd apter.java:526) at com.sun.xml.internal.ws.transport.http.HttpAdapter.handle(HttpAdapter .java:218) at com.sun.xml.internal.ws.transport.http.server.WSHttpHandler.handleExc hange(WSHttpHandler.java:95) at com.sun.xml.internal.ws.transport.http.server.WSHttpHandler.handle(WS HttpHandler.java:80) at com.sun.net.httpserver.Filter$Chain.doFilter(Filter.java:65) at sun.net.httpserver.AuthFilter.doFilter(AuthFilter.java:65) at com.sun.net.httpserver.Filter$Chain.doFilter(Filter.java:68) at sun.net.httpserver.ServerImpl$Exchange$LinkHandler.handle(ServerImpl. java:555) at com.sun.net.httpserver.Filter$Chain.doFilter(Filter.java:65) at sun.net.httpserver.ServerImpl$Exchange.run(ServerImpl.java:527) at java.util.concurrent.ThreadPoolExecutor$Worker.runTask(ThreadPoolExec utor.java:886) at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor .java:908) at java.lang.Thread.run(Thread.java:662) **Caused by: javax.xml.stream.XMLStreamException: java.io.IOException: An establis hed connection was aborted by the software in your host machine at com.sun.xml.internal.stream.writers.XMLStreamWriterImpl.close(XMLStre amWriterImpl.java:369) at com.sun.xml.internal.ws.server.SDDocumentImpl.writeTo(SDDocumentImpl. java:265)** I disabled firewall, even after that I am getting above exception. I debugged this issue further, following are my findings As service initialization started before invoking web service following things I observed It invoke to WSHttpHandler. This WSHttpHandler calls HttpAdapter which is registered/created when we publish the Web Service. The WSHttpHandler is used to return the response for the given request. Before serving request it reads the WSDL file using SDDocumentImpl.wrteTo as follows public void writeTo(PortAddressResolver portAddressResolver, DocumentAddressResolver resolver, XMLStreamWriter out) throws XMLStreamException, IOException { for (SDDocumentFilter f : owner.filters) { out = f.filter(this,out); } XMLStreamReader xsr = source.read(); try { out.writeComment(VERSION_COMMENT); new WSDLPatcher(owner.owner,this,portAddressResolver,resolver).bridge(xsr,out); } finally { xsr.close(); } } As per my understanding the "**source.read()**" not able to read WSDL file completely or read operation is timed out. As result above exception is thrown from "bridge" method, where XML parsing is happening line by line and writing it to the **XMLStreamWriter**. The reason I am suspecting time out because when I am debugging issue by adding breakpoint in the the "bridge" method present in **com.sun.xml.internal.ws.util.xml.XMLStreamReaderToXMLStreamWriter** I do not get any exception. Also, after above execution **com.sun.xml.internal.ws.transport.http.server.WSHttpHandler. handler** again invoked and in this run I do not encounter any exception. The WSDL file has been correctly read by XMLStreamReaderToXMLStreamWriter and service at client side is initialized. And I am able to invoke the web service. Can any one please tell me why I am getting XMLStreamException ?
0
[ 2, 23504, 11260, 10066, 872, 133, 19, 2625, 1581, 14, 2741, 365, 800, 3726, 3726, 31, 467, 2741, 365, 568, 11712, 8, 10268, 13, 928, 172, 9, 165, 9, 379, 19, 487, 43, 197, 400, 9, 2452, 1936, 973, 6002, 9, 27, 13024, 205, 275, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
910218 - arabic text are shown ordered from left to right === i have a PDF file including Arabic texts. i've not the original document. i can't see it correctly. in some parts, Arabic texts are ordered when showing from left to right instead of right to left. like when in English you see Hello as olleH! what can i do so that Adobe Acrobat shows it correctly. maybe i need a converter or another viewer?
0
[ 2, 13, 21246, 18665, 13, 8, 6663, 1854, 50, 1721, 1905, 37, 225, 20, 193, 800, 3726, 3726, 31, 57, 21, 13, 11124, 3893, 215, 6663, 6381, 9, 31, 22, 195, 52, 14, 501, 4492, 9, 31, 92, 22, 38, 196, 32, 12044, 9, 19, 109, 1341,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 Inside AJAX Content to Self-Reference More AJAX Content Using jQuery === I asked a similar question just the other day, and thought I had it resolved, but now I realize I do not. I did learn something valuable from the other question, though, so I'm creating this new one rather than removing someone's answer credit. I'll try to be a little more specific about my problem this time around. I have an HTML page that loads in some dynamic AJAX content from a PHP file using a custom function to call jQuery.ajax, e.g.: $('#navigation a').click(function() { var getPage = $(this).attr("class"); generatePage(getPage); }); function generatePage(pageNum) { $('#ajax-content').load(page.php + ' #someDiv-' + pageNum); } So, in this instance, you click on any link in #navigation on the main page and it will drop the content matching its class name (let's say it's "1" in this case, so #someDiv-1) from page.php into the #ajax-content container which is also located on the main page. Fine and well. That part works. The problem arises when I attempt to make a link inside the retrieved AJAX content the same way. So if the retrieved #someDiv-1 content contained a link like: <a href="#" class="4">Page 4</a> How could I make it work so that when clicking on it, it dumps the page.php contents of #someDiv-4 into the mainpage's #ajax-content container? I realize that the container doesn't even exist inside the AJAX content, so is there another way to do this? Seeking an AJAX pro! You don't have to hand me the answer, but a strong shove in the right direction would be much appreciated. Thanks for reading.
0
[ 2, 8247, 8741, 572, 20624, 2331, 20, 1119, 8, 28018, 91, 20624, 2331, 568, 487, 8190, 93, 800, 3726, 3726, 31, 411, 21, 835, 1301, 114, 14, 89, 208, 15, 17, 289, 31, 41, 32, 11052, 15, 47, 130, 31, 4007, 31, 107, 52, 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...
How to get a list of posts Facebook user posted through my app === I want to know how to get list of posts or share done by user to his facebook wall through my app. Regards, Jeeva
0
[ 2, 184, 20, 164, 21, 968, 16, 9868, 9090, 4155, 6054, 120, 51, 4865, 800, 3726, 3726, 31, 259, 20, 143, 184, 20, 164, 968, 16, 9868, 54, 1891, 677, 34, 4155, 20, 33, 9090, 769, 120, 51, 4865, 9, 14179, 15, 4641, 7067, 3, 0, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
FTP alternative to work on a shared file === I would like to know different options or alternatives to ftp server, in order to share a file between a java application and an admin, who can edit that file. The file is just a list, which can be modified by the admin, and it will be read by a CSV parser already implemented: String strFile = "C:\\localPath\\stopphrases.csv"; //create BufferedReader to read csv file BufferedReader br = new BufferedReader( new FileReader(strFile)); String strLine = ""; StringTokenizer st = null; while( (strLine = br.readLine()) != null){ st = new StringTokenizer(strLine, ";"); } The only idea I have is a ftp server, but I am sure there are other possibilities that I don´t know. Thanks in advance
0
[ 2, 1187, 306, 2676, 20, 170, 27, 21, 2592, 3893, 800, 3726, 3726, 31, 83, 101, 20, 143, 421, 6368, 54, 2676, 18, 20, 1187, 306, 8128, 15, 19, 389, 20, 1891, 21, 3893, 128, 21, 8247, 3010, 17, 40, 21, 43, 2160, 15, 72, 92, 93...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Can't ctrl drag Views to header file === Hi I'm very new to ios development. I'm developing a map application where I use mapkit. I have a viewController with the map view and a corresponding viewController class. Now I would like to manipulate the mapView, and is trying to set up the delegate. BUT i can't ctrl+drag anything (includes the mapView) to my header-file. So what do I do then?? I've tried to write the auto implemented stuff in my header-file but this isn't working either :( Any help is really appreciated.. Here's my header-file: #import <UIKit/UIKit.h> #import <MapKit/MapKit.h> #define METERS_PER_MILE 1609.344 @interface MapViewController : UIViewController<MKMapViewDelegate> { } @property (weak, nonatomic) IBOutlet MKMapView *mapView; @end And a note to ios developers what the hell is this drag and drop doing in a IDE?!?
0
[ 2, 92, 22, 38, 13, 4812, 6362, 5501, 4146, 20, 157, 106, 3893, 800, 3726, 3726, 4148, 31, 22, 79, 253, 78, 20, 13, 7760, 522, 9, 31, 22, 79, 3561, 21, 2942, 3010, 113, 31, 275, 2942, 13703, 9, 31, 57, 21, 1418, 12898, 1252, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 add my own layer on someones webpage? === I would like to show a concept to my friends, using someones else webpage. How can I add my own layer over someones webpage? Greasemonkey would work?
0
[ 2, 184, 92, 31, 3547, 51, 258, 5385, 27, 737, 18, 2741, 6486, 60, 800, 3726, 3726, 31, 83, 101, 20, 298, 21, 2420, 20, 51, 954, 15, 568, 737, 18, 962, 2741, 6486, 9, 184, 92, 31, 3547, 51, 258, 5385, 84, 737, 18, 2741, 6486,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0...
how to check if user is online with c++ desktop application === I have application that needs to load local html file if user is offline, if not it will load his web application via embedded control. How to check if user is online with c++ desktop application that has embedded ie browser control?
0
[ 2, 184, 20, 2631, 100, 4155, 25, 2087, 29, 272, 20512, 17404, 3010, 800, 3726, 3726, 31, 57, 3010, 30, 2274, 20, 6305, 375, 13, 15895, 3893, 100, 4155, 25, 168, 1143, 15, 100, 52, 32, 129, 6305, 33, 2741, 3010, 1197, 12138, 569, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
The Facebook application opens in a new window after authorization === My iframe application sends a request to friends via standard Facebook dialog <i>apprequests</i>: function sendRequestViaMultiFriendSelector() { FB.ui({ method: 'apprequests', message: 'Please share link in our bonus application!', title: 'Bonus Application', display: 'iframe' }, requestCallback, "iframe"); } The incoming request contains the following link: http://www.facebook.com/connect/uiserver.php?app_id=**************&method=permissions.request&redirect_uri=http%3A%2F%2Fapps.facebook.com%2F*********%2F%3Ffb_source%3Dnotification%26request_ids%3D*************%26ref%3Dnotif%26app_request_type%3Duser_to_user%26notif_t%3Dapp_request&response_type=none&display=async&auth_referral=1 But I expected something like this: http://apps.facebook.com/***************/?fb_source=notification&request_ids=***************&ref=notif&app_request_type=user_to_user&notif_t=app_request The first link opens a new window instead of opening the application in the same window, where I received a request. I do not need to open a new window after permission/autorization dialog. I want to open a application in the same window. How do i achieve this effect? Thanks
0
[ 2, 14, 9090, 3010, 8965, 19, 21, 78, 1463, 75, 22677, 800, 3726, 3726, 51, 31, 8361, 3010, 11350, 21, 3772, 20, 954, 1197, 1236, 9090, 28223, 13, 1, 49, 1, 7753, 99, 10351, 18, 1, 118, 49, 1, 45, 1990, 2660, 99, 10351, 5034, 2...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to type-cast char* to int* in openCL === Can any one tell me how to typecast a char* pointer to int* in OpenCL kernel function?? I tried ((int*) char_pointer) but it is not working
0
[ 2, 184, 20, 1001, 8, 6146, 4892, 2483, 20, 19, 38, 2483, 19, 368, 5316, 800, 3726, 3726, 92, 186, 53, 494, 55, 184, 20, 1001, 6146, 21, 4892, 2483, 454, 106, 20, 19, 38, 2483, 19, 368, 5316, 17007, 1990, 60, 60, 31, 794, 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, 0, 0...
Database Architecture - dating site === I am developing a dating website that will be based on lots of personal fields that user will must choose from a list - i have 43 diffrent list fields that user must fill - each field has multiple answers options. I have 3 options: 1.to build all site hardcoded and set all the fields and their options in the code - that will be so much difficult to maintenance. 2.another option that i see now is to open a table for each field list and to fill it with its options. 3.to open one table for each field list and to save its name and its id and another table for the field options wich will include fields id , and the name of the options. Those are the options i see - what will be the best way to go? is there any other option i dont know of?
0
[ 2, 6018, 2607, 13, 8, 3974, 689, 800, 3726, 3726, 31, 589, 3561, 21, 3974, 2271, 30, 129, 44, 432, 27, 7503, 16, 1319, 2861, 30, 4155, 129, 491, 3538, 37, 21, 968, 13, 8, 31, 57, 5016, 20811, 8993, 968, 2861, 30, 4155, 491, 35...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Populate select drop down from a database table === I have a table ("venues") that stores all the possible venues a volunteer can work, each volunteer is assigned to work one venue each. I want to create a select drop down from the venues table. Right now I can display the venue each volunteer is assigned, but I want it to display the drop down box, with the venue already selected in the list. <form action="upd.php?id=7"> <select name="venue_id"> <?php //some sort of loop goes here print '<option value="'.$row['venue_id'].'">'.$row['venue_name'].'</option>'; //end loop here ?> </select> <input type="submit" value="submit" name="submit"> </form> For example, volunteer with the id of 7, is assigned to venue_id 4 <form action="upd.php?id=7"> <select name="venue_id"> <option value="1">Bagpipe Competition</option> <option value="2">Band Assistance</option> <option value="3">Beer/Wine Pouring</option> <option value="4" selected>Brochure Distribution</option> <option value="5">Childrens Area</option> <option value="6">Cleanup</option> <option value="7">Cultural Center Display</option> <option value="8">Festival Merch</option> </select> <input type="submit" value="submit" name="submit"> </form> Brochure Distribution option will already be selected when it displays the drop down list, because in the volunteers_2009 table, column venue_id is 4. I know it will take a form of a for or while loop to pull the list of venues from the venues table My query is: $query = "SELECT volunteers_2009.id, volunteers_2009.comments, volunteers_2009.choice1, volunteers_2009.choice2, volunteers_2009.choice3, volunteers_2009.lname, volunteers_2009.fname, volunteers_2009.venue_id, venues.venue_name FROM volunteers_2009 AS volunteers_2009 LEFT OUTER JOIN venues ON (volunteers_2009.venue_id = venues.id) ORDER by $order $sort"; How do I populate the select drop down box with the venues (**volunteers_2009.venue_id**, **venues.id**) from the venues table and have it pre-select the venue in the list?
0
[ 2, 1675, 12383, 5407, 2804, 125, 37, 21, 6018, 859, 800, 3726, 3726, 31, 57, 21, 859, 13, 5, 7, 3124, 4185, 18, 7, 6, 30, 4134, 65, 14, 938, 9771, 21, 5599, 92, 170, 15, 206, 5599, 25, 2467, 20, 170, 53, 5704, 206, 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...
100% in-memory HSQL database === I have a Java application set up as a service to do data-mining against ~3GB of data every few hours. I would like this to occur 100% in memory. Ideally I want the application to be isolated from everything; I want it to construct the database, do the mining I need, and tear down the database when it's done. However with HSQL, even when i use the "create memory table...." command, a log is written of all of the statements and the table is recreated the next time the application runs. I'm doing a LOT of inserts, ~150k+, so this file will quickly grow in size. I also don't care about reconstructing the database upon next run, so the logging is useless to me. I could just delete the file when I'm done, but if possible I'd like to avoid having to write that much to the disk. Is there a way to turn off this feature? Thanks in advance!
0
[ 2, 12849, 19, 8, 790, 5171, 93, 746, 18, 22402, 6018, 800, 3726, 3726, 31, 57, 21, 8247, 3010, 309, 71, 28, 21, 365, 20, 107, 1054, 8, 2160, 68, 149, 13, 1, 240, 11400, 16, 1054, 352, 310, 974, 9, 31, 83, 101, 48, 20, 3744, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 stringize/serialize Ruby code? === I want to be able to write a lambda in my Ruby code, serialize it so that I can write it to disk, and then execute the lambda later. Sort of like... x = 40 f = lambda { |y| x + y } save_for_later(f) Later, in a separate run of the Ruby interpreter, I want to be able to say... f = load_from_before z = f.call(2) z.should == 42 I know Perl has [Data::Dumper](http://search.cpan.org/~jhi/perl-5.8.0/ext/Data/Dumper/Dumper.pm), and in Lisp this is trivial. But is there a way to do it in Ruby? In other words, what would be the implementation of <code>save`_`for`_`later</code>?
0
[ 2, 184, 107, 42, 3724, 2952, 118, 4104, 2815, 2952, 10811, 1797, 60, 800, 3726, 3726, 31, 259, 20, 44, 777, 20, 2757, 21, 13, 24187, 19, 51, 10811, 1797, 15, 5956, 2952, 32, 86, 30, 31, 92, 2757, 32, 20, 8582, 15, 17, 94, 1564...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 compile legacy MFC applications with Visual Studio 2008 ? === I maintain several old MFC applications using Visual Studio 7 and I was considering upgrading to Visual Studio 2008. After reading [this question][1], I realise that the Express edition will not be able to do this. Does anyone know if I will be able to compile old MFC apps with VS2008 Standard edition or will I need to get the more expensive Professional edition ? [1]: http://stackoverflow.com/questions/86562/what-is-missing-in-the-visual-studio-express-editions#86614
0
[ 2, 92, 31, 26561, 7780, 307, 7061, 3767, 29, 3458, 1120, 570, 13, 60, 800, 3726, 3726, 31, 4027, 238, 315, 307, 7061, 3767, 568, 3458, 1120, 453, 17, 31, 23, 5154, 26939, 20, 3458, 1120, 570, 9, 75, 1876, 636, 1565, 1301, 500, 2...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How should C bitflag enumerations be translated into C++? === C++ is mostly a superset of C, but not always. In particular, while enumeration values in both C and C++ implicitly convert into int, the reverse isn't true: only in C do ints convert back into enumeration values. Thus, bitflags defined via enumeration declarations don't work correctly. Hence, this is OK in C, but not in C++: typedef enum Foo { Foo_First = 1<<0, Foo_Second = 1<<1, } Foo; int main(void) { Foo x = Foo_First | Foo_Second; // error in C++ return 0; } How should this problem be handled efficiently and correctly, ideally without harming the debugger-friendly nature of using Foo as the variable type (it decomposes into the component bitflags in watches etc.)? Consider also that there may be hundreds of such flag enumerations, and many thousands of use-points. Ideally some kind of efficient operator overloading would do the trick, but it really ought to be efficient; the application I have in mind is compute-bound and has a reputation of being fast.
0
[ 2, 184, 378, 272, 1142, 22868, 26940, 5757, 44, 4331, 77, 272, 20512, 60, 800, 3726, 3726, 272, 20512, 25, 1555, 21, 1026, 3554, 16, 272, 15, 47, 52, 550, 9, 19, 1498, 15, 133, 26940, 872, 4070, 19, 156, 272, 17, 272, 20512, 202...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Core Animation rotating a layer around arbitrary point === How can i rotate a layer using Core Animation around an arbitrary point? ( in my case a point that is not inside the layer i want to rotate ) I prefer doing this without changing the anchor point, because unless i get something wrong every time i change the anchor point it also changes the position of the layer.
0
[ 2, 2884, 6236, 16164, 21, 5385, 140, 17237, 454, 800, 3726, 3726, 184, 92, 31, 21448, 21, 5385, 568, 2884, 6236, 140, 40, 17237, 454, 60, 13, 5, 19, 51, 610, 21, 454, 30, 25, 52, 572, 14, 5385, 31, 259, 20, 21448, 13, 6, 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 do I create a variant array of BSTR in Euphoria using EuCOM? === So far I've figured out how to pass Unicode strings, bSTRs, to and from a Euphoria DLL using a Typelib. What I can't figure out, thus far, is how to create and pass back an array of BSTRs. The code I have thus far (along with `include`s for EuCOM itself and parts of Win32lib): global function REALARR() sequence seq atom psa atom var seq = { "cat","cow","wolverine" } psa = create_safearray( seq, VT_BSTR ) make_variant( var, VT_ARRAY + VT_BSTR, psa ) return var end function Part of the typelib is: [ helpstring("get an array of strings"), entry("REALARR") ] void __stdcall REALARR( [out,retval] VARIANT* res ); And the test code, in VB6 is: ... Dim v() as String V = REALARR() ... So far all I've managed to get is an error '0' from the DLL. Any ideas? Anyone?
0
[ 2, 184, 107, 31, 1600, 21, 8320, 7718, 16, 334, 9729, 19, 22484, 15062, 568, 2898, 960, 60, 800, 3726, 3726, 86, 463, 31, 22, 195, 5700, 70, 184, 20, 1477, 28010, 7887, 15, 334, 9729, 18, 15, 20, 17, 37, 21, 22484, 15062, 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...
In SQL Server 2008 how can I secure data in a way that it cannot be decrypted unless connected to a network? === We have recently implemented Transparent Data Encryption in SQL Server 2008 for local databases on our developers laptops to keep them protected in the case a laptop is stolen or lost. This works fine. Now we are trying to figure out a way to have the certificate expire everyday, forcing an automated process (a script on logon maybe) to go out to a network path the grab a new certificate with an expiration for a day later. This would ensure that if something unforeseen happened, the data would not be usable the next day. I also looked into using a Cryptographic provider but there doesn't appear to be any "providers" out there. Maybe I'm wrong. I am open to suggestions. If there is a better way please let me know. Thanks!
0
[ 2, 19, 4444, 255, 8128, 570, 184, 92, 31, 4315, 1054, 19, 21, 161, 30, 32, 1967, 44, 121, 11435, 69, 4003, 2587, 20, 21, 982, 60, 800, 3726, 3726, 95, 57, 1989, 6807, 14862, 1054, 24420, 19, 4444, 255, 8128, 570, 26, 375, 6018, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Are brittle unit tests always a bad thing? === At times I find a very brittle test to be a good thing because when I change the intent of the code under test I want to make sure my unit test breaks so that I'm forced to refactor ... is this approach not recommended when building a large suite of regression tests?
0
[ 2, 50, 25226, 1237, 4894, 550, 21, 896, 584, 60, 800, 3726, 3726, 35, 436, 31, 477, 21, 253, 25226, 1289, 20, 44, 21, 254, 584, 185, 76, 31, 753, 14, 6936, 16, 14, 1797, 131, 1289, 31, 259, 20, 233, 562, 51, 1237, 1289, 7947, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
which is the best book/tutorial for a Web Services newbie? === [sorry for my english] Hi, I'm a Newbie in Web Services. I've a java desktop app and some JSP/Servlets working fine, and I need to comm. both with the logic, (must be) using java. Which book/tutorial/how-to you recomend? Thanks
0
[ 2, 56, 25, 14, 246, 360, 118, 2473, 9819, 192, 26, 21, 2741, 687, 78, 5893, 60, 800, 3726, 3726, 636, 8959, 26, 51, 486, 500, 4148, 15, 31, 22, 79, 21, 78, 5893, 19, 2741, 687, 9, 31, 22, 195, 21, 8247, 17404, 4865, 17, 109,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
scp via java === What is the best method of performing an scp transfer via the Java programming language? It seems I may be able to perform this via JSSE, JSch or the bouncy castle java libraries. None of these solutions seem to have an easy answer.
0
[ 2, 13, 18, 7439, 1197, 8247, 800, 3726, 3726, 98, 25, 14, 246, 2109, 16, 2955, 40, 13, 18, 7439, 2617, 1197, 14, 8247, 3143, 816, 60, 32, 2206, 31, 123, 44, 777, 20, 2985, 48, 1197, 487, 9557, 15, 487, 2992, 54, 14, 5963, 1438...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Converting C source to C++ === How would you go about converting a reasonably large, fairly mature C codebase to C++? The kind of C I have in mind is split into files roughly corresponding to modules (i.e. less granular than a typical OO class-based decomposition), using internal linkage in lieu private functions and data, and external linkage for public functions and data. Global variables are used extensively for communication between the modules. There is a very extensive integration test suite available, but no unit (i.e. module) level tests. I have in mind a general strategy: 1. Compile everything in C++'s C subset and get that working. 1. Convert modules into huge classes, so that all the cross-references are scoped by a class name, but leaving all functions and data as static members, and get that working. 1. Convert huge classes into instances with appropriate constructors and initialized cross-references; replace static member accesses with indirect accesses as appropriate; and get that working. 1. Now, approach the project as an ill-factored OO application, and write unit tests where dependencies are tractable, and decompose into separate classes where they are not; the goal here would be to move from one working program to another at each transformation. Obviously, this would be quite a bit of work. Are there any case studies / war stories out there on this kind of translation? Alternative strategies? Other useful advice? [For the sake of the question, assume that translation into **C++** is mandatory, and that leaving it in C is **not** an option.]
0
[ 2, 19583, 272, 1267, 20, 272, 20512, 800, 3726, 3726, 184, 83, 42, 162, 88, 19583, 21, 19531, 370, 15, 6647, 8615, 272, 1797, 8436, 20, 272, 20512, 60, 14, 825, 16, 272, 31, 57, 19, 594, 25, 2132, 77, 6488, 4457, 7265, 20, 17113...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
IDL declaration (in C++) that will let me pass an array of INT_PTR from C# === I am working with an existing code base made up of some COM interfaces written in C++ with a C# front end. There is some new functionality that needs to be added, so I'm having to modify the COM portions. In one particular case, I need to pass an array (allocated from C#) to the component to be filled. What I would like to do is to be able to pass an array of IntPtr to the method from C#, something like: // desired C# signiture void GetFoo(int bufferSize, IntPtr[] buffer); A couple of wrenches in the works: - C++\CLI or Managed C++ can't be used (COM could be done away with in this case). - The C# side can't be compiled with /unsafe (using Marshal is allowed). The COM interface is only used (an will only ever be used by) the C# part, so I'm less concerned with interoperability with other COM consumers. Eventually, it will be replaced by just C++/CLI, but that is a ways off. ---------- My initial attempt ------------------ is something similar to: HRESULT GetFoo([in] int bufferSize, [in, size_is(bufferSize)] INT_PTR buffer[]); And the output TLB definition is (seems reasonable): HRESULT _stdcall GetFoo([in] int bufferSize, [in] INT_PTR* buffer); Which is imported by C# as (not so reasonable): void GetFoo(int bufferSize, ref int buffer); Which I *could* use with int[] b = ...; fixed(int *bp = &b[0]) { GetFoo(b.Length, ref *bp); } ...except that I can't compile with /unsafe. ---------- At the moment ------------- I am using: HRESULT GetFoo([in] int bufferSize, [in] INT_PTR buffer); Which imports as: void GetFoo(int bufferSize, int buffer); And I need use use it like: int[] b = ...; GCHandle bPin = GCHandle.Alloc(b, GCHandleType.Pinned); try { GetFoo(b.Length, (int)Marshal.UnsafeAddrOfPinnedArrayElement(b, 0)); } finally { bPin.Free(); } Which works..., but I'd like to find a cleaner way. ---------- So, the question is ------------------- Is there an IDL definition that is friendly to the C# import from TLB generator for this case? If not, what can be done on the C# side to make it a little safer?
0
[ 2, 31, 8643, 7098, 13, 5, 108, 272, 20512, 6, 30, 129, 408, 55, 1477, 40, 7718, 16, 19, 38, 1, 4417, 139, 37, 272, 5910, 800, 3726, 3726, 31, 589, 638, 29, 40, 3149, 1797, 1000, 117, 71, 16, 109, 13, 960, 6573, 18, 642, 19, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to choose colors in web development === When I build a site I tend to do a bit of graphic design (developer style) in Paint.NET, but how do I know the colors will all display properly on all browsers on different machines? What color depth to you generally code for? 16bit 256 colors etc.
0
[ 2, 184, 20, 3538, 5268, 19, 2741, 522, 800, 3726, 3726, 76, 31, 1895, 21, 689, 31, 5480, 20, 107, 21, 1142, 16, 8479, 704, 13, 5, 26051, 106, 1034, 6, 19, 5107, 9, 2328, 15, 47, 184, 107, 31, 143, 14, 5268, 129, 65, 3042, 74...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 show compulsory fields on a windows form === How should I show users which fields are compulsory in a windows forms application. I have considered changing the label color or maybe the background color of the text box.
0
[ 2, 184, 20, 298, 17397, 2861, 27, 21, 1936, 505, 800, 3726, 3726, 184, 378, 31, 298, 3878, 56, 2861, 50, 17397, 19, 21, 1936, 1997, 3010, 9, 31, 57, 724, 4226, 14, 1899, 1665, 54, 913, 14, 2395, 1665, 16, 14, 1854, 1649, 9, 3,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
Is there a Ruby .NET Compiler? === Is there a .NET Framework compiler for the Ruby language? I've heard of the DLR (Dynamic Language Runtime), is this going to enable Ruby to be used with .NET development?
0
[ 2, 25, 80, 21, 10811, 13, 9, 2328, 21486, 60, 800, 3726, 3726, 25, 80, 21, 13, 9, 2328, 6596, 21486, 26, 14, 10811, 816, 60, 31, 22, 195, 752, 16, 14, 13, 43, 12988, 13, 5, 20985, 816, 485, 891, 6, 15, 25, 48, 228, 20, 924...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...