pattern-matching

I am writing a simple game which stores datasets in a 2D grid (like a chess board). Each cell in the grid may contain a single integer (0 means the cell is empty). If the cell contains a number > 0, it is said to be "filled". The set of "filled" cells on the grid is known as a "configuration". My problems is being able to "recognize" a particular configuration, regardless of where the configuration of cells are in the MxN grid. The problem (in my mind), breaks down into the following 2 sub problems: Somehow "normalising" the position of a configuration (for e.g. "rebasing" its position to (0,0

These are few emails which are not valid. email@domain.web .email@domain.com I have checked above emails in following websites, All of those returns invalid. http://isemail.info/about http://sqa.fyicenter.com/Online_Test_Tools/Email_Address_Format_Validator.php . Yet, android.util.Patterns.EMAIL_ADDRESS pattern validates both. Is there a bug or am I missing something? Both seems to be valid email addresses email@domain.web .email@domain.com since any email address contains three components <username>@<mail-server>.<mail-servertype or server-location> Here android.util.Patterns.EMAIL_ADDRESS

As homework i have to write a function that will remove duplicates from a list. It should be recursive and with pattern matching. I am not allowed to use list functions like head,tail,contains,etc... . For sorted lists i came up with this solution: def remove(u:List[Int]):List[Int] = { u match { case Nil => u case hd::hd2::tl => if(hd == hd2) remove(hd2::tl) else hd :: remove(hd2::tl) case hd::tl => hd :: remove(tl) } } How can i do it for unsorted lists? I won't do your homework for you, but hope, this will help. You want to make your function tail-recursive . That means that the recursive

I want to match an input string to my PHP page the same way a match done by the LIKE command in SQL (MySQL) for consistency of other searches. Since (I have seen but don't comprehend) some of the PHP syntax includes SQL commands I am wondering if this is possible? The reason for this is I am now implementing a search of a keyword versus fields in the DB that are stored in a serialized array, which I have to unserialize in PHP and search depending on the structure of the array. I can't query against the table, just need the matching ability of the query. Otherwise I need to find an alternate

Swift 1.2 I'm trying to pattern match in a switch case in a function that take a type Any as it's parameter, in order to dispatch to a private more specialize init. Here is a Playground extrapolation : import Foundation struct myStruct { } func switchOnAny(any: Any) -> String { println("Dynamic Type == \(any.dynamicType)") switch any { case let array as [Any]: return "Array" case let array as NSArray: return "NSArray" default: return "Default" } } let emptyStringArray : [String] = [] let stringArray : [String] = ["Bob", "Roger"] let intArray = [1, 2, 3] let customStructArray : [myStruct] = []

My question is: Is there a UTL_MATCH -like function which works with a CLOB rather than a VARCHAR2 ? My specific problem is: I'm on an Oracle database. I have a bunch of pre-written queries which interface with Domo CenterView . The queries have variables in them defined by ${variableName} . I need to rewrite these queries. I didn't write the original so instead of figuring out what a good value for the variables should be I want to run the queries with the application and get what the query was from V$SQL . So my solution is: Do a UTL_MATCH on the queries with the variable stuff in it and V