小编Vis*_*udi的帖子

我想为卡片类实现一个水平滚动条，如本例所示。我试过，overflow-x:scroll但没有走运。任何人都可以建议我如何实现滚动条以使卡片水平流动？谢谢

.card {
  float: left;
  width: 33.333%;
  padding: .75rem;
  margin-bottom: 2rem;
  border: 0;
}

.card > img {
  margin-bottom: .75rem;
}

.card-text {
  font-size: 85%;
}

<div class="container">
  <div class="row">
    <div class="card">
      <img src="http://placehold.it/200x150">
      <p class="card-text">This is a wider card with supporting text below as a natural lead-in to additional content. This content is a little bit longer.</p>
    </div>
    <div class="card">
      <img src="http://placehold.it/200x150">
      <p class="card-text">This is a wider card with supporting text below as a natural lead-in to …

我正在编写一个在初始化时接受整数输入列表的类。该类有很多排序方法。我想添加一个装饰器，它会在每次方法调用之前对输入列表进行洗牌。当尝试实现递归冒泡排序时，装饰器会导致RecursionError: maximum recursion depth exceeded in comparison

我尝试传递 self 参数，以便装饰器可以访问类变量。但是我需要有关如何让递归函数与装饰器一起使用的帮助

import functools
from searching import timer
import random


def shuffle(func):
    @functools.wraps(func)
    def wrapper(self, *args, **kwargs):
        random.shuffle(self.ip_list)
        value = func(self, *args, **kwargs)
        return value
    return wrapper


class sorting:
    def __init__(self, ip_list):
        self.ip_list = ip_list
        self.n = len(self.ip_list)
        self.timer_dict = {}

    @shuffle
    @timer
    def recursive_bubble_sort(self):
        print(self.ip_list)
        for j in range(self.n):
            try:
                if self.ip_list[j] > self.ip_list[j+1]:
                    self.ip_list[j], self.ip_list[j + 1] = self.ip_list[j + 1], self.ip_list[j]
                    self.recursive_bubble_sort()
            except IndexError:
                pass
        print(self.ip_list)


x = …