Search Results

Search found 30252 results on 1211 pages for 'network programming'.

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

Page 355/1211 | < Previous Page | 351 352 353 354 355 356 357 358 359 360 361 362  | Next Page >

  • How to implemenet Password Resets

    - by Sanju
    Hi, I have an existing application that i want to implement password resets after 30 days. But i dont want the user to use the same password as the last 5 times. How do i go about doing this or is there any links i can follow. Please help Thanks,

    Read the article

  • Impressing Potential Employers

    - by superfly123
    Where I am, I can't afford to get certification. I'm definitely not the best programmer, but I do know my junk. I've been writing software in C++ for over 8 years now and have a very good knowledge of the Win32 API. But when applying for jobs, I get rejected every time I send a resume. I've given my resume to recruitment firms and asked them what they think's wrong with it and they said the only thing they could think of is the fact that I don't have certifications to prove that I know my stuff. But in my resume, I explain my previous work and projects, and also note that upon request they can actually see what I've done. Is there anything that you would suggest that might help others to stop ignoring my resumes? Thank you

    Read the article

  • Saving information in the IO System

    - by djTeller
    Hi Kernel Gurus, I need to write a kernel module that simulate a "multicaster" Using the /proc file system. Basically it need to support the following scenarios: 1) allow one write access to the /proc file and many read accesses to the /proc file. 2) The module should have a buffer of the contents last successful write. Each write should be matched by a read from all reader. Consider scenario 2, a writer wrote something and there are two readers (A and B), A read the content of the buffer, and then A tried to read again, in this case it should go into a wait_queue and wait for the next message, it should not get the same buffer again. I need to keep a map of all the pid's that already read the current buffer, and in case they try to read again and the buffer was not changed, they should be blocked until there is a new buffer. I'm trying to figure it there is a way i can save that info without a map. I heard there are some redundant fields inside the I/O system the I can use to flag a process if it already read the current buffer. Can someone give me a tip where should i look for that field ? how can i save info on the current process without keeping a "map" of pid's and buffers ? Thanks!

    Read the article

  • Switching from php to python

    - by ts
    Hello I am trying to make a list of things which can be difficult/surprising to someone who is changing language from PHP to Python. so far i have rather short list: forget require / include, learn import (this was most difficult to me - to understand package - module - class - object hierarchy and its mapping to filesystem) you can't just upload file on server to have webpage (-mod_python, wsgi etc) learn the python way for use variable class names (new $class() vs import + getattr) / operator in python 2.x and all float-related horrors those were difficult to me, it takes few days before mind adapts a new paradigm after i found that there is few other areas which could be challenging for someone with (too) many years of php: everything is an object you have to live with exceptions array vs list, set, dictionary, tuple ... learn (effective) list comprehensions learn generators any other ideas / personal experiences ?

    Read the article

  • Why can I not have two SocketServers bound to two different ports in the same application?

    - by uriDium
    I am using .Net 3.5 and Windows XP not sure if any more information is needed. I have an application that creates a socket, binds to a port and starts listening. A client comes and connects and then disconnects no problem. It can then reconnect no problem. If I have to sockets each listening on a different (e.g. 50 000 and 55 000) then it will accept the connection but it will not allow a reconnect. I will post source code if needed but I am assuming that it is just something simple that I am not catching.

    Read the article

  • Why is Objective-C not very popular outside of the Apple community?

    - by Tattat
    I know that the Apple community – including Mac and iPhone developers – mainly use Objective-C for their development language. But it seems that not many people use Objective-C outside of the Apple community, such as in the Windows or Linux worlds. What are the possible reasons that Objective-C is not particularly popular outside of the Apple community?

    Read the article

  • correct function parameters designation

    - by david
    Every time i pass some parameters to a JavasScript or jQuery functon, i use some random letters. What are the correct letters for the corresponding variable types? function(o){} for example is for a object. But what are the other letters? Do someone have a list of those?

    Read the article

  • what is the accepted naming convention for int, string, array, list, object, etc...

    - by RJ
    The company I work for now uses a set naming convention for their C# variables such as iSomeName for int, sSomeName for string, aSomeName for arrays, bSomeName for boolean, dSomeName for datetime and so on. My previous employer did not use the i, s, a, b and d prefixes and just named the variables a good understandable name. My impression is that these prefixes lost favor a while ago and from what I read it is not the current trend. It seems fine to me either way as long as the variable is descriptive enough to understand what it is doing but I was wondering what the now-a-day accepted practice is for naming variables?

    Read the article

  • .NET framework is copied to 'compiler/CLR' and 'GAC?

    - by prosseek
    The book of CLR via C# has this line at page 76. When you install the .NET Framework, tow copies of Microsoft's assembly files are actuall installed. One set is installed into the compiler/CLR directory, and another set is installed into GAC subdirectory I could find the GAC at C:\Windows\Microsoft.NET\assembly, but I couldn't find the compiler/CLR thing. What's the physical directory name of compiler/CLR? I mean, where is it? Why there are two GAC in assembly directory? I find GAC_32 and GAC_MSIL.

    Read the article

  • errors on shell

    - by lego69
    somebody knows what does this error mean? Usage: tcsh [ -bcdefilmnqstvVxX ] [ argument ... ]. I receive this error after I enter in my script this row #! /bin/tcsh -f

    Read the article

  • What type of programs are C/C++ used for now?

    - by Ryan Detzel
    I started off with C in school, went to Java and now I primarily use the P's(Php, Perl, Python) so my exposure to the lower level languages have all but disappeared. I would like to get back into it but I can never justify using C over Perl or Python. What real-world apps are being built with these languages? Any suggestions if I want to dive back in, what can I do with C/C++ that I can't easily do with Perl/Python?

    Read the article

  • Why call-by-value evaluation strategy is not Turing complete?

    - by Roman
    I'm reading an article about different evaluation strategies (I linked article in wiki, but I'm reading another one not in English). And it says that unlike to call-by-name and call-by-need strategies, call-by-value strategy is not Turing complete. Can anybody explain, please, why is it so? If it's possible, add an example pls.

    Read the article

  • Functional equivalent of if (p(f(a), f(b)) a else b

    - by oxbow_lakes
    I'm guessing that there must be a better functional way of expressing the following: def foo(i: Any) : Int if (foo(a) < foo(b)) a else b So in this example f == foo and p == _ < _. There's bound to be some masterful cleverness in scalaz for this! I can see that using BooleanW I can write: p(f(a), f(b)).option(a).getOrElse(b) But I was sure that I would be able to write some code which only referred to a and b once. If this exists it must be on some combination of Function1W and something else but scalaz is a bit of a mystery to me! EDIT: I guess what I'm asking here is not "how do I write this?" but "What is the correct name and signature for such a function and does it have anything to do with FP stuff I do not yet understand like Kleisli, Comonad etc?"

    Read the article

  • What 20 Lines (or less) of code did you find really useful?

    - by Ygam
    You can share your code or other's code. Here's a snippet from an array function in Kohana: public static function rotate($source_array, $keep_keys = TRUE) { $new_array = array(); foreach ($source_array as $key => $value) { $value = ($keep_keys === TRUE) ? $value : array_values($value); foreach ($value as $k => $v) { $new_array[$k][$key] = $v; } } return $new_array; } It was helpful when I was uploading multiple images using multiple file upload forms. It turned this array array('images' => array( 'name' => array( 0 => 'img1', 1 => 'img0', 2 =>'img2' ), 'error' => array( 0 => '', 1 => '', 2 => '' into : array('images' => array( 0 => array( 'name' => 'img1' 'error' => '' ),//rest goes here How about you? What 20 or less lines of code did you find useful?

    Read the article

  • Multiplying numbers on horizontal, vertial, and diagonal lines

    - by untwisted
    I'm currently working on a project Euler problem (www.projecteuler.net) for fun but have hit a stumbling block. One of the problem provides a 20x20 grid of numbers and asks for the greatest product of 4 numbers on a straight line. This line can be either horizontal, vertical, or diagonal. Using a procedural language I'd have no problem solving this, but part of my motivation for doing these problems in the first place is to gain more experience and learn more Haskell. As of right now I'm reading in the grid and converting it to a list of list of ints, eg -- [[Int]]. This makes the horizontal multiplication trivial, and by transposing this grid the vertical also becomes trivial. The diagonal is what is giving me trouble. I've thought of a few ways where I could use explicit array slicing or indexing, to get a solution, but it seems overly complicated and hackey. I believe there is probably an elegant, functional solution here, and I'd love to hear what others can come up with.

    Read the article

  • possible implementations of casting in c++

    - by lego69
    I have this snippet of the code in my header: class A { private: int player; public: A(int initPlayer = 0); A(const A&); A& operator=(const A&); ~A(); void foo() const; friend int operator==(const A& i, const A& member) const; }; implementation of the operator== int operator==(const A& i, const A& member) const{ if(i.player == member.player){ return 1; } return 0; } and I need casting for this part of my code: A *pa1 = new A(a2); assert(i == *pa1); i - is some int, which my function receives I receive an error non-member function, How can I fix it? thanks in advance

    Read the article

  • piping to variables

    - by lego69
    cut -d" " -f2 ${2} | $callsTo hello, can somebody please explain can I pipe the result of cut to variable callsTo, and how will it be stored, as the string or list?

    Read the article

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

< Previous Page | 351 352 353 354 355 356 357 358 359 360 361 362  | Next Page >