- 斐讯T1&N1
- 小米盒子海外版
- 泰捷盒子
- 海美迪
- 企鹅极光盒子 1s
| { | |
| "Config": "\u914d\u7f6e", | |
| "Maniphest": "\u4efb\u52a1&Bug", | |
| "Tasks": "\u4efb\u52a1&Bug", | |
| "Phriction": "\u6587\u6863\u5e93", | |
| "Projects": "\u9879\u76ee", | |
| "Joined": "\u53c2\u4e0e\u4e2d", | |
| "Translations": "\u7ffb\u8bd1", | |
| "Countdown": "\u5012\u8ba1\u65f6", | |
| "Files": "\u6587\u4ef6\u7ba1\u7406", |
| combine = (list, index = 0, combination = [], result = []) -> | |
| if (list[index]) | |
| for value in list[index] | |
| combination[index] = value; | |
| combine(list, index + 1, combination, result); | |
| else | |
| result.push(combination[..]); | |
| return result; |
Note: Please check this blog post for more details on these functions.
Sort a SQL query with id and parentid so that
the rows have the correct order of the tree.
Parameters:
q (Array): A query result (see example below)| /** | |
| * Copyright 2012 Akseli Palén. | |
| * Created 2012-07-15. | |
| * Licensed under the MIT license. | |
| * | |
| * <license> | |
| * Permission is hereby granted, free of charge, to any person obtaining | |
| * a copy of this software and associated documentation files | |
| * (the "Software"), to deal in the Software without restriction, | |
| * including without limitation the rights to use, copy, modify, merge, |