Hi all
I am using windows authentication within an ASP.NET application. I am wondering how to best get the objectGuid from the currently logged in user?
Regards, Egil.
I've got a few books and helpful guides to Perl from my company's scripting guy, but I can't seem to find where the best IDE for Perl is.
Mind you, simple is better. I'm just learning for now.
I am a web Developer. Even I do web design but I use the TABLE method for HTML, I want to learn Tableless coding (Div based).
Can anybody suggest me Few Best sites for learn Div Based Coding.
We need to write a .Net (C#) application that monitors all mail activity through a POP, SMTP and Exchange Server (2007 and later) and essentially grab the mail for archiving into a document management system. I realise that the way to monitor each type of server would probably be different so I'd like to know what the best (most elegant and reliable) way is to achieve this.
Thanks.
Hi all,
I need an array to hold member-function-pointers of different classes. How can I define the array?
The code should look like this :
arr[0] = &CMyClass::FuncX;
arr[1] = &CYourClass::FuncY;
arr[2] = &CHerClass::FuncZ;
I tried void*, but it doesn't work.
Thanks.
Best regards,
Zach@Shine
I have written a thread which I've started using the start method but I'm not able to know when the thread has done executing the method and destroy the thread object.
_ProgressThread = New Thread(AddressOf ExecProc)
_ProgressThread.IsBackground = False
_ProgressThread.Start()
//the flow of execution should come here only after the thread has executed the method
//but its coming and executing this line after the thread has started.
_ProgressThread = Nothing
What is the best method. Please help.
If I have a large amount of data in memory, what is the best way to copy it into a SQL CE table? The current technology stack is C#, ADO.net, and SQL CE.
My initial idea was to do one INSERT statement for each row of data, but this is time-consuming. Is there an easier way?
I have some unit tests that expects the 'current time' to be different than DateTime.Now and I don't want to change the computer's time, obviously. What's the best strategy to achieve this?
Thanks
I'm using a third-party API to send messages to users. But this third-party limits 30 calls per hour. I'm using PHP on linux.
What's the best way to implement this?
Hello all - many thanks again to people who have kindly offered help (especially to Mark for his outstanding response to my previous question).
I would like to plot implicit equations (of the form f(x,y)=g(x,y) eg. x^y=y^x) in Matplotlib. Is this possible?
All the best,
Geddes
I have an std::string containing a command to be executed with execv, what is the best "C++" way to convert it to the "char *argv[]" that is required by the second parameter of execv()?
To clarify:
std::string cmd = "mycommand arg1 arg2";
char *cmd_argv[];
StrToArgv(cmd, cmd_argv); // how do I write this function?
execv(cmd_argv[0], cmd_argv);
Hi All,
I am writing an application and for this to make it safe I have decided to HtmlEncode and HtmlDecode the data to avoid Javascript Injection and Paramaterised queries to avoid Sql injection.
But I want to know whether these are the best ways to avoid these attacks and what are the other ways to damage the application that I should take into consideration.
In my ViewModel I have two commands:
ICommand ExecuteMeOnCheck { get; }
ICommand ExecuteMeOnUncheck { get; }
I wish to attach these commands to a CheckBox and have one of them execute when it is checked and the other execute when it is unchecked. What's the best way to achieve this without cluttering the View with code-behind?
When building an ASP.NET MVC application with High Availability is it best practice to keep the session state on the SQL Server, if there is no state server available?
Dear all,
There is a nonzero() method for the csr_matrix of scipy library, however trying to use that function for csr matrices result in an error, according to the manual that should return a tuple with row and colum arrays. Any ideas on this problem?
Best regards,
Umut
What is the best we can do with run length encoding.
http://en.wikipedia.org/wiki/Run-length_encoding Page suggests the time complexity is O(m*n) where m is the number of time the number repeats ..
Is the a more efficient algorithm to do RLE ??
Hello all,
Being quite new to liferay/portal/portlet development you run into problems daily . Now i'm trying to for a logout from a portlet but have not found a way to accomplish that. How are you supposed to do that? Should I try to send some kind of logout event or something? Greping around in the liferay sources i have found a LogoutAction.java that seems promising but how do one trigger that?
Best Regards Anders Olme
Which is the best overall hash algorithm. md5 or sha1. From what I know md5 is faster that sha1 but SHA1 is more complex than md5.
I am missing anything
I have to write client program in C# that have to take some data from DB and sent it to my Google application(Java). How can I do that? What is the best way to do that?
I am trying to store a username and password to hash against for future offline logging in. What is the best way to do this in objective c?
I will need the password to be stored securely.
Which .NET programming libaries do you use most ?
I'm putting together a list, kind of "best of" SourceForge, CodePlex, Google Code, GitHub, etc.
SourceForge.NET
Nhibernate (database ORM)
SharpZipLib (ZIP compression)
itextsharp (PDF library)
GitHub:
JQuery (JavaScript)
Google Code:
aforge (imaging)
Codeplex:
Excel Data-Reader
Other:
bouncycastle.org (Encryption)
I am trying to add new Elements in an HTML page body by using document.createElement via Javascript, I am doing this with few if/else case and function callings. All is working fine.
Recently I came to know that I can do this with JQuery, too. I have not done too much of coding yet so I was wondering which way is the best in terms of efficiency ? Using native DOM methods or using JQuery to add elements dynamically on the page?
On the wikipedia entry for k-d trees, an algorithm is presented for doing a nearest neighbor search on a k-d tree. What I don't understand is the explanation of step 3.2. How do you know there isn't a closer point just because the difference between the splitting coordinate of the search point and the current node is greater than the difference between the splitting coordinate of the search point and the current best?