Haskell
Haskell
Another Many-to-many example within this usecase would be “subscriptions”. Users can subscribe to multiple channels and channels can have multiple users subscribed to them. You would use another relational table that stores the channel_id & user_id, with uniqueness for both together, since “being subscribed to one specific channel multiple times” doesn’t make sense and perhaps put a column to store “hitting the bell” in there too.
At college some guys were self hosting a git server for a project but it went down. We resorted to a USB stick that acted as remote
and was passed around. That was awesome to see, for about a day…
Thought it was a good opportunity to potentionally learn something new. Seems to have worked out.
I’d change
I would look into a library that does manipulation of odt (or docx). Code whatever algorithm you need to do the restructuring. Now your left with an in memory representation of the document that you can hopefully figure out how many pages it spans, or save it to a temporary file.
All depends really on how feature rich the odt libraries are and/or how deep you want to dive into the spec.
I feel like this is an XY problem. Is there an underlying issue your trying to resolve?
There’s really only one way to make sure no new ones come to be…