Updated Doxyfile

This commit is contained in:
Marcel Otte 2018-01-11 09:25:24 +01:00
parent e67f5cda36
commit 8182e72a26
3 changed files with 8 additions and 7 deletions

View File

@ -2164,7 +2164,7 @@ PERL_PATH = /usr/bin/perl
# powerful graphs. # powerful graphs.
# The default value is: YES. # The default value is: YES.
CLASS_DIAGRAMS = NO CLASS_DIAGRAMS = YES
# You can define message sequence charts within doxygen comments using the \msc # You can define message sequence charts within doxygen comments using the \msc
# command. Doxygen will then run the mscgen tool (see: # command. Doxygen will then run the mscgen tool (see:
@ -2261,7 +2261,7 @@ GROUP_GRAPHS = YES
# The default value is: NO. # The default value is: NO.
# This tag requires that the tag HAVE_DOT is set to YES. # This tag requires that the tag HAVE_DOT is set to YES.
UML_LOOK = NO UML_LOOK = YES
# If the UML_LOOK tag is enabled, the fields and methods are shown inside the # 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 # class node. If there are many fields or methods and many nodes the graph may
@ -2400,12 +2400,12 @@ DIAFILE_DIRS =
# generate a warning when it encounters a \startuml command in this case and # generate a warning when it encounters a \startuml command in this case and
# will not generate output for the diagram. # will not generate output for the diagram.
PLANTUML_JAR_PATH = PLANTUML_JAR_PATH = /usr/bin/plantuml
# When using plantuml, the specified paths are searched for files specified by # When using plantuml, the specified paths are searched for files specified by
# the !include statement in a plantuml block. # the !include statement in a plantuml block.
PLANTUML_INCLUDE_PATH = PLANTUML_INCLUDE_PATH = .
# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes # 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 # that will be shown in the graph. If the number of nodes in a graph becomes

View File

@ -1,5 +1,6 @@
#include "RandomAccessBinary.h" #include "RandomAccessBinary.h"
#include <memory> #include <memory>
#include <vector>
RandomAccessBinary::RandomAccessBinary() RandomAccessBinary::RandomAccessBinary()
{ {

View File

@ -16,10 +16,10 @@ public:
RandomAccessBinary(); RandomAccessBinary();
RandomAccessBinary(uint possible_packetsize); RandomAccessBinary(uint possible_packetsize);
~RandomAccessBinary(); virtual ~RandomAccessBinary();
void setEndianness(RandomAccessBinary::Endianness endianness); void setEndianness(Endianness endianess);
const RandomAccessBinary::Endianness getEndianness(); const Endianness getEndianness();
void setBytes(uint position, const std::vector<uint8_t>& data); void setBytes(uint position, const std::vector<uint8_t>& data);
void setByte(uint position, const uint8_t& data); void setByte(uint position, const uint8_t& data);