AVh ddZddlZddlZddlZddlmZddlmZddlmZddlm Z ddlm Z d dZ y) z,Utility ops shared across tf.contrib.signal.N)ops) tensor_util) array_ops)math_ops) while_loopcFtj|d||g5tj|}tj|}|jj d|jj d|j j std|j z|j j std|j ztj|}tj|}|e|ctjjdkrtj}ntj}tj|||cdddSd}d}t!j ||||gd \}}|cdddS#1swYyxYw) azReturns the greatest common divisor via Euclid's algorithm. Args: a: The dividend. A scalar integer `Tensor`. b: The divisor. A scalar integer `Tensor`. name: An optional name for the operation. Returns: A scalar `Tensor` representing the greatest common divisor between `a` and `b`. Raises: ValueError: If `a` or `b` are not scalar integers. gcdrz"a must be an integer type. Got: %sz"b must be an integer type. Got: %sNcTtj|tj|SN)rgreaterr zeros_like)_bs U/home/dcms/DCMS/lib/python3.12/site-packages/tensorflow/python/ops/signal/util_ops.pyzgcd..Bs((I,@,@,CDc2|tj||gSr )rmod)ars rrzgcd..CsHLLA./rF) back_prop)r name_scopeconvert_to_tensorshapeassert_has_rankdtype is_integer ValueErrorrconstant_valuesys version_infomajor fractionsr mathr)rrnameconst_aconst_bmath_gcdcondbodys rr r sU ~~dEAq6*  a A a AGGAGGA 77   ;aggE FF 77   ;aggE FF((+G((+Gw2    ! #==88  " "8GW#= >+  . ED /D  taVu EDAq 5   sEF(%FF r ) __doc__r#r$r tensorflow.python.frameworkrrtensorflow.python.opsrrrr rrr/s'3 +3+*,) r