[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <CAFLxGvzv5446x=+zT3yQv7qoR9MfEkWyEeOP=5e1dsPNTBcS_w@mail.gmail.com>
Date: Thu, 23 Apr 2015 23:33:19 +0200
From: Richard Weinberger <richard.weinberger@...il.com>
To: David Herrmann <dh.herrmann@...il.com>
Cc: Borislav Petkov <bp@...en8.de>,
Greg Kroah-Hartman <gregkh@...uxfoundation.org>,
"Eric W. Biederman" <ebiederm@...ssion.com>,
Linus Torvalds <torvalds@...ux-foundation.org>,
Andrew Morton <akpm@...ux-foundation.org>,
Arnd Bergmann <arnd@...db.de>,
One Thousand Gnomes <gnomes@...rguk.ukuu.org.uk>,
Tom Gundersen <teg@...m.no>, Jiri Kosina <jkosina@...e.cz>,
Andy Lutomirski <luto@...capital.net>,
linux-kernel <linux-kernel@...r.kernel.org>,
Daniel Mack <daniel@...que.org>,
Djalal Harouni <tixxdz@...ndz.org>
Subject: Re: [GIT PULL] kdbus for 4.1-rc1
On Thu, Apr 23, 2015 at 11:22 PM, David Herrmann <dh.herrmann@...il.com> wrote:
> Hi
>
> On Thu, Apr 23, 2015 at 10:56 PM, Borislav Petkov <bp@...en8.de> wrote:
>> On Thu, Apr 23, 2015 at 09:14:33PM +0200, Greg Kroah-Hartman wrote:
>>> I don't know what O(256) means here, O notation usually is used to
>>> show the complexity of a function, so this really is almost always the
>>> same amount of time, based on using the hash function.
>>
>> This is iterating over 256 hash buckets. So O(n) complexity. Better?
>
> No it's not. O(256) equals O(1).
Yeah, that's absolutely correct.
I think Boris wanted to say that iterating over all hash buckets
can be costly.
--
Thanks,
//richard
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists