% 函數功能： 對不同算法輸入的函數值，求出其中的最優解，并返回 特定算法 獲得的解在最優解中的個數
function [out_allParetoOptimal, out_myAlgCount] = getAllParetoOptimal(in_algFunVals, in_funInd, in_algsInd, in_myAlgNum)
%  輸入：
%     in_algFunVals:   需排列的元素，（1 × valueCount）維
%  輸出：
%     
f_solCount = size(in_algFunVals, 1);
% 初始所有的解都是最優解
isOptimal = ones(f_solCount, 1);

% 對每一個 目前還是最優解的解，與當前的最優解 比較，差的話去掉最優解稱號，退出，找下一個；被比較的最優解差的話，也去掉稱號，換下一最優解比較
for (iSol = 1: f_solCount)
    comSol = 1;
    while (isOptimal(iSol, 1) == 1) && (comSol <= f_solCount)
        if (isOptimal(comSol, 1) == 1) % 是最優解才比較
            if (in_algFunVals(comSol, in_funInd) <= in_algFunVals(iSol, in_funInd)) && (in_algFunVals(comSol, in_funInd + 1) <= in_algFunVals(iSol, in_funInd + 1)) && ...
                    ((in_algFunVals(comSol, in_funInd) + in_algFunVals(comSol, in_funInd + 1)) < (in_algFunVals(iSol, in_funInd) + in_algFunVals(iSol, in_funInd + 1)))
                isOptimal(iSol, 1) = 0;
            elseif  (in_algFunVals(iSol, in_funInd) <= in_algFunVals(comSol, in_funInd)) && (in_algFunVals(iSol, in_funInd + 1) <= in_algFunVals(comSol, in_funInd + 1)) && ...
                    ((in_algFunVals(iSol, in_funInd) + in_algFunVals(iSol, in_funInd + 1)) < (in_algFunVals(comSol, in_funInd) + in_algFunVals(comSol, in_funInd + 1)))   
                isOptimal(comSol, 1) = 0;
            end
        end
        comSol = comSol + 1;
    end % 結束 while (isOptimal(iSol, 1) == 1) && (comSol <= f_solCount)
end
%%－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－%%
%       將最優解存入 allParetoOptimal 中
out_allParetoOptimal =[];
allPOCount = 0;
out_myAlgCount = 0;
for (iSol = 1: f_solCount)
    if (isOptimal(iSol, 1) == 1)
        out_allParetoOptimal = [out_allParetoOptimal; in_algFunVals(iSol, :)];
        allPOCount = allPOCount + 1;
        if (in_algFunVals(iSol, in_algsInd) == in_myAlgNum)
            out_myAlgCount = out_myAlgCount + 1;
        end
    end
end