Path: csiph.com!news.mixmin.net!news.albasani.net!.POSTED!not-for-mail From: Bonita Montero Newsgroups: comp.programming.threads Subject: Re: Read again my "final" corrected post about about efficiency and performance.. Date: Wed, 16 Oct 2019 20:14:19 +0200 Organization: albasani.net Lines: 25 Message-ID: References: Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 7bit X-Trace: news.albasani.net KWSwGw73foQLQbGsEEc8GSY/6E6dkReWpw4b0xsY/bs3co8OcsZWWVyyyXb43b4xriOvUl24KMauzO2yBWrLug== NNTP-Posting-Date: Wed, 16 Oct 2019 18:14:20 +0000 (UTC) Injection-Info: news.albasani.net; logging-data="eegUuJAGYWjVYHKGz4jEw/lDKTOFflect4+DVQIbrUFVghHeip5PTsLfXHmrSyVLV5EXOw66ojcygCUkSO6tXNkIbWl5+PJg0JZNd/vKhzJ+wkYTnILleS/hMAQ1fM3n"; mail-complaints-to="abuse@albasani.net" User-Agent: Mozilla/5.0 (Windows NT 10.0; WOW64; rv:68.0) Gecko/20100101 Thunderbird/68.1.2 In-Reply-To: Cancel-Lock: sha1:lZXODVAhqlWbe55Ek38aumfgx9I= Xref: csiph.com comp.programming.threads:5249 > I think i am also smart, so i have just quickly found a solution that is > scalable and that is not your solution, so it needs my hashtable that > scales very ... A scaling hashtable is easy. > ... scales very well and it needs my fully scalable FIFO queue that > i have invented. That's also easy. > But i will not patent it, .. There's prior art for both. As someone else told you: your ideas aren't new. > because i will let you patent yours since i have seen you speaking on > the newsgroup of C++ about it. I'd have no problem if you show my idea as prior art. So go on. > But my solution is not Lockfree, it uses locks and it is scalable. A locking LRU-list is never scalable.