Search Results

Search found 5101 results on 205 pages for 'expression trees'.

Page 161/205 | < Previous Page | 157 158 159 160 161 162 163 164 165 166 167 168  | Next Page >

• Troubles with NSString writeToFile

  - by Jesse

  Hi everyone, I have been working on a simple text editor in Cocoa/Objective-C for a practice project and I have come across an error that I would never have expected. I have an NSString for my file's contents as well as an NSString for it's path. When I attempt to write the contents to a file, I use the following method: [FileContents writeToFile: CurrentFileName atomically: NO encoding: NSStringEncoding error: nil]; I've used this method many times without error yet today, I am getting an error: "Expected expression before 'NSStringEncoding'" If anyone can help me out with this it would be greatly appreciated. I can't figure out what could be causing the error. Thanks a lot!

  Read the article

• Jquery Match() IP Address?

  - by user1635970

  I'm using a jquery script to validate form fields. This works well, but I'd like to change the validation of one field to check for IP Addresses. The regex I want to use is : \b(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\b How do I amend the below to work with this ? (This is how the validation works for email address) jQuery("#Email").validate({ expression: "if (VAL.match(/^[^\\W][a-zA-Z0-9\\_\\-\\.]+([a-zA-Z0-9\\_\\-\\.]+)*\\@[a-zA-Z0-9_]+(\\.[a-zA-Z0-9_]+)*\\.[a-zA-Z]{2,4}$/)) return true; else return false;", message: "Should be a valid Email id" });

  Read the article

• (.*) instead of (.*?)

  - by EBAGHAKI

  Suppose we have this html content, and we are willing to get Content1, Content2,.. with regular expression. <li>Content1</li> <li>Content2</li> <li>Content3</li> <li>Content4</li> If I use the line below preg_match_all('/<li>(.*)<\/li>/', $text, $result); i will get an array with a single row containing: Content1</li> <li>Content2</li> <li>Content3</li> <li>Content4 And by using this code: preg_match_all('/<li>(.*?)<\/li>/', $text, $result); i will get an array with 4 row containing Content1, Content2, ... Why (.*) is not working since it means match any character zero or more times

  Read the article

• Generating Fibonacci series in F#

  - by photo_tom

  I'm just starting to learn F# using VS2010 and below is my first attempt at generating the Fibonacci series. What I'm trying to do is to build a list of all numbers less than 400. let fabList = let l = [1;2;] let mutable a = 1 let mutable b = 2 while l.Tail < 400 do let c = a + b l.Add(c) let a = b let b = c My first problem is that on the last statement, I'm getting an error message "Incomplete structured construct at or before this point in expression" on the last line. I don't understand what I'm doing wrong here. While this seems to be an obvious way to build the list in a fairly efficient way (from a c++/C# programmer), from what little I know of f#, this doesn't seem to feel to be the right way to do the program. Am I correct in this feeling?

  Read the article

• Question marks in Java generics.

  - by gnucom

  I tried to make sure this wasn't a duplicate post, sorry if I was blind. This is a small snippet of code taken from some of the examples that accompany the Stanford Parser. I've been developing in Java for about 4 years, but have never had a very strong understanding of what this style of code is supposed to indicate. List<? extends HasWord> wordList = toke.tokenize(); I'm not worried about the details of the code. What I'm confusing about is what exactly the generic expression is supposed to convey, in English. Can someone explain this to me? Thanks!

  Read the article

• valid xml element in java replaceAll doesnt seem working well

  - by John

  Im trying to create a xml file from a POJO , in which i have a property that stores urls, I have been using the below method to replace all & in the url String to make the xml conform to standards and pass it as an html char entity but the string does not change. public static String forHrefAmpersand(String aURL){ return aURL.replaceAll("&", "&"); } the value might be www.abc.com/controller?a=1&next=showResults I have even tried changing the above method to use "/" as i read replaceAll uses regular expression but replaceAll is not working as exprected, Can anyone tell me what is the mistake im doing ? Thanks in advance

  Read the article

• haskell. words into binary numbers

  - by Katja

  I need to convert words into binary numbers. With a bit help of yours I got this blCo::String -> Integer blCo x = num2bin(lett2num x) blCo (x:xs) | x:xs = num2bin(lett2num x):blCo xs num2lett :: Int -> Char num2lett n | (n <= ord 'A') && (n <= ord 'Z') = chr(ord 'A'+ n - 1) | (n <= ord 'a') && (n <= ord 'Z') = chr(ord 'A'+ n - 1) num2bin :: Integer -> String num2bin n | n >= 0 = concatMap show (reverse ( n2b n)) | otherwise = error "num2bin: negative number" where n2b 0 = [] n2b n = n `mod` 2 : n2b (n `div` 2) he tells me a mistake.I dont undertsand it mistake: Couldn't match expected type `Char' against inferred type `String' In the first argument of `lett2num', namely `x' In the first argument of `num2bin', namely `(lett2num x)' In the expression: num2bin (lett2num x)

  Read the article

• Regex: How to leave out webding font characters?

  - by DS

  Hi, I've a free text field on my form where the users can type in anything. Some users are pasting text into this field from Word documents with some weird characters that I don't want to go in my DB. (e.g. webding font characters) I'm trying to get a regular expression that would give me only the alphanum and the punctuation characters. But when I try the following, the output is still all the characters. How can I leave them out? <html><body><script type="text/javascript">var str="???????";document.write(str.replace(/[^a-zA-Z 0-9 [:punct]]+/g, " "));</script></body></html>

  Read the article

• Java or C# + XNA for some simple animations?

  - by lala

  I want to make a program that will involve some faces with various facial expressions. They will change from one facial expression to another based on their "mood" as influenced by user input. I know some java but I have done pretty much nothing with graphics. A friend tells me that it will be easier to do this in C# with XNA than to do it in java. I have about a month to do this, so I was hoping you folks would help me make a decision. Would I be better off figuring out how to do this in java, or learning C# and XNA and doing it in C#? Is it so much easier to do this in C# that it would be quicker to learn C# than to struggle with doing it in java? Will it probably come out looking much better if it is in C#?

  Read the article

• Replacing the end of the line by SED in makefile

  - by Masi

  How can you append to the end of a line by SED controlled by makefile? I run paste -d" " t.tex tE.tex | sed 's@$@XXX@' > tM.tex where the problem is in the use of the mark $ for the end of the line. I get #paste -d" " t.tex tE.tex | sed -e s/" "/\\\&/g | sed -r "s/XXX/" > tM.tex sed: -e expression #1, char 10: unterminated `s' command make: *** [all] Error 1 I have the command just after the "all:" tag in my makefile which contains only the two lines. The parameters -n and -e do not help here. The command works as expected run when it is run directly in terminal.

  Read the article

• Is there a way in C# 4.0 to have a method take a delegate with the parameters baked in?

  - by Rob Packwood

  I have this code for reporting on a simple demo app I am writing: private static void ReportOnTimedProcess(Action process) { var stopwatch = new Stopwatch(); stopwatch.Start(); process(); stopwatch.Stop(); Console.WriteLine("Process took {0} seconds", stopwatch.ElapsedMilliseconds*1000); } I basically want to track the time of any process. I am trying to have this method take a delegate as a parameter that can have any number of varying parameters. Is there some way an Expression can do this?

  Read the article

• Why isn't the compiler smarter in this const function overloading problem?

  - by Frank

  The following code does not compile: #include <iostream> class Foo { std::string s; public: const std::string& GetString() const { return s; } std::string* GetString() { return &s; } }; int main(int argc, char** argv){ Foo foo; const std::string& s = foo.GetString(); // error return 0; } I get the following error: const1.cc:11: error: invalid initialization of reference of type 'const std::string&' from expression of type 'std::string* It does make some sense because foo is not of type const Foo, but just Foo, so the compiler wants to use the non-const function. But still, why can't it recognize that I want to call the const GetString function, by looking at the (type of) variable I assign it to? I found this kind of surprising.

  Read the article

• Multiple LIKE, OR MySql Queries Match

  - by Codex73

  Search for: 'chemist' Problem: query which will match a string like 'onechemist' but not 'chemist'. SELECT id,name FROM `records` WHERE name LIKE '%". mysql_real_escape_string($q) ."%' This alternate try won't work: SELECT id,name FROM `records` WHERE name LIKE '%". mysql_real_escape_string($q) ."%' OR name LIKE '". mysql_real_escape_string($q) ."%' OR name LIKE '%". mysql_real_escape_string($q) ."' How could I compile the above into one single query that will match any field which has the string or optimize the query into a better expression?

  Read the article

• Scheduling a visual studio load test using powershell giving me BSOD

  - by user952342

  I have a visual studio load test which I want to run every hour so that I can start to collect some data. To do this, I thought it would be best to make a little powershell script and put a command like this inside: Invoke-Expression -command "& '$env:VS100COMNTOOLS..\IDE\mstest.exe' /testcontainer:"C:\Users\benb\Documents\Visual Studio 2010\Projects\BBPerformanceTest\bin\Debug\HomePageOnly.loadtest"" That command works fine, but sometimes when its run I get a blue screen of death. However, when I run my load test through the visual studio GUI, I never get a BSOD. two questions: is it possible to avoid this BSOD? Is there another way I can schedule my load test? Thanks

  Read the article

• Type signature "Maybe a" doesn't like "Just [Event]"

  - by sisif

  I'm still learning Haskell and need help with the type inference please! Using packages SDL and Yampa I get the following type signature from FRP.Yampa.reactimate: (Bool -> IO (DTime, Maybe a)) and I want to use it for: myInput :: Bool -> IO (DTime, Maybe [SDL.Event]) myInput isBlocking = do event <- SDL.pollEvent return (1, Just [event]) ... reactimate myInit myInput myOutput mySF but it says Couldn't match expected type `()' against inferred type `[SDL.Event]' Expected type: IO (DTime, Maybe ()) Inferred type: IO (DTime, Maybe [SDL.Event]) In the second argument of `reactimate', namely `input' In the expression: reactimate initialize input output process I thought Maybe a allows me to use anything, even a SDL.Event list? Why is it expecting Maybe () when the type signature is actually Maybe a? Why does it want an empty tuple, or a function taking no arguments, or what is () supposed to be?

  Read the article

• How do I get regex support in excel via a function, or custom function?

  - by blunders

  It appears that regex (as in regular expressions) is not supported in excel, except via VBA. Is this so, and is it is, are there any "open source" custom VBA functions that support regex. In this case I'm looking to extract complex pattern within a string, but any implementation of a custom VBA function that expose support of regex within the function itself would be of use. If you know of semi-related function such as the IS function, feel feel to comment, though I'm really looking for a full regular expression implementation that is exposed via functions. Might even be open to a pay to use add-in if the implementation is good. If you have questions, please comment.

  Read the article

• C++ STL: Trouble with string iterators

  - by Rosarch

  I'm making a simple command line Hangman game. void Hangman::printStatus() { cout << "Lives remaining: " << livesRemaining << endl; cout << getFormattedAnswer() << endl; } string Hangman::getFormattedAnswer() { return getFormattedAnswerFrom(correctAnswer.begin(), correctAnswer.end()); } string Hangman::getFormattedAnswerFrom(string::const_iterator begin, string::const_iterator end) { return begin == end? "" : displayChar(*begin) + getFormattedAnswerFrom(++begin, end); } char Hangman::displayChar(const char c) { return c; } (Eventually, I'll change this so displayChar() displays a - or a character if the user has guessed it, but for simplicity now I'm just returning everything.) When I build and run this from VS 2010, I get a popup box: Debug Assertion Failed! xstring Line: 78 Expression: string iterator not dereferenceable What am I doing wrong?

  Read the article

• Splitting up input using regular expressions in Java

  - by Joe24

  I am making a program that lets a user input a chemical for example C9H11N02. When they enter that I want to split it up into pieces so I can have it like C9, H11, N, 02. When I have it like this I want to make changes to it so I can make it C10H12N203 and then put it back together. This is what I have done so far. using the regular expression I have used I can extract the integer value, but how would I go about get C10, H11 etc..? System.out.println("Enter Data"); Scanner k = new Scanner( System.in ); String input = k.nextLine(); String reg = "\\s\\s\\s"; String [] data; data = input.split( reg ); int m = Integer.parseInt( data[0] ); int n = Integer.parseInt( data[1] );

  Read the article

• struts annotation issue

  - by Gourav

  My issue is that i have an annotation in Struts2 action class like private String[] origfilenofrom; @FieldExpressionValidator(fieldName="origfilenofrom",key="",message="File Length should be 12 for old file format and 15 for new file format",expression="checkorigFileFormat(origfilenofrom)") now my mehtod is public boolean checkorigFileFormat(String[] files ) { for(int counter=0;counter<files.length;counter++) { int n=files[counter].length(); if(!(n==12 || n==15)) { return false; } } return true; } So for any string in that string [], which is returning false the value is bei false. No matter 3 strings in that string [] are true if one is false then the annotaion message is displayed for all. I want the message not to display where the string is true. Help please

  Read the article

• what is wrong with my create table SQL?

  - by George2

  Hello everyone, I am using SQL Server 2008 management studio to execute the following SQL statements, and here is the related error message from SQL Server management studio. Any ideas what is wrong? SET ANSI_NULLS ON GO SET QUOTED_IDENTIFIER ON GO Create TABLE [dbo].[BatchStatus]( [BatchID] [uniqueidentifier] NOT NULL CONSTRAINT [PK_BatchStatus_ID], [BatchStatus] [int] NULL, CONSTRAINT [PK_BatchStatus_ID] PRIMARY KEY CLUSTERED ( [BatchID] ASC )WITH (IGNORE_DUP_KEY = OFF) ON [PRIMARY] ) ON [PRIMARY] GO Msg 102, Level 15, State 1, Line 3 Incorrect syntax near ','. Msg 319, Level 15, State 1, Line 8 Incorrect syntax near the keyword 'with'. If this statement is a common table expression, an xmlnamespaces clause or a change tracking context clause, the previous statement must be terminated with a semicolon. thanks in advance, George

  Read the article

• mod_rewrite rule for all urls except ones with some words

  - by zlog

  How do I write a mod_rewrite regulare expression rule that is the opposite of this: ^(.+)/path/(page1|page2)+$ ie, I want all pages except blah/path/page1 and blah/path/page2 to redirect to another path, where the x in blah/path/x is used in the new path. For example, I'd like write a rewrite rule like: RewriteRule some_regex /index.php?path/show/$1 [L] where some_regex would pull out the last component of a url in the format: /something/path/some_param to redirect to /index.php/path/show/some_param I'm trying to use ! and [^] syntax, but I don't quite understand how these work, especially when they involve words not single characters.

  Read the article

• Remove html code in a text with no regular expresion

  - by Blanca

  Hi! I am working in the indexation of feeds from Internet. I would like to remove tha html code which appears in some of them. I have used regular expression for the ones i have seen, but I would like to find some way to remove all of them automaticcally, because I don't know if I have seen all possible html code in my feeds. Is there any possibillity?? I add an example of things I would like to remove: /0831/oly_g_liukin_576.jpg" height="49" width="41" / BEIJING - AUGUST 15: Nastia Liukin of the... Thank you!

  Read the article

• Using regular expressions with Dojo data.fetch?

  - by Dfowj

  I'm trying to use the below code to fetch a regular expression like this /[computer]{3,8}/(what i think is any words containing the letters in computer ranging from 3 to 8 letters long) from a database (which i know is being loaded correctly). When i fetch, i get 10 results, all the same word... "Adenauer" var base = "computer"; var baseRE = '/[' + base + ']{' + this.minLength + ',' + base.length + '}/'; this.dict.fetch({query: {word:baseRE}, onComplete: onLoadWords, onError: function(err) { console.log(err); }}); Any ideas what im doing wrong?

  Read the article

• PHP editors for Ubuntu

  - by mepo

  What are the Light weight PHP editors available for ubuntu? And is there a ubuntu version of the Notepad++ editor. For those who haven't used Notepad++, do not confuse it with Notepad.exe. Notepad.exe is the lightweight Windows editor by Microsoft. Notepad++ is an Open Source programmer's text editor for Windows based on SciTE. It has syntax highlighting, code collapsing, language recognition, macro recording, regular expression search and replace across line breaks and in files on disk, copy filenames and paths to clipboard, and many other advance text editing tools. Only the more full-featured editors for Linux would be likely to be suitable replacements for Notepad++. Thanks

  Read the article

• Using a database/index sequential file independently of the Unix distribution

  - by Helper Method

  What I'm planning to do is a) parse a file for some lines matching a regular expression b) store the match in some sort of database / file so I don't have to do the parsing again and again c) call another program passing the matches as arguments While I can imagine how to do a) and c), I'm a little bit unsure about b). The matches are of the form key:attribute1:attribute2:attribute3 where attribute 2 may be optional. I'm thinking of storing the results in a simple database but the problem is the database needs to available on a number of Unix platform for the program to work. Are there any (simple) databases which can be found on any Unix platforms? Or should I use some sort of index-sequential file?

  Read the article

< Previous Page | 157 158 159 160 161 162 163 164 165 166 167 168  | Next Page >