code: def test_udivisors_and_udivisor_count():
      assert udivisors(-1) == [1]
      assert udivisors(0) == []
      assert udivisors(1) == [1]
      assert udivisors(2) == [1, 2]
      assert udivisors(3) == [1, 3]
      assert udivisors(17) == [1, 17]
      assert udivisors(10) == [1, 2, 5, 10]
      assert udivisors(100) == [1, 4, 25, 100]
      assert udivisors(101) == [1, 101]
      assert udivisors(1000) == [1, 8, 125, 1000]
      assert type(udivisors(2, generator=True)) is not list
  
      assert udivisor_count(0) == 0
      assert udivisor_count(-1) == 1
      assert udivisor_count(1) == 1
      assert udivisor_count(6) == 4
      assert udivisor_count(12) == 4
  
      assert udivisor_count(180) == 8
      assert udivisor_count(2 * 3 * 5 * 7) == 16
  
imports: from sympy.concrete.summations import summation
  from sympy.core.containers import Dict
  from sympy.core.mul import Mul
  from sympy.core.power import Pow
  from sympy.core.singleton import S
  from sympy.core.symbol import Symbol
  from sympy.functions.combinatorial.factorials import factorial
  from sympy.core.numbers import Integer, Rational
  from sympy.external.gmpy import gcd
  from sympy.ntheory import totient, factorint, primefactors, divisors, nextprime, primerange, pollard_rho, perfect_power, multiplicity, multiplicity_in_factorial, divisor_count, primorial, pollard_pm1, divisor_sigma, factorrat, reduced_totient
  from sympy.ntheory.factor_ import smoothness, smoothness_p, proper_divisors, antidivisors, antidivisor_count, core, udivisors, udivisor_sigma, udivisor_count, proper_divisor_count, primenu, primeomega, mersenne_prime_exponent, is_perfect, is_abundant, is_deficient, is_amicable, dra, drm, _perfect_power
  from sympy.testing.pytest import raises, slow
  from sympy.utilities.iterables import capture
label_desc: Use image node_id 10 for calling a global function with example usage: test_udivisors_and_udivisor_count() without return types