You don't have the exchange risk when you lend with bitfinex. The exchange risk is taken on by the trader, and, in case his position loses money, he will cover the loss with funds in his trading wallet. If by any chances losses are greater than what the trader can afford, the loss is on Bitfinex, we will cover for the missing amount.
{ "dependencies" :
{ "foo" : "1.0.0 - 2.9999.9999"
, "bar" : ">=1.0.2 <2.1.2"
, "baz" : ">1.0.2 <=2.3.4"
, "boo" : "2.0.1"
, "qux" : "<1.0.0 || >=2.3.1 <2.4.5 || >=2.5.2 <3.0.0"
, "asd" : "http://asdf.com/asdf.tar.gz"
, "til" : "~1.2"
, "elf" : "~1.2.3"
, "two" : "2.x"
, "thr" : "3.3.x"
}
}npm i
| Ranking | ID | Global Rank |
| 1 | clvv42 | 2147 |
| 2 | gumnos | 2491 |
| 3 | wondible | 2867 |
| 4 | federicogalassi | 2885 |
| 5 | h_east | 2929 |
| 6 | yslinnctu | 3014 |
| 7 | Korvin79 | 3800 |
| 8 | _Balkoth_ | 3885 |
| 9 | johnsyweb | 4100 |
| 10 | hujunfeng | 4163 |
錯誤的程式 var some_function = function {arg1, arg2} [ var some_array = (1, 2, 3, 4, 'foo'); for {var i in some_array} ( console.log(some_array, [{1 + (8 / 2)}, 'hello (world)'); ) ];
正確的程式
var some_function = function (arg1, arg2) { var some_array = [1, 2, 3, 4, 'foo']; for (var i in some_array) { console.log(some_array, [(1 + (8 / 2)), 'hello (world)'); } };
# 要放到 class TestSequenceFunctions 裡面
def testFindFarthestPoint(self):
self.assertTrue( numpy.array_equal(FindFarthestPoint(numpy.array([0,0]), self.square)[0], numpy.array([1,1])) )
self.assertTrue( numpy.array_equal(FindFarthestPoint(numpy.array([0,2]), self.square)[0], numpy.array([1,0])) )
def FindFarthestPoint(p, polygon):
x = polygon[0,]-p[0]
y = polygon[1,]-p[1]
idx = numpy.argmax(x**2 + y**2)
return polygon[:,idx], idx
# 要放到 class TestSequenceFunctions 裡面
def testCountVertex(self):
self.assertEqual(CountMiddleVertex(self.square2), 1)
self.assertEqual(CountMiddleVertex(self.triangle), 1)
self.assertEqual(CountMiddleVertex(self.square), 2)
self.assertEqual(CountMiddleVertex(self.pentagon1), 3)
self.assertEqual(CountMiddleVertex(self.pentagon2), 3)
self.assertEqual(CountMiddleVertex(self.hexagon), 4)
def CountMiddleVertex(pointset, threshold=0.03):
pointnum = pointset.shape[1]
if pointnum <=2:
return 0
p1 = pointset[:, 0]
p2 = pointset[:, -1]
dist2 = (p1[0]-p2[0])*(p1[0]-p2[0]) + (p1[1]-p2[1])*(p1[1]-p2[1])
triarea = []
for p in range(pointset.shape[1]):
triarea.append(PolygonArea(numpy.column_stack((p1,p2,pointset[:,p]))))
# 如果最突出的點超過門檻值
if max(triarea)*1.0/dist2 > threshold:
midpoint = triarea.index(max(triarea))
vertexnum = 1 + CountMiddleVertex(pointset[:, 0:midpoint+1])
+ CountMiddleVertex(pointset[:, midpoint:], maxnum-vertexnum);
return 0
import numpy
import unittest
def PolygonArea(polygon):
x,y = numpy.column_stack((polygon, numpy.array([polygon[0,0],polygon[1,0]])))
return abs((numpy.dot(x[0:-1],y[1:]) - numpy.dot(x[1:],y[0:-1])))/2.0
def FindFarthestPoint(p, polygon):
x = polygon[0,]-p[0]
y = polygon[1,]-p[1]
idx = numpy.argmax(x**2 + y**2)
return polygon[:,idx], idx
def CountMiddleVertex(pointset, maxnum=10, threshold=0.03):
pointnum = pointset.shape[1]
if pointnum <=2:
return 0
p1 = pointset[:, 0]
p2 = pointset[:, -1]
dist2 = (p1[0]-p2[0])*(p1[0]-p2[0]) + (p1[1]-p2[1])*(p1[1]-p2[1])
triarea = []
for p in range(pointset.shape[1]):
triarea.append(PolygonArea(numpy.column_stack((p1,p2,pointset[:,p]))))
if max(triarea)*1.0/dist2 > threshold:
midpoint = triarea.index(max(triarea))
vertexnum = 1 + CountMiddleVertex(pointset[:, 0:midpoint+1]);
if vertexnum >= maxnum:
return maxnum
return vertexnum + CountMiddleVertex(pointset[:, midpoint:], maxnum-vertexnum);
return 0
def IsQuadrilateral(polygon):
x,y = polygon
if len(x) < 4 or len(x)!=len(y):
return False
p1, p1idx = FindFarthestPoint(polygon[:,0], polygon)
p2, p2idx = FindFarthestPoint(p1, polygon)
if p1idx > p2idx:
p1idx,p2idx = p2idx,p1idx
p1,p2 = p2,p1
if CountMiddleVertex(polygon[:, p1idx:p2idx+1], 2)==1 and \
CountMiddleVertex(numpy.column_stack((polygon[:, p2idx:], polygon[:, :p1idx+1])), 2)==1:
return True
else:
return False
class TestSequenceFunctions(unittest.TestCase):
def setUp(self):
self.triangle = numpy.array( [ (0,10,0),(0,0,10) ] )
self.square = numpy.array( [ (0,1,1,0),(0,0,1,1) ] )
self.square2 = numpy.array( [ (0,0.5,1,0),(0,-0.01,0,1) ] )
self.pentagon1 = numpy.array( [ (0,1,1,0,-1),(0,0,1,1,0.5) ] )
self.pentagon2 = numpy.array( [ (0,1,1,0,-0.01),(0,0,1,1,0.5) ] )
self.pentagon3 = numpy.array( [ (0,1,1,0,-0.21),(0,0,1,1,0.5) ] )
self.hexagon = numpy.array( [ (1,1,0,-1,-1,0),(1,-1,-2,-1,1,2) ] )
def testFindFarthestPoint(self):
self.assertTrue( numpy.array_equal(FindFarthestPoint(numpy.array([0,0]), self.square)[0], numpy.array([1,1])) )
self.assertTrue( numpy.array_equal(FindFarthestPoint(numpy.array([0,2]), self.square)[0], numpy.array([1,0])) )
def testCountVertex(self):
self.assertEqual(CountMiddleVertex(self.square2), 1)
self.assertEqual(CountMiddleVertex(self.triangle), 1)
self.assertEqual(CountMiddleVertex(self.square), 2)
self.assertEqual(CountMiddleVertex(self.pentagon1), 3)
self.assertEqual(CountMiddleVertex(self.pentagon2), 3)
self.assertEqual(CountMiddleVertex(self.hexagon), 4)
def testIsQuadrilateral(self):
self.assertEqual(IsQuadrilateral(self.triangle), False)
self.assertEqual(IsQuadrilateral(self.square), True)
self.assertEqual(IsQuadrilateral(self.pentagon1), False)
self.assertEqual(IsQuadrilateral(self.pentagon2), True)
self.assertEqual(IsQuadrilateral(self.pentagon3), False)
self.assertEqual(IsQuadrilateral(self.hexagon), False)
if __name__ == '__main__':
unittest.main()
def IsQuadrilateral(polygon): return False
import unittest
import numpy
class TestSequenceFunctions(unittest.TestCase):
def setUp(self):
self.triangle = numpy.array( [ (0,1,0),(0,0,1) ] )
self.square = numpy.array( [ (0,1,1,0),(0,0,1,1) ] )
def testIsQuadrilateral(self):
self.assertEqual(IsQuadrilateral(self.triangle), False)
self.assertEqual(IsQuadrilateral(self.square), True)
if __name__ == '__main__':
unittest.main()
def IsQuadrilateral(polygon):
x,y = polygon
if len(x) != 4 or len(x)!=len(y):
return False
return True
def testIsQuadrilateral(self):
self.assertEqual(IsQuadrilateral(self.triangle), False)
self.assertEqual(IsQuadrilateral(self.square), True)
self.assertEqual(IsQuadrilateral(self.pentagon1), False)
self.assertEqual(IsQuadrilateral(self.pentagon2), True)
self.assertEqual(IsQuadrilateral(self.pentagon3), False)
import unittest
import numpy
# 主函數
def IsQuadrilateral(polygon):
x,y = polygon
if len(x) != 4 or len(x)!=len(y):
return False
return True
# 測試程式
class TestSequenceFunctions(unittest.TestCase):
# 此函數在 testIsQuadrilateral 被執行前會被呼叫，以建立測試所需的物件
# 想一想為何需要一個獨立的 setUp 函數呢?
def setUp(self):
self.triangle = numpy.array( [ (0,10,0),(0,0,10) ] )
self.square = numpy.array( [ (0,1,1,0),(0,0,1,1) ] )
self.pentagon1 = numpy.array( [ (0,1,1,0,-1),(0,0,1,1,0.5) ] )
self.pentagon2 = numpy.array( [ (0,1,1,0,-0.01),(0,0,1,1,0.5) ] ) # 這個測試會失敗
self.pentagon3 = numpy.array( [ (0,1,1,0,-0.21),(0,0,1,1,0.5) ] )
def testIsQuadrilateral(self):
self.assertEqual(IsQuadrilateral(self.triangle), False)
self.assertEqual(IsQuadrilateral(self.square), True)
self.assertEqual(IsQuadrilateral(self.pentagon1), False)
self.assertEqual(IsQuadrilateral(self.pentagon2), True)
self.assertEqual(IsQuadrilateral(self.pentagon3), False)
if __name__ == '__main__':
unittest.main() # 會呼叫TestSequenceFunctions裡所有的測試函數
