*/
/*
- * GiNaC Copyright (C) 1999-2021 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2024 Johannes Gutenberg University Mainz, Germany
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
return typeid(*vert).before(typeid(*n.vert));
// Are the indices of the top-level nodes different?
if (!(*vert==*n.vert))
- return (vert<n.vert);
+ return (*vert<*n.vert);
// Are the sets of children different, one by one?
return (children<n.children);
}