小编Vai*_*v79的帖子

我是颤振新手，一直在尝试制作一个简单的测验应用程序。我遇到了错误，但不确定出了什么问题。

错误：

Compiler message:                                                       
lib/main.dart:37:17: Error: The method 'Answer' isn't defined for the class '_MyAppState'.
 - '_MyAppState' is from 'package:project2/main.dart' ('lib/main.dart').
Try correcting the name to the name of an existing method, or defining a method named 'Answer'.
                Answer(),                                               
                ^^^^^^                                                  
lib/main.dart:38:17: Error: The method 'Answer' isn't defined for the class '_MyAppState'.
 - '_MyAppState' is from 'package:project2/main.dart' ('lib/main.dart').
Try correcting the name to the name of an existing method, or defining a method named 'Answer'.
                Answer(),                                               
                ^^^^^^                                                  
lib/main.dart:39:17: Error: The method …

我正在尝试使用网络工作者在 React 应用程序的后台运行人脸检测过程。我正在使用一个名为的库face-api.js来进行人脸检测。但我不确定如何导入这个库以在我的worker.js文件中使用。

工人.js

    import * as faceapi from 'face-api.js';
    
    this.onmessage = (e) => {
      console.log("Message from worker.js");
      this.postMessage('Hello Main')   
    };

测试组件.js

import React, {useEffect} from 'react'

function TestComponent() {

    useEffect(() => {
        const worker = new Worker('./workers/worker.js')
        worker.postMessage('Hello Worker')
        worker.onmessage = e => {
        console.log('Message received from worker:', e.data)
    }
    }
    );

    return (
        <div>
            <h1> Test Component </h1>
        </div>
    )
    }


export default TestComponent

我运行此测试代码，在 chrome 上收到以下错误：

 /workers/worker.js:1 Uncaught SyntaxError: Cannot use import statement …

这是一个简单的冒泡排序算法，是我较大程序的一部分，旨在对双精度数组进行排序。我以前尝试使用合并排序对相同的值进行排序，但得到了相同的输出。我真的没有注意到我错过了什么。有人可以指出我提前谢谢！

#include<iostream>
#include<iomanip>

using namespace std;

int const POINTS = 5;
double dataPoints[POINTS] = { 0.1, 0.5, 0.6, 0.2, 0.8 };

void sort(double dataPoints[])
{
    int i, j, flag = 1;    
    int temp;             
    for (i = 1; (i <= POINTS) && flag; i++)
    {
        flag = 0;
        for (j = 0; j < (POINTS - 1); j++)
        {
            if (dataPoints[j + 1] > dataPoints[j])      
            {
                temp = dataPoints[j];             
                dataPoints[j] = dataPoints[j + 1];
                dataPoints[j + 1] = temp;
                flag = …