Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
nitnelave
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
10 ms
·
61.
▲
by
nitnelave
4y ago
Glad you like it :) It seems LLDAP is a bit more lightweight than you expect, though: - You could easily implement one-way replication on top, it's just an SQlite database, you can easily copy it around (or rather use the built-in `.b
62.
▲
by
nitnelave
4y ago
Something cool that I didn't highlight since it's not the main point: The web UI uses the OPAQUE protocol to log in/store passwords, so your password is never sent to the server (it instead stores just enough information for
63.
▲
by
nitnelave
4y ago
I'm not sure what you mean by intermediate packages, but roughly the main dependencies are: - Backend: sea-query to build the SQL queries, Sqlx to run them, actix for the http frontend, ldap3_proto to handle LDAP protocol, juniper for
64.
▲
by
nitnelave
4y ago
We're going to add support for more DBs (e.g. Postgres and MySql) in the next release, I did a lot of work on the underlying libraries to make that possible. However, mapping the tables/field names is not planned. I think it'
65.
▲
by
nitnelave
4y ago
The data is stored in an sqlite database, it's very easy to backup/copy. I'm planning on supporting alternate DBs as well.
66.
▲
by
nitnelave
4y ago
From the front page, I have no idea what this project offers or what it does. Why should I log in with GitHub when I don't know what it'll do?
67.
▲
Show HN: Lldap, a Simplified LDAP Server
(github.com)
229 points
by
nitnelave
4y ago
|
111 comments
68.
▲
by
nitnelave
4y ago
They are actually listed on the page, ctrl-F for them. They're listed under "mixed index".
69.
▲
by
nitnelave
4y ago
yes it can: https://github.com/nitnelave/lru_cache
70.
▲
by
nitnelave
4y ago
I built the user management UI for my LDAP server implementation like that [0]. It's quite nice (I don't like JS), but it's not super stable yet, the 0.18 update of yew changed many things in an incompatible way. It looks way
71.
▲
by
nitnelave
5y ago
It's more that I never properly measured it, but I know that it doesn't use more than that :) I should probably get a more accurate figure in there. EDIT: From docker stats, I can see the container using about 2.5MB RAM, which is
72.
▲
by
nitnelave
5y ago
I've been self hosting for nearly 10 years now, and in all this time the biggest pain point I remember is setting up OpenLDAP. That's why I created LLDAP ( https://github.com/nitnelave/lldap ), a minimalistic L
73.
▲
by
nitnelave
5y ago
It seems they have prerun commands to copy your dotfiles, but you have to specify that you want them. There's an example in the README.
74.
▲
by
nitnelave
5y ago
I'm working on a PoC static SQL query builder using generics, but it's pretty opinionated and kinda assumes that the binary is controlling the DB, instead of the DB being independently managed. And since it's static, it would
75.
▲
by
nitnelave
5y ago
It seems to be skewed towards web development, with W3schools as one of the top 3 sources. Selection bias or natural sample bias?
76.
▲
by
nitnelave
5y ago
How can you make sure that the walkthroughs are in sync with the code? Especially across repositories. The article is surprisingly light about this. It kinda reminds me of the rust doc and doctests (snippets in the docs that are valid rust
77.
▲
by
nitnelave
5y ago
I'm working on a dirt-simple LDAP server for self-hosted user management, written in Rust, with the frontend also written in Rust (compiled to WASM): https://github.com/nitnelave/lldap I had an MVP release last mo
78.
▲
by
nitnelave
5y ago
I actually implemented that in Bison a few years ago, using graphs (DAG) rather than a matrix. You could define groups of totally ordered operators, and they were not (by default) cross comparable. However, given the low popularity of Bison
79.
▲
by
nitnelave
5y ago
I had the... pleasure of meeting M4 while working on GNU Bison (a grammar parser generator): after parsing the grammar, it calls M4 to generate the parser (in C, C++, Java, D or other), defining some variables. So you get a giant c/c++
80.
▲
by
nitnelave
5y ago
When life gives you lemons, sue the manufacturer! Seriously, where does the name of the law come from?
81.
▲
by
nitnelave
5y ago
It seems that after years of trying to develop programming languages and architectures to have separation of concerns, with the business logic, the presentation logic, and the data storage separated (or even going to full-blown microservice
82.
▲
by
nitnelave
5y ago
You can multiplex your SSH session and have several ssh commands running on the same connection (without having to type the password/check the security key again). Check the ControlMaster option for SSH.
83.
▲
Introduction to Traits in Rust
(youtube.com)
5 points
by
nitnelave
6y ago
|
0 comments
84.
▲
by
nitnelave
6y ago
I remember when teaching a subset of LOGO that we wanted a cool input program for students. So I built reverse logo [1] to turn an image (black-and-white, contiguous) into a logo program that draws it. [1]: https://github.com
85.
▲
Show HN: Fastest C++ LRU Cache
(github.com)
3 points
by
nitnelave
6y ago
|
0 comments
86.
▲
by
nitnelave
6y ago
Author here, I was surprised not to find an LRU cache implementation in common libraries (STL, Boost), so I wanted to make my own. This library is trying to make it easy to experiment with different backends (different maps, lists and so on
87.
▲
Fastest C++ LRU cache, using a hashset
(github.com)
4 points
by
nitnelave
6y ago
|
1 comments
88.
▲
by
nitnelave
6y ago
Author here, I was surprised not to find an LRU cache implementation in common libraries (STL, Boost), so I wanted to make my own. This library is trying to make it easy to experiment with different backends (different maps, lists and so on
89.
▲
Fastest C++ LRU cache, using a hashset
(github.com)
3 points
by
nitnelave
6y ago
|
1 comments
90.
▲
by
nitnelave
7y ago
It seems like you want a reference-counted pointer: you get shared ownership, and the object is deleted when the last reference to the pointer is deleted. Similar to C++'s std::shared_ptr
More ›