• ClipSaver
ClipSaver
Русские видео
  • Смешные видео
  • Приколы
  • Обзоры
  • Новости
  • Тесты
  • Спорт
  • Любовь
  • Музыка
  • Разное
Сейчас в тренде
  • Фейгин лайф
  • Три кота
  • Самвел адамян
  • А4 ютуб
  • скачать бит
  • гитара с нуля
Иностранные видео
  • Funny Babies
  • Funny Sports
  • Funny Animals
  • Funny Pranks
  • Funny Magic
  • Funny Vines
  • Funny Virals
  • Funny K-Pop

C++Now 2017: Phil Nash “The Holy Grail!? A Persistent Hash-Array-Mapped Trie for C++" скачать в хорошем качестве

C++Now 2017: Phil Nash “The Holy Grail!? A Persistent Hash-Array-Mapped Trie for C++" 8 years ago

Phil Nash

C++Now 2017

Computer Science (Field)

+ C (Programming Language)

Bash Films

conference video recording services

conference recording services

nationwide conference recording services

conference videography services

conference video recording

conference filming services

conference services

conference recording

conference live streaming

event videographers

capture presentation slides

record presentation slides

event video recording

video services

Не удается загрузить Youtube-плеер. Проверьте блокировку Youtube в вашей сети.
Повторяем попытку...
C++Now 2017: Phil Nash “The Holy Grail!? A Persistent Hash-Array-Mapped Trie for C++
  • Поделиться ВК
  • Поделиться в ОК
  •  
  •  


Скачать видео с ютуб по ссылке или смотреть без блокировок на сайте: C++Now 2017: Phil Nash “The Holy Grail!? A Persistent Hash-Array-Mapped Trie for C++" в качестве 4k

У нас вы можете посмотреть бесплатно C++Now 2017: Phil Nash “The Holy Grail!? A Persistent Hash-Array-Mapped Trie for C++" или скачать в максимальном доступном качестве, видео которое было загружено на ютуб. Для загрузки выберите вариант из формы ниже:

  • Информация по загрузке:

Скачать mp3 с ютуба отдельным файлом. Бесплатный рингтон C++Now 2017: Phil Nash “The Holy Grail!? A Persistent Hash-Array-Mapped Trie for C++" в формате MP3:


Если кнопки скачивания не загрузились НАЖМИТЕ ЗДЕСЬ или обновите страницу
Если возникают проблемы со скачиванием видео, пожалуйста напишите в поддержку по адресу внизу страницы.
Спасибо за использование сервиса ClipSaver.ru



C++Now 2017: Phil Nash “The Holy Grail!? A Persistent Hash-Array-Mapped Trie for C++"

http://cppnow.org — Presentation Slides, PDFs, Source Code and other presenter materials are available at: https://github.com/boostcon/cppnow_pr... — C++ has a handful of associative containers. We started with set and map, both based on node-based red-black trees. These are fine but are not the most efficient and, in particular, suffer from more cache misses than we’d like. If we want to build persistent versions of them it’s achievable but aggravates the problems even more and adds considerable extra complexity (I know - I’ve done it!) C++11 brought the hash-map based unordered_set and unordered_map, which are generally much faster, with better cache locality - but can be less memory efficient and also don’t translate so easily into persistent versions. But there exists another general purpose data structure that combines many of the characteristics of trees and hash tables into something that in many important ways is superior to both, and with minimal downside (they are close but not quite as fast as pure hash tables). Hash Array Mapped Tries are more memory efficient than hash tables and, as a bonus, are trivially made persistent - with big implications for concurrency, functional programming, and other applications that benefit from being able to treat them immutably (as well as share large amounts of common state in memory at once). This talk will describe how this data structure works from the ground up and look at a reference implementation I am writing with the intention of proposing as a boost library - and possibly later for standardisation. We’ll also look at how it can be used in practice, and some of the performance characteristics. — I'm the author of the test framework, Catch, and also have feet in the Swift and F# worlds. | As Developer Advocate at JetBrains I'm involved with CLion, AppCode and ReSharper C++. — Videos Filmed & Edited by Bash Films: http://www.BashFilms.com --- *--* ---

Comments
  • C++Now 2017: Juanpe Bolivar “Postmodern Immutable Data Structures 8 years ago
    C++Now 2017: Juanpe Bolivar “Postmodern Immutable Data Structures"
    Опубликовано: 8 years ago
    7123
  • CppCon 2017: Phil Nash “The Holy Grail! A Hash Array Mapped Trie for C++” 7 years ago
    CppCon 2017: Phil Nash “The Holy Grail! A Hash Array Mapped Trie for C++”
    Опубликовано: 7 years ago
    12629
  • C++Now 2017: M. Skarupke “Sorting in less than O(n log n): Generalizing and optimizing radix sort 8 years ago
    C++Now 2017: M. Skarupke “Sorting in less than O(n log n): Generalizing and optimizing radix sort"
    Опубликовано: 8 years ago
    12998
  • C++Now 2017: Louis Dionne 8 years ago
    C++Now 2017: Louis Dionne "Fun with Boost.Hana"
    Опубликовано: 8 years ago
    8790
  • CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step” 7 years ago
    CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
    Опубликовано: 7 years ago
    117042
  • CppCon 2017: Juan Pedro Bolivar Puente “Postmodern immutable data structures” 7 years ago
    CppCon 2017: Juan Pedro Bolivar Puente “Postmodern immutable data structures”
    Опубликовано: 7 years ago
    29272
  • C++Now 2018: You Can Do Better than std::unordered_map: New Improvements to Hash Table Performance 7 years ago
    C++Now 2018: You Can Do Better than std::unordered_map: New Improvements to Hash Table Performance
    Опубликовано: 7 years ago
    59293
  • C++Now 2017: Daniel Pfeifer “Effective CMake 8 years ago
    C++Now 2017: Daniel Pfeifer “Effective CMake"
    Опубликовано: 8 years ago
    186778
  • Венедиктов – страх, Симоньян, компромиссы / вДудь 4 days ago
    Венедиктов – страх, Симоньян, компромиссы / вДудь
    Опубликовано: 4 days ago
    3104411
  • Человек-отвёртка: глупый, покорный, работает // Олег Комолов. Простые числа 6 hours ago
    Человек-отвёртка: глупый, покорный, работает // Олег Комолов. Простые числа
    Опубликовано: 6 hours ago
    22882

Контактный email для правообладателей: [email protected] © 2017 - 2025

Отказ от ответственности - Disclaimer Правообладателям - DMCA Условия использования сайта - TOS



Карта сайта 1 Карта сайта 2 Карта сайта 3 Карта сайта 4 Карта сайта 5