Searched refs:force_hash (Results 1 – 11 of 11) sorted by relevance
16 my $tpp = XML::TreePP->new( force_hash => [qw( one two three )] );32 my $tpp = XML::TreePP->new( force_hash => '*' );
15 _tree => XML::TreePP->new((force_hash=>['Model']))->parsefile($_[1])
88 unsigned force_hash; member301 force_hash = 0; in fpattern()635 if(force_hash && hashv != force_hash) continue; in solve3()1282 fp.Prime = 11; fp.force_hash = 0x5FC4CFF0; fp.solve(); in getcurrfp()1298 fp.Prime = 11; fp.force_hash = 0x65CE0C00; fp.solve(); in getcurrfp()1331 fp.Prime = 5; fp.force_hash = 0x558C8ED0u; fp.solve(); in getcurrfp()1340 fp.Prime = 5; fp.force_hash = 0x9FDE7B38u; fp.solve(); in getcurrfp()1349 fp.Prime = 11; fp.force_hash = 0xF447F75Cu; fp.solve(); in getcurrfp()1357 fp.Prime = 11; fp.force_hash = 0x5A2E2B88u; fp.solve(); in getcurrfp()1363 fp.Prime = 11; fp.force_hash = 0x363D8DA4u; fp.solve(); in getcurrfp()
568 … for(int p=2;; p++) { currfp.Prime = p; currfp.force_hash = 0; if(!currfp.solve()) break; } in select_quotient_screen()1150 currfp.Prime = p; currfp.force_hash = hash; if(!currfp.solve()) break; in field_quotient_3d()
694 for(;; p++) { currfp.Prime = p; currfp.force_hash = 0x72414D0C; if(!currfp.solve()) break; } in mode_higlights()
1263 for(;; p++) { currfp.Prime = p; currfp.force_hash = 0x72414D0C; if(!currfp.solve()) break; } in show_vr_demos()
720 if ( exists $self->{force_hash} ) {721 my $force = $self->{force_hash};
731 if ( exists $self->{force_hash} ) {732 my $force = $self->{force_hash};
208 force_hash212 $tpp->set( force_hash => [ 'item', 'image' ] );
96 * new option: force_hash => [], and also '*' means every elements
231 $tpp->set( force_hash => [ 'item', 'image' ] );