| /dports/math/gap/gap-4.11.0/pkg/ToolsForHomalg-2019.09.02/gap/ |
| H A D | Trees.gi | 39 [ IsTree, IsTree ],
48 [ IsTree ],
59 [ IsTree ],
70 [ IsTree, IsTree ],
89 [ IsTree, IsList ],
116 [ IsTree ],
147 [ IsTree ],
208 [ IsTree ],
226 [ IsObject, IsTree ],
301 [ IsTree ],
[all …]
|
| H A D | Trees.gd | 21 DeclareCategory( "IsTree",
30 IsTree );
39 [ IsTree ] );
46 [ IsTree ] );
53 [ IsTree ] );
63 [ IsTree ] );
86 [ IsTree, IsTree ] );
90 [ IsTree, IsList ] );
99 [ IsTree ] );
106 [ IsTree ] );
|
| /dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/include/objmgr/impl/ |
| H A D | priority.hpp | 70 bool IsTree(void) const;
181 bool CPriorityNode::IsTree(void) const in IsTree() function in CPriorityNode
209 _ASSERT(IsTree()); in GetTree()
216 _ASSERT(IsTree()); in GetTree()
223 return !IsLeaf() && (!IsTree() || m_SubTree->IsEmpty()); in IsEmpty()
232 _ASSERT(m_Node && (m_Node->IsTree() || m_Node->IsLeaf())); in operator *()
|
| /dports/biology/ncbi-blast+/ncbi-blast-2.12.0+-src/c++/include/objmgr/impl/ |
| H A D | priority.hpp | 70 bool IsTree(void) const;
181 bool CPriorityNode::IsTree(void) const in IsTree() function in CPriorityNode
209 _ASSERT(IsTree()); in GetTree()
216 _ASSERT(IsTree()); in GetTree()
223 return !IsLeaf() && (!IsTree() || m_SubTree->IsEmpty()); in IsEmpty()
232 _ASSERT(m_Node && (m_Node->IsTree() || m_Node->IsLeaf())); in operator *()
|
| /dports/devel/hs-darcs/darcs-2.16.4/src/Darcs/Repository/ |
| H A D | Job.hs | 168 data IsTree p where type
169 IsTree :: (ApplyState p ~ Tree) => IsTree p
171 checkTree :: RepoPatchType p -> IsTree p
172 checkTree RepoV1 = IsTree
173 checkTree RepoV2 = IsTree
174 checkTree RepoV3 = IsTree
268 IsTree -> do
309 (IsTree, SIsRebase) -> do
316 (IsTree, SIsRebase) -> do
323 (IsTree, SIsRebase) -> do
[all …]
|
| /dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/objmgr/ |
| H A D | priority.cpp | 145 if ( node.IsTree() ) { in CPriorityNode()
196 if ( IsTree() ) { in Erase()
232 else if ( m_Node->IsTree() ) { in CPriority_I()
258 else if ( m_Node->IsTree() ) { in operator ++()
|
| /dports/biology/ncbi-blast+/ncbi-blast-2.12.0+-src/c++/src/objmgr/ |
| H A D | priority.cpp | 145 if ( node.IsTree() ) { in CPriorityNode()
196 if ( IsTree() ) { in Erase()
232 else if ( m_Node->IsTree() ) { in CPriority_I()
258 else if ( m_Node->IsTree() ) { in operator ++()
|
| /dports/math/gambit/gambit-16.0.1/src/tools/enumpure/ |
| H A D | enumpure.cc | 129 if (reportStrategic || !game->IsTree()) { in main()
146 if (game->IsTree()) { in main()
|
| /dports/math/gambit/gambit-16.0.1/src/gui/ |
| H A D | analysis.cc | 108 if (m_doc->IsTree()) { in AddOutput()
128 if (m_doc->IsTree()) { in NumProfiles()
225 if (m_doc->IsTree()) { in GetPayoff()
441 if (m_doc->IsTree()) { in Save()
|
| H A D | gamedoc.cc | 64 if (m_doc->IsTree()) { in Reset()
328 if (m_game->IsTree()) { in SaveDocument()
337 if (m_game->IsTree()) { in SaveDocument()
394 if (m_game->IsTree()) { in BuildNfg()
642 if (!m_game->IsTree()) { in DoNewPlayer()
|
| H A D | gamedoc.h | 274 bool IsTree(void) const { return m_game->IsTree(); } in IsTree() function
|
| /dports/devel/hs-ghcprofview/ghcprofview-0.1.0.1/src/ |
| H A D | Types.hs | 20 class IsTree t a | t -> a where constructor
56 instance IsTree CostCentreData CostCentreData where
|
| /dports/math/gambit/gambit-16.0.1/src/tools/logit/ |
| H A D | logit.cc | 180 if (mleFile != "" && (!game->IsTree() || useStrategic)) { in main()
195 if (!game->IsTree() || useStrategic) { in main()
|
| /dports/devel/hs-ghcprofview/ghcprofview-0.1.0.1/src/Gui/ |
| H A D | TreeWidget.hs | 38 mkTreeStore :: forall a t . IsTree t a => TreeWidgetConfig a -> t -> IO TreeStore
54 mkTreeView :: forall t a . IsTree t a => TreeWidgetConfig a -> t -> IO TreeView
|
| /dports/databases/couchdb3/apache-couchdb-3.2.1/src/fabric/src/ |
| H A D | fabric_doc_open_revs.erl | 94 IsTree = Revs == all orelse Latest,
99 {NewReplies, QuorumMet, Repair} = case IsTree of
131 IsTree,
137 {stop, format_reply(IsTree, NewReplies, RealReplyCount)};
198 maybe_read_repair(Db, IsTree, Replies, NodeRevs, ReplyCount, DoRepair) ->
199 Docs = case IsTree of
|
| /dports/math/gambit/gambit-16.0.1/library/src/ |
| H A D | game.cc | 48 if (m_player->GetGame()->IsTree()) throw UndefinedException(); in DeleteStrategy()
81 if (m_game->IsTree()) throw UndefinedException(); in NewStrategy()
598 (p_format == "native" && IsTree())) { in Write()
602 (p_format == "native" && !IsTree())) { in Write()
|
| /dports/cad/zcad/zcad-8b8a693/cad_source/other/AGraphLaz/Graphs/ |
| H A D | GraphGML.pas | 716 IsTree, IsNetwork, IsWeighted, IsGeom2D, IsGeom3D: Bool;
856 IsTree:=Tree in G.Features;
862 if IsTree or IsNetwork or IsWeighted or
867 if IsTree then begin
906 IsTree:=False;
933 if IsTree then Parent:=V.Parent else Parent:=nil;
|
| /dports/games/libretro-yabause/yabause-ea5b118/yabause/src/libchdr/deps/lzma-16.04/CPP/7zip/UI/Common/ |
| H A D | OpenArchive.h | 311 bool IsTree; variable
325 IsTree(false), in CArc()
|
| /dports/emulators/mess/mame-mame0226/3rdparty/lzma/CPP/7zip/UI/Common/ |
| H A D | OpenArchive.h | 311 bool IsTree; variable
325 IsTree(false), in CArc()
|
| /dports/audio/festival/festival/src/modules/hts21_engine/ |
| H A D | tree.cc | 138 HTS_Boolean IsTree (Tree *tree, char *buf) in IsTree() function
264 if (IsTree(t, buf)) { in LoadTreesFile()
|
| /dports/emulators/mame/mame-mame0226/3rdparty/lzma/CPP/7zip/UI/Common/ |
| H A D | OpenArchive.h | 311 bool IsTree; variable
325 IsTree(false), in CArc()
|
| /dports/math/gambit/gambit-16.0.1/library/include/gambit/ |
| H A D | gametable.h | 58 virtual bool IsTree(void) const { return false; } in IsTree() function
|
| /dports/games/libretro-play/Play--3cd0a367b5e24c061a6310c68c9fa7f6b531ebd4/deps/Dependencies/lzmasdk-18.05/CPP/7zip/UI/Common/ |
| H A D | OpenArchive.h | 311 bool IsTree; variable
325 IsTree(false), in CArc()
|
| /dports/www/firefox-esr/firefox-91.8.0/other-licenses/7zstub/src/CPP/7zip/UI/Common/ |
| H A D | OpenArchive.h | 311 bool IsTree; variable
325 IsTree(false), in CArc()
|
| /dports/archivers/lzma/lzma-19.00/CPP/7zip/UI/Common/ |
| H A D | OpenArchive.h | 311 bool IsTree; variable
325 IsTree(false), in CArc()
|