<feed xmlns='http://www.w3.org/2005/Atom'>
<title>neovim/src/nvim/keycodes.lua, branch master</title>
<subtitle>Vim-fork focused on extensibility and usability</subtitle>
<id>http://git.waynecole.info/neovim/atom?h=master</id>
<link rel='self' href='http://git.waynecole.info/neovim/atom?h=master'/>
<link rel='alternate' type='text/html' href='http://git.waynecole.info/neovim/'/>
<updated>2025-03-07T21:45:39Z</updated>
<entry>
<title>perf(keycodes): use hashy for string lookup</title>
<updated>2025-03-07T21:45:39Z</updated>
<author>
<name>zeertzjq</name>
<email>zeertzjq@outlook.com</email>
</author>
<published>2025-03-07T09:49:54Z</published>
<link rel='alternate' type='text/html' href='http://git.waynecole.info/neovim/commit/?id=12d4caa9d3e4224b7c2922f112955100649d6069'/>
<id>urn:sha1:12d4caa9d3e4224b7c2922f112955100649d6069</id>
<content type='text'>
This is slightly faster than the binary search as per the benchmark, and
allows handling the vim/vim#16821 situation in generator code.
</content>
</entry>
<entry>
<title>refactor(keycodes): generate key_names_table[] using Lua</title>
<updated>2025-03-07T21:45:38Z</updated>
<author>
<name>zeertzjq</name>
<email>zeertzjq@outlook.com</email>
</author>
<published>2025-03-07T05:07:50Z</published>
<link rel='alternate' type='text/html' href='http://git.waynecole.info/neovim/commit/?id=3824f52e52ef95342788042a69e142e2aef72243'/>
<id>urn:sha1:3824f52e52ef95342788042a69e142e2aef72243</id>
<content type='text'>
This allows easier refactoring.
</content>
</entry>
</feed>
