How do I search the Usenet archives only in Google Groups?

When I use the search function in Google Groups, the results contain not only Usenet posts, but also Google Groups posts. Is there a way to exclude Google Groups posts from the search results? I only want to search the Usenet archives through the Google Groups web interface.

javascript – How to encode spaces in sharepoint 2013 search rest api url?

In a sharepoint 2013 search rest url, I have multiple columns to filter on, but some of the values have spaces, but it seems spaces are used to delimit the filters. How can I encode spaces? See this for an example

This gets 0 record

http://mysite/_api/search/query?querytext='contenttype:News Page Channel:Corporate'&rowlimit=1

While both of these get 1


http://mysite/_api/search/query?querytext='contenttype:News Page'&rowlimit=1

There is a space in News Page btw.

How can I encode it?


google sheets – Search multiple columns for one value

This is roughly what my table looks like:

A            B               C               D               E               F

Name    |Ingredient 1   |Ingredient 2   |Ingredient 3   |Ingredient 4   |Ingredient 5

Dish 1  |flour          |tomato         |potato         |eggs           |wine

Dish 2  |eggs           |onion          |capsicum       |tomato         |pasta

Dish 3  |flour          |eggs           |dill           |chicken        |pork

What I want is to search for the ingredient, and get a result of all the dishes that contain that particular ingredient or even highlight the dish name. Each ingredient is in a different column and not in any sorted order.
E.g. suppose I enter in another cell somewhere (or in another sheet) the word tomato, then all the dishes that contain that ingredient should show up. Is that possible with google sheets? This will be a constantly growing table.

magento2.3 – Search $block->getData(‘configProvider’) in returns null after upgrade to 2.3.6

In 2.3.6, the following line was added to

$configProvider = $block->getData('configProvider');

Since the upgrade, this returns null and causes a fatal error due to this subsequent call on the null object:


Uncaught Error: Call to a member function isSuggestionsAllowed() on null

My site uses a custom module that adds notices during shipping and checkout using blocks. This module is causing the fatal error, but it shouldn’t have anything to do with the search block.

I need to change the module di.xml file or custom class to return a configProvider for search, or tell it to use the default class. Can anyone point me the right direction? Many thanks.

Here is my code:


<config xmlns:xsi=""
    <type name="MagentoCheckoutModelCompositeConfigProvider">
            <argument name="configProviders" xsi:type="array">
                <item name="cms_block_config_provider" xsi:type="object">Port80CIBCModelConfigProvider</item>
    <preference for="MagentoCustomerModelVat" type="Port80CIBCModelCustomerVat" />


use MagentoCheckoutModelConfigProviderInterface;
use MagentoFrameworkViewLayoutInterface;

class ConfigProvider implements ConfigProviderInterface
    /** @var LayoutInterface  */
    protected $_layout;

    public function __construct(LayoutInterface $layout)
        $this->_layout = $layout;

    public function getConfig()
        return (
            'payment_notices' => $this->_layout->createBlock('MagentoCmsBlockBlock')->setBlockId('checkout_payment_notices')->toHtml(),
            'shipping_notices' => $this->_layout->createBlock('MagentoCmsBlockBlock')->setBlockId('checkout_shipping_notices')->toHtml()

python – Approximation search source reconstruction localization algorithm


To determine the coordinates of some signal source in a 3D space, given the coordinates of four observers and the time at which each saw the signal, as well as the velocity of the signal.


The algorithm is more-or-less comprised of two pieces: the approximation search algorithm, and the localization algorithm. Approximation search can be described simply as follows:

Suppose we have some function, f(x), and we want to find an x such that f(x) = y. We begin by choosing some search interval, (xi, xf), and we probe some evenly-spaced points along this interval with some step, da. We remember the point with the least error, and feed that error back into the algorithm. We recursively increase accuracy, reducing da and restricting the search interval to around each progressively better solution. We stop when we’ve reached the maximum number of iterations (configurable).

The localization bit is simply the computation of the error. I could explain it, however I find that the code does so itself far better than I could hope to in words.


In my opinion, the code is a bit messy and slightly more difficult to read than I’d like. Similarly, I’m not sure how I feel about the nested loops. Of course, I don’t want to overcomplicate things simply to get rid of nested loops, however if there’s a nicer way to do this, I’m all ears.

It’s also slow. This is Python, of course, so I shouldn’t expect it to perform like a similarly implemented algorithm in, say, C/C++, however I’m certainly interested in increasing search speed.

Lastly, it’s been a while since I’ve done anything in Python, so I’m interested in a critique of my style. The goal is readability, and not necessarily ‘standards’ compliance.

Tear it apart. Don’t hold back!

import math
from dataclasses import dataclass

class Approximate:

    ai: float;  af: float
    da: float;   n : int

    # Default values
    aa: float = 0
    ei: float = -1
    a : float = 0
    e : float = 0
    i : int   = 0

    done: bool = False
    stop: bool = False

    def step(self):

        if (self.ei < 0) or (self.ei > self.e):

            self.ei = self.e
            self.aa = self.a

        if (self.stop):

            self.i += 1

            if (self.i >= self.n):

                self.done = True
                self.a = self.aa

                return  # Max iter

            # Restrict to window around 'solution'
   = self.aa - self.da
   = self.aa + self.da

            self.a =

            # Increase accuracy
            self.da *= 0.1
   += self.da
   -= self.da

            self.stop = False


            # Probe some points in (ai,af) with step da
            self.a = self.a + self.da

            if (self.a >

                self.a =
                self.stop = True

def localize(recv):

    ax = Approximate(0, 5000, 32, 10)
    ay = Approximate(0, 5000, 32, 10)
    az = Approximate(0, 5000, 32, 10)

    dt = (0, 0, 0, 0)

    while not ax.done:
        ay = Approximate(0, 5000, 32, 10, 0, 0)

        while not ay.done:
            az = Approximate(0, 5000, 32, 10, 0, 0)

            while not az.done:

                for i in range(4):
                    x = recv(i)(0) - ax.a
                    y = recv(i)(1) - ay.a
                    z = recv(i)(2) - az.a

                    baseline = math.sqrt((x * x) + (y * y) + (z * z))

                    dt(i) = baseline / 299800000

                    # Normalize times into deltas from zero
                baseline = min(dt(0), dt(1), dt(2), dt(3))

                for j in range(4):
                    dt(j) -= baseline

                error = 0

                for k in range(4):
                    error += math.fabs(recv(k)(2) - dt(k))
                    ay.e = error
                    ax.e = error




    # Found solution

How Has Hummingbird Changed The Landscape Of Search?

How has Hummingbird changed the landscape of search?

Web Development Company in Bangalore | Web Design Company in Bangalore | Website Designing Company in Bangalore

55 Manual Web Profile backlinks from DA70+ websites to Rank higher in Search result for $5

55 Manual Web Profile backlinks from DA70+ websites to Rank higher in Search result

Profile Creation is a process of registering an account with an individual/business name on different websites including social media, Forums, Classified sites, Web 2.0, Video sites, and image sharing sites etc.

Being authoritive websites, these profiles gains higher visibility in major search engines like Google, Yahoo, Bing etc. It helps you dominate Google search results for your own/business name.

Package Detail:

In this Package you will get:

55 Manual Web Profile backlinks from DA70+ websites to Rank higher in Search result

  • Manually work
  • Permanent Links
  • Unique 500+ spun words relevant article in all posts
  • Life time support
  • Login detail to modify these backlinks in future


sharepoint online – How can I search for sites within my hub using PnP Modern Search?

We have about 20 departments with about 100 sites (average) connected to each department. So, that is a total of some 2.000 sites. Per department I have a hub site and like to use PnP Modern Search to list my sites connected to the hub. I use three web parts: a search result web part, a search box to search (optional) for site title, and a filter web part to filter the sites from the result set. The filter uses several properties from the site property bag. The hub represents all sites of some department.
At this moment I use this in the Query Template

SiteTitle:{searchTerms} AND contentclass:STS_site

Now I get all sites. Of course, trimmed-search makes sure I see only the sites I can access, so I do not see all 2.000 sites. But I want to see only my sites of my department.

What do I need to add to the query to be able to filter for sites connected to this hub?

The alternative is to add a site property to group the sites that belong to a department, but that is a lot of maintenance effort when a department changes the name or when any other organisation change takes place. Just working with the hub-structure seems the best way.

algorithm – JavaScript Symbol Table implementation using Binary Search

I’m currently going over Robert Sedgewick’s Algorithms book. I implemented a Symbol Table using two parallel arrays one for keys and one for values. The keys array is ordered and the Symbol Table uses binary search to find the position of the elements in the array.

In the practice section, the implementation of the delete and floor method were left as exercises. Here are the directions for delete and floor:

enter image description here
enter image description here

I would like to see if there is any feedback in the implementation of those elements. Specially floor.

I come from Ruby, so any feedback regarding best practices in JavaScript is also welcome.

Here is the code:

class BinarySearchSt {
  constructor() {
    this.n = 0;
    this.keys = ();
    this.vals = ();

  isEmpty() {
    return this.n === 0;

  get(key) {
    if(this.isEmpty() === true) {
      return null;

    let i = this.rank(key);

    if (i < this.n && this.keys(i) === key) {
      return this.vals(i);
    } else {
      return null;

  put(key, val) {
    let i = this.rank(key);
    if(i < this.n && this.keys(i) === key) {
      return this.vals(i) = val;

    for(let j = this.n; j > i; j--) {
      this.keys(j) = this.keys(j - 1);
      this.vals(j) = this.vals(j - 1);
    this.keys(i) = key;
    this.vals(i) = val;

  rank(key) {
    let lo = 0;
    let hi = this.n - 1;

    while(lo <= hi) {
      let mid = lo + Math.floor((hi - lo) / 2);
      let cmp = this.compareTo(key, this.keys(mid));
      if(cmp < 0) {
        hi = mid - 1;
      } else if(cmp > 0) {
        lo = mid + 1;
      } else {
        return mid;
    return lo;

  compareTo(val1, val2) {
    if((val1 === null || val2 === null) || (typeof val1 !== typeof val2)) {
      return null;
    if (typeof val1 === 'string') {
      return (val1).localeCompare(val2);
    } else {
      if(val1 > val2){
        return 1;
      } else if (val1 < val2) {
        return -1;
      return 0;

  min() {
    return this.keys(0);

  max() {
    return this.keys(-1)

  select(index) {
    return this.keys(index);

  ceiling(key) {
    let i = this.rank(key);
    return this.keys(i);

  floor(key) {
    if(this.n === 0) {
      throw 'noSuchElementException';
    if(key === null) {
      throw 'ilegalArgumentException';
    let i = this.rank(key);
    if(this.keys(i) === key || i === 0){
      return this.keys(i);
    else {
      return this.keys(i - 1);

  delete(key) {
    if(key === null) { throw 'ilegalArgumentException' };
    let i = this.rank(key);
    this.keys.splice(i, 1);
    this.vals.splice(i, 1);

const bst = new BinarySearchSt();

bst.put('s', 0)
bst.put('e', 1)
bst.put('a', 2)
bst.put('r', 3)
bst.put('c', 4)
bst.put('h', 5)
bst.put('e', 6)
bst.put('x', 7)
bst.put('a', 8)
bst.put('m', 9)
bst.put('p', 10)
bst.put('l', 11)
bst.put('e', 12)


sharepoint server – Configure search service to search only by pages content excluding CreatedBy(Aurhor field)

I have several Search Result Sources configured in CA.

For example result source Documents(search by documents) and Pages(search by Pages content type).

I have custom spfx search results web part.
Web part sends 2 REST API requests to search service including sourceId(sourceId=Result source guid) property.

I need search by CreatedBy field in Documents area and I don’t need search by CreatedBy in Pages area.

There are hundred of sites and webs.

How I can achieve this? – Search by CreatedBy for Documents result source and Search only by page content for Pages result source.

UPD. I tried to manipulate selectProperties parameter but it wasn’t helpful.