Hi,
I have some mapping stuff here which I want to make finally downloadable.
Now that there is some free material for it, it is time to polish it a bit.
Perhaps it is of use for other people, too.
You can download a snapshot of mumpot at
http://osm.andi.de1.cc1/mumpot-0.1.tar.gz
It requires gtk
Andy Robinson (blackadder) wrote:
> Richard Fairhurst wrote:
>
>> *snip*
> Indeed, though to help the original user out perhaps we can have a concerted
> effort to get any deleted data returned. needs someone with a bit of time to
> investigate properly. Have therefore copied to dev.
>
> Thread
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Andy Robinson (blackadder) schrieb:
|> The need for area-level revert is known and understood, we just never
|> have enough programmers to do all the funky things that need doing...
|>
| Indeed, though to help the original user out perhaps we can have
Being able to record a commentary hands-free while surveying and then
use it in JOSM is a great liberation and a big advance by David Earl.
But, like the rest of JOSM, it has been developed incrementally, which
doesn't always make for the best user interface. So forgetting about the
technical d
Richard Fairhurst wrote:
>Sent: 28 February 2008 9:37 AM
>To: OSM Talk
>Subject: Re: [OSM-talk] Trouble in Rangoon
>
>David Ebling wrote:
>
>> I too am not going to spend much more time
>> contributing to OSM unless someone comes up with a
>> solution to this. As I said, I simply don't have the
>>
On Thu, Feb 28, 2008 at 10:30 AM, Marcus Wolschon <[EMAIL PROTECTED]>
wrote:
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> Andy Robinson (blackadder) schrieb:
> |> The need for area-level revert is known and understood, we just never
> |> have enough programmers to do all the funky things
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
80n schrieb:
| Sounds like we could need a stored procedure to undelete everything a
| ~ given user deleted between 2 given timestamps.
|
|
|> In this case, unless its accidental, it would be wise to revert *all*
|> edits by the user responsible.
I t
Hi,
> In this case, unless its accidental, it would be wise to revert
> *all* edits by the user responsible.
Wise? Really?
It surely is one option but sounds rather draconian to me. Suddenly
my OSM password becomes much more valuable than I thought it was
because if someone deletes London
Hi,
On 28.02.2008, at 10:49, Andy Robinson ((blackadder)) wrote:
> As for improving the problem overall, I think perhaps a bounty is
> needed?
I can only speak for myself but I am always turned away by bounties.
First of all I don't want to be seen as someone who only works if
there's remun
On Wed, Feb 27, 2008 at 10:39 PM, Sven Grüner <[EMAIL PROTECTED]> wrote:
> Hi,
>
> I'm not sure if this a true error or I'm just doing somthing wrong,
> because I can't imagine I'm the first one to try this. So I appologize
> for the latter.
You aren't the first - it's logged as #557 on trac.
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Frederik Ramm schrieb:
| Hi,
|
|> In this case, unless its accidental, it would be wise to revert *all*
|> edits by the user responsible.
|
| Wise? Really?
|
| It surely is one option but sounds rather draconian to me. Suddenly my
| OSM password become
In message <[EMAIL PROTECTED]>
Marcus Wolschon <[EMAIL PROTECTED]> wrote:
> Sounds like we could need a stored procedure to undelete everything a
> ~ given user deleted between 2 given timestamps.
Why on earth would you want to use a stored procedure? It's also not
clear that such a broad
In message <[EMAIL PROTECTED]>
Marcus Wolschon <[EMAIL PROTECTED]> wrote:
> In the end we really need something like
> the history-tab in wikipedia without breaking
> referential integrity uppon restores. Once
> accidents and vandalism becomes more common
> there is not much of a way aroun
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Tom Hughes schrieb:
| In message <[EMAIL PROTECTED]>
| Marcus Wolschon <[EMAIL PROTECTED]> wrote:
|
|> In the end we really need something like
|> the history-tab in wikipedia without breaking
|> referential integrity uppon restores. Once
|> ac
In message <[EMAIL PROTECTED]>
Marcus Wolschon <[EMAIL PROTECTED]> wrote:
> Tom Hughes schrieb:
> | In message <[EMAIL PROTECTED]>
> | Marcus Wolschon <[EMAIL PROTECTED]> wrote:
> |
> |> In the end we really need something like
> |> the history-tab in wikipedia without breaking
> |
Hi,
> Frederic:
> I was thinking about a stored procedure
> because for an undelete I saw
> no requirement for complex logic and
> quite some data to be accessed.
> This is something databases are made
> for and that they can optimize themself.
> I could not see a need to transfer
> the data to re
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Frederik Ramm schrieb:
| I agree that this would probably be the fastest way but I have a
| personal dislike against stored procedures ;-) they're so out-of-
| sight if you know what I mean.
Yes, I can see that.
Implementing it in application-code is
Hi,
> Why to you suppose the editor give a changeset-api?
> What about threating every upload as a new changeset
> and make it transparent to the client?
> This way all clients still work and they can implement
> support for "get_history", "revert_changeset" and "get_changeset"
> at any later time
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Frederik Ramm schrieb:
| The only thing I'd ask of editors is to support "create_changeset"
| and then use the ID returned on subsequent edits. This, I believe, is
| a small price to pay for the grouping advantages we would get.
| Automatically creatin
In message <[EMAIL PROTECTED]>
Marcus Wolschon <[EMAIL PROTECTED]> wrote:
> Frederik Ramm schrieb:
> | The only thing I'd ask of editors is to support "create_changeset"
> | and then use the ID returned on subsequent edits. This, I believe, is
> | a small price to pay for the grouping adva
Hi,
> What about implicitely creating a new changeset if none is
> given, so that a transition is smooth?
I did suggest that on the Wiki page.
> Can anyone suggest to handle the case of user B
> editing entities that are edited in the changeset
> of A before AND after the edit of B?
Difficult b
On Thu, Feb 28, 2008 at 02:44:06PM +0100, Frederik Ramm wrote:
> The only thing I'd ask of editors is to support "create_changeset"
> and then use the ID returned on subsequent edits. This, I believe, is
> a small price to pay for the grouping advantages we would get.
> Automatically creating
Hi,
> node a is initially at state a0
> - user X create_changeset 1
> - user X change node a to state a1
> - user Y create_changeset 2
> - user Y change node a to state a2
> - user Y close_changeset 2
> - user X change node a to state a3
> - user X close_changeset 1
>
> Now revert changeset 2.
How feasible would it be to put a set of attributes either on the top
level element or an element created for the purpose which tells me how
many nodes, ways and relations there are in the file. If you have the
counts to hand at the beginning, great, but if not if you wrote '...
nodecount="
Sebastian Spaeth wrote:
> I will use:
> http://wiki.openstreetmap.org/index.php/Google_Summer_of_Code
> as a starting point. Feel free to add ideas for projects to that page.
From the Mozilla experience, I'd recommend having separate
"Brainstorming" and official "Idea List" pages, with the GSoC
Frederik Ramm wrote:
> Don't know how others feel about this. The whole "changeset" and
> "rollback" complex is very high on my personal "next big thing I'll
> tackle if time allows" list but I think it is of equal complexity
> to the introduction of relations last year; it will probably
>
Jason Reid wrote:
> Andy Robinson (blackadder) wrote:
>
>> Richard Fairhurst wrote:
>>
>>
>>> *snip*
>>>
>> Indeed, though to help the original user out perhaps we can have a concerted
>> effort to get any deleted data returned. needs someone with a bit of time to
>> investigate p
Gervase Markham wrote:
> Sebastian Spaeth wrote:
>> I will use:
>> http://wiki.openstreetmap.org/index.php/Google_Summer_of_Code
>> as a starting point. Feel free to add ideas for projects to that page.
>
> From the Mozilla experience, I'd recommend having separate
> "Brainstorming" and official
Sebastian Spaeth wrote:
> Sounds reasonable, but I don't mind the brainstorming happening there
> now. I can always put stuff away on the future ideas page, after/when
> submitting us.
The problem with that is that, when you register your organisation, you
have to give them the URL of your Idea
On Thu, 2008-02-28 at 12:27 +, David Earl wrote:
> How feasible would it be to put a set of attributes either on the top
> level element or an element created for the purpose which tells me how
> many nodes, ways and relations there are in the file. If you have the
> counts to hand at the b
Hi Jon,
> It is more tricky than that unfortunately. The planet dump code streams
> data to STDOUT. It can not simply seek back to the beginning. We have
> similar disk space issues when generating the file so it gets piped
> directly to gzip so again there is no trivial way to update the contents
On Thu, 2008-02-28 at 23:09 +0100, Frederik Ramm wrote:
> With the gzip and bunzip2 formats, the following holds (quote form
> manpage):
>
> > bunzip2 will correctly decompress a file which is the concatenation
> > of two or more compressed files. The result is the concatenation of
> > the corre
David Earl wrote:
> How feasible would it be to put a set of attributes either on the top
> level element or an element created for the purpose which tells me how
> many nodes, ways and relations there are in the file. If you have the
> counts to hand at the beginning, great, but if not if you w
33 matches
Mail list logo
