diff options
| author | Clifford Wolf <clifford@clifford.at> | 2015-07-02 11:14:30 +0200 |
|---|---|---|
| committer | Clifford Wolf <clifford@clifford.at> | 2015-07-02 11:14:30 +0200 |
| commit | 6c84341f22b2758181164e8d5cddd23e3589c90b (patch) | |
| tree | 0438ad9becf956e43ebf8665fee89e021b13bcdf /libs/subcircuit | |
| parent | 053058d78167f7f1ec377fddcee8b648a5ae4138 (diff) | |
Fixed trailing whitespaces
Diffstat (limited to 'libs/subcircuit')
| -rw-r--r-- | libs/subcircuit/README | 4 | ||||
| -rw-r--r-- | libs/subcircuit/subcircuit.cc | 4 | ||||
| -rw-r--r-- | libs/subcircuit/subcircuit.h | 6 | ||||
| -rw-r--r-- | libs/subcircuit/test_large.spl | 2 |
4 files changed, 8 insertions, 8 deletions
diff --git a/libs/subcircuit/README b/libs/subcircuit/README index 757a9f54..b1335681 100644 --- a/libs/subcircuit/README +++ b/libs/subcircuit/README @@ -330,7 +330,7 @@ Mining for frequent SubCircuits The solver also contains a miner for frequent subcircuits. The following code fragment will find all frequent subcircuits with at least minNodes nodes and -at most maxNodes nodes that occurs at least minMatches times: +at most maxNodes nodes that occurs at least minMatches times: std::vector<SubCircuit::Solver::MineResult> results; mySolver.mine(results, minNodes, maxNodes, minMatches); @@ -370,7 +370,7 @@ This package also contains a small command-line tool called "scshell" that can be used for experimentation with the algorithm. This program reads a series of commands from stdin and reports its findings to stdout on exit. - $ ./scshell < test_macc22.txt + $ ./scshell < test_macc22.txt ... diff --git a/libs/subcircuit/subcircuit.cc b/libs/subcircuit/subcircuit.cc index cf14df0a..7c723683 100644 --- a/libs/subcircuit/subcircuit.cc +++ b/libs/subcircuit/subcircuit.cc @@ -3,11 +3,11 @@ * algorithm for coarse grain logic networks * * Copyright (C) 2013 Clifford Wolf <clifford@clifford.at> - * + * * Permission to use, copy, modify, and/or distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. - * + * * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR diff --git a/libs/subcircuit/subcircuit.h b/libs/subcircuit/subcircuit.h index d673af88..5291c642 100644 --- a/libs/subcircuit/subcircuit.h +++ b/libs/subcircuit/subcircuit.h @@ -3,11 +3,11 @@ * algorithm for coarse grain logic networks * * Copyright (C) 2013 Clifford Wolf <clifford@clifford.at> - * + * * Permission to use, copy, modify, and/or distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. - * + * * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR @@ -115,7 +115,7 @@ namespace SubCircuit private: SolverWorker *worker; - + protected: virtual bool userCompareNodes(const std::string &needleGraphId, const std::string &needleNodeId, void *needleUserData, const std::string &haystackGraphId, const std::string &haystackNodeId, void *haystackUserData, const std::map<std::string, std::string> &portMapping); diff --git a/libs/subcircuit/test_large.spl b/libs/subcircuit/test_large.spl index 74a47d94..e33e2698 100644 --- a/libs/subcircuit/test_large.spl +++ b/libs/subcircuit/test_large.spl @@ -99,7 +99,7 @@ function makeGraph(seed, gates, primaryInputs, primaryOutputs) foreach netDecl (unusedOutpus) push primaryOutputs, netDecl; - + return code; } |