================================

===============================

.. _installing-pybind11:

Installing pybind11

--------------------

To install ``pybind11`` use pip

::

$ pip install pybind11

Or if you are using conda:

::

$ conda install pybind11

If you want to build ``pybind11`` yourself, you can install the dependencies and then run the following command in your source directory:

.. code-block:: bash

$ mkdir build && cd build && cmake .. && make -j$(nproc) && sudo make install

You can also use `conda env export` to create a conda environment with pybind11 and then use `conda env import` to recreate the same environment on a different machine. This will also take care of any dependencies that may have changed over time.

.. note::

``pybind11`` supports C++11 or higher. If you're using an older version of gcc, consider installing `gcc-7` which is known to work well with ``pybind11``: http://linuxcommand.org/lc3_software/How_to_Install_the_C_Compiler_GCC

.. note::

If you're using a different compiler, you can set it manually by passing the ``-DCMAKE_CXX_COMPILER=`` flag when running ``cmake``.

For example, if you have `gcc-7` installed in your system and you want to use that, you'd run:

.. code-block:: bash

$ cmake -DCMAKE_CXX_COMPILER=/usr/bin/g++-7 ..

Building pybind11 with python3.6 or higher

------------------------------------------

Since python3.6, ``pybind11`` now uses the `pybind11::embedded` module for building its embedded interpreter. This is a big change and requires some changes to the build system of ``pybind11``.

To compile ``pybind11`` with ``python3.6`` or higher, you need to follow these steps:

1. Clone pybind11 from `github.com/pybind/pybind11`_ and navigate into the source directory.

2. Create a subdirectory named ``build``, run ``cd build``, and then call ``cmake`` with the appropriate flags.

3. Compile ``pybind11`` with ``make -j$(nproc)`` (or use ``-j`` for building with fewer threads).

4. Install ``pybind11`` with ``sudo make install``.

.. note::

If you're using a different compiler, you can set it manually by passing the ``-DCMAKE_CXX_COMPILER=`` flag when running ``cmake``.

For example, if you have `gcc-7` installed in your system and you want to use that, you'd run:

.. code-block:: bash

$ cmake -DCMAKE_CXX_COMPILER=/usr/bin/g++-7 ..

.. warning::

The above build instructions assume that you have the appropriate version of python3.6 installed on your system and it is located at ``/usr/local/bin/python3.6``. If this is not the case, please update the path appropriately in the ``CMakeLists.txt`` file.

Also, make sure you have ``libffi-dev`` installed.

.. note::

If you're using Ubuntu or Debian, the above instructions will not work because the ``pybind11`` source code does not include the necessary files to build with Ubuntu/Debian. Instead, you can use the following commands:

.. code-block:: bash

$ cd /opt/python3.6/include/python3.6/

$ python3 -m ensurepip --default-pip

$ python3 -m pip install pybind11

Building pybind11 with python2.7 or higher

------------------------------------------

To compile ``pybind11`` with ``python2.7`` or higher, you need to follow these steps:

1. Clone pybind11 from `github.com/pybind/pybind11`_ and navigate into the source directory.

2. Create a subdirectory named ``build``, run ``cd build``, and then call ``cmake`` with the appropriate flags.

3. Compile ``pybind11`` with ``make -j$(nproc)`` (or use ``-j`` for building with fewer threads).

4. Install ``pybind11`` with ``sudo make install``.

.. note::

If you're using a different compiler, you can set it manually by passing the ``-DCMAKE_CXX_COMPILER=`` flag when running ``cmake``.

For example, if you have `gcc-7` installed in your system and you want to use that, you'd run:

.. code-block:: bash

$ cmake -DCMAKE_CXX_COMPILER=/usr/bin/g++-7 ..

.. note::

If you're using Ubuntu or Debian, the above instructions will not work because the ``pybind11`` source code does not include the necessary files to build with Ubuntu/Debian. Instead, you can use the following commands:

.. code-block:: bash

$ cd /opt/python2.7/include/python2.7/

$ python -m ensurepip --default-pip

$ python -m pip install pybind11

.. note::

If you're using python2.7, make sure to also install ``libffi-dev``:

.. code-block:: bash

$ sudo apt-get install libffi-dev

Building with gcc6 and older versions of python

-----------------------------------------------

Python 3.4+ uses the GCC6 compiler by default. However, if you need to build ``pybind11`` with an older version of gcc (e.g., GCC5), you can set the ``CMAKE_CXX_COMPILER`` flag when calling cmake:

.. code-block:: bash

$ mkdir build && cd build && cmake -DCMAKE_CXX_COMPILER=/usr/bin/g++-5 ..

If you're using python2.7 and you want to use an older version of gcc, make sure to also install the necessary dependencies for that version of gcc (e.g., ``libffi-dev``).

1. Let g be h(p). Let p be ((-12)/(-9))/(6/(-30)). Let h(l) = l**3 - 5*l**2 + 8*l + 7. Solve -2*w - 4 = -2*z, w - 3 = -g*z for z.

A: 1

#include

using namespace std;

//--------------------------------------------------------------------------------------------------

class node{

public:

int value;

node* left;

node* right;

};

//--------------------------------------------------------------------------------------------------

node* createNode(int v){

node* n = new node();

n->value = v;

n->left = NULL;

n->right = NULL;

return n;

}

//--------------------------------------------------------------------------------------------------

void insert(node* r, int value){

if (r == NULL) {

r = createNode(value);

}

else{

if (value < r->value)

insert(r->left, value);

else

insert(r->right, value);

}

}

//--------------------------------------------------------------------------------------------------

void inorder(node* root){

if (root != NULL) {

inorder(root->left);

cout << root->value << " ";

inorder(root->right);

}

}

//--------------------------------------------------------------------------------------------------

int maxValue(node* root, int v){

int l = 0, r = 0;

if (root != NULL) {

l = maxValue(root->left,v);

r = maxValue(root->right,v);

}

else {

return 1;

}

return r > l ? r : l;

}

//--------------------------------------------------------------------------------------------------

int findHeight(node* root){

if (root == NULL)

return 0;

return max(findHeight(root->left),findHeight(root->right)) + 1;

}

//--------------------------------------------------------------------------------------------------

bool isBalanced(node* r){

int l = findHeight(r->left);

int rght = findHeight(r->right);

if (l < max(0,rght-1) && l > min(0,rght+1))

return true;

else

return false;

}

//--------------------------------------------------------------------------------------------------

node* insertBalancedTree(node* r, int value){

if (isBalanced(r)) {

if (value < r->value)

r->left = insertBalancedTree(r->left, value);

else

r->right = insertBalancedTree(r->right, value);

}

else{

if (value < r->value)

r->left = NULL;

else

r->right = NULL;

}

return r;

}

//--------------------------------------------------------------------------------------------------

void printInOrder(node* root){

if (root != NULL) {

printInOrder(root->left);

cout << root->value << " ";

printInOrder(root->right);

}

}

//--------------------------------------------------------------------------------------------------

int main()

{

node* r = createNode(10);

insert(r,5);

insert(r,15);

insert(r,2);

insert(r,7);

insert(r,12);

insert(r,18);

printInOrder(r);

cout << endl;

cout << "Height of tree : " << findHeight(r) << endl;

bool ans = isBalanced(r);

cout << "Is tree balanced ? " << (ans==true?"Yes":"No") << endl;

r = insertBalancedTree(r, 17);

printInOrder(r);

cout << endl;

bool ans2 = isBalanced(r);

cout << "Is tree balanced ? " << (ans2==true?"Yes":"No") << endl;

return 0;

}

Solve 5*b + 14 = -0*g, 2*g - 3*b = 8 for g.

A: -5

2745. Suppose 5*i = -9*q + 12*q - 30, 0 = 5*i - q + 6. Is i > -3/8?

A: False

| [Home](../index.html) | [Practices](../practices/index.html) | [Code](../code/index.html) | [Examples](../examples/index.html)

## The Problem

Given a string of text and a list of words, return the number of times each word appears in the text.

For example, if `text = "The quick brown fox jumps over the lazy dog"` and `words = ["the", "quick", "brown", "fox", "jumps", "over", "lazy", "dog"]`, then the function should return:

```

{

"the": 1,

"quick": 1,

"brown": 1,

"fox": 1,

"jumps": 1,

"over": 1,

"lazy": 1,

"dog": 1

}

```

## The Approach

One way to approach this problem is to iterate over each word in the `words` list and count how many times it appears in the `text` string. We can do this by iterating over each character in the `text` string, checking if the current character matches the current word we're counting, and incrementing our count if it does.

## The Implementation

We can implement this approach as follows:

```python

from typing import List

def word_count(text: str, words: List[str]) -> dict:

word_counts = {}

for word in words:

count = 0

for char in text:

if char.lower() == word.lower():

count += 1

word_counts[word] = count

return word_counts

```