I've found std.algorithm: canFind to be useful on a regular arrays.
I'd like to know if there is similar function: that can check if a key inside a Associative Array can be found.
| Thread overview |
|---|
April 05, 2022 Check if Key exists in Associative Array using D language. | ||||
|---|---|---|---|---|
| ||||
I've found std.algorithm: canFind to be useful on a regular arrays. I'd like to know if there is similar function: that can check if a key inside a Associative Array can be found. | ||||
April 05, 2022 Re: Check if Key exists in Associative Array using D language. | ||||
|---|---|---|---|---|
| ||||
Posted in reply to BoQsc | On Tuesday, 5 April 2022 at 11:26:27 UTC, BoQsc wrote: >I'd like to know if there is similar function: that can check if a key inside a [Associative Array][2] can be found. You can use the | |||
April 05, 2022 Re: Check if Key exists in Associative Array using D language. | ||||
|---|---|---|---|---|
| ||||
Posted in reply to Dennis | On Tuesday, 5 April 2022 at 11:53:19 UTC, Dennis wrote: >On Tuesday, 5 April 2022 at 11:26:27 UTC, BoQsc wrote: >I'd like to know if there is similar function: that can check if a key inside a [Associative Array][2] can be found. You can use the This is brilliant, thank you. | |||