This should do what you’re after: value.match(/\S+/g).length; Rather than splitting the string, you’re matching on any sequence of non-whitespace characters. There’s the added bonus of being easily able to extract each word if needed 😉
The most succinct approach is to use the tools Python gives you. from future_builtins import map # Only on Python 2 from collections import Counter from itertools import chain def countInFile(filename): with open(filename) as f: return Counter(chain.from_iterable(map(str.split, f))) That’s it. map(str.split, f) is making a generator that returns lists of words from each line. Wrapping … Read more
The text handling capabilities of MySQL aren’t good enough for what you want. A stored function is an option, but will probably be slow. Your best bet to process the data within MySQL is to add a user defined function. If you’re going to build a newer version of MySQL anyway, you could also add … Read more
There’s REGEXP_REPLACE available as MySQL user-defined functions. Word counting: If you can control the data going into the database, you can remove double whitespace before insert. Also if you have to access the word count often, you can compute it once in your code and store the count in the database.
You need a web.config key to enable the pre 4.5 validation mode. More Info on ValidationSettings:UnobtrusiveValidationMode: Specifies how ASP.NET globally enables the built-in validator controls to use unobtrusive JavaScript for client-side validation logic. Type: UnobtrusiveValidationMode Default value: None Remarks: If this key value is set to “None” [default], the ASP.NET application will use the pre-4.5 … Read more
The following is a proposed solution for the OP’s specific problem (extracting the 2nd word of a string), but it should be noted that, as mc0e’s answer states, actually extracting regex matches is not supported out-of-the-box in MySQL. If you really need this, then your choices are basically to 1) do it in post-processing on … Read more
Use the regular expression symbol \\W to match non-word characters, using + to indicate one or more in a row, along with gregexpr to find all matches in a string. Words are the number of word separators plus 1. lengths(gregexpr(“\\W+”, str1)) + 1 This will fail with blank strings at the beginning or end of … Read more
I want to share the solution I found because at first I expected to use map-and-reduce methods, but it was a bit different. Map<String,Long> collect = wordsList.stream() .collect( Collectors.groupingBy( Function.identity(), Collectors.counting() )); Or for Integer values: Map<String,Integer> collect = wordsList.stream() .collect( Collectors.groupingBy( Function.identity(), Collectors.summingInt(e -> 1) )); EDIT I add how to sort the map … Read more
c=getchar()!= EOF is wrong. This will first call function getchar(). Then it will compare the return value with EOF. After that, the result of the comparison, which will be 1 or 0, will be assigned to c. To avoid this, use (c=getchar()) != EOF instad. Instead of the second if statement, use if(isspace(c)) (Thanks to … Read more
This is one way (it does create two streams and does merge the two lines of code): Map<String, Long> map = Arrays.stream(“some text some spaces”.split(” “)) .collect(Collectors.groupingBy(Function.identity(), Collectors.counting())) .entrySet() .stream() .sorted(Map.Entry.<String, Long>comparingByValue().reversed()) .collect(Collectors.toMap(e -> e.getKey(), e -> e.getValue(), (v1, v2) -> v2, LinkedHashMap::new)); System.out.println(map); // This prints: {some=2, spaces=1, text=1}