doc: complexity for '?' operator (#9184)

Co-authored-by: Valentin Gagarin <valentin.gagarin@tweag.io>
Co-authored-by: Robert Hensing <roberth@users.noreply.github.com>
This commit is contained in:
Johannes Kirschbauer 2023-10-20 02:45:47 +02:00 committed by GitHub
parent 7ed294f07d
commit 42f26eb42e
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23

View file

@ -63,6 +63,8 @@ The result is a [Boolean] value.
[Has attribute]: #has-attribute [Has attribute]: #has-attribute
After evaluating *attrset* and *attrpath*, the computational complexity is O(log(*n*)) for *n* attributes in the *attrset*
## Arithmetic ## Arithmetic
Numbers are type-compatible: Numbers are type-compatible: