Search Results

Search found 20883 results on 836 pages for 'wont say'.

Page 283/836 | < Previous Page | 279 280 281 282 283 284 285 286 287 288 289 290  | Next Page >

  • Does anyone have experience simultaneously running a Drupal and Wordpress site and redirecting some

    - by DKinzer
    This is a really weird question and I apologize: I've been asked if it's possible not to import our blog from Wordpress to Drupal but just keep it in Wordpress as an archive and re-direct our users say from hostname/blog/... to hostname/wordpress/... when a URL matches the Wordpress URL pattern. I've never heard of anyone trying this and I'm wondering about pitfalls and whether or not it's even possible. Thanks! D

    Read the article

  • Editing an UIImage

    - by wwrob
    I have an UIImage that I want to edit (say, make every second row of pixels black). Now I am aware of the functions that extract PNG or JPEG data from the image, but that's raw data and I have no idea how the png/jpeg files work. Is there a way I can extract the colour data from each pixel into an array? And then make a new UIImage using the data from the array?

    Read the article

  • How can I debug expect_before behaviour

    - by itj
    I am relatively new to TCL / expect and mostly modifying existing code. expect_before doesn't seem to do what I expect (which is fine) but I can't work out how to debug it. I have used -d option and am now using exp_internal -f "argh.log" 1 to create a log file, but it isn't helping me. expect_before -info seems useful, but I am not able to grab / display the output (I did say I was new to TCL)

    Read the article

  • mysql insert multiple rows, return rows that failed

    - by Glenn
    When I try to insert (lets say) 30 rows in my table. For example INSERT INTO customers(cust_name, cust_address, cust_city, cust_state, cust_zip, cust_country) VALUES( 'Pep E. LaPew', '100 Main Street', 'Los Angeles', 'CA', '90046', 'USA' ), ( 'M. Martian', '42 Galaxy Way', 'New York', 'NY', '11213', 'USA' ), ... ; And cust_name has to be unique. How can I then identify the records that failed to insert because their cust_name already exists? Is it possible to return them?

    Read the article

  • Powerbuilder "runtime"

    - by dariopy
    I've copied (not installed) a system developed with Powerbuilder, from a salvaged hard drive. I want to run the application, but of course, it asks for several DLLs and stuff like that, which are not registered in my current system. My question: is there a procedure to install a "powerbuilder runtime", so to say, in order to run the application?

    Read the article

  • WCF Operation contract availability

    - by nettguy
    This question was asked at interview. Say I have a contract. [ServiceContract] public interface IMyService { [OperationContract] void methodForClientA(); [OperationContract] void AnothermethodForClientA(); [OperationContract] void methodForClientB(); [OperationContract] void AnothermethodForClientB(); } When a clientA access the contract it should only see the operation contracts void methodForClientA(),void AnothermethodForClientA(). Is it possible in WCF ?

    Read the article

  • Rails: Easiest way to provide file downloads?

    - by Schroedinger
    G'day guys, currently have almost finished writing a rails application that allows a CSV download of the database. This is generated when the index is first viewed. Is there an easy way to insert a link to a helper that returns a CSV document? That is to say is it easy to insert links to helpers? This would make a lot of problems I've been having much easier

    Read the article

  • DateTime.AddMonths question

    - by grady
    Hello, lets say, I have 28th of February 2010 and add one months to this date using AddMonths(1)...the resulting date is 28th of March, but not 31st of March, which I want. Is there a way to tweak that a bit so this works without adding custom code? Thanks!

    Read the article

  • Makefiles, symlinked folder & relative paths

    - by l.thee.a
    Let say I have the following folders: /A/C /D/B/E /D/B/C (this is a symlink to /A/C created by ln -s) When one of the makefiles tries to use the path /D/B/C/../E it gets a "no file or directory" error. I understand why this happens; /A/E does not exist. However I have to use symlinks to populate the B folder and create the build tree (very long story). Any ideas?

    Read the article

  • what is the easiest way to do this function in c# ?

    - by From.ME.to.YOU
    Hello let say that we have an array [5,5] 01,02,03,04,05 06,07,08,09,10 11,12,13,14,15 16,17,18,19,20 21,22,23,24,25 the user should send 2 values to the function (start,searchFOR) for example (13,25) the function should search for that value in this way 07,08,09 12, ,14 17,18,19 if the value is n't found in this level it will goes a level higher 01,02,03,04,05 06, , , ,10 11, , , ,15 16, , , ,20 21,22,23,24,25 if the array is bigger than this and the value didn't found it will go to a level higher Thanks for your help

    Read the article

  • Throwing cats out of windows

    - by AndrewF
    Imagine you're in a tall building with a cat. The cat can survive a fall out of a low story window, but will die if thrown from a high floor. How can you figure out the longest drop that the cat can survive, using the least number of attempts? Obviously, if you only have one cat, then you can only search linearly. First throw the cat from the first floor. If it survives, throw it from the second. Eventually, after being thrown from floor f, the cat will die. You then know that floor f-1 was the maximal safe floor. But what if you have more than one cat? You can now try some sort of logarithmic search. Let's say that the build has 100 floors and you have two identical cats. If you throw the first cat out of the 50th floor and it dies, then you only have to search 50 floors linearly. You can do even better if you choose a lower floor for your first attempt. Let's say that you choose to tackle the problem 20 floors at a time and that the first fatal floor is #50. In that case, your first cat will survive flights from floors 20 and 40 before dying from floor 60. You just have to check floors 41 through 49 individually. That's a total of 12 attempts, which is much better than the 50 you would need had you attempted to use binary elimination. In general, what's the best strategy and it's worst-case complexity for an n-storied building with 2 cats? What about for n floors and m cats? Assume that all cats are equivalent: they will all survive or die from a fall from a given window. Also, every attempt is independent: if a cat survives a fall, it is completely unharmed. This isn't homework, although I may have solved it for school assignment once. It's just a whimsical problem that popped into my head today and I don't remember the solution. Bonus points if anyone knows the name of this problem or of the solution algorithm.

    Read the article

  • How do you return stolen packets back to Netfilter

    - by meg18019
    Let's say I have intercepted a packet from Netfilter and subsequently returned NF_STOLEN. At some point I want to re-inject that packet back to, in this case, the TCP stream it came from. I want to do this from Kernel space. So far I have been unable to find a way to do this. Thanks for the help.

    Read the article

  • VS2005 COMPLITION PROBLEM WITH SETTINGS

    - by vijay.j
    Hi all i am trying to integrating PJNSMTPCONNECTION CLASSES in my project,they say that those classes donot uses mfc. MY project is with the setting like MT, and using standard library linking, when i try to complie i am getting CSTRING not defined and fatal error C1189: #error : WINDOWS.H already included. MFC apps must not #include if i include afx.h and remove windows.h, i am getting iDLLMain aleardy defined like errors

    Read the article

  • MySQL create view from concat value

    - by cnotethegr8
    Lets say I have a table as follows, +----+-------------+ | id | value | +----+-------------+ | 1 | aa,bb,cc,dd | | 2 | ee,ff,gg,hh | +----+-------------+ I want to be able to search this table to see if id = 1 AND value = 'cc'. Im assuming a good way of doing this is to grab the id = 1 row and split its values into separate rows in a new view. Something like, +-----+ | val | +-----+ | aa | | bb | | cc | | dd | +-----+ I would like to do all of this in MySQL. How can i do this, and is there possibly a better way to do it?

    Read the article

  • How to partially ftp a file (using ftp, wget with shell scripts or php)?

    - by Dave
    hi, i want to partially download a ftp file. i just need to download lets say 10MB, but after skipping 100MB (for example). In php, http://php.net/manual/en/function.ftp-fget.php this function allows arbitay starting point: bool ftp_fget ( resource $ftp_stream , resource $handle , string $remote_file , int $mode [, int $resumepos = 0 ] ) however it does not allow me to set "how many bytes" i want to download.

    Read the article

  • Django - urls.py - Filenames with a hash/pound (#) sign?

    - by miya
    I'm using django and realized that when the filename that the user wants to access (let's say a photo) has the pound sign, the entry in the url.py does not match. Any ideas? url(r'^static/(?P<path>.*)$', 'django.views.static.serve', {'document_root': MEDIA_ROOT}, it just says: "/home/user/project/static/upload/images/hello" does not exist when actually the name of the file is: hello#world.jpg Thanks, Nico

    Read the article

  • Dynamically loading jQuery library from a custom component and ensuring only one instance.

    - by Paul Lucas
    Say I have a web component that uses jQuery and I want to distribute it as a packaged component. I need a way to ensure that the jQuery library is available on or after the page loads, but I also want to check that the containing html page, or another unknown component that may reference jQuery hasn't already added the library to the page. At the moment the best example I've seen is this http://www.squidoo.com/load-jQuery-dynamically It would need a little tweaking, but I was wondering if there were any other best practices.

    Read the article

< Previous Page | 279 280 281 282 283 284 285 286 287 288 289 290  | Next Page >