* Copyright 2013, Haiku, Inc. All Rights Reserved.
* Distributed under the terms of the MIT License.
*
* Authors:
* Ingo Weinhold <ingo_weinhold@gmx.de>
*/
#include <Catalog.h>
#include <package/solver/SolverProblemSolution.h>
#include <package/solver/SolverPackage.h>
#undef B_TRANSLATION_CONTEXT
#define B_TRANSLATION_CONTEXT "SolverProblemSolution"
static const char* const kToStringTexts[] = {
B_TRANSLATE_MARK("do something"),
B_TRANSLATE_MARK("do not keep %source% installed"),
B_TRANSLATE_MARK("do not install \"%selection%\""),
B_TRANSLATE_MARK("do not install the most recent version of "
"\"%selection%\""),
B_TRANSLATE_MARK("do not forbid installation of %source%"),
B_TRANSLATE_MARK("do not deinstall \"%selection%\""),
B_TRANSLATE_MARK("do not deinstall all resolvables \"%selection%\""),
B_TRANSLATE_MARK("do not lock \"%selection%\""),
B_TRANSLATE_MARK("keep %source% despite its inferior architecture"),
B_TRANSLATE_MARK("keep %source% from excluded repository"),
B_TRANSLATE_MARK("keep old %source%"),
B_TRANSLATE_MARK("install %source% despite its inferior architecture"),
B_TRANSLATE_MARK("install %source% from excluded repository"),
B_TRANSLATE_MARK("install %selection% despite its old version"),
B_TRANSLATE_MARK("allow downgrade of %source% to %target%"),
B_TRANSLATE_MARK("allow name change of %source% to %target%"),
B_TRANSLATE_MARK("allow architecture change of %source% to %target%"),
B_TRANSLATE_MARK("allow vendor change from \"%sourceVendor%\" (%source%) "
"to \"%targetVendor%\" (%target%)"),
B_TRANSLATE_MARK("allow replacement of %source% with %target%"),
B_TRANSLATE_MARK("allow deinstallation of %source%")
};
namespace BPackageKit {
BSolverProblemSolutionElement::BSolverProblemSolutionElement(BType type,
BSolverPackage* sourcePackage, BSolverPackage* targetPackage,
const BString& selection)
:
fType(type),
fSourcePackage(sourcePackage),
fTargetPackage(targetPackage),
fSelection(selection)
{
}
BSolverProblemSolutionElement::~BSolverProblemSolutionElement()
{
}
BSolverProblemSolutionElement::BType
BSolverProblemSolutionElement::Type() const
{
return fType;
}
BSolverPackage*
BSolverProblemSolutionElement::SourcePackage() const
{
return fSourcePackage;
}
BSolverPackage*
BSolverProblemSolutionElement::TargetPackage() const
{
return fTargetPackage;
}
const BString&
BSolverProblemSolutionElement::Selection() const
{
return fSelection;
}
BString
BSolverProblemSolutionElement::ToString() const
{
size_t index = fType;
if (index >= sizeof(kToStringTexts) / sizeof(kToStringTexts[0]))
index = 0;
return BString(B_TRANSLATE_NOCOLLECT(kToStringTexts[index]))
.ReplaceAll("%source%",
fSourcePackage != NULL
? fSourcePackage->VersionedName().String() : "?")
.ReplaceAll("%target%",
fTargetPackage != NULL
? fTargetPackage->VersionedName().String() : "?")
.ReplaceAll("%selection%", fSelection)
.ReplaceAll("%sourceVendor%",
fSourcePackage != NULL
? fSourcePackage->Info().Vendor().String() : "?")
.ReplaceAll("%targetVendor%",
fTargetPackage != NULL
? fTargetPackage->Info().Vendor().String() : "?");
}
BSolverProblemSolution::BSolverProblemSolution()
:
fElements(10)
{
}
BSolverProblemSolution::~BSolverProblemSolution()
{
}
int32
BSolverProblemSolution::CountElements() const
{
return fElements.CountItems();
}
const BSolverProblemSolution::Element*
BSolverProblemSolution::ElementAt(int32 index) const
{
return fElements.ItemAt(index);
}
bool
BSolverProblemSolution::AppendElement(const Element& element)
{
Element* newElement = new(std::nothrow) Element(element);
if (newElement == NULL || !fElements.AddItem(newElement)) {
delete newElement;
return false;
}
return true;
}
}
