Display the source code in rt/minfo.d from which this page was generated on github.

If you spot a problem with this page, click here to create a Bugzilla issue.

Quickly fork, edit online, and submit a pull request for this page. Requires a signed-in GitHub account. This works well for small changes. If you'd like to make larger changes you may want to consider using local clone.

Function `rt.minfo.ModuleGroup.sortCtorsOld`

This is the old ctor sorting algorithm that does not find all cycles.


						
				bool sortCtorsOld
				(
				

				  int[][] edges
				

				);

It is here to allow the deprecated behavior from the original algorithm until people have fixed their code.

If no cycles are found, the ctors and tlsctors are replaced with the ones generated by this algorithm to preserve the old incorrect ordering behavior.

Parameters

Name	Description
edges	The module edges as found in the `importedModules` member of each ModuleInfo. Generated in sortCtors.

Returns

true if no cycle is found, false if one was.

Authors

Walter Bright, Sean Kelly

License

Distributed under the Boost Software License 1.0. (See accompanying file LICENSE)