X-Authentication-Warning: delorie.com: mail set sender to geda-user-bounces using -f X-Recipient: geda-user AT delorie DOT com X-Original-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=date:from:to:subject:message-id:in-reply-to:references:mime-version :content-type:content-transfer-encoding; bh=Lz3o/9ricu8qxUjb9hBvkN/n+7pGWsDdTw1YJtPXOLw=; b=NLeWo/b0avAF/UtOVbc4ajik99D8X9GSoKpxdQso3QIrQ5lUgp2xMqdShLQ4AHqQMq N4RivYlW+mpzrYTe/1yHSjvgm6WqW6a0S9ESO1dYLcroIX+Wu4ySsMoQz6dQcnMRtAZ+ VtIWrFoLl+6D1WHzw61S8K3DvwZGzj4ZU8XQTvv2WTHYP14AZDX0ZSz/1ra0enBtHXhy dcKb8Xi8AhkDpFGuiZpH8BADjAAPCDfirsjUsXtFVMv40Y4sVKEZB+BJt4vOgjNhsymV c4diSJBwVNWlMhA21WBS/4ftV32jKaovTEySdF1vDtkzU3cksf5W4eEDKTkpwp8y0HJm OiuA== X-Received: by 10.180.75.137 with SMTP id c9mr18872725wiw.16.1441988956308; Fri, 11 Sep 2015 09:29:16 -0700 (PDT) Date: Fri, 11 Sep 2015 18:29:09 +0200 From: "Nicklas Karlsson (nicklas DOT karlsson17 AT gmail DOT com) [via geda-user AT delorie DOT com]" To: geda-user AT delorie DOT com Subject: Re: [geda-user] Notice to developers: layers have now a type. Message-Id: <20150911182909.e8f355b20e30fc1d03b470b0@gmail.com> In-Reply-To: <201509111607.t8BG7jio032558@envy.delorie.com> References: <55F1F75F DOT 8010809 AT jump-ing DOT de> <201509111607 DOT t8BG7jio032558 AT envy DOT delorie DOT com> X-Mailer: Sylpheed 3.5.0beta1 (GTK+ 2.24.25; x86_64-pc-linux-gnu) Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Reply-To: geda-user AT delorie DOT com Errors-To: nobody AT delorie DOT com X-Mailing-List: geda-user AT delorie DOT com X-Unsubscribes-To: listserv AT delorie DOT com Precedence: bulk > If you have thousands of layers, sure. But we currently have at most > 16. Iterating over 16 things is not going to be a bottleneck, and > certainly not worth making the code more complicated (and less > maintainable). > > Most of the CPU performance is in moving layer data between the > internal representation and the graphics card. 16 layer: Linear search in average 8 iterations to find an object and 16 iterations at most. Interval halving have logarithmic complexity and 4 iterations is needed. As is now I guess improvements are more important than optimization unless somebody with a reasonable modern computer think it work slow.