Date: prev next · Thread: first prev next last
December 2019 Archives by date, by thread · List index


https://bugs.documentfoundation.org/show_bug.cgi?id=129273

Luke Kendall <luke.kendall@gmail.com> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
     Ever confirmed|1                           |0
             Status|NEEDINFO                    |UNCONFIRMED

--- Comment #2 from Luke Kendall <luke.kendall@gmail.com> ---
Short answer: no, definitely not.

Reasons:
1. Main problem is that it only swaps paragraphs (not a word, phrase, or
clause).
2. For me, swapping paragraphs is very rare. For a paragraph, I would be far
more likely to simply cut and paste one para into a different place than to
swap two.
3. If Shift+ctrl+up/down only swaps the text (para) with the previous/next, it
would require more user steps than  cut/paste, when the paragraph needs to be
bubbled up/down further.
4. It also doesn't take advantage of the UI idea of having 
  <last-cut text + associated location in document>
coupled with
  <current text selection + its location in document>
to give you two text "selections" which you could apply binary operations to.
Admittedly, the only binary operation that springs immediately to mind as
useful is "swap"!

I hope these comments are helpful.

-- 
You are receiving this mail because:
You are on the CC list for the bug.

Context


Privacy Policy | Impressum (Legal Info) | Copyright information: Unless otherwise specified, all text and images on this website are licensed under the Creative Commons Attribution-Share Alike 3.0 License. This does not include the source code of LibreOffice, which is licensed under the Mozilla Public License (MPLv2). "LibreOffice" and "The Document Foundation" are registered trademarks of their corresponding registered owners or are in actual use as trademarks in one or more countries. Their respective logos and icons are also subject to international copyright laws. Use thereof is explained in our trademark policy.