Search Results

Search found 21814 results on 873 pages for 'morgan may'.

Page 311/873 | < Previous Page | 307 308 309 310 311 312 313 314 315 316 317 318  | Next Page >

• MySQL query String contains

  - by arik-so

  Hello. This may sound easy, but I've been trying - in vain, apparently - to figure out how I can make a query with MySQL that checks if the value (string $haystack ;) ) in a certain column contains certain data ( $needle ;) ), like this: mysql_query(" SELECT * FROM `table` WHERE `column`.contains('{$needle}') "); In PHP, the function is called substr($haystack, $needle), so maybe: WHERE substr(`column`, '{$needle}')=1 Thanks in advance!

  Read the article

• ARM assembly puzzle

  - by ivant

  First of all, I'm not sure if solution even exists. I spent more than a couple of hours trying to come up with one, so beware. The problem: r1 contains an arbitrary integer, flags are not set according to its value. Set r0 to 1 if r1 is 0x80000000, to 0 otherwise, using only two instructions. It's easy to do that in 3 instructions (there are many ways), however doing it in 2 seems very hard, and may very well be impossible.

  Read the article

• CSS image float div problem in IE6

  - by Ben Dauphinee

  In the bottom cap of this page (bottom with corners) I seem to be having a weird IE6 issue. I've tried Google with no luck, as really, how do you ask this question. In IE6, the corner images that are floated left and right seem to cause the whitespace to drop. http://www.duncanhadleytriathlon.ca/ Any suggestions for why this may be?

  Read the article

• Matrix of the diagonal sobel operator of size 3x3

  - by erjik

  What is the matrix of sobel operator of size 3x3 if the operator is said to be diagonal (Left or right diagonal)? EDIT: or may be with more bigger size

  Read the article

• php array filter

  - by benmsia

  Hi i would like to filter array in php. for example $a = ARRAY('a', 'b', 'c', 'd', 'e'); $b = ARRAY('c', 'd'); $a will be filtered by values in array $b and result is ['a', 'b', 'e'] may I know how to do it in php? Thank you.

  Read the article

• Truncating double without rounding in C

  - by Coder

  Lets consider we have a double R = 99.999999; (which may be obtained by a result of some other computation),now the desired output is 99.99 I tried using printf("%.2lf",R); but it's rounding off the value.How to get the desired output ? (preferably using printf)

  Read the article

• EF exception: Could not find file CodeGenerationSchema.xsd

  - by DK

  I'm using Entity Framework for a new project (VS 2008, .net 3.5 sp1) and "reasonably happy" with it, especially compared to dataset-based solutions. One of recurring annoyances is "Could not find file CodeGenerationSchema.xsd" exception during application startup. Exception seems to re-appear rather frequently after changes to the model. Googling gives temporary and strange workarounds for this error: Delete .suo file, or Set Options Debugging General Enable Just My Code = On May be someone have more permanent, straightforward fix or can explain the reason of this issue.

  Read the article

• NANT: ReplaceToken, loop over all properties defined in build

  - by SharePoint Newbie

  Hi, Is it possible to loop over all the properties and replace all token which correspond to them? For example, if I have three properties defined, a,b,c, I want to replace all three tokens @a@, @b@, @c@ . I however do not want to set up the filterchain manually as properties may be added/removed later on. I can accomplish this using a custom nant task, but is ther a way to do this through a build file alone. Thanks,

  Read the article

• What is the most easy way to get in advanced Type Theory.

  - by Bubba88

  Of course, by 'advanced' I mean here just something beyond what every programmer does know. I'm currently more-or-less comfortable with the basics and want to understand the most important, most elegant and most practically applicable achievements of modern type theory. I just do not have much time, desire and mental powers to study all the formalistics more thoroughly and that may change in the future. But there is something really attractive for me in that branch, that just forces to ask silly questions like this :) Thank you very much!

  Read the article

• How can I access a byte array as shorts in Java

  - by shellback3

  I have a an array of byte, size n, that really represents an array of short of size n/2. Before I write the array to a disk file I need to adjust the values by adding bias values stored in another array of short. In C++ I would just assign the address of the byte array to a pointer for a short array with a cast to short and use pointer arithmetic or use a union. How may this be done in Java - I'm very new to Java BTW.

  Read the article

• How to write a package (developed on Ubuntu 9.10) for installation on a Debian server

  - by Stick it to THE MAN

  I have written a number of applications and libraries (some of which depend on third party libraies), on my home workstation (Ubuntu 9.10). I now want to create packages (one package per application/library), so that I may then install them on my server, which will be running Debian OS. Any guidelines/gotchas on how to go about creating installation packages for debian on Ubuntu?

  Read the article

• Drupal: assign block to a specific content type

  - by bert

  I made a customized template called node-mynode.tpl.php Whenever a node of type mynode is requested, then node-mynode.tpl.php is automatically used. However, now user wants to see a specific menu block in this case. Question: How can I assign a block to a specific content type? Hint: I have started to look at URL aliases with Pathauto. I suspect one solution may lie in this direction.

  Read the article

• Find the element with the most "neighbors" in a sequence

  - by Bao An

  Assume that we have a sequence S with n elements <x1,x2,...,xn>. A pair of elements xi,xj are considered neighbors if |xi-xj|<d, with d a given distance between two neighbors. So how can find out the element that has most neighbors in the sequence? (A simply way is sorting the sequence and then calculating number of each element but it's time complexity is quite large): O(nlogn) May you please help me find a better way to reduce time complexity?

  Read the article

• Rails (pagination and tags)

  - by Vitaly

  Hey, I stumbled upon a problem of how to mix both acts_as_taggable (on steroids) and will_paginate gems. What I found on this problem is this: http://www.mckinneystation.com/2007/08/20/pagination-with-acts_as_taggable_on_steroids-acts_as_ferret-and-will_paginate/ But it's dated of 2007, may be there's something more recent? And also could you explain in details what should I do to make that fix work?

  Read the article

• implement bank using python programming

  - by prajakta

  Write software for a bank. The program should be menu driven with the facility for bank employees to perform various operations. It should be written using all concepts of Object Oriented programming. You should be able to save your data in a file and read it back (because the bank people will shut down their computers when they go home :p ) Guidelines: The program may select to implement classes like Bank, Account, Savings Account, Fixed Deposit account, Customer, Depositor, Borrower, Transaction, etc.

  Read the article

• Is 23,148,855,308,184,500 a magic number, or sheer chance?

  - by Roddy

  News reports such as this one indicate that the above number may have arisen as a programming bug. A man in the United States popped out to his local petrol station to buy a pack of cigarettes - only to find his card charged $23,148,855,308,184,500. That is $23 quadrillion (£14 quadrillion) - many times the US national debt.* In hex it's $523DC2E199EBB4 which doesn't appear terribly interesting at first sight. Anyone have any thoughts about what programming error would have caused this?

  Read the article

• update app invalid help

  - by Florent

  hi all trying to update my app on itunes connet i get the following : The binary you uploaded was invalid. The executable name, as reported by CFBundleExecutable in the Info.plist file, may not contain any of these characters: \ [ ] { } ( ) . + * please i v searched the web no one encountered this error thanks

  Read the article

• mounting ext4 fs with block size of 65536

  - by seaquest

  I am doing some benchmarking on EXT4 performance on Compact Flash media. I have created an ext4 fs with block size of 65536. however I can not mount it on ubuntu-10.10-netbook-i386. (it is already mounting ext4 fs with 4096 bytes of block sizes) According to my readings on ext4 it should allow such big block sized fs. I want to hear your comments. root@ubuntu:~# mkfs.ext4 -b 65536 /dev/sda3 Warning: blocksize 65536 not usable on most systems. mke2fs 1.41.12 (17-May-2010) mkfs.ext4: 65536-byte blocks too big for system (max 4096) Proceed anyway? (y,n) y Warning: 65536-byte blocks too big for system (max 4096), forced to continue Filesystem label= OS type: Linux Block size=65536 (log=6) Fragment size=65536 (log=6) Stride=0 blocks, Stripe width=0 blocks 19968 inodes, 19830 blocks 991 blocks (5.00%) reserved for the super user First data block=0 1 block group 65528 blocks per group, 65528 fragments per group 19968 inodes per group Writing inode tables: done Creating journal (1024 blocks): done Writing superblocks and filesystem accounting information: done This filesystem will be automatically checked every 37 mounts or 180 days, whichever comes first. Use tune2fs -c or -i to override. root@ubuntu:~# tune2fs -l /dev/sda3 tune2fs 1.41.12 (17-May-2010) Filesystem volume name: <none> Last mounted on: <not available> Filesystem UUID: 4cf3f507-e7b4-463c-be11-5b408097099b Filesystem magic number: 0xEF53 Filesystem revision #: 1 (dynamic) Filesystem features: has_journal ext_attr resize_inode dir_index filetype extent flex_bg sparse_super large_file huge_file uninit_bg dir_nlink extra_isize Filesystem flags: signed_directory_hash Default mount options: (none) Filesystem state: clean Errors behavior: Continue Filesystem OS type: Linux Inode count: 19968 Block count: 19830 Reserved block count: 991 Free blocks: 18720 Free inodes: 19957 First block: 0 Block size: 65536 Fragment size: 65536 Blocks per group: 65528 Fragments per group: 65528 Inodes per group: 19968 Inode blocks per group: 78 Flex block group size: 16 Filesystem created: Sat Feb 5 14:39:55 2011 Last mount time: n/a Last write time: Sat Feb 5 14:40:02 2011 Mount count: 0 Maximum mount count: 37 Last checked: Sat Feb 5 14:39:55 2011 Check interval: 15552000 (6 months) Next check after: Thu Aug 4 14:39:55 2011 Lifetime writes: 70 MB Reserved blocks uid: 0 (user root) Reserved blocks gid: 0 (group root) First inode: 11 Inode size: 256 Required extra isize: 28 Desired extra isize: 28 Journal inode: 8 Default directory hash: half_md4 Directory Hash Seed: afb5b570-9d47-4786-bad2-4aacb3b73516 Journal backup: inode blocks root@ubuntu:~# mount -t ext4 /dev/sda3 /mnt/ mount: wrong fs type, bad option, bad superblock on /dev/sda3, missing codepage or helper program, or other error In some cases useful info is found in syslog - try dmesg | tail or so

  Read the article

• #div_iv a:hover not working

  - by Jean

  Hello, This may seem stupid to ask, but I have done on many css coding #div_iv a:hover but for darn reason, it does not seem to work now, Googled with results such as a.hover #div_iv #div_iv:hover What exactly is wrong. Thanks Jean

  Read the article

• linq to sql with nservicebus table lock issue

  - by IGoor

  I am building a system using NServiceBus and my DataLayer is using Linq 2 SQL. The system is made up of 2 services. Service1 receives messages from NSB. It will query Table1 in my database and inserts a record into Table1 If a certain condition is met a new NSB message is sent to the 2nd service Service2 will update records also in Table1 when it receives messages from Service1 and it does some other non database related work. Service2 is a long running process. The problem I am having is the moment Service2 updates a record in Table1, the table is locked. The lock seems to be in place until Service2 has completed all it is processing. i.e. The lock is not released after my datacontext is disposed. This causes the query in Service1 to timeout. Once Service2 completes processing, Service1 resumes processing again without problem. So for example Service1 code may look like: int x =0; using (DataContext db = new DataContext()) { x = (from dp in db.Table1 select dp).Count(); // this line will timeout while service2 is processing Table1 t = new Table1(); t.Data = "test"; db.Table1.InsertOnSubmit(t); db.SubmitChanges(); } if(x % 50 == 0) CallService2(); The code in service2 may look like: using (DataContext db = new DataContext()) { Table1 t = db.Table1.Where(t => t.id == myId); t.Data = "updated"; db.SubmitChanges(); } // I would have expected the lock to have been released at this point, but this is not the case. DoSomeLongRunningTasks(); // lock will be released once service2 exits I don't understand why the lock is not released when the datacontext is disposed in Service2. To get around the problem I have been calling: db.ExecuteCommand("SET TRANSACTION ISOLATION LEVEL READ UNCOMMITTED"); and this works, but I am not happy using it. I want to solve this problem properly. Has any one experienced this sort of problem before and does any one know how to solve it? Why is the lock not released after the datacontext has been disposed? Thanks in advance. p.s. sorry for the extremely long post.

  Read the article

• SQL Update to the SUM if it's joined values

  - by CL4NCY

  Hi, I'm trying to update a field in the database to the sum of it's joined values: UPDATE P SET extrasPrice = SUM(E.price) FROM dbo.BookingPitchExtras AS E INNER JOIN dbo.BookingPitches AS P ON E.pitchID = P.ID AND P.bookingID = 1 WHERE E.[required] = 1 When I run this I get the following error: "An aggregate may not appear in the set list of an UPDATE statement." Any ideas?

  Read the article

• Updating a single file in a compressed tar

  - by Phil

  Given a compressed archive file such as application.tar.gz which has a folder application/x/y/z.jar among others, I'd like to be able to take my most recent version of z.jar and update/refresh the archive with it. Is there a way to do this other than something like the following? tar -xzf application.tar.gz cp ~/myupdatedfolder/z.jar application/x/y tar -czf application application.tar.gz I understand the -u switch in tar may be of use to avoid having to untar the whole thing, but I'm unsure how to use it exactly.

  Read the article

• Mathematica: get number of arguments passed to a function?

  - by dbjohn

  How do I get the number of arguments passed to a function, such as Plus[2,3,4,5] has 4 arguments passed to it. I was thinking it may involve the use of the function Length and getting the arguments into a list. The intention is to iterate an operation based on the number of arguments for a function. There is probably a simple solution or function but I haven't come across it yet. Any other ways or suggestions are welcome as well?

  Read the article

• What is your most irritating quirk of t-sql

  - by Jude Wood

  I realise this is a bit flippant but it may highlight some 'interesting' features of t-sql. Or just provide some light distraction on a Friday morning... I'm currently torn between t-sql allows three part naming when dropping tables but not when dropping procudures and When using Coalesce to produce a delimited string the presence of a leading delimiter is dependant on whether the delimited string was initialised prior to calling Coalesce I'd be interested to hear yours......

  Read the article

• Is there a way to identify which web framework is used in a site?

  - by ragu.pattabi

  Whenever I come across a cute website, I am always curious to know which web framework was used by its developers? Being a novice in web development, a look at the page source doesn't give any clue. Any way(s) to get this information? If possible, may be with a bit of Ruby magic, I can figure out things like: which is the most/least used framework for my favorite sites, audio/video heavy sites, etc.

  Read the article

< Previous Page | 307 308 309 310 311 312 313 314 315 316 317 318  | Next Page >