Namespaces

The MbUnit.Core namespace and child namespaces contains the kernel of MbUnit.

The MbUnit.Core.Collections namespace contains stronly typed collections.

The Exceptions namespace contains custom exception classes relative to the MbUnit framework.

The MbUnit.Framework namespace contains base class for custom attributes , for test fixtures. The custom attributes can be used to build new test fixture.

The MbUnit.Core.Invokers namespace contains invokers classes that are functor-like wrapper for fixture methods.

The MbUnit.Core.Monitoring namespace contains time and memory performance tracers.

The MbUnit.Core.Runs namespace contains run object that are generators for invoker methods.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

The MbUnit.Framework contains the set of built-in attributes.

Use the static methods of Assert to test your assertions. You can also do security related assertion using SecurityAssert, data related assertions using DataAssert and XML related assertions using XmlAssert (which comes from XmlUnit, http://xmlunit.sourceforge.net) , Reflection based assertion ReflectionAssert and String and text based assertion StringAssert.

 

 

 

 

 

 

The MbUnit.Framework.Xml contains Xml-specific assertion. The classes of this namespace are extracted from the XmlUnit project.

CopyC#

/*
******************************************************************
Copyright (c) 2001, Jeff Martin, Tim Bacon
All rights reserved.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:

    * Redistributions of source code must retain the above copyright
      notice, this list of conditions and the following disclaimer.
    * Redistributions in binary form must reproduce the above
      copyright notice, this list of conditions and the following
      disclaimer in the documentation and/or other materials provided
      with the distribution.
    * Neither the name of the xmlunit.sourceforge.net nor the names
      of its contributors may be used to endorse or promote products
      derived from this software without specific prior written
      permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.

*******************************************************************/

The QuickGraph namespace contains default vertex and edge implementations.

QuickGraph Library License

            Copyright (c) 2004 Jonathan de Halleux
            
            This software is provided 'as-is', without any express or implied warranty. 
            
            In no event will the authors be held liable for any damages arising from 
            the use of this software.
            Permission is granted to anyone to use this software for any purpose, 
            including commercial applications, and to alter it and redistribute it 
            freely, subject to the following restrictions:
            
            1. The origin of this software must not be misrepresented; 
            you must not claim that you wrote the original software. 
            If you use this software in a product, an acknowledgment in the product 
            documentation would be appreciated but is not required.
            
            2. Altered source versions must be plainly marked as such, and must 
            not be misrepresented as being the original software.
            
            3. This notice may not be removed or altered from any source 
            distribution.
            	
            QuickGraph Library HomePage: http://www.mbunit.com
            Author: Jonathan de Halleux
            

The QuickGraph.Algorithms namespace is the base namespace for graph algorithms.

Collection of classes that compute the All-Shortest path problem.

 

 

The QuickGraph.Algorithms.Clone contains algorithms that create copy of graph.

 

The QuickGraph.Algorithms.MaximumFlow contains algorithms to compute network maximum flows. Under construction

The QuickGraph.Algorithms.Metrics contains metrics to caracterize traversals, trees and graphs.

 

The QuickGraph.Algorithms.RandomWalks contains algorithm to generate random walks or trees over graphs.

 

The QuickGraph.Algorithms.Search namespace contains basic algorithms, such as the DepthFirstSearchAlgorithm that are the building blocks other more complex algorithms.

The QuickGraph.Algorithms.ShortestPath namespace contains algorithms for solving shortest path problems.

Graph with positive edge weight should use the DijkstraShortestPathAlgorithm.

If all the wieghts are equal to 1, the BreadthFirstSearchAlgorithm is more efficient to use.

If the weights can be negavite, use the BellmanFordShortestPathAlgorithm.

The implements the algorithm from the article:

Optimal Strategies for Testing Nondeterministic Systems, Lev Nachmanson Margus Veanes Wolfram Schulte Nikolai Tillmann Wolfgang Grieskamp Microsoft Research, One Microsoft Way, Redmond, WA flevnach,margus,schulte,nikolait,wrwgg@microsoft.com http://research.microsoft.com/users/schulte/Papers/OptimalStrategiesForTestingNondeterminsticSystems(ISSTA2004).pdf

The QuickGraph.Algorithms.Travelling namespace contains classes for solving travelling problems such as computing Eulerian trails, Chinese Postman (not yet), Travelling salesman (not yet).

The QuickGraph.Algorithms.Visitors namespace contains classic graph algorithm visitors.

The QuickGraph.Collections namespace contains a bunch of strongly typed collections and dictionaries.

The QuickGraph.Collections.Filtered namespace contains filtered graph proxies that enables to have filtered views of graph.

Each traversal concept/interface is mapped with a corresponding filtered class.

 

The QuickGraph.Concepts namespace contains all the interfaces that define the different graph concepts.

The QuickGraph.Concepts.Algorithms namespace contains the interfaces that define algorithm concept and behaviors.

The QuickGraph.Concepts.Collections defines strongly typed interface for iterating vertices and edges.

The QuickGraph.Concepts.Modifications namespace contains the interfaces that implement the graph modification concepts.

 

 

 

 

The QuickGraph.Concepts.Providers namespace contains the interfaces that define the vertex and edge provider classes.

 

The QuickGraph.Concepts.Traversals namespace contains the interfaces that implement the graph traversal concepts.

The QuickGraph.Concepts.Visitors namespace contains interfaces that define "classic" visitors.

The QuickGraph.Exceptions namespace contains graph related exceptions.

The QuickGraph.Predicates namespace contains predicate implementations for filtered graphs.

The QuickGraph.Providers contains providers for the default vertex and edge implementations.

The QuickGraph.Representations namespace contains implementations of the graph concepts (traversal concepts and modification concepts).

 

 

 

The QuickGraph.Serialization.GraphML contains the classes that map the GraphML schema.

 

 

 

 

 

 

 

The TestFu.Data namespace contains a Random DataRow generator to help developer test databases, data layers, business layers, etc...

 

 

 

 

 

 

 

The TestFu.Gestures namespace contains classes (IGesture instances) to simulate user mouse and keyboard interactions.

The user interaction are simulated by using native methods mouse_event and keybd_event.

The GestureFactory can be used to rapidly generate IGesture instances.

The gestures should not be executed in the main thread but in a worker thread. Otherwize, you will miss message notifications. All gesture methods on Control and Form are thread safe.

The TestFu.Grammars namespace contains a framwork for implementing Production Grammars.