Age | Commit message (Collapse) | Author | Files | Lines |
|
Change-Id: I400fad08c0ae7b6b34bad63693f54856867e4dac
Reviewed-on: https://gerrit.libreoffice.org/3502
Reviewed-by: David Tardon <dtardon@redhat.com>
Tested-by: David Tardon <dtardon@redhat.com>
|
|
see https://gerrit.libreoffice.org/#/c/3367/
and Change-Id: I00c96fa77d04b33a6f8c8cd3490dfcd9bdc9e84a for details
Change-Id: I199a75bc4042af20817265d5ef85b1134a96ff5a
|
|
A bunch of objects use the optimization to assign one single,
unique default object to default-ctored instances, and decide
on whether any given object is in 'default' state by ptr-comparing
against this one unique instance. Simulating that pattern here.
Change-Id: I88f7d8488d81bcf1a01ab6b63121e003b8f0ade9
|
|
|
|
The calls to upper_bound in SwDoc::FldsToExpand and SwDoc::FldsToCalc
unfortunately compare the pointers and not the values pointed to,
which causes all sorts of trouble around non-updated fields.
(regression from 2815396a1813cb3956c5aba066de49a7f34bc657)
Change-Id: I48817247719671a16821fcb851b17b628c960a66
|
|
Change-Id: Icba4218c5f9fe89d183d25ea82a8eae52881f885
|
|
- do not use gb_UnpackedTarball_copy_header_files for boost
- adapt the optimization in concat-deps.c for new path
- use boost_headers in all LinkTargets that require it
- add explicit include paths to mysqlc, mysqlcppconn, libvisio, liborcus
Change-Id: I0c43e73ed43cc9d2e6bce8faf55e992d655a0bb9
|
|
The previous implementation uses sorted_vector::insert, which relies on
the array already being sorted.
Change-Id: I4a2e49e7d8fcfd934f8990be61f83d00d1a09ddd
|
|
Always link in gb_STDLIBS, except when the library explicitly opts out
with gb_LinkTarget_disable_standard_system_libs.
Change-Id: I489a99114fbfa46d0421a27cf6c7b899dc268a4a
|
|
... new gb_LinkTarget_add_standard_system_libs
Change-Id: Ib2bc843098db3d8c6822b45a3d21724e67f57d69
|
|
Change-Id: I53316e0b9369d806197bccb42cf22d3497af43e7
|
|
Change-Id: Ifcfa48fc87f905a91470a5b0fd597b02f220784c
Reviewed-on: https://gerrit.libreoffice.org/671
Tested-by: Norbert Thiebaud <nthiebaud@gmail.com>
Reviewed-by: Norbert Thiebaud <nthiebaud@gmail.com>
|
|
Change-Id: I139f9d008770da94341b8e6c08c9247478aa186a
|
|
This reverts commit 8291d41667b1a63d35bf818aaf9d75529e1f12f0.
Un-revert that, with a tweak: with the bizarre name lookup semantics
in C++, the proper way to refer to a template (as opposed to a template
instance) is by prefixing the name with its namespace, which does seem
to work with MSVC2008 & GCC 4.7; thanks to Stephan Bergmann for the hint.
Change-Id: Id9cccbe68fb3ce2dd070c4b3dbd21782c92170ca
|
|
This reverts commit 3e3acee762fac71f7356ed1305a64e0278278081.
It was a nice idea, but C++ is not yet ready for it; with the travesty
of parametric polymorphism in C++ the find_unique inside the definition
of find_unique actually refers to find_unique<Value, Compare>, so there
is no way to actually refer to template<Value, Compare> find_unique
inside its definition. Thanks to Luboš Luňák for explaining
the problem to me. Somehow this does work in GCC 4.7 even with
-std=c++98, likely by accident.
|
|
Enforces same type parameters for sorted_vector and Find, and makes
it easier to use.
Change-Id: Ide456a48f015cb0a9dea7a0bf2bcf2ccad527fd1
|
|
The Find parameter allows to implement sorted_vector that uses the
obvious std::less-like semantics, and also allows for a different
semantics where the array is sorted like std::less but duplicate values
(according to std::less) are allowed except if they're actually the same
object (pointer equality).
Change-Id: Id54871c336ddbc2d0a2272bcc81c56914943b449
|
|
Change-Id: Id70e87ab1b7f6a55ad2374cab05fa7f3bdef2cc4
|
|
Change-Id: Ib81388db2f93db662bb5439565f311835b08073e
|
|
Change-Id: I4709cfed8f4c5e61d18906dad2948f418409dc0c
|
|
Change-Id: I813629a2614f99035ab1b873ee34c203729c7367
|
|
Change-Id: I43f344fb06e45cc883c8c6cd9bbfbe29ef9c01f7
|
|
Change-Id: I4ba4164343f252ac451433ba3b07e2cd214e13f8
|
|
GCC 4.7 has a completely mysterious complaint that can be avoided with a
typedef:
inc/o3tl/sorted_vector.hxx:48:16: error: ‘vector’ is not a template
Change-Id: I58111df62c74f7d3a07e1e6e4fa1a400ff7d887c
|
|
I can't add a regular erase(iterator) method because we only hand
out const_iterator's
Change-Id: Ia3bdecb0f909d0712138c7ee48da268951e2733b
|
|
Implement suggestionss from David Tardon, mostly around prohibiting
access that could result in the vector becoming unsorted.
Add front() and back() accessors.
Add lower_bound() method.
Add optimised insert() method.
Change-Id: Icbb3597277f3e5963573b57d4f6d3cb740e896e6
|
|
Clearly we don't want to expose std::vector<Value>::insert here, and
neither e.g. push_back.
Change-Id: I89917a23d6d9f36f56474cdc361ba4d513516122
|
|
We use this kind of container a lot, so creating a single
implementation makes sense.
Change-Id: I67ead58becd7d2a287812145c11d93ab1c593c0f
|
|
|
|
|
|
Change-Id: I6c145e984c885c7e06caa1c27bfb354ea49ad9ce
|
|
this removes dmake completely out of the build for migrated modules
build.pl now assumes modules to be gbuild, unless there is a
prj/dmake file
Change-Id: I674a036b182ee13c5ec093e83cb3d38133112d3b
|
|
|
|
Naming convention for gbuild methods:
- "add" is used for stuff that is logically a part of the target
(i.e. not registered at the Module, but defined in the target's makefile)
- "use" is used for stuff that is logically a different target
(i.e. it is registered at the Module, has it's own makefile, may be
in a different module than the target)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
This allow to run make in a module wihtout the need to source
Env.Host.sh.
|
|
|
|
|
|
out a6913c9677c2
For LibO, that just means replacing sal/cppunit.h with sal/precppunit.hxx.
|
|
|
|
|
|
|
|
|