From 42f26eb42e3b115f39570bb14445d7e5f33220d7 Mon Sep 17 00:00:00 2001
From: Johannes Kirschbauer <hsjobeki+github@gmail.com>
Date: Fri, 20 Oct 2023 02:45:47 +0200
Subject: [PATCH] doc: complexity for '?' operator (#9184)

Co-authored-by: Valentin Gagarin <valentin.gagarin@tweag.io>
Co-authored-by: Robert Hensing <roberth@users.noreply.github.com>
---
 doc/manual/src/language/operators.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/doc/manual/src/language/operators.md b/doc/manual/src/language/operators.md
index a22c71109..07b43a881 100644
--- a/doc/manual/src/language/operators.md
+++ b/doc/manual/src/language/operators.md
@@ -63,6 +63,8 @@ The result is a [Boolean] value.
 
 [Has attribute]: #has-attribute
 
+After evaluating *attrset* and *attrpath*, the computational complexity is O(log(*n*)) for *n* attributes in the *attrset*
+
 ## Arithmetic
 
 Numbers are type-compatible: