[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[EP-tech] Re: eprintid reassignment
- Subject: [EP-tech] Re: eprintid reassignment
- From: Ian.Stuart at ed.ac.uk (Ian Stuart)
- Date: Mon, 11 May 2015 15:35:11 +0100
- In-reply-to: <EMEW3|7c927238bcc062535c20046dbb2d1a94r4AFKY14eprints-tech-bounces|ecs.soton.ac.uk|5550C8930200007E000120EC@smtp-b.lshtm.ac.uk>
- References: <firstname.lastname@example.org> <EMEW3|4ec546148aefe3bb7460bc0940518d74r4AF5Y14eprintsemail@example.com> <5550C8930200007E000120EC@smtp-b.lshtm.ac.uk> <EMEW3|7c927238bcc062535c20046dbb2d1a94r4AFKY14eprints-tech-bounces|ecs.soton.ac.uk|5550C8930200007E000120EC@smtp-b.lshtm.ac.uk>
On 11/05/15 15:19, Simon Jennings wrote:
> One of our RDM project leaders who doesn't really want to see any gaps
> in the id sequence. It's not really a functional requirement so I guess
> its more of a question of how easy is it to do?
Is the repository used by just the one RDM Project?
If no, then their eprintids will be interspersed with other projects
Do they understand that eprintids are assigned when a new item is
STARTED... so it that item doesn't complete, or get reviewed, there will
be a gap between the prior and following [shown] records
There will be no *easy* way to do it.... it's basically assumed to be an
auto-increment field - though I've not looked at the code that gets the
next available ID to see:
a) if it's a single core routine, or
b) how easy it would be to hack so it does some kind of lookup
..... but I raise the question "How will you find the first free hole?"
you'll either need to poke every eprintid from 1 until you find a hole,
or do yet more hacking to somehow keep a track of ids that are made free
Developer: ORI, RJ-Broker, and OpenDepot.org
Bibliographics and Multimedia Service Delivery team,
The University of Edinburgh.
This email was sent via the University of Edinburgh.
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.