follow the instructions to do the code
the modification only in faculty.h and faculty.cpp. don’t do any changes in the rest of the other files.
1- The declaration of the Faculty class has been changed, in the private area, to use a std::list instead of an array as its implementing data structure.
Your task is to follow through on that change, making the necessary alterations to faculty.h and faculty.cpp to make this a working class. The necessary changes have already been made to the unit tests, the Department class, and to the main printSchedule.cpp application.
2- The major difference between lists and the earlier sequential structures that we have looked at is that elements are accessed via iterators instead of integer-based indices. Accordingly, you will need to
a. rewrite the indexing-based code in faculty.cpp with iterator-based code.
b. Remove the indexing-based getSection function from faculty.h and add appropriate declarations of iterator and const_iterator types and associated functions allowing access to a Faculty object’s sections.
3- To improve the usability of the Faculty class, you will also need to add
a. A constructor to allow Faculty objects to be constructed from a course name and a pair of iterators denoting a range of Section values in some arbitrary container.
b. A constructor to allow Faculty objects to be constructed from a course name and an initializer_list of sections.
4- Your code will be evaluated both on its ability to function correctly within the printSchedule application and on its ability to pass the various unit tests provided.
· In the test report, tests 0…7 test the printSchedule application. Tests numbered 8…25 check the unit tests.
a. Each even-numbered test checks for correct behavior of the code.
b. Each odd-numbered test checks to see if that same behavior is correct and entails no memory leaks or other common pointer/memory handling problems.
Doxyfile
# Doxyfile 1.8.3.1
# This file describes the settings to be used by the documentation system
# doxygen (www.doxygen.org) for a project.
#
# All text after a hash (#) is considered a comment and will be ignored.
# The format is:
# TAG = value [value, …]
# For lists items can also be appended using:
# TAG += value [value, …]
# Values that contain spaces should be placed between quotes (” “).
#—————————————————————————
# Project related configuration options
#—————————————————————————
# This tag specifies the encoding used for all characters in the config file
# that follow. The default is UTF-8 which is also the encoding used for all
# text before the first occurrence of this tag. Doxygen uses libiconv (or the
# iconv built into libc) for the transcoding. See
# http://www.gnu.org/software/libiconv for the list of possible encodings.
DOXYFILE_ENCODING = UTF-8
# The PROJECT_NAME tag is a single word (or sequence of words) that should
# identify the project. Note that if you do not use Doxywizard you need
# to put quotes around the project name if it contains spaces.
PROJECT_NAME = catalogs
# The PROJECT_NUMBER tag can be used to enter a project or revision number.
# This could be handy for archiving the generated documentation or
# if some version control system is used.
PROJECT_NUMBER = structs, modular
# Using the PROJECT_BRIEF tag one can provide an optional one line description
# for a project that appears at the top of each page and should give viewer
# a quick idea about the purpose of the project. Keep the description short.
PROJECT_BRIEF =
# With the PROJECT_LOGO tag one can specify an logo or icon that is
# included in the documentation. The maximum height of the logo should not
# exceed 55 pixels and the maximum width should not exceed 200 pixels.
# Doxygen will copy the logo to the output directory.
PROJECT_LOGO =
# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute)
# base path where the generated documentation will be put.
# If a relative path is entered, it will be relative to the location
# where doxygen was started. If left blank the current directory will be used.
OUTPUT_DIRECTORY = docs
# If the CREATE_SUBDIRS tag is set to YES, then doxygen will create
# 4096 sub-directories (in 2 levels) under the output directory of each output
# format and will distribute the generated files over these directories.
# Enabling this option can be useful when feeding doxygen a huge amount of
# source files, where putting all generated files in the same directory would
# otherwise cause performance problems for the file system.
CREATE_SUBDIRS = NO
# The OUTPUT_LANGUAGE tag is used to specify the language in which all
# documentation generated by doxygen is written. Doxygen will use this
# information to generate all constant output in the proper language.
# The default language is English, other supported languages are:
# Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional,
# Croatian, Czech, Danish, Dutch, Esperanto, Farsi, Finnish, French, German,
# Greek, Hungarian, Italian, Japanese, Japanese-en (Japanese with English
# messages), Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian,
# Polish, Portuguese, Romanian, Russian, Serbian, Serbian-Cyrillic, Slovak,
# Slovene, Spanish, Swedish, Ukrainian, and Vietnamese.
OUTPUT_LANGUAGE = English
# If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will
# include brief member descriptions after the members that are listed in
# the file and class documentation (similar to JavaDoc).
# Set to NO to disable this.
BRIEF_MEMBER_DESC = YES
# If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend
# the brief description of a member or function before the detailed description.
# Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
# brief descriptions will be completely suppressed.
REPEAT_BRIEF = YES
# This tag implements a quasi-intelligent brief description abbreviator
# that is used to form the text in various listings. Each string
# in this list, if found as the leading text of the brief description, will be
# stripped from the text and the result after processing the whole list, is
# used as the annotated text. Otherwise, the brief description is used as-is.
# If left blank, the following values are used (“$name” is automatically
# replaced with the name of the entity): “The $name class” “The $name widget”
# “The $name file” “is” “provides” “specifies” “contains”
# “represents” “a” “an” “the”
ABBREVIATE_BRIEF =
# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
# Doxygen will generate a detailed section even if there is only a brief
# description.
ALWAYS_DETAILED_SEC = NO
# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
# inherited members of a class in the documentation of that class as if those
# members were ordinary class members. Constructors, destructors and assignment
# operators of the base classes will not be shown.
INLINE_INHERITED_MEMB = NO
# If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full
# path before files name in the file list and in the header files. If set
# to NO the shortest path that makes the file name unique will be used.
FULL_PATH_NAMES = YES
# If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag
# can be used to strip a user-defined part of the path. Stripping is
# only done if one of the specified strings matches the left-hand part of
# the path. The tag can be used to show relative paths in the file list.
# If left blank the directory from which doxygen is run is used as the
# path to strip. Note that you specify absolute paths here, but also
# relative paths, which will be relative from the directory where doxygen is
# started.
STRIP_FROM_PATH =
# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of
# the path mentioned in the documentation of a class, which tells
# the reader which header file to include in order to use a class.
# If left blank only the name of the header file containing the class
# definition is used. Otherwise one should specify the include paths that
# are normally passed to the compiler using the -I flag.
STRIP_FROM_INC_PATH =
# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter
# (but less readable) file names. This can be useful if your file system
# doesn’t support long names like on DOS, Mac, or CD-ROM.
SHORT_NAMES = NO
# If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen
# will interpret the first line (until the first dot) of a JavaDoc-style
# comment as the brief description. If set to NO, the JavaDoc
# comments will behave just like regular Qt-style comments
# (thus requiring an explicit @brief command for a brief description.)
JAVADOC_AUTOBRIEF = YES
# If the QT_AUTOBRIEF tag is set to YES then Doxygen will
# interpret the first line (until the first dot) of a Qt-style
# comment as the brief description. If set to NO, the comments
# will behave just like regular Qt-style comments (thus requiring
# an explicit \brief command for a brief description.)
QT_AUTOBRIEF = NO
# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen
# treat a multi-line C++ special comment block (i.e. a block of //! or ///
# comments) as a brief description. This used to be the default behaviour.
# The new default is to treat a multi-line C++ comment block as a detailed
# description. Set this tag to YES if you prefer the old behaviour instead.
MULTILINE_CPP_IS_BRIEF = NO
# If the INHERIT_DOCS tag is set to YES (the default) then an undocumented
# member inherits the documentation from any documented member that it
# re-implements.
INHERIT_DOCS = YES
# If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce
# a new page for each member. If set to NO, the documentation of a member will
# be part of the file/class/namespace that contains it.
SEPARATE_MEMBER_PAGES = NO
# The TAB_SIZE tag can be used to set the number of spaces in a tab.
# Doxygen uses this value to replace tabs by spaces in code fragments.
TAB_SIZE = 4
# This tag can be used to specify a number of aliases that acts
# as commands in the documentation. An alias has the form “name=value”.
# For example adding “sideeffect=\par Side Effects:\n” will allow you to
# put the command \sideeffect (or @sideeffect) in the documentation, which
# will result in a user-defined paragraph with heading “Side Effects:”.
# You can put \n’s in the value part of an alias to insert newlines.
ALIASES =
# This tag can be used to specify a number of word-keyword mappings (TCL only).
# A mapping has the form “name=value”. For example adding
# “class=itcl::class” will allow you to use the command class in the
# itcl::class meaning.
TCL_SUBST =
# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C
# sources only. Doxygen will then generate output that is more tailored for C.
# For instance, some of the names that are used will be different. The list
# of all members will be omitted, etc.
OPTIMIZE_OUTPUT_FOR_C = NO
# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java
# sources only. Doxygen will then generate output that is more tailored for
# Java. For instance, namespaces will be presented as packages, qualified
# scopes will look different, etc.
OPTIMIZE_OUTPUT_JAVA = NO
# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
# sources only. Doxygen will then generate output that is more tailored for
# Fortran.
OPTIMIZE_FOR_FORTRAN = NO
# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
# sources. Doxygen will then generate output that is tailored for
# VHDL.
OPTIMIZE_OUTPUT_VHDL = NO
# Doxygen selects the parser to use depending on the extension of the files it
# parses. With this tag you can assign which parser to use for a given
# extension. Doxygen has a built-in mapping, but you can override or extend it
# using this tag. The format is ext=language, where ext is a file extension,
# and language is one of the parsers supported by doxygen: IDL, Java,
# Javascript, CSharp, C, C++, D, PHP, Objective-C, Python, Fortran, VHDL, C,
# C++. For instance to make doxygen treat .inc files as Fortran files (default
# is PHP), and .f files as C (default is Fortran), use: inc=Fortran f=C. Note
# that for custom extensions you also need to set FILE_PATTERNS otherwise the
# files are not read by doxygen.
EXTENSION_MAPPING =
# If MARKDOWN_SUPPORT is enabled (the default) then doxygen pre-processes all
# comments according to the Markdown format, which allows for more readable
# documentation. See http://daringfireball.net/projects/markdown/ for details.
# The output of markdown processing is further processed by doxygen, so you
# can mix doxygen, HTML, and XML commands with Markdown formatting.
# Disable only in case of backward compatibilities issues.
MARKDOWN_SUPPORT = YES
# When enabled doxygen tries to link words that correspond to documented classes,
# or namespaces to their corresponding documentation. Such a link can be
# prevented in individual cases by by putting a % sign in front of the word or
# globally by setting AUTOLINK_SUPPORT to NO.
AUTOLINK_SUPPORT = YES
# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
# to include (a tag file for) the STL sources as input, then you should
# set this tag to YES in order to let doxygen match functions declarations and
# definitions whose arguments contain STL classes (e.g. func(std::string); v.s.
# func(std::string) {}). This also makes the inheritance and collaboration
# diagrams that involve STL classes more complete and accurate.
BUILTIN_STL_SUPPORT = NO
# If you use Microsoft’s C++/CLI language, you should set this option to YES to
# enable parsing support.
CPP_CLI_SUPPORT = NO
# Set the SIP_SUPPORT tag to YES if your project consists of sip sources only.
# Doxygen will parse them like normal C++ but will assume all classes use public
# instead of private inheritance when no explicit protection keyword is present.
SIP_SUPPORT = NO
# For Microsoft’s IDL there are propget and propput attributes to indicate
# getter and setter methods for a property. Setting this option to YES (the
# default) will make doxygen replace the get and set methods by a property in
# the documentation. This will only work if the methods are indeed getting or
# setting a simple type. If this is not the case, or you want to show the
# methods anyway, you should set this option to NO.
IDL_PROPERTY_SUPPORT = YES
# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
# tag is set to YES, then doxygen will reuse the documentation of the first
# member in the group (if any) for the other members of the group. By default
# all members of a group must be documented explicitly.
DISTRIBUTE_GROUP_DOC = NO
# Set the SUBGROUPING tag to YES (the default) to allow class member groups of
# the same type (for instance a group of public functions) to be put as a
# subgroup of that type (e.g. under the Public Functions section). Set it to
# NO to prevent subgrouping. Alternatively, this can be done per class using
# the \nosubgrouping command.
SUBGROUPING = YES
# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and
# unions are shown inside the group in which they are included (e.g. using
# @ingroup) instead of on a separate page (for HTML and Man pages) or
# section (for LaTeX and RTF).
INLINE_GROUPED_CLASSES = NO
# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and
# unions with only public data fields will be shown inline in the documentation
# of the scope in which they are defined (i.e. file, namespace, or group
# documentation), provided this scope is documented. If set to NO (the default),
# structs, classes, and unions are shown on a separate page (for HTML and Man
# pages) or section (for LaTeX and RTF).
INLINE_SIMPLE_STRUCTS = NO
# When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum
# is documented as struct, union, or enum with the name of the typedef. So
# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
# with name TypeT. When disabled the typedef will appear as a member of a file,
# namespace, or class. And the struct will be named TypeS. This can typically
# be useful for C code in case the coding convention dictates that all compound
# types are typedef’ed and only the typedef is referenced, never the tag name.
TYPEDEF_HIDES_STRUCT = NO
# Similar to the SYMBOL_CACHE_SIZE the size of the symbol lookup cache can be
# set using LOOKUP_CACHE_SIZE. This cache is used to resolve symbols given
# their name and scope. Since this can be an expensive process and often the
# same symbol appear multiple times in the code, doxygen keeps a cache of
# pre-resolved symbols. If the cache is too small doxygen will become slower.
# If the cache is too large, memory is wasted. The cache size is given by this
# formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range is 0..9, the default is 0,
# corresponding to a cache size of 2^16 = 65536 symbols.
LOOKUP_CACHE_SIZE = 0
#—————————————————————————
# Build related configuration options
#—————————————————————————
# If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in
# documentation are documented, even if no documentation was available.
# Private class members and static file members will be hidden unless
# the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES
EXTRACT_ALL = YES
# If the EXTRACT_PRIVATE tag is set to YES all private members of a class
# will be included in the documentation.
EXTRACT_PRIVATE = YES
# If the EXTRACT_PACKAGE tag is set to YES all members with package or internal
# scope will be included in the documentation.
EXTRACT_PACKAGE = NO
# If the EXTRACT_STATIC tag is set to YES all static members of a file
# will be included in the documentation.
EXTRACT_STATIC = YES
# If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs)
# defined locally in source files will be included in the documentation.
# If set to NO only classes defined in header files are included.
EXTRACT_LOCAL_CLASSES = YES
# This flag is only useful for Objective-C code. When set to YES local
# methods, which are defined in the implementation section but not in
# the interface are included in the documentation.
# If set to NO (the default) only methods in the interface are included.
EXTRACT_LOCAL_METHODS = NO
# If this flag is set to YES, the members of anonymous namespaces will be
# extracted and appear in the documentation as a namespace called
# ‘anonymous_namespace{file}’, where file will be replaced with the base
# name of the file that contains the anonymous namespace. By default
# anonymous namespaces are hidden.
EXTRACT_ANON_NSPACES = NO
# If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all
# undocumented members of documented classes, files or namespaces.
# If set to NO (the default) these members will be included in the
# various overviews, but no documentation section is generated.
# This option has no effect if EXTRACT_ALL is enabled.
HIDE_UNDOC_MEMBERS = NO
# If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all
# undocumented classes that are normally visible in the class hierarchy.
# If set to NO (the default) these classes will be included in the various
# overviews. This option has no effect if EXTRACT_ALL is enabled.
HIDE_UNDOC_CLASSES = NO
# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all
# friend (class|struct|union) declarations.
# If set to NO (the default) these declarations will be included in the
# documentation.
HIDE_FRIEND_COMPOUNDS = NO
# If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any
# documentation blocks found inside the body of a function.
# If set to NO (the default) these blocks will be appended to the
# function’s detailed documentation block.
HIDE_IN_BODY_DOCS = NO
# The INTERNAL_DOCS tag determines if documentation
# that is typed after a \internal command is included. If the tag is set
# to NO (the default) then the documentation will be excluded.
# Set it to YES to include the internal documentation.
INTERNAL_DOCS = NO
# If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate
# file names in lower-case letters. If set to YES upper-case letters are also
# allowed. This is useful if you have classes or files whose names only differ
# in case and if your file system supports case sensitive file names. Windows
# and Mac users are advised to set this option to NO.
CASE_SENSE_NAMES = YES
# If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen
# will show members with their full class and namespace scopes in the
# documentation. If set to YES the scope will be hidden.
HIDE_SCOPE_NAMES = NO
# If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen
# will put a list of the files that are included by a file in the documentation
# of that file.
SHOW_INCLUDE_FILES = YES
# If the FORCE_LOCAL_INCLUDES tag is set to YES then Doxygen
# will list include files with double quotes in the documentation
# rather than with sharp brackets.
FORCE_LOCAL_INCLUDES = NO
# If the INLINE_INFO tag is set to YES (the default) then a tag [inline]
# is inserted in the documentation for inline members.
INLINE_INFO = YES
# If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen
# will sort the (detailed) documentation of file and class members
# alphabetically by member name. If set to NO the members will appear in
# declaration order.
SORT_MEMBER_DOCS = YES
# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the
# brief documentation of file, namespace and class members alphabetically
# by member name. If set to NO (the default) the members will appear in
# declaration order.
SORT_BRIEF_DOCS = NO
# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen
# will sort the (brief and detailed) documentation of class members so that
# constructors and destructors are listed first. If set to NO (the default)
# the constructors will appear in the respective orders defined by
# SORT_MEMBER_DOCS and SORT_BRIEF_DOCS.
# This tag will be ignored for brief docs if SORT_BRIEF_DOCS is set to NO
# and ignored for detailed docs if SORT_MEMBER_DOCS is set to NO.
SORT_MEMBERS_CTORS_1ST = NO
# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the
# hierarchy of group names into alphabetical order. If set to NO (the default)
# the group names will appear in their defined order.
SORT_GROUP_NAMES = NO
# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be
# sorted by fully-qualified names, including namespaces. If set to
# NO (the default), the class list will be sorted only by class name,
# not including the namespace part.
# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
# Note: This option applies only to the class list, not to the
# alphabetical list.
SORT_BY_SCOPE_NAME = NO
# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to
# do proper type resolution of all parameters of a function it will reject a
# match between the prototype and the implementation of a member function even
# if there is only one candidate or it is obvious which candidate to choose
# by doing a simple string match. By disabling STRICT_PROTO_MATCHING doxygen
# will still accept a match between prototype and implementation in such cases.
STRICT_PROTO_MATCHING = NO
# The GENERATE_TODOLIST tag can be used to enable (YES) or
# disable (NO) the todo list. This list is created by putting \todo
# commands in the documentation.
GENERATE_TODOLIST = YES
# The GENERATE_TESTLIST tag can be used to enable (YES) or
# disable (NO) the test list. This list is created by putting \test
# commands in the documentation.
GENERATE_TESTLIST = YES
# The GENERATE_BUGLIST tag can be used to enable (YES) or
# disable (NO) the bug list. This list is created by putting \bug
# commands in the documentation.
GENERATE_BUGLIST = YES
# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or
# disable (NO) the deprecated list. This list is created by putting
# \deprecated commands in the documentation.
GENERATE_DEPRECATEDLIST = YES
# The ENABLED_SECTIONS tag can be used to enable conditional
# documentation sections, marked by \if section-label … \endif
# and \cond section-label … \endcond blocks.
ENABLED_SECTIONS =
# The MAX_INITIALIZER_LINES tag determines the maximum number of lines
# the initial value of a variable or macro consists of for it to appear in
# the documentation. If the initializer consists of more lines than specified
# here it will be hidden. Use a value of 0 to hide initializers completely.
# The appearance of the initializer of individual variables and macros in the
# documentation can be controlled using \showinitializer or \hideinitializer
# command in the documentation regardless of this setting.
MAX_INITIALIZER_LINES = 30
# Set the SHOW_USED_FILES tag to NO to disable the list of files generated
# at the bottom of the documentation of classes and structs. If set to YES the
# list will mention the files that were used to generate the documentation.
SHOW_USED_FILES = YES
# Set the SHOW_FILES tag to NO to disable the generation of the Files page.
# This will remove the Files entry from the Quick Index and from the
# Folder Tree View (if specified). The default is YES.
SHOW_FILES = YES
# Set the SHOW_NAMESPACES tag to NO to disable the generation of the
# Namespaces page.
# This will remove the Namespaces entry from the Quick Index
# and from the Folder Tree View (if specified). The default is YES.
SHOW_NAMESPACES = YES
# The FILE_VERSION_FILTER tag can be used to specify a program or script that
# doxygen should invoke to get the current version for each file (typically from
# the version control system). Doxygen will invoke the program by executing (via
# popen()) the command
# the FILE_VERSION_FILTER tag, and
# provided by doxygen. Whatever the program writes to standard output
# is used as the file version. See the manual for examples.
FILE_VERSION_FILTER =
# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
# by doxygen. The layout file controls the global structure of the generated
# output files in an output format independent way. To create the layout file
# that represents doxygen’s defaults, run doxygen with the -l option.
# You can optionally specify a file name after the option, if omitted
# DoxygenLayout.xml will be used as the name of the layout file.
LAYOUT_FILE =
# The CITE_BIB_FILES tag can be used to specify one or more bib files
# containing the references data. This must be a list of .bib files. The
# .bib extension is automatically appended if omitted. Using this command
# requires the bibtex tool to be installed. See also
# http://en.wikipedia.org/wiki/BibTeX for more info. For LaTeX the style
# of the bibliography can be controlled using LATEX_BIB_STYLE. To use this
# feature you need bibtex and perl available in the search path. Do not use
# file names with spaces, bibtex cannot handle them.
CITE_BIB_FILES =
#—————————————————————————
# configuration options related to warning and progress messages
#—————————————————————————
# The QUIET tag can be used to turn on/off the messages that are generated
# by doxygen. Possible values are YES and NO. If left blank NO is used.
QUIET = NO
# The WARNINGS tag can be used to turn on/off the warning messages that are
# generated by doxygen. Possible values are YES and NO. If left blank
# NO is used.
WARNINGS = YES
# If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings
# for undocumented members. If EXTRACT_ALL is set to YES then this flag will
# automatically be disabled.
WARN_IF_UNDOCUMENTED = YES
# If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for
# potential errors in the documentation, such as not documenting some
# parameters in a documented function, or documenting parameters that
# don’t exist or using markup commands wrongly.
WARN_IF_DOC_ERROR = YES
# The WARN_NO_PARAMDOC option can be enabled to get warnings for
# functions that are documented, but have no documentation for their parameters
# or return value. If set to NO (the default) doxygen will only warn about
# wrong or incomplete parameter documentation, but not about the absence of
# documentation.
WARN_NO_PARAMDOC = NO
# The WARN_FORMAT tag determines the format of the warning messages that
# doxygen can produce. The string should contain the $file, $line, and $text
# tags, which will be replaced by the file and line number from which the
# warning originated and the warning text. Optionally the format may contain
# $version, which will be replaced by the version of the file (if it could
# be obtained via FILE_VERSION_FILTER)
WARN_FORMAT = “$file:$line: $text”
# The WARN_LOGFILE tag can be used to specify a file to which warning
# and error messages should be written. If left blank the output is written
# to stderr.
WARN_LOGFILE =
#—————————————————————————
# configuration options related to the input files
#—————————————————————————
# The INPUT tag can be used to specify the files and/or directories that contain
# documented source files. You may enter file names like “myfile.cpp” or
# directories like “/usr/src/myproject”. Separate the files or directories
# with spaces.
INPUT =
# This tag can be used to specify the character encoding of the source files
# that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is
# also the default input encoding. Doxygen uses libiconv (or the iconv built
# into libc) for the transcoding. See http://www.gnu.org/software/libiconv for
# the list of possible encodings.
INPUT_ENCODING = UTF-8
# If the value of the INPUT tag contains directories, you can use the
# FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp
# and *.h) to filter out the source-files in the directories. If left
# blank the following patterns are tested:
# *.c *.cc *.cxx *.cpp *.c++ *.d *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh
# *.hxx *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.dox *.py
# *.f90 *.f *.for *.vhd *.vhdl
FILE_PATTERNS =
# The RECURSIVE tag can be used to turn specify whether or not subdirectories
# should be searched for input files as well. Possible values are YES and NO.
# If left blank NO is used.
RECURSIVE = NO
# The EXCLUDE tag can be used to specify files and/or directories that should be
# excluded from the INPUT source files. This way you can easily exclude a
# subdirectory from a directory tree whose root is specified with the INPUT tag.
# Note that relative paths are relative to the directory from which doxygen is
# run.
EXCLUDE =
# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
# directories that are symbolic links (a Unix file system feature) are excluded
# from the input.
EXCLUDE_SYMLINKS = NO
# If the value of the INPUT tag contains directories, you can use the
# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
# certain files from those directories. Note that the wildcards are matched
# against the file with absolute path, so to exclude all test directories
# for example use the pattern */test/*
EXCLUDE_PATTERNS =
# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
# (namespaces, classes, functions, etc.) that should be excluded from the
# output. The symbol name can be a fully qualified name, a word, or if the
# wildcard * is used, a substring. Examples: ANamespace, AClass,
# AClass::ANamespace, ANamespace::*Test
EXCLUDE_SYMBOLS =
# The EXAMPLE_PATH tag can be used to specify one or more files or
# directories that contain example code fragments that are included (see
# the \include command).
EXAMPLE_PATH =
# If the value of the EXAMPLE_PATH tag contains directories, you can use the
# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp
# and *.h) to filter out the source-files in the directories. If left
# blank all files are included.
EXAMPLE_PATTERNS =
# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
# searched for input files to be used with the \include or \dontinclude
# commands irrespective of the value of the RECURSIVE tag.
# Possible values are YES and NO. If left blank NO is used.
EXAMPLE_RECURSIVE = NO
# The IMAGE_PATH tag can be used to specify one or more files or
# directories that contain image that are included in the documentation (see
# the \image command).
IMAGE_PATH =
# The INPUT_FILTER tag can be used to specify a program that doxygen should
# invoke to filter for each input file. Doxygen will invoke the filter program
# by executing (via popen()) the command
# is the value of the INPUT_FILTER tag, and
# input file. Doxygen will then use the output that the filter program writes
# to standard output.
# If FILTER_PATTERNS is specified, this tag will be
# ignored.
INPUT_FILTER =
# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
# basis.
# Doxygen will compare the file name with each pattern and apply the
# filter if there is a match.
# The filters are a list of the form:
# pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further
# info on how filters are used. If FILTER_PATTERNS is empty or if
# non of the patterns match the file name, INPUT_FILTER is applied.
FILTER_PATTERNS =
# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
# INPUT_FILTER) will be used to filter the input files when producing source
# files to browse (i.e. when SOURCE_BROWSER is set to YES).
FILTER_SOURCE_FILES = NO
# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
# pattern. A pattern will override the setting for FILTER_PATTERN (if any)
# and it is also possible to disable source filtering for a specific pattern
# using *.ext= (so without naming a filter). This option only has effect when
# FILTER_SOURCE_FILES is enabled.
FILTER_SOURCE_PATTERNS =
# If the USE_MD_FILE_AS_MAINPAGE tag refers to the name of a markdown file that
# is part of the input, its contents will be placed on the main page (index.html).
# This can be useful if you have a project on for instance GitHub and want reuse
# the introduction page also for the doxygen output.
USE_MDFILE_AS_MAINPAGE =
#—————————————————————————
# configuration options related to source browsing
#—————————————————————————
# If the SOURCE_BROWSER tag is set to YES then a list of source files will
# be generated. Documented entities will be cross-referenced with these sources.
# Note: To get rid of all source code in the generated output, make sure also
# VERBATIM_HEADERS is set to NO.
SOURCE_BROWSER = NO
# Setting the INLINE_SOURCES tag to YES will include the body
# of functions and classes directly in the documentation.
INLINE_SOURCES = NO
# Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct
# doxygen to hide any special comment blocks from generated source code
# fragments. Normal C, C++ and Fortran comments will always remain visible.
STRIP_CODE_COMMENTS = YES
# If the REFERENCED_BY_RELATION tag is set to YES
# then for each documented function all documented
# functions referencing it will be listed.
REFERENCED_BY_RELATION = NO
# If the REFERENCES_RELATION tag is set to YES
# then for each documented function all documented entities
# called/used by that function will be listed.
REFERENCES_RELATION = NO
# If the REFERENCES_LINK_SOURCE tag is set to YES (the default)
# and SOURCE_BROWSER tag is set to YES, then the hyperlinks from
# functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will
# link to the source code.
# Otherwise they will link to the documentation.
REFERENCES_LINK_SOURCE = YES
# If the USE_HTAGS tag is set to YES then the references to source code
# will point to the HTML generated by the htags(1) tool instead of doxygen
# built-in source browser. The htags tool is part of GNU’s global source
# tagging system (see http://www.gnu.org/software/global/global.html). You
# will need version 4.8.6 or higher.
USE_HTAGS = NO
# If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen
# will generate a verbatim copy of the header file for each class for
# which an include is specified. Set to NO to disable this.
VERBATIM_HEADERS = YES
#—————————————————————————
# configuration options related to the alphabetical class index
#—————————————————————————
# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index
# of all compounds will be generated. Enable this if the project
# contains a lot of classes, structs, unions or interfaces.
ALPHABETICAL_INDEX = YES
# If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then
# the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns
# in which this list will be split (can be a number in the range [1..20])
COLS_IN_ALPHA_INDEX = 5
# In case all classes in a project start with a common prefix, all
# classes will be put under the same header in the alphabetical index.
# The IGNORE_PREFIX tag can be used to specify one or more prefixes that
# should be ignored while generating the index headers.
IGNORE_PREFIX =
#—————————————————————————
# configuration options related to the HTML output
#—————————————————————————
# If the GENERATE_HTML tag is set to YES (the default) Doxygen will
# generate HTML output.
GENERATE_HTML = YES
# The HTML_OUTPUT tag is used to specify where the HTML docs will be put.
# If a relative path is entered the value of OUTPUT_DIRECTORY will be
# put in front of it. If left blank `html’ will be used as the default path.
HTML_OUTPUT = html
# The HTML_FILE_EXTENSION tag can be used to specify the file extension for
# each generated HTML page (for example: .htm,.php,.asp). If it is left blank
# doxygen will generate files with .html extension.
HTML_FILE_EXTENSION = .html
# The HTML_HEADER tag can be used to specify a personal HTML header for
# each generated HTML page. If it is left blank doxygen will generate a
# standard header. Note that when using a custom header you are responsible
# for the proper inclusion of any scripts and style sheets that doxygen
# needs, which is dependent on the configuration options used.
# It is advised to generate a default header using “doxygen -w html
# header.html footer.html stylesheet.css YourConfigFile” and then modify
# that header. Note that the header is subject to change so you typically
# have to redo this when upgrading to a newer version of doxygen or when
# changing the value of configuration settings such as GENERATE_TREEVIEW!
HTML_HEADER =
# The HTML_FOOTER tag can be used to specify a personal HTML footer for
# each generated HTML page. If it is left blank doxygen will generate a
# standard footer.
HTML_FOOTER =
# The HTML_STYLESHEET tag can be used to specify a user-defined cascading
# style sheet that is used by each HTML page. It can be used to
# fine-tune the look of the HTML output. If left blank doxygen will
# generate a default style sheet. Note that it is recommended to use
# HTML_EXTRA_STYLESHEET instead of this one, as it is more robust and this
# tag will in the future become obsolete.
HTML_STYLESHEET =
# The HTML_EXTRA_STYLESHEET tag can be used to specify an additional
# user-defined cascading style sheet that is included after the standard
# style sheets created by doxygen. Using this option one can overrule
# certain style aspects. This is preferred over using HTML_STYLESHEET
# since it does not replace the standard style sheet and is therefor more
# robust against future updates. Doxygen will copy the style sheet file to
# the output directory.
HTML_EXTRA_STYLESHEET =
# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
# other source files which should be copied to the HTML output directory. Note
# that these files will be copied to the base HTML output directory. Use the
# $relpath$ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
# files. In the HTML_STYLESHEET file, use the file name only. Also note that
# the files will be copied as-is; there are no commands or markers available.
HTML_EXTRA_FILES =
# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output.
# Doxygen will adjust the colors in the style sheet and background images
# according to this color. Hue is specified as an angle on a colorwheel,
# see http://en.wikipedia.org/wiki/Hue for more information.
# For instance the value 0 represents red, 60 is yellow, 120 is green,
# 180 is cyan, 240 is blue, 300 purple, and 360 is red again.
# The allowed range is 0 to 359.
HTML_COLORSTYLE_HUE = 220
# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of
# the colors in the HTML output. For a value of 0 the output will use
# grayscales only. A value of 255 will produce the most vivid colors.
HTML_COLORSTYLE_SAT = 100
# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to
# the luminance component of the colors in the HTML output. Values below
# 100 gradually make the output lighter, whereas values above 100 make
# the output darker. The value divided by 100 is the actual gamma applied,
# so 80 represents a gamma of 0.8, The value 220 represents a gamma of 2.2,
# and 100 does not change the gamma.
HTML_COLORSTYLE_GAMMA = 80
# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
# page will contain the date and time when the page was generated. Setting
# this to NO can help when comparing the output of multiple runs.
HTML_TIMESTAMP = YES
# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
# documentation will contain sections that can be hidden and shown after the
# page has loaded.
HTML_DYNAMIC_SECTIONS = NO
# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of
# entries shown in the various tree structured indices initially; the user
# can expand and collapse entries dynamically later on. Doxygen will expand
# the tree to such a level that at most the specified number of entries are
# visible (unless a fully collapsed tree already exceeds this amount).
# So setting the number of entries 1 will produce a full collapsed tree by
# default. 0 is a special value representing an infinite number of entries
# and will result in a full expanded tree by default.
HTML_INDEX_NUM_ENTRIES = 100
# If the GENERATE_DOCSET tag is set to YES, additional index files
# will be generated that can be used as input for Apple’s Xcode 3
# integrated development environment, introduced with OSX 10.5 (Leopard).
# To create a documentation set, doxygen will generate a Makefile in the
# HTML output directory. Running make will produce the docset in that
# directory and running “make install” will install the docset in
# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find
# it at startup.
# See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
# for more information.
GENERATE_DOCSET = NO
# When GENERATE_DOCSET tag is set to YES, this tag determines the name of the
# feed. A documentation feed provides an umbrella under which multiple
# documentation sets from a single provider (such as a company or product suite)
# can be grouped.
DOCSET_FEEDNAME = “Doxygen generated docs”
# When GENERATE_DOCSET tag is set to YES, this tag specifies a string that
# should uniquely identify the documentation set bundle. This should be a
# reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen
# will append set to the name.
DOCSET_BUNDLE_ID = org.doxygen.Project
# When GENERATE_PUBLISHER_ID tag specifies a string that should uniquely
# identify the documentation publisher. This should be a reverse domain-name
# style string, e.g. com.mycompany.MyDocSet umentation.
DOCSET_PUBLISHER_ID = org.doxygen.Publisher
# The GENERATE_PUBLISHER_NAME tag identifies the documentation publisher.
DOCSET_PUBLISHER_NAME = Publisher
# If the GENERATE_HTMLHELP tag is set to YES, additional index files
# will be generated that can be used as input for tools like the
# Microsoft HTML help workshop to generate a compiled HTML help file (.chm)
# of the generated HTML documentation.
GENERATE_HTMLHELP = NO
# If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can
# be used to specify the file name of the resulting .chm file. You
# can add a path in front of the file if the result should not be
# written to the html output directory.
CHM_FILE =
# If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can
# be used to specify the location (absolute path including file name) of
# the HTML help compiler (hhc.exe). If non-empty doxygen will try to run
# the HTML help compiler on the generated index.hhp.
HHC_LOCATION =
# If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag
# controls if a separate .chi index file is generated (YES) or that
# it should be included in the master .chm file (NO).
GENERATE_CHI = NO
# If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING
# is used to encode HtmlHelp index (hhk), content (hhc) and project file
# content.
CHM_INDEX_ENCODING =
# If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag
# controls whether a binary table of contents is generated (YES) or a
# normal table of contents (NO) in the .chm file.
BINARY_TOC = NO
# The TOC_EXPAND flag can be set to YES to add extra items for group members
# to the contents of the HTML help documentation and to the tree view.
TOC_EXPAND = NO
# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated
# that can be used as input for Qt’s qhelpgenerator to generate a
# Qt Compressed Help (.qch) of the generated HTML documentation.
GENERATE_QHP = NO
# If the QHG_LOCATION tag is specified, the QCH_FILE tag can
# be used to specify the file name of the resulting .qch file.
# The path specified is relative to the HTML output folder.
QCH_FILE =
# The QHP_NAMESPACE tag specifies the namespace to use when generating
# Qt Help Project output. For more information please see
# http://doc.trolltech.com/qthelpproject.html#namespace
QHP_NAMESPACE = org.doxygen.Project
# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating
# Qt Help Project output. For more information please see
# http://doc.trolltech.com/qthelpproject.html#virtual-folders
QHP_VIRTUAL_FOLDER = doc
# If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to
# add. For more information please see
# http://doc.trolltech.com/qthelpproject.html#custom-filters
QHP_CUST_FILTER_NAME =
# The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the
# custom filter to add. For more information please see
#
# Qt Help Project / Custom Filters.
QHP_CUST_FILTER_ATTRS =
# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
# project’s
# filter section matches.
#
# Qt Help Project / Filter Attributes.
QHP_SECT_FILTER_ATTRS =
# If the GENERATE_QHP tag is set to YES, the QHG_LOCATION tag can
# be used to specify the location of Qt’s qhelpgenerator.
# If non-empty doxygen will try to run qhelpgenerator on the generated
# .qhp file.
QHG_LOCATION =
# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files
# will be generated, which together with the HTML files, form an Eclipse help
# plugin. To install this plugin and make it available under the help contents
# menu in Eclipse, the contents of the directory containing the HTML and XML
# files needs to be copied into the plugins directory of eclipse. The name of
# the directory within the plugins directory should be the same as
# the ECLIPSE_DOC_ID value. After copying Eclipse needs to be restarted before
# the help appears.
GENERATE_ECLIPSEHELP = NO
# A unique identifier for the eclipse help plugin. When installing the plugin
# the directory name containing the HTML and XML files should also have
# this name.
ECLIPSE_DOC_ID = org.doxygen.Project
# The DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs)
# at top of each HTML page. The value NO (the default) enables the index and
# the value YES disables it. Since the tabs have the same information as the
# navigation tree you can set this option to NO if you already set
# GENERATE_TREEVIEW to YES.
DISABLE_INDEX = NO
# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
# structure should be generated to display hierarchical information.
# If the tag value is set to YES, a side panel will be generated
# containing a tree-like index structure (just like the one that
# is generated for HTML Help). For this to work a browser that supports
# JavaScript, DHTML, CSS and frames is required (i.e. any modern browser).
# Windows users are probably better off using the HTML help feature.
# Since the tree basically has the same information as the tab index you
# could consider to set DISABLE_INDEX to NO when enabling this option.
GENERATE_TREEVIEW = NO
# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values
# (range [0,1..20]) that doxygen will group on one line in the generated HTML
# documentation. Note that a value of 0 will completely suppress the enum
# values from appearing in the overview section.
ENUM_VALUES_PER_LINE = 4
# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be
# used to set the initial width (in pixels) of the frame in which the tree
# is shown.
TREEVIEW_WIDTH = 250
# When the EXT_LINKS_IN_WINDOW option is set to YES doxygen will open
# links to external symbols imported via tag files in a separate window.
EXT_LINKS_IN_WINDOW = NO
# Use this tag to change the font size of Latex formulas included
# as images in the HTML documentation. The default is 10. Note that
# when you change the font size after a successful doxygen run you need
# to manually remove any form_* images from the HTML output directory
# to force them to be regenerated.
FORMULA_FONTSIZE = 10
# Use the FORMULA_TRANPARENT tag to determine whether or not the images
# generated for formulas are transparent PNGs. Transparent PNGs are
# not supported properly for IE 6.0, but are supported on all modern browsers.
# Note that when changing this option you need to delete any form_* files
# in the HTML output before the changes have effect.
FORMULA_TRANSPARENT = YES
# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax
# (see http://www.mathjax.org) which uses client side Javascript for the
# rendering instead of using prerendered bitmaps. Use this if you do not
# have LaTeX installed or if you want to formulas look prettier in the HTML
# output. When enabled you may also need to install MathJax separately and
# configure the path to it using the MATHJAX_RELPATH option.
USE_MATHJAX = NO
# When MathJax is enabled you can set the default output format to be used for
# thA MathJax output. Supported types are HTML-CSS, NativeMML (i.e. MathML) and
# SVG. The default value is HTML-CSS, which is slower, but has the best
# compatibility.
MATHJAX_FORMAT = HTML-CSS
# When MathJax is enabled you need to specify the location relative to the
# HTML output directory using the MATHJAX_RELPATH option. The destination
# directory should contain the MathJax.js script. For instance, if the mathjax
# directory is located at the same level as the HTML output directory, then
# MATHJAX_RELPATH should be ../mathjax. The default value points to
# the MathJax Content Delivery Network so you can quickly see the result without
# installing MathJax.
# However, it is strongly recommended to install a local
# copy of MathJax from http://www.mathjax.org before deployment.
MATHJAX_RELPATH = http://cdn.mathjax.org/mathjax/latest
# The MATHJAX_EXTENSIONS tag can be used to specify one or MathJax extension
# names that should be enabled during MathJax rendering.
MATHJAX_EXTENSIONS =
# When the SEARCHENGINE tag is enabled doxygen will generate a search box
# for the HTML output. The underlying search engine uses javascript
# and DHTML and should work on any modern browser. Note that when using
# HTML help (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets
# (GENERATE_DOCSET) there is already a search function so this one should
# typically be disabled. For large projects the javascript based search engine
# can be slow, then enabling SERVER_BASED_SEARCH may provide a better solution.
SEARCHENGINE = YES
# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
# implemented using a web server instead of a web client using Javascript.
# There are two flavours of web server based search depending on the
# EXTERNAL_SEARCH setting. When disabled, doxygen will generate a PHP script for
# searching and an index file used by the script. When EXTERNAL_SEARCH is
# enabled the indexing and searching needs to be provided by external tools.
# See the manual for details.
SERVER_BASED_SEARCH = NO
# When EXTERNAL_SEARCH is enabled doxygen will no longer generate the PHP
# script for searching. Instead the search results are written to an XML file
# which needs to be processed by an external indexer. Doxygen will invoke an
# external search engine pointed to by the SEARCHENGINE_URL option to obtain
# the search results. Doxygen ships with an example indexer (doxyindexer) and
# search engine (doxysearch.cgi) which are based on the open source search engine
# library Xapian. See the manual for configuration details.
EXTERNAL_SEARCH = NO
# The SEARCHENGINE_URL should point to a search engine hosted by a web server
# which will returned the search results when EXTERNAL_SEARCH is enabled.
# Doxygen ships with an example search engine (doxysearch) which is based on
# the open source search engine library Xapian. See the manual for configuration
# details.
SEARCHENGINE_URL =
# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
# search data is written to a file for indexing by an external tool. With the
# SEARCHDATA_FILE tag the name of this file can be specified.
SEARCHDATA_FILE = searchdata.xml
# When SERVER_BASED_SEARCH AND EXTERNAL_SEARCH are both enabled the
# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
# projects and redirect the results back to the right project.
EXTERNAL_SEARCH_ID =
# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
# projects other than the one defined by this configuration file, but that are
# all added to the same external search index. Each project needs to have a
# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id
# of to a relative location where the documentation can be found.
# The format is: EXTRA_SEARCH_MAPPINGS = id1=loc1 id2=loc2 …
EXTRA_SEARCH_MAPPINGS =
#—————————————————————————
# configuration options related to the LaTeX output
#—————————————————————————
# If the GENERATE_LATEX tag is set to YES (the default) Doxygen will
# generate Latex output.
GENERATE_LATEX = NO
# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put.
# If a relative path is entered the value of OUTPUT_DIRECTORY will be
# put in front of it. If left blank `latex’ will be used as the default path.
LATEX_OUTPUT = latex
# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
# invoked. If left blank `latex’ will be used as the default command name.
# Note that when enabling USE_PDFLATEX this option is only used for
# generating bitmaps for formulas in the HTML output, but not in the
# Makefile that is written to the output directory.
LATEX_CMD_NAME = latex
# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to
# generate index for LaTeX. If left blank `makeindex’ will be used as the
# default command name.
MAKEINDEX_CMD_NAME = makeindex
# If the COMPACT_LATEX tag is set to YES Doxygen generates more compact
# LaTeX documents. This may be useful for small projects and may help to
# save some trees in general.
COMPACT_LATEX = NO
# The PAPER_TYPE tag can be used to set the paper type that is used
# by the printer. Possible values are: a4, letter, legal and
# executive. If left blank a4wide will be used.
PAPER_TYPE = a4
# The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX
# packages that should be included in the LaTeX output.
EXTRA_PACKAGES =
# The LATEX_HEADER tag can be used to specify a personal LaTeX header for
# the generated latex document. The header should contain everything until
# the first chapter. If it is left blank doxygen will generate a
# standard header. Notice: only use this tag if you know what you are doing!
LATEX_HEADER =
# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for
# the generated latex document. The footer should contain everything after
# the last chapter. If it is left blank doxygen will generate a
# standard footer. Notice: only use this tag if you know what you are doing!
LATEX_FOOTER =
# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated
# is prepared for conversion to pdf (using ps2pdf). The pdf file will
# contain links (just like the HTML output) instead of page references
# This makes the output suitable for online browsing using a pdf viewer.
PDF_HYPERLINKS = YES
# If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of
# plain latex in the generated Makefile. Set this option to YES to get a
# higher quality PDF documentation.
USE_PDFLATEX = YES
# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode.
# command to the generated LaTeX files. This will instruct LaTeX to keep
# running if errors occur, instead of asking the user for help.
# This option is also used when generating formulas in HTML.
LATEX_BATCHMODE = NO
# If LATEX_HIDE_INDICES is set to YES then doxygen will not
# include the index chapters (such as File Index, Compound Index, etc.)
# in the output.
LATEX_HIDE_INDICES = NO
# If LATEX_SOURCE_CODE is set to YES then doxygen will include
# source code with syntax highlighting in the LaTeX output.
# Note that which sources are shown also depends on other settings
# such as SOURCE_BROWSER.
LATEX_SOURCE_CODE = NO
# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
# bibliography, e.g. plainnat, or ieeetr. The default style is “plain”. See
# http://en.wikipedia.org/wiki/BibTeX for more info.
LATEX_BIB_STYLE = plain
#—————————————————————————
# configuration options related to the RTF output
#—————————————————————————
# If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output
# The RTF output is optimized for Word 97 and may not look very pretty with
# other RTF readers or editors.
GENERATE_RTF = NO
# The RTF_OUTPUT tag is used to specify where the RTF docs will be put.
# If a relative path is entered the value of OUTPUT_DIRECTORY will be
# put in front of it. If left blank `rtf’ will be used as the default path.
RTF_OUTPUT = rtf
# If the COMPACT_RTF tag is set to YES Doxygen generates more compact
# RTF documents. This may be useful for small projects and may help to
# save some trees in general.
COMPACT_RTF = NO
# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated
# will contain hyperlink fields. The RTF file will
# contain links (just like the HTML output) instead of page references.
# This makes the output suitable for online browsing using WORD or other
# programs which support those fields.
# Note: wordpad (write) and others do not support links.
RTF_HYPERLINKS = NO
# Load style sheet definitions from file. Syntax is similar to doxygen’s
# config file, i.e. a series of assignments. You only have to provide
# replacements, missing definitions are set to their default value.
RTF_STYLESHEET_FILE =
# Set optional variables used in the generation of an rtf document.
# Syntax is similar to doxygen’s config file.
RTF_EXTENSIONS_FILE =
#—————————————————————————
# configuration options related to the man page output
#—————————————————————————
# If the GENERATE_MAN tag is set to YES (the default) Doxygen will
# generate man pages
GENERATE_MAN = NO
# The MAN_OUTPUT tag is used to specify where the man pages will be put.
# If a relative path is entered the value of OUTPUT_DIRECTORY will be
# put in front of it. If left blank `man’ will be used as the default path.
MAN_OUTPUT = man
# The MAN_EXTENSION tag determines the extension that is added to
# the generated man pages (default is the subroutine’s section .3)
MAN_EXTENSION = .3
# If the MAN_LINKS tag is set to YES and Doxygen generates man output,
# then it will generate one additional man file for each entity
# documented in the real man page(s). These additional files
# only source the real man page, but without them the man command
# would be unable to find the correct page. The default is NO.
MAN_LINKS = NO
#—————————————————————————
# configuration options related to the XML output
#—————————————————————————
# If the GENERATE_XML tag is set to YES Doxygen will
# generate an XML file that captures the structure of
# the code including all documentation.
GENERATE_XML = NO
# The XML_OUTPUT tag is used to specify where the XML pages will be put.
# If a relative path is entered the value of OUTPUT_DIRECTORY will be
# put in front of it. If left blank `xml’ will be used as the default path.
XML_OUTPUT = xml
# The XML_SCHEMA tag can be used to specify an XML schema,
# which can be used by a validating XML parser to check the
# syntax of the XML files.
XML_SCHEMA =
# The XML_DTD tag can be used to specify an XML DTD,
# which can be used by a validating XML parser to check the
# syntax of the XML files.
XML_DTD =
# If the XML_PROGRAMLISTING tag is set to YES Doxygen will
# dump the program listings (including syntax highlighting
# and cross-referencing information) to the XML output. Note that
# enabling this will significantly increase the size of the XML output.
XML_PROGRAMLISTING = YES
#—————————————————————————
# configuration options for the AutoGen Definitions output
#—————————————————————————
# If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will
# generate an AutoGen Definitions (see autogen.sf.net) file
# that captures the structure of the code including all
# documentation. Note that this feature is still experimental
# and incomplete at the moment.
GENERATE_AUTOGEN_DEF = NO
#—————————————————————————
# configuration options related to the Perl module output
#—————————————————————————
# If the GENERATE_PERLMOD tag is set to YES Doxygen will
# generate a Perl module file that captures the structure of
# the code including all documentation. Note that this
# feature is still experimental and incomplete at the
# moment.
GENERATE_PERLMOD = NO
# If the PERLMOD_LATEX tag is set to YES Doxygen will generate
# the necessary Makefile rules, Perl scripts and LaTeX code to be able
# to generate PDF and DVI output from the Perl module output.
PERLMOD_LATEX = NO
# If the PERLMOD_PRETTY tag is set to YES the Perl module output will be
# nicely formatted so it can be parsed by a human reader.
# This is useful
# if you want to understand what is going on.
# On the other hand, if this
# tag is set to NO the size of the Perl module output will be much smaller
# and Perl will parse it just the same.
PERLMOD_PRETTY = YES
# The names of the make variables in the generated doxyrules.make file
# are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX.
# This is useful so different doxyrules.make files included by the same
# Makefile don’t overwrite each other’s variables.
PERLMOD_MAKEVAR_PREFIX =
#—————————————————————————
# Configuration options related to the preprocessor
#—————————————————————————
# If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will
# evaluate all C-preprocessor directives found in the sources and include
# files.
ENABLE_PREPROCESSING = YES
# If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro
# names in the source code. If set to NO (the default) only conditional
# compilation will be performed. Macro expansion can be done in a controlled
# way by setting EXPAND_ONLY_PREDEF to YES.
MACRO_EXPANSION = NO
# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES
# then the macro expansion is limited to the macros specified with the
# PREDEFINED and EXPAND_AS_DEFINED tags.
EXPAND_ONLY_PREDEF = NO
# If the SEARCH_INCLUDES tag is set to YES (the default) the includes files
# pointed to by INCLUDE_PATH will be searched when a #include is found.
SEARCH_INCLUDES = YES
# The INCLUDE_PATH tag can be used to specify one or more directories that
# contain include files that are not input files but should be processed by
# the preprocessor.
INCLUDE_PATH =
# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
# patterns (like *.h and *.hpp) to filter out the header-files in the
# directories. If left blank, the patterns specified with FILE_PATTERNS will
# be used.
INCLUDE_FILE_PATTERNS =
# The PREDEFINED tag can be used to specify one or more macro names that
# are defined before the preprocessor is started (similar to the -D option of
# gcc). The argument of the tag is a list of macros of the form: name
# or name=definition (no spaces). If the definition and the = are
# omitted =1 is assumed. To prevent a macro definition from being
# via #undef or recursively expanded use the := operator
# instead of the = operator.
PREDEFINED =
# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then
# this tag can be used to specify a list of macro names that should be expanded.
# The macro definition that is found in the sources will be used.
# Use the PREDEFINED tag if you want to use a different macro definition that
# overrules the definition found in the source code.
EXPAND_AS_DEFINED =
# If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then
# doxygen’s preprocessor will remove all references to function-like macros
# that are alone on a line, have an all uppercase name, and do not end with a
# semicolon, because these will confuse the parser if not removed.
SKIP_FUNCTION_MACROS = YES
#—————————————————————————
# Configuration::additions related to external references
#—————————————————————————
# The TAGFILES option can be used to specify one or more tagfiles. For each
# tag file the location of the external documentation should be added. The
# format of a tag file without this location is as follows:
#
# TAGFILES = file1 file2 …
# Adding location for the tag files is done as follows:
#
# TAGFILES = file1=loc1 “file2 = loc2” …
# where “loc1” and “loc2” can be relative or absolute paths
# or URLs. Note that each tag file must have a unique name (where the name does
# NOT include the path). If a tag file is not located in the directory in which
# doxygen is run, you must also specify the path to the tagfile here.
TAGFILES =
# When a file name is specified after GENERATE_TAGFILE, doxygen will create
# a tag file that is based on the input files it reads.
GENERATE_TAGFILE =
# If the ALLEXTERNALS tag is set to YES all external classes will be listed
# in the class index. If set to NO only the inherited external classes
# will be listed.
ALLEXTERNALS = NO
# If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed
# in the modules index. If set to NO, only the current project’s groups will
# be listed.
EXTERNAL_GROUPS = YES
# The PERL_PATH should be the absolute path and name of the perl script
# interpreter (i.e. the result of `which perl’).
PERL_PATH = /usr/bin/perl
#—————————————————————————
# Configuration options related to the dot tool
#—————————————————————————
# If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will
# generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base
# or super classes. Setting the tag to NO turns the diagrams off. Note that
# this option also works with HAVE_DOT disabled, but it is recommended to
# install and use dot, since it yields more powerful graphs.
CLASS_DIAGRAMS = YES
# You can define message sequence charts within doxygen comments using the \msc
# command. Doxygen will then run the mscgen tool (see
# http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the
# documentation. The MSCGEN_PATH tag allows you to specify the directory where
# the mscgen tool resides. If left empty the tool is assumed to be found in the
# default search path.
MSCGEN_PATH =
# If set to YES, the inheritance and collaboration graphs will hide
# inheritance and usage relations if the target is undocumented
# or is not a class.
HIDE_UNDOC_RELATIONS = YES
# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
# available from the path. This tool is part of Graphviz, a graph visualization
# toolkit from AT&T and Lucent Bell Labs. The other options in this section
# have no effect if this option is set to NO (the default)
HAVE_DOT = NO
# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is
# allowed to run in parallel. When set to 0 (the default) doxygen will
# base this on the number of processors available in the system. You can set it
# explicitly to a value larger than 0 to get control over the balance
# between CPU load and processing speed.
DOT_NUM_THREADS = 0
# By default doxygen will use the Helvetica font for all dot files that
# doxygen generates. When you want a differently looking font you can specify
# the font name using DOT_FONTNAME. You need to make sure dot is able to find
# the font, which can be done by putting it in a standard location or by setting
# the DOTFONTPATH environment variable or by setting DOT_FONTPATH to the
# directory containing the font.
DOT_FONTNAME = Helvetica
# The DOT_FONTSIZE tag can be used to set the size of the font of dot graphs.
# The default size is 10pt.
DOT_FONTSIZE = 10
# By default doxygen will tell dot to use the Helvetica font.
# If you specify a different font using DOT_FONTNAME you can use DOT_FONTPATH to
# set the path where dot can find it.
DOT_FONTPATH =
# If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen
# will generate a graph for each documented class showing the direct and
# indirect inheritance relations. Setting this tag to YES will force the
# CLASS_DIAGRAMS tag to NO.
CLASS_GRAPH = YES
# If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen
# will generate a graph for each documented class showing the direct and
# indirect implementation dependencies (inheritance, containment, and
# class references variables) of the class with other documented classes.
COLLABORATION_GRAPH = YES
# If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen
# will generate a graph for groups, showing the direct groups dependencies
GROUP_GRAPHS = YES
# If the UML_LOOK tag is set to YES doxygen will generate inheritance and
# collaboration diagrams in a style similar to the OMG’s Unified Modeling
# Language.
UML_LOOK = NO
# If the UML_LOOK tag is enabled, the fields and methods are shown inside
# the class node. If there are many fields or methods and many nodes the
# graph may become too big to be useful. The UML_LIMIT_NUM_FIELDS
# threshold limits the number of items for each type to make the size more
# managable. Set this to 0 for no limit. Note that the threshold may be
# exceeded by 50% before the limit is enforced.
UML_LIMIT_NUM_FIELDS = 10
# If set to YES, the inheritance and collaboration graphs will show the
# relations between templates and their instances.
TEMPLATE_RELATIONS = NO
# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT
# tags are set to YES then doxygen will generate a graph for each documented
# file showing the direct and indirect include dependencies of the file with
# other documented files.
INCLUDE_GRAPH = YES
# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and
# HAVE_DOT tags are set to YES then doxygen will generate a graph for each
# documented header file showing the documented files that directly or
# indirectly include this file.
INCLUDED_BY_GRAPH = YES
# If the CALL_GRAPH and HAVE_DOT options are set to YES then
# doxygen will generate a call dependency graph for every global function
# or class method. Note that enabling this option will significantly increase
# the time of a run. So in most cases it will be better to enable call graphs
# for selected functions only using the \callgraph command.
CALL_GRAPH = NO
# If the CALLER_GRAPH and HAVE_DOT tags are set to YES then
# doxygen will generate a caller dependency graph for every global function
# or class method. Note that enabling this option will significantly increase
# the time of a run. So in most cases it will be better to enable caller
# graphs for selected functions only using the \callergraph command.
CALLER_GRAPH = NO
# If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen
# will generate a graphical hierarchy of all classes instead of a textual one.
GRAPHICAL_HIERARCHY = YES
# If the DIRECTORY_GRAPH and HAVE_DOT tags are set to YES
# then doxygen will show the dependencies a directory has on other directories
# in a graphical way. The dependency relations are determined by the #include
# relations between the files in the directories.
DIRECTORY_GRAPH = YES
# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
# generated by dot. Possible values are svg, png, jpg, or gif.
# If left blank png will be used. If you choose svg you need to set
# HTML_FILE_EXTENSION to xhtml in order to make the SVG files
# visible in IE 9+ (other browsers do not have this requirement).
DOT_IMAGE_FORMAT = png
# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
# enable generation of interactive SVG images that allow zooming and panning.
# Note that this requires a modern browser other than Internet Explorer.
# Tested and working are Firefox, Chrome, Safari, and Opera. For IE 9+ you
# need to set HTML_FILE_EXTENSION to xhtml in order to make the SVG files
# visible. Older versions of IE do not have SVG support.
INTERACTIVE_SVG = NO
# The tag DOT_PATH can be used to specify the path where the dot tool can be
# found. If left blank, it is assumed the dot tool can be found in the path.
DOT_PATH =
# The DOTFILE_DIRS tag can be used to specify one or more directories that
# contain dot files that are included in the documentation (see the
# \dotfile command).
DOTFILE_DIRS =
# The MSCFILE_DIRS tag can be used to specify one or more directories that
# contain msc files that are included in the documentation (see the
# \mscfile command).
MSCFILE_DIRS =
# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of
# nodes that will be shown in the graph. If the number of nodes in a graph
# becomes larger than this value, doxygen will truncate the graph, which is
# visualized by representing a node as a red box. Note that doxygen if the
# number of direct children of the root node in a graph is already larger than
# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note
# that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
DOT_GRAPH_MAX_NODES = 50
# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the
# graphs generated by dot. A depth value of 3 means that only nodes reachable
# from the root by following a path via at most 3 edges will be shown. Nodes
# that lay further from the root node will be omitted. Note that setting this
# option to 1 or 2 may greatly reduce the computation time needed for large
# code bases. Also note that the size of a graph can be further restricted by
# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
MAX_DOT_GRAPH_DEPTH = 0
# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
# background. This is disabled by default, because dot on Windows does not
# seem to support this out of the box. Warning: Depending on the platform used,
# enabling this option may lead to badly anti-aliased labels on the edges of
# a graph (i.e. they become hard to read).
DOT_TRANSPARENT = NO
# Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output
# files in one run (i.e. multiple -o and -T options on the command line). This
# makes dot run faster, but since only newer versions of dot (>1.8.10)
# support this, this feature is disabled by default.
DOT_MULTI_TARGETS = YES
# If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will
# generate a legend page explaining the meaning of the various boxes and
# arrows in the dot generated graphs.
GENERATE_LEGEND = YES
# If the DOT_CLEANUP tag is set to YES (the default) Doxygen will
# remove the intermediate dot files that are used to generate
# the various graphs.
DOT_CLEANUP = YES
bin/Linux/printSchedule
bin/Windows/printSchedule.exe
csv.cpp
#include “csv.h”
using namespace std;
/**
* Parse a string as a row of CSV (comma-separated-values) fields.
*
* @param line a line representing a single row in CSV format.
* @return a vector of string field values obtained from the line
*/
std::vector
{
enum States
{
atStartofField,
accumulatingCharacters,
insideQuotedString
};
vector
string current;
States state = atStartofField;
for (string::size_type i = 0; i < line.size(); ++i)
{
char c = line[i];
switch (state)
{
case atStartofField:
{
if (c == '"')
{
state = insideQuotedString;
}
else if (c == ',')
{
fields.push_back(current);
current = "";
}
else
{
current += c;
state = accumulatingCharacters;
}
}
break;
case accumulatingCharacters:
{
if (c == ',')
{
fields.push_back(current);
current = "";
state = atStartofField;
}
else
{
current += c;
state = accumulatingCharacters;
}
}
break;
case insideQuotedString:
{
if (c == '"')
{
if (i == line.size() || line[i + 1] != '"')
{
state = accumulatingCharacters;
}
else
{
current += c;
i++;
state = insideQuotedString;
}
}
else
{
current += c;
state = insideQuotedString;
}
}
break;
}
}
fields.push_back(current);
return fields;
}
csv.h
#ifndef CSV_H
#define CSV_H
#include
#include
/**
* Parse a string as a row of CSV (comma-separated-values) fields.
*
* @param line a line representing a single row in CSV format.
* @return a vector of string field values obtained from the line
*/
std::vector
#endif
department.cpp
#include
#include
#include “department.h”
using namespace std;
Department::Department()
: nFaculty(0)
{
}
Faculty& Department::findFaculty (const string& facName)
{
int k = 0;
while (k < nFaculty && facName > faculty[k].getName())
{
++k;
}
if (k < nFaculty && facName == faculty[k].getName())
{
return faculty[k];
}
else
{
assert (nFaculty < MAXFACULTY);
faculty[nFaculty] = Faculty(facName, {});
++nFaculty;
k = nFaculty-1;
while (k > 0 && faculty[k] < faculty[k-1])
{
swap(faculty[k], faculty[k-1]);
--k;
}
return faculty[k];
}
}
department.h
#ifndef DEPARTMENT_H
#define DEPARTMENT_H
#include
#include
#include “faculty.h”
using namespace std;
class Department {
static const int MAXFACULTY = 100;
Faculty faculty[MAXFACULTY];
int nFaculty;
public:
Department();
/**
* Search the department for the indicated faculty name. If found, return
* that faculty member. If not found, add a new faculty member with that
* name and return the newly added faculty member.
*
* @param facName name of the faculty member to find or add
* @return the faculty member with that name
*/
Faculty& findFaculty (const string& facName);
/**
* number of faculty in the dept.
*/
int numFaculty() const {return nFaculty;}
/**
* Retrieve the i_th faculty member
*
* @param i index of faculty member to retrieve
* @return the faculty member
* @pre i >= 0 && i < numFaculty()
*/
Faculty& get (int i) const {return ((Department*)this)->faculty[i];}
};
#endif
faculty.cpp
#include
#include “faculty.h”
using namespace std;
const unsigned Faculty::MAXSECTIONS = 150;
/**
* Construct a Faculty object with empty name and no course sections.
*/
Faculty::Faculty()
: name(), numberOfSections(0), sections(new Section[MAXSECTIONS])
{
}
/**
* Construct a faculty member with the given name and no course sections.
*
* @param theName name to give to this faculty member
*/
Faculty::Faculty(std::string theName)
: name(theName), numberOfSections(0), sections(new Section[MAXSECTIONS])
{
}
/**
* Retrieve the sectionNum_th section associated with this faculty member
*
* @param sectionNum identifies the section to be retrieved.
* @return the desired section
* @pre sectionNum < numSections()
*/
const Section& Faculty::getSection(unsigned sectionNum) const
{
assert (sectionNum < numberOfSections);
return sections[sectionNum];
}
/**
* Add a section to the list for this faculty member. Sections are kept ordered
* by course number and CRN.
*
* @param sect a course section
*/
void Faculty::add(const Section §)
{
assert (numberOfSections < MAXSECTIONS);
sections[numberOfSections] = sect;
++numberOfSections;
}
/**
* Print a faculty member name, followed, one per line, by the sections associated
* with this faculty member;
*/
std::ostream& operator<< (std::ostream& out, const Faculty& fac)
{
out << fac.getName() << "\n";
for (unsigned i = 0; i < fac.numSections(); ++i)
{
const Section& sect = fac.getSection(i);
out << " " << sect << endl;
}
return out;
}
faculty.h
#ifndef FACULTY_H
#define FACULTY_H
#include
#include
#include
#include “section.h”
class Faculty {
private:
//** You must not change the private data members of this class, nor
//** may you add additional data members.
//**
//** You may add private functions if you wish.
std::string name; //!< The name ofthe faculty member
unsigned numberOfSections; //!< Number of course sections being taught by this faculty member
std::list
#include “faculty.h”
#include
using namespace std;
bool constCheck (const Section&)
{
return true;
}
bool constCheck (Section&)
{
return false;
}
bool Faculty::sanityCheck() const
{
const unsigned& n = numberOfSections;
const list
if (n > 1)
{
const_iterator start = begin();
const_iterator next = start;
++next;
while (next != end())
{
if (*next < *start)
return false;
start = next;
next++;
}
}
Faculty& fac = (Faculty&)(*this);
Faculty::iterator iter = fac.begin();
Section s;
decltype(*iter) x = s;
return constCheck(x);
}
makefile
MAINPROG=printSchedule
DIR=${PWD}
ASST=$(notdir ${DIR})
CC=gcc
CXX=g++
##
# Adjust settings for different compilers
#
ifeq ($(OS),Windows_NT)
#
# Flags for Windows compilers
CPPFLAGS=-g -std=c++17 -MMD -pthread -D_GLIBCXX_DEBUG -Wall
LFLAGS=
RM=del /q
EXE=.exe
else
#
# Flags for Linux & MacOS
CPPFLAGS=-g -std=c++17 -MMD -pthread -D_GLIBCXX_DEBUG -Wall
LFLAGSx=-fuse-ld=gold -pthread
RM=/bin/rm -rf
EXE=
endif
#
########################################################################
# Macro definitions for "standard" C and C++ compilations
#
CFLAGS=-g
TARGET=$(MAINPROG)$(EXE)
CPPS=$(wildcard *.cpp)
MAINCPPS=$(filter-out unittest.cpp test%.cpp, $(CPPS))
TESTCPPS=$(filter-out $(MAINPROG).cpp, $(CPPS))
LINK=g++ $(CPPFLAGS)
#
#
# In most cases, you should not change anything below this line.
#
# The following is "boilerplate" to set up the standard compilation
# commands:
#
MAINOBJS=$(MAINCPPS:%.cpp=%.o)
TESTOBJS=$(TESTCPPS:%.cpp=%.o)
DEPENDENCIES = $(CPPS:%.cpp=%.d)
%.d: %.cpp
touch $@
%.o: %.cpp
$(CXX) $(CPPFLAGS) -o $@ -c $*.cpp
#
# Targets:
#
all: $(TARGET) unittest$(EXE)
$(TARGET): $(MAINOBJS)
$(LINK) $(FLAGS) -o $(TARGET) $^ $(LFLAGS)
clean:
-/bin/rm -rf *.d *.o $(TARGET) unittest$(EXE) docs
documentation:
-mkdir docs
doxygen Doxyfile
unittest$(EXE): $(TESTOBJS)
$(LINK) $(FLAGS) -o $@ $^ $(LFLAGS)
make.dep: $(DEPENDENCIES)
-cat $(DEPENDENCIES) > $@
include make.dep
memoryChecked.cpp
memoryChecked.cpp
/*
* counted.cpp
*
* Created on: Apr 10, 2017
* Author: zeil
*/
#include
“memoryChecked.h”
#include
<
iostream
>
int
MemoryChecked
::
numObjects
=
0
;
bool
MemoryChecked
::
memoryViolationDetected
=
false
;
MemoryChecked
&
MemoryChecked
::
operator
=
(
const
MemoryChecked
&
rhs
)
{
if
(
hasBeenDestroyed
)
{
memoryViolationDetected
=
true
;
throw
DanglingPointerException
(
“*** Attempted to assign to an already destroyed object”
);
}
if
(
rhs
.
hasBeenDestroyed
)
{
memoryViolationDetected
=
true
;
throw
DanglingPointerException
(
“*** Attempted to assign from an already destroyed object”
);
}
return
*
this
;
}
MemoryChecked
::
MemoryChecked
(
const
MemoryChecked
&
c
)
:
hasBeenDestroyed
(
false
)
{
++
numObjects
;
if
(
c
.
hasBeenDestroyed
)
{
memoryViolationDetected
=
true
;
throw
DanglingPointerException
(
“*** Attempted to copy an already destroyed object”
);
}
}
MemoryChecked
::~
MemoryChecked
()
noexcept
(
false
)
{
if
(
hasBeenDestroyed
)
{
memoryViolationDetected
=
true
;
throw
DanglingPointerException
(
“*** Attempted to destroy an already destroyed object”
);
}
else
{
hasBeenDestroyed
=
true
;
—
numObjects
;
}
}
void
MemoryChecked
::
resetMemoryChecks
()
{
numObjects
=
0
;
memoryViolationDetected
=
false
;
}
memoryChecked.h
/*
* counted.h
*
* Created on: Apr 10, 2017
* Author: zeil
*/
#ifndef MEMORYCHECKED_H_
#define MEMORYCHECKED_H_
#include
/**
* Utility for detecting memory leaks and dangling pointers.
*
*
* Detection can be added to a class by adding a data member of this type.
*
*/
class MemoryChecked
{
/**
* A count of the number of Counted objects currently in use.
*/
static int numObjects; // = 0;
/**
* Indicates if a dangling pointer problem has
* been detected during this execution.
*/
static bool memoryViolationDetected; // = false;
/**
* Indicates whether this object has been destroyed.
*/
bool hasBeenDestroyed;
public:
/**
* This exception will be thrown when an attempt to copy
* an object that has already been destroyed, when an
* attempt is made to assign to/from a destroyed object, or
* when an attempt is made to destroy an already-destroyed
* object.
*/
class DanglingPointerException: public std::exception {
const char* explain;
public:
DanglingPointerException (const char* explanation)
: explain(explanation) {}
virtual const char* what() const throw()
{
return explain;
}
};
MemoryChecked () : hasBeenDestroyed(false) { ++numObjects; }
MemoryChecked (const MemoryChecked& c);
MemoryChecked& operator= (const MemoryChecked& rhs);
virtual ~MemoryChecked() noexcept(false);
/**
* How many checked objects have been created but not yet
* destroyed?
*/
static int getCurrentCount() {return numObjects;}
/**
* Have we detected any attempts to manipulate objects via
* dangling pointers?
*/
static bool danglingPointersDetected() {return memoryViolationDetected;}
/**
* This is intended only for use when unit testing
* the MemoryChecked class itself.
*/
static void resetMemoryChecks();
};
#endif /* MEMORYCHECKED_H_ */
printSchedule.cpp
#include
#include
#include
#include
#include “department.h”
#include “faculty.h”
#include “section.h”
#include “csv.h”
using namespace std;
void readSchedule(Department& dept, istream &input)
{
string line;
getline(input, line); // ignore first line (headers)
while (getline(input, line))
{
auto fields = parseCSV(line);
assert(fields.size() == 8);
int crn = stoi(fields[0]);
string name = fields[1] + fields[2];
string title = fields[3];
int credits = stoi(fields[4]);
string time = fields[5];
string days = fields[6];
string instructor = fields[7];
Section section(crn, name, title, credits, days, time);
Faculty &facultyMember = dept.findFaculty(instructor);
facultyMember.add(section);
}
}
void printSchedule (Department& dept, ostream& output)
{
output << "Schedule" << endl;
for (int iFac = 0; iFac < dept.numFaculty(); ++iFac)
{
const Faculty& fac = dept.get(iFac);
output << fac.getName() << endl;
int sectionCount = 0;
for (const Section& sect: fac)
{
output << " " << sect << endl;
++sectionCount;
}
output << " " << sectionCount << " sections" << endl;
}
}
void doMain (istream& in)
{
Department dept;
readSchedule (dept, in);
printSchedule (dept, cout);
}
int main (int argc, char** argv)
{
if (argc > 1)
{
ifstream in (argv[1]);
doMain (in);
} else {
doMain (cin);
}
if (MemoryChecked::getCurrentCount() > 0)
{
cout << "Memory leak detected: " << MemoryChecked::getCurrentCount()
<< " unrecovered objects." << endl;
}
return 0;
}
schedule_long.csv
CRN SUBJ CRSE TITLE CR HRS TIME DAYS INSTRUCTOR
11592 CS 120G INTRO INFO LITERACY & RESEARCH 3 420- 535PM MW ZEHRA,S
11594 CS 120G INTRO INFORMATION LIT RECITATI 0 1100-1150AM W GUPTA,R
11595 CS 120G INTRO INFORMATION LIT RECITATI 0 300- 350PM M ZEHRA,S
11762 CS 120G INTRO INFORMATION LIT RECITATI 0 420- 510PM T ZEHRA,S
13585 CS 120G INTRO INFO LITERACY & RSCH (A) 3 HOURS ARR GUPTA,R
13586 CS 120G INTRO INFO LITERACY & RSCH (A) 3 HOURS ARR GUPTA,R
13587 CS 120G INTRO INFO LITERACY & RSCH (A) 3 HOURS ARR GUPTA,R
13588 CS 120G INTRO INFO LIT & RSCH REC (A) 0 545- 635PM T GUPTA,R
13591 CS 120G INTRO INFO LIT & RSCH REC (A) 0 545- 635PM T GUPTA,R
13592 CS 120G INTRO INFO LIT & RSCH REC (A) 0 545- 635PM T GUPTA,R
13593 CS 120G INTRO INFO LIT & RSCH REC (A) 0 545- 635PM R GUPTA,R
13594 CS 120G INTRO INFO LIT & RSCH REC (A) 0 545- 635PM R GUPTA,R
13595 CS 120G INTRO INFO LIT & RSCH REC (A) 0 545- 635PM R GUPTA,R
13598 CS 120G INTRO INFO LITERACY & RSCH (B) 3 HOURS ARR SYMPSON,W
13602 CS 120G INTRO INFO LITERACY & RSCH (B) 3 HOURS ARR SYMPSON,W
13603 CS 120G INTRO INFO LIT & RSCH REC (B) 0 710- 800PM T SYMPSON,W
13605 CS 120G INTRO INFO LIT & RSCH REC (B) 0 710- 800PM T SYMPSON,W
13606 CS 120G INTRO INFO LIT & RSCH REC (B) 0 710- 800PM W SYMPSON,W
13608 CS 120G INTRO INFO LIT & RSCH REC (B) 0 710- 800PM W SYMPSON,W
16847 CS 120G INTRO INFO LIT & RSCH REC (A) 0 545- 635PM R GUPTA,R
18910 CS 120G INTRO INFO LITERACY & RESEARCH 3 HOURS ARR ZEHRA,S
18911 CS 120G INTRO INFO LITERACY & RESEARCH 3 HOURS ARR ZEHRA,S
18912 CS 120G INTRO INFO LITERACY & RESEARCH 3 HOURS ARR ZEHRA,S
18914 CS 120G INTRO INFO LIT & RSCH REC (C) 0 545- 635PM W ZEHRA,S
18915 CS 120G INTRO INFO LIT & RSCH REC (C) 0 545- 635PM W ZEHRA,S
18916 CS 120G INTRO INFO LIT & RSCH REC (C) 0 545- 635PM W ZEHRA,S
18917 CS 120G INTRO INFO LIT & RSCH REC (C) 0 900- 950AM F ZEHRA,S
18919 CS 120G INTRO INFO LIT & RSCH REC (C) 0 900- 950AM F GUPTA,R
18920 CS 120G INTRO INFO LIT & RSCH REC (C) 0 900- 950AM F ZEHRA,S
23609 CS 120G INTRO INFO LITERACY & RESEARCH 0 1100-1150AM W GUPTA,R
11596 CS 121G INTRO INFO LIT & RSCH FOR SCI 3 710- 825PM MW GUPTA,R
11612 CS 121G INTRO INFO LIT-SCI RECITATION 0 900- 950AM W GUPTA,R
11613 CS 121G INTRO INFO LIT-SCI RECITATION 0 1000-1050AM W GUPTA,R
11791 CS 121G INTRO INFO LIT & RSCH FOR SCI 3 545- 700PM MW GUPTA,R
11792 CS 121G INTRO INFO LIT-SCI RECITATION 0 930-1020AM T GUPTA,R
11793 CS 121G INTRO INFO LIT-SCI RECITATION 0 900- 950AM M GUPTA,R
11915 CS 121G INTRO INFO LIT-SCI RECITATION 0 1100-1150AM M GUPTA,R
12230 CS 121G INTRO INFO LIT-SCI RECITATION 0 545- 635PM F GUPTA,R
13609 CS 121G INTRO INFO LIT & RSCH SCI (C) 3 HOURS ARR GUPTA,R
13610 CS 121G INTRO INFO LIT & RSCH SCI (C) 3 HOURS ARR GUPTA,R
13611 CS 121G INTRO INFO LIT & RSCH SCI (C) 3 HOURS ARR GUPTA,R
13612 CS 121G INTRO INFO LIT & RSCH REC (C) 0 810- 900PM T GUPTA,R
13613 CS 121G INTRO INFO LIT & RSCH REC (C) 0 810- 900PM T GUPTA,R
13614 CS 121G INTRO INFO LIT & RSCH REC (C) 0 810- 900PM T GUPTA,R
13615 CS 121G INTRO INFO LIT & RSCH REC (C) 0 810- 900PM R GUPTA,R
13616 CS 121G INTRO INFO LIT & RSCH REC (C) 0 810- 900PM R GUPTA,R
13617 CS 121G INTRO INFO LIT & RSCH REC (C) 0 810- 900PM R GUPTA,R
13648 CS 121G INTRO INFO LIT & RSCH SCI (D) 3 HOURS ARR SYMPSON,W
13654 CS 121G INTRO INFO LIT & RSCH SCI (D) 3 HOURS ARR SYMPSON,W
13657 CS 121G INTRO INFO LIT & RSCH REC (D) 0 1200-1250PM M STAFF
13661 CS 121G INTRO INFO LIT & RSCH REC (D) 0 1200-1250PM M STAFF
13666 CS 121G INTRO INFO LIT & RSCH REC (D) 0 1200-1250PM W STAFF
13668 CS 121G INTRO INFO LIT & RSCH REC (D) 0 1200-1250PM W STAFF
13751 CS 121G INTRO INFO LIT & RSCH SCI (E) 3 HOURS ARR GUPTA,A
13752 CS 121G INTRO INFO LIT & RSCH SCI (E) 3 HOURS ARR GUPTA,A
13753 CS 121G INTRO INFO LIT & RSCH SCI (E) 3 HOURS ARR GUPTA,A
13754 CS 121G INTRO INFO LIT & RSCH REC (E) 0 545- 635PM T GUPTA,A
13755 CS 121G INTRO INFO LIT & RSCH REC (E) 0 545- 635PM T GUPTA,A
13756 CS 121G INTRO INFO LIT & RSCH REC (E) 0 545- 635PM T GUPTA,A
13757 CS 121G INTRO INFO LIT & RSCH REC (E) 0 545- 635PM R GUPTA,A
13758 CS 121G INTRO INFO LIT & RSCH REC (E) 0 545- 635PM R GUPTA,A
13759 CS 121G INTRO INFO LIT & RSCH REC (E) 0 545- 635PM R GUPTA,A
16740 CS 121G INTRO INFO LIT & RSCH SCI (E) 3 HOURS ARR GUPTA,A
16741 CS 121G INTRO INFO LIT & RSCH REC (E) 0 545- 635PM T GUPTA,A
16742 CS 121G INTRO INFO LIT & RSCH REC (E) 0 545- 635PM R GUPTA,A
16851 CS 121G INTRO INFO LIT & RSCH SCI (C) 3 HOURS ARR GUPTA,R
16852 CS 121G INTRO INFO LIT & RSCH REC (C) 0 810- 900PM T GUPTA,R
16853 CS 121G INTRO INFO LIT & RSCH REC (C) 0 810- 900PM R GUPTA,R
23619 CS 121G INTRO INFO LIT & RSCH FOR SCI 3 710- 825PM MW GUPTA,R
23621 CS 121G INTRO INFO LIT-SCI RECITATION 0 900- 950AM W GUPTA,R
23622 CS 121G INTRO INFO LIT-SCI RECITATION 0 1000-1050AM W GUPTA,R
23624 CS 121G INTRO INFO LIT-SCI RECITATION 0 930-1020AM T GUPTA,R
23625 CS 121G INTRO INFO LIT-SCI RECITATION 0 900- 950AM M GUPTA,R
23626 CS 121G INTRO INFO LIT-SCI RECITATION 0 1100-1150AM M GUPTA,R
23627 CS 121G INTRO INFO LIT-SCI RECITATION 0 545- 635PM F GUPTA,R
15892 CS 129 TCCK-PBLM SOLVING & PRGMNG I 4 HOURS ARR STAFF
18918 CS 129 TNCC-INTRO TO COMPUTER SCIENCE 3 HOURS ARR STAFF
20679 CS 129 TCCV-C++ PROGRAMMING I 4 HOURS ARR STAFF
10253 CS 150 PROBLEM SOLVING & PRGMNG I 4 300- 415PM TR IBRAHIM,S
10254 CS 150 PROBLEM SOLVING & PRGMNG I 4 420- 535PM TR POURSARDAR,F
10255 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 710- 950PM T IBRAHIM,S
10256 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 900-1130AM W IBRAHIM,S
10257 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 1200- 230PM W IBRAHIM,S
10258 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 300- 530PM W IBRAHIM,S
10259 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 710- 940PM T IBRAHIM,S
10260 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 930-1200PM R IBRAHIM,S
11351 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 710- 940PM T IBRAHIM,S
11390 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 1000-1050AM M IBRAHIM,S
11391 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 1100-1150AM M IBRAHIM,S
11392 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 100- 150PM M IBRAHIM,S
11393 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 810- 900PM W IBRAHIM,S
11394 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 930-1020AM T IBRAHIM,S
11395 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 1100-1150AM T IBRAHIM,S
11396 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 810- 900PM W IBRAHIM,S
11397 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 1230- 120PM F IBRAHIM,S
12052 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 130- 400PM F IBRAHIM,S
13184 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 800-1030AM R IBRAHIM,S
19317 CS 150 PROBLEM SOLVING & PRGMNG I 4 HOURS ARR IBRAHIM,S
19318 CS 150 PROBLEM SOLVING & PRGMNG I 4 HOURS ARR IBRAHIM,S
19319 CS 150 PROBLEM SOLVING & PRGMNG I 4 HOURS ARR IBRAHIM,S
19320 CS 150 PROBLEM SOLVING & PRGMNG I 4 HOURS ARR IBRAHIM,S
19322 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 420- 700PM W IBRAHIM,S
19324 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 420- 700PM W IBRAHIM,S
19325 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 420- 700PM W IBRAHIM,S
19326 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 420- 700PM W IBRAHIM,S
19327 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 710- 800PM W IBRAHIM,S
19329 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 710- 800PM W IBRAHIM,S
19330 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 710- 800PM W IBRAHIM,S
19331 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 710- 800PM W IBRAHIM,S
21487 CS 150 PROBLEM SOLVING & PRGMNG I 4 HOURS ARR IBRAHIM,S
21488 CS 150 PROBLEM SOLVING & PRGMNG I 4 HOURS ARR IBRAHIM,S
21489 CS 150 PROBLEM SOLVING & PRGMNG I 4 HOURS ARR IBRAHIM,S
21490 CS 150 PROBLEM SOLVING & PRGMNG I 4 HOURS ARR IBRAHIM,S
21491 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 210- 440PM M IBRAHIM,S
21492 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 210- 440PM M IBRAHIM,S
21493 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 210- 440PM M IBRAHIM,S
21496 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 HOURS ARR IBRAHIM,S
21501 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 1100-1150AM M IBRAHIM,S
21502 CS 150 PROBLEM SOLVING & PRGMNG I 0 1100-1150AM M IBRAHIM,S
21503 CS 150 PROBLEM SOLVING & PRGMNG I 0 1100-1150AM M IBRAHIM,S
21506 CS 150 PROBLEM SOLVING & PRGMNG I 0 1100-1150AM M IBRAHIM,S
22422 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 710- 950PM M IBRAHIM,S
22423 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 710- 950PM M IBRAHIM,S
22424 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 710- 950PM M IBRAHIM,S
22425 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 610- 700PM T IBRAHIM,S
22426 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 610- 700PM T IBRAHIM,S
22427 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 610- 700PM T IBRAHIM,S
23628 CS 150 PROBLEM SOLVING & PRGMNG I 4 300- 415PM TR IBRAHIM,S
23632 CS 150 PROBLEM SOLVING & PRGMNG I 4 420- 535PM TR POURSARDAR,F
23636 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 710- 950PM T IBRAHIM,S
23637 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 900-1130AM W IBRAHIM,S
23639 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 1200- 230PM W IBRAHIM,S
23641 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 300- 530PM W IBRAHIM,S
23642 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 930-1200PM R IBRAHIM,S
23644 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 1000-1050AM M IBRAHIM,S
23645 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 1100-1150AM M IBRAHIM,S
23646 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 100- 150PM M IBRAHIM,S
23657 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 930-1020AM T IBRAHIM,S
23720 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 1100-1150AM T IBRAHIM,S
23721 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 1230- 120PM F IBRAHIM,S
23722 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 130- 400PM F IBRAHIM,S
23729 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 800-1030AM R IBRAHIM,S
24823 CS 150 PROBLEM SOLVING & PRGMNG I 4 300- 415PM TR IBRAHIM,S
24824 CS 150 PROBLEM SOLVING & PRGMNG I 0 900- 950AM M IBRAHIM,S
24825 CS 150 PROBLEM SOLVING & PRGMNG I 4 420- 535PM TR POURSARDAR,F
24826 CS 150 PROBLEM SOLVING & PRGMNG I 0 900- 950AM M IBRAHIM,S
24828 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 710- 950PM T IBRAHIM,S
24829 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 900-1130AM W IBRAHIM,S
24830 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 1200- 230PM W IBRAHIM,S
24831 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 300- 530PM W IBRAHIM,S
24832 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 930-1200PM R IBRAHIM,S
24833 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 130- 400PM F IBRAHIM,S
24834 CS 150 PROBLEM SOLVING & PRGMNG I LAB 0 800-1030AM R IBRAHIM,S
24835 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 1000-1050AM M IBRAHIM,S
24836 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 1100-1150AM M IBRAHIM,S
24837 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 930-1020AM T IBRAHIM,S
24838 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 1100-1150AM T IBRAHIM,S
24839 CS 150 PROBLEM SOLVING & PRGMNG I REC 0 1230- 120PM F IBRAHIM,S
24852 CS 150 PROBLEM SOLVING & PRGMNG I 4 300- 415PM TR IBRAHIM,S
14083 CS 170 INTRO COMPUTER ARCHITECTURE I 3 300- 415PM MW LI,Y
17929 CS 170 INTRO COMPUTER ARCHITECTURE I 3 545- 700PM MW DECKER,L
23730 CS 170 INTRO COMPUTER ARCHITECTURE I 3 545- 700PM MW DECKER,L
20827 CS 229 TNCC-PROBLEM SOLVING &PRGM 4 HOURS ARR STAFF
10245 CS 250 PROBLEM SOLVING & PROGRMNG II 4 800- 915AM TR POURSARDAR,F
10246 CS 250 PROBLEM SOLVNG & PRGMNG II LAB 0 420- 650PM R EL MESALAMI,A
10247 CS 250 PROBLEM SOLVNG & PRGMNG II LAB 0 130- 400PM T EL MESALAMI,A
11398 CS 250 PROB SOLVING & PROGRMNG II REC 0 440- 530PM M EL MESALAMI,A
11399 CS 250 PROB SOLVING & PROGRMNG II REC 0 545- 635PM M EL MESALAMI,A
12022 CS 250 PROBLEM SOLVING & PROGRMNG II 4 930-1045AM TR POURSARDAR,F
12023 CS 250 PROBLEM SOLVNG & PRGMNG II LAB 0 420- 650PM T EL MESALAMI,A
12231 CS 250 PROB SOLVING & PROGRMNG II REC 0 1200-1250PM M EL MESALAMI,A
12232 CS 250 PROBLEM SOLVNG & PRGMNG II LAB 0 130- 410PM R EL MESALAMI,A
12626 CS 250 PROBLEM SOLVING & PROGRMNG II 4 930-1200PM S MORRIS,J
12627 CS 250 PROBLEM SOLVNG & PRGMNG II LAB 0 100- 330PM S MORRIS,J
12628 CS 250 PROB SOLVING & PROGRMNG II REC 0 345- 435PM S MORRIS,J
16477 CS 250 PROBLEM SOLVING & PROGRMNG II 4 HOURS ARR EL MESALAMI,A
16478 CS 250 PROBLEM SOLVING & PROGRMNG II 4 HOURS ARR EL MESALAMI,A
16479 CS 250 PROBLEM SOLVING & PROGRMNG II 4 HOURS ARR EL MESALAMI,A
16480 CS 250 PROBLEM SOLVING & PRGMG II LAB 0 710- 950PM M EL MESALAMI,A
16481 CS 250 PROBLEM SOLVING & PRGMG II LAB 0 710- 950PM M EL MESALAMI,A
16482 CS 250 PROBLEM SOLVING & PRGMG II REC 0 710- 800PM F EL MESALAMI,A
16483 CS 250 PROBLEM SOLVING & PRGMG II REC 0 710- 800PM F EL MESALAMI,A
16779 CS 250 PROBLEM SOLVING & PROGRMNG II 4 HOURS ARR EL MESALAMI,A
17852 CS 250 PROBLEM SOLVING & PRGMG II LAB 0 710- 950PM M EL MESALAMI,A
17853 CS 250 PROBLEM SOLVING & PRGMG II LAB 0 710- 950PM M EL MESALAMI,A
17854 CS 250 PROBLEM SOLVING & PRGMG II REC 0 710- 800PM F EL MESALAMI,A
17855 CS 250 PROBLEM SOLVING & PRGMG II REC 0 710- 800PM F EL MESALAMI,A
17856 CS 250 PROBLEM SOLVING & PRGMG II REC 0 610- 700PM R EL MESALAMI,A
17857 CS 250 PROBLEM SOLVING & PRGMG II REC 0 610- 700PM R EL MESALAMI,A
17858 CS 250 PROBLEM SOLVING & PRGMG II REC 0 610- 700PM R EL MESALAMI,A
17859 CS 250 PROBLEM SOLVING & PRGMG II REC 0 610- 700PM R EL MESALAMI,A
21512 CS 250 PROBLEM SOLVING & PROGRMNG II 4 HOURS ARR EL MESALAMI,A
21514 CS 250 PROBLEM SOLVING & PROGRMNG II 4 HOURS ARR EL MESALAMI,A
21515 CS 250 PROBLEM SOLVING & PROGRMNG II 4 HOURS ARR EL MESALAMI,A
21519 CS 250 PROBLEM SOLVING & PROGRMNG II 4 HOURS ARR EL MESALAMI,A
21520 CS 250 PROB SOL & PROG II LAB 0 710- 950PM R EL MESALAMI,A
21531 CS 250 PROB SOL & PROGR II LAB 0 710- 950PM R EL MESALAMI,A
21532 CS 250 PROBLEM SOLVING & PRGMG II LAB 0 710- 950PM R EL MESALAMI,A
21533 CS 250 PROB SOL & PROG II LAB 0 710- 950PM R EL MESALAMI,A
21534 CS 250 PROBLEM SOLVING & PRGMG II REC 0 710- 800PM W EL MESALAMI,A
21535 CS 250 PROBLEM SOLVING & PRGMG II REC 0 710- 800PM W EL MESALAMI,A
21536 CS 250 PROBLEM SOLVING & PRGMG II REC 0 710- 800PM W EL MESALAMI,A
21537 CS 250 PROBLEM SOLVING & PRGMG II REC 0 710- 800PM W EL MESALAMI,A
21538 CS 250 PROB SOL & PROG II LAB 0 200- 430PM F EL MESALAMI,A
21539 CS 250 PROB SOL & PROG II LAB 0 200- 430PM F EL MESALAMI,A
21540 CS 250 PROBLEM SOLVING & PRGMG II LAB 0 200- 430PM F EL MESALAMI,A
21541 CS 250 PROB SOL & PROG II LAB 0 200- 430PM F EL MESALAMI,A
23731 CS 250 PROBLEM SOLVING & PROGRMNG II 4 800- 915AM TR POURSARDAR,F
23734 CS 250 PROBLEM SOLVNG & PRGMNG II LAB 0 130- 410PM T EL MESALAMI,A
23735 CS 250 PROB SOLVING & PROGRMNG II REC 0 545- 635PM M EL MESALAMI,A
23736 CS 250 PROBLEM SOLVNG & PRGMNG II LAB 0 420- 650PM T EL MESALAMI,A
23737 CS 250 PROB SOLVING & PROGRMNG II REC 0 1200-1250PM M EL MESALAMI,A
23738 CS 250 PROBLEM SOLVNG & PRGMNG II LAB 0 130- 410PM R EL MESALAMI,A
23739 CS 250 PROBLEM SOLVING & PROGRMNG II 4 930-1200PM S POURSARDAR,F
23740 CS 250 PROBLEM SOLVNG & PRGMNG II LAB 0 100- 330PM S MORRIS,J
23741 CS 250 PROB SOLVING & PROGRMNG II REC 0 345- 435PM S MORRIS,J
24385 CS 250 PROBLEM SOLVNG & PRGMNG II LAB 0 420- 650PM R EL MESALAMI,A
24386 CS 250 PROB SOLVING & PROGRMNG II REC 0 440- 530PM M EL MESALAMI,A
24812 CS 250 PROBLEM SOLVNG & PRGMNG II LAB 0 420- 650PM T EL MESALAMI,A
24813 CS 250 PROBLEM SOLVNG & PRGMNG II LAB 0 420- 650PM T EL MESALAMI,A
13785 CS 252 INTRO TO UNIX FOR PROGRAMMERS 1 HOURS ARR ZEIL,S
13786 CS 252 INTRO TO UNIX FOR PROGRAMMERS 1 HOURS ARR ZEIL,S
13787 CS 252 INTRO TO UNIX FOR PROGRAMMERS 1 HOURS ARR ZEIL,S
16781 CS 252 INTRO TO UNIX FOR PROGRAMMERS 1 HOURS ARR ZEIL,S
11400 CS 270 INTRO COMPUTER ARCHITECTURE II 3 900- 950AM MWF ZEHRA,S
23742 CS 270 INTRO COMPUTER ARCHITECTURE II 3 900- 950AM MWF ZEHRA,S
13788 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR GUPTA,R
13789 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR GUPTA,R
13790 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR GUPTA,R
13791 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR OLARIU,S
13792 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR OLARIU,S
13793 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR OLARIU,S
13794 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR GUPTA,R
13796 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR GUPTA,R
13797 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR GUPTA,R
13798 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR DECKER,L
16743 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR DECKER,L
16744 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR OLARIU,S
16745 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR GUPTA,R
17670 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR CHERNIKOV,A
17671 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR CHERNIKOV,A
17672 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR CHERNIKOV,A
24857 CS 300T COMPUTERS IN SOCIETY 3 HOURS ARR DECKER,L
16490 CS 312 INTERNET CONCEPTS 3 1100-1215PM TR WEIGLE,M
16491 CS 312 INTERNET CONCEPTS 3 1100-1215PM TR WEIGLE,M
16492 CS 312 INTERNET CONCEPTS 3 1100-1215PM TR WEIGLE,M
16493 CS 312 INTERNET CONCEPTS 3 1100-1215PM TR WEIGLE,M
16494 CS 312 INTERNET CONCEPTS 3 1100-1215PM TR WEIGLE,M
16786 CS 312 INTERNET CONCEPTS 3 1100-1215PM TR WEIGLE,M
13809 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 HOURS ARR KENNEDY,T
13810 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 HOURS ARR KENNEDY,T
13811 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 HOURS ARR KENNEDY,T
16388 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 1100-1215PM TR KENNEDY,T
16791 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 HOURS ARR KENNEDY,T
20654 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 HOURS ARR KENNEDY,T
20655 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 HOURS ARR KENNEDY,T
20656 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 HOURS ARR KENNEDY,T
15408 CS 334 COMPUTER ARCHITECTURE FNDMNTLS 4 100- 215PM F ZHAO,D
15409 CS 334 COMPUTER ARCHITECTURE FNDMNTLS 4 100- 215PM F ZHAO,D
15410 CS 334 COMPUTER ARCHITECTURE FNDMNTLS 4 100- 215PM F ZHAO,D
16794 CS 334 COMPUTER ARCHITECTURE FNDMNTLS 4 100- 215PM F ZHAO,D
14084 CS 350 INTRO TO SOFTWARE ENGINEERING 3 200- 250PM MWF ZEIL,S
15803 CS 350 INTRO TO SOFTWARE ENGINEERING 3 HOURS ARR MORRIS,J
15804 CS 350 INTRO TO SOFTWARE ENGINEERING 3 HOURS ARR MORRIS,J
15805 CS 350 INTRO TO SOFTWARE ENGINEERING 3 HOURS ARR MORRIS,J
15806 CS 350 INTR TO SOFTWARE ENGINEER REC 0 300- 500PM W MORRIS,J
15807 CS 350 INTR TO SOFTWARE ENGINEER REC 0 300- 500PM W MORRIS,J
15808 CS 350 INTR TO SOFTWARE ENGINEER REC 0 300- 500PM W MORRIS,J
15809 CS 350 INTR TO SOFTWARE ENGINEER REC 0 710- 910PM W MORRIS,J
15810 CS 350 INTR TO SOFTWARE ENGINEER REC 0 710- 910PM W MORRIS,J
15811 CS 350 INTR TO SOFTWARE ENGINEER REC 0 710- 910PM W MORRIS,J
16795 CS 350 INTRO TO SOFTWARE ENGINEERING 3 HOURS ARR MORRIS,J
16798 CS 350 INTR TO SOFTWARE ENGINEER REC 0 300- 500PM W MORRIS,J
16803 CS 350 INTR TO SOFTWARE ENGINEER REC 0 710- 910PM W MORRIS,J
17931 CS 350 INTR TO SOFTWARE ENGINEER REC 0 710- 910PM T ZEIL,S
17932 CS 350 INTRO TO SOFTWARE ENGINEERING 0 300- 500PM T ZEIL,S
23586 CS 350 INTRO TO SOFTWARE ENGINEERING 3 200- 250PM MWF ZEIL,S
23587 CS 350 INTR TO SOFTWARE ENGINEER REC 0 710- 910PM T ZEIL,S
23588 CS 350 INTRO TO SOFTWARE ENGINEERING 0 300- 500PM T ZEIL,S
11917 CS 355 PRINCIP-PROGRAMMING LANGUAGES 3 1200-1250PM MWF CHERNIKOV,A
21466 CS 355 PRINCIP-PROGRAMMING LANGUAGES 3 930-1045AM MW PRICE,G
21469 CS 355 PRINCIP-PROGRAMMING LANGUAGES 3 930-1045AM MW PRICE,G
21474 CS 355 PRINCIP-PROGRAMMING LANGUAGES 3 930-1045AM MW PRICE,G
21476 CS 355 PRINCIP-PROGRAMMING LANGUAGES 3 930-1045AM MW PRICE,G
23744 CS 355 PRINCIP-PROGRAMMING LANGUAGES 3 1200-1250PM MWF MORRIS,J
10355 CS 361 DATA STRUCTURES/ALGORITHMS 3 100- 150PM MWF MORRIS,J
16003 CS 361 DATA STRUCTURES/ALGORITHMS 3 HOURS ARR SUN,J
16004 CS 361 DATA STRUCTURES/ALGORITHMS 3 HOURS ARR SUN,J
16005 CS 361 DATA STRUCTURES/ALGORITHMS 3 HOURS ARR SUN,J
16804 CS 361 DATA STRUCTURES/ALGORITHMS 3 HOURS ARR WANG,F
17444 CS 361 DATA STRUCTURES/ALGORITHMS 3 HOURS ARR WANG,F
17445 CS 361 DATA STRUCTURES/ALGORITHMS 3 HOURS ARR WANG,F
17627 CS 361 DATA STRUCTURES/ALGORITHMS 3 HOURS ARR WANG,F
24801 CS 361 DATA STRUCTURES/ALGORITHMS 3 100- 150PM MWF MORRIS,J
10240 CS 367 COOPERATIVE EDUCATION 3 HOURS ARR BRUNELLE,J
15596 CS 367 COOPERATIVE EDUCATION 3 HOURS ARR BRUNELLE,J
10241 CS 368 COMPUTER SCIENCE INTERNSHIP 3 HOURS ARR BRUNELLE,J
15597 CS 368 COMPUTER SCIENCE INTERNSHIP 3 HOURS ARR BRUNELLE,J
22773 CS 368 COMPUTER SCIENCE INTERNSHIP 3 HOURS ARR BRUNELLE,J
22774 CS 368 COMPUTER SCIENCE INTERNSHIP 3 HOURS ARR BRUNELLE,J
10243 CS 381 INTRO TO DISCRETE STRUCTURES 3 300- 415PM W HE,J
13863 CS 381 INTRO TO DISCRETE STRUCTURES 3 HOURS ARR EL MESALAMI,A
13864 CS 381 INTRO TO DISCRETE STRUCTURES 3 HOURS ARR EL MESALAMI,A
13866 CS 381 INTRO TO DISCRETE STRUCTURES 3 HOURS ARR EL MESALAMI,A
16820 CS 381 INTRO TO DISCRETE STRUCTURES 3 HOURS ARR EL MESALAMI,A
22022 CS 381 INTRO TO DISCRETE STRUCTURES 3 HOURS ARR HE,J
22023 CS 381 INTRO TO DISCRETE STRUCTURES 3 HOURS ARR HE,J
22024 CS 381 INTRO TO DISCRETE STRUCTURES 3 HOURS ARR HE,J
22025 CS 381 INTRO TO DISCRETE STRUCTURES 3 HOURS ARR HE,J
13867 CS 382 INTRODUCTION TO JAVA 1 HOURS ARR ZEIL,S
13869 CS 382 INTRODUCTION TO JAVA 1 HOURS ARR ZEIL,S
13871 CS 382 INTRODUCTION TO JAVA 1 HOURS ARR ZEIL,S
16822 CS 382 INTRODUCTION TO JAVA 1 HOURS ARR ZEIL,S
10244 CS 390 INTRO-THEORETICAL COMPUTER SCI 3 1000-1050AM MWF RANJAN,D
20241 CS 390 INTRO-THEORETICAL COMPUTER SCI 3 HOURS ARR RANJAN,D
20242 CS 390 INTRO-THEORETICAL COMPUTER SCI 3 HOURS ARR RANJAN,D
20243 CS 390 INTRO-THEORETICAL COMPUTER SCI 3 HOURS ARR RANJAN,D
23745 CS 390 INTRO-THEORETICAL COMPUTER SCI 3 1000-1050AM MWF RANJAN,D
12391 CS 410 PROF WORKFORCE DEV 1 (LECT) 3 HOURS ARR PRICE,G
12392 CS 410 PROF WORKFORCE DEV I (REC) 0 100- 250PM W PRICE,G
13566 CS 410 PROFESSIONAL WORKFORCE DEV I 3 HOURS ARR BRUNELLE,J
13567 CS 410 PROFESSIONAL WORKFORCE DEV I 3 HOURS ARR BRUNELLE,J
13568 CS 410 PROFESSIONAL WORKFORCE DEV I 3 HOURS ARR BRUNELLE,J
13569 CS 410 PROFESSION WORKFORCE DEV I REC 0 100- 250PM R BRUNELLE,J
13570 CS 410 PROFESSION WORKFORCE DEV I REC 0 100- 250PM R BRUNELLE,J
13571 CS 410 PROFESSION WORKFORCE DEV I REC 0 100- 250PM R BRUNELLE,J
13572 CS 410 PROFESSION WORKFORCE DEV I REC 0 100- 250PM R BRUNELLE,J
14973 CS 410 PROFESSION WORKFORCE DEV I REC 0 100- 250PM R BRUNELLE,J
14974 CS 410 PROFESSION WORKFORCE DEV I REC 0 100- 250PM R BRUNELLE,J
14975 CS 410 PROFESSION WORKFORCE DEV I REC 0 100- 250PM R BRUNELLE,J
15478 CS 410 PROFESSIONAL WORKFORCE DEV I 3 HOURS ARR KENNEDY,T
15479 CS 410 PROFESSIONAL WORKFORCE DEV I 3 HOURS ARR KENNEDY,T
15480 CS 410 PROFESSIONAL WORKFORCE DEV I 3 HOURS ARR KENNEDY,T
15481 CS 410 PROFESSION WORKFORCE DEV I REC 0 1100-1250PM W KENNEDY,T
15482 CS 410 PROFESSION WORKFORCE DEV I REC 0 1100-1250PM W KENNEDY,T
15483 CS 410 PROFESSION WORKFORCE DEV I REC 0 1100-1250PM W KENNEDY,T
15484 CS 410 PROFESSION WORKFORCE DEV I REC 0 1100-1250PM W KENNEDY,T
16824 CS 410 PROFESSIONAL WORKFORCE DEV I 3 HOURS ARR BRUNELLE,J
16825 CS 410 PROFESSION WORKFORCE DEV I REC 0 100- 250PM R BRUNELLE,J
16826 CS 410 PROFESSIONAL WORKFORCE DEV I 3 HOURS ARR KENNEDY,T
16835 CS 410 PROFESSION WORKFORCE DEV I REC 0 1100-1250PM W KENNEDY,T
20111 CS 410 PROFESSIONAL WORKFORCE DEV I 3 HOURS ARR GUPTA,A
20112 CS 410 PROFESSIONAL WORKFORCE DEV I 3 HOURS ARR GUPTA,A
20113 CS 410 PROFESSIONAL WORKFORCE DEV I 3 HOURS ARR GUPTA,A
20114 CS 410 PROFESSIONAL WORKFORCE DEV I 0 800- 950AM R GUPTA,A
20115 CS 410 PROFESSIONAL WORKFORCE DEV I 0 800- 950AM R GUPTA,A
20116 CS 410 PROFESSIONAL WORKFORCE DEV I 0 800- 950AM R GUPTA,A
20117 CS 410 PROFESSIONAL WORKFORCE DEV I 0 800- 950AM R GUPTA,A
23746 CS 410 PROF WORKFORCE DEV 1 (LECT) 3 HOURS ARR PRICE,G
23747 CS 410 PROF WORKFORCE DEV I (REC) 0 100- 250PM W PRICE,G
13547 CS 411W PROFESSIONAL WORKFORCE DEV II 3 HOURS ARR BRUNELLE,J
13548 CS 411W PROFESSIONAL WORKFORCE DEV II 3 HOURS ARR BRUNELLE,J
13549 CS 411W PROFESSIONAL WORKFORCE DEV II 3 HOURS ARR BRUNELLE,J
13550 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1100-1150AM M BRUNELLE,J
13551 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1100-1150AM M BRUNELLE,J
13552 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1100-1150AM M BRUNELLE,J
13553 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1100-1150AM M BRUNELLE,J
13554 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1200-1250PM M BRUNELLE,J
13555 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1200-1250PM M BRUNELLE,J
13556 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1200-1250PM M BRUNELLE,J
13557 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1200-1250PM M BRUNELLE,J
14085 CS 411W PROFESSIONAL WORKFORCE DEV II 3 HOURS ARR PRICE,G
14086 CS 411W PROFESSIONAL WRKFRC DEV II REC 0 300- 450PM W PRICE,G
14970 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1100-1150AM M BRUNELLE,J
14971 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1100-1150AM M BRUNELLE,J
14972 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1100-1150AM M BRUNELLE,J
14976 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1200-1250PM M BRUNELLE,J
14977 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1200-1250PM M BRUNELLE,J
14978 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1200-1250PM M BRUNELLE,J
14979 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1100-1150AM T BRUNELLE,J
14980 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1100-1150AM T BRUNELLE,J
14981 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1100-1150AM T BRUNELLE,J
16497 CS 411W PROFESSIONAL WORKFORCE DEV II 3 HOURS ARR BRUNELLE,J
16498 CS 411W PROFESSIONAL WORKFORCE DEV II 3 HOURS ARR BRUNELLE,J
16499 CS 411W PROFESSIONAL WORKFORCE DEV II 3 HOURS ARR BRUNELLE,J
16500 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1000-1050AM T BRUNELLE,J
16501 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1000-1050AM T BRUNELLE,J
16502 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1000-1050AM T BRUNELLE,J
16503 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1000-1050AM T BRUNELLE,J
16504 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1000-1050AM T BRUNELLE,J
16505 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1000-1050AM T BRUNELLE,J
16506 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1000-1050AM T BRUNELLE,J
16507 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1000-1050AM R BRUNELLE,J
16508 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1000-1050AM R BRUNELLE,J
16509 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1000-1050AM R BRUNELLE,J
16510 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1000-1050AM R BRUNELLE,J
16511 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1000-1050AM R BRUNELLE,J
16512 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1000-1050AM R BRUNELLE,J
16513 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1000-1050AM R BRUNELLE,J
16749 CS 411W PROFESSIONAL WORKFORCE DEV II 3 HOURS ARR BRUNELLE,J
16750 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1100-1150AM M BRUNELLE,J
16753 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1200-1250PM M BRUNELLE,J
16755 CS 411W PROFESSIONAL WORKFORCE DEV II 3 HOURS ARR BRUNELLE,J
16759 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1000-1050AM TR BRUNELLE,J
16760 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1000-1050AM R BRUNELLE,J
17131 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1100-1150AM T BRUNELLE,J
17132 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1100-1150AM T BRUNELLE,J
17133 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1100-1150AM T BRUNELLE,J
17134 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1100-1150AM T BRUNELLE,J
17135 CS 411W PROFESSIO WORKFORCE DEV II REC 0 1100-1150AM T BRUNELLE,J
23748 CS 411W PROFESSIONAL WORKFORCE DEV II 3 HOURS ARR PRICE,G
23749 CS 411W PROFESSIONAL WRKFRC DEV II REC 0 300- 450PM W PRICE,G
19559 CS 417 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
19560 CS 417 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
19561 CS 417 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
19908 CS 417 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
20100 CS 417 COMPUTATIONAL METH & SOFTWARE 3 200- 250PM MWF MORRIS,J
23750 CS 417 COMPUTATIONAL METH & SOFTWARE 3 200- 250PM MWF MORRIS,J
13226 CS 418 WEB PROGRAMMING 3 130- 245PM TR WU,J
23607 CS 418 WEB PROGRAMMING 3 130- 245PM TR WU,J
22005 CS 432 WEB SCIENCE 3 HOURS ARR WEIGLE,M
22006 CS 432 WEB SCIENCE 3 HOURS ARR WEIGLE,M
22007 CS 432 WEB SCIENCE 3 HOURS ARR WEIGLE,M
22012 CS 432 WEB SCIENCE 3 HOURS ARR WEIGLE,M
16484 CS 450 DATABASE CONCEPTS 3 HOURS ARR JAYARATHNA,U
16485 CS 450 DATABASE CONCEPTS 3 HOURS ARR JAYARATHNA,U
16486 CS 450 DATABASE CONCEPTS 3 HOURS ARR JAYARATHNA,U
16838 CS 450 DATABASE CONCEPTS 3 HOURS ARR JAYARATHNA,U
10381 CS 455 INTRO-NETWORKS & COMMUNICATION 3 1100-1215PM TR IBRAHIM,S
23599 CS 455 INTRO-NETWORKS & COMMUNICATION 3 1100-1215PM TR IBRAHIM,S
10395 CS 460 COMPUTER GRAPHICS 3 1100-1150AM MWF PRICE,G
23751 CS 460 COMPUTER GRAPHICS 3 1100-1150AM MWF PRICE,G
15988 CS 462 CYBERSECURITY FUNDAMENTALS 3 HOURS ARR ZEHRA,S
15989 CS 462 CYBERSECURITY FUNDAMENTALS 3 HOURS ARR ZEHRA,S
15990 CS 462 CYBERSECURITY FUNDAMENTALS 3 HOURS ARR ZEHRA,S
16842 CS 462 CYBERSECURITY FUNDAMENTALS 3 HOURS ARR TAMHANE,A
21949 CS 462 CYBERSECURITY FUNDAMENTALS 3 HOURS ARR ZEHRA,S
21951 CS 462 CYBERSECURITY FUNDAMENTALS 3 HOURS ARR ZEHRA,S
21954 CS 462 CYBERSECURITY FUNDAMENTALS 3 HOURS ARR ZEHRA,S
21956 CS 462 CYBERSECURITY FUNDAMENTALS 3 HOURS ARR ZEHRA,S
24629 CS 462 CYBERSECURITY FUNDAMENTALS 3 HOURS ARR ZEHRA,S
24630 CS 462 CYBERSECURITY FUNDAMENTALS 3 HOURS ARR ZEHRA,S
13848 CS 463 CRYPTOGRAPHY FOR CYBERSECURITY 3 HOURS ARR MUKKAMALA,R
13849 CS 463 CRYPTOGRAPHY FOR CYBERSECURITY 3 HOURS ARR MUKKAMALA,R
13850 CS 463 CRYPTOGRAPHY FOR CYBERSECURITY 3 HOURS ARR MUKKAMALA,R
16845 CS 463 CRYPTOGRAPHY FOR CYBERSECURITY 3 HOURS ARR MUKKAMALA,R
24631 CS 463 CRYPTOGRAPHY FOR CYBERSECURITY 3 HOURS ARR MUKKAMALA,R
24632 CS 463 CRYPTOGRAPHY FOR CYBERSECURITY 3 HOURS ARR MUKKAMALA,R
22695 CS 464 NETWORKED SYSTEMS SECURITY 3 HOURS ARR WANG,C
22696 CS 464 NETWORKED SYSTEMS SECURITY 3 HOURS ARR WANG,C
22697 CS 464 NETWORKED SYSTEMS SECURITY 3 HOURS ARR RUNYAN,D
24635 CS 464 NETWORKED SYSTEMS SECURITY 3 HOURS ARR RUNYAN,D
24636 CS 464 NETWORKED SYSTEMS SECURITY 3 HOURS ARR RUNYAN,D
19748 CS 467 INTRO REVERSE SOFTWARE ENGIN 3 420- 535PM MW WANG,C
15813 CS 471 OPERATING SYSTEMS 3 HOURS ARR EL MESALAMI,A
15814 CS 471 OPERATING SYSTEMS 3 HOURS ARR EL MESALAMI,A
15815 CS 471 OPERATING SYSTEMS 3 HOURS ARR EL MESALAMI,A
15816 CS 471 OPERATING SYSTEMS 3 HOURS ARR EL MESALAMI,A
24551 CS 471 OPERATING SYSTEMS 3 HOURS ARR EL MESALAMI,A
24552 CS 471 OPERATING SYSTEMS 3 HOURS ARR EL MESALAMI,A
24553 CS 471 OPERATING SYSTEMS 3 HOURS ARR EL MESALAMI,A
12528 CS 480 INTRO-ARTIFICIAL INTELLIGENCE 3 300- 415PM TR LI,Y
15589 CS 497 INDEPENDENT STUDY 3 HOURS ARR BRUNELLE,J
18873 CS 497 INDEPENDENT STUDY 3 HOURS ARR CHRISOCHOID,N
18988 CS 497 INDEPENDENT STUDY 3 HOURS ARR BRUNELLE,J
20704 CS 497 INDEPENDENT STUDY 3 HOURS ARR HE,J
17933 CS 500 FOUNDATIONS OF COMPUTING 3 300- 415PM MW CHERNIKOV,A
23752 CS 500 FOUNDATIONS OF COMPUTING 3 300- 415PM MW CHERNIKOV,A
19562 CS 517 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
19563 CS 517 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
19564 CS 517 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
19909 CS 517 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
13227 CS 518 WEB PROGRAMMING 3 130- 245PM TR WU,J
23608 CS 518 WEB PROGRAMMING 3 130- 245PM TR WU,J
22008 CS 532 WEB SCIENCE 3 HOURS ARR WEIGLE,M
22009 CS 532 WEB SCIENCE 3 HOURS ARR WEIGLE,M
22010 CS 532 WEB SCIENCE 3 HOURS ARR WEIGLE,M
22011 CS 532 WEB SCIENCE 3 HOURS ARR WEIGLE,M
16487 CS 550 DATABASE CONCEPTS 3 HOURS ARR JAYARATHNA,U
16488 CS 550 DATABASE CONCEPTS 3 HOURS ARR JAYARATHNA,U
16489 CS 550 DATABASE CONCEPTS 3 HOURS ARR JAYARATHNA,U
10382 CS 555 INTRO-NETWORKS & COMMUNICATION 3 1100-1215PM TR IBRAHIM,S
15421 CS 562 CYBERSECURITY FUNDAMENTALS 3 HOURS ARR ZEHRA,S
17412 CS 562 CYBERSECURITY FUNDAMENTALS 3 HOURS ARR ZEHRA,S
21961 CS 562 CYBERSECURITY FUNDAMENTALS 3 HOURS ARR ZEHRA,S
21964 CS 562 CYBERSECURITY FUNDAMENTALS 3 HOURS ARR ZEHRA,S
13851 CS 563 CRYPTOGRAPHY FOR CYBERSECURITY 3 HOURS ARR MUKKAMALA,R
15422 CS 563 CRYPTOGRAPHY FOR CYBERSECURITY 3 HOURS ARR MUKKAMALA,R
15423 CS 563 CRYPTOGRAPHY FOR CYBERSECURITY 3 HOURS ARR MUKKAMALA,R
17413 CS 563 CRYPTOGRAPHY FOR CYBERSECURITY 3 HOURS ARR MUKKAMALA,R
22699 CS 564 NETWORKED SYSTEMS SECURITY 3 HOURS ARR RUNYAN,D
22700 CS 564 NETWORKED SYSTEMS SECURITY 3 HOURS ARR RUNYAN,D
22701 CS 564 NETWORKED SYSTEMS SECURITY 3 HOURS ARR RUNYAN,D
19749 CS 567 INTRO REVERSE SOFTWARE ENGIN 3 420- 535PM MW WANG,C
12529 CS 580 INTRO-ARTICIFICAL INTELLIGENCE 3 300- 415PM TR LI,Y
23600 CS 580 INTRO-ARTICIFICAL INTELLIGENCE 3 300- 415PM TR LI,Y
17685 CS 597 INDP STUDY IN COMPUTER SCIENCE 3 HOURS ARR MUKKAMALA,R
24733 CS 610 FOUNDATIONS OF CYBERSECURITY 3 1200- 430PM W MUKKAMALA,R
19924 CS 620 INTRO-DATA SCIENCE & ANALYTICS 3 420- 700PM T JAYARATHNA,U
21549 CS 620 INTRO-DATA SCIENCE & ANALYTICS 3 HOURS ARR JAYARATHNA,U
21550 CS 620 INTRO-DATA SCIENCE & ANALYTICS 3 HOURS ARR JAYARATHNA,U
21551 CS 620 INTRO-DATA SCIENCE & ANALYTICS 3 HOURS ARR JAYARATHNA,U
21552 CS 620 INTRO-DATA SCIENCE & ANALYTICS 3 HOURS ARR JAYARATHNA,U
19793 CS 625 DATA VISUALIZATION 3 930-1045AM TR WEIGLE,M
19796 CS 625 DATA VISUALIZATION 3 930-1045AM TR WEIGLE,M
19797 CS 625 DATA VISUALIZATION 3 930-1045AM TR WEIGLE,M
19798 CS 625 DATA VISUALIZATION 3 930-1045AM TR WEIGLE,M
20035 CS 625 DATA VISUALIZATION 3 930-1045AM TR WEIGLE,M
22718 CS 665 COMPUTER ARCHITECTURE 3 HOURS ARR OLARIU,S
22719 CS 665 COMPUTER ARCHITECTURE 3 HOURS ARR OLARIU,S
22720 CS 665 COMPUTER ARCHITECTURE 3 HOURS ARR OLARIU,S
10242 CS 667 COOPERATIVE EDUCATION 1 HOURS ARR ZHAO,D
12758 CS 690 COLLOQUIUM 1 1030-1150AM F ZEIL,S
17438 CS 690 COLLOQUIUM 1 HOURS ARR ZEIL,S
17439 CS 690 COLLOQUIUM 1 HOURS ARR ZEIL,S
17440 CS 690 COLLOQUIUM 1 HOURS ARR ZEIL,S
17441 CS 690 COLLOQUIUM 1 HOURS ARR ZEIL,S
10598 CS 697 INDEPENDENT STUDY IN C S 3 HOURS ARR ZHAO,D
10599 CS 697 INDEPENDENT STUDY IN C S 2 HOURS ARR OLARIU,S
11156 CS 697 INDEPENDENT STUDY IN C S 3 HOURS ARR WEIGLE,M
15604 CS 697 INDEPENDENT STUDY IN C S 3 HOURS ARR CHRISOCHOID,N
17663 CS 697 INDEPENDENT STUDY IN C S 3 HOURS ARR MUKKAMALA,R
18812 CS 697 INDEPENDENT STUDY IN C S 3 HOURS ARR MALY,K
18885 CS 697 INDEPENDENT STUDY IN C S 3 HOURS ARR JAYARATHNA,U
18946 CS 697 INDEPENDENT STUDY IN C S 3 HOURS ARR HE,J
20726 CS 697 INDEPENDENT STUDY IN C S 3 HOURS ARR LI,Y
20770 CS 697 INDEPENDENT STUDY IN C S 3 HOURS ARR IBRAHIM,S
16922 CS 698 MASTER'S PROJECT 3 HOURS ARR WEIGLE,M
17511 CS 698 MASTER'S PROJECT 3 HOURS ARR ZHAO,D
17657 CS 698 MASTER'S PROJECT 3 HOURS ARR ZUBAIR,M
18888 CS 698 MASTER'S PROJECT 3 HOURS ARR LI,Y
18959 CS 698 MASTER'S PROJECT 3 HOURS ARR CHERNIKOV,A
13057 CS 699 THESIS RESEARCH 3 HOURS ARR MUKKAMALA,R
15605 CS 699 THESIS RESEARCH 3 HOURS ARR CHRISOCHOID,N
16923 CS 699 THESIS RESEARCH 3 HOURS ARR WEIGLE,M
17646 CS 699 THESIS RESEARCH 3 HOURS ARR MUKKAMALA,R
17660 CS 699 THESIS RESEARCH 3 HOURS ARR ZHAO,D
17722 CS 699 THESIS RESEARCH 3 HOURS ARR WANG,C
18716 CS 699 THESIS RESEARCH 3 HOURS ARR HE,J
20657 CS 699 THESIS RESEARCH 3 HOURS ARR NELSON,M
18592 CS 722 MACHINE LEARNING 3 300- 415PM MW SUN,J
23882 CS 722 MACHINE LEARNING 3 300- 415PM MW SUN,J
16514 CS 723 INTRODUCTION BIOINFORMATICS 3 HOURS ARR HE,J
16515 CS 723 INTRODUCTION BIOINFORMATICS 3 HOURS ARR HE,J
16516 CS 723 INTRODUCTION BIOINFORMATICS 3 HOURS ARR HE,J
18435 CS 723 INTRODUCTION BIOINFORMATICS 3 HOURS ARR HE,J
21542 CS 776 ARCH SUPPORT FOR CLOUD COMP 3 HOURS ARR OLARIU,S
21543 CS 776 ARCH SUPPORT FOR CLOUD COMP 3 HOURS ARR OLARIU,S
21544 CS 776 ARCH SUPPORT FOR CLOUD COMP 3 HOURS ARR OLARIU,S
21545 CS 776 ARCH SUPPORT FOR CLOUD COMP 3 HOURS ARR OLARIU,S
15925 CS 791 GRAD SEM: IN MOLECULAR IMAGES 3 HOURS ARR HE,J
16078 CS 791 SEM:ADV AI PROTEIN STRUC MODEL 3 HOURS ARR LI,Y
17512 CS 791 GRADUATE SEM: IOT SECURITY 3 HOURS ARR ZHAO,D
17939 CS 791 GRADUATE SEMINAR 3 HOURS ARR CHERNIKOV,A
17945 CS 791 GRADUATE SEMINAR 3 HOURS ARR CHRISOCHOID,N
17947 CS 791 GRADUATE SEMINAR 3 HOURS ARR MUKKAMALA,R
17949 CS 791 GRADUATE SEMINAR 3 HOURS ARR OLARIU,S
17950 CS 791 GRADUATE SEMINAR 3 HOURS ARR WEIGLE,M
17952 CS 791 GRADUATE SEMINAR 3 HOURS ARR WANG,C
17954 CS 791 GRADUATE SEMINAR 3 HOURS ARR STAFF
18813 CS 791 GRADUATE SEMINAR 3 HOURS ARR ZUBAIR,M
18921 CS 791 GRADUATE SEMINAR 3 HOURS ARR SUN,J
20705 CS 791 GRADUATE SEMINAR 3 HOURS ARR MALY,K
17039 CS 795 TPCS:MALWARE ANALY& RVRS ENG 3 HOURS ARR WANG,C
17040 CS 795 TPCS:MALWARE ANALY& RVRS ENG 3 HOURS ARR WANG,C
17041 CS 795 TPCS:MALWARE ANALY& RVRS ENG 3 HOURS ARR WANG,C
17046 CS 795 TPC:MALWARE ANALY& REVERSE ENG 3 HOURS ARR WANG,C
20104 CS 795 TPCS: NATURAL LANG PROCESSING 3 300- 415PM TR GANJIGUNTE ,V
21722 CS 795 TPCS:DEVOPS,CONTAINERS & CLOUD 3 1100-1215PM MW ZEIL,S
21725 CS 795 TPCS: WEB ARCHIVING FORENSICS 3 420- 700PM R NELSON,M
21727 CS 795 TPCS:MINING SCHOLARLY BIG DATA 3 930-1045AM MW WU,J
23650 CS 795 TPCS: NATURAL LANG PROCESSING 3 300- 415PM TR GANJIGUNTE ,V
23925 CS 795 TPCS:MINING SCHOLARLY BIG DATA 3 HOURS ARR STAFF
23926 CS 795 TPCS:MINING SCHOLARLY BIG DATA 3 HOURS ARR STAFF
24117 CS 795 TPCS:MOBILE SENSING-SMART CITI 3 420- 700PM T STAFF
24402 CS 795 TPCS: WEB ARCHIVING FORENSICS 3 420- 700PM R NELSON,M
24541 CS 795 TPCS: IOT SECURITY 3 910-1045AM TR ZHAO,D
24600 CS 795 TPCS: WEB ARCHIVING FORENSICS 3 420- 700PM R NELSON,M
24711 CS 795 TPCS: IOT SECURITY 3 910-1045AM TR ZHAO,D
17284 CS 796 TPC:ADV ARTIFICIAL INTELLIGENC 3 HOURS ARR LI,Y
18593 CS 822 MACHINE LEARNING 3 300- 415PM MW SUN,J
23886 CS 822 MACHINE LEARNING 3 300- 415PM MW SUN,J
16517 CS 823 INTRODUCTION BIOINFORMATICS 3 HOURS ARR HE,J
16518 CS 823 INTRODUCTION BIOINFORMATICS 3 HOURS ARR HE,J
16519 CS 823 INTRODUCTION BIOINFORMATICS 3 HOURS ARR HE,J
21546 CS 876 ARCH SUPPORT FOR CLOUD COMP 3 HOURS ARR OLARIU,S
21547 CS 876 ARCH SUPPORT FOR CLOUD COMP 3 HOURS ARR OLARIU,S
21548 CS 876 ARCH SUPPORT FOR CLOUD COMP 3 HOURS ARR OLARIU,S
10229 CS 891 GRADUATE SEMINAR 3 HOURS ARR CHERNIKOV,A
10230 CS 891 GRADUATE SEMINAR 3 HOURS ARR OLARIU,S
15926 CS 891 GRAD SEM: IN MOLECULAR IMAGES 3 HOURS ARR HE,J
16079 CS 891 SEM:ADV AI PROTEIN STRUC MODEL 3 HOURS ARR LI,Y
17513 CS 891 GRADUATE SEM: IOT SECURITY 3 HOURS ARR ZHAO,D
17946 CS 891 GRADUATE SEMINAR 3 HOURS ARR CHRISOCHOID,N
17948 CS 891 GRADUATE SEMINAR 3 HOURS ARR MUKKAMALA,R
17951 CS 891 GRADUATE SEMINAR 3 HOURS ARR WEIGLE,M
17953 CS 891 GRAD SEM: IN MOLECULAR IMAGES 3 HOURS ARR WANG,C
17955 CS 891 GRAD SEM: IN MOLECULAR IMAGES 3 HOURS ARR STAFF
18814 CS 891 GRADUATE SEMINAR 3 HOURS ARR ZUBAIR,M
18922 CS 891 GRADUATE SEMINAR 3 HOURS ARR SUN,J
17042 CS 895 TPCS:MALWARE ANALY& RVRS ENG 3 HOURS ARR WANG,C
17043 CS 895 TPC:MALWARE ANALY& REVERSE ENG 3 HOURS ARR WANG,C
17044 CS 895 TPC:MALWARE ANALY& REVERSE ENG 3 HOURS ARR WANG,C
17045 CS 895 TPC:MALWARE ANALY& REVERSE ENG 3 HOURS ARR WANG,C
20105 CS 895 TPCS:NATURAL LANG PROCESSING 3 300- 415PM TR GANJIGUNTE ,V
21723 CS 895 TPCS:DEVOPS,CONTAINERS & CLOUD 3 1100-1215PM MW ZEIL,S
21726 CS 895 TPCS: WEB ARCHIVING FORENSICS 3 420- 700PM R NELSON,M
21728 CS 895 TPCS:MINING SCHOLARLY BIG DATA 3 930-1045AM MW WU,J
23653 CS 895 TPCS:NATURAL LANG PROCESSING 3 300- 415PM TR GANJIGUNTE ,V
24118 CS 895 TPCS:MOBILE SENSING-SMART CITI 3 420- 700PM T STAFF
24403 CS 895 TPCS: WEB ARCHIVING FORENSICS 3 420- 700PM R NELSON,M
24543 CS 895 TPCS: IOT SECURITY 3 910-1045AM TR ZHAO,D
24601 CS 895 TPCS: WEB ARCHIVING FORENSICS 3 420- 700PM R NELSON,M
24712 CS 895 TPCS: IOT SECURITY 3 910-1045AM TR ZHAO,D
11157 CS 896 TPCS: APPLIED VISUALIZATION 3 HOURS ARR WEIGLE,M
17285 CS 896 TPC:ADV ARTIFICIAL INTELLIGENC 3 HOURS ARR LI,Y
20788 CS 896 TPCS:SMART CITI IN THE IOT ERA 3 HOURS ARR OLARIU,S
10231 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR HE,J
10232 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR NELSON,M
10233 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR OLARIU,S
10234 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR ZUBAIR,M
10235 CS 899 DOCTORAL DISSERTATION 6 HOURS ARR CHERNIKOV,A
10236 CS 899 DOCTORAL DISSERTATION 6 HOURS ARR CHRISOCHOID,N
10237 CS 899 DOCTORAL DISSERTATION 6 HOURS ARR NELSON,M
10238 CS 899 DOCTORAL DISSERTATION 6 HOURS ARR MUKKAMALA,R
10239 CS 899 DOCTORAL DISSERTATION 6 HOURS ARR RANJAN,D
11158 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR WEIGLE,M
11159 CS 899 DOCTORAL DISSERTATION 6 HOURS ARR WEIGLE,M
11819 CS 899 DOCTORAL DISSERTATION 1 HOURS ARR NELSON,M
11820 CS 899 DOCTORAL DISSERTATION 6 HOURS ARR LI,Y
11821 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR MUKKAMALA,R
12696 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR RANJAN,D
13043 CS 899 DOCTORAL DISSERTATION 1 HOURS ARR CHRISOCHOID,N
15895 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR ZHAO,D
15896 CS 899 DOCTORAL DISSERTATION 6 HOURS ARR OLARIU,S
15984 CS 899 DOCTORAL DISSERTATION 1 HOURS ARR MUKKAMALA,R
17409 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR CHRISOCHOID,N
17616 CS 899 DOCTORAL DISSERTATION 1 HOURS ARR WEIGLE,M
17756 CS 899 DOCTORAL DISSERTATION 1 HOURS ARR HE,J
17934 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR WANG,F
17935 CS 899 DOCTORAL DISSERTATION 1 HOURS ARR STAFF
17936 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR WANG,C
17937 CS 899 DOCTORAL DISSERTATION 1 HOURS ARR WANG,C
18691 CS 899 DOCTORAL DISSERTATION 1 HOURS ARR LI,Y
18757 CS 899 DOCTORAL DISSERTATION 1 HOURS ARR CHERNIKOV,A
18815 CS 899 DOCTORAL DISSERTATION 1 HOURS ARR OLARIU,S
18947 CS 899 DOCTORAL DISSERTATION 6 HOURS ARR HE,J
18984 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR LI,Y
18985 CS 899 DOCTORAL DISSERTATION 6 HOURS ARR ZHAO,D
20092 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR JAYARATHNA,U
20093 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR WU,J
20094 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR SUN,J
20744 CS 899 DOCTORAL DISSERTATION 1 HOURS ARR ZHAO,D
20768 CS 899 DOCTORAL DISSERTATION 6 HOURS ARR HE,J
20769 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR CHERNIKOV,A
22686 CS 899 DOCTORAL DISSERTATION 3 HOURS ARR SUN,J
22687 CS 899 DOCTORAL DISSERTATION 6 HOURS ARR SUN,J
23368 CS 899 DOCTORAL DISSERTATION 1 HOURS ARR RANJAN,D
24818 CS 899 DOCTORAL DISSERTATION 6 HOURS ARR WU,J
25012 CS 998 MASTER'S GRADUATE CREDIT 1 HOURS ARR LI,Y
11232 CS 999 COMPUTER SCIENCE GRAD AUDIT 1 HOURS ARR LI,Y
schedule_medium.csv
CRN SUBJ CRSE TITLE CR HRS TIME DAYS INSTRUCTOR
13785 CS 252 INTRO TO UNIX FOR PROGRAMMERS 1 HOURS ARR ZEIL,S
13786 CS 252 INTRO TO UNIX FOR PROGRAMMERS 1 HOURS ARR ZEIL,S
13787 CS 252 INTRO TO UNIX FOR PROGRAMMERS 1 HOURS ARR ZEIL,S
16781 CS 252 INTRO TO UNIX FOR PROGRAMMERS 1 HOURS ARR ZEIL,S
13809 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 HOURS ARR KENNEDY,T
13810 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 HOURS ARR KENNEDY,T
13811 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 HOURS ARR KENNEDY,T
16388 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 1100-1215PM TR KENNEDY,T
16791 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 HOURS ARR KENNEDY,T
20654 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 HOURS ARR KENNEDY,T
20655 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 HOURS ARR KENNEDY,T
20656 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 HOURS ARR KENNEDY,T
14084 CS 350 INTRO TO SOFTWARE ENGINEERING 3 200- 250PM MWF ZEIL,S
17931 CS 350 INTR TO SOFTWARE ENGINEER REC 0 710- 910PM T ZEIL,S
17932 CS 350 INTRO TO SOFTWARE ENGINEERING 0 300- 500PM T ZEIL,S
23586 CS 350 INTRO TO SOFTWARE ENGINEERING 3 200- 250PM MWF ZEIL,S
23587 CS 350 INTR TO SOFTWARE ENGINEER REC 0 710- 910PM T ZEIL,S
23588 CS 350 INTRO TO SOFTWARE ENGINEERING 0 300- 500PM T ZEIL,S
13867 CS 382 INTRODUCTION TO JAVA 1 HOURS ARR ZEIL,S
13869 CS 382 INTRODUCTION TO JAVA 1 HOURS ARR ZEIL,S
13871 CS 382 INTRODUCTION TO JAVA 1 HOURS ARR ZEIL,S
16822 CS 382 INTRODUCTION TO JAVA 1 HOURS ARR ZEIL,S
15478 CS 410 PROFESSIONAL WORKFORCE DEV I 3 HOURS ARR KENNEDY,T
15479 CS 410 PROFESSIONAL WORKFORCE DEV I 3 HOURS ARR KENNEDY,T
15480 CS 410 PROFESSIONAL WORKFORCE DEV I 3 HOURS ARR KENNEDY,T
15481 CS 410 PROFESSION WORKFORCE DEV I REC 0 1100-1250PM W KENNEDY,T
15482 CS 410 PROFESSION WORKFORCE DEV I REC 0 1100-1250PM W KENNEDY,T
15483 CS 410 PROFESSION WORKFORCE DEV I REC 0 1100-1250PM W KENNEDY,T
15484 CS 410 PROFESSION WORKFORCE DEV I REC 0 1100-1250PM W KENNEDY,T
16826 CS 410 PROFESSIONAL WORKFORCE DEV I 3 HOURS ARR KENNEDY,T
16835 CS 410 PROFESSION WORKFORCE DEV I REC 0 1100-1250PM W KENNEDY,T
19559 CS 417 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
19560 CS 417 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
19561 CS 417 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
19908 CS 417 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
19562 CS 517 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
19563 CS 517 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
19564 CS 517 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
19909 CS 517 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
12758 CS 690 COLLOQUIUM 1 1030-1150AM F ZEIL,S
17438 CS 690 COLLOQUIUM 1 HOURS ARR ZEIL,S
17439 CS 690 COLLOQUIUM 1 HOURS ARR ZEIL,S
17440 CS 690 COLLOQUIUM 1 HOURS ARR ZEIL,S
17441 CS 690 COLLOQUIUM 1 HOURS ARR ZEIL,S
21722 CS 795 TPCS:DEVOPS,CONTAINERS & CLOUD 3 1100-1215PM MW ZEIL,S
21723 CS 895 TPCS:DEVOPS,CONTAINERS & CLOUD 3 1100-1215PM MW ZEIL,S
schedule_short.csv
CRN SUBJ CRSE TITLE CR HRS TIME DAYS INSTRUCTOR
16477 CS 250 PROBLEM SOLVING & PROGRMNG II 4 HOURS ARR EL MESALAMI,A
21512 CS 250 PROBLEM SOLVING & PROGRMNG II 4 HOURS ARR EL MESALAMI,A
13785 CS 252 INTRO TO UNIX FOR PROGRAMMERS 1 HOURS ARR ZEIL,S
13809 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 HOURS ARR KENNEDY,T
20654 CS 330 OBJECT ORIENT PROGRAM/DESIGN 3 HOURS ARR KENNEDY,T
14084 CS 350 INTRO TO SOFTWARE ENGINEERING 3 200- 250PM MWF ZEIL,S
13863 CS 381 INTRO TO DISCRETE STRUCTURES 3 HOURS ARR EL MESALAMI,A
13867 CS 382 INTRODUCTION TO JAVA 1 HOURS ARR ZEIL,S
15478 CS 410 PROFESSIONAL WORKFORCE DEV I 3 HOURS ARR KENNEDY,T
19559 CS 417 COMPUTATIONAL METH & SOFTWARE 3 100- 215PM TR KENNEDY,T
15813 CS 471 OPERATING SYSTEMS 3 HOURS ARR EL MESALAMI,A
21722 CS 795 TPCS:DEVOPS,CONTAINERS & CLOUD 3 1100-1215PM MW ZEIL,S
section.cpp
#include "section.h"
#include
using namespace std;
/**
* Create a course section with all string members empty and all
* integer members zero.
*/
Section::Section()
: name(), title(), crn(0), credits(0), days(), time()
{
}
/**
* Create a course section
* @param sectionCRN the section identifier
* @param courseName the short name of the course (e.g., MATH162)
* @param courseTitle the long name of the course
* @param courseCredits # of credits for this course
* @param courseDays days on which the course is offered (may be empty)
* @param courseTime time at which the course is offered (may be empty)
*/
Section::Section(int sectionCRN, const std::string &courseName, const std::string &courseTitle,
int courseCredits, const std::string &courseDays, const std::string &courseTime)
: name(courseName), title(courseTitle), crn(sectionCRN), credits(courseCredits),
days(courseDays), time(courseTime)
{
}
bool Section::operator<(const Section & right) const
{
if (name < right.name)
return true;
else if (name == right.name)
return crn < right.crn;
else
return false;
}
bool Section::operator==(const Section & right) const
{
return (crn == right.crn) && (name == right.name);
}
// Print the section
std::ostream &operator<<(std::ostream &out, const Section §)
{
std::ios_base::fmtflags savedFlags( out.flags() );
out << setw(5) << sect.getCRN() << " ";
out << setw(9) << sect.getName().substr(0, 9) << " ";
out << setw(32) << left << sect.getTitle().substr(0, 32) << " ";
out << setw(2) << right << sect.getCredits() << " ";
out << setw(7) << right << sect.getDays().substr(0, 7) << " ";
out << setw(12) << left << sect.getTime().substr(0, 12) << " ";
out.flags(savedFlags);
return out;
}
section.h
#ifndef SECTION_H
#define SECTION_H
#include
#include
#include “memoryChecked.h”
/**
* A section of a course offering. Course offerings (a single course taught by a faculty member)
* are divided into sections for a variety of administrative purposes. In particular,
* distance courses are offered simultaneously to different “campuses” but are still considered
* a single course offering.
*/
class Section {
private:
std::string name; //!< Short name of the course, e.g., "CS361"
std::string title; //!< full name of the course
int crn; //!< Unique identifier of a course section
int credits; //!< Number of credits for the course
std::string days; //!< Days on which the course is offered.
std::string time; //!< Time at which the course is offered.
MemoryChecked check; //!< Used to check for memory leaks.
public:
/**
* Create a course section with all string members empty and all
* integer members zero.
*/
Section();
/**
* Create a course section
* @param sectionCRN the section identifier
* @param courseName the short name of the course (e.g., MATH162)
* @param courseTitle the long name of the course
* @param courseCredits # of credits for this course
* @param courseDays days on which the course is offered (may be empty)
* @param courseTime time at which the course is offered (may be empty)
*/
Section(int sectionCRN, const std::string& courseName, const std::string& courseTitle,
int courseCredits, const std::string& courseDays, const std::string& courseTime);
/**
* The section identifier
*/
int getCRN() const {return crn;}
/**
* Name of this course
*/
std::string getName() const {return name;}
/**
* Title of this course
*/
std::string getTitle() const {return title;}
/**
* Number of credits
*/
int getCredits() const {return credits;}
/**
* Days on which this section is offered
*/
std::string getDays() const {return days;}
/**
* Time at which this section is offered
*/
std::string getTime() const {return time;}
/**
* Ordered by course name, ties broken by CRN
*/
bool operator< (const Section&) const;
bool operator== (const Section&) const;
};
// Print the section
std::ostream& operator<< (std::ostream& out, const Section& sect);
#endif
testCSV.cpp
#include "unittest.h"
#include "csv.h"
#include
#include
using namespace std;
UnitTest(testParseCSVSimple) {
string in = “abc,123,def”;
array
auto fields = parseCSV(in);
assertThat (fields.size(), isEqualTo(expected.size()));
assertTrue(equal(fields.begin(), fields.end(), expected.begin(), expected.end()));
}
UnitTest(testParseCSVQuoted) {
string in = “abc,\”1,2\”\”3\”,def”;
array
auto fields = parseCSV(in);
assertThat (fields.size(), isEqualTo(expected.size()));
assertTrue(equal(fields.begin(), fields.end(), expected.begin(), expected.end()));
}
UnitTest(testParseCSVEmpty) {
string in = “,\”1,23\”,”;
array
auto fields = parseCSV(in);
assertThat (fields.size(), isEqualTo(expected.size()));
assertTrue(equal(fields.begin(), fields.end(), expected.begin(), expected.end()));
}
testDepartment.cpp
#include “unittest.h”
#include “department.h”
#include
#include
using namespace std;
UnitTest(testDeptAddFacultyBeginning) {
Faculty f1 (“A”);
Faculty f2 (“B”);
Faculty f3 (“C”);
Faculty f4 (“D”);
Faculty expected[] = {f1, f2, f3, f4};
Department dept;
for (int i = 0; i < 4; ++i)
{
Faculty& f = dept.findFaculty(expected[3-i].getName());
assertThat (f, isEqualTo(expected[3-i]));
assertThat (dept.numFaculty(), isEqualTo(i+1));
}
for (int i = 0; i < 4; ++i)
{
Faculty& f = dept.findFaculty(expected[i].getName());
assertThat (f, isEqualTo(expected[i]));
assertThat (dept.numFaculty(), isEqualTo(4));
}
for (int i = 0; i < 4; ++i)
{
Faculty& f = dept.get(i);
assertThat (f, isEqualTo(expected[i]));
}
}
UnitTest(testDeptAddFacultyEnd) {
Faculty f1 ("A");
Faculty f2 ("B");
Faculty f3 ("C");
Faculty f4 ("D");
Faculty expected[] = {f1, f2, f3, f4};
Department dept;
for (int i = 0; i < 4; ++i)
{
Faculty& f = dept.findFaculty(expected[i].getName());
assertThat (f, isEqualTo(expected[i]));
assertThat (dept.numFaculty(), isEqualTo(i+1));
}
for (int i = 0; i < 4; ++i)
{
Faculty& f = dept.findFaculty(expected[i].getName());
assertThat (f, isEqualTo(expected[i]));
assertThat (dept.numFaculty(), isEqualTo(4));
}
for (int i = 0; i < 4; ++i)
{
Faculty& f = dept.get(i);
assertThat (f, isEqualTo(expected[i]));
}
}
UnitTest(testDeptAddFacultyMixed) {
Faculty f1 ("A");
Faculty f2 ("B");
Faculty f3 ("C");
Faculty f4 ("D");
Faculty insertion[] = {f4, f1, f3, f2};
Faculty expected[] = {f1, f2, f3, f4};
Department dept;
for (int i = 0; i < 4; ++i)
{
Faculty& f = dept.findFaculty(insertion[i].getName());
assertThat (f, isEqualTo(insertion[i]));
assertThat (dept.numFaculty(), isEqualTo(i+1));
}
for (int i = 0; i < 4; ++i)
{
Faculty& f = dept.findFaculty(expected[i].getName());
assertThat (f, isEqualTo(expected[i]));
assertThat (dept.numFaculty(), isEqualTo(4));
}
for (int i = 0; i < 4; ++i)
{
Faculty& f = dept.get(i);
assertThat (f, isEqualTo(expected[i]));
}
}
testFaculty.cpp
#include "unittest.h"
#include "faculty.h"
#include
#include
#include
#include
#include
#include
using namespace std;
UnitTest(testFacDefaultConstructor)
{
Faculty fac;
assertThat (fac.getName(), isEqualTo(“”));
assertThat (fac.numSections(), isEqualTo(0));
assertThat (fac, isEqualTo(Faculty()));
assertFalse (fac < Faculty());
assertFalse (Faculty() < fac);
assertTrue (fac.sanityCheck());
}
UnitTest(testFacConstructor)
{
string originalName = "Doe, John";
Faculty fac (originalName);
assertThat (fac.getName(), isEqualTo(originalName));
assertThat (fac.numSections(), isEqualTo(0));
assertThat (fac, isEqualTo(Faculty(originalName)));
assertTrue (fac < Faculty() || Faculty() < fac);
ostringstream out;
out << fac;
string facOutput = out.str();
assertThat (facOutput, contains(originalName));
assertTrue (fac.sanityCheck());
}
UnitTest(testFacConsInit)
{
string originalName = "Doe, John";
Section s1 (12345, "CS350", "Software Engineering", 3, "", "");
Section s2 (12346, "CS350", "Software Engineering", 3, "TR", "9:00-10:15AM");
Section s3 (12300, "CS361", "Data Structures and Algorithms", 3, "MW", "4:20-5:35PM");
Section s4 (12789, "CS690", "Graduate Colloquium", 1, "F", "10:30AM-12:00PM");
Section expected[] = {s1, s2, s3, s4};
Faculty fac (originalName, {s4, s2, s3, s1});
assertThat (fac.getName(), isEqualTo(originalName));
assertThat (fac.numSections(), isEqualTo(4));
assertThat (fac, not(isEqualTo(Faculty(originalName))));
assertTrue (fac < Faculty() || Faculty() < fac);
assertThat(contentsOf(fac), matches(range(expected, expected+4)));
ostringstream out;
out << fac;
string facOutput = out.str();
assertThat (facOutput, contains(originalName));
for (const Section& s: expected)
{
assertThat (facOutput, contains(to_string(s.getCRN())));
assertThat (facOutput, contains(s.getName()));
assertThat (facOutput, contains(s.getTitle()));
}
assertTrue (fac.sanityCheck());
}
UnitTest(testFacConsRange)
{
string originalName = "Doe, John";
Section s1 (12345, "CS350", "Software Engineering", 3, "", "");
Section s2 (12346, "CS350", "Software Engineering", 3, "TR", "9:00-10:15AM");
Section s3 (12300, "CS361", "Data Structures and Algorithms", 3, "MW", "4:20-5:35PM");
Section s4 (12789, "CS690", "Graduate Colloquium", 1, "F", "10:30AM-12:00PM");
Section expected[] = {s1, s2, s3, s4};
Faculty fac (originalName, expected, expected+4);
assertThat (fac.getName(), isEqualTo(originalName));
assertThat (fac.numSections(), isEqualTo(4));
assertThat (fac, not(isEqualTo(Faculty(originalName))));
assertTrue (fac < Faculty() || Faculty() < fac);
assertThat(contentsOf(fac), matches(range(expected, expected+4)));
ostringstream out;
out << fac;
string facOutput = out.str();
assertThat (facOutput, contains(originalName));
for (const Section& s: expected)
{
assertThat (facOutput, contains(to_string(s.getCRN())));
assertThat (facOutput, contains(s.getName()));
assertThat (facOutput, contains(s.getTitle()));
}
assertTrue (fac.sanityCheck());
vector
list
set
array
// All of these should be accomplished via a single constructor
// in faculty.h
Faculty facv (originalName, expectedv.begin(), expectedv.end());
assertThat (facv, isEqualTo(fac));
Faculty facl (originalName, expectedl.begin(), expectedl.end());
assertThat (facl, isEqualTo(fac));
Faculty facs (originalName, expecteds.begin(), expecteds.end());
assertThat (facs, isEqualTo(fac));
Faculty faca (originalName, expecteda.begin(), expecteda.end());
assertThat (faca, isEqualTo(fac));
}
UnitTest(testFacSetName)
{
string originalName = “Doe, John”;
Faculty fac (originalName);
Section s1 (12345, “CS350”, “Software Engineering”, 3, “”, “”);
fac.add (s1);
string newName = “Smith, Jane”;
Faculty fac0 (fac);
fac.setName(newName);
assertThat (fac.getName(), isEqualTo(newName));
assertThat (fac0.getName(), isEqualTo(originalName));
assertThat (fac.numSections(), isEqualTo(1));
assertThat (fac, not(isEqualTo(fac0)));
assertTrue (fac < fac0 || fac0 < fac);
ostringstream out;
out << fac;
string facOutput = out.str();
assertThat (facOutput, contains(newName));
assertThat (facOutput, contains(s1.getName()));
assertThat (facOutput, contains(s1.getTitle()));
assertTrue (fac.sanityCheck());
}
void testAddingSections (Section* expected, Section* input, int nSections)
{
Faculty fac ("Doe, John");
Faculty fac0 = fac;
for (int i = 0; i < nSections; ++i)
{
fac0 = fac;
fac.add(input[i]);
}
assertThat (fac.numSections(), isEqualTo(nSections));
assertThat(contentsOf(fac), matches(range(expected, expected+nSections)));
assertThat(fac0, not(isEqualTo(fac)));
assertTrue (fac0 < fac || fac < fac0);
ostringstream out;
out << fac;
string facOutput = out.str();
string::size_type k = facOutput.find(fac.getName());
assertNotEqual (string::npos, k);
for (int j = 0; j < nSections; ++j)
{
ostringstream out2;
out2 << expected[j];
k = facOutput.find(out2.str(), k);
assertNotEqual (string::npos, k);
}
assertTrue (fac.sanityCheck());
}
UnitTest(testFacAddBeginning) {
Section s1 (12345, "CS350", "Software Engineering", 3, "", "");
Section s2 (12346, "CS350", "Software Engineering", 3, "TR", "9:00-10:15AM");
Section s3 (12300, "CS361", "Data Structures and Algorithms", 3, "MW", "4:20-5:35PM");
Section s4 (12789, "CS690", "Graduate Colloquium", 1, "F", "10:30AM-12:00PM");
Section expected[] = {s1, s2, s3, s4};
Section input[] = {s4, s3, s2, s1};
testAddingSections(expected+3, input, 1);
testAddingSections(expected+2, input, 2);
testAddingSections(expected+1, input, 3);
testAddingSections(expected, input, 4);
}
UnitTest(testFacAddEnd) {
Section s1 (12345, "CS350", "Software Engineering", 3, "", "");
Section s2 (12346, "CS350", "Software Engineering", 3, "TR", "9:00-10:15AM");
Section s3 (12300, "CS361", "Data Structures and Algorithms", 3, "MW", "4:20-5:35PM");
Section s4 (12789, "CS690", "Graduate Colloquium", 1, "F", "10:30AM-12:00PM");
Section expected[] = {s1, s2, s3, s4};
Section input[] = {s1, s2, s3, s4};
testAddingSections(expected, input, 1);
testAddingSections(expected, input, 2);
testAddingSections(expected, input, 3);
testAddingSections(expected, input, 4);
}
UnitTest(testFacAddMixed) {
Section s1 (12345, "CS350", "Software Engineering", 3, "", "");
Section s2 (12346, "CS350", "Software Engineering", 3, "TR", "9:00-10:15AM");
Section s3 (12300, "CS361", "Data Structures and Algorithms", 3, "MW", "4:20-5:35PM");
Section s4 (12789, "CS690", "Graduate Colloquium", 1, "F", "10:30AM-12:00PM");
Section expected[] = {s1, s2, s3, s4};
Section input[] = {s1, s4, s3, s2};
testAddingSections(expected, input, 4);
}
UnitTest (testFacCopy)
{
Section s1 (12345, "CS350", "Software Engineering", 3, "TR", "9:00-10:15AM");
Section s2 (12340, "CS252", "Intro to Unix", 1, "", "");
string facName = "Smith, Jane";
Faculty fac1(facName);
fac1.add(s1);
Faculty fac2 (fac1);
assertThat (fac2, isEqualTo(fac1));
assertFalse (fac1 < fac2);
assertFalse (fac2 < fac1);
assertThat (fac2.getName(), isEqualTo(fac1.getName()));
assertThat (fac2.numSections(), isEqualTo(fac1.numSections()));
assertThat (*fac2.begin(), isEqualTo(s1));
ostringstream out1;
out1 << fac1;
ostringstream out2;
out2 << fac2;
assertThat (out2.str(), isEqualTo(out1.str()));
fac1.add (s2);
assertThat (fac2, not(isEqualTo(fac1)));
assertThat (fac2.getName(), isEqualTo(fac1.getName()));
assertThat (fac2.numSections(), isEqualTo(fac1.numSections()-1));
assertThat (*fac2.begin(), isEqualTo(s1));
assertTrue (fac1.sanityCheck());
}
UnitTest (testFacAssign)
{
Section s1 (12345, "CS350", "Software Engineering", 3, "TR", "9:00-10:15AM");
Section s2 (12340, "CS252", "Intro to Unix", 1, "", "");
string facName = "Smith, Jane";
Faculty fac1(facName);
fac1.add(s1);
Faculty fac2;
Faculty fac3 (fac2 = fac1);
assertThat (fac2, isEqualTo(fac1));
assertThat (fac3, isEqualTo(fac1));
assertFalse (fac1 < fac2);
assertFalse (fac2 < fac1);
assertThat (fac2.getName(), isEqualTo(fac1.getName()));
assertThat (fac2.numSections(), isEqualTo(fac1.numSections()));
assertThat (*fac2.begin(), isEqualTo(s1));
ostringstream out1;
out1 << fac1;
ostringstream out2;
out2 << fac2;
assertThat (out2.str(), isEqualTo(out1.str()));
fac1.add (s2);
assertThat (fac2, not(isEqualTo(fac1)));
assertThat (fac2.getName(), isEqualTo(fac1.getName()));
assertThat (fac2.numSections(), isEqualTo(fac1.numSections()-1));
assertThat (*fac2.begin(), isEqualTo(s1));
fac1 = fac1;
assertThat(fac1.getName(), isEqualTo(facName));
assertThat(fac1.numSections(), isEqualTo(2));
std::array
assertThat (contentsOf(fac1), matches(contentsOf(expected)));
assertTrue (fac1.sanityCheck());
}
UnitTest (zzMemoryCheck) {
assertThat (MemoryChecked::getCurrentCount(), isEqualTo(0));
}
testSection.cpp
#include “unittest.h”
#include
#include
#include
#include
#include “section.h”
using namespace std;
UnitTest(testSectionDefaultConstructor) {
Section s;
assertThat (s.getCredits(), isEqualTo(0));
assertThat (s.getCRN(), isEqualTo(0));
assertThat (s.getDays(), isEqualTo(“”));
assertThat (s.getName(), isEqualTo(“”));
assertThat (s.getTime(), isEqualTo(“”));
assertThat (s.getTitle(), isEqualTo(“”));
assertThat (s, isEqualTo(Section()));
assertFalse(s < Section());
ostringstream out;
out << s;
string outs = out.str();
}
void stripBlanks(string& s)
{
string result;
for (unsigned i = 0; i < s.size(); ++i)
if (s[i] != ' ')
result += s[i];
s = result;
}
UnitTest(testSectionConstructor) {
int crn = 12345;
string name = "CS350";
string title = "Software Engineering";
int credits = 3;
string time = "1:00-1:50PM";
string days = "MWF";
Section s(crn, name, title, credits, days, time);
assertThat (s.getCredits(), isEqualTo(credits));
assertThat (s.getCRN(), isEqualTo(crn));
assertThat (s.getDays(), isEqualTo(days));
assertThat (s.getName(), isEqualTo(name));
assertThat (s.getTime(), isEqualTo(time));
assertThat (s.getTitle(), isEqualTo(title));
assertThat (s, not(isEqualTo(Section())));
assertThat(Section(), isLessThan(s));
ostringstream out;
out << s;
string output = out.str();
assertThat (output, contains(to_string(crn)));
assertThat (output, contains(name));
assertThat (output, contains(days));
assertThat (output, contains(time));
assertThat (output, contains(title));
stripBlanks(output);
string title2 = title;
stripBlanks(title2);
assertThat (output, isEqualTo("12345" + name + title2 + "3" + days + time));
Section s2(crn+1, name, title, credits, days, time);
assertThat (s, isLessThan(s2));
assertThat (s, not(isEqualTo(s2)));
Section s3(crn+1, "CS150", title, credits, days, time);
assertThat (s3, isLessThan(s));
assertThat (s, not(isEqualTo(s3)));
Section s4(crn, name, "", credits+1, "TR", "4:20-5:35PM");
assertThat (s, isEqualTo(s4));
}
unittest.cpp
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include “unittest.h”
#ifdef __MINGW32__
#ifdef __MINGW64__
#include
#else
#include
#endif
#elif __CYGWIN__
#include
#endif
using namespace CppUnitLite;
std::map
long UnitTest::numSuccesses = 0L;
long UnitTest::numFailures = 0L;
long UnitTest::numErrors = 0L;
std::string UnitTest::currentTest;
bool UnitTest::expectToFail = false;
bool UnitTest::diagnosticMessagesBeforeResults = true;
std::vector
std::vector
#ifdef __amd64__
#define breakDebugger { asm volatile (“int $3”); }
#elif __i386__
#define breakDebugger { asm volatile (“int $3”); }
#else
#define breakDebugger { }
#endif
template <>
std::string CppUnitLite::getStringRepr(std::string t)
{
return std::string(“\””) + t + ‘”‘;
}
template <>
std::string CppUnitLite::getStringRepr(const char t[])
{
return CppUnitLite::getStringRepr(std::string(t));
}
template <>
std::string CppUnitLite::getStringRepr(char t)
{
return std::string(“‘”) + t + “‘”;
}
template <>
std::string CppUnitLite::getStringRepr(bool b)
{
return (b) ? “true” : “false”;
}
UnitTest::UnitTestFailure::UnitTestFailure (
const char* conditionStr,
const char* fileName, int lineNumber)
{
if (!UnitTest::expectToFail) {
std::ostringstream out;
out << "Failed assertion " << conditionStr
<< " in " << currentTest
<< " at " << fileName << ", line "
<< lineNumber << "\n";
explanation = out.str();
} else {
explanation = "(expected to fail)";
}
}
UnitTest::UnitTestFailure::UnitTestFailure (
const std::string& conditionStr,
const char* fileName, int lineNumber)
{
if (!UnitTest::expectToFail) {
std::ostringstream out;
out << fileName << ":" << lineNumber
<< ": \t" << conditionStr << "\n";
explanation = out.str();
} else {
explanation = "(expected to fail)";
}
}
const char* UnitTest::UnitTestFailure::what() const noexcept {
return explanation.c_str();
}
AssertionResult::AssertionResult (bool theResult, std::string pexplain, std::string fexplain)
: result(theResult), passExplanation(pexplain), failExplanation(fexplain)
{}
#ifdef __MINGW32__
bool UnitTest::debuggerIsRunning()
{
return IsDebuggerPresent();
}
#elif __CYGWIN__
bool UnitTest::debuggerIsRunning()
{
bool debuggerDetected = IsDebuggerPresent();
if (debuggerDetected)
{
UnitTest::msg("# Debugger detected -- test time limits will be ignored.\n");
}
return debuggerDetected;
}
#else
bool UnitTest::debuggerIsRunning()
{
using namespace std;
static bool debuggerDetected = false;
const string traceField = "tracerpid";
int pid = ::getpid();
string statusFile = string("/proc/") + std::to_string(pid) + "/status";
ifstream status (statusFile);
if (status) {
string line;
getline (status, line);
while (status) {
transform(line.begin(), line.end(), line.begin(), ::tolower);
if (line.find(traceField) != string::npos) {
string::size_type k = line.find_first_of(" \t");
if (k != string::npos) {
line = line.substr(k+1);
istringstream lineIn (line);
pid = -1;
lineIn >> pid;
if (pid > 0) {
debuggerDetected = true;
}
}
break;
}
getline (status, line);
}
}
if (debuggerDetected)
{
UnitTest::msg(“# Debugger detected — test time limits will be ignored.\n”);
}
return debuggerDetected;
}
#endif
void UnitTest::checkTest (AssertionResult assertionResult, std::string conditionStr,
const char* fileName, int lineNumber)
{
if (!assertionResult.result)
{
if (debuggerIsRunning())
{
std::string explanation = “Failed assertion: ” + conditionStr
+ “\n” + assertionResult.failExplanation;
breakDebugger;
// A unit test has failed.
// Examine explanation and your call stack for information
explanation = explanation + ” “;
}
if (assertionResult.failExplanation.size() > 0)
{
conditionStr += “\n\t” + assertionResult.failExplanation;
}
throw UnitTestFailure(conditionStr, fileName, lineNumber);
}
}
//void UnitTest::checkTest (bool condition, const string& conditionStr,
// const char* fileName, int lineNumber)
//{
// checkTest(AssertionResult(condition), conditionStr.c_str(), fileName, lineNumber);
//}
// Print a simple summary report
void UnitTest::report ()
{
UnitTest::msgSummary();
}
// Register a new UnitTest
int UnitTest::registerUT (std::string functName, int timeLimit, TestFunction funct)
{
if (tests == nullptr)
{
tests = new std::map
}
if (tests->count(functName) > 0) {
std::cerr << "**Error: duplicate unit test named " << functName << std::endl;
}
(*tests)[functName] = BoundedTest(timeLimit, funct);
return 0;
}
jmp_buf unitTestSignalEnv;
int unitTestLastSignal = 0;
void unitTestSignalHandler(int sig) {
unitTestLastSignal = sig;
longjmp (unitTestSignalEnv, sig);
}
int UnitTest::runTestGuarded (unsigned testNumber, std::string testName, TestFunction u,
std::string& testExplanation)
{
currentTest = testName;
expectToFail = false;
try {
signal(SIGFPE, &unitTestSignalHandler);
signal(SIGSEGV, &unitTestSignalHandler);
if (setjmp(unitTestSignalEnv)) {
// Runtime error was caught
std::ostringstream out;
out << "# runtime error " << unitTestLastSignal;
if (!expectToFail) {
testExplanation = UnitTest::msgFailed(testNumber, testName, out.str(), 0);
return -1;
} else {
// OK (failed but was expected to fail)"
UnitTest::msgXFailed(testNumber, testName, out.str(), 0);
}
} else {
u();
if (!expectToFail) {
UnitTest::msgPassed(testNumber, testName, 0);
} else {
// Failed (passed but was expected to fail
UnitTest::msgXPassed(testNumber, testName, 0);
return 0;
}
}
return 1;
} catch (UnitTestFailure& ex) {
if (!expectToFail) {
testExplanation = UnitTest::msgFailed(testNumber, testName, ex.what(), 0);
return 0;
} else {
// OK (failed but was expected to fail)"
UnitTest::msgXFailed(testNumber, testName, ex.what(), 0);
return 1;
}
} catch (std::exception& e) {
if (!expectToFail) {
UnitTest::msgError(testNumber, testName,
"Unexpected error in " + currentTest + ": " +e.what(), 0);
testExplanation = "";
return -1;
} else {
// OK (exception but was expected to fail)"
UnitTest::msgXFailed(testNumber, testName, "", 0);
return 1;
}
} catch (...) {
if (!expectToFail) {
UnitTest::msgError(testNumber, testName, "Unexpected error in " + currentTest, 0);
testExplanation = "";
return -1;
} else {
// OK (exception but was expected to fail)"
UnitTest::msgXFailed(testNumber, testName, "", 0);
return 1;
}
}
}
/**
* Reverses the expectation for the current test. A test that fails or halts
* with an error will be reported and counted as OK. If that test succeeds,
* it will be reported and counted as an error.
*
* Must be called before any assertions.
*/
void UnitTest::expectedToFail()
{
expectToFail = true;
}
// Run a single unit test function with no timer.
void UnitTest::runTestUntimed (unsigned testNumber, std::string testName, TestFunction u)
{
int testResult; // 1== passed, 0 == failed, -1 == erro
std::string testExplanation;
// No time-out supported if compiler does not have thread support.
testResult = runTestGuarded (testNumber, testName, u, testExplanation);
try {
// Normal exit
if (testResult == 1) {
++numSuccesses;
} else if (testResult == 0) {
++numFailures;
failedTests.push_back(testName);
UnitTest::msg(testExplanation);
} else if (testResult == -1) {
++numErrors;
failedTests.push_back(testName);
UnitTest::msg(testExplanation);
}
} catch (std::runtime_error& e) {
++numErrors;
failedTests.push_back(testName);
UnitTest::msg(std::string("# Test ") + currentTest + " failed due to "
+ e.what() + "\n");
}
}
#ifndef __MINGW32__
// Run a single unit test function.
void UnitTest::runTest (unsigned testNumber, std::string testName, TestFunction u, long timeLimit)
{
if (timeLimit > 0L && !debuggerIsRunning())
{
int testResult = -99; // 1== passed, 0 == failed, -1 == error
std::string testExplanation;
std::mutex m;
std::chrono::duration
std::chrono::duration
std::chrono::duration
std::thread t([&m, &testNumber, &testName, &u, &testResult, &testExplanation](){
{
int result = runTestGuarded (testNumber, testName, u, testExplanation);
std::unique_lock
testResult = result;
}
});
t.detach();
bool finished = false;
do {
{
std::unique_lock
finished = (testResult >= -1 || elapsed >= limit);
elapsed += incr;
}
std::this_thread::sleep_for( incr );
} while (!finished);
if (testResult < -1) {
++numFailures;
failedTests.push_back(testName);
std::ostringstream out;
out << "# Test " << testNumber << " - " << currentTest << " still running after "
<< timeLimit
<< " milliseconds - possible infinite loop?";
if (!expectToFail)
{
UnitTest::msg (
UnitTest::msgFailed(testNumber, testName, out.str(), timeLimit)
);
}
else
{
UnitTest::msgXFailed(testNumber, testName, out.str(), timeLimit);
++numSuccesses;
--numFailures;
}
}
// Normal exit
else if (testResult == 1) {
++numSuccesses;
} else if (testResult == 0) {
++numFailures;
failedTests.push_back(testName);
UnitTest::msg(testExplanation);
} else if (testResult == -1) {
++numErrors;
failedTests.push_back(testName);
UnitTest::msg(testExplanation);
}
}
else
{
runTestUntimed (testNumber, testName, u);
}
}
#else
// Run a single unit test function.
void UnitTest::runTest (unsigned testNumber, std::string testName, TestFunction u, long int timeLimit)
{
runTestUntimed (testNumber, testName, u);
}
#endif
// Run all units tests whose name contains testNames[i],
// 0 <= i <= nTests
//
// Special case: If nTests == 0, runs all unit Tests.
void UnitTest::runTests (int nTests, char** testNames, char* program)
{
std::set
// Check for GTest emulation
for (int i = 0; i < nTests; ++i)
{
std::string arg = testNames[i];
}
std::string badTestSpecifications = "";
for (int i = 0; i < nTests; ++i)
{
std::string testID = testNames[i];
bool found = false;
for (const auto& utest: *tests) {
if (utest.first.find(testID) != std::string::npos) {
testsToRun.insert(utest.first);
found = true;
}
}
if (!found)
{
for (const auto& utest: *tests) {
const std::string& utestName = utest.first;
std::string reducedName (1, utestName[0]);
for (unsigned j = 1; j < utest.first.size(); ++j)
{
if (utestName[j] >= ‘A’ && utestName[j] <= 'Z')
{
reducedName += utestName[j];
}
}
if (testID == reducedName)
{
testsToRun.insert(utest.first);
found = true;
}
}
}
if (!found)
{
badTestSpecifications += "# Warning: No matching test found for input specification "
+ testID + "\n";
}
}
if (testsToRun.size() == 0) {
for (const auto& utest: *tests) {
testsToRun.insert(utest.first);
}
}
// Emit TAP plan line
UnitTest::msg ("1.." + std::to_string(testsToRun.size()));
UnitTest::msg (badTestSpecifications);
unsigned testNumber = 1;
for (std::string testName: testsToRun) {
BoundedTest test = (*tests)[testName];
runTest (testNumber, testName, test.unitTest, test.timeLimit);
++testNumber;
}
}
/**
* Clear the call log.
*/
void UnitTest::clearCallLog()
{
callLog.clear();
}
/**
* Position of oldest logged call.
*/
UnitTest::iterator UnitTest::begin()
{
return callLog.begin();
}
/**
* Position just after the most recently logged call.
*/
UnitTest::iterator UnitTest::end()
{
return callLog.end();
}
/**
* Log a call to a zero-parameter function.
*
* @param functionName name of the function
*/
void UnitTest::logCall (const std::string& functionName)
{
callLog.push_back (functionName);
}
void UnitTest::msgPassed (unsigned testNumber, std::string testName, unsigned timeMS)
{
using namespace std;
cout << flush;
cout << "ok " << testNumber << " - " << testName << endl;
}
void UnitTest::msgXPassed (unsigned testNumber, std::string testName, unsigned timeMS)
{
UnitTest::msg(
UnitTest::msgFailed(testNumber, testName,
std::string("Test ") + std::to_string(testNumber) + " - " + testName
+ " passed but was expected to fail.", timeMS)
);
}
std::string UnitTest::extractLocation (const std::string& msg)
{
using namespace std;
string::size_type len = msg.size();
string::size_type pos1 = msg.find(".h:");
string::size_type pos2 = msg.find(".cpp:");
string::size_type pos = (pos1 < pos2) ? pos1 : pos2;
string::size_type posEnd = pos + ((pos1 < pos2) ? 3 : 5);
string::size_type stop = posEnd;
while (stop < len && isdigit(msg[stop])) {
++stop;
}
if (stop == posEnd)
return "";
string::size_type start = pos;
char c = msg[start];
while (start <= pos
&& (isalnum(c) || c == '.' || c == '_' || c == '-' || c == '/' || c == '\\'))
{
--start;
if (start <= pos)
c = msg[start];
}
if (start == pos)
return "";
string result = msg.substr(start+1, stop-start-1);
return result;
}
std::string UnitTest::msgFailed (unsigned testNumber, std::string testName,
std::string diagnostics, unsigned timeMS)
{
using namespace std;
string location = extractLocation(diagnostics);
if (location.size() > 0)
location += “: error: Failed test\n”;
string diagnosticString = location + msgComment(diagnostics);
string resultMsg = “not ok ” + to_string(testNumber) + ” – ” + testName;
if (diagnosticMessagesBeforeResults)
return diagnosticString + “: \n” + resultMsg;
else
return resultMsg + “\n” + diagnosticString;
}
std::string UnitTest::msgComment (const std::string& commentary) {
const static std::string commentPrefix = “# “;
std::string result;
std::string startOfLine = commentary.substr(0, commentPrefix.size());
if (startOfLine == commentPrefix)
result = commentary;
else
result = commentPrefix + commentary;
std::string::size_type pos = result.find(‘\n’);
while (pos != std::string::npos)
{
if (result.size() >= pos+1+commentPrefix.size())
{
startOfLine = result.substr(pos+1, commentPrefix.size());
if (startOfLine != commentPrefix)
{
result.insert(pos+1, commentPrefix);
}
}
else
{
result.insert(pos+1, commentPrefix);
}
pos = result.find(‘\n’, pos+1);
}
return result;
}
void UnitTest::msgXFailed (unsigned testNumber, std::string testName, std::string diagnostics, unsigned timeMS)
{
std::string diagnosticMsg = msgComment(std::string(“Test “) + std::to_string(testNumber) + ” failed but was expected to fail.”);
if (diagnosticMessagesBeforeResults)
UnitTest::msg(diagnosticMsg);
UnitTest::msgPassed(testNumber, testName, timeMS);
if (!diagnosticMessagesBeforeResults)
UnitTest::msg(diagnosticMsg);
}
void UnitTest::msgError (unsigned testNumber, std::string testName, std::string diagnostics, unsigned timeMS)
{
std::string diagnosticMsg = msgComment(“ERROR – ” + diagnostics);
if (diagnosticMessagesBeforeResults)
UnitTest::msg(diagnosticMsg);
UnitTest::msg(“not ok ” + std::to_string(testNumber) + ” – ” + testName);
if (!diagnosticMessagesBeforeResults)
UnitTest::msg(diagnosticMsg);
}
void UnitTest::msgSummary ()
{
using namespace std;
cout << "# UnitTest: passed " << numSuccesses << " out of "
<< getNumTests() << " tests, for a success rate of "
<< std::showpoint << std::fixed << std::setprecision(1)
<< (100.0 * numSuccesses)/(float)getNumTests()
<< "%" << endl;
}
void UnitTest::msg (const std::string& detailMessage)
{
using std::cout;
cout << detailMessage;
if (detailMessage.size() > 0 &&
detailMessage[detailMessage.size()-1] != ‘\n’)
cout << "\n";
cout << std::flush;
}
StringContainsMatcher::StringContainsMatcher (const std::string& t): right(t) {}
AssertionResult StringContainsMatcher::eval(const std::string& e) const {
auto result = e.find(right);
return AssertionResult( result != std::string::npos,
"Found " + getStringRepr(right) + " starting in position "
+ getStringRepr(result) + " of " + getStringRepr(e),
"Within " + getStringRepr(e) + ", cannot find " + getStringRepr(right));
}
CppUnitLite::StringContainsMatcher
contains(const char* t)
{
return CppUnitLite::StringContainsMatcher(std::string(t));
}
CppUnitLite::StringContainsMatcher
contains(const std::string& t)
{
return CppUnitLite::StringContainsMatcher(t);
}
StringEndsWithMatcher::StringEndsWithMatcher (const std::string& t): right(t) {}
AssertionResult StringEndsWithMatcher::eval(const std::string& e) const {
std::string eStr = getStringRepr(e);
std::string rightStr = getStringRepr(right);
bool result = (right.size() <= e.size())
&& equal(right.begin(), right.end(),
e.begin() + e.size() - right.size());
return AssertionResult(result,
eStr + " ends with " + rightStr,
eStr + " does not end with " + rightStr);
}
StringEndsWithMatcher
endsWith(const char* t)
{
return StringEndsWithMatcher(std::string(t));
}
StringEndsWithMatcher
endsWith(const std::string& t)
{
return StringEndsWithMatcher(t);
}
StringBeginsWithMatcher::StringBeginsWithMatcher (const std::string& t)
: right(t) {}
AssertionResult StringBeginsWithMatcher::eval(const std::string& e) const
{
std::string eStr = getStringRepr(e);
std::string rightStr = getStringRepr(right);
bool result = (right.size() <= e.size())
&& equal(right.begin(), right.end(), e.begin());
return AssertionResult(result,
eStr + " begins with " + rightStr,
eStr + " does not begin with " + rightStr
);
}
StringBeginsWithMatcher beginsWith(const char* t)
{
return CppUnitLite::StringBeginsWithMatcher(std::string(t));
}
StringBeginsWithMatcher beginsWith(const std::string& t)
{
return StringBeginsWithMatcher(t);
}
StringBeginsWithMatcher startsWith(const char* t)
{
return StringBeginsWithMatcher(std::string(t));
}
StringBeginsWithMatcher startsWith(const std::string& t)
{
return StringBeginsWithMatcher(t);
}
AssertionResult NullMatcher::eval(const void* p) const
{
return AssertionResult(p == nullptr, "", "");
}
CppUnitLite::NullMatcher isNull()
{
return CppUnitLite::NullMatcher();
}
AssertionResult NotNullMatcher::eval(const void* p) const {
return AssertionResult(p != nullptr, "", "");
}
CppUnitLite::NotNullMatcher isNotNull()
{
return CppUnitLite::NotNullMatcher();
}
#ifndef NOMAIN
int main(int argc, char** argv)
{
UnitTest::diagnosticMessagesBeforeResults = true;
UnitTest::runTests(argc-1, argv+1, argv[0]);
UnitTest::report();
return 0;
}
#endif
unittest.h
#ifndef UNITTEST_H
#define UNITTEST_H
#include
#include
#include
#include