BeautifulSoup::PageElement Class Reference

Inheritance diagram for BeautifulSoup::PageElement:

List of all members.

Public Member Functions
def	append
def	append
def	extract
def	extract
def	findAllNext
def	findAllNext
def	findAllPrevious
def	findAllPrevious
def	findNext
def	findNext
def	findNextSibling
def	findNextSibling
def	findNextSiblings
def	findNextSiblings
def	findParent
def	findParent
def	findParents
def	findParents
def	findPrevious
def	findPrevious
def	findPreviousSibling
def	findPreviousSibling
def	findPreviousSiblings
def	findPreviousSiblings
def	insert
def	insert
def	nextGenerator
def	nextGenerator
def	nextSiblingGenerator
def	nextSiblingGenerator
def	parentGenerator
def	parentGenerator
def	previousGenerator
def	previousGenerator
def	previousSiblingGenerator
def	previousSiblingGenerator
def	replaceWith
def	replaceWith
def	setup
def	setup
def	substituteEncoding
def	substituteEncoding
def	toEncoding
def	toEncoding
Public Attributes
	next
	nextSibling
	parent
	previous
	previousSibling
Static Public Attributes
	fetchNextSiblings = findNextSiblings
	fetchParents = findParents
	fetchPrevious = findAllPrevious
	fetchPreviousSiblings = findPreviousSiblings
Private Member Functions
def	_findAll
def	_findAll
def	_findOne
def	_findOne
def	_lastRecursiveChild
def	_lastRecursiveChild

---

Detailed Description

Contains the navigational information for some part of the page
(either a tag or a piece of text)

Definition at line 114 of file BeautifulSoup.py.

---

Member Function Documentation

def BeautifulSoup::PageElement::_findAll	(		self,
			name,
			attrs,
			text,
			limit,
			generator,
			kwargs
	)		[private]

Definition at line 325 of file BeautifulSoup.py.

                                                                     :
        "Iterates over a generator looking for things that match."

        if isinstance(name, SoupStrainer):
            strainer = name
        else:
            # Build a SoupStrainer
            strainer = SoupStrainer(name, attrs, text, **kwargs)
        results = ResultSet(strainer)
        g = generator()
        while True:
            try:
                i = g.next()
            except StopIteration:
                break
            if i:
                found = strainer.search(i)
                if found:
                    results.append(found)
                    if limit and len(results) >= limit:
                        break
        return results

def BeautifulSoup::PageElement::_findAll	(		self,
			name,
			attrs,
			text,
			limit,
			generator,
			kwargs
	)		[private]

Definition at line 325 of file BeautifulSoup.py.

                                                                     :
        "Iterates over a generator looking for things that match."

        if isinstance(name, SoupStrainer):
            strainer = name
        else:
            # Build a SoupStrainer
            strainer = SoupStrainer(name, attrs, text, **kwargs)
        results = ResultSet(strainer)
        g = generator()
        while True:
            try:
                i = g.next()
            except StopIteration:
                break
            if i:
                found = strainer.search(i)
                if found:
                    results.append(found)
                    if limit and len(results) >= limit:
                        break
        return results

def BeautifulSoup::PageElement::_findOne	(		self,
			method,
			name,
			attrs,
			text,
			kwargs
	)		[private]

Definition at line 318 of file BeautifulSoup.py.

                                                           :
        r = None
        l = method(name, attrs, text, 1, **kwargs)
        if l:
            r = l[0]
        return r

def BeautifulSoup::PageElement::_findOne	(		self,
			method,
			name,
			attrs,
			text,
			kwargs
	)		[private]

Definition at line 318 of file BeautifulSoup.py.

                                                           :
        r = None
        l = method(name, attrs, text, 1, **kwargs)
        if l:
            r = l[0]
        return r

def BeautifulSoup::PageElement::_lastRecursiveChild

(

self

)

[private]

Definition at line 173 of file BeautifulSoup.py.

                                 :
        "Finds the last element beneath this object to be parsed."
        lastChild = self
        while hasattr(lastChild, 'contents') and lastChild.contents:
            lastChild = lastChild.contents[-1]
        return lastChild

def BeautifulSoup::PageElement::_lastRecursiveChild

(

self

)

[private]

Definition at line 173 of file BeautifulSoup.py.

                                 :
        "Finds the last element beneath this object to be parsed."
        lastChild = self
        while hasattr(lastChild, 'contents') and lastChild.contents:
            lastChild = lastChild.contents[-1]
        return lastChild

def BeautifulSoup::PageElement::append	(		self,
			tag
	)

Appends the given tag to the contents of this tag.

Definition at line 240 of file BeautifulSoup.py.

                         :
        """Appends the given tag to the contents of this tag."""
        self.insert(len(self.contents), tag)

def BeautifulSoup::PageElement::append	(		self,
			tag
	)

Appends the given tag to the contents of this tag.

Definition at line 240 of file BeautifulSoup.py.

                         :
        """Appends the given tag to the contents of this tag."""
        self.insert(len(self.contents), tag)

def BeautifulSoup::PageElement::extract

(

self

)

Destructively rips this element out of the tree.

Definition at line 144 of file BeautifulSoup.py.

                     :
        """Destructively rips this element out of the tree."""
        if self.parent:
            try:
                self.parent.contents.remove(self)
            except ValueError:
                pass

        #Find the two elements that would be next to each other if
        #this element (and any children) hadn't been parsed. Connect
        #the two.
        lastChild = self._lastRecursiveChild()
        nextElement = lastChild.next

        if self.previous:
            self.previous.next = nextElement
        if nextElement:
            nextElement.previous = self.previous
        self.previous = None
        lastChild.next = None

        self.parent = None
        if self.previousSibling:
            self.previousSibling.nextSibling = self.nextSibling
        if self.nextSibling:
            self.nextSibling.previousSibling = self.previousSibling
        self.previousSibling = self.nextSibling = None
        return self

def BeautifulSoup::PageElement::extract

(

self

)

Destructively rips this element out of the tree.

Definition at line 144 of file BeautifulSoup.py.

                     :
        """Destructively rips this element out of the tree."""
        if self.parent:
            try:
                self.parent.contents.remove(self)
            except ValueError:
                pass

        #Find the two elements that would be next to each other if
        #this element (and any children) hadn't been parsed. Connect
        #the two.
        lastChild = self._lastRecursiveChild()
        nextElement = lastChild.next

        if self.previous:
            self.previous.next = nextElement
        if nextElement:
            nextElement.previous = self.previous
        self.previous = None
        lastChild.next = None

        self.parent = None
        if self.previousSibling:
            self.previousSibling.nextSibling = self.nextSibling
        if self.nextSibling:
            self.nextSibling.previousSibling = self.previousSibling
        self.previousSibling = self.nextSibling = None
        return self

def BeautifulSoup::PageElement::findAllNext	(		self,
			name = None,
			attrs = {},
			text = None,
			limit = None,
			kwargs
	)

Returns all items that match the given criteria and appear
after this Tag in the document.

Definition at line 249 of file BeautifulSoup.py.

                                           {}, text=None, limit=None,
                    **kwargs):
        """Returns all items that match the given criteria and appear
        after this Tag in the document."""
        return self._findAll(name, attrs, text, limit, self.nextGenerator,
                             **kwargs)

def BeautifulSoup::PageElement::findAllNext	(		self,
			name = None,
			attrs = {},
			text = None,
			limit = None,
			kwargs
	)

Returns all items that match the given criteria and appear
after this Tag in the document.

Definition at line 249 of file BeautifulSoup.py.

                                           {}, text=None, limit=None,
                    **kwargs):
        """Returns all items that match the given criteria and appear
        after this Tag in the document."""
        return self._findAll(name, attrs, text, limit, self.nextGenerator,
                             **kwargs)

def BeautifulSoup::PageElement::findAllPrevious	(		self,
			name = None,
			attrs = {},
			text = None,
			limit = None,
			kwargs
	)

Returns all items that match the given criteria and appear
before this Tag in the document.

Definition at line 275 of file BeautifulSoup.py.

                                               {}, text=None, limit=None,
                        **kwargs):
        """Returns all items that match the given criteria and appear
        before this Tag in the document."""
        return self._findAll(name, attrs, text, limit, self.previousGenerator,
                           **kwargs)

def BeautifulSoup::PageElement::findAllPrevious	(		self,
			name = None,
			attrs = {},
			text = None,
			limit = None,
			kwargs
	)

Returns all items that match the given criteria and appear
before this Tag in the document.

Definition at line 275 of file BeautifulSoup.py.

                                               {}, text=None, limit=None,
                        **kwargs):
        """Returns all items that match the given criteria and appear
        before this Tag in the document."""
        return self._findAll(name, attrs, text, limit, self.previousGenerator,
                           **kwargs)

def BeautifulSoup::PageElement::findNext	(		self,
			name = None,
			attrs = {},
			text = None,
			kwargs
	)

Returns the first item that matches the given criteria and
appears after this Tag in the document.

Definition at line 244 of file BeautifulSoup.py.

                                        {}, text=None, **kwargs):
        """Returns the first item that matches the given criteria and
        appears after this Tag in the document."""
        return self._findOne(self.findAllNext, name, attrs, text, **kwargs)

def BeautifulSoup::PageElement::findNext	(		self,
			name = None,
			attrs = {},
			text = None,
			kwargs
	)

Returns the first item that matches the given criteria and
appears after this Tag in the document.

Definition at line 244 of file BeautifulSoup.py.

                                        {}, text=None, **kwargs):
        """Returns the first item that matches the given criteria and
        appears after this Tag in the document."""
        return self._findOne(self.findAllNext, name, attrs, text, **kwargs)

def BeautifulSoup::PageElement::findNextSibling	(		self,
			name = None,
			attrs = {},
			text = None,
			kwargs
	)

Returns the closest sibling to this Tag that matches the
given criteria and appears after this Tag in the document.

Definition at line 256 of file BeautifulSoup.py.

                                               {}, text=None, **kwargs):
        """Returns the closest sibling to this Tag that matches the
        given criteria and appears after this Tag in the document."""
        return self._findOne(self.findNextSiblings, name, attrs, text,
                             **kwargs)

def BeautifulSoup::PageElement::findNextSibling	(		self,
			name = None,
			attrs = {},
			text = None,
			kwargs
	)

Returns the closest sibling to this Tag that matches the
given criteria and appears after this Tag in the document.

Definition at line 256 of file BeautifulSoup.py.

                                               {}, text=None, **kwargs):
        """Returns the closest sibling to this Tag that matches the
        given criteria and appears after this Tag in the document."""
        return self._findOne(self.findNextSiblings, name, attrs, text,
                             **kwargs)

def BeautifulSoup::PageElement::findNextSiblings	(		self,
			name = None,
			attrs = {},
			text = None,
			limit = None,
			kwargs
	)

Returns the siblings of this Tag that match the given
criteria and appear after this Tag in the document.

Definition at line 262 of file BeautifulSoup.py.

                                                {}, text=None, limit=None,
                         **kwargs):
        """Returns the siblings of this Tag that match the given
        criteria and appear after this Tag in the document."""
        return self._findAll(name, attrs, text, limit,
                             self.nextSiblingGenerator, **kwargs)

def BeautifulSoup::PageElement::findNextSiblings	(		self,
			name = None,
			attrs = {},
			text = None,
			limit = None,
			kwargs
	)

Returns the siblings of this Tag that match the given
criteria and appear after this Tag in the document.

Definition at line 262 of file BeautifulSoup.py.

                                                {}, text=None, limit=None,
                         **kwargs):
        """Returns the siblings of this Tag that match the given
        criteria and appear after this Tag in the document."""
        return self._findAll(name, attrs, text, limit,
                             self.nextSiblingGenerator, **kwargs)

def BeautifulSoup::PageElement::findParent	(		self,
			name = None,
			attrs = {},
			kwargs
	)

Returns the closest parent of this Tag that matches the given
criteria.

Definition at line 297 of file BeautifulSoup.py.

                                          {}, **kwargs):
        """Returns the closest parent of this Tag that matches the given
        criteria."""
        # NOTE: We can't use _findOne because findParents takes a different
        # set of arguments.
        r = None
        l = self.findParents(name, attrs, 1)
        if l:
            r = l[0]
        return r

def BeautifulSoup::PageElement::findParent	(		self,
			name = None,
			attrs = {},
			kwargs
	)

Returns the closest parent of this Tag that matches the given
criteria.

Definition at line 297 of file BeautifulSoup.py.

                                          {}, **kwargs):
        """Returns the closest parent of this Tag that matches the given
        criteria."""
        # NOTE: We can't use _findOne because findParents takes a different
        # set of arguments.
        r = None
        l = self.findParents(name, attrs, 1)
        if l:
            r = l[0]
        return r

def BeautifulSoup::PageElement::findParents	(		self,
			name = None,
			attrs = {},
			limit = None,
			kwargs
	)

Returns the parents of this Tag that match the given
criteria.

Definition at line 308 of file BeautifulSoup.py.

                                           {}, limit=None, **kwargs):
        """Returns the parents of this Tag that match the given
        criteria."""

        return self._findAll(name, attrs, None, limit, self.parentGenerator,
                             **kwargs)

def BeautifulSoup::PageElement::findParents	(		self,
			name = None,
			attrs = {},
			limit = None,
			kwargs
	)

Returns the parents of this Tag that match the given
criteria.

Definition at line 308 of file BeautifulSoup.py.

                                           {}, limit=None, **kwargs):
        """Returns the parents of this Tag that match the given
        criteria."""

        return self._findAll(name, attrs, None, limit, self.parentGenerator,
                             **kwargs)

def BeautifulSoup::PageElement::findPrevious	(		self,
			name = None,
			attrs = {},
			text = None,
			kwargs
	)

Returns the first item that matches the given criteria and
appears before this Tag in the document.

Definition at line 270 of file BeautifulSoup.py.

                                            {}, text=None, **kwargs):
        """Returns the first item that matches the given criteria and
        appears before this Tag in the document."""
        return self._findOne(self.findAllPrevious, name, attrs, text, **kwargs)

def BeautifulSoup::PageElement::findPrevious	(		self,
			name = None,
			attrs = {},
			text = None,
			kwargs
	)

Returns the first item that matches the given criteria and
appears before this Tag in the document.

Definition at line 270 of file BeautifulSoup.py.

                                            {}, text=None, **kwargs):
        """Returns the first item that matches the given criteria and
        appears before this Tag in the document."""
        return self._findOne(self.findAllPrevious, name, attrs, text, **kwargs)

def BeautifulSoup::PageElement::findPreviousSibling	(		self,
			name = None,
			attrs = {},
			text = None,
			kwargs
	)

Returns the closest sibling to this Tag that matches the
given criteria and appears before this Tag in the document.

Definition at line 283 of file BeautifulSoup.py.

                                                   {}, text=None, **kwargs):
        """Returns the closest sibling to this Tag that matches the
        given criteria and appears before this Tag in the document."""
        return self._findOne(self.findPreviousSiblings, name, attrs, text,
                             **kwargs)

def BeautifulSoup::PageElement::findPreviousSibling	(		self,
			name = None,
			attrs = {},
			text = None,
			kwargs
	)

Returns the closest sibling to this Tag that matches the
given criteria and appears before this Tag in the document.

Definition at line 283 of file BeautifulSoup.py.

                                                   {}, text=None, **kwargs):
        """Returns the closest sibling to this Tag that matches the
        given criteria and appears before this Tag in the document."""
        return self._findOne(self.findPreviousSiblings, name, attrs, text,
                             **kwargs)

def BeautifulSoup::PageElement::findPreviousSiblings	(		self,
			name = None,
			attrs = {},
			text = None,
			limit = None,
			kwargs
	)

Returns the siblings of this Tag that match the given
criteria and appear before this Tag in the document.

Definition at line 289 of file BeautifulSoup.py.

                                                    {}, text=None,
                             limit=None, **kwargs):
        """Returns the siblings of this Tag that match the given
        criteria and appear before this Tag in the document."""
        return self._findAll(name, attrs, text, limit,
                             self.previousSiblingGenerator, **kwargs)

def BeautifulSoup::PageElement::findPreviousSiblings	(		self,
			name = None,
			attrs = {},
			text = None,
			limit = None,
			kwargs
	)

Returns the siblings of this Tag that match the given
criteria and appear before this Tag in the document.

Definition at line 289 of file BeautifulSoup.py.

                                                    {}, text=None,
                             limit=None, **kwargs):
        """Returns the siblings of this Tag that match the given
        criteria and appear before this Tag in the document."""
        return self._findAll(name, attrs, text, limit,
                             self.previousSiblingGenerator, **kwargs)

def BeautifulSoup::PageElement::insert	(		self,
			position,
			newChild
	)

Definition at line 180 of file BeautifulSoup.py.

                                        :
        if (isinstance(newChild, basestring)
            or isinstance(newChild, unicode)) \
            and not isinstance(newChild, NavigableString):
            newChild = NavigableString(newChild)

        position =  min(position, len(self.contents))
        if hasattr(newChild, 'parent') and newChild.parent != None:
            # We're 'inserting' an element that's already one
            # of this object's children.
            if newChild.parent == self:
                index = self.find(newChild)
                if index and index < position:
                    # Furthermore we're moving it further down the
                    # list of this object's children. That means that
                    # when we extract this element, our target index
                    # will jump down one.
                    position = position - 1
            newChild.extract()

        newChild.parent = self
        previousChild = None
        if position == 0:
            newChild.previousSibling = None
            newChild.previous = self
        else:
            previousChild = self.contents[position-1]
            newChild.previousSibling = previousChild
            newChild.previousSibling.nextSibling = newChild
            newChild.previous = previousChild._lastRecursiveChild()
        if newChild.previous:
            newChild.previous.next = newChild

        newChildsLastElement = newChild._lastRecursiveChild()

        if position >= len(self.contents):
            newChild.nextSibling = None

            parent = self
            parentsNextSibling = None
            while not parentsNextSibling:
                parentsNextSibling = parent.nextSibling
                parent = parent.parent
                if not parent: # This is the last element in the document.
                    break
            if parentsNextSibling:
                newChildsLastElement.next = parentsNextSibling
            else:
                newChildsLastElement.next = None
        else:
            nextChild = self.contents[position]
            newChild.nextSibling = nextChild
            if newChild.nextSibling:
                newChild.nextSibling.previousSibling = newChild
            newChildsLastElement.next = nextChild

        if newChildsLastElement.next:
            newChildsLastElement.next.previous = newChildsLastElement
        self.contents.insert(position, newChild)

def BeautifulSoup::PageElement::insert	(		self,
			position,
			newChild
	)

Definition at line 180 of file BeautifulSoup.py.

                                        :
        if (isinstance(newChild, basestring)
            or isinstance(newChild, unicode)) \
            and not isinstance(newChild, NavigableString):
            newChild = NavigableString(newChild)

        position =  min(position, len(self.contents))
        if hasattr(newChild, 'parent') and newChild.parent != None:
            # We're 'inserting' an element that's already one
            # of this object's children.
            if newChild.parent == self:
                index = self.find(newChild)
                if index and index < position:
                    # Furthermore we're moving it further down the
                    # list of this object's children. That means that
                    # when we extract this element, our target index
                    # will jump down one.
                    position = position - 1
            newChild.extract()

        newChild.parent = self
        previousChild = None
        if position == 0:
            newChild.previousSibling = None
            newChild.previous = self
        else:
            previousChild = self.contents[position-1]
            newChild.previousSibling = previousChild
            newChild.previousSibling.nextSibling = newChild
            newChild.previous = previousChild._lastRecursiveChild()
        if newChild.previous:
            newChild.previous.next = newChild

        newChildsLastElement = newChild._lastRecursiveChild()

        if position >= len(self.contents):
            newChild.nextSibling = None

            parent = self
            parentsNextSibling = None
            while not parentsNextSibling:
                parentsNextSibling = parent.nextSibling
                parent = parent.parent
                if not parent: # This is the last element in the document.
                    break
            if parentsNextSibling:
                newChildsLastElement.next = parentsNextSibling
            else:
                newChildsLastElement.next = None
        else:
            nextChild = self.contents[position]
            newChild.nextSibling = nextChild
            if newChild.nextSibling:
                newChild.nextSibling.previousSibling = newChild
            newChildsLastElement.next = nextChild

        if newChildsLastElement.next:
            newChildsLastElement.next.previous = newChildsLastElement
        self.contents.insert(position, newChild)

def BeautifulSoup::PageElement::nextGenerator

(

self

)

Definition at line 350 of file BeautifulSoup.py.

                           :
        i = self
        while i:
            i = i.next
            yield i

def BeautifulSoup::PageElement::nextGenerator

(

self

)

Definition at line 350 of file BeautifulSoup.py.

                           :
        i = self
        while i:
            i = i.next
            yield i

def BeautifulSoup::PageElement::nextSiblingGenerator

(

self

)

Definition at line 356 of file BeautifulSoup.py.

                                  :
        i = self
        while i:
            i = i.nextSibling
            yield i

def BeautifulSoup::PageElement::nextSiblingGenerator

(

self

)

Definition at line 356 of file BeautifulSoup.py.

                                  :
        i = self
        while i:
            i = i.nextSibling
            yield i

def BeautifulSoup::PageElement::parentGenerator

(

self

)

Definition at line 374 of file BeautifulSoup.py.

                             :
        i = self
        while i:
            i = i.parent
            yield i

def BeautifulSoup::PageElement::parentGenerator

(

self

)

Definition at line 374 of file BeautifulSoup.py.

                             :
        i = self
        while i:
            i = i.parent
            yield i

def BeautifulSoup::PageElement::previousGenerator

(

self

)

Definition at line 362 of file BeautifulSoup.py.

                               :
        i = self
        while i:
            i = i.previous
            yield i

def BeautifulSoup::PageElement::previousGenerator

(

self

)

Definition at line 362 of file BeautifulSoup.py.

                               :
        i = self
        while i:
            i = i.previous
            yield i

def BeautifulSoup::PageElement::previousSiblingGenerator

(

self

)

Definition at line 368 of file BeautifulSoup.py.

                                      :
        i = self
        while i:
            i = i.previousSibling
            yield i

def BeautifulSoup::PageElement::previousSiblingGenerator

(

self

)

Definition at line 368 of file BeautifulSoup.py.

                                      :
        i = self
        while i:
            i = i.previousSibling
            yield i

def BeautifulSoup::PageElement::replaceWith	(		self,
			replaceWith
	)

Definition at line 130 of file BeautifulSoup.py.

                                      :
        oldParent = self.parent
        myIndex = self.parent.contents.index(self)
        if hasattr(replaceWith, 'parent') and replaceWith.parent == self.parent:
            # We're replacing this element with one of its siblings.
            index = self.parent.contents.index(replaceWith)
            if index and index < myIndex:
                # Furthermore, it comes before this element. That
                # means that when we extract it, the index of this
                # element will change.
                myIndex = myIndex - 1
        self.extract()
        oldParent.insert(myIndex, replaceWith)

def BeautifulSoup::PageElement::replaceWith	(		self,
			replaceWith
	)

Definition at line 130 of file BeautifulSoup.py.

                                      :
        oldParent = self.parent
        myIndex = self.parent.contents.index(self)
        if hasattr(replaceWith, 'parent') and replaceWith.parent == self.parent:
            # We're replacing this element with one of its siblings.
            index = self.parent.contents.index(replaceWith)
            if index and index < myIndex:
                # Furthermore, it comes before this element. That
                # means that when we extract it, the index of this
                # element will change.
                myIndex = myIndex - 1
        self.extract()
        oldParent.insert(myIndex, replaceWith)

def BeautifulSoup::PageElement::setup	(		self,
			parent = None,
			previous = None
	)

Sets up the initial relations between this element and
other elements.

Definition at line 118 of file BeautifulSoup.py.

                                               :
        """Sets up the initial relations between this element and
        other elements."""
        self.parent = parent
        self.previous = previous
        self.next = None
        self.previousSibling = None
        self.nextSibling = None
        if self.parent and self.parent.contents:
            self.previousSibling = self.parent.contents[-1]
            self.previousSibling.nextSibling = self

def BeautifulSoup::PageElement::setup	(		self,
			parent = None,
			previous = None
	)

Sets up the initial relations between this element and
other elements.

Definition at line 118 of file BeautifulSoup.py.

                                               :
        """Sets up the initial relations between this element and
        other elements."""
        self.parent = parent
        self.previous = previous
        self.next = None
        self.previousSibling = None
        self.nextSibling = None
        if self.parent and self.parent.contents:
            self.previousSibling = self.parent.contents[-1]
            self.previousSibling.nextSibling = self

def BeautifulSoup::PageElement::substituteEncoding	(		self,
			str,
			encoding = None
	)

Definition at line 381 of file BeautifulSoup.py.

                                                    :
        encoding = encoding or "utf-8"
        return str.replace("%SOUP-ENCODING%", encoding)

def BeautifulSoup::PageElement::substituteEncoding	(		self,
			str,
			encoding = None
	)

Definition at line 381 of file BeautifulSoup.py.

                                                    :
        encoding = encoding or "utf-8"
        return str.replace("%SOUP-ENCODING%", encoding)

def BeautifulSoup::PageElement::toEncoding	(		self,
			s,
			encoding = None
	)

Encodes an object to a string in some encoding, or to Unicode.
.

Definition at line 385 of file BeautifulSoup.py.

                                          :
        """Encodes an object to a string in some encoding, or to Unicode.
        ."""
        if isinstance(s, unicode):
            if encoding:
                s = s.encode(encoding)
        elif isinstance(s, str):
            if encoding:
                s = s.encode(encoding)
            else:
                s = unicode(s)
        else:
            if encoding:
                s  = self.toEncoding(str(s), encoding)
            else:
                s = unicode(s)
        return s

def BeautifulSoup::PageElement::toEncoding	(		self,
			s,
			encoding = None
	)

Encodes an object to a string in some encoding, or to Unicode.
.

Definition at line 385 of file BeautifulSoup.py.

                                          :
        """Encodes an object to a string in some encoding, or to Unicode.
        ."""
        if isinstance(s, unicode):
            if encoding:
                s = s.encode(encoding)
        elif isinstance(s, str):
            if encoding:
                s = s.encode(encoding)
            else:
                s = unicode(s)
        else:
            if encoding:
                s  = self.toEncoding(str(s), encoding)
            else:
                s = unicode(s)
        return s

---

Member Data Documentation

BeautifulSoup::PageElement::fetchNextSiblings = findNextSiblings [static]

Definition at line 268 of file BeautifulSoup.py.

BeautifulSoup::PageElement::fetchParents = findParents [static]

Definition at line 314 of file BeautifulSoup.py.

BeautifulSoup::PageElement::fetchPrevious = findAllPrevious [static]

Definition at line 281 of file BeautifulSoup.py.

BeautifulSoup::PageElement::fetchPreviousSiblings = findPreviousSiblings [static]

Definition at line 295 of file BeautifulSoup.py.

BeautifulSoup::PageElement::next

Definition at line 119 of file BeautifulSoup.py.

BeautifulSoup::PageElement::nextSibling

Definition at line 119 of file BeautifulSoup.py.

BeautifulSoup::PageElement::parent

Definition at line 119 of file BeautifulSoup.py.

BeautifulSoup::PageElement::previous

Reimplemented in BeautifulSoup::BeautifulStoneSoup.

Definition at line 119 of file BeautifulSoup.py.

BeautifulSoup::PageElement::previousSibling

Definition at line 119 of file BeautifulSoup.py.