diff --git a/gnucash/import-export/csv-imp/assistant-csv-trans-import.cpp b/gnucash/import-export/csv-imp/assistant-csv-trans-import.cpp index 34f8d4dd88..99236e4e29 100644 --- a/gnucash/import-export/csv-imp/assistant-csv-trans-import.cpp +++ b/gnucash/import-export/csv-imp/assistant-csv-trans-import.cpp @@ -1732,8 +1732,6 @@ void CsvImpTransAssist::preview_validate_settings () /* Populates the account match view with all potential * account names found in the parse data. - * - * @param info The data being previewed */ void CsvImpTransAssist::acct_match_set_accounts () { @@ -1963,7 +1961,7 @@ CsvImpTransAssist::assist_account_match_page_prepare () // Load the account strings into the store acct_match_set_accounts (); - // Match the account strings to the mappings + // Match the account strings to account maps from previous imports auto store = gtk_tree_view_get_model (GTK_TREE_VIEW(account_match_view)); gnc_csv_account_map_load_mappings (store); diff --git a/gnucash/import-export/csv-imp/gnc-imp-props-tx.cpp b/gnucash/import-export/csv-imp/gnc-imp-props-tx.cpp index 8fbfc0d93c..b783bfc3c1 100644 --- a/gnucash/import-export/csv-imp/gnc-imp-props-tx.cpp +++ b/gnucash/import-export/csv-imp/gnc-imp-props-tx.cpp @@ -113,7 +113,7 @@ GncNumeric parse_amount (const std::string &str, int currency_format) if (str.empty()) return GncNumeric{}; - /* Strings otherwise containing not digits will be considered invalid */ + /* Strings otherwise containing no digits will be considered invalid */ if(!boost::regex_search(str, boost::regex("[0-9]"))) throw std::invalid_argument (_("Value doesn't appear to contain a valid number.")); diff --git a/libgnucash/engine/Account.h b/libgnucash/engine/Account.h index cc4fc6bd9f..c8b9cfa6db 100644 --- a/libgnucash/engine/Account.h +++ b/libgnucash/engine/Account.h @@ -914,7 +914,7 @@ typedef enum */ /** The gnc_account_lookup_by_name() subroutine fetches the account by * name from the descendants of the specified account. The immediate - * children are searched first. If there is no match,, then a + * children are searched first. If there is no match, then a * recursive search of all descendants is performed looking for a * match. *