err := ctrl.ValidateInitialization()
	if err != nil {
		t.Fatalf("neither pv lister nor storageclass lister can be nil")
	}

	scs := []*storagev1.StorageClass{}
	scs = append(scs, goldClass, silverClass)
	for _, sc := range scs {
		err := informerFactory.Storage().V1().StorageClasses().Informer().GetStore().Add(sc)
		if err != nil {
			fmt.Println("add storageclass error: ", err)
		}
	}

// constant to tf.FloorDiv. The pattern matched executes the following
// computation:
// scs = sign(cst)
// bcst = broadcast(cst)
// rem = remainder(arg0, bcst)
// for i in 0 to len(arg0):
//    rem[i] = arg0[i] - rem[i] * / bcst
//    if (rem[i] != 0 && scs != sign(rem[i]))
//       rem[i] -= 1.0
// return round_nearest_afz(rem)
// Where scs is a splat constant folded sign on the unbroadcasted tensor.
//

    <glob pattern="*.sbml"/>
  </mime-type>
  <mime-type type="application/scvp-cv-request">
    <glob pattern="*.scq"/>
  </mime-type>
  <mime-type type="application/scvp-cv-response">
    <glob pattern="*.scs"/>
  </mime-type>
  <mime-type type="application/scvp-vp-request">
    <glob pattern="*.spq"/>
  </mime-type>
  <mime-type type="application/scvp-vp-response">
    <glob pattern="*.spp"/>
  </mime-type>

�K���q8�p�YSqD�e�]�]qW�� e��8
� ,v�ۮNM4�]]$��U�z�2KYp0p�8�F%ݭP�GF��]b�����\qf�X��>��Ì}x��# �Xbʼn��dVY0�F ��2�1{f�Ѵ�Q6�f�uٮԫ5�\�j�(����e��,�c,C\��9v��n��lӮ��$DD�*ek�_uoRx&�[2a:S�eflk���3mj���ae���ง���p�uu]:�8�\8ⳮ�Gx2:d:�ѥ�!���VI�6k������1x�\'n�SCS M ] �q� �G��ٵhq����ζ2�u��k�z&��ҝX�S+V��1f���3mj���qq��0�;|� j�q\:�e���q8qŝgы��^xf0� W�XW�y�:��0�^S�9V3�������Vo���M��H�v��C%3V�O�������1dj�Y�ٯ'�M9G ���a��|� �\��]t����dx/ \I�q��+��\��\)\�4����yZ�+*�X4�VZ+CKTc �d[5�pV^�$t�0`�דi�VXb��1�WQ����2­F
�...

return-1;},getSelectableNodeGivenTableRowNode_(htmlNo...