Home
last modified time | relevance | path

Searched refs:GraphError (Results 1 – 25 of 188) sorted by relevance

12345678

/dports/devel/mercurial/mercurial-6.0/rust/hg-core/src/
H A Ddagops.rs23 ) -> Result<(), GraphError> { in remove_parents() argument
46 ) -> Result<HashSet<Revision>, GraphError> { in heads() argument
71 ) -> Result<(), GraphError> { in retain_heads() argument
90 ) -> Result<Vec<Revision>, GraphError> { in roots() argument
137 ) -> Result<BTreeSet<Revision>, GraphError> { in range() argument
180 ) -> Result<Vec<Revision>, GraphError> { in retain_heads_sorted() argument
206 ) -> Result<Vec<Revision>, GraphError> { in heads_sorted() argument
214 fn test_heads() -> Result<(), GraphError> { in test_heads()
231 ) -> Result<Vec<Revision>, GraphError> { in roots_sorted() argument
239 fn test_roots() -> Result<(), GraphError> { in test_roots()
[all …]
H A Ddiscovery.rs13 use super::{Graph, GraphError, Revision, NULL_REVISION};
58 parentsfn: impl Fn(Revision) -> Result<I, GraphError>, in update_sample() argument
60 ) -> Result<(), GraphError> in update_sample()
107 ) -> Result<ParentsIterator, GraphError> { in graph_parents() argument
219 ) -> Result<(), GraphError> { in add_common_revisions() argument
244 ) -> Result<(), GraphError> { in add_missing_revisions() argument
353 ) -> Result<Vec<Revision>, GraphError> { in take_quick_sample() argument
465 ) -> Result<Vec<Revision>, GraphError> { in take_full_sample() argument
529 ) -> Result<Vec<Revision>, GraphError> { in sorted_common_heads() argument
560 fn test_discovery() -> Result<(), GraphError> { in test_discovery()
[all …]
H A Dtesting.rs8 use crate::{Graph, GraphError, Revision, NULL_REVISION};
43 fn parents(&self, rev: Revision) -> Result<[Revision; 2], GraphError> { in parents() argument
59 r => Err(GraphError::ParentOutOfRange(r)),
69 fn parents(&self, rev: Revision) -> Result<[Revision; 2], GraphError> { in parents() argument
H A Dancestors.rs10 use super::{Graph, GraphError, Revision, NULL_REVISION};
54 ) -> Result<Self, GraphError> { in new() argument
144 type Item = Result<Revision, GraphError>;
174 ) -> Result<Self, GraphError> { in new() argument
237 pub fn bases_heads(&self) -> Result<HashSet<Revision>, GraphError> { in bases_heads() argument
244 ) -> Result<HashSet<Revision>, GraphError> { in into_bases_heads() argument
275 ) -> Result<(), GraphError> { in remove_ancestors_from() argument
334 ) -> Result<Vec<Revision>, GraphError> { in missing_ancestors() argument
530 r => Err(GraphError::ParentOutOfRange(r)),
540 Err(e) => assert_eq!(e, GraphError::ParentOutOfRange(25)), in test_initrev_out_of_range()
[all …]
/dports/devel/pijul/pijul-1.0.0.a55/cargo-crates/libpijul-1.0.0-alpha.49/src/pristine/
H A Dmod.rs384 TxnErr<Self::GraphError>, in cursor_changeset() argument
403 TxnErr<Self::GraphError>, in cursor_revchangeset_ref() argument
417 TxnErr<Self::GraphError>, in rev_cursor_revchangeset() argument
450 TxnErr<Self::GraphError>, in cursor_tags() argument
475 TxnErr<Self::GraphError>, in rev_iter_tags() argument
672 TxnErr<Self::GraphError>, in iter_remote() argument
687 TxnErr<Self::GraphError>, in iter_rev_remote() argument
878 TxnErr<T::GraphError>, in changeid_log() argument
903 TxnErr<T::GraphError>, in changeid_rev_log() argument
1419 GraphError
[all …]
H A Dsanakirja.rs366 type GraphError = SanakirjaError; typedef
901 TxnErr<Self::GraphError>, in cursor_tags() argument
943 TxnErr<Self::GraphError>, in iter_tags() argument
954 TxnErr<Self::GraphError>, in rev_iter_tags() argument
1350 TxnErr<Self::GraphError>, in iter_remote() argument
1367 TxnErr<Self::GraphError>, in iter_rev_remote() argument
1503 ) -> Result<(), TxnErr<Self::GraphError>> { in split_block() argument
1673 ) -> Result<(), TxnErr<Self::GraphError>> { in put_tags() argument
1682 ) -> Result<(), TxnErr<Self::GraphError>> { in del_tags() argument
1732 ) -> Result<bool, Self::GraphError> { in put_remote() argument
[all …]
/dports/net/samba412/samba-4.12.15/python/samba/kcc/
H A Dgraph_utils.py43 class GraphError(Exception): class
58 raise GraphError("graph is not fully connected")
66 raise GraphError("all vertices are disconnected because "
91 raise GraphError(s)
102 except GraphError as e:
130 raise GraphError("there is a loop in the graph\n"
165 raise GraphError("there is a loop in the graph")
174 raise GraphError("some vertices are not connected:\n%s" %
255 raise GraphError("wanted double directed ring, but "
302 except GraphError as e:
[all …]
/dports/devel/mercurial/mercurial-6.0/rust/hg-cpython/src/
H A Dexceptions.rs21 py_exception!(rustext, GraphError, ValueError);
23 impl GraphError { impl
24 pub fn pynew(py: Python, inner: hg::GraphError) -> PyErr { in pynew()
26 hg::GraphError::ParentOutOfRange(r) => { in pynew()
27 GraphError::new(py, ("ParentOutOfRange", r)) in pynew()
29 hg::GraphError::WorkingDirectoryUnsupported => { in pynew()
H A Ddiscovery.rs16 cindex::Index, conversion::rev_pyiter_collect, exceptions::GraphError,
59 .map_err(|e| GraphError::pynew(py, e))?;
67 .map_err(|e| GraphError::pynew(py, e))?;
86 .map_err(|e| GraphError::pynew(py, e))?;
88 .map_err(|e| GraphError::pynew(py, e))?;
112 .map_err(|e| GraphError::pynew(py, e))
119 .map_err(|e| GraphError::pynew(py, e))?;
132 .map_err(|e| GraphError::pynew(py, e))?;
H A Dancestors.rs39 cindex::Index, conversion::rev_pyiter_collect, exceptions::GraphError,
58 Some(Err(e)) => Err(GraphError::pynew(py, e)),
66 .map_err(|e| GraphError::pynew(py, e))
82 .map_err(|e| GraphError::pynew(py, e))?;
101 .map_err(|e| GraphError::pynew(py, e))
119 .map_err(|e| GraphError::pynew(py, e))?;
160 inner.bases_heads().map_err(|e| GraphError::pynew(py, e))
175 .map_err(|e| GraphError::pynew(py, e))?;
193 return Err(GraphError::pynew(py, e));
H A Dcindex.rs18 use hg::{Graph, GraphError, Revision, WORKING_DIRECTORY_REVISION};
139 fn parents(&self, rev: Revision) -> Result<[Revision; 2], GraphError> { in parents() argument
141 return Err(GraphError::WorkingDirectoryUnsupported);
153 _ => Err(GraphError::ParentOutOfRange(rev)),
/dports/devel/pijul/pijul-1.0.0.a55/cargo-crates/libpijul-1.0.0-alpha.49/src/
H A Dlib.rs91 ) -> Result<(), T::GraphError> { in commit() argument
240 ) -> Result<Inode, fs::FsError<Self::GraphError>> { in add() argument
249 ) -> Result<(), fs::FsError<Self::GraphError>> { in move_file() argument
357 ) -> Result<Option<u64>, Self::GraphError> { in has_change() argument
371 ) -> Result<bool, Self::GraphError> { in is_alive() argument
383 ) -> Result<Log<'txn, Self>, Self::GraphError> { in log() argument
433 Self::GraphError, in changeid_reverse_log() argument
463 ) -> Result<Option<u64>, Self::GraphError> { in get_revchanges() argument
518 fs::FsErrorC<C::Error, Self::GraphError>, in follow_oldest_path() argument
575 T::GraphError,
[all …]
H A Dapply.rs128 ) -> Result<(), ApplyError<P::Error, T::GraphError>> { in apply_change_rec_ws() argument
212 ) -> Result<(), ApplyError<P::Error, T::GraphError>> { in apply_change_rec() argument
230 ) -> Result<(u64, Merkle), LocalApplyError<T::GraphError>> { in apply_change_to_channel() argument
456 ) -> Result<(), LocalApplyError<T::GraphError>> { in clean_obsolete_pseudo_edges() argument
524 ) -> Result<(), LocalApplyError<T::GraphError>> { in repair_missing_contexts() argument
558 ) -> Result<(), LocalApplyError<T::GraphError>> { in repair_new_vertex_context_up() argument
585 ) -> Result<(), LocalApplyError<T::GraphError>> { in repair_new_vertex_context_down() argument
625 ) -> Result<(), LocalApplyError<T::GraphError>> { in repair_edge_context() argument
653 ) -> Result<(), LocalApplyError<T::GraphError>> { in repair_cyclic_paths() argument
684 ) -> Result<(), LocalApplyError<T::GraphError>> { in repair_edge() argument
[all …]
H A Dmissing_context.rs32 InconsistentChange<T::GraphError>, in load_graph() argument
73 ) -> Result<(), MissingError<T::GraphError>> { in repair_missing_up_context() argument
101 ) -> Result<(), TxnErr<T::GraphError>> { in repair_regular_up() argument
128 ) -> Result<(), MissingError<T::GraphError>> { in repair_missing_down_context() argument
161 ) -> Result<(), MissingError<T::GraphError>> { in repair_context_nondeleted() argument
184 ) -> Result<(), MissingError<T::GraphError>> { in reconnect_target_up() argument
213 ) -> Result<(), MissingError<T::GraphError>> in repair_context_deleted()
247 ) -> Result<(), MissingError<T::GraphError>> { in detect_folder_conflict_resolutions() argument
270 ) -> Result<(), MissingError<T::GraphError>> { in detect_folder_conflict_resolution() argument
422 ) -> Result<(), TxnErr<T::GraphError>> in collect_unknown_children()
[all …]
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/core/
H A Dexceptions.h269 class GraphError; variable
467 GUM_MAKE_ERROR(GraphError, Exception, "Graph error")
468 GUM_MAKE_ERROR(NoNeighbour, GraphError, "No neighbour found")
469 GUM_MAKE_ERROR(NoParent, GraphError, "No parent found")
470 GUM_MAKE_ERROR(NoChild, GraphError, "No child found")
471 GUM_MAKE_ERROR(InvalidEdge, GraphError, "Invalid edge")
472 GUM_MAKE_ERROR(InvalidArc, GraphError, "Invalid arc")
473 GUM_MAKE_ERROR(InvalidNode, GraphError, "Invalid node")
474 GUM_MAKE_ERROR(DefaultInLabel, GraphError, "Error on label")
475 GUM_MAKE_ERROR(InvalidDirectedCycle, GraphError, "Directed cycle detected")
/dports/math/py-altgraph/altgraph-0.15/altgraph/
H A DGraph.py16 from altgraph import GraphError
58 raise GraphError("Cannot create edge from %s" % (item,))
114 raise GraphError('Invalid nodes %s -> %s' % (head_id, tail_id))
133 raise GraphError('Invalid edge %s' % edge)
147 raise GraphError('Invalid node %s' % node)
160 raise GraphError('Invalid node %s' % node)
173 raise GraphError('Invalid edge %s' % edge)
182 except GraphError:
206 raise GraphError('Invalid edge %s' % edge)
342 raise GraphError('Invalid node %s' % node)
[all …]
H A DDot.py114 from altgraph import GraphError
221 raise GraphError("invalid node %s" % (tail,))
228 raise GraphError("invalid edge %s -> %s " % (head, tail))
238 raise GraphError("unsupported graphtype %s" % (self.type,))
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/catapult/telemetry/third_party/altgraph/altgraph/
H A DGraph.py16 from altgraph import GraphError
57 raise GraphError("Cannot create edge from %s"%(item,))
113 raise GraphError('Invalid nodes %s -> %s' % (head_id, tail_id))
132 raise GraphError('Invalid edge %s' % edge)
146 raise GraphError('Invalid node %s' % node)
159 raise GraphError('Invalid node %s' % node)
172 raise GraphError('Invalid edge %s' % edge)
181 except GraphError:
205 raise GraphError('Invalid edge %s' % edge)
344 raise GraphError('Invalid node %s' % node)
[all …]
H A DDot.py108 from altgraph import GraphError
211 raise GraphError("invalid node %s" % (tail,))
218 raise GraphError("invalid edge %s -> %s " % (head, tail) )
228 raise GraphError("unsupported graphtype %s" % (self.type,))
/dports/www/firefox-legacy/firefox-52.8.0esr/python/altgraph/altgraph/
H A DGraph.py16 from altgraph import GraphError
57 raise GraphError("Cannot create edge from %s"%(item,))
113 raise GraphError('Invalid nodes %s -> %s' % (head_id, tail_id))
132 raise GraphError('Invalid edge %s' % edge)
146 raise GraphError('Invalid node %s' % node)
159 raise GraphError('Invalid node %s' % node)
172 raise GraphError('Invalid edge %s' % edge)
181 except GraphError:
205 raise GraphError('Invalid edge %s' % edge)
344 raise GraphError('Invalid node %s' % node)
[all …]
H A DDot.py108 from altgraph import GraphError
211 raise GraphError("invalid node %s" % (tail,))
218 raise GraphError("invalid edge %s -> %s " % (head, tail) )
228 raise GraphError("unsupported graphtype %s" % (self.type,))
/dports/devel/pijul/pijul-1.0.0.a55/cargo-crates/libpijul-1.0.0-alpha.49/src/unrecord/
H A Dworking_copy.rs7 T: GraphMutTxnT + TreeMutTxnT<TreeError = <T as GraphTxnT>::GraphError>, in undo_file_addition()
12 ) -> Result<(), TxnErr<T::GraphError>> { in undo_file_addition() argument
26 T: ChannelTxnT + TreeMutTxnT + TreeTxnT<TreeError = <T as GraphTxnT>::GraphError>, in undo_file_deletion()
49 T: ChannelTxnT + TreeMutTxnT + TreeTxnT<TreeError = <T as GraphTxnT>::GraphError>, in restore()
100 T: TreeMutTxnT + GraphTxnT + TreeTxnT<TreeError = <T as GraphTxnT>::GraphError>, in restore_inode()
150 ) -> Result<Vertex<ChangeId>, BlockError<T::GraphError>> { in find_youngest_parent() argument
186 T: GraphTxnT + TreeMutTxnT + TreeTxnT<TreeError = <T as GraphTxnT>::GraphError>, in undo_file_reinsertion()
H A Dmod.rs53 ) -> Result<bool, UnrecordError<P::Error, T::GraphError>> { in unrecord() argument
91 ) -> Result<(), UnrecordError<P::Error, T::GraphError>> { in del_channel_changes() argument
120 ) -> Result<bool, TxnErr<T::GraphError>> { in unused_in_other_channels() argument
145 ) -> Result<(), UnrecordError<C::Error, T::GraphError>> { in unapply() argument
243 ) -> Result<(), UnrecordError<C::Error, T::GraphError>> { in unapply_newvertex() argument
312 ) -> Result<(), UnrecordError<C::Error, T::GraphError>> { in repair_newvertex_contexts() argument
370 ) -> Result<(), UnrecordError<P::Error, T::GraphError>> { in unapply_edges() argument
439 ) -> Result<bool, UnrecordError<C::Error, T::GraphError>> { in must_reintroduce() argument
502 ) -> Result<(), UnrecordError<C::Error, T::GraphError>> { in remove_zombies() argument
528 ) -> Result<(), BlockError<T::GraphError>> { in collect_zombies() argument
[all …]
/dports/devel/pijul/pijul-1.0.0.a55/cargo-crates/libpijul-1.0.0-alpha.49/src/apply/
H A Dedge.rs15 ) -> Result<(), LocalApplyError<T::GraphError>> in put_newedge()
105 ) -> Result<(), LocalApplyError<T::GraphError>> in collect_nondeleted_zombies()
139 ) -> Result<(), LocalApplyError<T::GraphError>> { in check_valid() argument
164 ) -> Result<Vertex<ChangeId>, LocalApplyError<T::GraphError>> { in find_source_vertex() argument
185 ) -> Result<Vertex<ChangeId>, LocalApplyError<T::GraphError>> { in find_target_vertex() argument
205 ) -> Result<(), LocalApplyError<T::GraphError>> { in collect_pseudo_edges() argument
244 ) -> Result<(), LocalApplyError<T::GraphError>> { in reconnect_pseudo_edges() argument
287 ) -> Result<(), MissingError<T::GraphError>> in collect_zombie_context()
341 ) -> Result<(), MissingError<T::GraphError>> { in zombify() argument
/dports/devel/py-azure-graphrbac/azure-graphrbac-0.61.1/azure/graphrbac/models/
H A Dgraph_error.py16 class GraphError(Model): class
31 super(GraphError, self).__init__(**kwargs)

12345678