Tag List Report

The following document contains the listing of user tags found in the code. Below is the summary of the occurences per tag.

TagTotal number of occurences
@todo0
TODO16

Each tag is detailed below:

@todo

Number of occurences found in the code: 0

TODO

Number of occurences found in the code: 16

ca.uhn.hl7v2.TestLine
add!14
ca.uhn.hl7v2.app.HL7FileMsgCorrectorLine
Auto-generated constructor stub35
Auto-generated catch block69
ca.uhn.hl7v2.app.HL7ServerTestHelperLine
look into this, the HL7Server should perform better. JMS integration should fix this.151
this code is copied from HAPI ... should make it part of HAPI public API instead Removes C and C++ style comments from a reader stream. C style comments are distinguished from URL protocol delimiters by the preceding colon in the latter.321
ca.uhn.hl7v2.preparser.XMLLine
functional stylee (a la C++'s std::accumulate) ?190
remove! or assert399
remove.433
ca.uhn.hl7v2.protocol.impl.AcceptAcknowledgerLine
when 2.5 is available, use 2.5 fields for remaining problems84
ca.uhn.hl7v2.protocol.impl.ProcessorImplLine
write a MLLPTransport with non-blocking IO74
reconnect transport layers on error and retry75
make configurable310
ca.uhn.hl7v2.util.Hl7InputStreamReaderLine
this code is copied from HAPI ... should make it part of HAPI public API instead Removes C and C++ style comments from a reader stream. C style comments are distinguished from URL protocol delimiters by the preceding colon in the latter.124
ca.uhn.hl7v2.util.MessageQueryLine
could support distinct easily by keeping record of rows and comparing each one to previous rows99
this will do for now but it should really be evaluated like an expression rather than a list145
if we aren't allowing empties in this loop, and have no value, we want to return the null in the super-loop. However, we don't know which loop point, if any, is the super-loop. If it was the next one we could do this ... if (i > 0 && myMaxNumEmpty[i] == 0 && myMaxNumEmpty[i-1] > 0 && myIndices[i-1] == 0) { myIndices[i-1] = -1; } ... but it may not be, so we'll ignore this problem for now.491