summaryrefslogtreecommitdiff
path: root/include/connectivity/sqlnode.hxx
diff options
context:
space:
mode:
authorNoel Grandin <noel@peralex.com>2014-04-01 07:23:45 +0200
committerNoel Grandin <noel@peralex.com>2014-04-01 07:38:09 +0200
commit39d3f2bb3a7016042e51e4a270814a99f7e62221 (patch)
tree1ebc41d3d7bae7873211241a93a77076a3a3feb1 /include/connectivity/sqlnode.hxx
parent8728c3466211f71cea119a9895a0f4619fd47d96 (diff)
connectivity: sal_Bool->bool
Change-Id: Ice855d69c70d4f5fc119ddf1ddebf18ee6add270
Diffstat (limited to 'include/connectivity/sqlnode.hxx')
-rw-r--r--include/connectivity/sqlnode.hxx14
1 files changed, 7 insertions, 7 deletions
diff --git a/include/connectivity/sqlnode.hxx b/include/connectivity/sqlnode.hxx
index 9713135806b4..31ceb290eb80 100644
--- a/include/connectivity/sqlnode.hxx
+++ b/include/connectivity/sqlnode.hxx
@@ -251,7 +251,7 @@ namespace connectivity
OSQLParseNode(const OSQLParseNode& rParseNode);
OSQLParseNode& operator=(const OSQLParseNode& rParseNode);
- sal_Bool operator==(OSQLParseNode& rParseNode) const;
+ bool operator==(OSQLParseNode& rParseNode) const;
// destructor destructs the tree recursively
virtual ~OSQLParseNode();
@@ -359,21 +359,21 @@ namespace connectivity
// IsRule tests whether a node is a rule (NonTerminal)
// ATTENTION: rules can be leaves, for example empty lists
- sal_Bool isRule() const
+ bool isRule() const
{ return (m_eNodeType == SQL_NODE_RULE) || (m_eNodeType == SQL_NODE_LISTRULE)
|| (m_eNodeType == SQL_NODE_COMMALISTRULE);}
// IsToken tests whether a Node is a Token (Terminal but not a rule)
- sal_Bool isToken() const {return !isRule();}
+ bool isToken() const {return !isRule();}
const OUString& getTokenValue() const {return m_aNodeValue;}
void setTokenValue(const OUString& rString) { if (isToken()) m_aNodeValue = rString;}
- sal_Bool isLeaf() const {return m_aChildren.empty();}
+ bool isLeaf() const {return m_aChildren.empty();}
// negate only a searchcondition, any other rule could cause a gpf
- static void negateSearchCondition(OSQLParseNode*& pSearchCondition,sal_Bool bNegate=sal_False);
+ static void negateSearchCondition(OSQLParseNode*& pSearchCondition, bool bNegate=false);
// normalize a logic form
// e.q. (a or b) and (c or d) <=> a and c or a and d or b and c or b and d
@@ -393,7 +393,7 @@ namespace connectivity
static void compress(OSQLParseNode*& pSearchCondition);
// return the catalog, schema and tablename form this node
// _pTableNode must be a rule of that above or a SQL_TOKEN_NAME
- static sal_Bool getTableComponents(const OSQLParseNode* _pTableNode,
+ static bool getTableComponents(const OSQLParseNode* _pTableNode,
::com::sun::star::uno::Any &_rCatalog,
OUString &_rSchema,
OUString &_rTable
@@ -434,7 +434,7 @@ namespace connectivity
*/
bool impl_parseTableNameNodeToString_throw( OUStringBuffer& rString, const SQLParseNodeParameter& rParam ) const;
- sal_Bool addDateValue(OUStringBuffer& rString, const SQLParseNodeParameter& rParam) const;
+ bool addDateValue(OUStringBuffer& rString, const SQLParseNodeParameter& rParam) const;
OUString convertDateTimeString(const SQLParseNodeParameter& rParam, const OUString& rString) const;
OUString convertDateString(const SQLParseNodeParameter& rParam, const OUString& rString) const;
OUString convertTimeString(const SQLParseNodeParameter& rParam, const OUString& rString) const;