Python generate_shards Examples

Example #1

File: test_migrations.py Project: vzts/djangae

    def test_key_pairs_for_more_shards_than_keys(self):
        keys = [1, 2, 3, 4, 5]
        result = generate_shards(keys, 999)

        self.assertEqual(result, [(1, 2), (2, 3), (3, 4), (4, 5), (5, None)])

Example #2

File: test_migrations.py Project: vzts/djangae

    def test_key_pairs_for_1_shard(self):
        keys = [1, 2, 3, 4, 5]
        result = generate_shards(keys, 1)

        self.assertEqual(result, [(1, None)])

Example #3

File: test_migrations.py Project: vzts/djangae

    def test_key_pairs_for_shards_not_evenly_dividing_num_keys(self):
        keys = [1, 2, 3, 4, 5]
        result = generate_shards(keys, 2)

        self.assertEqual(result, [(1, 4), (4, None)])

Example #4

File: test_migrations.py Project: vzts/djangae

    def test_key_pairs_returned_in_order(self):
        keys = [5, 3, 1, 2, 4]
        result = generate_shards(keys, 2)

        self.assertEqual(result, [(1, 4), (4, None)])

Example #5

File: test_migrations.py Project: andreipetre/djangae

    def test_key_pairs_for_more_shards_than_keys(self):
        keys = [1, 2, 3, 4, 5]
        result = generate_shards(keys, 999)

        self.assertEqual(result, [(1, 2), (2, 3), (3, 4), (4, 5), (5, None)])

Example #6

File: test_migrations.py Project: andreipetre/djangae

    def test_key_pairs_for_shards_not_evenly_dividing_num_keys(self):
        keys = [1, 2, 3, 4, 5]
        result = generate_shards(keys, 2)

        self.assertEqual(result, [(1, 4), (4, None)])

Example #7

File: test_migrations.py Project: andreipetre/djangae

    def test_key_pairs_for_1_shard(self):
        keys = [1, 2, 3, 4, 5]
        result = generate_shards(keys, 1)

        self.assertEqual(result, [(1, None)])

Example #8

File: test_migrations.py Project: andreipetre/djangae

    def test_key_pairs_returned_in_order(self):
        keys = [5, 3, 1, 2, 4]
        result = generate_shards(keys, 2)

        self.assertEqual(result, [(1, 4), (4, None)])