ui 看着太丑了

坐标哪里，我想去锻炼锻炼

@TraceurMW 没加 requestbody 肯定不起效啊

@zjb861107 服务器能挖几个矿？看显卡的

Effective MySQL 和高可用 mysql

@ieiayaobb 除了 steam 别的哪家公司满足

oracle jdk6 最高版本是 45，哪来的 113，jdk7 最高 80，jdk8 目前是 261，你看错了版本或者用的不是 sun 的 jdk

要求不要用 redis

@tianyu94 用的 jwt 方式

@w292614191 不起效，问一下相关代码在哪

@jinhan13789991 what ？哥你在逗我

删除节点统计的代码
public void deleteNodeTotal(List<OrderInfo> orderInfoList, int len,
Map<String, Object> rowGroupMap, String[] rowParamArr, int levelFlag, List<List<Integer>> nestOrderInfoIndexCollection, List<List<Integer>> nestOrderInfoRepeatCollection)
{

List<List<Integer>> groupOrderInfoNumCollection = new ArrayList<List<Integer>>();
for (int i = 0; i < levelFlag; i++)
{
nestOrderInfoIndexCollection.add(new ArrayList<Integer>());
nestOrderInfoRepeatCollection.add(new ArrayList<Integer>());
groupOrderInfoNumCollection.add(new ArrayList<Integer>());
}

if (rowParamArr.length > 1)
{

getGroupOrderInfoNum(levelFlag, rowGroupMap, rowParamArr, groupOrderInfoNumCollection);

if (levelFlag >= 1)
{
getInsertPosition(levelFlag, groupOrderInfoNumCollection, orderInfoList, len, nestOrderInfoIndexCollection, nestOrderInfoRepeatCollection);
}
}

}

把结果集整理成需要的形式的代码
public void resultSetHandler(int rowLen, int levelFlag, Map<String, Object> map,
Map<String, Object> rowGroupMap, String[] rowParamArr,
List<List<OrderInfo>> nestOrderInfoCollection, int len, int i)
{
if (rowLen >= 1)
{
List<List<Integer>> temp = new ArrayList<>();
levelFlag--;
map.remove(rowParamArr[rowLen]);
rowGroupMap.remove(rowParamArr[rowLen]);
nestOrderInfoCollection.get(i).addAll(performanceService.getOrderInfo(map));
deleteNodeTotal(nestOrderInfoCollection.get(i), len, rowGroupMap, rowParamArr, levelFlag,temp,temp);
rowLen--;
i++;
resultSetHandler(rowLen, levelFlag, map, rowGroupMap, rowParamArr, nestOrderInfoCollection, len, i);
}
}

@zifangsky 随便给你看下插入小计的位置的代码
public void getInsertPosition(int levelFlag, List<List<Integer>> groupOrderInfoNumCollection,
List<OrderInfo> orderInfoList, int len, List<List<Integer>> nodeIndexList, List<List<Integer>> nestOrderInfoRepeatCollection)
{
int insertPos = 0;
int position = 0;
int[] listLen = new int[levelFlag];

if (levelFlag >= 1)
{
int[] index = new int[levelFlag];
for (int i = 0; i < levelFlag - 1; i++)
{
index[i] = groupOrderInfoNumCollection.get(i + 1).get(0);
}
for (Integer integer : groupOrderInfoNumCollection.get(0))
{
position += len * integer;
orderInfoList.remove(position);
insertPos += integer;
nodeIndexList.get(0).add(insertPos);
if(integer == 1){
nestOrderInfoRepeatCollection.get(0).add(insertPos);
}
for (int i = 0; i < levelFlag - 1; i++)
{
if (insertPos == index[i])
{
nodeIndexList.get(i + 1).add(insertPos);
orderInfoList.remove(insertPos * len);
listLen[i]++;
if (listLen[i] < groupOrderInfoNumCollection.get(i + 1).size())
{
index[i] += groupOrderInfoNumCollection.get(i + 1).get(listLen[i]);
}
}
}
}
if(orderInfoList.size() > 1){
orderInfoList.remove(orderInfoList.size() - 1);
}
}
}

@zifangsky 这 sql 只是看起来长，不复杂啊，修改的话就套模板，很快的。执行速度的话只要行列分组不超过 5 个都在 1 分钟之类，这种报表用逻辑代码写才是噩梦，我写出来要几百行代码，各种递归，小计总计还要判断位置，没写过想象不到的复杂

@wysnylc 太自信了

SELECT
row1,
row2,
IFNULL(column1, '总计'),
IFNULL(column2, '小计'),
sum(fee) fee
FROM
(
SELECT
row1,
row2,
column1,
column2,
fee
FROM
(
SELECT
*
FROM
(
SELECT
x.row1,
x.row2,
y.column1,
y.column2,
0 AS fee
FROM
(
SELECT
row1,
row2
FROM
xx_index
GROUP BY
row1,
row2
) x,
(
SELECT
column1,
column2
FROM
xx_index
GROUP BY
column1,
column2
) y
WHERE
(3 * y.column1 + y.column2) NOT IN (
SELECT
3 * m.column1 + m.column2
FROM
xx m
WHERE
m.row1 = x.row1
AND m.row2 = x.row2
)
GROUP BY
row1,
row2,
column1,
column2
) n
UNION
SELECT
row1,
row2,
column1,
column2,
sum(fee) fee
FROM
xx
GROUP BY
row1,
row2,
column1,
column2
) temp
GROUP BY
row1,
row2,
column1,
column2
) AS temp
GROUP BY
row1,
row2,
column1,
column2 WITH ROLLUP

@l00t 哈哈，是这样的，多谢