We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Fun with Finite Automata

Formal Metadata

Title
Fun with Finite Automata
Subtitle
Optimising the Go regexp package
Title of Series
Number of Parts
287
Author
Contributors
License
CC Attribution 2.0 Belgium:
You are free to use, adapt and copy, distribute and transmit the work or content in adapted or unchanged form for any legal purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
The Go regexp package is an extremely competent piece of engineering, with attractive features such as being guaranteed to run in time linear in the size of the input. However, it can be made to go faster. This talk will describe: - how Go regexp works - five changes that improve regexp performance - the basic profiling techniques used to identify these optimisations - further opportunities for optimisation, including via Generics.