Search Results

Search found 2455 results on 99 pages for 'lambda expressions'.

Page 48/99 | < Previous Page | 44 45 46 47 48 49 50 51 52 53 54 55  | Next Page >

• Palindrome Golf

  - by Claudiu

  The goal: Any language. The smallest function which will return whether a string is a palindrome. Here is mine in Python: R=lambda s:all(a==b for a,b in zip(s,reversed(s))) 50 characters. The accepted answer will be the current smallest one - this will change as smaller ones are found. Please specify the language your code is in.

  Read the article

• Regex solution for Objective-C

  - by rjstelling

  What is the best method for using Regular Expressions within Objective-C? There seems to be some open source project that provide regex support, can any one recommend one? Also I looked at NSPredicate, can anyone suggest any regex examples? Background: I want use regex mainly for validation, IP's, email addresses, internal ID's etc

  Read the article

• PLT Scheme sort function

  - by Danny

  PLT Scheme guide says that it's implemented sort function is able to sort a list according to an extarcted value using a lambda function. link text The guide provides an unworking code example of this- (sort '(("aardvark") ("dingo") ("cow") ("bear")) #:key car string<?) Which returns an error. How is this function is supposed to be calles so that it will actually sort a list according to values calculated by a given function?

  Read the article

• How do I sanitize LaTeX input?

  - by Conley Owens

  I'd like to take user input (sometimes this will be large paragraphs) and generate a LaTeX document. I'm considering a couple of simple regular expressions that replaces all instances of "\" with "\textbackslash " and all instances of "{" or "}" with "\}" or "\{". I doubt this is sufficient. What else do I need to do? Note: In case there is a special library made for this, I'm using python.

  Read the article

• Why is "Structured" in Structured Query Language?

  - by Pavan

  Hi, What does the "Structured" word means in SQL? Is it because this(SQL) language statements are organized into Clauses, expressions and predicates? Because of this organization, is it called "Structured" ? Kind Regards, Pavan.

  Read the article

• Wanted: a very simple java RegExp API

  - by itsadok

  I'm tired of writing Pattern p = Pattern.compile(... Matcher m = p.matcher(str); if (m.find()) { ... Over and over again in my code. I was going to write a helper class to make it neater, but I then I wondered: is there a library that tries to provide a simpler facade for Regular Expressions in Java? I'm thinking something in the style of commons-lang and Guava.

  Read the article

• What's a regular language?

  - by Javier Badia

  I've read that you can't parse HTML with regular expressions because HTML is not a regular language. I tried searching Wikipedia, but I didn't understand a word of what the various related articles said. Can someone explain, in simpler terms, what's a regular (or non-regular) language, and why non-regular languages can't be parsed with regexes?

  Read the article

• How to protect yourself from XSS when you allow people to post RAW embeded codes?

  - by Axel

  Hi. Tumblr and other blogging websites allows people to post embeded codes of videos from youtube and all video networks. but how they filter only the flash object code and remove any other html or scripts? and even they have an automated code that informes you this is not a valid video code. Is this done with REGEX expressions? And Is there a PHP code to do that? Thanks

  Read the article

• will_paginate with named_scopes

  - by Lowgain

  I'm using will_paginate for pagination, which has been working well so far, except for this one thing. If I try to paginate a scope, for instance class User < ActiveRecord::Base named_scope :scope, lambda { etc } end User.scope.paginate({:page => params[:page], :per_page => 10}) That will tell me paginate is an undefined method. I'd rather not have to use a second solution for only this scope, is there something I can do here?

  Read the article

• Scala Array constructor?

  - by Lukasz Lew

  scala> val a = Array [Double] (10) a: Array[Double] = Array(10.0) scala> val a = new Array [Double] (10) a: Array[Double] = Array(0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0) Why these two expressions have different semantics?

  Read the article

• Parsing incoming mail with google app engine?

  - by Ken

  We have our mail setup with google apps. We want to be able to run some regular expressions on incoming mail and process this information. Is this possible today with Google App Engine? Does google provide some kind of infrastructure that can do this?

  Read the article

• Regex for finding an unterminated string

  - by Austin Hyde

  I need to search for lines in a CSV file that end in an unterminated, double-quoted string. For example: 1,2,a,b,"dog","rabbit would match whereas 1,2,a,b,"dog","rabbit","cat bird" 1,2,a,b,"dog",rabbit would not. I have very limited experience with regular expressions, and the only thing I could think of is something like "[^"]*$ However, that matches the last quote to the end of the line. How would this be done?

  Read the article

• What is "Structured" in Structured Query Language?

  - by Pavan

  Hi, What does the "Structured" word means in SQL? Is it because this(SQL) language statements are organized into Clauses, expressions and predicates? Because of this organization, is it called "Structured" ? Kind Regards, Pavan.

  Read the article

• Dynamic URL -> Controller mapping for routes in Rails

  - by Daniel Beardsley

  I would like to be able to map URLs to Controllers dynamically based on information in my database. I'm looking to do something functionally equivalent to this (assuming a View model): map.route '/:view_name', :controller => lambda { View.find_by_name(params[:view_name]).controller } Others have suggested dynamically rebuilding the routes, but this won't work for me as there may be thousands of Views that map to the same Controller

  Read the article

• Wikipedia : Java library to remove wikipedia text markup removal

  - by Algorist

  Hi, I downloaded wikipedia dump and now want to remove the wikipedia markup in the contents of each page. I tried writing regular expressions but they are too many to handle. I found a python library but I need a java library because, I want to integrate into my code. Thank you.

  Read the article

• Get address bar without paramentrs.

  - by kalininew

  Help me please get the value of the address bar of browser without the parameters passed. Without the use of regular expressions and string functions. You can do this? (I use php on apache). enter http://dev.mazda-parts.ru/catalogue/?spattern=1 exit http://dev.mazda-parts.ru/catalogue/

  Read the article

• Built-in precedence in Expression Trees for math?

  - by jdk

  I'm unable to find the .NET FCL built-in concept of precedence to leverage while constructing Expression Trees. Ref System.Linq.Expressions Namespace. Is this something that must be handled manually in code, or is it somehow implicit and I'm not recognizing it (e.g. maybe through helper methods or classes)? I want to apply it to math operations to ensure 3 + 5 * 10 results in 53 instead of 80.

  Read the article

• Can I have a macro run whenever I save a file in Visual Studio 2005?

  - by Mark

  When I save a file in Visual Studio 2005, I'd like to have a macro also run that updates a copyright (through a regular expression search and replace). I'm not new to regular expressions, but I am new to VB/VBA and Visual Studio macros, so what I need help with specifically is: getting a macro to run upon save, preferably after I press CTRL-S but before it actually writes the file so that the results of the search and replace are actually saved without having to save twice calling search and replace for a regular expression from inside the VB/VBA macro Thanks, Mark

  Read the article

• How can I tell if a set of parens in perl code will act as grouping parens or form a list?

  - by Ryan Thompson

  In perl, parentheses are used for overriding precedence (as in most programming languages) as well as for creating lists. How can I tell if a particular pair of parens will be treated as a grouping construct or a one-element list? For example, I'm pretty sure this is a scalar and not a one-element list: (1 + 1) But what about more complex expressions? Is there an easy way to tell?

  Read the article

• RegExp: want to find all links that do not end in ".html"

  - by grovel

  Hi, I'm a relative novice to regular expressions (although I've used them many times successfully). I want to find all links in a document that do not end in ".html" The regular expression I came up with is: href=\"([^"]*)(?<!html)\" In Notepad++, my editor, href=\"([^"]*)\" finds all the links (both those that end in "html" and those that do not). Why doesn't negative lookbehind work? I've also tried lookahead: href=\"[^"]*(?!html\") but that didn't work either. Can anybody help? Cheers, grovel

  Read the article

• Gridview - Is it necessary to grab data from database every time a filter, sort, or paging event occ

  - by hamlin11

  Regarding gridviews that are not bound to a Data Source Control: In most GridView tutorials that I have seen, when just about any GridView event occurs, the end of the event handler will include BindDataGrid(). In some form, these BindDataGrid() functions 1) Grab data from the database 2) Assign any Filter or Sort expressions to the data, and 3) Bind the gridview to that data source (usually a DataView or DataTable. Is there a better way to provide filterable & sortable data to a GridView without having to hit the database so often? Thanks

  Read the article

• C# Regular Expression to find multiple sequences of punctuation characters

  - by Aran Mulholland

  Im trying to match punctuations using regular expressions. Do i have to specify every punctuation character i am searching for or is there is an escape sequence i can use? Im sitting here smiling to myself that the answers i might get will just be "Yes" or "No", please elaborate.... (that sentence should match the regular expression twice)

  Read the article

• problem with a join

  - by Luca Romagnoli

  I have this code: int se = (int) settings.GruppoSegreteria; var acc = db.USR_Accounts.Where( p => p.ID_Gruppo == se); var segreterie = from s in db.USR_Utenti join h in acc on s.ID equals h.USR_UtentiReference select s; And this error: The type of one of the expressions in the join clause is incorrect. Type inference failed in the call to 'Join' I don't understand it. Can you help me? thanks

  Read the article

• why cant i access Expresstion methods in ironruby?

  - by potlee

  This code works fine in c# Expression.Lambda(LambdaBody); But none of the Methods for building AST seem to visible from ironruby. i requied microsoft.scripting.core and microsoft.scripting libraries. do i need something else?

  Read the article

• Derivative of a Higher-Order Function

  - by Claudiu

  This is in the context of Automatic Differentiation - what would such a system do with a function like map, or filter - or even one of the SKI Combinators? Example: I have the following function: def func(x): return sum(map(lambda a: a**x, range(20))) What would its derivative be? What will an AD system yield as a result? (This function is well-defined on real-number inputs).

  Read the article

< Previous Page | 44 45 46 47 48 49 50 51 52 53 54 55  | Next Page >