/aoo41x/main/sdext/source/pdfimport/tree/ |
H A D | genericelements.cxx | 46 while( !Children.empty() ) in ~Element() 50 Children.pop_front(); in ~Element() 56 for( std::list< Element* >::iterator it = Children.begin(); it != Children.end(); ++it ) in applyToChildren() 64 pNewParent->Children.splice( pNewParent->Children.end(), (*el)->Parent->Children, el ); in setParent() 105 for( std::list< Element* >::iterator it = Children.begin(); it != Children.end(); ++it ) in emitStructure() 187 for( std::list< Element* >::iterator it = Children.begin(); it != Children.end(); ++it ) in emitStructure() 203 while( it != Children.end() ) in isSingleLined() 234 for( std::list< Element* >::const_iterator it = Children.begin(); it != Children.end(); ++it ) in getLineHeight() 361 return ! pLink->Children.empty(); in resolveHyperlink() 368 if( ! resolveHyperlink( Hyperlinks.Children.begin(), Children ) ) in resolveHyperlinks() [all …]
|
H A D | writertreevisiting.cxx | 44 if( elem.Children.empty() ) in visit() 202 if( elem.Children.empty() ) in visit() 318 … for( std::list< Element* >::iterator it = elem.Children.begin(); it != elem.Children.end(); ++it ) in visit() 336 … for( std::list< Element* >::iterator it = elem.Children.begin(); it != elem.Children.end(); ++it ) in visit() 409 elem.Children.splice( elem.Children.end(), pNext->Children ); in visit() 493 next_page_element = elem.Children.begin(); in visit() 670 while( it != rElem.Children.end() ) in checkHeaderAndFooter() 697 while( rit != rElem.Children.rend() ) in checkHeaderAndFooter() 742 while( next != rParent.Children.end() ) in optimizeTextElements() 811 pCur->Children.splice( pCur->Children.end(), pNext->Children ); in optimizeTextElements() [all …]
|
H A D | drawtreevisiting.cxx | 94 if( elem.Children.empty() ) in visit() 276 if( elem.Children.empty() ) in visit() 446 if( this_it != elem.Parent->Children.end() ) in visit() 483 elem.Children.splice( elem.Children.end(), pNext->Children ); in visit() 517 next_page_element = elem.Children.begin(); in visit() 523 while( next_page_element != elem.Children.end() ) in visit() 534 it != pCurPara->Children.end(); ++it ) in visit() 723 while( next != rParent.Children.end() ) in optimizeTextElements() 776 pCur->Children.splice( pCur->Children.end(), pNext->Children ); in optimizeTextElements() 778 rParent.Children.erase( next ); in optimizeTextElements() [all …]
|
H A D | pdfiprocessor.cxx | 917 for( std::list< Element* >::iterator it = m_pDocument->Children.begin(); in sortDocument() 918 it != m_pDocument->Children.end(); ++it ) in sortDocument() 971 if( pEle->Children.empty() ) in sortElements() 976 for( std::list< Element* >::iterator it = pEle->Children.begin(); in sortElements() 977 it != pEle->Children.end(); ++it ) in sortElements() 990 while( ! pEle->Children.empty() ) in sortElements() 992 aChildren.push_back( pEle->Children.front() ); in sortElements() 993 pEle->Children.pop_front(); in sortElements() 1004 pEle->Children.push_back( aChildren[i] ); in sortElements()
|
H A D | genericelements.hxx | 84 pParent->Children.push_back( this ); in Element() 107 std::list<Element*> Children; member
|
/aoo41x/main/xml2cmp/source/xcd/ |
H A D | xmlelem.cxx | 74 io_rParser.Parse_Sequence( Children(), Name() ); in Parse() 82 Children()[nIndexNameElement]->Write2Html(io_rHC); in Write2Html() 83 for ( unsigned i = 0; i < Children().size(); ++i ) in Write2Html() 87 Children()[i]->Write2Html(io_rHC); in Write2Html() 110 io_rParser.Parse_FreeChoice(Children()); in Parse() 116 for ( unsigned i = 0; i < Children().size(); ++i ) in Write2Html() 118 Children()[i]->Write2Html(io_rHC); in Write2Html() 138 for ( unsigned i = 0; i < Children().size(); ++i ) in Write2Html() 140 Children()[i]->Write2Html(io_rHC); in Write2Html() 148 Children().push_back( pNew ); in Create_and_Add_NewElement()
|
H A D | xmltree.cxx | 146 Children().push_back(pCD); in Create_and_Add_NewElement() 254 i < Children().size(); 257 if ( strcmp(Children()[i]->Name(), C_sServiceDependency) == 0 ) 258 return Children()[i]; 266 return *Children()[C_nSupportedServicesIndex]; 272 for ( unsigned i = C_nEarliestPossibleServiceDependenciesIndex; i < Children().size(); ++i ) 274 if ( strcmp(Children()[i]->Name(),C_sServiceDependency) == 0) 275 return Children()[i];
|
H A D | xmlelem.hxx | 84 const ChildList & Children() const { return aChildren; } in Children() function in MultipleElement 85 ChildList & Children() { return aChildren; } in Children() function in MultipleElement
|
/aoo41x/main/offapi/com/sun/star/ucb/ |
H A D | HierarchyDataReadAccess.idl | 57 <li>"Children", which is of type <type>HierarchyDataReadAccess</type> or 72 <li><code>getByName( "Children" )</code> will return an <atom>any</atom> 115 <code>getByHierarchicalName( "Children/['subnode1']" )</code> will give 124 <code>getByHierarchicalName( "Children/['subnode2']/TargetURL" )</code> 130 <code>getByHierarchicalName( "Children/['subnode3']/Children" )</code> 131 will give direct access to the "Children" data member of the child node
|
H A D | HierarchyDataReadWriteAccess.idl | 59 points to the "Children" data member of a node or to the root node. 63 TargetURL, Children) must never be removable.
|
/aoo41x/main/configmgr/source/ |
H A D | modifications.cxx | 42 Node::Children::iterator j(p->children.find(*i)); in add() 47 j = p->children.insert(Node::Children::value_type(*i, Node())). in add() 62 Node::Children::iterator j(p->children.find(*i)); in remove()
|
H A D | modifications.hxx | 41 typedef boost::unordered_map< rtl::OUString, Node, rtl::OUStringHash > Children; typedef 43 Children children;
|
H A D | partial.hxx | 53 typedef boost::unordered_map< rtl::OUString, Node, rtl::OUStringHash > Children; typedef 58 Children children;
|
H A D | partial.cxx | 104 Node::Children::iterator j(p->children.find(seg)); in Partial() 121 Node::Children::const_iterator j(p->children.find(*i)); in contains()
|
H A D | writemodfile.cxx | 509 for (Modifications::Node::Children::const_iterator i( in writeModifications() 571 for (Modifications::Node::Children::const_iterator j( in writeModFile()
|
/aoo41x/main/vcl/unx/headless/ |
H A D | svpframe.cxx | 75 std::list<SvpSalFrame*> Children = m_aChildren; in ~SvpSalFrame() local 76 for( std::list<SvpSalFrame*>::iterator it = Children.begin(); in ~SvpSalFrame() 77 it != Children.end(); ++it ) in ~SvpSalFrame()
|
/aoo41x/main/scripting/java/org/openoffice/netbeans/modules/office/loader/ |
H A D | ParcelDescriptorDataNode.java | 40 this(obj, Children.LEAF); in ParcelDescriptorDataNode() 43 public ParcelDescriptorDataNode(ParcelDescriptorDataObject obj, Children ch) { in ParcelDescriptorDataNode()
|
H A D | ParcelDataNode.java | 47 this(obj, Children.LEAF); in ParcelDataNode() 50 public ParcelDataNode(ParcelDataObject obj, Children ch) { in ParcelDataNode()
|
H A D | ParcelDescriptorDataObject.java | 68 return new ParcelDescriptorDataNode(this, Children.LEAF); in createNodeDelegate()
|
/aoo41x/main/codemaker/inc/codemaker/ |
H A D | exceptiontree.hxx | 40 typedef std::vector< ExceptionTreeNode * > Children; typedef 57 Children children;
|
/aoo41x/main/codemaker/source/codemaker/ |
H A D | exceptiontree.cxx | 50 for (Children::iterator i(children.begin()); i != children.end(); ++i) { in clearChildren() 87 for (ExceptionTreeNode::Children::iterator j( in add()
|
/aoo41x/main/scripting/java/org/openoffice/netbeans/modules/office/nodes/ |
H A D | OfficeDocumentChildren.java | 40 public class OfficeDocumentChildren extends Children.Keys 94 super(Children.LEAF); in ParcelNode()
|
/aoo41x/main/offapi/com/sun/star/awt/ |
H A D | AccessibleIconChoiceControl.idl | 59 …<li>Children: There exists children of type <type scope="com::sun::star::awt">AccessibleIconChoice… 91 … >AccessibleStateType::MANAGES_DESCENDANTS</const> is always set. Children are transient.</li>
|
/aoo41x/main/xmlhelp/source/treeview/ |
H A D | tvread.cxx | 312 Children = new TVChildTarget( configData,tvDom ); in TVRead() 342 cppu::OWeakObject* p = Children.get(); in getByName() 397 return Children->getByHierarchicalName( name.copy( 1 + idx ) ); in getByHierarchicalName() 414 return Children->hasByHierarchicalName( name.copy( 1 + idx ) ); in hasByHierarchicalName()
|
/aoo41x/main/offapi/com/sun/star/drawing/ |
H A D | AccessibleShape.idl | 49 See the section Children in the description of the 89 <li>Children: The children of a shape are either other accessible
|