GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-08 02:18:03 +00:00
Code Issues Packages Projects Releases Wiki Activity

#273: Remove nose dependency for graphs_trees/ (#277)

Browse Source
This commit is contained in:
Donne Martin
2020-07-10 21:02:32 -04:00
committed by GitHub
parent 139e157250
commit abf7524c26
67 changed files with 860 additions and 1027 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
graphs_trees/bst_successor/bst_successor_challenge.ipynb
View File

@@ -100,9 +100,7 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"class BstSuccessor(object):\n",
@@ -129,19 +127,15 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"# %load test_bst_successor.py\n",
"from nose.tools import assert_equal\n",
"from nose.tools import raises\n",
"import unittest\n",
"\n",
"\n",
"class TestBstSuccessor(object):\n",
"class TestBstSuccessor(unittest.TestCase):\n",
"\n",
" @raises(Exception)\n",
" def test_bst_successor_empty(self):\n",
" bst_successor = BstSuccessor()\n",
" bst_successor.get_next(None)\n",
@@ -164,10 +158,10 @@
" nodes[9] = bst.insert(9)\n",
"\n",
" bst_successor = BstSuccessor()\n",
" assert_equal(bst_successor.get_next(nodes[4]), 5)\n",
" assert_equal(bst_successor.get_next(nodes[5]), 6)\n",
" assert_equal(bst_successor.get_next(nodes[8]), 9)\n",
" assert_equal(bst_successor.get_next(nodes[15]), None)\n",
" self.assertEqual(bst_successor.get_next(nodes[4]), 5)\n",
" self.assertEqual(bst_successor.get_next(nodes[5]), 6)\n",
" self.assertEqual(bst_successor.get_next(nodes[8]), 9)\n",
" self.assertEqual(bst_successor.get_next(nodes[15]), None)\n",
"\n",
" print('Success: test_bst_successor')\n",
"\n",
@@ -175,7 +169,7 @@
"def main():\n",
" test = TestBstSuccessor()\n",
" test.test_bst_successor()\n",
" test.test_bst_successor_empty()\n",
" test.assertRaises(TypeError, test.test_bst_successor_empty)\n",
"\n",
"\n",
"if __name__ == '__main__':\n",
@@ -208,9 +202,9 @@
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.5.0"
"version": "3.7.2"
}
},
"nbformat": 4,
"nbformat_minor": 0
"nbformat_minor": 1
}

36
graphs_trees/bst_successor/bst_successor_solution.ipynb
View File

@@ -95,9 +95,7 @@
{
"cell_type": "code",
"execution_count": 1,
"metadata": {
"collapsed": true
},
"metadata": {},
"outputs": [],
"source": [
"%run ../bst/bst.py"
@@ -106,9 +104,7 @@
{
"cell_type": "code",
"execution_count": 2,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"class BstSuccessor(object):\n",
@@ -148,9 +144,7 @@
{
"cell_type": "code",
"execution_count": 3,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -162,13 +156,11 @@
],
"source": [
"%%writefile test_bst_successor.py\n",
"from nose.tools import assert_equal\n",
"from nose.tools import raises\n",
"import unittest\n",
"\n",
"\n",
"class TestBstSuccessor(object):\n",
"class TestBstSuccessor(unittest.TestCase):\n",
"\n",
" @raises(Exception)\n",
" def test_bst_successor_empty(self):\n",
" bst_successor = BstSuccessor()\n",
" bst_successor.get_next(None)\n",
@@ -191,10 +183,10 @@
" nodes[9] = bst.insert(9)\n",
"\n",
" bst_successor = BstSuccessor()\n",
" assert_equal(bst_successor.get_next(nodes[4]), 5)\n",
" assert_equal(bst_successor.get_next(nodes[5]), 6)\n",
" assert_equal(bst_successor.get_next(nodes[8]), 9)\n",
" assert_equal(bst_successor.get_next(nodes[15]), None)\n",
" self.assertEqual(bst_successor.get_next(nodes[4]), 5)\n",
" self.assertEqual(bst_successor.get_next(nodes[5]), 6)\n",
" self.assertEqual(bst_successor.get_next(nodes[8]), 9)\n",
" self.assertEqual(bst_successor.get_next(nodes[15]), None)\n",
"\n",
" print('Success: test_bst_successor')\n",
"\n",
@@ -202,7 +194,7 @@
"def main():\n",
" test = TestBstSuccessor()\n",
" test.test_bst_successor()\n",
" test.test_bst_successor_empty()\n",
" test.assertRaises(TypeError, test.test_bst_successor_empty)\n",
"\n",
"\n",
"if __name__ == '__main__':\n",
@@ -212,9 +204,7 @@
{
"cell_type": "code",
"execution_count": 4,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -245,9 +235,9 @@
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.5.0"
"version": "3.7.2"
}
},
"nbformat": 4,
"nbformat_minor": 0
"nbformat_minor": 1
}

18
graphs_trees/bst_successor/test_bst_successor.py
View File

@@ -1,10 +1,8 @@
from nose.tools import assert_equal
from nose.tools import raises
import unittest
class TestBstSuccessor(object):
class TestBstSuccessor(unittest.TestCase):
@raises(Exception)
def test_bst_successor_empty(self):
bst_successor = BstSuccessor()
bst_successor.get_next(None)
@@ -27,10 +25,10 @@ class TestBstSuccessor(object):
nodes[9] = bst.insert(9)
bst_successor = BstSuccessor()
assert_equal(bst_successor.get_next(nodes[4]), 5)
assert_equal(bst_successor.get_next(nodes[5]), 6)
assert_equal(bst_successor.get_next(nodes[8]), 9)
assert_equal(bst_successor.get_next(nodes[15]), None)
self.assertEqual(bst_successor.get_next(nodes[4]), 5)
self.assertEqual(bst_successor.get_next(nodes[5]), 6)
self.assertEqual(bst_successor.get_next(nodes[8]), 9)
self.assertEqual(bst_successor.get_next(nodes[15]), None)
print('Success: test_bst_successor')
@@ -38,8 +36,8 @@ class TestBstSuccessor(object):
def main():
test = TestBstSuccessor()
test.test_bst_successor()
test.test_bst_successor_empty()
test.assertRaises(TypeError, test.test_bst_successor_empty)
if __name__ == '__main__':
main()
main()