If you restrict yourself to ASCII letters, then use (with the re.I option set) \b[a-z]+\b \b is a word boundary anchor, matching only at the start and end of alphanumeric “words”. So \b[a-z]+\b matches pie, but not pie21 or 21pie. To also allow other non-ASCII letters, you can use something like this: \b[^\W\d_]+\b which also … Read more
Keep alike words together… For lists of words, it is often more useful to group the “same” words together (even though they differ in case). For example: Keeping things together: Simple “M after m”: ———————— ——————- mars mars mars bar mars bar Mars bar milk milk milk-duds Milk milky-way milk-duds Mars bar milky-way Milk Milky-way … Read more
If you don’t want to add a dependency on Guava (per Michael’s answer) then this comparator is equivalent: private static Comparator<String> ALPHABETICAL_ORDER = new Comparator<String>() { public int compare(String str1, String str2) { int res = String.CASE_INSENSITIVE_ORDER.compare(str1, str2); if (res == 0) { res = str1.compareTo(str2); } return res; } }; Collections.sort(list, ALPHABETICAL_ORDER); And I … Read more
For a variable amount of letter combinations, you can do the following: var alphabet = “abcdefghijklmnopqrstuvwxyz”; var q = alphabet.Select(x => x.ToString()); int size = 4; for (int i = 0; i < size – 1; i++) q = q.SelectMany(x => alphabet, (x, y) => x + y); foreach (var item in q) Console.WriteLine(item);
[] denotes a list, () denotes a tuple and {} denotes a dictionary. You should take a look at the official Python tutorial as these are the very basics of programming in Python. What you have is a list of strings. You can sort it like this: In [1]: lst = [‘Stem’, ‘constitute’, ‘Sedge’, ‘Eflux’, … Read more
Use itertools.product. from string import ascii_lowercase import itertools def iter_all_strings(): for size in itertools.count(1): for s in itertools.product(ascii_lowercase, repeat=size): yield “”.join(s) for s in iter_all_strings(): print(s) if s == ‘bb’: break Result: a b c d e … y z aa ab ac … ay az ba bb This has the added benefit of going … Read more
Simple, direct solution function nextChar(c) { return String.fromCharCode(c.charCodeAt(0) + 1); } nextChar(‘a’); As others have noted, the drawback is it may not handle cases like the letter ‘z’ as expected. But it depends on what you want out of it. The solution above will return ‘{‘ for the character after ‘z’, and this is the … Read more
Pass a custom comparer into OrderBy. Enumerable.OrderBy will let you specify any comparer you like. This is one way to do that: void Main() { string[] things = new string[] { “paul”, “bob”, “lauren”, “007”, “90”, “101”}; foreach (var thing in things.OrderBy(x => x, new SemiNumericComparer())) { Console.WriteLine(thing); } } public class SemiNumericComparer: IComparer<string> { … Read more
Assuming that those are Strings, use the convenient static method sort… java.util.Collections.sort(listOfCountryNames)