Question

I m 试图书写一些埃兰,以过滤阵列的形式:

[{dakota, "cold and snowy"}, {california, "perfect weather"}] % and so on

这里是我所说的话——在我试图用塔里的塔来做一个大事时,我会遇到一个yn错。

-module(matcher).
-export([findkeywords/2]).

findkeywords(Word, Arr) -> 
    IsMatch = fun({Key, Desc}) -> 
        lists:any(fun(X) -> X==Word end, string:tokens(Desc, " ")),
    lists:filter(IsMatch, [{K, V} || {K, V} <- Arr]).

是否有任何人发现我的yn子在哪里?

Answer 1

我看到你对武器发出的呼吁,只是要看一看。

如果你想要编辑的话,你就在你直线的 f子上再次失踪。 6. 结论加入《公约》,并在无申诉的情况下汇编。

-module(matcher).
-export([findkeywords/2]).

findkeywords(Word, Arr) -> 
    IsMatch = fun({Key, Desc}) -> 
        lists:any(fun(X) -> X==Word end, string:tokens(Desc, " ")) end, % ADD THE END HERE
    lists:filter(IsMatch, [{K, V} || {K, V} <- Arr]).

You can clean this up a bit too, unless this is an exercise in string matching for yourself. The string module has str(String, SubString) -> Index and rstr(String, SubString) -> Index that are described as such in the Erlang Manual:

2. 恢复原第一种/最后的分辨率始于Sting。如果在Sting中不存在分界线,则将恢复原状。例如:

> string:str(" Hello Hello World World ", "Hello World").
8

采用这一标记,甚至可以把整个东西缩短为一个线。由于数据已经采用你重新努力输入的格式,因此不必理解清单。

-module(matcher).
-export([findkeywords/2]).

findkeywords(Word, Arr) -> 
    lists:filter(fun({_Key, Desc}) -> string:str(Desc, Word) > 0 end, Arr).

Answer 2

You miss one "end" from the two functions. Also, it looks like the list comprehension in this example used is not needed.

Answer 3

findkeywords(Word, Arr) -> 
    IsMatch =
    fun({_, Desc}) -> lists:any(fun(X) -> X == Word end, string:tokens(Desc, " ")) end,
    lists:filter(IsMatch, [{K, V} || {K, V} <- Arr]).

Answer 4

各位没有<条码>末/条码>。然而,与你一样,在地狱中搜寻。通常使用的是

-define(DATA,[{dakota, "cold and snowy"}, {california, "perfect weather"}]).

string_contains(Big,Small)-> string:rstr(Big,Small) > 0.

findkeywords(Word)-> [X || X <- ?DATA,string_contains(element(2,X),Word) == true].

Anyway, one of your funs was not ended well. that s all.

友情链接