import math
from utils import conf
#获取阶乘列表
def jieChen(n):
    myArray = {};
    myArray[0] = 1;
    i = 1;
    while i<n :
        myArray[i] = (i+1)*myArray[i-1];
        i = i+1
    return myArray;
#获取阶乘排列数组
def jiechenarray(n):
    array = [];
    if n < 1:
        return array
    if n == 1:
        onearray = [];
        onearray.append(n)
        array.append(onearray)
        return array
    subArray = jiechenarray(n-1);
    subArrayLength = len(subArray)
    for item in range(subArrayLength):
        for index in range(len(subArray)+1):
            newArrayItem = subArray[item].copy()
            newArrayItem.insert(index,n)
            array.append(newArrayItem)
    return array

#获取指定数的阶乘
def jieChenNumber(n):
    if(n <= 1):
        return 1;
    return jieChen(n)[n-1];
#辗转相除法进行进制转化
def changeInt2Str(i,m):
    if(not isinstance(m,int)):
        conf.myprint("m is not int",m)
        return
    if(m*i == 0):
        return "0";
    result = "";i
    myarray = {};
    while(i>=m):
        myarray[myarray.__len__()] = i%m
        i=int(i/m)
    if(i!=0):
        myarray[myarray.__len__()] = i
    for item in myarray :
        result=str(myarray[item])+result
    return result
#获取组合数位置列表
def getAllPosition(m, n):
    allArray = {}
    max = math.pow(m,n)
    index = 0;
    while (index < max):
        itemIndex = changeInt2Str(index,m)
        while(itemIndex.__len__()<n):
            itemIndex = "0"+itemIndex
        allArray[index]=itemIndex
        index = index+1
    conf.myprint(allArray)
    return allArray
#获取组合数列表的排列总数
def getAllArrayNumber(m,n):
    total = 0
    allArray = getAllPosition(m, n)
    for item in allArray:
        total = getitemIndexArrayNumber(allArray[item],m,n)+total
        conf.myprint("total=",total)
    return total
#获取单个组合的各边重复项
def getitemIndexArray(itemIndex,m,n):
    a = {};
    for item in range(m):
        index = 0;
        indexNum = 0;
        while(index < n):
            if(itemIndex[index] == str(item)):
                indexNum = indexNum + 1
            index = index+1
        a[item]=indexNum
    conf.myprint("a=",a)
    return a
#获取单个组合的各边重复项及其位置
def getitemIndexArrayAndIndex(itemIndex,m,n):
    a = {};
    for item in range(m):
        index = 0;
        indexList = [];
        while(index < n):
            if(itemIndex[index] == str(item)):
                indexList.append(index)
            index = index+1
        a[item]=indexList
    conf.myprint("a=",a)
    return a
#如[0, 1, 3]转成6个位置[0,1,3],[0,3,1],[1,0,3],[1,3,0],[3,0,1],[3,1,0]
def getPositionArray(positions):
    newPositons = []
    jiechen_array = jiechenarray(len(positions))
    for item in jiechen_array:
        m_position = []
        for item_item in item:
            m_position.append(positions[item_item-1])
        newPositons.append(m_position)
    return newPositons
#获取单个组合的各边重复项及重复项顺序
def getitemIndexArrayAndPosition(itemIndex,m,n):
    a = getitemIndexArray(itemIndex,m,n)
    for item in a:
        if(a[item] > 1):
            newItem = {}
            newItem[0] = a[item]
            newItem[1] = jiechenarray(a[item])
            a[item] = newItem
    conf.myprint("getitemIndexArrayAndPosition=",a)
    return a
#获取模板的插入顺序,必定大于1个
def getModuleIndex(itemIndex,m,n):
    indexArrayAndIndex = getitemIndexArrayAndIndex(itemIndex,m,n)
    positions=[]
    for item in indexArrayAndIndex:
        item1 = indexArrayAndIndex[item]
        if(len(item1)>0):
            position_array = getPositionArray(item1)
            if(len(positions) == 0):
              positions= position_array
            else:
              temp_positions=[]
              for temp_item in positions:
                  for this_temp_item in position_array:
                      new_temp_item = temp_item.copy()
                      for item1_item in item1:
                          item1_item_index=item1.index(item1_item)
                          new_temp_item.insert(this_temp_item[item1_item_index],item1_item)
                      temp_positions.append(new_temp_item)
              positions=temp_positions
    return positions

#获取单个组合的各边重复项--包含各项位置
# 如{0: {0: 0, 1: {}}, 1: {0: 0, 1: {}}, 2: {0: 2, 1: {0: 0, 1: 4}}, 3: {0: 3, 1: {0: 1, 1: 2, 2: 3}}, 4: {0: 0, 1: {}}}
def getitemIndexAndPositionArray(itemIndex, m, n):
    a = {};
    for item in range(m):
        index = 0;
        indexNum = 0;
        positions = {};
        while(index < n):
            if(itemIndex[index] == str(item)):
                positions[len(positions)] = index
                indexNum = indexNum + 1
            index = index+1
        aItem = {}
        aItem[0] = indexNum
        aItem[1]=positions
        a[item]=aItem
    conf.myprint("a=",a)
    return a
#获取单个组合的各边重复项的排列数
def getitemIndexArrayNumber(itemIndex,m,n):
    itemIndexArrayNumber = 1;
    a = getitemIndexArray(itemIndex,m,n)
    for item in a:
        intItem = int(a[item])
        if(intItem > 1):
            itemIndexArrayNumber = jieChenNumber(intItem)*itemIndexArrayNumber
    if(itemIndexArrayNumber == 0):
        itemIndexArrayNumber = 1
    return itemIndexArrayNumber
# result = changeInt2Str(14,3);
# conf.myprint(result)
# getAllPosition(3, 3)
# getAllArrayNumber(4,8)
# getitemIndexArray("11213",5,5)
# getitemIndexArrayAndIndex("11213",5,5)
# conf.myprint(getModuleIndex("11212",5,5))
# getitemIndexArrayAndPosition("11213",5,5)
# getitemIndexAndPositionArray("113", 4, 3)
# number = getitemIndexArrayNumber("11143",5,5)
# conf.myprint(number)
# getAllArrayNumber(11,2)
# conf.myprint(jiechenarray(3))
# conf.myprint(getPositionArray([0,3,4]))