Search Results

Search found 22900 results on 916 pages for 'pascal case'.

Page 294/916 | < Previous Page | 290 291 292 293 294 295 296 297 298 299 300 301  | Next Page >

  • mysql UNION query not working

    - by kalpaitch
    What am I doing wrong with this: $sql = "SELECT * FROM content WHERE threadName LIKE '%$filter%' ORDER BY lastUpdated desc UNION SELECT * FROM content WHERE threadName NOT LIKE '%$filter%' ORDER BY lastUpdated desc"; The first statement before the UNION works well on its own, but this one above returns: mysql_fetch_array() warning - supplied argument is not a valid MySQL result resource Am I right in believing that UNION will not return duplicate entries, in which case the second SELECT statement doesn't need to have the NOT LIKE but will just return everything that wasn't listed in the first statement.

    Read the article

  • ASP.NET Repeater datasource bound to a function. Would it call the function twice?

    - by Frenchie
    In the code behind I have a function that returns a List(Of SomeClass): rptRepeater.DataSource = SomeFunction(SomeVariable) rptRepeater.DataBind() In the html I have a basic repeater layout and am using the below code to get the Properties of each object returned. <%#Databinder.Eval(Container.DataItem, "Parameter1")% My question is, would there ever be a case that it would execute the Function more than once?

    Read the article

  • Coding styles for html

    - by Hulk
    Hi, Please the coding standard followed for HTML .Please suggest links that the has the coding styles for html.(like Camel case or .....) <table> <tr> <td> Data </td> </tr> </table> Thanks..

    Read the article

  • SQL IF ELSE BEGIN END

    - by Swami
    If there are no begin and end statements in sql, the next statement is the only one that gets executed if the if condition is true...in the case below, is there anyway the insert statement will also get executed if the if condition is true? IF (a > 1) SET @b = 1 + 2 INSERT INTO #F (a, b, c) VALUES (1, 2, 3)

    Read the article

  • c# uploading file - error

    - by user228058
    I have a webpage where the user can upload an excel file. I'm trying 2 different files - one works without a problem, and the other one gives me this error: Error: Length cannot be less than zero. Parameter name: length I know that sometimes this occurs when the file size is zero, but that is not the case here. Can anyon shed light on this issue? Please let me know if you need more info.

    Read the article

  • Variable declared with variable keyword in sql plus(oracle 9i)?

    - by Vineet
    I am trying to declare g_num ,number data type with size it gives an error but in case of varchar2,char it does not. variable g_name varchar2(5);//correct accept size for varchar 2 variable g_num number(23);//Gives an error " VAR[IABLE] [ <variable> [ NUMBER | CHAR | CHAR (n [CHAR|BYTE]) | VARCHAR2 (n [CHAR|BYTE]) | NCHAR | NCHAR (n) | NVARCHAR2 (n) | CLOB | NCLOB | REFCURSOR ] ]" Please suggest!

    Read the article

  • When creating an bitmap image from scratch in VB.Net, the quality stinks?

    - by ajl
    The Vb.Net application creates a bitmap from scratch and either converts to a tiff or sends it to a printer. In both cases, the quality of the image (in this case the font) is not good at all. The sample code listed below creates the graphics object that I use to write to the image. Dim gr2 As Graphics = Graphics.FromImage(New Bitmap(800, 1000), Imaging.PixelFormat.Format32bppPArgb))

    Read the article

  • Re-indexing table; update with from

    - by David Thorisson
    The query says it all, I can't find out the right syntax without without using a for..next UPDATE Webtree SET Webtree.Sorting=w2.Sorting FROM ( SELECT BranchID, CASE WHEN @Index>=ROW_NUMBER() OVER(ORDER BY Sorting ASC) THEN ROW_NUMBER() OVER(ORDER BY Sorting ASC) ELSE ROW_NUMBER() OVER(ORDER BY Sorting ASC)+1 END AS Sorting FROM Webtree w2 WHERE w2.ParentID=@ParentID ) WHERE Webtree.BranchID=w2.BranchID

    Read the article

  • Generate vCard from AddressBook.framework

    - by Oliver
    I'm utilising the AddressBook.framework in my iPhone app, and I'd like to replicate something along the lines of the share feature in Contacts.app. This basically attach's a specific contacts vCard to an email. As far as I know, there is nothing in the documentation that mentions generating a vCard. Is this a case of generating one myself? Or is there something available that can help me?

    Read the article

  • Jquery Validation Watermark

    - by Sandeep
    I am using jQuery validation plugin and Watermark plugin. The problem I am facing is when i applied a watermark to any input field for which validation is also applied then validations are failing For Example: <input type=text name=myinput class="required"> and I applied a watermark for this field in document ready function: $("#myinput ").Watermark("myinput "); This is the sample case where validation is failing as value=myinput is set for input field which is watermarked.

    Read the article

  • Does a wrapper class for a COM interop IStream already exist?

    - by AnthonyWJones
    I'm about to write a Wrapper for a COM interop IStream so that code that expects a standard .NET Stream can use it. However it occurs to me that this sort of thing may already have been done before (although I haven't been able to find it myself with web searching). So I'm just putting this out here in case I'm about to re-invent the wheel. Note I've come across code implementing IStream wrapping a .NET stream but I need the reverse.

    Read the article

  • Immutable Dictionary overhead?

    - by Roger Alsing
    When using immutable dictionaries in F# , how much overhead is there when adding / removing entries? Will it treat entire buckets as immutable and clone those and only recreate the bucket whos item has changed? Even if that is the case, it seems like there is alot of copying that needs to be done in order to create the new dictionary(?)

    Read the article

  • QueryPerformanceCounter Not Working Properly on Amazon EC2 with Win Server 2008

    - by timeitquery
    Our application makes use of QueryPerformanceCounter to measure timings. When running it on Amazon EC2 instances we are noticing number that are out of whack. The symptoms look very similar to what has been reported with virtualized machines on HP proreliant servers, however all the articles state that this was not the case for Windows Server 2008. The articles recommended modifing the boot.ini to /USEPMTIMER - however, this seem to be missing from the documentation on bcdedit - which replaced boot.ini

    Read the article

  • DateTime.Now question

    - by Tony
    Hello, I am using a couple varaibles that have value of DateTime.now for both database and web services purpose. Now, if someone asks you that how I am handling non-machine timezone, is that question refering that how the code will handle in case if the application gets deployed to machines in different time zones? To give more information, the application will manipulate data from different time zones. Thank you.

    Read the article

  • Using HTTP Pipelining with Jetty HTTPClient

    - by jrogi
    I'm trying to figure out how to use HTTPClient (org.eclipse.jetty.client.HttpClient) so it will pipeline HTTP Request. I've tried to create some HttpExchange instances and applying the send() method for each, in an asynchronous mode, but each HTTP request has waited for it response before the next request was sent. Can you please supply a code snippet for this case?

    Read the article

  • Regexp: Replace only in specific context

    - by blinry
    In a text, I would like to replace all occurrences of $word by [$word]($word) (to create a link in Markdown), but only if it is not already in a link. Example: [$word homepage](http://w00tw00t.org) should not become [[$word]($word) homepage](http://w00tw00t.org). Thus, I need to check whether $word is somewhere between [ and ] and only replace if it's not the case. Can you think of a preg_replace command for this?

    Read the article

  • Segmenting a double array of labels

    - by Ami
    The Problem: I have a large double array populated with various labels. Each element (cell) in the double array contains a set of labels and some elements in the double array may be empty. I need an algorithm to cluster elements in the double array into discrete segments. A segment is defined as a set of pixels that are adjacent within the double array and one label that all those pixels in the segment have in common. (Diagonal adjacency doesn't count and I'm not clustering empty cells). |-------|-------|------| | Jane | Joe | | | Jack | Jane | | |-------|-------|------| | Jane | Jane | | | | Joe | | |-------|-------|------| | | Jack | Jane | | | Joe | | |-------|-------|------| In the above arrangement of labels distributed over nine elements, the largest cluster is the “Jane” cluster occupying the four upper left cells. What I've Considered: I've considered iterating through every label of every cell in the double array and testing to see if the cell-label combination under inspection can be associated with a preexisting segment. If the element under inspection cannot be associated with a preexisting segment it becomes the first member of a new segment. If the label/cell combination can be associated with a preexisting segment it associates. Of course, to make this method reasonable I'd have to implement an elaborate hashing system. I'd have to keep track of all the cell-label combinations that stand adjacent to preexisting segments and are in the path of the incrementing indices that are iterating through the double array. This hash method would avoid having to iterate through every pixel in every preexisting segment to find an adjacency. Why I Don't Like it: As is, the above algorithm doesn't take into consideration the case where an element in the double array can be associated with two unique segments, one in the horizontal direction and one in the vertical direction. To handle these cases properly, I would need to implement a test for this specific case and then implement a method that will both associate the element under inspection with a segment and then concatenate the two adjacent identical segments. On the whole, this method and the intricate hashing system that it would require feels very inelegant. Additionally, I really only care about finding the large segments in the double array and I'm much more concerned with the speed of this algorithm than with the accuracy of the segmentation, so I'm looking for a better way. I assume there is some stochastic method for doing this that I haven't thought of. Any suggestions?

    Read the article

  • How to with extract url from tweet using Regular Expressions

    - by neutreno
    Ok so i'm executing the following line of code in javascript RegExp('(http:\/\/t.co\/)[a-zA-Z0-9\-\.]{8}').exec(tcont); where tcont is equal to some string like 'Test tweet to http://t.co/GXmaUyNL' (the content of a tweet obtained by jquery). However it is returning, in the case above for example, 'http://t.co/GXmaUyNL,http://t.co/'. This is frustracting because I want the url without the bit on the end - after and including the comma. Any ideas why this is appearing? Thanks

    Read the article

  • Checkbox control in Asp.Net

    - by Sivakumar
    Hello, Actually I'm trying to capture person's current and permanent address. In this case if d current and permanent address same means no need to enter twise. Here I'm using a checkbox. If d checkbox s checked the current address plased in permanent address too. Help me to do tat.

    Read the article

  • Stateful EJBs in web application?

    - by Sebastien Lorber
    Hello I never used stateful EJBs. I understand that a stateful EJB can be useful with a java client. But i wonder: in which case to use them on a web application? And how? Should we put these stateful beans in Session (because of stateless http)? Is it a good practice? (without debating too much about stateful vs stateless)

    Read the article

< Previous Page | 290 291 292 293 294 295 296 297 298 299 300 301  | Next Page >